Loading...
1/* SCTP kernel implementation
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-2003 Intel Corp.
6 *
7 * This file is part of the SCTP kernel implementation
8 *
9 * These functions implement the sctp_outq class. The outqueue handles
10 * bundling and queueing of outgoing SCTP chunks.
11 *
12 * This SCTP implementation is free software;
13 * you can redistribute it and/or modify it under the terms of
14 * the GNU General Public License as published by
15 * the Free Software Foundation; either version 2, or (at your option)
16 * any later version.
17 *
18 * This SCTP implementation is distributed in the hope that it
19 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
20 * ************************
21 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
22 * See the GNU General Public License for more details.
23 *
24 * You should have received a copy of the GNU General Public License
25 * along with GNU CC; see the file COPYING. If not, write to
26 * the Free Software Foundation, 59 Temple Place - Suite 330,
27 * Boston, MA 02111-1307, USA.
28 *
29 * Please send any bug reports or fixes you make to the
30 * email address(es):
31 * lksctp developers <lksctp-developers@lists.sourceforge.net>
32 *
33 * Or submit a bug report through the following website:
34 * http://www.sf.net/projects/lksctp
35 *
36 * Written or modified by:
37 * La Monte H.P. Yarroll <piggy@acm.org>
38 * Karl Knutson <karl@athena.chicago.il.us>
39 * Perry Melange <pmelange@null.cc.uic.edu>
40 * Xingang Guo <xingang.guo@intel.com>
41 * Hui Huang <hui.huang@nokia.com>
42 * Sridhar Samudrala <sri@us.ibm.com>
43 * Jon Grimm <jgrimm@us.ibm.com>
44 *
45 * Any bugs reported given to us we will try to fix... any fixes shared will
46 * be incorporated into the next SCTP release.
47 */
48
49#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
50
51#include <linux/types.h>
52#include <linux/list.h> /* For struct list_head */
53#include <linux/socket.h>
54#include <linux/ip.h>
55#include <linux/slab.h>
56#include <net/sock.h> /* For skb_set_owner_w */
57
58#include <net/sctp/sctp.h>
59#include <net/sctp/sm.h>
60
61/* Declare internal functions here. */
62static int sctp_acked(struct sctp_sackhdr *sack, __u32 tsn);
63static void sctp_check_transmitted(struct sctp_outq *q,
64 struct list_head *transmitted_queue,
65 struct sctp_transport *transport,
66 struct sctp_sackhdr *sack,
67 __u32 *highest_new_tsn);
68
69static void sctp_mark_missing(struct sctp_outq *q,
70 struct list_head *transmitted_queue,
71 struct sctp_transport *transport,
72 __u32 highest_new_tsn,
73 int count_of_newacks);
74
75static void sctp_generate_fwdtsn(struct sctp_outq *q, __u32 sack_ctsn);
76
77static int sctp_outq_flush(struct sctp_outq *q, int rtx_timeout);
78
79/* Add data to the front of the queue. */
80static inline void sctp_outq_head_data(struct sctp_outq *q,
81 struct sctp_chunk *ch)
82{
83 list_add(&ch->list, &q->out_chunk_list);
84 q->out_qlen += ch->skb->len;
85}
86
87/* Take data from the front of the queue. */
88static inline struct sctp_chunk *sctp_outq_dequeue_data(struct sctp_outq *q)
89{
90 struct sctp_chunk *ch = NULL;
91
92 if (!list_empty(&q->out_chunk_list)) {
93 struct list_head *entry = q->out_chunk_list.next;
94
95 ch = list_entry(entry, struct sctp_chunk, list);
96 list_del_init(entry);
97 q->out_qlen -= ch->skb->len;
98 }
99 return ch;
100}
101/* Add data chunk to the end of the queue. */
102static inline void sctp_outq_tail_data(struct sctp_outq *q,
103 struct sctp_chunk *ch)
104{
105 list_add_tail(&ch->list, &q->out_chunk_list);
106 q->out_qlen += ch->skb->len;
107}
108
109/*
110 * SFR-CACC algorithm:
111 * D) If count_of_newacks is greater than or equal to 2
112 * and t was not sent to the current primary then the
113 * sender MUST NOT increment missing report count for t.
114 */
115static inline int sctp_cacc_skip_3_1_d(struct sctp_transport *primary,
116 struct sctp_transport *transport,
117 int count_of_newacks)
118{
119 if (count_of_newacks >=2 && transport != primary)
120 return 1;
121 return 0;
122}
123
124/*
125 * SFR-CACC algorithm:
126 * F) If count_of_newacks is less than 2, let d be the
127 * destination to which t was sent. If cacc_saw_newack
128 * is 0 for destination d, then the sender MUST NOT
129 * increment missing report count for t.
130 */
131static inline int sctp_cacc_skip_3_1_f(struct sctp_transport *transport,
132 int count_of_newacks)
133{
134 if (count_of_newacks < 2 &&
135 (transport && !transport->cacc.cacc_saw_newack))
136 return 1;
137 return 0;
138}
139
140/*
141 * SFR-CACC algorithm:
142 * 3.1) If CYCLING_CHANGEOVER is 0, the sender SHOULD
143 * execute steps C, D, F.
144 *
145 * C has been implemented in sctp_outq_sack
146 */
147static inline int sctp_cacc_skip_3_1(struct sctp_transport *primary,
148 struct sctp_transport *transport,
149 int count_of_newacks)
150{
151 if (!primary->cacc.cycling_changeover) {
152 if (sctp_cacc_skip_3_1_d(primary, transport, count_of_newacks))
153 return 1;
154 if (sctp_cacc_skip_3_1_f(transport, count_of_newacks))
155 return 1;
156 return 0;
157 }
158 return 0;
159}
160
161/*
162 * SFR-CACC algorithm:
163 * 3.2) Else if CYCLING_CHANGEOVER is 1, and t is less
164 * than next_tsn_at_change of the current primary, then
165 * the sender MUST NOT increment missing report count
166 * for t.
167 */
168static inline int sctp_cacc_skip_3_2(struct sctp_transport *primary, __u32 tsn)
169{
170 if (primary->cacc.cycling_changeover &&
171 TSN_lt(tsn, primary->cacc.next_tsn_at_change))
172 return 1;
173 return 0;
174}
175
176/*
177 * SFR-CACC algorithm:
178 * 3) If the missing report count for TSN t is to be
179 * incremented according to [RFC2960] and
180 * [SCTP_STEWART-2002], and CHANGEOVER_ACTIVE is set,
181 * then the sender MUST further execute steps 3.1 and
182 * 3.2 to determine if the missing report count for
183 * TSN t SHOULD NOT be incremented.
184 *
185 * 3.3) If 3.1 and 3.2 do not dictate that the missing
186 * report count for t should not be incremented, then
187 * the sender SHOULD increment missing report count for
188 * t (according to [RFC2960] and [SCTP_STEWART_2002]).
189 */
190static inline int sctp_cacc_skip(struct sctp_transport *primary,
191 struct sctp_transport *transport,
192 int count_of_newacks,
193 __u32 tsn)
194{
195 if (primary->cacc.changeover_active &&
196 (sctp_cacc_skip_3_1(primary, transport, count_of_newacks) ||
197 sctp_cacc_skip_3_2(primary, tsn)))
198 return 1;
199 return 0;
200}
201
202/* Initialize an existing sctp_outq. This does the boring stuff.
203 * You still need to define handlers if you really want to DO
204 * something with this structure...
205 */
206void sctp_outq_init(struct sctp_association *asoc, struct sctp_outq *q)
207{
208 q->asoc = asoc;
209 INIT_LIST_HEAD(&q->out_chunk_list);
210 INIT_LIST_HEAD(&q->control_chunk_list);
211 INIT_LIST_HEAD(&q->retransmit);
212 INIT_LIST_HEAD(&q->sacked);
213 INIT_LIST_HEAD(&q->abandoned);
214
215 q->fast_rtx = 0;
216 q->outstanding_bytes = 0;
217 q->empty = 1;
218 q->cork = 0;
219
220 q->malloced = 0;
221 q->out_qlen = 0;
222}
223
224/* Free the outqueue structure and any related pending chunks.
225 */
226void sctp_outq_teardown(struct sctp_outq *q)
227{
228 struct sctp_transport *transport;
229 struct list_head *lchunk, *temp;
230 struct sctp_chunk *chunk, *tmp;
231
232 /* Throw away unacknowledged chunks. */
233 list_for_each_entry(transport, &q->asoc->peer.transport_addr_list,
234 transports) {
235 while ((lchunk = sctp_list_dequeue(&transport->transmitted)) != NULL) {
236 chunk = list_entry(lchunk, struct sctp_chunk,
237 transmitted_list);
238 /* Mark as part of a failed message. */
239 sctp_chunk_fail(chunk, q->error);
240 sctp_chunk_free(chunk);
241 }
242 }
243
244 /* Throw away chunks that have been gap ACKed. */
245 list_for_each_safe(lchunk, temp, &q->sacked) {
246 list_del_init(lchunk);
247 chunk = list_entry(lchunk, struct sctp_chunk,
248 transmitted_list);
249 sctp_chunk_fail(chunk, q->error);
250 sctp_chunk_free(chunk);
251 }
252
253 /* Throw away any chunks in the retransmit queue. */
254 list_for_each_safe(lchunk, temp, &q->retransmit) {
255 list_del_init(lchunk);
256 chunk = list_entry(lchunk, struct sctp_chunk,
257 transmitted_list);
258 sctp_chunk_fail(chunk, q->error);
259 sctp_chunk_free(chunk);
260 }
261
262 /* Throw away any chunks that are in the abandoned queue. */
263 list_for_each_safe(lchunk, temp, &q->abandoned) {
264 list_del_init(lchunk);
265 chunk = list_entry(lchunk, struct sctp_chunk,
266 transmitted_list);
267 sctp_chunk_fail(chunk, q->error);
268 sctp_chunk_free(chunk);
269 }
270
271 /* Throw away any leftover data chunks. */
272 while ((chunk = sctp_outq_dequeue_data(q)) != NULL) {
273
274 /* Mark as send failure. */
275 sctp_chunk_fail(chunk, q->error);
276 sctp_chunk_free(chunk);
277 }
278
279 q->error = 0;
280
281 /* Throw away any leftover control chunks. */
282 list_for_each_entry_safe(chunk, tmp, &q->control_chunk_list, list) {
283 list_del_init(&chunk->list);
284 sctp_chunk_free(chunk);
285 }
286}
287
288/* Free the outqueue structure and any related pending chunks. */
289void sctp_outq_free(struct sctp_outq *q)
290{
291 /* Throw away leftover chunks. */
292 sctp_outq_teardown(q);
293
294 /* If we were kmalloc()'d, free the memory. */
295 if (q->malloced)
296 kfree(q);
297}
298
299/* Put a new chunk in an sctp_outq. */
300int sctp_outq_tail(struct sctp_outq *q, struct sctp_chunk *chunk)
301{
302 int error = 0;
303
304 SCTP_DEBUG_PRINTK("sctp_outq_tail(%p, %p[%s])\n",
305 q, chunk, chunk && chunk->chunk_hdr ?
306 sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type))
307 : "Illegal Chunk");
308
309 /* If it is data, queue it up, otherwise, send it
310 * immediately.
311 */
312 if (sctp_chunk_is_data(chunk)) {
313 /* Is it OK to queue data chunks? */
314 /* From 9. Termination of Association
315 *
316 * When either endpoint performs a shutdown, the
317 * association on each peer will stop accepting new
318 * data from its user and only deliver data in queue
319 * at the time of sending or receiving the SHUTDOWN
320 * chunk.
321 */
322 switch (q->asoc->state) {
323 case SCTP_STATE_CLOSED:
324 case SCTP_STATE_SHUTDOWN_PENDING:
325 case SCTP_STATE_SHUTDOWN_SENT:
326 case SCTP_STATE_SHUTDOWN_RECEIVED:
327 case SCTP_STATE_SHUTDOWN_ACK_SENT:
328 /* Cannot send after transport endpoint shutdown */
329 error = -ESHUTDOWN;
330 break;
331
332 default:
333 SCTP_DEBUG_PRINTK("outqueueing (%p, %p[%s])\n",
334 q, chunk, chunk && chunk->chunk_hdr ?
335 sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type))
336 : "Illegal Chunk");
337
338 sctp_outq_tail_data(q, chunk);
339 if (chunk->chunk_hdr->flags & SCTP_DATA_UNORDERED)
340 SCTP_INC_STATS(SCTP_MIB_OUTUNORDERCHUNKS);
341 else
342 SCTP_INC_STATS(SCTP_MIB_OUTORDERCHUNKS);
343 q->empty = 0;
344 break;
345 }
346 } else {
347 list_add_tail(&chunk->list, &q->control_chunk_list);
348 SCTP_INC_STATS(SCTP_MIB_OUTCTRLCHUNKS);
349 }
350
351 if (error < 0)
352 return error;
353
354 if (!q->cork)
355 error = sctp_outq_flush(q, 0);
356
357 return error;
358}
359
360/* Insert a chunk into the sorted list based on the TSNs. The retransmit list
361 * and the abandoned list are in ascending order.
362 */
363static void sctp_insert_list(struct list_head *head, struct list_head *new)
364{
365 struct list_head *pos;
366 struct sctp_chunk *nchunk, *lchunk;
367 __u32 ntsn, ltsn;
368 int done = 0;
369
370 nchunk = list_entry(new, struct sctp_chunk, transmitted_list);
371 ntsn = ntohl(nchunk->subh.data_hdr->tsn);
372
373 list_for_each(pos, head) {
374 lchunk = list_entry(pos, struct sctp_chunk, transmitted_list);
375 ltsn = ntohl(lchunk->subh.data_hdr->tsn);
376 if (TSN_lt(ntsn, ltsn)) {
377 list_add(new, pos->prev);
378 done = 1;
379 break;
380 }
381 }
382 if (!done)
383 list_add_tail(new, head);
384}
385
386/* Mark all the eligible packets on a transport for retransmission. */
387void sctp_retransmit_mark(struct sctp_outq *q,
388 struct sctp_transport *transport,
389 __u8 reason)
390{
391 struct list_head *lchunk, *ltemp;
392 struct sctp_chunk *chunk;
393
394 /* Walk through the specified transmitted queue. */
395 list_for_each_safe(lchunk, ltemp, &transport->transmitted) {
396 chunk = list_entry(lchunk, struct sctp_chunk,
397 transmitted_list);
398
399 /* If the chunk is abandoned, move it to abandoned list. */
400 if (sctp_chunk_abandoned(chunk)) {
401 list_del_init(lchunk);
402 sctp_insert_list(&q->abandoned, lchunk);
403
404 /* If this chunk has not been previousely acked,
405 * stop considering it 'outstanding'. Our peer
406 * will most likely never see it since it will
407 * not be retransmitted
408 */
409 if (!chunk->tsn_gap_acked) {
410 if (chunk->transport)
411 chunk->transport->flight_size -=
412 sctp_data_size(chunk);
413 q->outstanding_bytes -= sctp_data_size(chunk);
414 q->asoc->peer.rwnd += sctp_data_size(chunk);
415 }
416 continue;
417 }
418
419 /* If we are doing retransmission due to a timeout or pmtu
420 * discovery, only the chunks that are not yet acked should
421 * be added to the retransmit queue.
422 */
423 if ((reason == SCTP_RTXR_FAST_RTX &&
424 (chunk->fast_retransmit == SCTP_NEED_FRTX)) ||
425 (reason != SCTP_RTXR_FAST_RTX && !chunk->tsn_gap_acked)) {
426 /* RFC 2960 6.2.1 Processing a Received SACK
427 *
428 * C) Any time a DATA chunk is marked for
429 * retransmission (via either T3-rtx timer expiration
430 * (Section 6.3.3) or via fast retransmit
431 * (Section 7.2.4)), add the data size of those
432 * chunks to the rwnd.
433 */
434 q->asoc->peer.rwnd += sctp_data_size(chunk);
435 q->outstanding_bytes -= sctp_data_size(chunk);
436 if (chunk->transport)
437 transport->flight_size -= sctp_data_size(chunk);
438
439 /* sctpimpguide-05 Section 2.8.2
440 * M5) If a T3-rtx timer expires, the
441 * 'TSN.Missing.Report' of all affected TSNs is set
442 * to 0.
443 */
444 chunk->tsn_missing_report = 0;
445
446 /* If a chunk that is being used for RTT measurement
447 * has to be retransmitted, we cannot use this chunk
448 * anymore for RTT measurements. Reset rto_pending so
449 * that a new RTT measurement is started when a new
450 * data chunk is sent.
451 */
452 if (chunk->rtt_in_progress) {
453 chunk->rtt_in_progress = 0;
454 transport->rto_pending = 0;
455 }
456
457 /* Move the chunk to the retransmit queue. The chunks
458 * on the retransmit queue are always kept in order.
459 */
460 list_del_init(lchunk);
461 sctp_insert_list(&q->retransmit, lchunk);
462 }
463 }
464
465 SCTP_DEBUG_PRINTK("%s: transport: %p, reason: %d, "
466 "cwnd: %d, ssthresh: %d, flight_size: %d, "
467 "pba: %d\n", __func__,
468 transport, reason,
469 transport->cwnd, transport->ssthresh,
470 transport->flight_size,
471 transport->partial_bytes_acked);
472
473}
474
475/* Mark all the eligible packets on a transport for retransmission and force
476 * one packet out.
477 */
478void sctp_retransmit(struct sctp_outq *q, struct sctp_transport *transport,
479 sctp_retransmit_reason_t reason)
480{
481 int error = 0;
482
483 switch(reason) {
484 case SCTP_RTXR_T3_RTX:
485 SCTP_INC_STATS(SCTP_MIB_T3_RETRANSMITS);
486 sctp_transport_lower_cwnd(transport, SCTP_LOWER_CWND_T3_RTX);
487 /* Update the retran path if the T3-rtx timer has expired for
488 * the current retran path.
489 */
490 if (transport == transport->asoc->peer.retran_path)
491 sctp_assoc_update_retran_path(transport->asoc);
492 transport->asoc->rtx_data_chunks +=
493 transport->asoc->unack_data;
494 break;
495 case SCTP_RTXR_FAST_RTX:
496 SCTP_INC_STATS(SCTP_MIB_FAST_RETRANSMITS);
497 sctp_transport_lower_cwnd(transport, SCTP_LOWER_CWND_FAST_RTX);
498 q->fast_rtx = 1;
499 break;
500 case SCTP_RTXR_PMTUD:
501 SCTP_INC_STATS(SCTP_MIB_PMTUD_RETRANSMITS);
502 break;
503 case SCTP_RTXR_T1_RTX:
504 SCTP_INC_STATS(SCTP_MIB_T1_RETRANSMITS);
505 transport->asoc->init_retries++;
506 break;
507 default:
508 BUG();
509 }
510
511 sctp_retransmit_mark(q, transport, reason);
512
513 /* PR-SCTP A5) Any time the T3-rtx timer expires, on any destination,
514 * the sender SHOULD try to advance the "Advanced.Peer.Ack.Point" by
515 * following the procedures outlined in C1 - C5.
516 */
517 if (reason == SCTP_RTXR_T3_RTX)
518 sctp_generate_fwdtsn(q, q->asoc->ctsn_ack_point);
519
520 /* Flush the queues only on timeout, since fast_rtx is only
521 * triggered during sack processing and the queue
522 * will be flushed at the end.
523 */
524 if (reason != SCTP_RTXR_FAST_RTX)
525 error = sctp_outq_flush(q, /* rtx_timeout */ 1);
526
527 if (error)
528 q->asoc->base.sk->sk_err = -error;
529}
530
531/*
532 * Transmit DATA chunks on the retransmit queue. Upon return from
533 * sctp_outq_flush_rtx() the packet 'pkt' may contain chunks which
534 * need to be transmitted by the caller.
535 * We assume that pkt->transport has already been set.
536 *
537 * The return value is a normal kernel error return value.
538 */
539static int sctp_outq_flush_rtx(struct sctp_outq *q, struct sctp_packet *pkt,
540 int rtx_timeout, int *start_timer)
541{
542 struct list_head *lqueue;
543 struct sctp_transport *transport = pkt->transport;
544 sctp_xmit_t status;
545 struct sctp_chunk *chunk, *chunk1;
546 int fast_rtx;
547 int error = 0;
548 int timer = 0;
549 int done = 0;
550
551 lqueue = &q->retransmit;
552 fast_rtx = q->fast_rtx;
553
554 /* This loop handles time-out retransmissions, fast retransmissions,
555 * and retransmissions due to opening of whindow.
556 *
557 * RFC 2960 6.3.3 Handle T3-rtx Expiration
558 *
559 * E3) Determine how many of the earliest (i.e., lowest TSN)
560 * outstanding DATA chunks for the address for which the
561 * T3-rtx has expired will fit into a single packet, subject
562 * to the MTU constraint for the path corresponding to the
563 * destination transport address to which the retransmission
564 * is being sent (this may be different from the address for
565 * which the timer expires [see Section 6.4]). Call this value
566 * K. Bundle and retransmit those K DATA chunks in a single
567 * packet to the destination endpoint.
568 *
569 * [Just to be painfully clear, if we are retransmitting
570 * because a timeout just happened, we should send only ONE
571 * packet of retransmitted data.]
572 *
573 * For fast retransmissions we also send only ONE packet. However,
574 * if we are just flushing the queue due to open window, we'll
575 * try to send as much as possible.
576 */
577 list_for_each_entry_safe(chunk, chunk1, lqueue, transmitted_list) {
578 /* If the chunk is abandoned, move it to abandoned list. */
579 if (sctp_chunk_abandoned(chunk)) {
580 list_del_init(&chunk->transmitted_list);
581 sctp_insert_list(&q->abandoned,
582 &chunk->transmitted_list);
583 continue;
584 }
585
586 /* Make sure that Gap Acked TSNs are not retransmitted. A
587 * simple approach is just to move such TSNs out of the
588 * way and into a 'transmitted' queue and skip to the
589 * next chunk.
590 */
591 if (chunk->tsn_gap_acked) {
592 list_del(&chunk->transmitted_list);
593 list_add_tail(&chunk->transmitted_list,
594 &transport->transmitted);
595 continue;
596 }
597
598 /* If we are doing fast retransmit, ignore non-fast_rtransmit
599 * chunks
600 */
601 if (fast_rtx && !chunk->fast_retransmit)
602 continue;
603
604redo:
605 /* Attempt to append this chunk to the packet. */
606 status = sctp_packet_append_chunk(pkt, chunk);
607
608 switch (status) {
609 case SCTP_XMIT_PMTU_FULL:
610 if (!pkt->has_data && !pkt->has_cookie_echo) {
611 /* If this packet did not contain DATA then
612 * retransmission did not happen, so do it
613 * again. We'll ignore the error here since
614 * control chunks are already freed so there
615 * is nothing we can do.
616 */
617 sctp_packet_transmit(pkt);
618 goto redo;
619 }
620
621 /* Send this packet. */
622 error = sctp_packet_transmit(pkt);
623
624 /* If we are retransmitting, we should only
625 * send a single packet.
626 * Otherwise, try appending this chunk again.
627 */
628 if (rtx_timeout || fast_rtx)
629 done = 1;
630 else
631 goto redo;
632
633 /* Bundle next chunk in the next round. */
634 break;
635
636 case SCTP_XMIT_RWND_FULL:
637 /* Send this packet. */
638 error = sctp_packet_transmit(pkt);
639
640 /* Stop sending DATA as there is no more room
641 * at the receiver.
642 */
643 done = 1;
644 break;
645
646 case SCTP_XMIT_NAGLE_DELAY:
647 /* Send this packet. */
648 error = sctp_packet_transmit(pkt);
649
650 /* Stop sending DATA because of nagle delay. */
651 done = 1;
652 break;
653
654 default:
655 /* The append was successful, so add this chunk to
656 * the transmitted list.
657 */
658 list_del(&chunk->transmitted_list);
659 list_add_tail(&chunk->transmitted_list,
660 &transport->transmitted);
661
662 /* Mark the chunk as ineligible for fast retransmit
663 * after it is retransmitted.
664 */
665 if (chunk->fast_retransmit == SCTP_NEED_FRTX)
666 chunk->fast_retransmit = SCTP_DONT_FRTX;
667
668 q->empty = 0;
669 break;
670 }
671
672 /* Set the timer if there were no errors */
673 if (!error && !timer)
674 timer = 1;
675
676 if (done)
677 break;
678 }
679
680 /* If we are here due to a retransmit timeout or a fast
681 * retransmit and if there are any chunks left in the retransmit
682 * queue that could not fit in the PMTU sized packet, they need
683 * to be marked as ineligible for a subsequent fast retransmit.
684 */
685 if (rtx_timeout || fast_rtx) {
686 list_for_each_entry(chunk1, lqueue, transmitted_list) {
687 if (chunk1->fast_retransmit == SCTP_NEED_FRTX)
688 chunk1->fast_retransmit = SCTP_DONT_FRTX;
689 }
690 }
691
692 *start_timer = timer;
693
694 /* Clear fast retransmit hint */
695 if (fast_rtx)
696 q->fast_rtx = 0;
697
698 return error;
699}
700
701/* Cork the outqueue so queued chunks are really queued. */
702int sctp_outq_uncork(struct sctp_outq *q)
703{
704 int error = 0;
705 if (q->cork)
706 q->cork = 0;
707 error = sctp_outq_flush(q, 0);
708 return error;
709}
710
711
712/*
713 * Try to flush an outqueue.
714 *
715 * Description: Send everything in q which we legally can, subject to
716 * congestion limitations.
717 * * Note: This function can be called from multiple contexts so appropriate
718 * locking concerns must be made. Today we use the sock lock to protect
719 * this function.
720 */
721static int sctp_outq_flush(struct sctp_outq *q, int rtx_timeout)
722{
723 struct sctp_packet *packet;
724 struct sctp_packet singleton;
725 struct sctp_association *asoc = q->asoc;
726 __u16 sport = asoc->base.bind_addr.port;
727 __u16 dport = asoc->peer.port;
728 __u32 vtag = asoc->peer.i.init_tag;
729 struct sctp_transport *transport = NULL;
730 struct sctp_transport *new_transport;
731 struct sctp_chunk *chunk, *tmp;
732 sctp_xmit_t status;
733 int error = 0;
734 int start_timer = 0;
735 int one_packet = 0;
736
737 /* These transports have chunks to send. */
738 struct list_head transport_list;
739 struct list_head *ltransport;
740
741 INIT_LIST_HEAD(&transport_list);
742 packet = NULL;
743
744 /*
745 * 6.10 Bundling
746 * ...
747 * When bundling control chunks with DATA chunks, an
748 * endpoint MUST place control chunks first in the outbound
749 * SCTP packet. The transmitter MUST transmit DATA chunks
750 * within a SCTP packet in increasing order of TSN.
751 * ...
752 */
753
754 list_for_each_entry_safe(chunk, tmp, &q->control_chunk_list, list) {
755 /* RFC 5061, 5.3
756 * F1) This means that until such time as the ASCONF
757 * containing the add is acknowledged, the sender MUST
758 * NOT use the new IP address as a source for ANY SCTP
759 * packet except on carrying an ASCONF Chunk.
760 */
761 if (asoc->src_out_of_asoc_ok &&
762 chunk->chunk_hdr->type != SCTP_CID_ASCONF)
763 continue;
764
765 list_del_init(&chunk->list);
766
767 /* Pick the right transport to use. */
768 new_transport = chunk->transport;
769
770 if (!new_transport) {
771 /*
772 * If we have a prior transport pointer, see if
773 * the destination address of the chunk
774 * matches the destination address of the
775 * current transport. If not a match, then
776 * try to look up the transport with a given
777 * destination address. We do this because
778 * after processing ASCONFs, we may have new
779 * transports created.
780 */
781 if (transport &&
782 sctp_cmp_addr_exact(&chunk->dest,
783 &transport->ipaddr))
784 new_transport = transport;
785 else
786 new_transport = sctp_assoc_lookup_paddr(asoc,
787 &chunk->dest);
788
789 /* if we still don't have a new transport, then
790 * use the current active path.
791 */
792 if (!new_transport)
793 new_transport = asoc->peer.active_path;
794 } else if ((new_transport->state == SCTP_INACTIVE) ||
795 (new_transport->state == SCTP_UNCONFIRMED)) {
796 /* If the chunk is Heartbeat or Heartbeat Ack,
797 * send it to chunk->transport, even if it's
798 * inactive.
799 *
800 * 3.3.6 Heartbeat Acknowledgement:
801 * ...
802 * A HEARTBEAT ACK is always sent to the source IP
803 * address of the IP datagram containing the
804 * HEARTBEAT chunk to which this ack is responding.
805 * ...
806 *
807 * ASCONF_ACKs also must be sent to the source.
808 */
809 if (chunk->chunk_hdr->type != SCTP_CID_HEARTBEAT &&
810 chunk->chunk_hdr->type != SCTP_CID_HEARTBEAT_ACK &&
811 chunk->chunk_hdr->type != SCTP_CID_ASCONF_ACK)
812 new_transport = asoc->peer.active_path;
813 }
814
815 /* Are we switching transports?
816 * Take care of transport locks.
817 */
818 if (new_transport != transport) {
819 transport = new_transport;
820 if (list_empty(&transport->send_ready)) {
821 list_add_tail(&transport->send_ready,
822 &transport_list);
823 }
824 packet = &transport->packet;
825 sctp_packet_config(packet, vtag,
826 asoc->peer.ecn_capable);
827 }
828
829 switch (chunk->chunk_hdr->type) {
830 /*
831 * 6.10 Bundling
832 * ...
833 * An endpoint MUST NOT bundle INIT, INIT ACK or SHUTDOWN
834 * COMPLETE with any other chunks. [Send them immediately.]
835 */
836 case SCTP_CID_INIT:
837 case SCTP_CID_INIT_ACK:
838 case SCTP_CID_SHUTDOWN_COMPLETE:
839 sctp_packet_init(&singleton, transport, sport, dport);
840 sctp_packet_config(&singleton, vtag, 0);
841 sctp_packet_append_chunk(&singleton, chunk);
842 error = sctp_packet_transmit(&singleton);
843 if (error < 0)
844 return error;
845 break;
846
847 case SCTP_CID_ABORT:
848 if (sctp_test_T_bit(chunk)) {
849 packet->vtag = asoc->c.my_vtag;
850 }
851 /* The following chunks are "response" chunks, i.e.
852 * they are generated in response to something we
853 * received. If we are sending these, then we can
854 * send only 1 packet containing these chunks.
855 */
856 case SCTP_CID_HEARTBEAT_ACK:
857 case SCTP_CID_SHUTDOWN_ACK:
858 case SCTP_CID_COOKIE_ACK:
859 case SCTP_CID_COOKIE_ECHO:
860 case SCTP_CID_ERROR:
861 case SCTP_CID_ECN_CWR:
862 case SCTP_CID_ASCONF_ACK:
863 one_packet = 1;
864 /* Fall through */
865
866 case SCTP_CID_SACK:
867 case SCTP_CID_HEARTBEAT:
868 case SCTP_CID_SHUTDOWN:
869 case SCTP_CID_ECN_ECNE:
870 case SCTP_CID_ASCONF:
871 case SCTP_CID_FWD_TSN:
872 status = sctp_packet_transmit_chunk(packet, chunk,
873 one_packet);
874 if (status != SCTP_XMIT_OK) {
875 /* put the chunk back */
876 list_add(&chunk->list, &q->control_chunk_list);
877 } else if (chunk->chunk_hdr->type == SCTP_CID_FWD_TSN) {
878 /* PR-SCTP C5) If a FORWARD TSN is sent, the
879 * sender MUST assure that at least one T3-rtx
880 * timer is running.
881 */
882 sctp_transport_reset_timers(transport);
883 }
884 break;
885
886 default:
887 /* We built a chunk with an illegal type! */
888 BUG();
889 }
890 }
891
892 if (q->asoc->src_out_of_asoc_ok)
893 goto sctp_flush_out;
894
895 /* Is it OK to send data chunks? */
896 switch (asoc->state) {
897 case SCTP_STATE_COOKIE_ECHOED:
898 /* Only allow bundling when this packet has a COOKIE-ECHO
899 * chunk.
900 */
901 if (!packet || !packet->has_cookie_echo)
902 break;
903
904 /* fallthru */
905 case SCTP_STATE_ESTABLISHED:
906 case SCTP_STATE_SHUTDOWN_PENDING:
907 case SCTP_STATE_SHUTDOWN_RECEIVED:
908 /*
909 * RFC 2960 6.1 Transmission of DATA Chunks
910 *
911 * C) When the time comes for the sender to transmit,
912 * before sending new DATA chunks, the sender MUST
913 * first transmit any outstanding DATA chunks which
914 * are marked for retransmission (limited by the
915 * current cwnd).
916 */
917 if (!list_empty(&q->retransmit)) {
918 if (asoc->peer.retran_path->state == SCTP_UNCONFIRMED)
919 goto sctp_flush_out;
920 if (transport == asoc->peer.retran_path)
921 goto retran;
922
923 /* Switch transports & prepare the packet. */
924
925 transport = asoc->peer.retran_path;
926
927 if (list_empty(&transport->send_ready)) {
928 list_add_tail(&transport->send_ready,
929 &transport_list);
930 }
931
932 packet = &transport->packet;
933 sctp_packet_config(packet, vtag,
934 asoc->peer.ecn_capable);
935 retran:
936 error = sctp_outq_flush_rtx(q, packet,
937 rtx_timeout, &start_timer);
938
939 if (start_timer)
940 sctp_transport_reset_timers(transport);
941
942 /* This can happen on COOKIE-ECHO resend. Only
943 * one chunk can get bundled with a COOKIE-ECHO.
944 */
945 if (packet->has_cookie_echo)
946 goto sctp_flush_out;
947
948 /* Don't send new data if there is still data
949 * waiting to retransmit.
950 */
951 if (!list_empty(&q->retransmit))
952 goto sctp_flush_out;
953 }
954
955 /* Apply Max.Burst limitation to the current transport in
956 * case it will be used for new data. We are going to
957 * rest it before we return, but we want to apply the limit
958 * to the currently queued data.
959 */
960 if (transport)
961 sctp_transport_burst_limited(transport);
962
963 /* Finally, transmit new packets. */
964 while ((chunk = sctp_outq_dequeue_data(q)) != NULL) {
965 /* RFC 2960 6.5 Every DATA chunk MUST carry a valid
966 * stream identifier.
967 */
968 if (chunk->sinfo.sinfo_stream >=
969 asoc->c.sinit_num_ostreams) {
970
971 /* Mark as failed send. */
972 sctp_chunk_fail(chunk, SCTP_ERROR_INV_STRM);
973 sctp_chunk_free(chunk);
974 continue;
975 }
976
977 /* Has this chunk expired? */
978 if (sctp_chunk_abandoned(chunk)) {
979 sctp_chunk_fail(chunk, 0);
980 sctp_chunk_free(chunk);
981 continue;
982 }
983
984 /* If there is a specified transport, use it.
985 * Otherwise, we want to use the active path.
986 */
987 new_transport = chunk->transport;
988 if (!new_transport ||
989 ((new_transport->state == SCTP_INACTIVE) ||
990 (new_transport->state == SCTP_UNCONFIRMED)))
991 new_transport = asoc->peer.active_path;
992 if (new_transport->state == SCTP_UNCONFIRMED)
993 continue;
994
995 /* Change packets if necessary. */
996 if (new_transport != transport) {
997 transport = new_transport;
998
999 /* Schedule to have this transport's
1000 * packet flushed.
1001 */
1002 if (list_empty(&transport->send_ready)) {
1003 list_add_tail(&transport->send_ready,
1004 &transport_list);
1005 }
1006
1007 packet = &transport->packet;
1008 sctp_packet_config(packet, vtag,
1009 asoc->peer.ecn_capable);
1010 /* We've switched transports, so apply the
1011 * Burst limit to the new transport.
1012 */
1013 sctp_transport_burst_limited(transport);
1014 }
1015
1016 SCTP_DEBUG_PRINTK("sctp_outq_flush(%p, %p[%s]), ",
1017 q, chunk,
1018 chunk && chunk->chunk_hdr ?
1019 sctp_cname(SCTP_ST_CHUNK(
1020 chunk->chunk_hdr->type))
1021 : "Illegal Chunk");
1022
1023 SCTP_DEBUG_PRINTK("TX TSN 0x%x skb->head "
1024 "%p skb->users %d.\n",
1025 ntohl(chunk->subh.data_hdr->tsn),
1026 chunk->skb ?chunk->skb->head : NULL,
1027 chunk->skb ?
1028 atomic_read(&chunk->skb->users) : -1);
1029
1030 /* Add the chunk to the packet. */
1031 status = sctp_packet_transmit_chunk(packet, chunk, 0);
1032
1033 switch (status) {
1034 case SCTP_XMIT_PMTU_FULL:
1035 case SCTP_XMIT_RWND_FULL:
1036 case SCTP_XMIT_NAGLE_DELAY:
1037 /* We could not append this chunk, so put
1038 * the chunk back on the output queue.
1039 */
1040 SCTP_DEBUG_PRINTK("sctp_outq_flush: could "
1041 "not transmit TSN: 0x%x, status: %d\n",
1042 ntohl(chunk->subh.data_hdr->tsn),
1043 status);
1044 sctp_outq_head_data(q, chunk);
1045 goto sctp_flush_out;
1046 break;
1047
1048 case SCTP_XMIT_OK:
1049 /* The sender is in the SHUTDOWN-PENDING state,
1050 * The sender MAY set the I-bit in the DATA
1051 * chunk header.
1052 */
1053 if (asoc->state == SCTP_STATE_SHUTDOWN_PENDING)
1054 chunk->chunk_hdr->flags |= SCTP_DATA_SACK_IMM;
1055
1056 break;
1057
1058 default:
1059 BUG();
1060 }
1061
1062 /* BUG: We assume that the sctp_packet_transmit()
1063 * call below will succeed all the time and add the
1064 * chunk to the transmitted list and restart the
1065 * timers.
1066 * It is possible that the call can fail under OOM
1067 * conditions.
1068 *
1069 * Is this really a problem? Won't this behave
1070 * like a lost TSN?
1071 */
1072 list_add_tail(&chunk->transmitted_list,
1073 &transport->transmitted);
1074
1075 sctp_transport_reset_timers(transport);
1076
1077 q->empty = 0;
1078
1079 /* Only let one DATA chunk get bundled with a
1080 * COOKIE-ECHO chunk.
1081 */
1082 if (packet->has_cookie_echo)
1083 goto sctp_flush_out;
1084 }
1085 break;
1086
1087 default:
1088 /* Do nothing. */
1089 break;
1090 }
1091
1092sctp_flush_out:
1093
1094 /* Before returning, examine all the transports touched in
1095 * this call. Right now, we bluntly force clear all the
1096 * transports. Things might change after we implement Nagle.
1097 * But such an examination is still required.
1098 *
1099 * --xguo
1100 */
1101 while ((ltransport = sctp_list_dequeue(&transport_list)) != NULL ) {
1102 struct sctp_transport *t = list_entry(ltransport,
1103 struct sctp_transport,
1104 send_ready);
1105 packet = &t->packet;
1106 if (!sctp_packet_empty(packet))
1107 error = sctp_packet_transmit(packet);
1108
1109 /* Clear the burst limited state, if any */
1110 sctp_transport_burst_reset(t);
1111 }
1112
1113 return error;
1114}
1115
1116/* Update unack_data based on the incoming SACK chunk */
1117static void sctp_sack_update_unack_data(struct sctp_association *assoc,
1118 struct sctp_sackhdr *sack)
1119{
1120 sctp_sack_variable_t *frags;
1121 __u16 unack_data;
1122 int i;
1123
1124 unack_data = assoc->next_tsn - assoc->ctsn_ack_point - 1;
1125
1126 frags = sack->variable;
1127 for (i = 0; i < ntohs(sack->num_gap_ack_blocks); i++) {
1128 unack_data -= ((ntohs(frags[i].gab.end) -
1129 ntohs(frags[i].gab.start) + 1));
1130 }
1131
1132 assoc->unack_data = unack_data;
1133}
1134
1135/* This is where we REALLY process a SACK.
1136 *
1137 * Process the SACK against the outqueue. Mostly, this just frees
1138 * things off the transmitted queue.
1139 */
1140int sctp_outq_sack(struct sctp_outq *q, struct sctp_sackhdr *sack)
1141{
1142 struct sctp_association *asoc = q->asoc;
1143 struct sctp_transport *transport;
1144 struct sctp_chunk *tchunk = NULL;
1145 struct list_head *lchunk, *transport_list, *temp;
1146 sctp_sack_variable_t *frags = sack->variable;
1147 __u32 sack_ctsn, ctsn, tsn;
1148 __u32 highest_tsn, highest_new_tsn;
1149 __u32 sack_a_rwnd;
1150 unsigned int outstanding;
1151 struct sctp_transport *primary = asoc->peer.primary_path;
1152 int count_of_newacks = 0;
1153 int gap_ack_blocks;
1154 u8 accum_moved = 0;
1155
1156 /* Grab the association's destination address list. */
1157 transport_list = &asoc->peer.transport_addr_list;
1158
1159 sack_ctsn = ntohl(sack->cum_tsn_ack);
1160 gap_ack_blocks = ntohs(sack->num_gap_ack_blocks);
1161 /*
1162 * SFR-CACC algorithm:
1163 * On receipt of a SACK the sender SHOULD execute the
1164 * following statements.
1165 *
1166 * 1) If the cumulative ack in the SACK passes next tsn_at_change
1167 * on the current primary, the CHANGEOVER_ACTIVE flag SHOULD be
1168 * cleared. The CYCLING_CHANGEOVER flag SHOULD also be cleared for
1169 * all destinations.
1170 * 2) If the SACK contains gap acks and the flag CHANGEOVER_ACTIVE
1171 * is set the receiver of the SACK MUST take the following actions:
1172 *
1173 * A) Initialize the cacc_saw_newack to 0 for all destination
1174 * addresses.
1175 *
1176 * Only bother if changeover_active is set. Otherwise, this is
1177 * totally suboptimal to do on every SACK.
1178 */
1179 if (primary->cacc.changeover_active) {
1180 u8 clear_cycling = 0;
1181
1182 if (TSN_lte(primary->cacc.next_tsn_at_change, sack_ctsn)) {
1183 primary->cacc.changeover_active = 0;
1184 clear_cycling = 1;
1185 }
1186
1187 if (clear_cycling || gap_ack_blocks) {
1188 list_for_each_entry(transport, transport_list,
1189 transports) {
1190 if (clear_cycling)
1191 transport->cacc.cycling_changeover = 0;
1192 if (gap_ack_blocks)
1193 transport->cacc.cacc_saw_newack = 0;
1194 }
1195 }
1196 }
1197
1198 /* Get the highest TSN in the sack. */
1199 highest_tsn = sack_ctsn;
1200 if (gap_ack_blocks)
1201 highest_tsn += ntohs(frags[gap_ack_blocks - 1].gab.end);
1202
1203 if (TSN_lt(asoc->highest_sacked, highest_tsn))
1204 asoc->highest_sacked = highest_tsn;
1205
1206 highest_new_tsn = sack_ctsn;
1207
1208 /* Run through the retransmit queue. Credit bytes received
1209 * and free those chunks that we can.
1210 */
1211 sctp_check_transmitted(q, &q->retransmit, NULL, sack, &highest_new_tsn);
1212
1213 /* Run through the transmitted queue.
1214 * Credit bytes received and free those chunks which we can.
1215 *
1216 * This is a MASSIVE candidate for optimization.
1217 */
1218 list_for_each_entry(transport, transport_list, transports) {
1219 sctp_check_transmitted(q, &transport->transmitted,
1220 transport, sack, &highest_new_tsn);
1221 /*
1222 * SFR-CACC algorithm:
1223 * C) Let count_of_newacks be the number of
1224 * destinations for which cacc_saw_newack is set.
1225 */
1226 if (transport->cacc.cacc_saw_newack)
1227 count_of_newacks ++;
1228 }
1229
1230 /* Move the Cumulative TSN Ack Point if appropriate. */
1231 if (TSN_lt(asoc->ctsn_ack_point, sack_ctsn)) {
1232 asoc->ctsn_ack_point = sack_ctsn;
1233 accum_moved = 1;
1234 }
1235
1236 if (gap_ack_blocks) {
1237
1238 if (asoc->fast_recovery && accum_moved)
1239 highest_new_tsn = highest_tsn;
1240
1241 list_for_each_entry(transport, transport_list, transports)
1242 sctp_mark_missing(q, &transport->transmitted, transport,
1243 highest_new_tsn, count_of_newacks);
1244 }
1245
1246 /* Update unack_data field in the assoc. */
1247 sctp_sack_update_unack_data(asoc, sack);
1248
1249 ctsn = asoc->ctsn_ack_point;
1250
1251 /* Throw away stuff rotting on the sack queue. */
1252 list_for_each_safe(lchunk, temp, &q->sacked) {
1253 tchunk = list_entry(lchunk, struct sctp_chunk,
1254 transmitted_list);
1255 tsn = ntohl(tchunk->subh.data_hdr->tsn);
1256 if (TSN_lte(tsn, ctsn)) {
1257 list_del_init(&tchunk->transmitted_list);
1258 sctp_chunk_free(tchunk);
1259 }
1260 }
1261
1262 /* ii) Set rwnd equal to the newly received a_rwnd minus the
1263 * number of bytes still outstanding after processing the
1264 * Cumulative TSN Ack and the Gap Ack Blocks.
1265 */
1266
1267 sack_a_rwnd = ntohl(sack->a_rwnd);
1268 outstanding = q->outstanding_bytes;
1269
1270 if (outstanding < sack_a_rwnd)
1271 sack_a_rwnd -= outstanding;
1272 else
1273 sack_a_rwnd = 0;
1274
1275 asoc->peer.rwnd = sack_a_rwnd;
1276
1277 sctp_generate_fwdtsn(q, sack_ctsn);
1278
1279 SCTP_DEBUG_PRINTK("%s: sack Cumulative TSN Ack is 0x%x.\n",
1280 __func__, sack_ctsn);
1281 SCTP_DEBUG_PRINTK("%s: Cumulative TSN Ack of association, "
1282 "%p is 0x%x. Adv peer ack point: 0x%x\n",
1283 __func__, asoc, ctsn, asoc->adv_peer_ack_point);
1284
1285 /* See if all chunks are acked.
1286 * Make sure the empty queue handler will get run later.
1287 */
1288 q->empty = (list_empty(&q->out_chunk_list) &&
1289 list_empty(&q->retransmit));
1290 if (!q->empty)
1291 goto finish;
1292
1293 list_for_each_entry(transport, transport_list, transports) {
1294 q->empty = q->empty && list_empty(&transport->transmitted);
1295 if (!q->empty)
1296 goto finish;
1297 }
1298
1299 SCTP_DEBUG_PRINTK("sack queue is empty.\n");
1300finish:
1301 return q->empty;
1302}
1303
1304/* Is the outqueue empty? */
1305int sctp_outq_is_empty(const struct sctp_outq *q)
1306{
1307 return q->empty;
1308}
1309
1310/********************************************************************
1311 * 2nd Level Abstractions
1312 ********************************************************************/
1313
1314/* Go through a transport's transmitted list or the association's retransmit
1315 * list and move chunks that are acked by the Cumulative TSN Ack to q->sacked.
1316 * The retransmit list will not have an associated transport.
1317 *
1318 * I added coherent debug information output. --xguo
1319 *
1320 * Instead of printing 'sacked' or 'kept' for each TSN on the
1321 * transmitted_queue, we print a range: SACKED: TSN1-TSN2, TSN3, TSN4-TSN5.
1322 * KEPT TSN6-TSN7, etc.
1323 */
1324static void sctp_check_transmitted(struct sctp_outq *q,
1325 struct list_head *transmitted_queue,
1326 struct sctp_transport *transport,
1327 struct sctp_sackhdr *sack,
1328 __u32 *highest_new_tsn_in_sack)
1329{
1330 struct list_head *lchunk;
1331 struct sctp_chunk *tchunk;
1332 struct list_head tlist;
1333 __u32 tsn;
1334 __u32 sack_ctsn;
1335 __u32 rtt;
1336 __u8 restart_timer = 0;
1337 int bytes_acked = 0;
1338 int migrate_bytes = 0;
1339
1340 /* These state variables are for coherent debug output. --xguo */
1341
1342#if SCTP_DEBUG
1343 __u32 dbg_ack_tsn = 0; /* An ACKed TSN range starts here... */
1344 __u32 dbg_last_ack_tsn = 0; /* ...and finishes here. */
1345 __u32 dbg_kept_tsn = 0; /* An un-ACKed range starts here... */
1346 __u32 dbg_last_kept_tsn = 0; /* ...and finishes here. */
1347
1348 /* 0 : The last TSN was ACKed.
1349 * 1 : The last TSN was NOT ACKed (i.e. KEPT).
1350 * -1: We need to initialize.
1351 */
1352 int dbg_prt_state = -1;
1353#endif /* SCTP_DEBUG */
1354
1355 sack_ctsn = ntohl(sack->cum_tsn_ack);
1356
1357 INIT_LIST_HEAD(&tlist);
1358
1359 /* The while loop will skip empty transmitted queues. */
1360 while (NULL != (lchunk = sctp_list_dequeue(transmitted_queue))) {
1361 tchunk = list_entry(lchunk, struct sctp_chunk,
1362 transmitted_list);
1363
1364 if (sctp_chunk_abandoned(tchunk)) {
1365 /* Move the chunk to abandoned list. */
1366 sctp_insert_list(&q->abandoned, lchunk);
1367
1368 /* If this chunk has not been acked, stop
1369 * considering it as 'outstanding'.
1370 */
1371 if (!tchunk->tsn_gap_acked) {
1372 if (tchunk->transport)
1373 tchunk->transport->flight_size -=
1374 sctp_data_size(tchunk);
1375 q->outstanding_bytes -= sctp_data_size(tchunk);
1376 }
1377 continue;
1378 }
1379
1380 tsn = ntohl(tchunk->subh.data_hdr->tsn);
1381 if (sctp_acked(sack, tsn)) {
1382 /* If this queue is the retransmit queue, the
1383 * retransmit timer has already reclaimed
1384 * the outstanding bytes for this chunk, so only
1385 * count bytes associated with a transport.
1386 */
1387 if (transport) {
1388 /* If this chunk is being used for RTT
1389 * measurement, calculate the RTT and update
1390 * the RTO using this value.
1391 *
1392 * 6.3.1 C5) Karn's algorithm: RTT measurements
1393 * MUST NOT be made using packets that were
1394 * retransmitted (and thus for which it is
1395 * ambiguous whether the reply was for the
1396 * first instance of the packet or a later
1397 * instance).
1398 */
1399 if (!tchunk->tsn_gap_acked &&
1400 tchunk->rtt_in_progress) {
1401 tchunk->rtt_in_progress = 0;
1402 rtt = jiffies - tchunk->sent_at;
1403 sctp_transport_update_rto(transport,
1404 rtt);
1405 }
1406 }
1407
1408 /* If the chunk hasn't been marked as ACKED,
1409 * mark it and account bytes_acked if the
1410 * chunk had a valid transport (it will not
1411 * have a transport if ASCONF had deleted it
1412 * while DATA was outstanding).
1413 */
1414 if (!tchunk->tsn_gap_acked) {
1415 tchunk->tsn_gap_acked = 1;
1416 *highest_new_tsn_in_sack = tsn;
1417 bytes_acked += sctp_data_size(tchunk);
1418 if (!tchunk->transport)
1419 migrate_bytes += sctp_data_size(tchunk);
1420 }
1421
1422 if (TSN_lte(tsn, sack_ctsn)) {
1423 /* RFC 2960 6.3.2 Retransmission Timer Rules
1424 *
1425 * R3) Whenever a SACK is received
1426 * that acknowledges the DATA chunk
1427 * with the earliest outstanding TSN
1428 * for that address, restart T3-rtx
1429 * timer for that address with its
1430 * current RTO.
1431 */
1432 restart_timer = 1;
1433
1434 if (!tchunk->tsn_gap_acked) {
1435 /*
1436 * SFR-CACC algorithm:
1437 * 2) If the SACK contains gap acks
1438 * and the flag CHANGEOVER_ACTIVE is
1439 * set the receiver of the SACK MUST
1440 * take the following action:
1441 *
1442 * B) For each TSN t being acked that
1443 * has not been acked in any SACK so
1444 * far, set cacc_saw_newack to 1 for
1445 * the destination that the TSN was
1446 * sent to.
1447 */
1448 if (transport &&
1449 sack->num_gap_ack_blocks &&
1450 q->asoc->peer.primary_path->cacc.
1451 changeover_active)
1452 transport->cacc.cacc_saw_newack
1453 = 1;
1454 }
1455
1456 list_add_tail(&tchunk->transmitted_list,
1457 &q->sacked);
1458 } else {
1459 /* RFC2960 7.2.4, sctpimpguide-05 2.8.2
1460 * M2) Each time a SACK arrives reporting
1461 * 'Stray DATA chunk(s)' record the highest TSN
1462 * reported as newly acknowledged, call this
1463 * value 'HighestTSNinSack'. A newly
1464 * acknowledged DATA chunk is one not
1465 * previously acknowledged in a SACK.
1466 *
1467 * When the SCTP sender of data receives a SACK
1468 * chunk that acknowledges, for the first time,
1469 * the receipt of a DATA chunk, all the still
1470 * unacknowledged DATA chunks whose TSN is
1471 * older than that newly acknowledged DATA
1472 * chunk, are qualified as 'Stray DATA chunks'.
1473 */
1474 list_add_tail(lchunk, &tlist);
1475 }
1476
1477#if SCTP_DEBUG
1478 switch (dbg_prt_state) {
1479 case 0: /* last TSN was ACKed */
1480 if (dbg_last_ack_tsn + 1 == tsn) {
1481 /* This TSN belongs to the
1482 * current ACK range.
1483 */
1484 break;
1485 }
1486
1487 if (dbg_last_ack_tsn != dbg_ack_tsn) {
1488 /* Display the end of the
1489 * current range.
1490 */
1491 SCTP_DEBUG_PRINTK_CONT("-%08x",
1492 dbg_last_ack_tsn);
1493 }
1494
1495 /* Start a new range. */
1496 SCTP_DEBUG_PRINTK_CONT(",%08x", tsn);
1497 dbg_ack_tsn = tsn;
1498 break;
1499
1500 case 1: /* The last TSN was NOT ACKed. */
1501 if (dbg_last_kept_tsn != dbg_kept_tsn) {
1502 /* Display the end of current range. */
1503 SCTP_DEBUG_PRINTK_CONT("-%08x",
1504 dbg_last_kept_tsn);
1505 }
1506
1507 SCTP_DEBUG_PRINTK_CONT("\n");
1508
1509 /* FALL THROUGH... */
1510 default:
1511 /* This is the first-ever TSN we examined. */
1512 /* Start a new range of ACK-ed TSNs. */
1513 SCTP_DEBUG_PRINTK("ACKed: %08x", tsn);
1514 dbg_prt_state = 0;
1515 dbg_ack_tsn = tsn;
1516 }
1517
1518 dbg_last_ack_tsn = tsn;
1519#endif /* SCTP_DEBUG */
1520
1521 } else {
1522 if (tchunk->tsn_gap_acked) {
1523 SCTP_DEBUG_PRINTK("%s: Receiver reneged on "
1524 "data TSN: 0x%x\n",
1525 __func__,
1526 tsn);
1527 tchunk->tsn_gap_acked = 0;
1528
1529 if (tchunk->transport)
1530 bytes_acked -= sctp_data_size(tchunk);
1531
1532 /* RFC 2960 6.3.2 Retransmission Timer Rules
1533 *
1534 * R4) Whenever a SACK is received missing a
1535 * TSN that was previously acknowledged via a
1536 * Gap Ack Block, start T3-rtx for the
1537 * destination address to which the DATA
1538 * chunk was originally
1539 * transmitted if it is not already running.
1540 */
1541 restart_timer = 1;
1542 }
1543
1544 list_add_tail(lchunk, &tlist);
1545
1546#if SCTP_DEBUG
1547 /* See the above comments on ACK-ed TSNs. */
1548 switch (dbg_prt_state) {
1549 case 1:
1550 if (dbg_last_kept_tsn + 1 == tsn)
1551 break;
1552
1553 if (dbg_last_kept_tsn != dbg_kept_tsn)
1554 SCTP_DEBUG_PRINTK_CONT("-%08x",
1555 dbg_last_kept_tsn);
1556
1557 SCTP_DEBUG_PRINTK_CONT(",%08x", tsn);
1558 dbg_kept_tsn = tsn;
1559 break;
1560
1561 case 0:
1562 if (dbg_last_ack_tsn != dbg_ack_tsn)
1563 SCTP_DEBUG_PRINTK_CONT("-%08x",
1564 dbg_last_ack_tsn);
1565 SCTP_DEBUG_PRINTK_CONT("\n");
1566
1567 /* FALL THROUGH... */
1568 default:
1569 SCTP_DEBUG_PRINTK("KEPT: %08x",tsn);
1570 dbg_prt_state = 1;
1571 dbg_kept_tsn = tsn;
1572 }
1573
1574 dbg_last_kept_tsn = tsn;
1575#endif /* SCTP_DEBUG */
1576 }
1577 }
1578
1579#if SCTP_DEBUG
1580 /* Finish off the last range, displaying its ending TSN. */
1581 switch (dbg_prt_state) {
1582 case 0:
1583 if (dbg_last_ack_tsn != dbg_ack_tsn) {
1584 SCTP_DEBUG_PRINTK_CONT("-%08x\n", dbg_last_ack_tsn);
1585 } else {
1586 SCTP_DEBUG_PRINTK_CONT("\n");
1587 }
1588 break;
1589
1590 case 1:
1591 if (dbg_last_kept_tsn != dbg_kept_tsn) {
1592 SCTP_DEBUG_PRINTK_CONT("-%08x\n", dbg_last_kept_tsn);
1593 } else {
1594 SCTP_DEBUG_PRINTK_CONT("\n");
1595 }
1596 }
1597#endif /* SCTP_DEBUG */
1598 if (transport) {
1599 if (bytes_acked) {
1600 struct sctp_association *asoc = transport->asoc;
1601
1602 /* We may have counted DATA that was migrated
1603 * to this transport due to DEL-IP operation.
1604 * Subtract those bytes, since the were never
1605 * send on this transport and shouldn't be
1606 * credited to this transport.
1607 */
1608 bytes_acked -= migrate_bytes;
1609
1610 /* 8.2. When an outstanding TSN is acknowledged,
1611 * the endpoint shall clear the error counter of
1612 * the destination transport address to which the
1613 * DATA chunk was last sent.
1614 * The association's overall error counter is
1615 * also cleared.
1616 */
1617 transport->error_count = 0;
1618 transport->asoc->overall_error_count = 0;
1619
1620 /*
1621 * While in SHUTDOWN PENDING, we may have started
1622 * the T5 shutdown guard timer after reaching the
1623 * retransmission limit. Stop that timer as soon
1624 * as the receiver acknowledged any data.
1625 */
1626 if (asoc->state == SCTP_STATE_SHUTDOWN_PENDING &&
1627 del_timer(&asoc->timers
1628 [SCTP_EVENT_TIMEOUT_T5_SHUTDOWN_GUARD]))
1629 sctp_association_put(asoc);
1630
1631 /* Mark the destination transport address as
1632 * active if it is not so marked.
1633 */
1634 if ((transport->state == SCTP_INACTIVE) ||
1635 (transport->state == SCTP_UNCONFIRMED)) {
1636 sctp_assoc_control_transport(
1637 transport->asoc,
1638 transport,
1639 SCTP_TRANSPORT_UP,
1640 SCTP_RECEIVED_SACK);
1641 }
1642
1643 sctp_transport_raise_cwnd(transport, sack_ctsn,
1644 bytes_acked);
1645
1646 transport->flight_size -= bytes_acked;
1647 if (transport->flight_size == 0)
1648 transport->partial_bytes_acked = 0;
1649 q->outstanding_bytes -= bytes_acked + migrate_bytes;
1650 } else {
1651 /* RFC 2960 6.1, sctpimpguide-06 2.15.2
1652 * When a sender is doing zero window probing, it
1653 * should not timeout the association if it continues
1654 * to receive new packets from the receiver. The
1655 * reason is that the receiver MAY keep its window
1656 * closed for an indefinite time.
1657 * A sender is doing zero window probing when the
1658 * receiver's advertised window is zero, and there is
1659 * only one data chunk in flight to the receiver.
1660 *
1661 * Allow the association to timeout while in SHUTDOWN
1662 * PENDING or SHUTDOWN RECEIVED in case the receiver
1663 * stays in zero window mode forever.
1664 */
1665 if (!q->asoc->peer.rwnd &&
1666 !list_empty(&tlist) &&
1667 (sack_ctsn+2 == q->asoc->next_tsn) &&
1668 q->asoc->state < SCTP_STATE_SHUTDOWN_PENDING) {
1669 SCTP_DEBUG_PRINTK("%s: SACK received for zero "
1670 "window probe: %u\n",
1671 __func__, sack_ctsn);
1672 q->asoc->overall_error_count = 0;
1673 transport->error_count = 0;
1674 }
1675 }
1676
1677 /* RFC 2960 6.3.2 Retransmission Timer Rules
1678 *
1679 * R2) Whenever all outstanding data sent to an address have
1680 * been acknowledged, turn off the T3-rtx timer of that
1681 * address.
1682 */
1683 if (!transport->flight_size) {
1684 if (timer_pending(&transport->T3_rtx_timer) &&
1685 del_timer(&transport->T3_rtx_timer)) {
1686 sctp_transport_put(transport);
1687 }
1688 } else if (restart_timer) {
1689 if (!mod_timer(&transport->T3_rtx_timer,
1690 jiffies + transport->rto))
1691 sctp_transport_hold(transport);
1692 }
1693 }
1694
1695 list_splice(&tlist, transmitted_queue);
1696}
1697
1698/* Mark chunks as missing and consequently may get retransmitted. */
1699static void sctp_mark_missing(struct sctp_outq *q,
1700 struct list_head *transmitted_queue,
1701 struct sctp_transport *transport,
1702 __u32 highest_new_tsn_in_sack,
1703 int count_of_newacks)
1704{
1705 struct sctp_chunk *chunk;
1706 __u32 tsn;
1707 char do_fast_retransmit = 0;
1708 struct sctp_association *asoc = q->asoc;
1709 struct sctp_transport *primary = asoc->peer.primary_path;
1710
1711 list_for_each_entry(chunk, transmitted_queue, transmitted_list) {
1712
1713 tsn = ntohl(chunk->subh.data_hdr->tsn);
1714
1715 /* RFC 2960 7.2.4, sctpimpguide-05 2.8.2 M3) Examine all
1716 * 'Unacknowledged TSN's', if the TSN number of an
1717 * 'Unacknowledged TSN' is smaller than the 'HighestTSNinSack'
1718 * value, increment the 'TSN.Missing.Report' count on that
1719 * chunk if it has NOT been fast retransmitted or marked for
1720 * fast retransmit already.
1721 */
1722 if (chunk->fast_retransmit == SCTP_CAN_FRTX &&
1723 !chunk->tsn_gap_acked &&
1724 TSN_lt(tsn, highest_new_tsn_in_sack)) {
1725
1726 /* SFR-CACC may require us to skip marking
1727 * this chunk as missing.
1728 */
1729 if (!transport || !sctp_cacc_skip(primary,
1730 chunk->transport,
1731 count_of_newacks, tsn)) {
1732 chunk->tsn_missing_report++;
1733
1734 SCTP_DEBUG_PRINTK(
1735 "%s: TSN 0x%x missing counter: %d\n",
1736 __func__, tsn,
1737 chunk->tsn_missing_report);
1738 }
1739 }
1740 /*
1741 * M4) If any DATA chunk is found to have a
1742 * 'TSN.Missing.Report'
1743 * value larger than or equal to 3, mark that chunk for
1744 * retransmission and start the fast retransmit procedure.
1745 */
1746
1747 if (chunk->tsn_missing_report >= 3) {
1748 chunk->fast_retransmit = SCTP_NEED_FRTX;
1749 do_fast_retransmit = 1;
1750 }
1751 }
1752
1753 if (transport) {
1754 if (do_fast_retransmit)
1755 sctp_retransmit(q, transport, SCTP_RTXR_FAST_RTX);
1756
1757 SCTP_DEBUG_PRINTK("%s: transport: %p, cwnd: %d, "
1758 "ssthresh: %d, flight_size: %d, pba: %d\n",
1759 __func__, transport, transport->cwnd,
1760 transport->ssthresh, transport->flight_size,
1761 transport->partial_bytes_acked);
1762 }
1763}
1764
1765/* Is the given TSN acked by this packet? */
1766static int sctp_acked(struct sctp_sackhdr *sack, __u32 tsn)
1767{
1768 int i;
1769 sctp_sack_variable_t *frags;
1770 __u16 gap;
1771 __u32 ctsn = ntohl(sack->cum_tsn_ack);
1772
1773 if (TSN_lte(tsn, ctsn))
1774 goto pass;
1775
1776 /* 3.3.4 Selective Acknowledgement (SACK) (3):
1777 *
1778 * Gap Ack Blocks:
1779 * These fields contain the Gap Ack Blocks. They are repeated
1780 * for each Gap Ack Block up to the number of Gap Ack Blocks
1781 * defined in the Number of Gap Ack Blocks field. All DATA
1782 * chunks with TSNs greater than or equal to (Cumulative TSN
1783 * Ack + Gap Ack Block Start) and less than or equal to
1784 * (Cumulative TSN Ack + Gap Ack Block End) of each Gap Ack
1785 * Block are assumed to have been received correctly.
1786 */
1787
1788 frags = sack->variable;
1789 gap = tsn - ctsn;
1790 for (i = 0; i < ntohs(sack->num_gap_ack_blocks); ++i) {
1791 if (TSN_lte(ntohs(frags[i].gab.start), gap) &&
1792 TSN_lte(gap, ntohs(frags[i].gab.end)))
1793 goto pass;
1794 }
1795
1796 return 0;
1797pass:
1798 return 1;
1799}
1800
1801static inline int sctp_get_skip_pos(struct sctp_fwdtsn_skip *skiplist,
1802 int nskips, __be16 stream)
1803{
1804 int i;
1805
1806 for (i = 0; i < nskips; i++) {
1807 if (skiplist[i].stream == stream)
1808 return i;
1809 }
1810 return i;
1811}
1812
1813/* Create and add a fwdtsn chunk to the outq's control queue if needed. */
1814static void sctp_generate_fwdtsn(struct sctp_outq *q, __u32 ctsn)
1815{
1816 struct sctp_association *asoc = q->asoc;
1817 struct sctp_chunk *ftsn_chunk = NULL;
1818 struct sctp_fwdtsn_skip ftsn_skip_arr[10];
1819 int nskips = 0;
1820 int skip_pos = 0;
1821 __u32 tsn;
1822 struct sctp_chunk *chunk;
1823 struct list_head *lchunk, *temp;
1824
1825 if (!asoc->peer.prsctp_capable)
1826 return;
1827
1828 /* PR-SCTP C1) Let SackCumAck be the Cumulative TSN ACK carried in the
1829 * received SACK.
1830 *
1831 * If (Advanced.Peer.Ack.Point < SackCumAck), then update
1832 * Advanced.Peer.Ack.Point to be equal to SackCumAck.
1833 */
1834 if (TSN_lt(asoc->adv_peer_ack_point, ctsn))
1835 asoc->adv_peer_ack_point = ctsn;
1836
1837 /* PR-SCTP C2) Try to further advance the "Advanced.Peer.Ack.Point"
1838 * locally, that is, to move "Advanced.Peer.Ack.Point" up as long as
1839 * the chunk next in the out-queue space is marked as "abandoned" as
1840 * shown in the following example:
1841 *
1842 * Assuming that a SACK arrived with the Cumulative TSN ACK 102
1843 * and the Advanced.Peer.Ack.Point is updated to this value:
1844 *
1845 * out-queue at the end of ==> out-queue after Adv.Ack.Point
1846 * normal SACK processing local advancement
1847 * ... ...
1848 * Adv.Ack.Pt-> 102 acked 102 acked
1849 * 103 abandoned 103 abandoned
1850 * 104 abandoned Adv.Ack.P-> 104 abandoned
1851 * 105 105
1852 * 106 acked 106 acked
1853 * ... ...
1854 *
1855 * In this example, the data sender successfully advanced the
1856 * "Advanced.Peer.Ack.Point" from 102 to 104 locally.
1857 */
1858 list_for_each_safe(lchunk, temp, &q->abandoned) {
1859 chunk = list_entry(lchunk, struct sctp_chunk,
1860 transmitted_list);
1861 tsn = ntohl(chunk->subh.data_hdr->tsn);
1862
1863 /* Remove any chunks in the abandoned queue that are acked by
1864 * the ctsn.
1865 */
1866 if (TSN_lte(tsn, ctsn)) {
1867 list_del_init(lchunk);
1868 sctp_chunk_free(chunk);
1869 } else {
1870 if (TSN_lte(tsn, asoc->adv_peer_ack_point+1)) {
1871 asoc->adv_peer_ack_point = tsn;
1872 if (chunk->chunk_hdr->flags &
1873 SCTP_DATA_UNORDERED)
1874 continue;
1875 skip_pos = sctp_get_skip_pos(&ftsn_skip_arr[0],
1876 nskips,
1877 chunk->subh.data_hdr->stream);
1878 ftsn_skip_arr[skip_pos].stream =
1879 chunk->subh.data_hdr->stream;
1880 ftsn_skip_arr[skip_pos].ssn =
1881 chunk->subh.data_hdr->ssn;
1882 if (skip_pos == nskips)
1883 nskips++;
1884 if (nskips == 10)
1885 break;
1886 } else
1887 break;
1888 }
1889 }
1890
1891 /* PR-SCTP C3) If, after step C1 and C2, the "Advanced.Peer.Ack.Point"
1892 * is greater than the Cumulative TSN ACK carried in the received
1893 * SACK, the data sender MUST send the data receiver a FORWARD TSN
1894 * chunk containing the latest value of the
1895 * "Advanced.Peer.Ack.Point".
1896 *
1897 * C4) For each "abandoned" TSN the sender of the FORWARD TSN SHOULD
1898 * list each stream and sequence number in the forwarded TSN. This
1899 * information will enable the receiver to easily find any
1900 * stranded TSN's waiting on stream reorder queues. Each stream
1901 * SHOULD only be reported once; this means that if multiple
1902 * abandoned messages occur in the same stream then only the
1903 * highest abandoned stream sequence number is reported. If the
1904 * total size of the FORWARD TSN does NOT fit in a single MTU then
1905 * the sender of the FORWARD TSN SHOULD lower the
1906 * Advanced.Peer.Ack.Point to the last TSN that will fit in a
1907 * single MTU.
1908 */
1909 if (asoc->adv_peer_ack_point > ctsn)
1910 ftsn_chunk = sctp_make_fwdtsn(asoc, asoc->adv_peer_ack_point,
1911 nskips, &ftsn_skip_arr[0]);
1912
1913 if (ftsn_chunk) {
1914 list_add_tail(&ftsn_chunk->list, &q->control_chunk_list);
1915 SCTP_INC_STATS(SCTP_MIB_OUTCTRLCHUNKS);
1916 }
1917}
1// SPDX-License-Identifier: GPL-2.0-or-later
2/* SCTP kernel implementation
3 * (C) Copyright IBM Corp. 2001, 2004
4 * Copyright (c) 1999-2000 Cisco, Inc.
5 * Copyright (c) 1999-2001 Motorola, Inc.
6 * Copyright (c) 2001-2003 Intel Corp.
7 *
8 * This file is part of the SCTP kernel implementation
9 *
10 * These functions implement the sctp_outq class. The outqueue handles
11 * bundling and queueing of outgoing SCTP chunks.
12 *
13 * Please send any bug reports or fixes you make to the
14 * email address(es):
15 * lksctp developers <linux-sctp@vger.kernel.org>
16 *
17 * Written or modified by:
18 * La Monte H.P. Yarroll <piggy@acm.org>
19 * Karl Knutson <karl@athena.chicago.il.us>
20 * Perry Melange <pmelange@null.cc.uic.edu>
21 * Xingang Guo <xingang.guo@intel.com>
22 * Hui Huang <hui.huang@nokia.com>
23 * Sridhar Samudrala <sri@us.ibm.com>
24 * Jon Grimm <jgrimm@us.ibm.com>
25 */
26
27#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
28
29#include <linux/types.h>
30#include <linux/list.h> /* For struct list_head */
31#include <linux/socket.h>
32#include <linux/ip.h>
33#include <linux/slab.h>
34#include <net/sock.h> /* For skb_set_owner_w */
35
36#include <net/sctp/sctp.h>
37#include <net/sctp/sm.h>
38#include <net/sctp/stream_sched.h>
39
40/* Declare internal functions here. */
41static int sctp_acked(struct sctp_sackhdr *sack, __u32 tsn);
42static void sctp_check_transmitted(struct sctp_outq *q,
43 struct list_head *transmitted_queue,
44 struct sctp_transport *transport,
45 union sctp_addr *saddr,
46 struct sctp_sackhdr *sack,
47 __u32 *highest_new_tsn);
48
49static void sctp_mark_missing(struct sctp_outq *q,
50 struct list_head *transmitted_queue,
51 struct sctp_transport *transport,
52 __u32 highest_new_tsn,
53 int count_of_newacks);
54
55static void sctp_outq_flush(struct sctp_outq *q, int rtx_timeout, gfp_t gfp);
56
57/* Add data to the front of the queue. */
58static inline void sctp_outq_head_data(struct sctp_outq *q,
59 struct sctp_chunk *ch)
60{
61 struct sctp_stream_out_ext *oute;
62 __u16 stream;
63
64 list_add(&ch->list, &q->out_chunk_list);
65 q->out_qlen += ch->skb->len;
66
67 stream = sctp_chunk_stream_no(ch);
68 oute = SCTP_SO(&q->asoc->stream, stream)->ext;
69 list_add(&ch->stream_list, &oute->outq);
70}
71
72/* Take data from the front of the queue. */
73static inline struct sctp_chunk *sctp_outq_dequeue_data(struct sctp_outq *q)
74{
75 return q->sched->dequeue(q);
76}
77
78/* Add data chunk to the end of the queue. */
79static inline void sctp_outq_tail_data(struct sctp_outq *q,
80 struct sctp_chunk *ch)
81{
82 struct sctp_stream_out_ext *oute;
83 __u16 stream;
84
85 list_add_tail(&ch->list, &q->out_chunk_list);
86 q->out_qlen += ch->skb->len;
87
88 stream = sctp_chunk_stream_no(ch);
89 oute = SCTP_SO(&q->asoc->stream, stream)->ext;
90 list_add_tail(&ch->stream_list, &oute->outq);
91}
92
93/*
94 * SFR-CACC algorithm:
95 * D) If count_of_newacks is greater than or equal to 2
96 * and t was not sent to the current primary then the
97 * sender MUST NOT increment missing report count for t.
98 */
99static inline int sctp_cacc_skip_3_1_d(struct sctp_transport *primary,
100 struct sctp_transport *transport,
101 int count_of_newacks)
102{
103 if (count_of_newacks >= 2 && transport != primary)
104 return 1;
105 return 0;
106}
107
108/*
109 * SFR-CACC algorithm:
110 * F) If count_of_newacks is less than 2, let d be the
111 * destination to which t was sent. If cacc_saw_newack
112 * is 0 for destination d, then the sender MUST NOT
113 * increment missing report count for t.
114 */
115static inline int sctp_cacc_skip_3_1_f(struct sctp_transport *transport,
116 int count_of_newacks)
117{
118 if (count_of_newacks < 2 &&
119 (transport && !transport->cacc.cacc_saw_newack))
120 return 1;
121 return 0;
122}
123
124/*
125 * SFR-CACC algorithm:
126 * 3.1) If CYCLING_CHANGEOVER is 0, the sender SHOULD
127 * execute steps C, D, F.
128 *
129 * C has been implemented in sctp_outq_sack
130 */
131static inline int sctp_cacc_skip_3_1(struct sctp_transport *primary,
132 struct sctp_transport *transport,
133 int count_of_newacks)
134{
135 if (!primary->cacc.cycling_changeover) {
136 if (sctp_cacc_skip_3_1_d(primary, transport, count_of_newacks))
137 return 1;
138 if (sctp_cacc_skip_3_1_f(transport, count_of_newacks))
139 return 1;
140 return 0;
141 }
142 return 0;
143}
144
145/*
146 * SFR-CACC algorithm:
147 * 3.2) Else if CYCLING_CHANGEOVER is 1, and t is less
148 * than next_tsn_at_change of the current primary, then
149 * the sender MUST NOT increment missing report count
150 * for t.
151 */
152static inline int sctp_cacc_skip_3_2(struct sctp_transport *primary, __u32 tsn)
153{
154 if (primary->cacc.cycling_changeover &&
155 TSN_lt(tsn, primary->cacc.next_tsn_at_change))
156 return 1;
157 return 0;
158}
159
160/*
161 * SFR-CACC algorithm:
162 * 3) If the missing report count for TSN t is to be
163 * incremented according to [RFC2960] and
164 * [SCTP_STEWART-2002], and CHANGEOVER_ACTIVE is set,
165 * then the sender MUST further execute steps 3.1 and
166 * 3.2 to determine if the missing report count for
167 * TSN t SHOULD NOT be incremented.
168 *
169 * 3.3) If 3.1 and 3.2 do not dictate that the missing
170 * report count for t should not be incremented, then
171 * the sender SHOULD increment missing report count for
172 * t (according to [RFC2960] and [SCTP_STEWART_2002]).
173 */
174static inline int sctp_cacc_skip(struct sctp_transport *primary,
175 struct sctp_transport *transport,
176 int count_of_newacks,
177 __u32 tsn)
178{
179 if (primary->cacc.changeover_active &&
180 (sctp_cacc_skip_3_1(primary, transport, count_of_newacks) ||
181 sctp_cacc_skip_3_2(primary, tsn)))
182 return 1;
183 return 0;
184}
185
186/* Initialize an existing sctp_outq. This does the boring stuff.
187 * You still need to define handlers if you really want to DO
188 * something with this structure...
189 */
190void sctp_outq_init(struct sctp_association *asoc, struct sctp_outq *q)
191{
192 memset(q, 0, sizeof(struct sctp_outq));
193
194 q->asoc = asoc;
195 INIT_LIST_HEAD(&q->out_chunk_list);
196 INIT_LIST_HEAD(&q->control_chunk_list);
197 INIT_LIST_HEAD(&q->retransmit);
198 INIT_LIST_HEAD(&q->sacked);
199 INIT_LIST_HEAD(&q->abandoned);
200 sctp_sched_set_sched(asoc, sctp_sk(asoc->base.sk)->default_ss);
201}
202
203/* Free the outqueue structure and any related pending chunks.
204 */
205static void __sctp_outq_teardown(struct sctp_outq *q)
206{
207 struct sctp_transport *transport;
208 struct list_head *lchunk, *temp;
209 struct sctp_chunk *chunk, *tmp;
210
211 /* Throw away unacknowledged chunks. */
212 list_for_each_entry(transport, &q->asoc->peer.transport_addr_list,
213 transports) {
214 while ((lchunk = sctp_list_dequeue(&transport->transmitted)) != NULL) {
215 chunk = list_entry(lchunk, struct sctp_chunk,
216 transmitted_list);
217 /* Mark as part of a failed message. */
218 sctp_chunk_fail(chunk, q->error);
219 sctp_chunk_free(chunk);
220 }
221 }
222
223 /* Throw away chunks that have been gap ACKed. */
224 list_for_each_safe(lchunk, temp, &q->sacked) {
225 list_del_init(lchunk);
226 chunk = list_entry(lchunk, struct sctp_chunk,
227 transmitted_list);
228 sctp_chunk_fail(chunk, q->error);
229 sctp_chunk_free(chunk);
230 }
231
232 /* Throw away any chunks in the retransmit queue. */
233 list_for_each_safe(lchunk, temp, &q->retransmit) {
234 list_del_init(lchunk);
235 chunk = list_entry(lchunk, struct sctp_chunk,
236 transmitted_list);
237 sctp_chunk_fail(chunk, q->error);
238 sctp_chunk_free(chunk);
239 }
240
241 /* Throw away any chunks that are in the abandoned queue. */
242 list_for_each_safe(lchunk, temp, &q->abandoned) {
243 list_del_init(lchunk);
244 chunk = list_entry(lchunk, struct sctp_chunk,
245 transmitted_list);
246 sctp_chunk_fail(chunk, q->error);
247 sctp_chunk_free(chunk);
248 }
249
250 /* Throw away any leftover data chunks. */
251 while ((chunk = sctp_outq_dequeue_data(q)) != NULL) {
252 sctp_sched_dequeue_done(q, chunk);
253
254 /* Mark as send failure. */
255 sctp_chunk_fail(chunk, q->error);
256 sctp_chunk_free(chunk);
257 }
258
259 /* Throw away any leftover control chunks. */
260 list_for_each_entry_safe(chunk, tmp, &q->control_chunk_list, list) {
261 list_del_init(&chunk->list);
262 sctp_chunk_free(chunk);
263 }
264}
265
266void sctp_outq_teardown(struct sctp_outq *q)
267{
268 __sctp_outq_teardown(q);
269 sctp_outq_init(q->asoc, q);
270}
271
272/* Free the outqueue structure and any related pending chunks. */
273void sctp_outq_free(struct sctp_outq *q)
274{
275 /* Throw away leftover chunks. */
276 __sctp_outq_teardown(q);
277}
278
279/* Put a new chunk in an sctp_outq. */
280void sctp_outq_tail(struct sctp_outq *q, struct sctp_chunk *chunk, gfp_t gfp)
281{
282 struct net *net = sock_net(q->asoc->base.sk);
283
284 pr_debug("%s: outq:%p, chunk:%p[%s]\n", __func__, q, chunk,
285 chunk && chunk->chunk_hdr ?
286 sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)) :
287 "illegal chunk");
288
289 /* If it is data, queue it up, otherwise, send it
290 * immediately.
291 */
292 if (sctp_chunk_is_data(chunk)) {
293 pr_debug("%s: outqueueing: outq:%p, chunk:%p[%s])\n",
294 __func__, q, chunk, chunk && chunk->chunk_hdr ?
295 sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)) :
296 "illegal chunk");
297
298 sctp_outq_tail_data(q, chunk);
299 if (chunk->asoc->peer.prsctp_capable &&
300 SCTP_PR_PRIO_ENABLED(chunk->sinfo.sinfo_flags))
301 chunk->asoc->sent_cnt_removable++;
302 if (chunk->chunk_hdr->flags & SCTP_DATA_UNORDERED)
303 SCTP_INC_STATS(net, SCTP_MIB_OUTUNORDERCHUNKS);
304 else
305 SCTP_INC_STATS(net, SCTP_MIB_OUTORDERCHUNKS);
306 } else {
307 list_add_tail(&chunk->list, &q->control_chunk_list);
308 SCTP_INC_STATS(net, SCTP_MIB_OUTCTRLCHUNKS);
309 }
310
311 if (!q->cork)
312 sctp_outq_flush(q, 0, gfp);
313}
314
315/* Insert a chunk into the sorted list based on the TSNs. The retransmit list
316 * and the abandoned list are in ascending order.
317 */
318static void sctp_insert_list(struct list_head *head, struct list_head *new)
319{
320 struct list_head *pos;
321 struct sctp_chunk *nchunk, *lchunk;
322 __u32 ntsn, ltsn;
323 int done = 0;
324
325 nchunk = list_entry(new, struct sctp_chunk, transmitted_list);
326 ntsn = ntohl(nchunk->subh.data_hdr->tsn);
327
328 list_for_each(pos, head) {
329 lchunk = list_entry(pos, struct sctp_chunk, transmitted_list);
330 ltsn = ntohl(lchunk->subh.data_hdr->tsn);
331 if (TSN_lt(ntsn, ltsn)) {
332 list_add(new, pos->prev);
333 done = 1;
334 break;
335 }
336 }
337 if (!done)
338 list_add_tail(new, head);
339}
340
341static int sctp_prsctp_prune_sent(struct sctp_association *asoc,
342 struct sctp_sndrcvinfo *sinfo,
343 struct list_head *queue, int msg_len)
344{
345 struct sctp_chunk *chk, *temp;
346
347 list_for_each_entry_safe(chk, temp, queue, transmitted_list) {
348 struct sctp_stream_out *streamout;
349
350 if (!chk->msg->abandoned &&
351 (!SCTP_PR_PRIO_ENABLED(chk->sinfo.sinfo_flags) ||
352 chk->sinfo.sinfo_timetolive <= sinfo->sinfo_timetolive))
353 continue;
354
355 chk->msg->abandoned = 1;
356 list_del_init(&chk->transmitted_list);
357 sctp_insert_list(&asoc->outqueue.abandoned,
358 &chk->transmitted_list);
359
360 streamout = SCTP_SO(&asoc->stream, chk->sinfo.sinfo_stream);
361 asoc->sent_cnt_removable--;
362 asoc->abandoned_sent[SCTP_PR_INDEX(PRIO)]++;
363 streamout->ext->abandoned_sent[SCTP_PR_INDEX(PRIO)]++;
364
365 if (queue != &asoc->outqueue.retransmit &&
366 !chk->tsn_gap_acked) {
367 if (chk->transport)
368 chk->transport->flight_size -=
369 sctp_data_size(chk);
370 asoc->outqueue.outstanding_bytes -= sctp_data_size(chk);
371 }
372
373 msg_len -= chk->skb->truesize + sizeof(struct sctp_chunk);
374 if (msg_len <= 0)
375 break;
376 }
377
378 return msg_len;
379}
380
381static int sctp_prsctp_prune_unsent(struct sctp_association *asoc,
382 struct sctp_sndrcvinfo *sinfo, int msg_len)
383{
384 struct sctp_outq *q = &asoc->outqueue;
385 struct sctp_chunk *chk, *temp;
386
387 q->sched->unsched_all(&asoc->stream);
388
389 list_for_each_entry_safe(chk, temp, &q->out_chunk_list, list) {
390 if (!chk->msg->abandoned &&
391 (!(chk->chunk_hdr->flags & SCTP_DATA_FIRST_FRAG) ||
392 !SCTP_PR_PRIO_ENABLED(chk->sinfo.sinfo_flags) ||
393 chk->sinfo.sinfo_timetolive <= sinfo->sinfo_timetolive))
394 continue;
395
396 chk->msg->abandoned = 1;
397 sctp_sched_dequeue_common(q, chk);
398 asoc->sent_cnt_removable--;
399 asoc->abandoned_unsent[SCTP_PR_INDEX(PRIO)]++;
400 if (chk->sinfo.sinfo_stream < asoc->stream.outcnt) {
401 struct sctp_stream_out *streamout =
402 SCTP_SO(&asoc->stream, chk->sinfo.sinfo_stream);
403
404 streamout->ext->abandoned_unsent[SCTP_PR_INDEX(PRIO)]++;
405 }
406
407 msg_len -= chk->skb->truesize + sizeof(struct sctp_chunk);
408 sctp_chunk_free(chk);
409 if (msg_len <= 0)
410 break;
411 }
412
413 q->sched->sched_all(&asoc->stream);
414
415 return msg_len;
416}
417
418/* Abandon the chunks according their priorities */
419void sctp_prsctp_prune(struct sctp_association *asoc,
420 struct sctp_sndrcvinfo *sinfo, int msg_len)
421{
422 struct sctp_transport *transport;
423
424 if (!asoc->peer.prsctp_capable || !asoc->sent_cnt_removable)
425 return;
426
427 msg_len = sctp_prsctp_prune_sent(asoc, sinfo,
428 &asoc->outqueue.retransmit,
429 msg_len);
430 if (msg_len <= 0)
431 return;
432
433 list_for_each_entry(transport, &asoc->peer.transport_addr_list,
434 transports) {
435 msg_len = sctp_prsctp_prune_sent(asoc, sinfo,
436 &transport->transmitted,
437 msg_len);
438 if (msg_len <= 0)
439 return;
440 }
441
442 sctp_prsctp_prune_unsent(asoc, sinfo, msg_len);
443}
444
445/* Mark all the eligible packets on a transport for retransmission. */
446void sctp_retransmit_mark(struct sctp_outq *q,
447 struct sctp_transport *transport,
448 __u8 reason)
449{
450 struct list_head *lchunk, *ltemp;
451 struct sctp_chunk *chunk;
452
453 /* Walk through the specified transmitted queue. */
454 list_for_each_safe(lchunk, ltemp, &transport->transmitted) {
455 chunk = list_entry(lchunk, struct sctp_chunk,
456 transmitted_list);
457
458 /* If the chunk is abandoned, move it to abandoned list. */
459 if (sctp_chunk_abandoned(chunk)) {
460 list_del_init(lchunk);
461 sctp_insert_list(&q->abandoned, lchunk);
462
463 /* If this chunk has not been previousely acked,
464 * stop considering it 'outstanding'. Our peer
465 * will most likely never see it since it will
466 * not be retransmitted
467 */
468 if (!chunk->tsn_gap_acked) {
469 if (chunk->transport)
470 chunk->transport->flight_size -=
471 sctp_data_size(chunk);
472 q->outstanding_bytes -= sctp_data_size(chunk);
473 q->asoc->peer.rwnd += sctp_data_size(chunk);
474 }
475 continue;
476 }
477
478 /* If we are doing retransmission due to a timeout or pmtu
479 * discovery, only the chunks that are not yet acked should
480 * be added to the retransmit queue.
481 */
482 if ((reason == SCTP_RTXR_FAST_RTX &&
483 (chunk->fast_retransmit == SCTP_NEED_FRTX)) ||
484 (reason != SCTP_RTXR_FAST_RTX && !chunk->tsn_gap_acked)) {
485 /* RFC 2960 6.2.1 Processing a Received SACK
486 *
487 * C) Any time a DATA chunk is marked for
488 * retransmission (via either T3-rtx timer expiration
489 * (Section 6.3.3) or via fast retransmit
490 * (Section 7.2.4)), add the data size of those
491 * chunks to the rwnd.
492 */
493 q->asoc->peer.rwnd += sctp_data_size(chunk);
494 q->outstanding_bytes -= sctp_data_size(chunk);
495 if (chunk->transport)
496 transport->flight_size -= sctp_data_size(chunk);
497
498 /* sctpimpguide-05 Section 2.8.2
499 * M5) If a T3-rtx timer expires, the
500 * 'TSN.Missing.Report' of all affected TSNs is set
501 * to 0.
502 */
503 chunk->tsn_missing_report = 0;
504
505 /* If a chunk that is being used for RTT measurement
506 * has to be retransmitted, we cannot use this chunk
507 * anymore for RTT measurements. Reset rto_pending so
508 * that a new RTT measurement is started when a new
509 * data chunk is sent.
510 */
511 if (chunk->rtt_in_progress) {
512 chunk->rtt_in_progress = 0;
513 transport->rto_pending = 0;
514 }
515
516 /* Move the chunk to the retransmit queue. The chunks
517 * on the retransmit queue are always kept in order.
518 */
519 list_del_init(lchunk);
520 sctp_insert_list(&q->retransmit, lchunk);
521 }
522 }
523
524 pr_debug("%s: transport:%p, reason:%d, cwnd:%d, ssthresh:%d, "
525 "flight_size:%d, pba:%d\n", __func__, transport, reason,
526 transport->cwnd, transport->ssthresh, transport->flight_size,
527 transport->partial_bytes_acked);
528}
529
530/* Mark all the eligible packets on a transport for retransmission and force
531 * one packet out.
532 */
533void sctp_retransmit(struct sctp_outq *q, struct sctp_transport *transport,
534 enum sctp_retransmit_reason reason)
535{
536 struct net *net = sock_net(q->asoc->base.sk);
537
538 switch (reason) {
539 case SCTP_RTXR_T3_RTX:
540 SCTP_INC_STATS(net, SCTP_MIB_T3_RETRANSMITS);
541 sctp_transport_lower_cwnd(transport, SCTP_LOWER_CWND_T3_RTX);
542 /* Update the retran path if the T3-rtx timer has expired for
543 * the current retran path.
544 */
545 if (transport == transport->asoc->peer.retran_path)
546 sctp_assoc_update_retran_path(transport->asoc);
547 transport->asoc->rtx_data_chunks +=
548 transport->asoc->unack_data;
549 break;
550 case SCTP_RTXR_FAST_RTX:
551 SCTP_INC_STATS(net, SCTP_MIB_FAST_RETRANSMITS);
552 sctp_transport_lower_cwnd(transport, SCTP_LOWER_CWND_FAST_RTX);
553 q->fast_rtx = 1;
554 break;
555 case SCTP_RTXR_PMTUD:
556 SCTP_INC_STATS(net, SCTP_MIB_PMTUD_RETRANSMITS);
557 break;
558 case SCTP_RTXR_T1_RTX:
559 SCTP_INC_STATS(net, SCTP_MIB_T1_RETRANSMITS);
560 transport->asoc->init_retries++;
561 break;
562 default:
563 BUG();
564 }
565
566 sctp_retransmit_mark(q, transport, reason);
567
568 /* PR-SCTP A5) Any time the T3-rtx timer expires, on any destination,
569 * the sender SHOULD try to advance the "Advanced.Peer.Ack.Point" by
570 * following the procedures outlined in C1 - C5.
571 */
572 if (reason == SCTP_RTXR_T3_RTX)
573 q->asoc->stream.si->generate_ftsn(q, q->asoc->ctsn_ack_point);
574
575 /* Flush the queues only on timeout, since fast_rtx is only
576 * triggered during sack processing and the queue
577 * will be flushed at the end.
578 */
579 if (reason != SCTP_RTXR_FAST_RTX)
580 sctp_outq_flush(q, /* rtx_timeout */ 1, GFP_ATOMIC);
581}
582
583/*
584 * Transmit DATA chunks on the retransmit queue. Upon return from
585 * __sctp_outq_flush_rtx() the packet 'pkt' may contain chunks which
586 * need to be transmitted by the caller.
587 * We assume that pkt->transport has already been set.
588 *
589 * The return value is a normal kernel error return value.
590 */
591static int __sctp_outq_flush_rtx(struct sctp_outq *q, struct sctp_packet *pkt,
592 int rtx_timeout, int *start_timer, gfp_t gfp)
593{
594 struct sctp_transport *transport = pkt->transport;
595 struct sctp_chunk *chunk, *chunk1;
596 struct list_head *lqueue;
597 enum sctp_xmit status;
598 int error = 0;
599 int timer = 0;
600 int done = 0;
601 int fast_rtx;
602
603 lqueue = &q->retransmit;
604 fast_rtx = q->fast_rtx;
605
606 /* This loop handles time-out retransmissions, fast retransmissions,
607 * and retransmissions due to opening of whindow.
608 *
609 * RFC 2960 6.3.3 Handle T3-rtx Expiration
610 *
611 * E3) Determine how many of the earliest (i.e., lowest TSN)
612 * outstanding DATA chunks for the address for which the
613 * T3-rtx has expired will fit into a single packet, subject
614 * to the MTU constraint for the path corresponding to the
615 * destination transport address to which the retransmission
616 * is being sent (this may be different from the address for
617 * which the timer expires [see Section 6.4]). Call this value
618 * K. Bundle and retransmit those K DATA chunks in a single
619 * packet to the destination endpoint.
620 *
621 * [Just to be painfully clear, if we are retransmitting
622 * because a timeout just happened, we should send only ONE
623 * packet of retransmitted data.]
624 *
625 * For fast retransmissions we also send only ONE packet. However,
626 * if we are just flushing the queue due to open window, we'll
627 * try to send as much as possible.
628 */
629 list_for_each_entry_safe(chunk, chunk1, lqueue, transmitted_list) {
630 /* If the chunk is abandoned, move it to abandoned list. */
631 if (sctp_chunk_abandoned(chunk)) {
632 list_del_init(&chunk->transmitted_list);
633 sctp_insert_list(&q->abandoned,
634 &chunk->transmitted_list);
635 continue;
636 }
637
638 /* Make sure that Gap Acked TSNs are not retransmitted. A
639 * simple approach is just to move such TSNs out of the
640 * way and into a 'transmitted' queue and skip to the
641 * next chunk.
642 */
643 if (chunk->tsn_gap_acked) {
644 list_move_tail(&chunk->transmitted_list,
645 &transport->transmitted);
646 continue;
647 }
648
649 /* If we are doing fast retransmit, ignore non-fast_rtransmit
650 * chunks
651 */
652 if (fast_rtx && !chunk->fast_retransmit)
653 continue;
654
655redo:
656 /* Attempt to append this chunk to the packet. */
657 status = sctp_packet_append_chunk(pkt, chunk);
658
659 switch (status) {
660 case SCTP_XMIT_PMTU_FULL:
661 if (!pkt->has_data && !pkt->has_cookie_echo) {
662 /* If this packet did not contain DATA then
663 * retransmission did not happen, so do it
664 * again. We'll ignore the error here since
665 * control chunks are already freed so there
666 * is nothing we can do.
667 */
668 sctp_packet_transmit(pkt, gfp);
669 goto redo;
670 }
671
672 /* Send this packet. */
673 error = sctp_packet_transmit(pkt, gfp);
674
675 /* If we are retransmitting, we should only
676 * send a single packet.
677 * Otherwise, try appending this chunk again.
678 */
679 if (rtx_timeout || fast_rtx)
680 done = 1;
681 else
682 goto redo;
683
684 /* Bundle next chunk in the next round. */
685 break;
686
687 case SCTP_XMIT_RWND_FULL:
688 /* Send this packet. */
689 error = sctp_packet_transmit(pkt, gfp);
690
691 /* Stop sending DATA as there is no more room
692 * at the receiver.
693 */
694 done = 1;
695 break;
696
697 case SCTP_XMIT_DELAY:
698 /* Send this packet. */
699 error = sctp_packet_transmit(pkt, gfp);
700
701 /* Stop sending DATA because of nagle delay. */
702 done = 1;
703 break;
704
705 default:
706 /* The append was successful, so add this chunk to
707 * the transmitted list.
708 */
709 list_move_tail(&chunk->transmitted_list,
710 &transport->transmitted);
711
712 /* Mark the chunk as ineligible for fast retransmit
713 * after it is retransmitted.
714 */
715 if (chunk->fast_retransmit == SCTP_NEED_FRTX)
716 chunk->fast_retransmit = SCTP_DONT_FRTX;
717
718 q->asoc->stats.rtxchunks++;
719 break;
720 }
721
722 /* Set the timer if there were no errors */
723 if (!error && !timer)
724 timer = 1;
725
726 if (done)
727 break;
728 }
729
730 /* If we are here due to a retransmit timeout or a fast
731 * retransmit and if there are any chunks left in the retransmit
732 * queue that could not fit in the PMTU sized packet, they need
733 * to be marked as ineligible for a subsequent fast retransmit.
734 */
735 if (rtx_timeout || fast_rtx) {
736 list_for_each_entry(chunk1, lqueue, transmitted_list) {
737 if (chunk1->fast_retransmit == SCTP_NEED_FRTX)
738 chunk1->fast_retransmit = SCTP_DONT_FRTX;
739 }
740 }
741
742 *start_timer = timer;
743
744 /* Clear fast retransmit hint */
745 if (fast_rtx)
746 q->fast_rtx = 0;
747
748 return error;
749}
750
751/* Cork the outqueue so queued chunks are really queued. */
752void sctp_outq_uncork(struct sctp_outq *q, gfp_t gfp)
753{
754 if (q->cork)
755 q->cork = 0;
756
757 sctp_outq_flush(q, 0, gfp);
758}
759
760static int sctp_packet_singleton(struct sctp_transport *transport,
761 struct sctp_chunk *chunk, gfp_t gfp)
762{
763 const struct sctp_association *asoc = transport->asoc;
764 const __u16 sport = asoc->base.bind_addr.port;
765 const __u16 dport = asoc->peer.port;
766 const __u32 vtag = asoc->peer.i.init_tag;
767 struct sctp_packet singleton;
768
769 sctp_packet_init(&singleton, transport, sport, dport);
770 sctp_packet_config(&singleton, vtag, 0);
771 sctp_packet_append_chunk(&singleton, chunk);
772 return sctp_packet_transmit(&singleton, gfp);
773}
774
775/* Struct to hold the context during sctp outq flush */
776struct sctp_flush_ctx {
777 struct sctp_outq *q;
778 /* Current transport being used. It's NOT the same as curr active one */
779 struct sctp_transport *transport;
780 /* These transports have chunks to send. */
781 struct list_head transport_list;
782 struct sctp_association *asoc;
783 /* Packet on the current transport above */
784 struct sctp_packet *packet;
785 gfp_t gfp;
786};
787
788/* transport: current transport */
789static void sctp_outq_select_transport(struct sctp_flush_ctx *ctx,
790 struct sctp_chunk *chunk)
791{
792 struct sctp_transport *new_transport = chunk->transport;
793
794 if (!new_transport) {
795 if (!sctp_chunk_is_data(chunk)) {
796 /* If we have a prior transport pointer, see if
797 * the destination address of the chunk
798 * matches the destination address of the
799 * current transport. If not a match, then
800 * try to look up the transport with a given
801 * destination address. We do this because
802 * after processing ASCONFs, we may have new
803 * transports created.
804 */
805 if (ctx->transport && sctp_cmp_addr_exact(&chunk->dest,
806 &ctx->transport->ipaddr))
807 new_transport = ctx->transport;
808 else
809 new_transport = sctp_assoc_lookup_paddr(ctx->asoc,
810 &chunk->dest);
811 }
812
813 /* if we still don't have a new transport, then
814 * use the current active path.
815 */
816 if (!new_transport)
817 new_transport = ctx->asoc->peer.active_path;
818 } else {
819 __u8 type;
820
821 switch (new_transport->state) {
822 case SCTP_INACTIVE:
823 case SCTP_UNCONFIRMED:
824 case SCTP_PF:
825 /* If the chunk is Heartbeat or Heartbeat Ack,
826 * send it to chunk->transport, even if it's
827 * inactive.
828 *
829 * 3.3.6 Heartbeat Acknowledgement:
830 * ...
831 * A HEARTBEAT ACK is always sent to the source IP
832 * address of the IP datagram containing the
833 * HEARTBEAT chunk to which this ack is responding.
834 * ...
835 *
836 * ASCONF_ACKs also must be sent to the source.
837 */
838 type = chunk->chunk_hdr->type;
839 if (type != SCTP_CID_HEARTBEAT &&
840 type != SCTP_CID_HEARTBEAT_ACK &&
841 type != SCTP_CID_ASCONF_ACK)
842 new_transport = ctx->asoc->peer.active_path;
843 break;
844 default:
845 break;
846 }
847 }
848
849 /* Are we switching transports? Take care of transport locks. */
850 if (new_transport != ctx->transport) {
851 ctx->transport = new_transport;
852 ctx->packet = &ctx->transport->packet;
853
854 if (list_empty(&ctx->transport->send_ready))
855 list_add_tail(&ctx->transport->send_ready,
856 &ctx->transport_list);
857
858 sctp_packet_config(ctx->packet,
859 ctx->asoc->peer.i.init_tag,
860 ctx->asoc->peer.ecn_capable);
861 /* We've switched transports, so apply the
862 * Burst limit to the new transport.
863 */
864 sctp_transport_burst_limited(ctx->transport);
865 }
866}
867
868static void sctp_outq_flush_ctrl(struct sctp_flush_ctx *ctx)
869{
870 struct sctp_chunk *chunk, *tmp;
871 enum sctp_xmit status;
872 int one_packet, error;
873
874 list_for_each_entry_safe(chunk, tmp, &ctx->q->control_chunk_list, list) {
875 one_packet = 0;
876
877 /* RFC 5061, 5.3
878 * F1) This means that until such time as the ASCONF
879 * containing the add is acknowledged, the sender MUST
880 * NOT use the new IP address as a source for ANY SCTP
881 * packet except on carrying an ASCONF Chunk.
882 */
883 if (ctx->asoc->src_out_of_asoc_ok &&
884 chunk->chunk_hdr->type != SCTP_CID_ASCONF)
885 continue;
886
887 list_del_init(&chunk->list);
888
889 /* Pick the right transport to use. Should always be true for
890 * the first chunk as we don't have a transport by then.
891 */
892 sctp_outq_select_transport(ctx, chunk);
893
894 switch (chunk->chunk_hdr->type) {
895 /* 6.10 Bundling
896 * ...
897 * An endpoint MUST NOT bundle INIT, INIT ACK or SHUTDOWN
898 * COMPLETE with any other chunks. [Send them immediately.]
899 */
900 case SCTP_CID_INIT:
901 case SCTP_CID_INIT_ACK:
902 case SCTP_CID_SHUTDOWN_COMPLETE:
903 error = sctp_packet_singleton(ctx->transport, chunk,
904 ctx->gfp);
905 if (error < 0) {
906 ctx->asoc->base.sk->sk_err = -error;
907 return;
908 }
909 break;
910
911 case SCTP_CID_ABORT:
912 if (sctp_test_T_bit(chunk))
913 ctx->packet->vtag = ctx->asoc->c.my_vtag;
914 /* fallthru */
915
916 /* The following chunks are "response" chunks, i.e.
917 * they are generated in response to something we
918 * received. If we are sending these, then we can
919 * send only 1 packet containing these chunks.
920 */
921 case SCTP_CID_HEARTBEAT_ACK:
922 case SCTP_CID_SHUTDOWN_ACK:
923 case SCTP_CID_COOKIE_ACK:
924 case SCTP_CID_COOKIE_ECHO:
925 case SCTP_CID_ERROR:
926 case SCTP_CID_ECN_CWR:
927 case SCTP_CID_ASCONF_ACK:
928 one_packet = 1;
929 /* Fall through */
930
931 case SCTP_CID_SACK:
932 case SCTP_CID_HEARTBEAT:
933 case SCTP_CID_SHUTDOWN:
934 case SCTP_CID_ECN_ECNE:
935 case SCTP_CID_ASCONF:
936 case SCTP_CID_FWD_TSN:
937 case SCTP_CID_I_FWD_TSN:
938 case SCTP_CID_RECONF:
939 status = sctp_packet_transmit_chunk(ctx->packet, chunk,
940 one_packet, ctx->gfp);
941 if (status != SCTP_XMIT_OK) {
942 /* put the chunk back */
943 list_add(&chunk->list, &ctx->q->control_chunk_list);
944 break;
945 }
946
947 ctx->asoc->stats.octrlchunks++;
948 /* PR-SCTP C5) If a FORWARD TSN is sent, the
949 * sender MUST assure that at least one T3-rtx
950 * timer is running.
951 */
952 if (chunk->chunk_hdr->type == SCTP_CID_FWD_TSN ||
953 chunk->chunk_hdr->type == SCTP_CID_I_FWD_TSN) {
954 sctp_transport_reset_t3_rtx(ctx->transport);
955 ctx->transport->last_time_sent = jiffies;
956 }
957
958 if (chunk == ctx->asoc->strreset_chunk)
959 sctp_transport_reset_reconf_timer(ctx->transport);
960
961 break;
962
963 default:
964 /* We built a chunk with an illegal type! */
965 BUG();
966 }
967 }
968}
969
970/* Returns false if new data shouldn't be sent */
971static bool sctp_outq_flush_rtx(struct sctp_flush_ctx *ctx,
972 int rtx_timeout)
973{
974 int error, start_timer = 0;
975
976 if (ctx->asoc->peer.retran_path->state == SCTP_UNCONFIRMED)
977 return false;
978
979 if (ctx->transport != ctx->asoc->peer.retran_path) {
980 /* Switch transports & prepare the packet. */
981 ctx->transport = ctx->asoc->peer.retran_path;
982 ctx->packet = &ctx->transport->packet;
983
984 if (list_empty(&ctx->transport->send_ready))
985 list_add_tail(&ctx->transport->send_ready,
986 &ctx->transport_list);
987
988 sctp_packet_config(ctx->packet, ctx->asoc->peer.i.init_tag,
989 ctx->asoc->peer.ecn_capable);
990 }
991
992 error = __sctp_outq_flush_rtx(ctx->q, ctx->packet, rtx_timeout,
993 &start_timer, ctx->gfp);
994 if (error < 0)
995 ctx->asoc->base.sk->sk_err = -error;
996
997 if (start_timer) {
998 sctp_transport_reset_t3_rtx(ctx->transport);
999 ctx->transport->last_time_sent = jiffies;
1000 }
1001
1002 /* This can happen on COOKIE-ECHO resend. Only
1003 * one chunk can get bundled with a COOKIE-ECHO.
1004 */
1005 if (ctx->packet->has_cookie_echo)
1006 return false;
1007
1008 /* Don't send new data if there is still data
1009 * waiting to retransmit.
1010 */
1011 if (!list_empty(&ctx->q->retransmit))
1012 return false;
1013
1014 return true;
1015}
1016
1017static void sctp_outq_flush_data(struct sctp_flush_ctx *ctx,
1018 int rtx_timeout)
1019{
1020 struct sctp_chunk *chunk;
1021 enum sctp_xmit status;
1022
1023 /* Is it OK to send data chunks? */
1024 switch (ctx->asoc->state) {
1025 case SCTP_STATE_COOKIE_ECHOED:
1026 /* Only allow bundling when this packet has a COOKIE-ECHO
1027 * chunk.
1028 */
1029 if (!ctx->packet || !ctx->packet->has_cookie_echo)
1030 return;
1031
1032 /* fall through */
1033 case SCTP_STATE_ESTABLISHED:
1034 case SCTP_STATE_SHUTDOWN_PENDING:
1035 case SCTP_STATE_SHUTDOWN_RECEIVED:
1036 break;
1037
1038 default:
1039 /* Do nothing. */
1040 return;
1041 }
1042
1043 /* RFC 2960 6.1 Transmission of DATA Chunks
1044 *
1045 * C) When the time comes for the sender to transmit,
1046 * before sending new DATA chunks, the sender MUST
1047 * first transmit any outstanding DATA chunks which
1048 * are marked for retransmission (limited by the
1049 * current cwnd).
1050 */
1051 if (!list_empty(&ctx->q->retransmit) &&
1052 !sctp_outq_flush_rtx(ctx, rtx_timeout))
1053 return;
1054
1055 /* Apply Max.Burst limitation to the current transport in
1056 * case it will be used for new data. We are going to
1057 * rest it before we return, but we want to apply the limit
1058 * to the currently queued data.
1059 */
1060 if (ctx->transport)
1061 sctp_transport_burst_limited(ctx->transport);
1062
1063 /* Finally, transmit new packets. */
1064 while ((chunk = sctp_outq_dequeue_data(ctx->q)) != NULL) {
1065 __u32 sid = ntohs(chunk->subh.data_hdr->stream);
1066 __u8 stream_state = SCTP_SO(&ctx->asoc->stream, sid)->state;
1067
1068 /* Has this chunk expired? */
1069 if (sctp_chunk_abandoned(chunk)) {
1070 sctp_sched_dequeue_done(ctx->q, chunk);
1071 sctp_chunk_fail(chunk, 0);
1072 sctp_chunk_free(chunk);
1073 continue;
1074 }
1075
1076 if (stream_state == SCTP_STREAM_CLOSED) {
1077 sctp_outq_head_data(ctx->q, chunk);
1078 break;
1079 }
1080
1081 sctp_outq_select_transport(ctx, chunk);
1082
1083 pr_debug("%s: outq:%p, chunk:%p[%s], tx-tsn:0x%x skb->head:%p skb->users:%d\n",
1084 __func__, ctx->q, chunk, chunk && chunk->chunk_hdr ?
1085 sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)) :
1086 "illegal chunk", ntohl(chunk->subh.data_hdr->tsn),
1087 chunk->skb ? chunk->skb->head : NULL, chunk->skb ?
1088 refcount_read(&chunk->skb->users) : -1);
1089
1090 /* Add the chunk to the packet. */
1091 status = sctp_packet_transmit_chunk(ctx->packet, chunk, 0,
1092 ctx->gfp);
1093 if (status != SCTP_XMIT_OK) {
1094 /* We could not append this chunk, so put
1095 * the chunk back on the output queue.
1096 */
1097 pr_debug("%s: could not transmit tsn:0x%x, status:%d\n",
1098 __func__, ntohl(chunk->subh.data_hdr->tsn),
1099 status);
1100
1101 sctp_outq_head_data(ctx->q, chunk);
1102 break;
1103 }
1104
1105 /* The sender is in the SHUTDOWN-PENDING state,
1106 * The sender MAY set the I-bit in the DATA
1107 * chunk header.
1108 */
1109 if (ctx->asoc->state == SCTP_STATE_SHUTDOWN_PENDING)
1110 chunk->chunk_hdr->flags |= SCTP_DATA_SACK_IMM;
1111 if (chunk->chunk_hdr->flags & SCTP_DATA_UNORDERED)
1112 ctx->asoc->stats.ouodchunks++;
1113 else
1114 ctx->asoc->stats.oodchunks++;
1115
1116 /* Only now it's safe to consider this
1117 * chunk as sent, sched-wise.
1118 */
1119 sctp_sched_dequeue_done(ctx->q, chunk);
1120
1121 list_add_tail(&chunk->transmitted_list,
1122 &ctx->transport->transmitted);
1123
1124 sctp_transport_reset_t3_rtx(ctx->transport);
1125 ctx->transport->last_time_sent = jiffies;
1126
1127 /* Only let one DATA chunk get bundled with a
1128 * COOKIE-ECHO chunk.
1129 */
1130 if (ctx->packet->has_cookie_echo)
1131 break;
1132 }
1133}
1134
1135static void sctp_outq_flush_transports(struct sctp_flush_ctx *ctx)
1136{
1137 struct list_head *ltransport;
1138 struct sctp_packet *packet;
1139 struct sctp_transport *t;
1140 int error = 0;
1141
1142 while ((ltransport = sctp_list_dequeue(&ctx->transport_list)) != NULL) {
1143 t = list_entry(ltransport, struct sctp_transport, send_ready);
1144 packet = &t->packet;
1145 if (!sctp_packet_empty(packet)) {
1146 error = sctp_packet_transmit(packet, ctx->gfp);
1147 if (error < 0)
1148 ctx->q->asoc->base.sk->sk_err = -error;
1149 }
1150
1151 /* Clear the burst limited state, if any */
1152 sctp_transport_burst_reset(t);
1153 }
1154}
1155
1156/* Try to flush an outqueue.
1157 *
1158 * Description: Send everything in q which we legally can, subject to
1159 * congestion limitations.
1160 * * Note: This function can be called from multiple contexts so appropriate
1161 * locking concerns must be made. Today we use the sock lock to protect
1162 * this function.
1163 */
1164
1165static void sctp_outq_flush(struct sctp_outq *q, int rtx_timeout, gfp_t gfp)
1166{
1167 struct sctp_flush_ctx ctx = {
1168 .q = q,
1169 .transport = NULL,
1170 .transport_list = LIST_HEAD_INIT(ctx.transport_list),
1171 .asoc = q->asoc,
1172 .packet = NULL,
1173 .gfp = gfp,
1174 };
1175
1176 /* 6.10 Bundling
1177 * ...
1178 * When bundling control chunks with DATA chunks, an
1179 * endpoint MUST place control chunks first in the outbound
1180 * SCTP packet. The transmitter MUST transmit DATA chunks
1181 * within a SCTP packet in increasing order of TSN.
1182 * ...
1183 */
1184
1185 sctp_outq_flush_ctrl(&ctx);
1186
1187 if (q->asoc->src_out_of_asoc_ok)
1188 goto sctp_flush_out;
1189
1190 sctp_outq_flush_data(&ctx, rtx_timeout);
1191
1192sctp_flush_out:
1193
1194 sctp_outq_flush_transports(&ctx);
1195}
1196
1197/* Update unack_data based on the incoming SACK chunk */
1198static void sctp_sack_update_unack_data(struct sctp_association *assoc,
1199 struct sctp_sackhdr *sack)
1200{
1201 union sctp_sack_variable *frags;
1202 __u16 unack_data;
1203 int i;
1204
1205 unack_data = assoc->next_tsn - assoc->ctsn_ack_point - 1;
1206
1207 frags = sack->variable;
1208 for (i = 0; i < ntohs(sack->num_gap_ack_blocks); i++) {
1209 unack_data -= ((ntohs(frags[i].gab.end) -
1210 ntohs(frags[i].gab.start) + 1));
1211 }
1212
1213 assoc->unack_data = unack_data;
1214}
1215
1216/* This is where we REALLY process a SACK.
1217 *
1218 * Process the SACK against the outqueue. Mostly, this just frees
1219 * things off the transmitted queue.
1220 */
1221int sctp_outq_sack(struct sctp_outq *q, struct sctp_chunk *chunk)
1222{
1223 struct sctp_association *asoc = q->asoc;
1224 struct sctp_sackhdr *sack = chunk->subh.sack_hdr;
1225 struct sctp_transport *transport;
1226 struct sctp_chunk *tchunk = NULL;
1227 struct list_head *lchunk, *transport_list, *temp;
1228 union sctp_sack_variable *frags = sack->variable;
1229 __u32 sack_ctsn, ctsn, tsn;
1230 __u32 highest_tsn, highest_new_tsn;
1231 __u32 sack_a_rwnd;
1232 unsigned int outstanding;
1233 struct sctp_transport *primary = asoc->peer.primary_path;
1234 int count_of_newacks = 0;
1235 int gap_ack_blocks;
1236 u8 accum_moved = 0;
1237
1238 /* Grab the association's destination address list. */
1239 transport_list = &asoc->peer.transport_addr_list;
1240
1241 sack_ctsn = ntohl(sack->cum_tsn_ack);
1242 gap_ack_blocks = ntohs(sack->num_gap_ack_blocks);
1243 asoc->stats.gapcnt += gap_ack_blocks;
1244 /*
1245 * SFR-CACC algorithm:
1246 * On receipt of a SACK the sender SHOULD execute the
1247 * following statements.
1248 *
1249 * 1) If the cumulative ack in the SACK passes next tsn_at_change
1250 * on the current primary, the CHANGEOVER_ACTIVE flag SHOULD be
1251 * cleared. The CYCLING_CHANGEOVER flag SHOULD also be cleared for
1252 * all destinations.
1253 * 2) If the SACK contains gap acks and the flag CHANGEOVER_ACTIVE
1254 * is set the receiver of the SACK MUST take the following actions:
1255 *
1256 * A) Initialize the cacc_saw_newack to 0 for all destination
1257 * addresses.
1258 *
1259 * Only bother if changeover_active is set. Otherwise, this is
1260 * totally suboptimal to do on every SACK.
1261 */
1262 if (primary->cacc.changeover_active) {
1263 u8 clear_cycling = 0;
1264
1265 if (TSN_lte(primary->cacc.next_tsn_at_change, sack_ctsn)) {
1266 primary->cacc.changeover_active = 0;
1267 clear_cycling = 1;
1268 }
1269
1270 if (clear_cycling || gap_ack_blocks) {
1271 list_for_each_entry(transport, transport_list,
1272 transports) {
1273 if (clear_cycling)
1274 transport->cacc.cycling_changeover = 0;
1275 if (gap_ack_blocks)
1276 transport->cacc.cacc_saw_newack = 0;
1277 }
1278 }
1279 }
1280
1281 /* Get the highest TSN in the sack. */
1282 highest_tsn = sack_ctsn;
1283 if (gap_ack_blocks)
1284 highest_tsn += ntohs(frags[gap_ack_blocks - 1].gab.end);
1285
1286 if (TSN_lt(asoc->highest_sacked, highest_tsn))
1287 asoc->highest_sacked = highest_tsn;
1288
1289 highest_new_tsn = sack_ctsn;
1290
1291 /* Run through the retransmit queue. Credit bytes received
1292 * and free those chunks that we can.
1293 */
1294 sctp_check_transmitted(q, &q->retransmit, NULL, NULL, sack, &highest_new_tsn);
1295
1296 /* Run through the transmitted queue.
1297 * Credit bytes received and free those chunks which we can.
1298 *
1299 * This is a MASSIVE candidate for optimization.
1300 */
1301 list_for_each_entry(transport, transport_list, transports) {
1302 sctp_check_transmitted(q, &transport->transmitted,
1303 transport, &chunk->source, sack,
1304 &highest_new_tsn);
1305 /*
1306 * SFR-CACC algorithm:
1307 * C) Let count_of_newacks be the number of
1308 * destinations for which cacc_saw_newack is set.
1309 */
1310 if (transport->cacc.cacc_saw_newack)
1311 count_of_newacks++;
1312 }
1313
1314 /* Move the Cumulative TSN Ack Point if appropriate. */
1315 if (TSN_lt(asoc->ctsn_ack_point, sack_ctsn)) {
1316 asoc->ctsn_ack_point = sack_ctsn;
1317 accum_moved = 1;
1318 }
1319
1320 if (gap_ack_blocks) {
1321
1322 if (asoc->fast_recovery && accum_moved)
1323 highest_new_tsn = highest_tsn;
1324
1325 list_for_each_entry(transport, transport_list, transports)
1326 sctp_mark_missing(q, &transport->transmitted, transport,
1327 highest_new_tsn, count_of_newacks);
1328 }
1329
1330 /* Update unack_data field in the assoc. */
1331 sctp_sack_update_unack_data(asoc, sack);
1332
1333 ctsn = asoc->ctsn_ack_point;
1334
1335 /* Throw away stuff rotting on the sack queue. */
1336 list_for_each_safe(lchunk, temp, &q->sacked) {
1337 tchunk = list_entry(lchunk, struct sctp_chunk,
1338 transmitted_list);
1339 tsn = ntohl(tchunk->subh.data_hdr->tsn);
1340 if (TSN_lte(tsn, ctsn)) {
1341 list_del_init(&tchunk->transmitted_list);
1342 if (asoc->peer.prsctp_capable &&
1343 SCTP_PR_PRIO_ENABLED(chunk->sinfo.sinfo_flags))
1344 asoc->sent_cnt_removable--;
1345 sctp_chunk_free(tchunk);
1346 }
1347 }
1348
1349 /* ii) Set rwnd equal to the newly received a_rwnd minus the
1350 * number of bytes still outstanding after processing the
1351 * Cumulative TSN Ack and the Gap Ack Blocks.
1352 */
1353
1354 sack_a_rwnd = ntohl(sack->a_rwnd);
1355 asoc->peer.zero_window_announced = !sack_a_rwnd;
1356 outstanding = q->outstanding_bytes;
1357
1358 if (outstanding < sack_a_rwnd)
1359 sack_a_rwnd -= outstanding;
1360 else
1361 sack_a_rwnd = 0;
1362
1363 asoc->peer.rwnd = sack_a_rwnd;
1364
1365 asoc->stream.si->generate_ftsn(q, sack_ctsn);
1366
1367 pr_debug("%s: sack cumulative tsn ack:0x%x\n", __func__, sack_ctsn);
1368 pr_debug("%s: cumulative tsn ack of assoc:%p is 0x%x, "
1369 "advertised peer ack point:0x%x\n", __func__, asoc, ctsn,
1370 asoc->adv_peer_ack_point);
1371
1372 return sctp_outq_is_empty(q);
1373}
1374
1375/* Is the outqueue empty?
1376 * The queue is empty when we have not pending data, no in-flight data
1377 * and nothing pending retransmissions.
1378 */
1379int sctp_outq_is_empty(const struct sctp_outq *q)
1380{
1381 return q->out_qlen == 0 && q->outstanding_bytes == 0 &&
1382 list_empty(&q->retransmit);
1383}
1384
1385/********************************************************************
1386 * 2nd Level Abstractions
1387 ********************************************************************/
1388
1389/* Go through a transport's transmitted list or the association's retransmit
1390 * list and move chunks that are acked by the Cumulative TSN Ack to q->sacked.
1391 * The retransmit list will not have an associated transport.
1392 *
1393 * I added coherent debug information output. --xguo
1394 *
1395 * Instead of printing 'sacked' or 'kept' for each TSN on the
1396 * transmitted_queue, we print a range: SACKED: TSN1-TSN2, TSN3, TSN4-TSN5.
1397 * KEPT TSN6-TSN7, etc.
1398 */
1399static void sctp_check_transmitted(struct sctp_outq *q,
1400 struct list_head *transmitted_queue,
1401 struct sctp_transport *transport,
1402 union sctp_addr *saddr,
1403 struct sctp_sackhdr *sack,
1404 __u32 *highest_new_tsn_in_sack)
1405{
1406 struct list_head *lchunk;
1407 struct sctp_chunk *tchunk;
1408 struct list_head tlist;
1409 __u32 tsn;
1410 __u32 sack_ctsn;
1411 __u32 rtt;
1412 __u8 restart_timer = 0;
1413 int bytes_acked = 0;
1414 int migrate_bytes = 0;
1415 bool forward_progress = false;
1416
1417 sack_ctsn = ntohl(sack->cum_tsn_ack);
1418
1419 INIT_LIST_HEAD(&tlist);
1420
1421 /* The while loop will skip empty transmitted queues. */
1422 while (NULL != (lchunk = sctp_list_dequeue(transmitted_queue))) {
1423 tchunk = list_entry(lchunk, struct sctp_chunk,
1424 transmitted_list);
1425
1426 if (sctp_chunk_abandoned(tchunk)) {
1427 /* Move the chunk to abandoned list. */
1428 sctp_insert_list(&q->abandoned, lchunk);
1429
1430 /* If this chunk has not been acked, stop
1431 * considering it as 'outstanding'.
1432 */
1433 if (transmitted_queue != &q->retransmit &&
1434 !tchunk->tsn_gap_acked) {
1435 if (tchunk->transport)
1436 tchunk->transport->flight_size -=
1437 sctp_data_size(tchunk);
1438 q->outstanding_bytes -= sctp_data_size(tchunk);
1439 }
1440 continue;
1441 }
1442
1443 tsn = ntohl(tchunk->subh.data_hdr->tsn);
1444 if (sctp_acked(sack, tsn)) {
1445 /* If this queue is the retransmit queue, the
1446 * retransmit timer has already reclaimed
1447 * the outstanding bytes for this chunk, so only
1448 * count bytes associated with a transport.
1449 */
1450 if (transport && !tchunk->tsn_gap_acked) {
1451 /* If this chunk is being used for RTT
1452 * measurement, calculate the RTT and update
1453 * the RTO using this value.
1454 *
1455 * 6.3.1 C5) Karn's algorithm: RTT measurements
1456 * MUST NOT be made using packets that were
1457 * retransmitted (and thus for which it is
1458 * ambiguous whether the reply was for the
1459 * first instance of the packet or a later
1460 * instance).
1461 */
1462 if (!sctp_chunk_retransmitted(tchunk) &&
1463 tchunk->rtt_in_progress) {
1464 tchunk->rtt_in_progress = 0;
1465 rtt = jiffies - tchunk->sent_at;
1466 sctp_transport_update_rto(transport,
1467 rtt);
1468 }
1469
1470 if (TSN_lte(tsn, sack_ctsn)) {
1471 /*
1472 * SFR-CACC algorithm:
1473 * 2) If the SACK contains gap acks
1474 * and the flag CHANGEOVER_ACTIVE is
1475 * set the receiver of the SACK MUST
1476 * take the following action:
1477 *
1478 * B) For each TSN t being acked that
1479 * has not been acked in any SACK so
1480 * far, set cacc_saw_newack to 1 for
1481 * the destination that the TSN was
1482 * sent to.
1483 */
1484 if (sack->num_gap_ack_blocks &&
1485 q->asoc->peer.primary_path->cacc.
1486 changeover_active)
1487 transport->cacc.cacc_saw_newack
1488 = 1;
1489 }
1490 }
1491
1492 /* If the chunk hasn't been marked as ACKED,
1493 * mark it and account bytes_acked if the
1494 * chunk had a valid transport (it will not
1495 * have a transport if ASCONF had deleted it
1496 * while DATA was outstanding).
1497 */
1498 if (!tchunk->tsn_gap_acked) {
1499 tchunk->tsn_gap_acked = 1;
1500 if (TSN_lt(*highest_new_tsn_in_sack, tsn))
1501 *highest_new_tsn_in_sack = tsn;
1502 bytes_acked += sctp_data_size(tchunk);
1503 if (!tchunk->transport)
1504 migrate_bytes += sctp_data_size(tchunk);
1505 forward_progress = true;
1506 }
1507
1508 if (TSN_lte(tsn, sack_ctsn)) {
1509 /* RFC 2960 6.3.2 Retransmission Timer Rules
1510 *
1511 * R3) Whenever a SACK is received
1512 * that acknowledges the DATA chunk
1513 * with the earliest outstanding TSN
1514 * for that address, restart T3-rtx
1515 * timer for that address with its
1516 * current RTO.
1517 */
1518 restart_timer = 1;
1519 forward_progress = true;
1520
1521 list_add_tail(&tchunk->transmitted_list,
1522 &q->sacked);
1523 } else {
1524 /* RFC2960 7.2.4, sctpimpguide-05 2.8.2
1525 * M2) Each time a SACK arrives reporting
1526 * 'Stray DATA chunk(s)' record the highest TSN
1527 * reported as newly acknowledged, call this
1528 * value 'HighestTSNinSack'. A newly
1529 * acknowledged DATA chunk is one not
1530 * previously acknowledged in a SACK.
1531 *
1532 * When the SCTP sender of data receives a SACK
1533 * chunk that acknowledges, for the first time,
1534 * the receipt of a DATA chunk, all the still
1535 * unacknowledged DATA chunks whose TSN is
1536 * older than that newly acknowledged DATA
1537 * chunk, are qualified as 'Stray DATA chunks'.
1538 */
1539 list_add_tail(lchunk, &tlist);
1540 }
1541 } else {
1542 if (tchunk->tsn_gap_acked) {
1543 pr_debug("%s: receiver reneged on data TSN:0x%x\n",
1544 __func__, tsn);
1545
1546 tchunk->tsn_gap_acked = 0;
1547
1548 if (tchunk->transport)
1549 bytes_acked -= sctp_data_size(tchunk);
1550
1551 /* RFC 2960 6.3.2 Retransmission Timer Rules
1552 *
1553 * R4) Whenever a SACK is received missing a
1554 * TSN that was previously acknowledged via a
1555 * Gap Ack Block, start T3-rtx for the
1556 * destination address to which the DATA
1557 * chunk was originally
1558 * transmitted if it is not already running.
1559 */
1560 restart_timer = 1;
1561 }
1562
1563 list_add_tail(lchunk, &tlist);
1564 }
1565 }
1566
1567 if (transport) {
1568 if (bytes_acked) {
1569 struct sctp_association *asoc = transport->asoc;
1570
1571 /* We may have counted DATA that was migrated
1572 * to this transport due to DEL-IP operation.
1573 * Subtract those bytes, since the were never
1574 * send on this transport and shouldn't be
1575 * credited to this transport.
1576 */
1577 bytes_acked -= migrate_bytes;
1578
1579 /* 8.2. When an outstanding TSN is acknowledged,
1580 * the endpoint shall clear the error counter of
1581 * the destination transport address to which the
1582 * DATA chunk was last sent.
1583 * The association's overall error counter is
1584 * also cleared.
1585 */
1586 transport->error_count = 0;
1587 transport->asoc->overall_error_count = 0;
1588 forward_progress = true;
1589
1590 /*
1591 * While in SHUTDOWN PENDING, we may have started
1592 * the T5 shutdown guard timer after reaching the
1593 * retransmission limit. Stop that timer as soon
1594 * as the receiver acknowledged any data.
1595 */
1596 if (asoc->state == SCTP_STATE_SHUTDOWN_PENDING &&
1597 del_timer(&asoc->timers
1598 [SCTP_EVENT_TIMEOUT_T5_SHUTDOWN_GUARD]))
1599 sctp_association_put(asoc);
1600
1601 /* Mark the destination transport address as
1602 * active if it is not so marked.
1603 */
1604 if ((transport->state == SCTP_INACTIVE ||
1605 transport->state == SCTP_UNCONFIRMED) &&
1606 sctp_cmp_addr_exact(&transport->ipaddr, saddr)) {
1607 sctp_assoc_control_transport(
1608 transport->asoc,
1609 transport,
1610 SCTP_TRANSPORT_UP,
1611 SCTP_RECEIVED_SACK);
1612 }
1613
1614 sctp_transport_raise_cwnd(transport, sack_ctsn,
1615 bytes_acked);
1616
1617 transport->flight_size -= bytes_acked;
1618 if (transport->flight_size == 0)
1619 transport->partial_bytes_acked = 0;
1620 q->outstanding_bytes -= bytes_acked + migrate_bytes;
1621 } else {
1622 /* RFC 2960 6.1, sctpimpguide-06 2.15.2
1623 * When a sender is doing zero window probing, it
1624 * should not timeout the association if it continues
1625 * to receive new packets from the receiver. The
1626 * reason is that the receiver MAY keep its window
1627 * closed for an indefinite time.
1628 * A sender is doing zero window probing when the
1629 * receiver's advertised window is zero, and there is
1630 * only one data chunk in flight to the receiver.
1631 *
1632 * Allow the association to timeout while in SHUTDOWN
1633 * PENDING or SHUTDOWN RECEIVED in case the receiver
1634 * stays in zero window mode forever.
1635 */
1636 if (!q->asoc->peer.rwnd &&
1637 !list_empty(&tlist) &&
1638 (sack_ctsn+2 == q->asoc->next_tsn) &&
1639 q->asoc->state < SCTP_STATE_SHUTDOWN_PENDING) {
1640 pr_debug("%s: sack received for zero window "
1641 "probe:%u\n", __func__, sack_ctsn);
1642
1643 q->asoc->overall_error_count = 0;
1644 transport->error_count = 0;
1645 }
1646 }
1647
1648 /* RFC 2960 6.3.2 Retransmission Timer Rules
1649 *
1650 * R2) Whenever all outstanding data sent to an address have
1651 * been acknowledged, turn off the T3-rtx timer of that
1652 * address.
1653 */
1654 if (!transport->flight_size) {
1655 if (del_timer(&transport->T3_rtx_timer))
1656 sctp_transport_put(transport);
1657 } else if (restart_timer) {
1658 if (!mod_timer(&transport->T3_rtx_timer,
1659 jiffies + transport->rto))
1660 sctp_transport_hold(transport);
1661 }
1662
1663 if (forward_progress) {
1664 if (transport->dst)
1665 sctp_transport_dst_confirm(transport);
1666 }
1667 }
1668
1669 list_splice(&tlist, transmitted_queue);
1670}
1671
1672/* Mark chunks as missing and consequently may get retransmitted. */
1673static void sctp_mark_missing(struct sctp_outq *q,
1674 struct list_head *transmitted_queue,
1675 struct sctp_transport *transport,
1676 __u32 highest_new_tsn_in_sack,
1677 int count_of_newacks)
1678{
1679 struct sctp_chunk *chunk;
1680 __u32 tsn;
1681 char do_fast_retransmit = 0;
1682 struct sctp_association *asoc = q->asoc;
1683 struct sctp_transport *primary = asoc->peer.primary_path;
1684
1685 list_for_each_entry(chunk, transmitted_queue, transmitted_list) {
1686
1687 tsn = ntohl(chunk->subh.data_hdr->tsn);
1688
1689 /* RFC 2960 7.2.4, sctpimpguide-05 2.8.2 M3) Examine all
1690 * 'Unacknowledged TSN's', if the TSN number of an
1691 * 'Unacknowledged TSN' is smaller than the 'HighestTSNinSack'
1692 * value, increment the 'TSN.Missing.Report' count on that
1693 * chunk if it has NOT been fast retransmitted or marked for
1694 * fast retransmit already.
1695 */
1696 if (chunk->fast_retransmit == SCTP_CAN_FRTX &&
1697 !chunk->tsn_gap_acked &&
1698 TSN_lt(tsn, highest_new_tsn_in_sack)) {
1699
1700 /* SFR-CACC may require us to skip marking
1701 * this chunk as missing.
1702 */
1703 if (!transport || !sctp_cacc_skip(primary,
1704 chunk->transport,
1705 count_of_newacks, tsn)) {
1706 chunk->tsn_missing_report++;
1707
1708 pr_debug("%s: tsn:0x%x missing counter:%d\n",
1709 __func__, tsn, chunk->tsn_missing_report);
1710 }
1711 }
1712 /*
1713 * M4) If any DATA chunk is found to have a
1714 * 'TSN.Missing.Report'
1715 * value larger than or equal to 3, mark that chunk for
1716 * retransmission and start the fast retransmit procedure.
1717 */
1718
1719 if (chunk->tsn_missing_report >= 3) {
1720 chunk->fast_retransmit = SCTP_NEED_FRTX;
1721 do_fast_retransmit = 1;
1722 }
1723 }
1724
1725 if (transport) {
1726 if (do_fast_retransmit)
1727 sctp_retransmit(q, transport, SCTP_RTXR_FAST_RTX);
1728
1729 pr_debug("%s: transport:%p, cwnd:%d, ssthresh:%d, "
1730 "flight_size:%d, pba:%d\n", __func__, transport,
1731 transport->cwnd, transport->ssthresh,
1732 transport->flight_size, transport->partial_bytes_acked);
1733 }
1734}
1735
1736/* Is the given TSN acked by this packet? */
1737static int sctp_acked(struct sctp_sackhdr *sack, __u32 tsn)
1738{
1739 __u32 ctsn = ntohl(sack->cum_tsn_ack);
1740 union sctp_sack_variable *frags;
1741 __u16 tsn_offset, blocks;
1742 int i;
1743
1744 if (TSN_lte(tsn, ctsn))
1745 goto pass;
1746
1747 /* 3.3.4 Selective Acknowledgment (SACK) (3):
1748 *
1749 * Gap Ack Blocks:
1750 * These fields contain the Gap Ack Blocks. They are repeated
1751 * for each Gap Ack Block up to the number of Gap Ack Blocks
1752 * defined in the Number of Gap Ack Blocks field. All DATA
1753 * chunks with TSNs greater than or equal to (Cumulative TSN
1754 * Ack + Gap Ack Block Start) and less than or equal to
1755 * (Cumulative TSN Ack + Gap Ack Block End) of each Gap Ack
1756 * Block are assumed to have been received correctly.
1757 */
1758
1759 frags = sack->variable;
1760 blocks = ntohs(sack->num_gap_ack_blocks);
1761 tsn_offset = tsn - ctsn;
1762 for (i = 0; i < blocks; ++i) {
1763 if (tsn_offset >= ntohs(frags[i].gab.start) &&
1764 tsn_offset <= ntohs(frags[i].gab.end))
1765 goto pass;
1766 }
1767
1768 return 0;
1769pass:
1770 return 1;
1771}
1772
1773static inline int sctp_get_skip_pos(struct sctp_fwdtsn_skip *skiplist,
1774 int nskips, __be16 stream)
1775{
1776 int i;
1777
1778 for (i = 0; i < nskips; i++) {
1779 if (skiplist[i].stream == stream)
1780 return i;
1781 }
1782 return i;
1783}
1784
1785/* Create and add a fwdtsn chunk to the outq's control queue if needed. */
1786void sctp_generate_fwdtsn(struct sctp_outq *q, __u32 ctsn)
1787{
1788 struct sctp_association *asoc = q->asoc;
1789 struct sctp_chunk *ftsn_chunk = NULL;
1790 struct sctp_fwdtsn_skip ftsn_skip_arr[10];
1791 int nskips = 0;
1792 int skip_pos = 0;
1793 __u32 tsn;
1794 struct sctp_chunk *chunk;
1795 struct list_head *lchunk, *temp;
1796
1797 if (!asoc->peer.prsctp_capable)
1798 return;
1799
1800 /* PR-SCTP C1) Let SackCumAck be the Cumulative TSN ACK carried in the
1801 * received SACK.
1802 *
1803 * If (Advanced.Peer.Ack.Point < SackCumAck), then update
1804 * Advanced.Peer.Ack.Point to be equal to SackCumAck.
1805 */
1806 if (TSN_lt(asoc->adv_peer_ack_point, ctsn))
1807 asoc->adv_peer_ack_point = ctsn;
1808
1809 /* PR-SCTP C2) Try to further advance the "Advanced.Peer.Ack.Point"
1810 * locally, that is, to move "Advanced.Peer.Ack.Point" up as long as
1811 * the chunk next in the out-queue space is marked as "abandoned" as
1812 * shown in the following example:
1813 *
1814 * Assuming that a SACK arrived with the Cumulative TSN ACK 102
1815 * and the Advanced.Peer.Ack.Point is updated to this value:
1816 *
1817 * out-queue at the end of ==> out-queue after Adv.Ack.Point
1818 * normal SACK processing local advancement
1819 * ... ...
1820 * Adv.Ack.Pt-> 102 acked 102 acked
1821 * 103 abandoned 103 abandoned
1822 * 104 abandoned Adv.Ack.P-> 104 abandoned
1823 * 105 105
1824 * 106 acked 106 acked
1825 * ... ...
1826 *
1827 * In this example, the data sender successfully advanced the
1828 * "Advanced.Peer.Ack.Point" from 102 to 104 locally.
1829 */
1830 list_for_each_safe(lchunk, temp, &q->abandoned) {
1831 chunk = list_entry(lchunk, struct sctp_chunk,
1832 transmitted_list);
1833 tsn = ntohl(chunk->subh.data_hdr->tsn);
1834
1835 /* Remove any chunks in the abandoned queue that are acked by
1836 * the ctsn.
1837 */
1838 if (TSN_lte(tsn, ctsn)) {
1839 list_del_init(lchunk);
1840 sctp_chunk_free(chunk);
1841 } else {
1842 if (TSN_lte(tsn, asoc->adv_peer_ack_point+1)) {
1843 asoc->adv_peer_ack_point = tsn;
1844 if (chunk->chunk_hdr->flags &
1845 SCTP_DATA_UNORDERED)
1846 continue;
1847 skip_pos = sctp_get_skip_pos(&ftsn_skip_arr[0],
1848 nskips,
1849 chunk->subh.data_hdr->stream);
1850 ftsn_skip_arr[skip_pos].stream =
1851 chunk->subh.data_hdr->stream;
1852 ftsn_skip_arr[skip_pos].ssn =
1853 chunk->subh.data_hdr->ssn;
1854 if (skip_pos == nskips)
1855 nskips++;
1856 if (nskips == 10)
1857 break;
1858 } else
1859 break;
1860 }
1861 }
1862
1863 /* PR-SCTP C3) If, after step C1 and C2, the "Advanced.Peer.Ack.Point"
1864 * is greater than the Cumulative TSN ACK carried in the received
1865 * SACK, the data sender MUST send the data receiver a FORWARD TSN
1866 * chunk containing the latest value of the
1867 * "Advanced.Peer.Ack.Point".
1868 *
1869 * C4) For each "abandoned" TSN the sender of the FORWARD TSN SHOULD
1870 * list each stream and sequence number in the forwarded TSN. This
1871 * information will enable the receiver to easily find any
1872 * stranded TSN's waiting on stream reorder queues. Each stream
1873 * SHOULD only be reported once; this means that if multiple
1874 * abandoned messages occur in the same stream then only the
1875 * highest abandoned stream sequence number is reported. If the
1876 * total size of the FORWARD TSN does NOT fit in a single MTU then
1877 * the sender of the FORWARD TSN SHOULD lower the
1878 * Advanced.Peer.Ack.Point to the last TSN that will fit in a
1879 * single MTU.
1880 */
1881 if (asoc->adv_peer_ack_point > ctsn)
1882 ftsn_chunk = sctp_make_fwdtsn(asoc, asoc->adv_peer_ack_point,
1883 nskips, &ftsn_skip_arr[0]);
1884
1885 if (ftsn_chunk) {
1886 list_add_tail(&ftsn_chunk->list, &q->control_chunk_list);
1887 SCTP_INC_STATS(sock_net(asoc->base.sk), SCTP_MIB_OUTCTRLCHUNKS);
1888 }
1889}