blob: 7b23803343cc66e39c6b6214d9b96ff2a0d4877a [file] [log] [blame]
Vlad Yasevich60c778b2008-01-11 09:57:09 -05001/* SCTP kernel implementation
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * (C) Copyright IBM Corp. 2001, 2004
3 * Copyright (c) 1999-2000 Cisco, Inc.
4 * Copyright (c) 1999-2001 Motorola, Inc.
5 * Copyright (c) 2001 Intel Corp.
6 * Copyright (c) 2001 Nokia, Inc.
7 * Copyright (c) 2001 La Monte H.P. Yarroll
8 *
9 * This abstraction carries sctp events to the ULP (sockets).
10 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -050011 * This SCTP implementation is free software;
Linus Torvalds1da177e2005-04-16 15:20:36 -070012 * you can redistribute it and/or modify it under the terms of
13 * the GNU General Public License as published by
14 * the Free Software Foundation; either version 2, or (at your option)
15 * any later version.
16 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -050017 * This SCTP implementation is distributed in the hope that it
Linus Torvalds1da177e2005-04-16 15:20:36 -070018 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
19 * ************************
20 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
21 * See the GNU General Public License for more details.
22 *
23 * You should have received a copy of the GNU General Public License
24 * along with GNU CC; see the file COPYING. If not, write to
25 * the Free Software Foundation, 59 Temple Place - Suite 330,
26 * Boston, MA 02111-1307, USA.
27 *
28 * Please send any bug reports or fixes you make to the
29 * email address(es):
30 * lksctp developers <lksctp-developers@lists.sourceforge.net>
31 *
32 * Or submit a bug report through the following website:
33 * http://www.sf.net/projects/lksctp
34 *
35 * Written or modified by:
36 * Jon Grimm <jgrimm@us.ibm.com>
37 * La Monte H.P. Yarroll <piggy@acm.org>
38 * Sridhar Samudrala <sri@us.ibm.com>
39 *
40 * Any bugs reported given to us we will try to fix... any fixes shared will
41 * be incorporated into the next SCTP release.
42 */
43
44#include <linux/types.h>
45#include <linux/skbuff.h>
46#include <net/sock.h>
47#include <net/sctp/structs.h>
48#include <net/sctp/sctp.h>
49#include <net/sctp/sm.h>
50
51/* Forward declarations for internal helpers. */
52static struct sctp_ulpevent * sctp_ulpq_reasm(struct sctp_ulpq *ulpq,
David S. Miller8728b832005-08-09 19:25:21 -070053 struct sctp_ulpevent *);
Linus Torvalds1da177e2005-04-16 15:20:36 -070054static struct sctp_ulpevent * sctp_ulpq_order(struct sctp_ulpq *,
David S. Miller8728b832005-08-09 19:25:21 -070055 struct sctp_ulpevent *);
Vlad Yasevichef5d4cf22007-12-16 14:05:45 -080056static void sctp_ulpq_reasm_drain(struct sctp_ulpq *ulpq);
Linus Torvalds1da177e2005-04-16 15:20:36 -070057
58/* 1st Level Abstractions */
59
60/* Initialize a ULP queue from a block of memory. */
61struct sctp_ulpq *sctp_ulpq_init(struct sctp_ulpq *ulpq,
62 struct sctp_association *asoc)
63{
64 memset(ulpq, 0, sizeof(struct sctp_ulpq));
65
66 ulpq->asoc = asoc;
67 skb_queue_head_init(&ulpq->reasm);
68 skb_queue_head_init(&ulpq->lobby);
69 ulpq->pd_mode = 0;
70 ulpq->malloced = 0;
71
72 return ulpq;
73}
74
75
76/* Flush the reassembly and ordering queues. */
Vlad Yasevich0b58a812007-03-19 17:01:17 -070077void sctp_ulpq_flush(struct sctp_ulpq *ulpq)
Linus Torvalds1da177e2005-04-16 15:20:36 -070078{
79 struct sk_buff *skb;
80 struct sctp_ulpevent *event;
81
82 while ((skb = __skb_dequeue(&ulpq->lobby)) != NULL) {
83 event = sctp_skb2event(skb);
84 sctp_ulpevent_free(event);
85 }
86
87 while ((skb = __skb_dequeue(&ulpq->reasm)) != NULL) {
88 event = sctp_skb2event(skb);
89 sctp_ulpevent_free(event);
90 }
91
92}
93
94/* Dispose of a ulpqueue. */
95void sctp_ulpq_free(struct sctp_ulpq *ulpq)
96{
97 sctp_ulpq_flush(ulpq);
98 if (ulpq->malloced)
99 kfree(ulpq);
100}
101
102/* Process an incoming DATA chunk. */
103int sctp_ulpq_tail_data(struct sctp_ulpq *ulpq, struct sctp_chunk *chunk,
Al Virodd0fc662005-10-07 07:46:04 +0100104 gfp_t gfp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105{
106 struct sk_buff_head temp;
107 sctp_data_chunk_t *hdr;
108 struct sctp_ulpevent *event;
109
110 hdr = (sctp_data_chunk_t *) chunk->chunk_hdr;
111
112 /* Create an event from the incoming chunk. */
113 event = sctp_ulpevent_make_rcvmsg(chunk->asoc, chunk, gfp);
114 if (!event)
115 return -ENOMEM;
116
117 /* Do reassembly if needed. */
118 event = sctp_ulpq_reasm(ulpq, event);
119
120 /* Do ordering if needed. */
121 if ((event) && (event->msg_flags & MSG_EOR)){
122 /* Create a temporary list to collect chunks on. */
123 skb_queue_head_init(&temp);
124 __skb_queue_tail(&temp, sctp_event2skb(event));
125
126 event = sctp_ulpq_order(ulpq, event);
127 }
128
David S. Miller8728b832005-08-09 19:25:21 -0700129 /* Send event to the ULP. 'event' is the sctp_ulpevent for
130 * very first SKB on the 'temp' list.
131 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132 if (event)
133 sctp_ulpq_tail_event(ulpq, event);
134
135 return 0;
136}
137
138/* Add a new event for propagation to the ULP. */
139/* Clear the partial delivery mode for this socket. Note: This
140 * assumes that no association is currently in partial delivery mode.
141 */
Vlad Yasevichb6e13312007-04-20 12:23:15 -0700142int sctp_clear_pd(struct sock *sk, struct sctp_association *asoc)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143{
144 struct sctp_sock *sp = sctp_sk(sk);
145
Vlad Yasevichb6e13312007-04-20 12:23:15 -0700146 if (atomic_dec_and_test(&sp->pd_mode)) {
147 /* This means there are no other associations in PD, so
148 * we can go ahead and clear out the lobby in one shot
149 */
150 if (!skb_queue_empty(&sp->pd_lobby)) {
151 struct list_head *list;
152 sctp_skb_list_tail(&sp->pd_lobby, &sk->sk_receive_queue);
153 list = (struct list_head *)&sctp_sk(sk)->pd_lobby;
154 INIT_LIST_HEAD(list);
155 return 1;
156 }
157 } else {
158 /* There are other associations in PD, so we only need to
159 * pull stuff out of the lobby that belongs to the
160 * associations that is exiting PD (all of its notifications
161 * are posted here).
162 */
163 if (!skb_queue_empty(&sp->pd_lobby) && asoc) {
164 struct sk_buff *skb, *tmp;
165 struct sctp_ulpevent *event;
166
167 sctp_skb_for_each(skb, &sp->pd_lobby, tmp) {
168 event = sctp_skb2event(skb);
169 if (event->asoc == asoc) {
170 __skb_unlink(skb, &sp->pd_lobby);
171 __skb_queue_tail(&sk->sk_receive_queue,
172 skb);
173 }
174 }
175 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176 }
Vlad Yasevichb6e13312007-04-20 12:23:15 -0700177
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 return 0;
179}
180
Vlad Yasevichd49d91d2007-03-23 11:32:00 -0700181/* Set the pd_mode on the socket and ulpq */
182static void sctp_ulpq_set_pd(struct sctp_ulpq *ulpq)
183{
184 struct sctp_sock *sp = sctp_sk(ulpq->asoc->base.sk);
185
186 atomic_inc(&sp->pd_mode);
187 ulpq->pd_mode = 1;
188}
189
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190/* Clear the pd_mode and restart any pending messages waiting for delivery. */
191static int sctp_ulpq_clear_pd(struct sctp_ulpq *ulpq)
192{
193 ulpq->pd_mode = 0;
Vlad Yasevichef5d4cf22007-12-16 14:05:45 -0800194 sctp_ulpq_reasm_drain(ulpq);
Vlad Yasevichb6e13312007-04-20 12:23:15 -0700195 return sctp_clear_pd(ulpq->asoc->base.sk, ulpq->asoc);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700196}
197
David S. Miller8728b832005-08-09 19:25:21 -0700198/* If the SKB of 'event' is on a list, it is the first such member
199 * of that list.
200 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700201int sctp_ulpq_tail_event(struct sctp_ulpq *ulpq, struct sctp_ulpevent *event)
202{
203 struct sock *sk = ulpq->asoc->base.sk;
David S. Miller8728b832005-08-09 19:25:21 -0700204 struct sk_buff_head *queue, *skb_list;
205 struct sk_buff *skb = sctp_event2skb(event);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700206 int clear_pd = 0;
207
David S. Miller8728b832005-08-09 19:25:21 -0700208 skb_list = (struct sk_buff_head *) skb->prev;
209
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210 /* If the socket is just going to throw this away, do not
211 * even try to deliver it.
212 */
213 if (sock_flag(sk, SOCK_DEAD) || (sk->sk_shutdown & RCV_SHUTDOWN))
214 goto out_free;
215
216 /* Check if the user wishes to receive this event. */
217 if (!sctp_ulpevent_is_enabled(event, &sctp_sk(sk)->subscribe))
218 goto out_free;
219
220 /* If we are in partial delivery mode, post to the lobby until
221 * partial delivery is cleared, unless, of course _this_ is
222 * the association the cause of the partial delivery.
223 */
224
Vlad Yasevichb6e13312007-04-20 12:23:15 -0700225 if (atomic_read(&sctp_sk(sk)->pd_mode) == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 queue = &sk->sk_receive_queue;
Vlad Yasevichb6e13312007-04-20 12:23:15 -0700227 } else {
228 if (ulpq->pd_mode) {
229 /* If the association is in partial delivery, we
230 * need to finish delivering the partially processed
231 * packet before passing any other data. This is
232 * because we don't truly support stream interleaving.
233 */
234 if ((event->msg_flags & MSG_NOTIFICATION) ||
235 (SCTP_DATA_NOT_FRAG ==
236 (event->msg_flags & SCTP_DATA_FRAG_MASK)))
237 queue = &sctp_sk(sk)->pd_lobby;
238 else {
239 clear_pd = event->msg_flags & MSG_EOR;
240 queue = &sk->sk_receive_queue;
241 }
242 } else {
243 /*
244 * If fragment interleave is enabled, we
245 * can queue this to the recieve queue instead
246 * of the lobby.
247 */
248 if (sctp_sk(sk)->frag_interleave)
249 queue = &sk->sk_receive_queue;
250 else
251 queue = &sctp_sk(sk)->pd_lobby;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252 }
Vlad Yasevichb6e13312007-04-20 12:23:15 -0700253 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254
255 /* If we are harvesting multiple skbs they will be
256 * collected on a list.
257 */
David S. Miller8728b832005-08-09 19:25:21 -0700258 if (skb_list)
259 sctp_skb_list_tail(skb_list, queue);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 else
David S. Miller8728b832005-08-09 19:25:21 -0700261 __skb_queue_tail(queue, skb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700262
263 /* Did we just complete partial delivery and need to get
264 * rolling again? Move pending data to the receive
265 * queue.
266 */
267 if (clear_pd)
268 sctp_ulpq_clear_pd(ulpq);
269
270 if (queue == &sk->sk_receive_queue)
271 sk->sk_data_ready(sk, 0);
272 return 1;
273
274out_free:
David S. Miller8728b832005-08-09 19:25:21 -0700275 if (skb_list)
276 sctp_queue_purge_ulpevents(skb_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700277 else
278 sctp_ulpevent_free(event);
David S. Miller8728b832005-08-09 19:25:21 -0700279
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280 return 0;
281}
282
283/* 2nd Level Abstractions */
284
285/* Helper function to store chunks that need to be reassembled. */
Vlad Yasevich01f2d382008-01-11 11:17:27 -0500286static void sctp_ulpq_store_reasm(struct sctp_ulpq *ulpq,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287 struct sctp_ulpevent *event)
288{
289 struct sk_buff *pos;
290 struct sctp_ulpevent *cevent;
291 __u32 tsn, ctsn;
292
293 tsn = event->tsn;
294
295 /* See if it belongs at the end. */
296 pos = skb_peek_tail(&ulpq->reasm);
297 if (!pos) {
298 __skb_queue_tail(&ulpq->reasm, sctp_event2skb(event));
299 return;
300 }
301
302 /* Short circuit just dropping it at the end. */
303 cevent = sctp_skb2event(pos);
304 ctsn = cevent->tsn;
305 if (TSN_lt(ctsn, tsn)) {
306 __skb_queue_tail(&ulpq->reasm, sctp_event2skb(event));
307 return;
308 }
309
310 /* Find the right place in this list. We store them by TSN. */
311 skb_queue_walk(&ulpq->reasm, pos) {
312 cevent = sctp_skb2event(pos);
313 ctsn = cevent->tsn;
314
315 if (TSN_lt(tsn, ctsn))
316 break;
317 }
318
319 /* Insert before pos. */
David S. Miller43f59c82008-09-21 21:28:51 -0700320 __skb_queue_before(&ulpq->reasm, pos, sctp_event2skb(event));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321
322}
323
324/* Helper function to return an event corresponding to the reassembled
325 * datagram.
326 * This routine creates a re-assembled skb given the first and last skb's
327 * as stored in the reassembly queue. The skb's may be non-linear if the sctp
328 * payload was fragmented on the way and ip had to reassemble them.
329 * We add the rest of skb's to the first skb's fraglist.
330 */
David S. Miller8728b832005-08-09 19:25:21 -0700331static struct sctp_ulpevent *sctp_make_reassembled_event(struct sk_buff_head *queue, struct sk_buff *f_frag, struct sk_buff *l_frag)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700332{
333 struct sk_buff *pos;
Vladislav Yasevich672e7cc2006-05-05 17:03:49 -0700334 struct sk_buff *new = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335 struct sctp_ulpevent *event;
336 struct sk_buff *pnext, *last;
337 struct sk_buff *list = skb_shinfo(f_frag)->frag_list;
338
339 /* Store the pointer to the 2nd skb */
340 if (f_frag == l_frag)
341 pos = NULL;
342 else
343 pos = f_frag->next;
344
345 /* Get the last skb in the f_frag's frag_list if present. */
346 for (last = list; list; last = list, list = list->next);
347
348 /* Add the list of remaining fragments to the first fragments
349 * frag_list.
350 */
351 if (last)
352 last->next = pos;
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900353 else {
354 if (skb_cloned(f_frag)) {
355 /* This is a cloned skb, we can't just modify
356 * the frag_list. We need a new skb to do that.
357 * Instead of calling skb_unshare(), we'll do it
358 * ourselves since we need to delay the free.
359 */
360 new = skb_copy(f_frag, GFP_ATOMIC);
361 if (!new)
362 return NULL; /* try again later */
Vladislav Yasevich672e7cc2006-05-05 17:03:49 -0700363
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900364 sctp_skb_set_owner_r(new, f_frag->sk);
Vladislav Yasevich672e7cc2006-05-05 17:03:49 -0700365
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900366 skb_shinfo(new)->frag_list = pos;
367 } else
368 skb_shinfo(f_frag)->frag_list = pos;
369 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370
371 /* Remove the first fragment from the reassembly queue. */
David S. Miller8728b832005-08-09 19:25:21 -0700372 __skb_unlink(f_frag, queue);
Vladislav Yasevich672e7cc2006-05-05 17:03:49 -0700373
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900374 /* if we did unshare, then free the old skb and re-assign */
375 if (new) {
376 kfree_skb(f_frag);
377 f_frag = new;
378 }
Vladislav Yasevich672e7cc2006-05-05 17:03:49 -0700379
Linus Torvalds1da177e2005-04-16 15:20:36 -0700380 while (pos) {
381
382 pnext = pos->next;
383
384 /* Update the len and data_len fields of the first fragment. */
385 f_frag->len += pos->len;
386 f_frag->data_len += pos->len;
387
388 /* Remove the fragment from the reassembly queue. */
David S. Miller8728b832005-08-09 19:25:21 -0700389 __skb_unlink(pos, queue);
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900390
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391 /* Break if we have reached the last fragment. */
392 if (pos == l_frag)
393 break;
394 pos->next = pnext;
395 pos = pnext;
Stephen Hemminger3ff50b72007-04-20 17:09:22 -0700396 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700397
398 event = sctp_skb2event(f_frag);
399 SCTP_INC_STATS(SCTP_MIB_REASMUSRMSGS);
400
401 return event;
402}
403
404
405/* Helper function to check if an incoming chunk has filled up the last
406 * missing fragment in a SCTP datagram and return the corresponding event.
407 */
Vlad Yasevich01f2d382008-01-11 11:17:27 -0500408static struct sctp_ulpevent *sctp_ulpq_retrieve_reassembled(struct sctp_ulpq *ulpq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700409{
410 struct sk_buff *pos;
411 struct sctp_ulpevent *cevent;
412 struct sk_buff *first_frag = NULL;
413 __u32 ctsn, next_tsn;
414 struct sctp_ulpevent *retval = NULL;
Vlad Yasevichd49d91d2007-03-23 11:32:00 -0700415 struct sk_buff *pd_first = NULL;
416 struct sk_buff *pd_last = NULL;
417 size_t pd_len = 0;
418 struct sctp_association *asoc;
419 u32 pd_point;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700420
421 /* Initialized to 0 just to avoid compiler warning message. Will
422 * never be used with this value. It is referenced only after it
423 * is set when we find the first fragment of a message.
424 */
425 next_tsn = 0;
426
427 /* The chunks are held in the reasm queue sorted by TSN.
428 * Walk through the queue sequentially and look for a sequence of
429 * fragmented chunks that complete a datagram.
430 * 'first_frag' and next_tsn are reset when we find a chunk which
431 * is the first fragment of a datagram. Once these 2 fields are set
432 * we expect to find the remaining middle fragments and the last
433 * fragment in order. If not, first_frag is reset to NULL and we
434 * start the next pass when we find another first fragment.
Vlad Yasevichd49d91d2007-03-23 11:32:00 -0700435 *
436 * There is a potential to do partial delivery if user sets
437 * SCTP_PARTIAL_DELIVERY_POINT option. Lets count some things here
438 * to see if can do PD.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439 */
440 skb_queue_walk(&ulpq->reasm, pos) {
441 cevent = sctp_skb2event(pos);
442 ctsn = cevent->tsn;
443
444 switch (cevent->msg_flags & SCTP_DATA_FRAG_MASK) {
445 case SCTP_DATA_FIRST_FRAG:
Vlad Yasevichd49d91d2007-03-23 11:32:00 -0700446 /* If this "FIRST_FRAG" is the first
447 * element in the queue, then count it towards
448 * possible PD.
449 */
450 if (pos == ulpq->reasm.next) {
451 pd_first = pos;
452 pd_last = pos;
453 pd_len = pos->len;
454 } else {
455 pd_first = NULL;
456 pd_last = NULL;
457 pd_len = 0;
458 }
459
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460 first_frag = pos;
461 next_tsn = ctsn + 1;
462 break;
463
464 case SCTP_DATA_MIDDLE_FRAG:
Vlad Yasevichd49d91d2007-03-23 11:32:00 -0700465 if ((first_frag) && (ctsn == next_tsn)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700466 next_tsn++;
Vlad Yasevichd49d91d2007-03-23 11:32:00 -0700467 if (pd_first) {
468 pd_last = pos;
469 pd_len += pos->len;
470 }
471 } else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700472 first_frag = NULL;
473 break;
474
475 case SCTP_DATA_LAST_FRAG:
476 if (first_frag && (ctsn == next_tsn))
477 goto found;
478 else
479 first_frag = NULL;
480 break;
Stephen Hemminger3ff50b72007-04-20 17:09:22 -0700481 }
Vlad Yasevichd49d91d2007-03-23 11:32:00 -0700482 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483
Vlad Yasevichd49d91d2007-03-23 11:32:00 -0700484 asoc = ulpq->asoc;
485 if (pd_first) {
486 /* Make sure we can enter partial deliver.
487 * We can trigger partial delivery only if framgent
488 * interleave is set, or the socket is not already
489 * in partial delivery.
490 */
491 if (!sctp_sk(asoc->base.sk)->frag_interleave &&
492 atomic_read(&sctp_sk(asoc->base.sk)->pd_mode))
493 goto done;
494
495 cevent = sctp_skb2event(pd_first);
496 pd_point = sctp_sk(asoc->base.sk)->pd_point;
497 if (pd_point && pd_point <= pd_len) {
498 retval = sctp_make_reassembled_event(&ulpq->reasm,
499 pd_first,
500 pd_last);
501 if (retval)
502 sctp_ulpq_set_pd(ulpq);
503 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504 }
505done:
506 return retval;
507found:
David S. Miller8728b832005-08-09 19:25:21 -0700508 retval = sctp_make_reassembled_event(&ulpq->reasm, first_frag, pos);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700509 if (retval)
510 retval->msg_flags |= MSG_EOR;
511 goto done;
512}
513
514/* Retrieve the next set of fragments of a partial message. */
Vlad Yasevich01f2d382008-01-11 11:17:27 -0500515static struct sctp_ulpevent *sctp_ulpq_retrieve_partial(struct sctp_ulpq *ulpq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700516{
517 struct sk_buff *pos, *last_frag, *first_frag;
518 struct sctp_ulpevent *cevent;
519 __u32 ctsn, next_tsn;
520 int is_last;
521 struct sctp_ulpevent *retval;
522
523 /* The chunks are held in the reasm queue sorted by TSN.
524 * Walk through the queue sequentially and look for the first
525 * sequence of fragmented chunks.
526 */
527
528 if (skb_queue_empty(&ulpq->reasm))
529 return NULL;
530
531 last_frag = first_frag = NULL;
532 retval = NULL;
533 next_tsn = 0;
534 is_last = 0;
535
536 skb_queue_walk(&ulpq->reasm, pos) {
537 cevent = sctp_skb2event(pos);
538 ctsn = cevent->tsn;
539
540 switch (cevent->msg_flags & SCTP_DATA_FRAG_MASK) {
541 case SCTP_DATA_MIDDLE_FRAG:
542 if (!first_frag) {
543 first_frag = pos;
544 next_tsn = ctsn + 1;
545 last_frag = pos;
546 } else if (next_tsn == ctsn)
547 next_tsn++;
548 else
549 goto done;
550 break;
551 case SCTP_DATA_LAST_FRAG:
552 if (!first_frag)
553 first_frag = pos;
554 else if (ctsn != next_tsn)
555 goto done;
556 last_frag = pos;
557 is_last = 1;
558 goto done;
559 default:
560 return NULL;
Stephen Hemminger3ff50b72007-04-20 17:09:22 -0700561 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700562 }
563
564 /* We have the reassembled event. There is no need to look
565 * further.
566 */
567done:
David S. Miller8728b832005-08-09 19:25:21 -0700568 retval = sctp_make_reassembled_event(&ulpq->reasm, first_frag, last_frag);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569 if (retval && is_last)
570 retval->msg_flags |= MSG_EOR;
571
572 return retval;
573}
574
575
576/* Helper function to reassemble chunks. Hold chunks on the reasm queue that
577 * need reassembling.
578 */
579static struct sctp_ulpevent *sctp_ulpq_reasm(struct sctp_ulpq *ulpq,
580 struct sctp_ulpevent *event)
581{
582 struct sctp_ulpevent *retval = NULL;
583
584 /* Check if this is part of a fragmented message. */
585 if (SCTP_DATA_NOT_FRAG == (event->msg_flags & SCTP_DATA_FRAG_MASK)) {
586 event->msg_flags |= MSG_EOR;
587 return event;
588 }
589
590 sctp_ulpq_store_reasm(ulpq, event);
591 if (!ulpq->pd_mode)
592 retval = sctp_ulpq_retrieve_reassembled(ulpq);
593 else {
594 __u32 ctsn, ctsnap;
595
596 /* Do not even bother unless this is the next tsn to
597 * be delivered.
598 */
599 ctsn = event->tsn;
600 ctsnap = sctp_tsnmap_get_ctsn(&ulpq->asoc->peer.tsn_map);
601 if (TSN_lte(ctsn, ctsnap))
602 retval = sctp_ulpq_retrieve_partial(ulpq);
603 }
604
605 return retval;
606}
607
608/* Retrieve the first part (sequential fragments) for partial delivery. */
Vlad Yasevich01f2d382008-01-11 11:17:27 -0500609static struct sctp_ulpevent *sctp_ulpq_retrieve_first(struct sctp_ulpq *ulpq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700610{
611 struct sk_buff *pos, *last_frag, *first_frag;
612 struct sctp_ulpevent *cevent;
613 __u32 ctsn, next_tsn;
614 struct sctp_ulpevent *retval;
615
616 /* The chunks are held in the reasm queue sorted by TSN.
617 * Walk through the queue sequentially and look for a sequence of
618 * fragmented chunks that start a datagram.
619 */
620
621 if (skb_queue_empty(&ulpq->reasm))
622 return NULL;
623
624 last_frag = first_frag = NULL;
625 retval = NULL;
626 next_tsn = 0;
627
628 skb_queue_walk(&ulpq->reasm, pos) {
629 cevent = sctp_skb2event(pos);
630 ctsn = cevent->tsn;
631
632 switch (cevent->msg_flags & SCTP_DATA_FRAG_MASK) {
633 case SCTP_DATA_FIRST_FRAG:
634 if (!first_frag) {
635 first_frag = pos;
636 next_tsn = ctsn + 1;
637 last_frag = pos;
638 } else
639 goto done;
640 break;
641
642 case SCTP_DATA_MIDDLE_FRAG:
643 if (!first_frag)
644 return NULL;
645 if (ctsn == next_tsn) {
646 next_tsn++;
647 last_frag = pos;
648 } else
649 goto done;
650 break;
651 default:
652 return NULL;
Stephen Hemminger3ff50b72007-04-20 17:09:22 -0700653 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700654 }
655
656 /* We have the reassembled event. There is no need to look
657 * further.
658 */
659done:
David S. Miller8728b832005-08-09 19:25:21 -0700660 retval = sctp_make_reassembled_event(&ulpq->reasm, first_frag, last_frag);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700661 return retval;
662}
663
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400664/*
665 * Flush out stale fragments from the reassembly queue when processing
666 * a Forward TSN.
667 *
668 * RFC 3758, Section 3.6
669 *
670 * After receiving and processing a FORWARD TSN, the data receiver MUST
671 * take cautions in updating its re-assembly queue. The receiver MUST
672 * remove any partially reassembled message, which is still missing one
673 * or more TSNs earlier than or equal to the new cumulative TSN point.
674 * In the event that the receiver has invoked the partial delivery API,
675 * a notification SHOULD also be generated to inform the upper layer API
676 * that the message being partially delivered will NOT be completed.
677 */
678void sctp_ulpq_reasm_flushtsn(struct sctp_ulpq *ulpq, __u32 fwd_tsn)
679{
680 struct sk_buff *pos, *tmp;
681 struct sctp_ulpevent *event;
682 __u32 tsn;
683
684 if (skb_queue_empty(&ulpq->reasm))
685 return;
686
687 skb_queue_walk_safe(&ulpq->reasm, pos, tmp) {
688 event = sctp_skb2event(pos);
689 tsn = event->tsn;
690
691 /* Since the entire message must be abandoned by the
692 * sender (item A3 in Section 3.5, RFC 3758), we can
693 * free all fragments on the list that are less then
694 * or equal to ctsn_point
695 */
696 if (TSN_lte(tsn, fwd_tsn)) {
697 __skb_unlink(pos, &ulpq->reasm);
698 sctp_ulpevent_free(event);
699 } else
700 break;
701 }
702}
703
Vlad Yasevichef5d4cf22007-12-16 14:05:45 -0800704/*
705 * Drain the reassembly queue. If we just cleared parted delivery, it
706 * is possible that the reassembly queue will contain already reassembled
707 * messages. Retrieve any such messages and give them to the user.
708 */
709static void sctp_ulpq_reasm_drain(struct sctp_ulpq *ulpq)
710{
711 struct sctp_ulpevent *event = NULL;
712 struct sk_buff_head temp;
713
714 if (skb_queue_empty(&ulpq->reasm))
715 return;
716
717 while ((event = sctp_ulpq_retrieve_reassembled(ulpq)) != NULL) {
718 /* Do ordering if needed. */
719 if ((event) && (event->msg_flags & MSG_EOR)){
720 skb_queue_head_init(&temp);
721 __skb_queue_tail(&temp, sctp_event2skb(event));
722
723 event = sctp_ulpq_order(ulpq, event);
724 }
725
726 /* Send event to the ULP. 'event' is the
727 * sctp_ulpevent for very first SKB on the temp' list.
728 */
729 if (event)
730 sctp_ulpq_tail_event(ulpq, event);
731 }
732}
733
734
Linus Torvalds1da177e2005-04-16 15:20:36 -0700735/* Helper function to gather skbs that have possibly become
736 * ordered by an an incoming chunk.
737 */
Vlad Yasevich01f2d382008-01-11 11:17:27 -0500738static void sctp_ulpq_retrieve_ordered(struct sctp_ulpq *ulpq,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700739 struct sctp_ulpevent *event)
740{
David S. Miller8728b832005-08-09 19:25:21 -0700741 struct sk_buff_head *event_list;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700742 struct sk_buff *pos, *tmp;
743 struct sctp_ulpevent *cevent;
744 struct sctp_stream *in;
745 __u16 sid, csid;
746 __u16 ssn, cssn;
747
748 sid = event->stream;
749 ssn = event->ssn;
750 in = &ulpq->asoc->ssnmap->in;
751
David S. Miller8728b832005-08-09 19:25:21 -0700752 event_list = (struct sk_buff_head *) sctp_event2skb(event)->prev;
753
Linus Torvalds1da177e2005-04-16 15:20:36 -0700754 /* We are holding the chunks by stream, by SSN. */
755 sctp_skb_for_each(pos, &ulpq->lobby, tmp) {
756 cevent = (struct sctp_ulpevent *) pos->cb;
757 csid = cevent->stream;
758 cssn = cevent->ssn;
759
760 /* Have we gone too far? */
761 if (csid > sid)
762 break;
763
764 /* Have we not gone far enough? */
765 if (csid < sid)
766 continue;
767
768 if (cssn != sctp_ssn_peek(in, sid))
769 break;
770
771 /* Found it, so mark in the ssnmap. */
772 sctp_ssn_next(in, sid);
773
David S. Miller8728b832005-08-09 19:25:21 -0700774 __skb_unlink(pos, &ulpq->lobby);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700775
776 /* Attach all gathered skbs to the event. */
David S. Miller8728b832005-08-09 19:25:21 -0700777 __skb_queue_tail(event_list, pos);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700778 }
779}
780
781/* Helper function to store chunks needing ordering. */
Vlad Yasevich01f2d382008-01-11 11:17:27 -0500782static void sctp_ulpq_store_ordered(struct sctp_ulpq *ulpq,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700783 struct sctp_ulpevent *event)
784{
785 struct sk_buff *pos;
786 struct sctp_ulpevent *cevent;
787 __u16 sid, csid;
788 __u16 ssn, cssn;
789
790 pos = skb_peek_tail(&ulpq->lobby);
791 if (!pos) {
792 __skb_queue_tail(&ulpq->lobby, sctp_event2skb(event));
793 return;
794 }
795
796 sid = event->stream;
797 ssn = event->ssn;
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900798
Linus Torvalds1da177e2005-04-16 15:20:36 -0700799 cevent = (struct sctp_ulpevent *) pos->cb;
800 csid = cevent->stream;
801 cssn = cevent->ssn;
802 if (sid > csid) {
803 __skb_queue_tail(&ulpq->lobby, sctp_event2skb(event));
804 return;
805 }
806
807 if ((sid == csid) && SSN_lt(cssn, ssn)) {
808 __skb_queue_tail(&ulpq->lobby, sctp_event2skb(event));
809 return;
810 }
811
812 /* Find the right place in this list. We store them by
813 * stream ID and then by SSN.
814 */
815 skb_queue_walk(&ulpq->lobby, pos) {
816 cevent = (struct sctp_ulpevent *) pos->cb;
817 csid = cevent->stream;
818 cssn = cevent->ssn;
819
820 if (csid > sid)
821 break;
822 if (csid == sid && SSN_lt(ssn, cssn))
823 break;
824 }
825
826
827 /* Insert before pos. */
David S. Miller43f59c82008-09-21 21:28:51 -0700828 __skb_queue_before(&ulpq->lobby, pos, sctp_event2skb(event));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700829}
830
831static struct sctp_ulpevent *sctp_ulpq_order(struct sctp_ulpq *ulpq,
David S. Miller8728b832005-08-09 19:25:21 -0700832 struct sctp_ulpevent *event)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700833{
834 __u16 sid, ssn;
835 struct sctp_stream *in;
836
837 /* Check if this message needs ordering. */
838 if (SCTP_DATA_UNORDERED & event->msg_flags)
839 return event;
840
841 /* Note: The stream ID must be verified before this routine. */
842 sid = event->stream;
843 ssn = event->ssn;
844 in = &ulpq->asoc->ssnmap->in;
845
846 /* Is this the expected SSN for this stream ID? */
847 if (ssn != sctp_ssn_peek(in, sid)) {
848 /* We've received something out of order, so find where it
849 * needs to be placed. We order by stream and then by SSN.
850 */
851 sctp_ulpq_store_ordered(ulpq, event);
852 return NULL;
853 }
854
855 /* Mark that the next chunk has been found. */
856 sctp_ssn_next(in, sid);
857
858 /* Go find any other chunks that were waiting for
859 * ordering.
860 */
861 sctp_ulpq_retrieve_ordered(ulpq, event);
862
863 return event;
864}
865
866/* Helper function to gather skbs that have possibly become
867 * ordered by forward tsn skipping their dependencies.
868 */
Vlad Yasevich01f2d382008-01-11 11:17:27 -0500869static void sctp_ulpq_reap_ordered(struct sctp_ulpq *ulpq, __u16 sid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700870{
871 struct sk_buff *pos, *tmp;
872 struct sctp_ulpevent *cevent;
David S. Miller8728b832005-08-09 19:25:21 -0700873 struct sctp_ulpevent *event;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700874 struct sctp_stream *in;
875 struct sk_buff_head temp;
Vlad Yasevichc068be52008-01-15 11:41:56 -0500876 struct sk_buff_head *lobby = &ulpq->lobby;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700877 __u16 csid, cssn;
878
879 in = &ulpq->asoc->ssnmap->in;
880
881 /* We are holding the chunks by stream, by SSN. */
David S. Miller8728b832005-08-09 19:25:21 -0700882 skb_queue_head_init(&temp);
883 event = NULL;
Vlad Yasevichc068be52008-01-15 11:41:56 -0500884 sctp_skb_for_each(pos, lobby, tmp) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700885 cevent = (struct sctp_ulpevent *) pos->cb;
886 csid = cevent->stream;
887 cssn = cevent->ssn;
888
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400889 /* Have we gone too far? */
890 if (csid > sid)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700891 break;
892
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400893 /* Have we not gone far enough? */
894 if (csid < sid)
895 continue;
896
897 /* see if this ssn has been marked by skipping */
Vlad Yasevichc068be52008-01-15 11:41:56 -0500898 if (!SSN_lt(cssn, sctp_ssn_peek(in, csid)))
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400899 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700900
Vlad Yasevichc068be52008-01-15 11:41:56 -0500901 __skb_unlink(pos, lobby);
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400902 if (!event)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700903 /* Create a temporary list to collect chunks on. */
904 event = sctp_skb2event(pos);
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400905
906 /* Attach all gathered skbs to the event. */
907 __skb_queue_tail(&temp, pos);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700908 }
909
Vlad Yasevichc068be52008-01-15 11:41:56 -0500910 /* If we didn't reap any data, see if the next expected SSN
911 * is next on the queue and if so, use that.
912 */
913 if (event == NULL && pos != (struct sk_buff *)lobby) {
914 cevent = (struct sctp_ulpevent *) pos->cb;
915 csid = cevent->stream;
916 cssn = cevent->ssn;
917
918 if (csid == sid && cssn == sctp_ssn_peek(in, csid)) {
919 sctp_ssn_next(in, csid);
920 __skb_unlink(pos, lobby);
921 __skb_queue_tail(&temp, pos);
922 event = sctp_skb2event(pos);
923 }
924 }
925
David S. Miller8728b832005-08-09 19:25:21 -0700926 /* Send event to the ULP. 'event' is the sctp_ulpevent for
927 * very first SKB on the 'temp' list.
928 */
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400929 if (event) {
930 /* see if we have more ordered that we can deliver */
931 sctp_ulpq_retrieve_ordered(ulpq, event);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700932 sctp_ulpq_tail_event(ulpq, event);
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400933 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700934}
935
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400936/* Skip over an SSN. This is used during the processing of
937 * Forwared TSN chunk to skip over the abandoned ordered data
938 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700939void sctp_ulpq_skip(struct sctp_ulpq *ulpq, __u16 sid, __u16 ssn)
940{
941 struct sctp_stream *in;
942
943 /* Note: The stream ID must be verified before this routine. */
944 in = &ulpq->asoc->ssnmap->in;
945
946 /* Is this an old SSN? If so ignore. */
947 if (SSN_lt(ssn, sctp_ssn_peek(in, sid)))
948 return;
949
950 /* Mark that we are no longer expecting this SSN or lower. */
951 sctp_ssn_skip(in, sid, ssn);
952
953 /* Go find any other chunks that were waiting for
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900954 * ordering and deliver them if needed.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700955 */
Vlad Yasevichea2dfb32007-07-13 17:01:19 -0400956 sctp_ulpq_reap_ordered(ulpq, sid);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700957 return;
958}
959
Pavel Emelyanov16d14ef2007-10-23 20:30:25 -0700960static __u16 sctp_ulpq_renege_list(struct sctp_ulpq *ulpq,
961 struct sk_buff_head *list, __u16 needed)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700962{
963 __u16 freed = 0;
964 __u32 tsn;
965 struct sk_buff *skb;
966 struct sctp_ulpevent *event;
967 struct sctp_tsnmap *tsnmap;
968
969 tsnmap = &ulpq->asoc->peer.tsn_map;
970
Pavel Emelyanov16d14ef2007-10-23 20:30:25 -0700971 while ((skb = __skb_dequeue_tail(list)) != NULL) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700972 freed += skb_headlen(skb);
973 event = sctp_skb2event(skb);
974 tsn = event->tsn;
975
976 sctp_ulpevent_free(event);
977 sctp_tsnmap_renege(tsnmap, tsn);
978 if (freed >= needed)
979 return freed;
980 }
981
982 return freed;
983}
984
Pavel Emelyanov16d14ef2007-10-23 20:30:25 -0700985/* Renege 'needed' bytes from the ordering queue. */
986static __u16 sctp_ulpq_renege_order(struct sctp_ulpq *ulpq, __u16 needed)
987{
988 return sctp_ulpq_renege_list(ulpq, &ulpq->lobby, needed);
989}
990
Linus Torvalds1da177e2005-04-16 15:20:36 -0700991/* Renege 'needed' bytes from the reassembly queue. */
992static __u16 sctp_ulpq_renege_frags(struct sctp_ulpq *ulpq, __u16 needed)
993{
Pavel Emelyanov16d14ef2007-10-23 20:30:25 -0700994 return sctp_ulpq_renege_list(ulpq, &ulpq->reasm, needed);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700995}
996
997/* Partial deliver the first message as there is pressure on rwnd. */
998void sctp_ulpq_partial_delivery(struct sctp_ulpq *ulpq,
Alexey Dobriyan3182cd82005-07-11 20:57:47 -0700999 struct sctp_chunk *chunk,
Al Virodd0fc662005-10-07 07:46:04 +01001000 gfp_t gfp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001001{
1002 struct sctp_ulpevent *event;
1003 struct sctp_association *asoc;
Vlad Yasevichb6e13312007-04-20 12:23:15 -07001004 struct sctp_sock *sp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001005
1006 asoc = ulpq->asoc;
Vlad Yasevichb6e13312007-04-20 12:23:15 -07001007 sp = sctp_sk(asoc->base.sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001008
Vlad Yasevichb6e13312007-04-20 12:23:15 -07001009 /* If the association is already in Partial Delivery mode
1010 * we have noting to do.
1011 */
1012 if (ulpq->pd_mode)
1013 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001014
Vlad Yasevichb6e13312007-04-20 12:23:15 -07001015 /* If the user enabled fragment interleave socket option,
1016 * multiple associations can enter partial delivery.
1017 * Otherwise, we can only enter partial delivery if the
1018 * socket is not in partial deliver mode.
1019 */
1020 if (sp->frag_interleave || atomic_read(&sp->pd_mode) == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001021 /* Is partial delivery possible? */
1022 event = sctp_ulpq_retrieve_first(ulpq);
1023 /* Send event to the ULP. */
1024 if (event) {
1025 sctp_ulpq_tail_event(ulpq, event);
Vlad Yasevichd49d91d2007-03-23 11:32:00 -07001026 sctp_ulpq_set_pd(ulpq);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001027 return;
1028 }
1029 }
1030}
1031
1032/* Renege some packets to make room for an incoming chunk. */
1033void sctp_ulpq_renege(struct sctp_ulpq *ulpq, struct sctp_chunk *chunk,
Al Virodd0fc662005-10-07 07:46:04 +01001034 gfp_t gfp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001035{
1036 struct sctp_association *asoc;
1037 __u16 needed, freed;
1038
1039 asoc = ulpq->asoc;
1040
1041 if (chunk) {
1042 needed = ntohs(chunk->chunk_hdr->length);
1043 needed -= sizeof(sctp_data_chunk_t);
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +09001044 } else
Linus Torvalds1da177e2005-04-16 15:20:36 -07001045 needed = SCTP_DEFAULT_MAXWINDOW;
1046
1047 freed = 0;
1048
1049 if (skb_queue_empty(&asoc->base.sk->sk_receive_queue)) {
1050 freed = sctp_ulpq_renege_order(ulpq, needed);
1051 if (freed < needed) {
1052 freed += sctp_ulpq_renege_frags(ulpq, needed - freed);
1053 }
1054 }
1055 /* If able to free enough room, accept this chunk. */
1056 if (chunk && (freed >= needed)) {
1057 __u32 tsn;
1058 tsn = ntohl(chunk->subh.data_hdr->tsn);
1059 sctp_tsnmap_mark(&asoc->peer.tsn_map, tsn);
1060 sctp_ulpq_tail_data(ulpq, chunk, gfp);
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +09001061
Linus Torvalds1da177e2005-04-16 15:20:36 -07001062 sctp_ulpq_partial_delivery(ulpq, chunk, gfp);
1063 }
1064
Hideo Aoki3ab224b2007-12-31 00:11:19 -08001065 sk_mem_reclaim(asoc->base.sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001066 return;
1067}
1068
1069
1070
1071/* Notify the application if an association is aborted and in
1072 * partial delivery mode. Send up any pending received messages.
1073 */
Al Virodd0fc662005-10-07 07:46:04 +01001074void sctp_ulpq_abort_pd(struct sctp_ulpq *ulpq, gfp_t gfp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001075{
1076 struct sctp_ulpevent *ev = NULL;
1077 struct sock *sk;
1078
1079 if (!ulpq->pd_mode)
1080 return;
1081
1082 sk = ulpq->asoc->base.sk;
1083 if (sctp_ulpevent_type_enabled(SCTP_PARTIAL_DELIVERY_EVENT,
1084 &sctp_sk(sk)->subscribe))
1085 ev = sctp_ulpevent_make_pdapi(ulpq->asoc,
1086 SCTP_PARTIAL_DELIVERY_ABORTED,
1087 gfp);
1088 if (ev)
1089 __skb_queue_tail(&sk->sk_receive_queue, sctp_event2skb(ev));
1090
1091 /* If there is data waiting, send it up the socket now. */
1092 if (sctp_ulpq_clear_pd(ulpq) || ev)
1093 sk->sk_data_ready(sk, 0);
1094}