inqueue.c 6.51 KB
Newer Older
Linus Torvalds's avatar
Linus Torvalds committed
1
2
3
4
/* SCTP kernel reference Implementation
 * Copyright (c) 1999-2000 Cisco, Inc.
 * Copyright (c) 1999-2001 Motorola, Inc.
 * Copyright (c) 2002 International Business Machines, Corp.
5
 *
Linus Torvalds's avatar
Linus Torvalds committed
6
 * This file is part of the SCTP kernel reference Implementation
7
 *
Linus Torvalds's avatar
Linus Torvalds committed
8
9
10
11
12
 * These functions are the methods for accessing the SCTP inqueue.
 *
 * An SCTP inqueue is a queue into which you push SCTP packets
 * (which might be bundles or fragments of chunks) and out of which you
 * pop SCTP whole chunks.
13
14
15
 *
 * The SCTP reference implementation is free software;
 * you can redistribute it and/or modify it under the terms of
Linus Torvalds's avatar
Linus Torvalds committed
16
17
18
 * the GNU General Public License as published by
 * the Free Software Foundation; either version 2, or (at your option)
 * any later version.
19
20
 *
 * The SCTP reference implementation is distributed in the hope that it
Linus Torvalds's avatar
Linus Torvalds committed
21
22
23
24
 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
 *                 ************************
 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU General Public License for more details.
25
 *
Linus Torvalds's avatar
Linus Torvalds committed
26
27
28
 * You should have received a copy of the GNU General Public License
 * along with GNU CC; see the file COPYING.  If not, write to
 * the Free Software Foundation, 59 Temple Place - Suite 330,
29
30
 * Boston, MA 02111-1307, USA.
 *
Linus Torvalds's avatar
Linus Torvalds committed
31
32
33
 * Please send any bug reports or fixes you make to the
 * email address(es):
 *    lksctp developers <lksctp-developers@lists.sourceforge.net>
34
 *
Linus Torvalds's avatar
Linus Torvalds committed
35
36
37
 * Or submit a bug report through the following website:
 *    http://www.sf.net/projects/lksctp
 *
38
 * Written or modified by:
Linus Torvalds's avatar
Linus Torvalds committed
39
40
 *    La Monte H.P. Yarroll <piggy@acm.org>
 *    Karl Knutson <karl@athena.chicago.il.us>
41
 *
Linus Torvalds's avatar
Linus Torvalds committed
42
43
44
45
46
47
48
49
50
51
52
 * Any bugs reported given to us we will try to fix... any fixes shared will
 * be incorporated into the next SCTP release.
 */

#include <net/sctp/sctp.h>
#include <net/sctp/sm.h>
#include <linux/interrupt.h>

/* Initialize an SCTP inqueue.  */
void sctp_inq_init(struct sctp_inq *queue)
{
53
	INIT_LIST_HEAD(&queue->in_chunk_list);
Linus Torvalds's avatar
Linus Torvalds committed
54
55
56
	queue->in_progress = NULL;

	/* Create a task for delivering data.  */
David Howells's avatar
David Howells committed
57
	INIT_WORK(&queue->immediate, NULL);
Linus Torvalds's avatar
Linus Torvalds committed
58
59
60
61
62
63
64

	queue->malloced = 0;
}

/* Release the memory associated with an SCTP inqueue.  */
void sctp_inq_free(struct sctp_inq *queue)
{
65
	struct sctp_chunk *chunk, *tmp;
Linus Torvalds's avatar
Linus Torvalds committed
66
67

	/* Empty the queue.  */
68
69
	list_for_each_entry_safe(chunk, tmp, &queue->in_chunk_list, list) {
		list_del_init(&chunk->list);
Linus Torvalds's avatar
Linus Torvalds committed
70
		sctp_chunk_free(chunk);
71
	}
Linus Torvalds's avatar
Linus Torvalds committed
72
73
74
75

	/* If there is a packet which is currently being worked on,
	 * free it as well.
	 */
76
	if (queue->in_progress) {
Linus Torvalds's avatar
Linus Torvalds committed
77
		sctp_chunk_free(queue->in_progress);
78
79
		queue->in_progress = NULL;
	}
Linus Torvalds's avatar
Linus Torvalds committed
80
81
82
83
84
85
86
87
88
89

	if (queue->malloced) {
		/* Dump the master memory segment.  */
		kfree(queue);
	}
}

/* Put a new packet in an SCTP inqueue.
 * We assume that packet->sctp_hdr is set and in host byte order.
 */
90
void sctp_inq_push(struct sctp_inq *q, struct sctp_chunk *chunk)
Linus Torvalds's avatar
Linus Torvalds committed
91
92
93
94
95
96
97
98
{
	/* Directly call the packet handling routine. */

	/* We are now calling this either from the soft interrupt
	 * or from the backlog processing.
	 * Eventually, we should clean up inqueue to not rely
	 * on the BH related data structures.
	 */
99
	list_add_tail(&chunk->list, &q->in_chunk_list);
David Howells's avatar
David Howells committed
100
	q->immediate.func(&q->immediate);
Linus Torvalds's avatar
Linus Torvalds committed
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
}

/* Extract a chunk from an SCTP inqueue.
 *
 * WARNING:  If you need to put the chunk on another queue, you need to
 * make a shallow copy (clone) of it.
 */
struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
{
	struct sctp_chunk *chunk;
	sctp_chunkhdr_t *ch = NULL;

	/* The assumption is that we are safe to process the chunks
	 * at this time.
	 */

	if ((chunk = queue->in_progress)) {
		/* There is a packet that we have been working on.
		 * Any post processing work to do before we move on?
		 */
		if (chunk->singleton ||
		    chunk->end_of_packet ||
		    chunk->pdiscard) {
			sctp_chunk_free(chunk);
			chunk = queue->in_progress = NULL;
		} else {
			/* Nothing to do. Next chunk in the packet, please. */
			ch = (sctp_chunkhdr_t *) chunk->chunk_end;

			/* Force chunk->skb->data to chunk->chunk_end.  */
			skb_pull(chunk->skb,
				 chunk->chunk_end - chunk->skb->data);
133
134
135
136
137
138
139
140

			/* Verify that we have at least chunk headers
			 * worth of buffer left.
			 */
			if (skb_headlen(chunk->skb) < sizeof(sctp_chunkhdr_t)) {
				sctp_chunk_free(chunk);
				chunk = queue->in_progress = NULL;
			}
Linus Torvalds's avatar
Linus Torvalds committed
141
142
143
144
145
		}
	}

	/* Do we need to take the next packet out of the queue to process? */
	if (!chunk) {
146
147
		struct list_head *entry;

Linus Torvalds's avatar
Linus Torvalds committed
148
		/* Is the queue empty?  */
149
		if (list_empty(&queue->in_chunk_list))
Linus Torvalds's avatar
Linus Torvalds committed
150
151
			return NULL;

152
		entry = queue->in_chunk_list.next;
Linus Torvalds's avatar
Linus Torvalds committed
153
		chunk = queue->in_progress =
154
155
			list_entry(entry, struct sctp_chunk, list);
		list_del_init(entry);
Linus Torvalds's avatar
Linus Torvalds committed
156
157
158
159

		/* This is the first chunk in the packet.  */
		chunk->singleton = 1;
		ch = (sctp_chunkhdr_t *) chunk->skb->data;
160
		chunk->data_accepted = 0;
Linus Torvalds's avatar
Linus Torvalds committed
161
162
	}

163
164
	chunk->chunk_hdr = ch;
	chunk->chunk_end = ((__u8 *)ch) + WORD_ROUND(ntohs(ch->length));
Linus Torvalds's avatar
Linus Torvalds committed
165
166
167
168
169
	/* In the unlikely case of an IP reassembly, the skb could be
	 * non-linear. If so, update chunk_end so that it doesn't go past
	 * the skb->tail.
	 */
	if (unlikely(skb_is_nonlinear(chunk->skb))) {
170
171
		if (chunk->chunk_end > skb_tail_pointer(chunk->skb))
			chunk->chunk_end = skb_tail_pointer(chunk->skb);
Linus Torvalds's avatar
Linus Torvalds committed
172
173
174
175
	}
	skb_pull(chunk->skb, sizeof(sctp_chunkhdr_t));
	chunk->subh.v = NULL; /* Subheader is no longer valid.  */

176
	if (chunk->chunk_end < skb_tail_pointer(chunk->skb)) {
Linus Torvalds's avatar
Linus Torvalds committed
177
178
		/* This is not a singleton */
		chunk->singleton = 0;
179
	} else if (chunk->chunk_end > skb_tail_pointer(chunk->skb)) {
180
		/* RFC 2960, Section 6.10  Bundling
Linus Torvalds's avatar
Linus Torvalds committed
181
182
183
		 *
		 * Partial chunks MUST NOT be placed in an SCTP packet.
		 * If the receiver detects a partial chunk, it MUST drop
184
		 * the chunk.
Linus Torvalds's avatar
Linus Torvalds committed
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
		 *
		 * Since the end of the chunk is past the end of our buffer
		 * (which contains the whole packet, we can freely discard
		 * the whole packet.
		 */
		sctp_chunk_free(chunk);
		chunk = queue->in_progress = NULL;

		return NULL;
	} else {
		/* We are at the end of the packet, so mark the chunk
		 * in case we need to send a SACK.
		 */
		chunk->end_of_packet = 1;
	}

	SCTP_DEBUG_PRINTK("+++sctp_inq_pop+++ chunk %p[%s],"
			  " length %d, skb->len %d\n",chunk,
			  sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)),
			  ntohs(chunk->chunk_hdr->length), chunk->skb->len);
	return chunk;
}

/* Set a top-half handler.
 *
 * Originally, we the top-half handler was scheduled as a BH.  We now
 * call the handler directly in sctp_inq_push() at a time that
 * we know we are lock safe.
 * The intent is that this routine will pull stuff out of the
 * inqueue and process it.
 */
David Howells's avatar
David Howells committed
216
void sctp_inq_set_th_handler(struct sctp_inq *q, work_func_t callback)
Linus Torvalds's avatar
Linus Torvalds committed
217
{
David Howells's avatar
David Howells committed
218
	INIT_WORK(&q->immediate, callback);
Linus Torvalds's avatar
Linus Torvalds committed
219
220
}