inqueue.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210
  1. /* SCTP kernel reference 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 reference 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. * The SCTP reference 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. * The SCTP reference 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. #include <net/sctp/sctp.h>
  46. #include <net/sctp/sm.h>
  47. #include <linux/interrupt.h>
  48. /* Initialize an SCTP inqueue. */
  49. void sctp_inq_init(struct sctp_inq *queue)
  50. {
  51. INIT_LIST_HEAD(&queue->in_chunk_list);
  52. queue->in_progress = NULL;
  53. /* Create a task for delivering data. */
  54. INIT_WORK(&queue->immediate, NULL, NULL);
  55. queue->malloced = 0;
  56. }
  57. /* Release the memory associated with an SCTP inqueue. */
  58. void sctp_inq_free(struct sctp_inq *queue)
  59. {
  60. struct sctp_chunk *chunk, *tmp;
  61. /* Empty the queue. */
  62. list_for_each_entry_safe(chunk, tmp, &queue->in_chunk_list, list) {
  63. list_del_init(&chunk->list);
  64. sctp_chunk_free(chunk);
  65. }
  66. /* If there is a packet which is currently being worked on,
  67. * free it as well.
  68. */
  69. if (queue->in_progress)
  70. sctp_chunk_free(queue->in_progress);
  71. if (queue->malloced) {
  72. /* Dump the master memory segment. */
  73. kfree(queue);
  74. }
  75. }
  76. /* Put a new packet in an SCTP inqueue.
  77. * We assume that packet->sctp_hdr is set and in host byte order.
  78. */
  79. void sctp_inq_push(struct sctp_inq *q, struct sctp_chunk *packet)
  80. {
  81. /* Directly call the packet handling routine. */
  82. /* We are now calling this either from the soft interrupt
  83. * or from the backlog processing.
  84. * Eventually, we should clean up inqueue to not rely
  85. * on the BH related data structures.
  86. */
  87. list_add_tail(&packet->list, &q->in_chunk_list);
  88. q->immediate.func(q->immediate.data);
  89. }
  90. /* Extract a chunk from an SCTP inqueue.
  91. *
  92. * WARNING: If you need to put the chunk on another queue, you need to
  93. * make a shallow copy (clone) of it.
  94. */
  95. struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
  96. {
  97. struct sctp_chunk *chunk;
  98. sctp_chunkhdr_t *ch = NULL;
  99. /* The assumption is that we are safe to process the chunks
  100. * at this time.
  101. */
  102. if ((chunk = queue->in_progress)) {
  103. /* There is a packet that we have been working on.
  104. * Any post processing work to do before we move on?
  105. */
  106. if (chunk->singleton ||
  107. chunk->end_of_packet ||
  108. chunk->pdiscard) {
  109. sctp_chunk_free(chunk);
  110. chunk = queue->in_progress = NULL;
  111. } else {
  112. /* Nothing to do. Next chunk in the packet, please. */
  113. ch = (sctp_chunkhdr_t *) chunk->chunk_end;
  114. /* Force chunk->skb->data to chunk->chunk_end. */
  115. skb_pull(chunk->skb,
  116. chunk->chunk_end - chunk->skb->data);
  117. }
  118. }
  119. /* Do we need to take the next packet out of the queue to process? */
  120. if (!chunk) {
  121. struct list_head *entry;
  122. /* Is the queue empty? */
  123. if (list_empty(&queue->in_chunk_list))
  124. return NULL;
  125. entry = queue->in_chunk_list.next;
  126. chunk = queue->in_progress =
  127. list_entry(entry, struct sctp_chunk, list);
  128. list_del_init(entry);
  129. /* This is the first chunk in the packet. */
  130. chunk->singleton = 1;
  131. ch = (sctp_chunkhdr_t *) chunk->skb->data;
  132. }
  133. chunk->chunk_hdr = ch;
  134. chunk->chunk_end = ((__u8 *)ch) + WORD_ROUND(ntohs(ch->length));
  135. /* In the unlikely case of an IP reassembly, the skb could be
  136. * non-linear. If so, update chunk_end so that it doesn't go past
  137. * the skb->tail.
  138. */
  139. if (unlikely(skb_is_nonlinear(chunk->skb))) {
  140. if (chunk->chunk_end > chunk->skb->tail)
  141. chunk->chunk_end = chunk->skb->tail;
  142. }
  143. skb_pull(chunk->skb, sizeof(sctp_chunkhdr_t));
  144. chunk->subh.v = NULL; /* Subheader is no longer valid. */
  145. if (chunk->chunk_end < chunk->skb->tail) {
  146. /* This is not a singleton */
  147. chunk->singleton = 0;
  148. } else if (chunk->chunk_end > chunk->skb->tail) {
  149. /* RFC 2960, Section 6.10 Bundling
  150. *
  151. * Partial chunks MUST NOT be placed in an SCTP packet.
  152. * If the receiver detects a partial chunk, it MUST drop
  153. * the chunk.
  154. *
  155. * Since the end of the chunk is past the end of our buffer
  156. * (which contains the whole packet, we can freely discard
  157. * the whole packet.
  158. */
  159. sctp_chunk_free(chunk);
  160. chunk = queue->in_progress = NULL;
  161. return NULL;
  162. } else {
  163. /* We are at the end of the packet, so mark the chunk
  164. * in case we need to send a SACK.
  165. */
  166. chunk->end_of_packet = 1;
  167. }
  168. SCTP_DEBUG_PRINTK("+++sctp_inq_pop+++ chunk %p[%s],"
  169. " length %d, skb->len %d\n",chunk,
  170. sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)),
  171. ntohs(chunk->chunk_hdr->length), chunk->skb->len);
  172. return chunk;
  173. }
  174. /* Set a top-half handler.
  175. *
  176. * Originally, we the top-half handler was scheduled as a BH. We now
  177. * call the handler directly in sctp_inq_push() at a time that
  178. * we know we are lock safe.
  179. * The intent is that this routine will pull stuff out of the
  180. * inqueue and process it.
  181. */
  182. void sctp_inq_set_th_handler(struct sctp_inq *q,
  183. void (*callback)(void *), void *arg)
  184. {
  185. INIT_WORK(&q->immediate, callback, arg);
  186. }