| 1 | |
| 2 | * (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 | *
|
| 11 | * The SCTP reference implementation is free software;
|
| 12 | * 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 | *
|
| 17 | * The SCTP reference implementation is distributed in the hope that it
|
| 18 | * 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 <[email protected]>
|
| 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 <[email protected]>
|
| 37 | * La Monte H.P. Yarroll <[email protected]>
|
| 38 | * Sridhar Samudrala <[email protected]>
|
| 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 |
|
| 52 | static struct sctp_ulpevent * sctp_ulpq_reasm(struct sctp_ulpq *ulpq,
|
| 53 | struct sctp_ulpevent *);
|
| 54 | static struct sctp_ulpevent * sctp_ulpq_order(struct sctp_ulpq *,
|
| 55 | struct sctp_ulpevent *);
|
| 56 |
|
| 57 |
|
| 58 |
|
| 59 |
|
| 60 | struct sctp_ulpq *sctp_ulpq_init(struct sctp_ulpq *ulpq,
|
| 61 | struct sctp_association *asoc)
|
| 62 | {
|
| 63 | memset(ulpq, 0, sizeof(struct sctp_ulpq));
|
| 64 |
|
| 65 | ulpq->asoc = asoc;
|
| 66 | skb_queue_head_init(&ulpq->reasm);
|
| 67 | skb_queue_head_init(&ulpq->lobby);
|
| 68 | ulpq->pd_mode = 0;
|
| 69 | ulpq->malloced = 0;
|
| 70 |
|
| 71 | return ulpq;
|
| 72 | }
|
| 73 |
|
| 74 |
|
| 75 |
|
| 76 | void sctp_ulpq_flush(struct sctp_ulpq *ulpq)
|
| 77 | {
|
| 78 | struct sk_buff *skb;
|
| 79 | struct sctp_ulpevent *event;
|
| 80 |
|
| 81 | while ((skb = __skb_dequeue(&ulpq->lobby)) != NULL) {
|
| 82 | event = sctp_skb2event(skb);
|
| 83 | sctp_ulpevent_free(event);
|
| 84 | }
|
| 85 |
|
| 86 | while ((skb = __skb_dequeue(&ulpq->reasm)) != NULL) {
|
| 87 | event = sctp_skb2event(skb);
|
| 88 | sctp_ulpevent_free(event);
|
| 89 | }
|
| 90 |
|
| 91 | }
|
| 92 |
|
| 93 |
|
| 94 | void sctp_ulpq_free(struct sctp_ulpq *ulpq)
|
| 95 | {
|
| 96 | sctp_ulpq_flush(ulpq);
|
| 97 | if (ulpq->malloced)
|
| 98 | kfree(ulpq);
|
| 99 | }
|
| 100 |
|
| 101 |
|
| 102 | int sctp_ulpq_tail_data(struct sctp_ulpq *ulpq, struct sctp_chunk *chunk,
|
| 103 | gfp_t gfp)
|
| 104 | {
|
| 105 | struct sk_buff_head temp;
|
| 106 | sctp_data_chunk_t *hdr;
|
| 107 | struct sctp_ulpevent *event;
|
| 108 |
|
| 109 | hdr = (sctp_data_chunk_t *) chunk->chunk_hdr;
|
| 110 |
|
| 111 |
|
| 112 | event = sctp_ulpevent_make_rcvmsg(chunk->asoc, chunk, gfp);
|
| 113 | if (!event)
|
| 114 | return -ENOMEM;
|
| 115 |
|
| 116 |
|
| 117 | event = sctp_ulpq_reasm(ulpq, event);
|
| 118 |
|
| 119 |
|
| 120 | if ((event) && (event->msg_flags & MSG_EOR)){
|
| 121 |
|
| 122 | skb_queue_head_init(&temp);
|
| 123 | __skb_queue_tail(&temp, sctp_event2skb(event));
|
| 124 |
|
| 125 | event = sctp_ulpq_order(ulpq, event);
|
| 126 | }
|
| 127 |
|
| 128 | |
| 129 | * very first SKB on the 'temp' list.
|
| 130 |
|
| 131 | if (event)
|
| 132 | sctp_ulpq_tail_event(ulpq, event);
|
| 133 |
|
| 134 | return 0;
|
| 135 | }
|
| 136 |
|
| 137 |
|
| 138 | |
| 139 | * assumes that no association is currently in partial delivery mode.
|
| 140 |
|
| 141 | int sctp_clear_pd(struct sock *sk)
|
| 142 | {
|
| 143 | struct sctp_sock *sp = sctp_sk(sk);
|
| 144 |
|
| 145 | sp->pd_mode = 0;
|
| 146 | if (!skb_queue_empty(&sp->pd_lobby)) {
|
| 147 | struct list_head *list;
|
| 148 | sctp_skb_list_tail(&sp->pd_lobby, &sk->sk_receive_queue);
|
| 149 | list = (struct list_head *)&sctp_sk(sk)->pd_lobby;
|
| 150 | INIT_LIST_HEAD(list);
|
| 151 | return 1;
|
| 152 | }
|
| 153 | return 0;
|
| 154 | }
|
| 155 |
|
| 156 |
|
| 157 | static int sctp_ulpq_clear_pd(struct sctp_ulpq *ulpq)
|
| 158 | {
|
| 159 | ulpq->pd_mode = 0;
|
| 160 | return sctp_clear_pd(ulpq->asoc->base.sk);
|
| 161 | }
|
| 162 |
|
| 163 | |
| 164 | * of that list.
|
| 165 |
|
| 166 | int sctp_ulpq_tail_event(struct sctp_ulpq *ulpq, struct sctp_ulpevent *event)
|
| 167 | {
|
| 168 | struct sock *sk = ulpq->asoc->base.sk;
|
| 169 | struct sk_buff_head *queue, *skb_list;
|
| 170 | struct sk_buff *skb = sctp_event2skb(event);
|
| 171 | int clear_pd = 0;
|
| 172 |
|
| 173 | skb_list = (struct sk_buff_head *) skb->prev;
|
| 174 |
|
| 175 | |
| 176 | * even try to deliver it.
|
| 177 |
|
| 178 | if (sock_flag(sk, SOCK_DEAD) || (sk->sk_shutdown & RCV_SHUTDOWN))
|
| 179 | goto out_free;
|
| 180 |
|
| 181 |
|
| 182 | if (!sctp_ulpevent_is_enabled(event, &sctp_sk(sk)->subscribe))
|
| 183 | goto out_free;
|
| 184 |
|
| 185 | |
| 186 | * partial delivery is cleared, unless, of course _this_ is
|
| 187 | * the association the cause of the partial delivery.
|
| 188 |
|
| 189 |
|
| 190 | if (!sctp_sk(sk)->pd_mode) {
|
| 191 | queue = &sk->sk_receive_queue;
|
| 192 | } else if (ulpq->pd_mode) {
|
| 193 | |
| 194 | * need to finish delivering the partially processed
|
| 195 | * packet before passing any other data. This is
|
| 196 | * because we don't truly support stream interleaving.
|
| 197 |
|
| 198 | if ((event->msg_flags & MSG_NOTIFICATION) ||
|
| 199 | (SCTP_DATA_NOT_FRAG ==
|
| 200 | (event->msg_flags & SCTP_DATA_FRAG_MASK)))
|
| 201 | queue = &sctp_sk(sk)->pd_lobby;
|
| 202 | else {
|
| 203 | clear_pd = event->msg_flags & MSG_EOR;
|
| 204 | queue = &sk->sk_receive_queue;
|
| 205 | }
|
| 206 | } else
|
| 207 | queue = &sctp_sk(sk)->pd_lobby;
|
| 208 |
|
| 209 |
|
| 210 | |
| 211 | * collected on a list.
|
| 212 |
|
| 213 | if (skb_list)
|
| 214 | sctp_skb_list_tail(skb_list, queue);
|
| 215 | else
|
| 216 | __skb_queue_tail(queue, skb);
|
| 217 |
|
| 218 | |
| 219 | * rolling again? Move pending data to the receive
|
| 220 | * queue.
|
| 221 |
|
| 222 | if (clear_pd)
|
| 223 | sctp_ulpq_clear_pd(ulpq);
|
| 224 |
|
| 225 | if (queue == &sk->sk_receive_queue)
|
| 226 | sk->sk_data_ready(sk, 0);
|
| 227 | return 1;
|
| 228 |
|
| 229 | out_free:
|
| 230 | if (skb_list)
|
| 231 | sctp_queue_purge_ulpevents(skb_list);
|
| 232 | else
|
| 233 | sctp_ulpevent_free(event);
|
| 234 |
|
| 235 | return 0;
|
| 236 | }
|
| 237 |
|
| 238 |
|
| 239 |
|
| 240 |
|
| 241 | static inline void sctp_ulpq_store_reasm(struct sctp_ulpq *ulpq,
|
| 242 | struct sctp_ulpevent *event)
|
| 243 | {
|
| 244 | struct sk_buff *pos;
|
| 245 | struct sctp_ulpevent *cevent;
|
| 246 | __u32 tsn, ctsn;
|
| 247 |
|
| 248 | tsn = event->tsn;
|
| 249 |
|
| 250 |
|
| 251 | pos = skb_peek_tail(&ulpq->reasm);
|
| 252 | if (!pos) {
|
| 253 | __skb_queue_tail(&ulpq->reasm, sctp_event2skb(event));
|
| 254 | return;
|
| 255 | }
|
| 256 |
|
| 257 |
|
| 258 | cevent = sctp_skb2event(pos);
|
| 259 | ctsn = cevent->tsn;
|
| 260 | if (TSN_lt(ctsn, tsn)) {
|
| 261 | __skb_queue_tail(&ulpq->reasm, sctp_event2skb(event));
|
| 262 | return;
|
| 263 | }
|
| 264 |
|
| 265 |
|
| 266 | skb_queue_walk(&ulpq->reasm, pos) {
|
| 267 | cevent = sctp_skb2event(pos);
|
| 268 | ctsn = cevent->tsn;
|
| 269 |
|
| 270 | if (TSN_lt(tsn, ctsn))
|
| 271 | break;
|
| 272 | }
|
| 273 |
|
| 274 |
|
| 275 | __skb_insert(sctp_event2skb(event), pos->prev, pos, &ulpq->reasm);
|
| 276 |
|
| 277 | }
|
| 278 |
|
| 279 | |
| 280 | * datagram.
|
| 281 | * This routine creates a re-assembled skb given the first and last skb's
|
| 282 | * as stored in the reassembly queue. The skb's may be non-linear if the sctp
|
| 283 | * payload was fragmented on the way and ip had to reassemble them.
|
| 284 | * We add the rest of skb's to the first skb's fraglist.
|
| 285 |
|
| 286 | static struct sctp_ulpevent *sctp_make_reassembled_event(struct sk_buff_head *queue, struct sk_buff *f_frag, struct sk_buff *l_frag)
|
| 287 | {
|
| 288 | struct sk_buff *pos;
|
| 289 | struct sk_buff *new = NULL;
|
| 290 | struct sctp_ulpevent *event;
|
| 291 | struct sk_buff *pnext, *last;
|
| 292 | struct sk_buff *list = skb_shinfo(f_frag)->frag_list;
|
| 293 |
|
| 294 |
|
| 295 | if (f_frag == l_frag)
|
| 296 | pos = NULL;
|
| 297 | else
|
| 298 | pos = f_frag->next;
|
| 299 |
|
| 300 |
|
| 301 | for (last = list; list; last = list, list = list->next);
|
| 302 |
|
| 303 | |
| 304 | * frag_list.
|
| 305 |
|
| 306 | if (last)
|
| 307 | last->next = pos;
|
| 308 | else {
|
| 309 | if (skb_cloned(f_frag)) {
|
| 310 | |
| 311 | * the frag_list. We need a new skb to do that.
|
| 312 | * Instead of calling skb_unshare(), we'll do it
|
| 313 | * ourselves since we need to delay the free.
|
| 314 |
|
| 315 | new = skb_copy(f_frag, GFP_ATOMIC);
|
| 316 | if (!new)
|
| 317 | return NULL;
|
| 318 |
|
| 319 | sctp_skb_set_owner_r(new, f_frag->sk);
|
| 320 |
|
| 321 | skb_shinfo(new)->frag_list = pos;
|
| 322 | } else
|
| 323 | skb_shinfo(f_frag)->frag_list = pos;
|
| 324 | }
|
| 325 |
|
| 326 |
|
| 327 | __skb_unlink(f_frag, queue);
|
| 328 |
|
| 329 |
|
| 330 | if (new) {
|
| 331 | kfree_skb(f_frag);
|
| 332 | f_frag = new;
|
| 333 | }
|
| 334 |
|
| 335 | while (pos) {
|
| 336 |
|
| 337 | pnext = pos->next;
|
| 338 |
|
| 339 |
|
| 340 | f_frag->len += pos->len;
|
| 341 | f_frag->data_len += pos->len;
|
| 342 |
|
| 343 |
|
| 344 | __skb_unlink(pos, queue);
|
| 345 |
|
| 346 |
|
| 347 | if (pos == l_frag)
|
| 348 | break;
|
| 349 | pos->next = pnext;
|
| 350 | pos = pnext;
|
| 351 | };
|
| 352 |
|
| 353 | event = sctp_skb2event(f_frag);
|
| 354 | SCTP_INC_STATS(SCTP_MIB_REASMUSRMSGS);
|
| 355 |
|
| 356 | return event;
|
| 357 | }
|
| 358 |
|
| 359 |
|
| 360 | |
| 361 | * missing fragment in a SCTP datagram and return the corresponding event.
|
| 362 |
|
| 363 | static inline struct sctp_ulpevent *sctp_ulpq_retrieve_reassembled(struct sctp_ulpq *ulpq)
|
| 364 | {
|
| 365 | struct sk_buff *pos;
|
| 366 | struct sctp_ulpevent *cevent;
|
| 367 | struct sk_buff *first_frag = NULL;
|
| 368 | __u32 ctsn, next_tsn;
|
| 369 | struct sctp_ulpevent *retval = NULL;
|
| 370 |
|
| 371 | |
| 372 | * never be used with this value. It is referenced only after it
|
| 373 | * is set when we find the first fragment of a message.
|
| 374 |
|
| 375 | next_tsn = 0;
|
| 376 |
|
| 377 | |
| 378 | * Walk through the queue sequentially and look for a sequence of
|
| 379 | * fragmented chunks that complete a datagram.
|
| 380 | * 'first_frag' and next_tsn are reset when we find a chunk which
|
| 381 | * is the first fragment of a datagram. Once these 2 fields are set
|
| 382 | * we expect to find the remaining middle fragments and the last
|
| 383 | * fragment in order. If not, first_frag is reset to NULL and we
|
| 384 | * start the next pass when we find another first fragment.
|
| 385 |
|
| 386 | skb_queue_walk(&ulpq->reasm, pos) {
|
| 387 | cevent = sctp_skb2event(pos);
|
| 388 | ctsn = cevent->tsn;
|
| 389 |
|
| 390 | switch (cevent->msg_flags & SCTP_DATA_FRAG_MASK) {
|
| 391 | case SCTP_DATA_FIRST_FRAG:
|
| 392 | first_frag = pos;
|
| 393 | next_tsn = ctsn + 1;
|
| 394 | break;
|
| 395 |
|
| 396 | case SCTP_DATA_MIDDLE_FRAG:
|
| 397 | if ((first_frag) && (ctsn == next_tsn))
|
| 398 | next_tsn++;
|
| 399 | else
|
| 400 | first_frag = NULL;
|
| 401 | break;
|
| 402 |
|
| 403 | case SCTP_DATA_LAST_FRAG:
|
| 404 | if (first_frag && (ctsn == next_tsn))
|
| 405 | goto found;
|
| 406 | else
|
| 407 | first_frag = NULL;
|
| 408 | break;
|
| 409 | };
|
| 410 |
|
| 411 | }
|
| 412 | done:
|
| 413 | return retval;
|
| 414 | found:
|
| 415 | retval = sctp_make_reassembled_event(&ulpq->reasm, first_frag, pos);
|
| 416 | if (retval)
|
| 417 | retval->msg_flags |= MSG_EOR;
|
| 418 | goto done;
|
| 419 | }
|
| 420 |
|
| 421 |
|
| 422 | static inline struct sctp_ulpevent *sctp_ulpq_retrieve_partial(struct sctp_ulpq *ulpq)
|
| 423 | {
|
| 424 | struct sk_buff *pos, *last_frag, *first_frag;
|
| 425 | struct sctp_ulpevent *cevent;
|
| 426 | __u32 ctsn, next_tsn;
|
| 427 | int is_last;
|
| 428 | struct sctp_ulpevent *retval;
|
| 429 |
|
| 430 | |
| 431 | * Walk through the queue sequentially and look for the first
|
| 432 | * sequence of fragmented chunks.
|
| 433 |
|
| 434 |
|
| 435 | if (skb_queue_empty(&ulpq->reasm))
|
| 436 | return NULL;
|
| 437 |
|
| 438 | last_frag = first_frag = NULL;
|
| 439 | retval = NULL;
|
| 440 | next_tsn = 0;
|
| 441 | is_last = 0;
|
| 442 |
|
| 443 | skb_queue_walk(&ulpq->reasm, pos) {
|
| 444 | cevent = sctp_skb2event(pos);
|
| 445 | ctsn = cevent->tsn;
|
| 446 |
|
| 447 | switch (cevent->msg_flags & SCTP_DATA_FRAG_MASK) {
|
| 448 | case SCTP_DATA_MIDDLE_FRAG:
|
| 449 | if (!first_frag) {
|
| 450 | first_frag = pos;
|
| 451 | next_tsn = ctsn + 1;
|
| 452 | last_frag = pos;
|
| 453 | } else if (next_tsn == ctsn)
|
| 454 | next_tsn++;
|
| 455 | else
|
| 456 | goto done;
|
| 457 | break;
|
| 458 | case SCTP_DATA_LAST_FRAG:
|
| 459 | if (!first_frag)
|
| 460 | first_frag = pos;
|
| 461 | else if (ctsn != next_tsn)
|
| 462 | goto done;
|
| 463 | last_frag = pos;
|
| 464 | is_last = 1;
|
| 465 | goto done;
|
| 466 | default:
|
| 467 | return NULL;
|
| 468 | };
|
| 469 | }
|
| 470 |
|
| 471 | |
| 472 | * further.
|
| 473 |
|
| 474 | done:
|
| 475 | retval = sctp_make_reassembled_event(&ulpq->reasm, first_frag, last_frag);
|
| 476 | if (retval && is_last)
|
| 477 | retval->msg_flags |= MSG_EOR;
|
| 478 |
|
| 479 | return retval;
|
| 480 | }
|
| 481 |
|
| 482 |
|
| 483 | |
| 484 | * need reassembling.
|
| 485 |
|
| 486 | static struct sctp_ulpevent *sctp_ulpq_reasm(struct sctp_ulpq *ulpq,
|
| 487 | struct sctp_ulpevent *event)
|
| 488 | {
|
| 489 | struct sctp_ulpevent *retval = NULL;
|
| 490 |
|
| 491 |
|
| 492 | if (SCTP_DATA_NOT_FRAG == (event->msg_flags & SCTP_DATA_FRAG_MASK)) {
|
| 493 | event->msg_flags |= MSG_EOR;
|
| 494 | return event;
|
| 495 | }
|
| 496 |
|
| 497 | sctp_ulpq_store_reasm(ulpq, event);
|
| 498 | if (!ulpq->pd_mode)
|
| 499 | retval = sctp_ulpq_retrieve_reassembled(ulpq);
|
| 500 | else {
|
| 501 | __u32 ctsn, ctsnap;
|
| 502 |
|
| 503 | |
| 504 | * be delivered.
|
| 505 |
|
| 506 | ctsn = event->tsn;
|
| 507 | ctsnap = sctp_tsnmap_get_ctsn(&ulpq->asoc->peer.tsn_map);
|
| 508 | if (TSN_lte(ctsn, ctsnap))
|
| 509 | retval = sctp_ulpq_retrieve_partial(ulpq);
|
| 510 | }
|
| 511 |
|
| 512 | return retval;
|
| 513 | }
|
| 514 |
|
| 515 |
|
| 516 | static inline struct sctp_ulpevent *sctp_ulpq_retrieve_first(struct sctp_ulpq *ulpq)
|
| 517 | {
|
| 518 | struct sk_buff *pos, *last_frag, *first_frag;
|
| 519 | struct sctp_ulpevent *cevent;
|
| 520 | __u32 ctsn, next_tsn;
|
| 521 | struct sctp_ulpevent *retval;
|
| 522 |
|
| 523 | |
| 524 | * Walk through the queue sequentially and look for a sequence of
|
| 525 | * fragmented chunks that start a datagram.
|
| 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 |
|
| 535 | skb_queue_walk(&ulpq->reasm, pos) {
|
| 536 | cevent = sctp_skb2event(pos);
|
| 537 | ctsn = cevent->tsn;
|
| 538 |
|
| 539 | switch (cevent->msg_flags & SCTP_DATA_FRAG_MASK) {
|
| 540 | case SCTP_DATA_FIRST_FRAG:
|
| 541 | if (!first_frag) {
|
| 542 | first_frag = pos;
|
| 543 | next_tsn = ctsn + 1;
|
| 544 | last_frag = pos;
|
| 545 | } else
|
| 546 | goto done;
|
| 547 | break;
|
| 548 |
|
| 549 | case SCTP_DATA_MIDDLE_FRAG:
|
| 550 | if (!first_frag)
|
| 551 | return NULL;
|
| 552 | if (ctsn == next_tsn) {
|
| 553 | next_tsn++;
|
| 554 | last_frag = pos;
|
| 555 | } else
|
| 556 | goto done;
|
| 557 | break;
|
| 558 | default:
|
| 559 | return NULL;
|
| 560 | };
|
| 561 | }
|
| 562 |
|
| 563 | |
| 564 | * further.
|
| 565 |
|
| 566 | done:
|
| 567 | retval = sctp_make_reassembled_event(&ulpq->reasm, first_frag, last_frag);
|
| 568 | return retval;
|
| 569 | }
|
| 570 |
|
| 571 | |
| 572 | * ordered by an an incoming chunk.
|
| 573 |
|
| 574 | static inline void sctp_ulpq_retrieve_ordered(struct sctp_ulpq *ulpq,
|
| 575 | struct sctp_ulpevent *event)
|
| 576 | {
|
| 577 | struct sk_buff_head *event_list;
|
| 578 | struct sk_buff *pos, *tmp;
|
| 579 | struct sctp_ulpevent *cevent;
|
| 580 | struct sctp_stream *in;
|
| 581 | __u16 sid, csid;
|
| 582 | __u16 ssn, cssn;
|
| 583 |
|
| 584 | sid = event->stream;
|
| 585 | ssn = event->ssn;
|
| 586 | in = &ulpq->asoc->ssnmap->in;
|
| 587 |
|
| 588 | event_list = (struct sk_buff_head *) sctp_event2skb(event)->prev;
|
| 589 |
|
| 590 |
|
| 591 | sctp_skb_for_each(pos, &ulpq->lobby, tmp) {
|
| 592 | cevent = (struct sctp_ulpevent *) pos->cb;
|
| 593 | csid = cevent->stream;
|
| 594 | cssn = cevent->ssn;
|
| 595 |
|
| 596 |
|
| 597 | if (csid > sid)
|
| 598 | break;
|
| 599 |
|
| 600 |
|
| 601 | if (csid < sid)
|
| 602 | continue;
|
| 603 |
|
| 604 | if (cssn != sctp_ssn_peek(in, sid))
|
| 605 | break;
|
| 606 |
|
| 607 |
|
| 608 | sctp_ssn_next(in, sid);
|
| 609 |
|
| 610 | __skb_unlink(pos, &ulpq->lobby);
|
| 611 |
|
| 612 |
|
| 613 | __skb_queue_tail(event_list, pos);
|
| 614 | }
|
| 615 | }
|
| 616 |
|
| 617 |
|
| 618 | static inline void sctp_ulpq_store_ordered(struct sctp_ulpq *ulpq,
|
| 619 | struct sctp_ulpevent *event)
|
| 620 | {
|
| 621 | struct sk_buff *pos;
|
| 622 | struct sctp_ulpevent *cevent;
|
| 623 | __u16 sid, csid;
|
| 624 | __u16 ssn, cssn;
|
| 625 |
|
| 626 | pos = skb_peek_tail(&ulpq->lobby);
|
| 627 | if (!pos) {
|
| 628 | __skb_queue_tail(&ulpq->lobby, sctp_event2skb(event));
|
| 629 | return;
|
| 630 | }
|
| 631 |
|
| 632 | sid = event->stream;
|
| 633 | ssn = event->ssn;
|
| 634 |
|
| 635 | cevent = (struct sctp_ulpevent *) pos->cb;
|
| 636 | csid = cevent->stream;
|
| 637 | cssn = cevent->ssn;
|
| 638 | if (sid > csid) {
|
| 639 | __skb_queue_tail(&ulpq->lobby, sctp_event2skb(event));
|
| 640 | return;
|
| 641 | }
|
| 642 |
|
| 643 | if ((sid == csid) && SSN_lt(cssn, ssn)) {
|
| 644 | __skb_queue_tail(&ulpq->lobby, sctp_event2skb(event));
|
| 645 | return;
|
| 646 | }
|
| 647 |
|
| 648 | |
| 649 | * stream ID and then by SSN.
|
| 650 |
|
| 651 | skb_queue_walk(&ulpq->lobby, pos) {
|
| 652 | cevent = (struct sctp_ulpevent *) pos->cb;
|
| 653 | csid = cevent->stream;
|
| 654 | cssn = cevent->ssn;
|
| 655 |
|
| 656 | if (csid > sid)
|
| 657 | break;
|
| 658 | if (csid == sid && SSN_lt(ssn, cssn))
|
| 659 | break;
|
| 660 | }
|
| 661 |
|
| 662 |
|
| 663 |
|
| 664 | __skb_insert(sctp_event2skb(event), pos->prev, pos, &ulpq->lobby);
|
| 665 |
|
| 666 | }
|
| 667 |
|
| 668 | static struct sctp_ulpevent *sctp_ulpq_order(struct sctp_ulpq *ulpq,
|
| 669 | struct sctp_ulpevent *event)
|
| 670 | {
|
| 671 | __u16 sid, ssn;
|
| 672 | struct sctp_stream *in;
|
| 673 |
|
| 674 |
|
| 675 | if (SCTP_DATA_UNORDERED & event->msg_flags)
|
| 676 | return event;
|
| 677 |
|
| 678 |
|
| 679 | sid = event->stream;
|
| 680 | ssn = event->ssn;
|
| 681 | in = &ulpq->asoc->ssnmap->in;
|
| 682 |
|
| 683 |
|
| 684 | if (ssn != sctp_ssn_peek(in, sid)) {
|
| 685 | |
| 686 | * needs to be placed. We order by stream and then by SSN.
|
| 687 |
|
| 688 | sctp_ulpq_store_ordered(ulpq, event);
|
| 689 | return NULL;
|
| 690 | }
|
| 691 |
|
| 692 |
|
| 693 | sctp_ssn_next(in, sid);
|
| 694 |
|
| 695 | |
| 696 | * ordering.
|
| 697 |
|
| 698 | sctp_ulpq_retrieve_ordered(ulpq, event);
|
| 699 |
|
| 700 | return event;
|
| 701 | }
|
| 702 |
|
| 703 | |
| 704 | * ordered by forward tsn skipping their dependencies.
|
| 705 |
|
| 706 | static inline void sctp_ulpq_reap_ordered(struct sctp_ulpq *ulpq)
|
| 707 | {
|
| 708 | struct sk_buff *pos, *tmp;
|
| 709 | struct sctp_ulpevent *cevent;
|
| 710 | struct sctp_ulpevent *event;
|
| 711 | struct sctp_stream *in;
|
| 712 | struct sk_buff_head temp;
|
| 713 | __u16 csid, cssn;
|
| 714 |
|
| 715 | in = &ulpq->asoc->ssnmap->in;
|
| 716 |
|
| 717 |
|
| 718 | skb_queue_head_init(&temp);
|
| 719 | event = NULL;
|
| 720 | sctp_skb_for_each(pos, &ulpq->lobby, tmp) {
|
| 721 | cevent = (struct sctp_ulpevent *) pos->cb;
|
| 722 | csid = cevent->stream;
|
| 723 | cssn = cevent->ssn;
|
| 724 |
|
| 725 | if (cssn != sctp_ssn_peek(in, csid))
|
| 726 | break;
|
| 727 |
|
| 728 |
|
| 729 | sctp_ssn_next(in, csid);
|
| 730 |
|
| 731 | __skb_unlink(pos, &ulpq->lobby);
|
| 732 | if (!event) {
|
| 733 |
|
| 734 | event = sctp_skb2event(pos);
|
| 735 | __skb_queue_tail(&temp, sctp_event2skb(event));
|
| 736 | } else {
|
| 737 |
|
| 738 | __skb_queue_tail(&temp, pos);
|
| 739 | }
|
| 740 | }
|
| 741 |
|
| 742 | |
| 743 | * very first SKB on the 'temp' list.
|
| 744 |
|
| 745 | if (event)
|
| 746 | sctp_ulpq_tail_event(ulpq, event);
|
| 747 | }
|
| 748 |
|
| 749 |
|
| 750 | void sctp_ulpq_skip(struct sctp_ulpq *ulpq, __u16 sid, __u16 ssn)
|
| 751 | {
|
| 752 | struct sctp_stream *in;
|
| 753 |
|
| 754 |
|
| 755 | in = &ulpq->asoc->ssnmap->in;
|
| 756 |
|
| 757 |
|
| 758 | if (SSN_lt(ssn, sctp_ssn_peek(in, sid)))
|
| 759 | return;
|
| 760 |
|
| 761 |
|
| 762 | sctp_ssn_skip(in, sid, ssn);
|
| 763 |
|
| 764 | |
| 765 | * ordering and deliver them if needed.
|
| 766 |
|
| 767 | sctp_ulpq_reap_ordered(ulpq);
|
| 768 | return;
|
| 769 | }
|
| 770 |
|
| 771 |
|
| 772 | static __u16 sctp_ulpq_renege_order(struct sctp_ulpq *ulpq, __u16 needed)
|
| 773 | {
|
| 774 | __u16 freed = 0;
|
| 775 | __u32 tsn;
|
| 776 | struct sk_buff *skb;
|
| 777 | struct sctp_ulpevent *event;
|
| 778 | struct sctp_tsnmap *tsnmap;
|
| 779 |
|
| 780 | tsnmap = &ulpq->asoc->peer.tsn_map;
|
| 781 |
|
| 782 | while ((skb = __skb_dequeue_tail(&ulpq->lobby)) != NULL) {
|
| 783 | freed += skb_headlen(skb);
|
| 784 | event = sctp_skb2event(skb);
|
| 785 | tsn = event->tsn;
|
| 786 |
|
| 787 | sctp_ulpevent_free(event);
|
| 788 | sctp_tsnmap_renege(tsnmap, tsn);
|
| 789 | if (freed >= needed)
|
| 790 | return freed;
|
| 791 | }
|
| 792 |
|
| 793 | return freed;
|
| 794 | }
|
| 795 |
|
| 796 |
|
| 797 | static __u16 sctp_ulpq_renege_frags(struct sctp_ulpq *ulpq, __u16 needed)
|
| 798 | {
|
| 799 | __u16 freed = 0;
|
| 800 | __u32 tsn;
|
| 801 | struct sk_buff *skb;
|
| 802 | struct sctp_ulpevent *event;
|
| 803 | struct sctp_tsnmap *tsnmap;
|
| 804 |
|
| 805 | tsnmap = &ulpq->asoc->peer.tsn_map;
|
| 806 |
|
| 807 |
|
| 808 | while ((skb = __skb_dequeue_tail(&ulpq->reasm)) != NULL) {
|
| 809 | freed += skb_headlen(skb);
|
| 810 | event = sctp_skb2event(skb);
|
| 811 | tsn = event->tsn;
|
| 812 |
|
| 813 | sctp_ulpevent_free(event);
|
| 814 | sctp_tsnmap_renege(tsnmap, tsn);
|
| 815 | if (freed >= needed)
|
| 816 | return freed;
|
| 817 | }
|
| 818 |
|
| 819 | return freed;
|
| 820 | }
|
| 821 |
|
| 822 |
|
| 823 | void sctp_ulpq_partial_delivery(struct sctp_ulpq *ulpq,
|
| 824 | struct sctp_chunk *chunk,
|
| 825 | gfp_t gfp)
|
| 826 | {
|
| 827 | struct sctp_ulpevent *event;
|
| 828 | struct sctp_association *asoc;
|
| 829 |
|
| 830 | asoc = ulpq->asoc;
|
| 831 |
|
| 832 |
|
| 833 | if (!sctp_sk(asoc->base.sk)->pd_mode) {
|
| 834 |
|
| 835 |
|
| 836 | event = sctp_ulpq_retrieve_first(ulpq);
|
| 837 |
|
| 838 | if (event) {
|
| 839 | sctp_ulpq_tail_event(ulpq, event);
|
| 840 | sctp_sk(asoc->base.sk)->pd_mode = 1;
|
| 841 | ulpq->pd_mode = 1;
|
| 842 | return;
|
| 843 | }
|
| 844 | }
|
| 845 | }
|
| 846 |
|
| 847 |
|
| 848 | void sctp_ulpq_renege(struct sctp_ulpq *ulpq, struct sctp_chunk *chunk,
|
| 849 | gfp_t gfp)
|
| 850 | {
|
| 851 | struct sctp_association *asoc;
|
| 852 | __u16 needed, freed;
|
| 853 |
|
| 854 | asoc = ulpq->asoc;
|
| 855 |
|
| 856 | if (chunk) {
|
| 857 | needed = ntohs(chunk->chunk_hdr->length);
|
| 858 | needed -= sizeof(sctp_data_chunk_t);
|
| 859 | } else
|
| 860 | needed = SCTP_DEFAULT_MAXWINDOW;
|
| 861 |
|
| 862 | freed = 0;
|
| 863 |
|
| 864 | if (skb_queue_empty(&asoc->base.sk->sk_receive_queue)) {
|
| 865 | freed = sctp_ulpq_renege_order(ulpq, needed);
|
| 866 | if (freed < needed) {
|
| 867 | freed += sctp_ulpq_renege_frags(ulpq, needed - freed);
|
| 868 | }
|
| 869 | }
|
| 870 |
|
| 871 | if (chunk && (freed >= needed)) {
|
| 872 | __u32 tsn;
|
| 873 | tsn = ntohl(chunk->subh.data_hdr->tsn);
|
| 874 | sctp_tsnmap_mark(&asoc->peer.tsn_map, tsn);
|
| 875 | sctp_ulpq_tail_data(ulpq, chunk, gfp);
|
| 876 |
|
| 877 | sctp_ulpq_partial_delivery(ulpq, chunk, gfp);
|
| 878 | }
|
| 879 |
|
| 880 | return;
|
| 881 | }
|
| 882 |
|
| 883 |
|
| 884 |
|
| 885 | |
| 886 | * partial delivery mode. Send up any pending received messages.
|
| 887 |
|
| 888 | void sctp_ulpq_abort_pd(struct sctp_ulpq *ulpq, gfp_t gfp)
|
| 889 | {
|
| 890 | struct sctp_ulpevent *ev = NULL;
|
| 891 | struct sock *sk;
|
| 892 |
|
| 893 | if (!ulpq->pd_mode)
|
| 894 | return;
|
| 895 |
|
| 896 | sk = ulpq->asoc->base.sk;
|
| 897 | if (sctp_ulpevent_type_enabled(SCTP_PARTIAL_DELIVERY_EVENT,
|
| 898 | &sctp_sk(sk)->subscribe))
|
| 899 | ev = sctp_ulpevent_make_pdapi(ulpq->asoc,
|
| 900 | SCTP_PARTIAL_DELIVERY_ABORTED,
|
| 901 | gfp);
|
| 902 | if (ev)
|
| 903 | __skb_queue_tail(&sk->sk_receive_queue, sctp_event2skb(ev));
|
| 904 |
|
| 905 |
|
| 906 | if (sctp_ulpq_clear_pd(ulpq) || ev)
|
| 907 | sk->sk_data_ready(sk, 0);
|
| 908 | }
|