inqueue.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215
  1. /* SCTP kernel implementation
  2. * Copyright (c) 1999-2000 Cisco, Inc.
  3. * Copyright (c) 1999-2001 Motorola, Inc.
  4. * Copyright (c) 2002 International Business Machines, Corp.
  5. *
  6. * This file is part of the SCTP kernel implementation
  7. *
  8. * These functions are the methods for accessing the SCTP inqueue.
  9. *
  10. * An SCTP inqueue is a queue into which you push SCTP packets
  11. * (which might be bundles or fragments of chunks) and out of which you
  12. * pop SCTP whole chunks.
  13. *
  14. * This SCTP implementation is free software;
  15. * you can redistribute it and/or modify it under the terms of
  16. * the GNU General Public License as published by
  17. * the Free Software Foundation; either version 2, or (at your option)
  18. * any later version.
  19. *
  20. * This SCTP implementation is distributed in the hope that it
  21. * will be useful, but WITHOUT ANY WARRANTY; without even the implied
  22. * ************************
  23. * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  24. * See the GNU General Public License for more details.
  25. *
  26. * You should have received a copy of the GNU General Public License
  27. * along with GNU CC; see the file COPYING. If not, see
  28. * <http://www.gnu.org/licenses/>.
  29. *
  30. * Please send any bug reports or fixes you make to the
  31. * email address(es):
  32. * lksctp developers <linux-sctp@vger.kernel.org>
  33. *
  34. * Written or modified by:
  35. * La Monte H.P. Yarroll <piggy@acm.org>
  36. * Karl Knutson <karl@athena.chicago.il.us>
  37. */
  38. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  39. #include <net/sctp/sctp.h>
  40. #include <net/sctp/sm.h>
  41. #include <linux/interrupt.h>
  42. #include <linux/slab.h>
  43. /* Initialize an SCTP inqueue. */
  44. void sctp_inq_init(struct sctp_inq *queue)
  45. {
  46. INIT_LIST_HEAD(&queue->in_chunk_list);
  47. queue->in_progress = NULL;
  48. /* Create a task for delivering data. */
  49. INIT_WORK(&queue->immediate, NULL);
  50. }
  51. /* Release the memory associated with an SCTP inqueue. */
  52. void sctp_inq_free(struct sctp_inq *queue)
  53. {
  54. struct sctp_chunk *chunk, *tmp;
  55. /* Empty the queue. */
  56. list_for_each_entry_safe(chunk, tmp, &queue->in_chunk_list, list) {
  57. list_del_init(&chunk->list);
  58. sctp_chunk_free(chunk);
  59. }
  60. /* If there is a packet which is currently being worked on,
  61. * free it as well.
  62. */
  63. if (queue->in_progress) {
  64. sctp_chunk_free(queue->in_progress);
  65. queue->in_progress = NULL;
  66. }
  67. }
  68. /* Put a new packet in an SCTP inqueue.
  69. * We assume that packet->sctp_hdr is set and in host byte order.
  70. */
  71. void sctp_inq_push(struct sctp_inq *q, struct sctp_chunk *chunk)
  72. {
  73. /* Directly call the packet handling routine. */
  74. if (chunk->rcvr->dead) {
  75. sctp_chunk_free(chunk);
  76. return;
  77. }
  78. /* We are now calling this either from the soft interrupt
  79. * or from the backlog processing.
  80. * Eventually, we should clean up inqueue to not rely
  81. * on the BH related data structures.
  82. */
  83. list_add_tail(&chunk->list, &q->in_chunk_list);
  84. if (chunk->asoc)
  85. chunk->asoc->stats.ipackets++;
  86. q->immediate.func(&q->immediate);
  87. }
  88. /* Peek at the next chunk on the inqeue. */
  89. struct sctp_chunkhdr *sctp_inq_peek(struct sctp_inq *queue)
  90. {
  91. struct sctp_chunk *chunk;
  92. sctp_chunkhdr_t *ch = NULL;
  93. chunk = queue->in_progress;
  94. /* If there is no more chunks in this packet, say so */
  95. if (chunk->singleton ||
  96. chunk->end_of_packet ||
  97. chunk->pdiscard)
  98. return NULL;
  99. ch = (sctp_chunkhdr_t *)chunk->chunk_end;
  100. return ch;
  101. }
  102. /* Extract a chunk from an SCTP inqueue.
  103. *
  104. * WARNING: If you need to put the chunk on another queue, you need to
  105. * make a shallow copy (clone) of it.
  106. */
  107. struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
  108. {
  109. struct sctp_chunk *chunk;
  110. sctp_chunkhdr_t *ch = NULL;
  111. /* The assumption is that we are safe to process the chunks
  112. * at this time.
  113. */
  114. if ((chunk = queue->in_progress)) {
  115. /* There is a packet that we have been working on.
  116. * Any post processing work to do before we move on?
  117. */
  118. if (chunk->singleton ||
  119. chunk->end_of_packet ||
  120. chunk->pdiscard) {
  121. sctp_chunk_free(chunk);
  122. chunk = queue->in_progress = NULL;
  123. } else {
  124. /* Nothing to do. Next chunk in the packet, please. */
  125. ch = (sctp_chunkhdr_t *) chunk->chunk_end;
  126. /* Force chunk->skb->data to chunk->chunk_end. */
  127. skb_pull(chunk->skb, chunk->chunk_end - chunk->skb->data);
  128. /* We are guaranteed to pull a SCTP header. */
  129. }
  130. }
  131. /* Do we need to take the next packet out of the queue to process? */
  132. if (!chunk) {
  133. struct list_head *entry;
  134. /* Is the queue empty? */
  135. if (list_empty(&queue->in_chunk_list))
  136. return NULL;
  137. entry = queue->in_chunk_list.next;
  138. chunk = queue->in_progress =
  139. list_entry(entry, struct sctp_chunk, list);
  140. list_del_init(entry);
  141. /* This is the first chunk in the packet. */
  142. chunk->singleton = 1;
  143. ch = (sctp_chunkhdr_t *) chunk->skb->data;
  144. chunk->data_accepted = 0;
  145. }
  146. chunk->chunk_hdr = ch;
  147. chunk->chunk_end = ((__u8 *)ch) + WORD_ROUND(ntohs(ch->length));
  148. /* In the unlikely case of an IP reassembly, the skb could be
  149. * non-linear. If so, update chunk_end so that it doesn't go past
  150. * the skb->tail.
  151. */
  152. if (unlikely(skb_is_nonlinear(chunk->skb))) {
  153. if (chunk->chunk_end > skb_tail_pointer(chunk->skb))
  154. chunk->chunk_end = skb_tail_pointer(chunk->skb);
  155. }
  156. skb_pull(chunk->skb, sizeof(sctp_chunkhdr_t));
  157. chunk->subh.v = NULL; /* Subheader is no longer valid. */
  158. if (chunk->chunk_end + sizeof(sctp_chunkhdr_t) <
  159. skb_tail_pointer(chunk->skb)) {
  160. /* This is not a singleton */
  161. chunk->singleton = 0;
  162. } else if (chunk->chunk_end > skb_tail_pointer(chunk->skb)) {
  163. /* Discard inside state machine. */
  164. chunk->pdiscard = 1;
  165. chunk->chunk_end = skb_tail_pointer(chunk->skb);
  166. } else {
  167. /* We are at the end of the packet, so mark the chunk
  168. * in case we need to send a SACK.
  169. */
  170. chunk->end_of_packet = 1;
  171. }
  172. pr_debug("+++sctp_inq_pop+++ chunk:%p[%s], length:%d, skb->len:%d\n",
  173. chunk, sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)),
  174. ntohs(chunk->chunk_hdr->length), chunk->skb->len);
  175. return chunk;
  176. }
  177. /* Set a top-half handler.
  178. *
  179. * Originally, we the top-half handler was scheduled as a BH. We now
  180. * call the handler directly in sctp_inq_push() at a time that
  181. * we know we are lock safe.
  182. * The intent is that this routine will pull stuff out of the
  183. * inqueue and process it.
  184. */
  185. void sctp_inq_set_th_handler(struct sctp_inq *q, work_func_t callback)
  186. {
  187. INIT_WORK(&q->immediate, callback);
  188. }