inqueue.c 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228
  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, write to
  28. * the Free Software Foundation, 59 Temple Place - Suite 330,
  29. * Boston, MA 02111-1307, USA.
  30. *
  31. * Please send any bug reports or fixes you make to the
  32. * email address(es):
  33. * lksctp developers <lksctp-developers@lists.sourceforge.net>
  34. *
  35. * Or submit a bug report through the following website:
  36. * http://www.sf.net/projects/lksctp
  37. *
  38. * Written or modified by:
  39. * La Monte H.P. Yarroll <piggy@acm.org>
  40. * Karl Knutson <karl@athena.chicago.il.us>
  41. *
  42. * Any bugs reported given to us we will try to fix... any fixes shared will
  43. * be incorporated into the next SCTP release.
  44. */
  45. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  46. #include <net/sctp/sctp.h>
  47. #include <net/sctp/sm.h>
  48. #include <linux/interrupt.h>
  49. #include <linux/slab.h>
  50. /* Initialize an SCTP inqueue. */
  51. void sctp_inq_init(struct sctp_inq *queue)
  52. {
  53. INIT_LIST_HEAD(&queue->in_chunk_list);
  54. queue->in_progress = NULL;
  55. /* Create a task for delivering data. */
  56. INIT_WORK(&queue->immediate, NULL);
  57. queue->malloced = 0;
  58. }
  59. /* Release the memory associated with an SCTP inqueue. */
  60. void sctp_inq_free(struct sctp_inq *queue)
  61. {
  62. struct sctp_chunk *chunk, *tmp;
  63. /* Empty the queue. */
  64. list_for_each_entry_safe(chunk, tmp, &queue->in_chunk_list, list) {
  65. list_del_init(&chunk->list);
  66. sctp_chunk_free(chunk);
  67. }
  68. /* If there is a packet which is currently being worked on,
  69. * free it as well.
  70. */
  71. if (queue->in_progress) {
  72. sctp_chunk_free(queue->in_progress);
  73. queue->in_progress = NULL;
  74. }
  75. if (queue->malloced) {
  76. /* Dump the master memory segment. */
  77. kfree(queue);
  78. }
  79. }
  80. /* Put a new packet in an SCTP inqueue.
  81. * We assume that packet->sctp_hdr is set and in host byte order.
  82. */
  83. void sctp_inq_push(struct sctp_inq *q, struct sctp_chunk *chunk)
  84. {
  85. /* Directly call the packet handling routine. */
  86. if (chunk->rcvr->dead) {
  87. sctp_chunk_free(chunk);
  88. return;
  89. }
  90. /* We are now calling this either from the soft interrupt
  91. * or from the backlog processing.
  92. * Eventually, we should clean up inqueue to not rely
  93. * on the BH related data structures.
  94. */
  95. list_add_tail(&chunk->list, &q->in_chunk_list);
  96. q->immediate.func(&q->immediate);
  97. }
  98. /* Peek at the next chunk on the inqeue. */
  99. struct sctp_chunkhdr *sctp_inq_peek(struct sctp_inq *queue)
  100. {
  101. struct sctp_chunk *chunk;
  102. sctp_chunkhdr_t *ch = NULL;
  103. chunk = queue->in_progress;
  104. /* If there is no more chunks in this packet, say so */
  105. if (chunk->singleton ||
  106. chunk->end_of_packet ||
  107. chunk->pdiscard)
  108. return NULL;
  109. ch = (sctp_chunkhdr_t *)chunk->chunk_end;
  110. return ch;
  111. }
  112. /* Extract a chunk from an SCTP inqueue.
  113. *
  114. * WARNING: If you need to put the chunk on another queue, you need to
  115. * make a shallow copy (clone) of it.
  116. */
  117. struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
  118. {
  119. struct sctp_chunk *chunk;
  120. sctp_chunkhdr_t *ch = NULL;
  121. /* The assumption is that we are safe to process the chunks
  122. * at this time.
  123. */
  124. if ((chunk = queue->in_progress)) {
  125. /* There is a packet that we have been working on.
  126. * Any post processing work to do before we move on?
  127. */
  128. if (chunk->singleton ||
  129. chunk->end_of_packet ||
  130. chunk->pdiscard) {
  131. sctp_chunk_free(chunk);
  132. chunk = queue->in_progress = NULL;
  133. } else {
  134. /* Nothing to do. Next chunk in the packet, please. */
  135. ch = (sctp_chunkhdr_t *) chunk->chunk_end;
  136. /* Force chunk->skb->data to chunk->chunk_end. */
  137. skb_pull(chunk->skb, chunk->chunk_end - chunk->skb->data);
  138. /* We are guaranteed to pull a SCTP header. */
  139. }
  140. }
  141. /* Do we need to take the next packet out of the queue to process? */
  142. if (!chunk) {
  143. struct list_head *entry;
  144. /* Is the queue empty? */
  145. if (list_empty(&queue->in_chunk_list))
  146. return NULL;
  147. entry = queue->in_chunk_list.next;
  148. chunk = queue->in_progress =
  149. list_entry(entry, struct sctp_chunk, list);
  150. list_del_init(entry);
  151. /* This is the first chunk in the packet. */
  152. chunk->singleton = 1;
  153. ch = (sctp_chunkhdr_t *) chunk->skb->data;
  154. chunk->data_accepted = 0;
  155. }
  156. chunk->chunk_hdr = ch;
  157. chunk->chunk_end = ((__u8 *)ch) + WORD_ROUND(ntohs(ch->length));
  158. /* In the unlikely case of an IP reassembly, the skb could be
  159. * non-linear. If so, update chunk_end so that it doesn't go past
  160. * the skb->tail.
  161. */
  162. if (unlikely(skb_is_nonlinear(chunk->skb))) {
  163. if (chunk->chunk_end > skb_tail_pointer(chunk->skb))
  164. chunk->chunk_end = skb_tail_pointer(chunk->skb);
  165. }
  166. skb_pull(chunk->skb, sizeof(sctp_chunkhdr_t));
  167. chunk->subh.v = NULL; /* Subheader is no longer valid. */
  168. if (chunk->chunk_end + sizeof(sctp_chunkhdr_t) <
  169. skb_tail_pointer(chunk->skb)) {
  170. /* This is not a singleton */
  171. chunk->singleton = 0;
  172. } else if (chunk->chunk_end > skb_tail_pointer(chunk->skb)) {
  173. /* Discard inside state machine. */
  174. chunk->pdiscard = 1;
  175. chunk->chunk_end = skb_tail_pointer(chunk->skb);
  176. } else {
  177. /* We are at the end of the packet, so mark the chunk
  178. * in case we need to send a SACK.
  179. */
  180. chunk->end_of_packet = 1;
  181. }
  182. SCTP_DEBUG_PRINTK("+++sctp_inq_pop+++ chunk %p[%s],"
  183. " length %d, skb->len %d\n",chunk,
  184. sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)),
  185. ntohs(chunk->chunk_hdr->length), chunk->skb->len);
  186. return chunk;
  187. }
  188. /* Set a top-half handler.
  189. *
  190. * Originally, we the top-half handler was scheduled as a BH. We now
  191. * call the handler directly in sctp_inq_push() at a time that
  192. * we know we are lock safe.
  193. * The intent is that this routine will pull stuff out of the
  194. * inqueue and process it.
  195. */
  196. void sctp_inq_set_th_handler(struct sctp_inq *q, work_func_t callback)
  197. {
  198. INIT_WORK(&q->immediate, callback);
  199. }