1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /* SCTP kernel implementation
3 * Copyright (c) 1999-2000 Cisco, Inc.
4 * Copyright (c) 1999-2001 Motorola, Inc.
5 * Copyright (c) 2001-2003 International Business Machines Corp.
6 * Copyright (c) 2001 Intel Corp.
7 * Copyright (c) 2001 La Monte H.P. Yarroll
9 * This file is part of the SCTP kernel implementation
11 * This module provides the abstraction for an SCTP transport representing
12 * a remote transport address. For local transport addresses, we just use
15 * Please send any bug reports or fixes you make to the
17 * lksctp developers <linux-sctp@vger.kernel.org>
19 * Written or modified by:
20 * La Monte H.P. Yarroll <piggy@acm.org>
21 * Karl Knutson <karl@athena.chicago.il.us>
22 * Jon Grimm <jgrimm@us.ibm.com>
23 * Xingang Guo <xingang.guo@intel.com>
24 * Hui Huang <hui.huang@nokia.com>
25 * Sridhar Samudrala <sri@us.ibm.com>
26 * Ardelle Fan <ardelle.fan@intel.com>
29 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
31 #include <linux/slab.h>
32 #include <linux/types.h>
33 #include <linux/random.h>
34 #include <net/sctp/sctp.h>
35 #include <net/sctp/sm.h>
37 /* 1st Level Abstractions. */
39 /* Initialize a new transport from provided memory. */
40 static struct sctp_transport *sctp_transport_init(struct net *net,
41 struct sctp_transport *peer,
42 const union sctp_addr *addr,
45 /* Copy in the address. */
46 peer->af_specific = sctp_get_af_specific(addr->sa.sa_family);
47 memcpy(&peer->ipaddr, addr, peer->af_specific->sockaddr_len);
48 memset(&peer->saddr, 0, sizeof(union sctp_addr));
50 peer->sack_generation = 0;
52 /* From 6.3.1 RTO Calculation:
54 * C1) Until an RTT measurement has been made for a packet sent to the
55 * given destination transport address, set RTO to the protocol
56 * parameter 'RTO.Initial'.
58 peer->rto = msecs_to_jiffies(net->sctp.rto_initial);
60 peer->last_time_heard = 0;
61 peer->last_time_ecne_reduced = jiffies;
63 peer->param_flags = SPP_HB_DISABLE |
67 /* Initialize the default path max_retrans. */
68 peer->pathmaxrxt = net->sctp.max_retrans_path;
69 peer->pf_retrans = net->sctp.pf_retrans;
71 INIT_LIST_HEAD(&peer->transmitted);
72 INIT_LIST_HEAD(&peer->send_ready);
73 INIT_LIST_HEAD(&peer->transports);
75 timer_setup(&peer->T3_rtx_timer, sctp_generate_t3_rtx_event, 0);
76 timer_setup(&peer->hb_timer, sctp_generate_heartbeat_event, 0);
77 timer_setup(&peer->reconf_timer, sctp_generate_reconf_event, 0);
78 timer_setup(&peer->probe_timer, sctp_generate_probe_event, 0);
79 timer_setup(&peer->proto_unreach_timer,
80 sctp_generate_proto_unreach_event, 0);
82 /* Initialize the 64-bit random nonce sent with heartbeat. */
83 get_random_bytes(&peer->hb_nonce, sizeof(peer->hb_nonce));
85 refcount_set(&peer->refcnt, 1);
90 /* Allocate and initialize a new transport. */
91 struct sctp_transport *sctp_transport_new(struct net *net,
92 const union sctp_addr *addr,
95 struct sctp_transport *transport;
97 transport = kzalloc(sizeof(*transport), gfp);
101 if (!sctp_transport_init(net, transport, addr, gfp))
104 SCTP_DBG_OBJCNT_INC(transport);
115 /* This transport is no longer needed. Free up if possible, or
116 * delay until it last reference count.
118 void sctp_transport_free(struct sctp_transport *transport)
120 /* Try to delete the heartbeat timer. */
121 if (del_timer(&transport->hb_timer))
122 sctp_transport_put(transport);
124 /* Delete the T3_rtx timer if it's active.
125 * There is no point in not doing this now and letting
126 * structure hang around in memory since we know
127 * the transport is going away.
129 if (del_timer(&transport->T3_rtx_timer))
130 sctp_transport_put(transport);
132 if (del_timer(&transport->reconf_timer))
133 sctp_transport_put(transport);
135 if (del_timer(&transport->probe_timer))
136 sctp_transport_put(transport);
138 /* Delete the ICMP proto unreachable timer if it's active. */
139 if (del_timer(&transport->proto_unreach_timer))
140 sctp_transport_put(transport);
142 sctp_transport_put(transport);
145 static void sctp_transport_destroy_rcu(struct rcu_head *head)
147 struct sctp_transport *transport;
149 transport = container_of(head, struct sctp_transport, rcu);
151 dst_release(transport->dst);
153 SCTP_DBG_OBJCNT_DEC(transport);
156 /* Destroy the transport data structure.
157 * Assumes there are no more users of this structure.
159 static void sctp_transport_destroy(struct sctp_transport *transport)
161 if (unlikely(refcount_read(&transport->refcnt))) {
162 WARN(1, "Attempt to destroy undead transport %p!\n", transport);
166 sctp_packet_free(&transport->packet);
169 sctp_association_put(transport->asoc);
171 call_rcu(&transport->rcu, sctp_transport_destroy_rcu);
174 /* Start T3_rtx timer if it is not already running and update the heartbeat
175 * timer. This routine is called every time a DATA chunk is sent.
177 void sctp_transport_reset_t3_rtx(struct sctp_transport *transport)
179 /* RFC 2960 6.3.2 Retransmission Timer Rules
181 * R1) Every time a DATA chunk is sent to any address(including a
182 * retransmission), if the T3-rtx timer of that address is not running
183 * start it running so that it will expire after the RTO of that
187 if (!timer_pending(&transport->T3_rtx_timer))
188 if (!mod_timer(&transport->T3_rtx_timer,
189 jiffies + transport->rto))
190 sctp_transport_hold(transport);
193 void sctp_transport_reset_hb_timer(struct sctp_transport *transport)
195 unsigned long expires;
197 /* When a data chunk is sent, reset the heartbeat interval. */
198 expires = jiffies + sctp_transport_timeout(transport);
199 if (!mod_timer(&transport->hb_timer,
200 expires + prandom_u32_max(transport->rto)))
201 sctp_transport_hold(transport);
204 void sctp_transport_reset_reconf_timer(struct sctp_transport *transport)
206 if (!timer_pending(&transport->reconf_timer))
207 if (!mod_timer(&transport->reconf_timer,
208 jiffies + transport->rto))
209 sctp_transport_hold(transport);
212 void sctp_transport_reset_probe_timer(struct sctp_transport *transport)
214 if (!mod_timer(&transport->probe_timer,
215 jiffies + transport->probe_interval))
216 sctp_transport_hold(transport);
219 void sctp_transport_reset_raise_timer(struct sctp_transport *transport)
221 if (!mod_timer(&transport->probe_timer,
222 jiffies + transport->probe_interval * 30))
223 sctp_transport_hold(transport);
226 /* This transport has been assigned to an association.
227 * Initialize fields from the association or from the sock itself.
228 * Register the reference count in the association.
230 void sctp_transport_set_owner(struct sctp_transport *transport,
231 struct sctp_association *asoc)
233 transport->asoc = asoc;
234 sctp_association_hold(asoc);
237 /* Initialize the pmtu of a transport. */
238 void sctp_transport_pmtu(struct sctp_transport *transport, struct sock *sk)
240 /* If we don't have a fresh route, look one up */
241 if (!transport->dst || transport->dst->obsolete) {
242 sctp_transport_dst_release(transport);
243 transport->af_specific->get_dst(transport, &transport->saddr,
247 if (transport->param_flags & SPP_PMTUD_DISABLE) {
248 struct sctp_association *asoc = transport->asoc;
250 if (!transport->pathmtu && asoc && asoc->pathmtu)
251 transport->pathmtu = asoc->pathmtu;
252 if (transport->pathmtu)
257 transport->pathmtu = sctp_dst_mtu(transport->dst);
259 transport->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
261 sctp_transport_pl_update(transport);
264 void sctp_transport_pl_send(struct sctp_transport *t)
266 if (t->pl.probe_count < SCTP_MAX_PROBES)
269 t->pl.probe_count = 0;
270 if (t->pl.state == SCTP_PL_BASE) {
271 if (t->pl.probe_size == SCTP_BASE_PLPMTU) { /* BASE_PLPMTU Confirmation Failed */
272 t->pl.state = SCTP_PL_ERROR; /* Base -> Error */
274 t->pl.pmtu = SCTP_BASE_PLPMTU;
275 t->pathmtu = t->pl.pmtu + sctp_transport_pl_hlen(t);
276 sctp_assoc_sync_pmtu(t->asoc);
278 } else if (t->pl.state == SCTP_PL_SEARCH) {
279 if (t->pl.pmtu == t->pl.probe_size) { /* Black Hole Detected */
280 t->pl.state = SCTP_PL_BASE; /* Search -> Base */
281 t->pl.probe_size = SCTP_BASE_PLPMTU;
282 t->pl.probe_high = 0;
284 t->pl.pmtu = SCTP_BASE_PLPMTU;
285 t->pathmtu = t->pl.pmtu + sctp_transport_pl_hlen(t);
286 sctp_assoc_sync_pmtu(t->asoc);
287 } else { /* Normal probe failure. */
288 t->pl.probe_high = t->pl.probe_size;
289 t->pl.probe_size = t->pl.pmtu;
291 } else if (t->pl.state == SCTP_PL_COMPLETE) {
292 if (t->pl.pmtu == t->pl.probe_size) { /* Black Hole Detected */
293 t->pl.state = SCTP_PL_BASE; /* Search Complete -> Base */
294 t->pl.probe_size = SCTP_BASE_PLPMTU;
296 t->pl.pmtu = SCTP_BASE_PLPMTU;
297 t->pathmtu = t->pl.pmtu + sctp_transport_pl_hlen(t);
298 sctp_assoc_sync_pmtu(t->asoc);
303 pr_debug("%s: PLPMTUD: transport: %p, state: %d, pmtu: %d, size: %d, high: %d\n",
304 __func__, t, t->pl.state, t->pl.pmtu, t->pl.probe_size, t->pl.probe_high);
308 bool sctp_transport_pl_recv(struct sctp_transport *t)
310 pr_debug("%s: PLPMTUD: transport: %p, state: %d, pmtu: %d, size: %d, high: %d\n",
311 __func__, t, t->pl.state, t->pl.pmtu, t->pl.probe_size, t->pl.probe_high);
313 t->pl.pmtu = t->pl.probe_size;
314 t->pl.probe_count = 0;
315 if (t->pl.state == SCTP_PL_BASE) {
316 t->pl.state = SCTP_PL_SEARCH; /* Base -> Search */
317 t->pl.probe_size += SCTP_PL_BIG_STEP;
318 } else if (t->pl.state == SCTP_PL_ERROR) {
319 t->pl.state = SCTP_PL_SEARCH; /* Error -> Search */
321 t->pl.pmtu = t->pl.probe_size;
322 t->pathmtu = t->pl.pmtu + sctp_transport_pl_hlen(t);
323 sctp_assoc_sync_pmtu(t->asoc);
324 t->pl.probe_size += SCTP_PL_BIG_STEP;
325 } else if (t->pl.state == SCTP_PL_SEARCH) {
326 if (!t->pl.probe_high) {
327 t->pl.probe_size = min(t->pl.probe_size + SCTP_PL_BIG_STEP,
331 t->pl.probe_size += SCTP_PL_MIN_STEP;
332 if (t->pl.probe_size >= t->pl.probe_high) {
333 t->pl.probe_high = 0;
334 t->pl.state = SCTP_PL_COMPLETE; /* Search -> Search Complete */
336 t->pl.probe_size = t->pl.pmtu;
337 t->pathmtu = t->pl.pmtu + sctp_transport_pl_hlen(t);
338 sctp_assoc_sync_pmtu(t->asoc);
339 sctp_transport_reset_raise_timer(t);
341 } else if (t->pl.state == SCTP_PL_COMPLETE) {
342 /* Raise probe_size again after 30 * interval in Search Complete */
343 t->pl.state = SCTP_PL_SEARCH; /* Search Complete -> Search */
344 t->pl.probe_size += SCTP_PL_MIN_STEP;
347 return t->pl.state == SCTP_PL_COMPLETE;
350 static bool sctp_transport_pl_toobig(struct sctp_transport *t, u32 pmtu)
352 pr_debug("%s: PLPMTUD: transport: %p, state: %d, pmtu: %d, size: %d, ptb: %d\n",
353 __func__, t, t->pl.state, t->pl.pmtu, t->pl.probe_size, pmtu);
355 if (pmtu < SCTP_MIN_PLPMTU || pmtu >= t->pl.probe_size)
358 if (t->pl.state == SCTP_PL_BASE) {
359 if (pmtu >= SCTP_MIN_PLPMTU && pmtu < SCTP_BASE_PLPMTU) {
360 t->pl.state = SCTP_PL_ERROR; /* Base -> Error */
362 t->pl.pmtu = SCTP_BASE_PLPMTU;
363 t->pathmtu = t->pl.pmtu + sctp_transport_pl_hlen(t);
366 } else if (t->pl.state == SCTP_PL_SEARCH) {
367 if (pmtu >= SCTP_BASE_PLPMTU && pmtu < t->pl.pmtu) {
368 t->pl.state = SCTP_PL_BASE; /* Search -> Base */
369 t->pl.probe_size = SCTP_BASE_PLPMTU;
370 t->pl.probe_count = 0;
372 t->pl.probe_high = 0;
373 t->pl.pmtu = SCTP_BASE_PLPMTU;
374 t->pathmtu = t->pl.pmtu + sctp_transport_pl_hlen(t);
376 } else if (pmtu > t->pl.pmtu && pmtu < t->pl.probe_size) {
377 t->pl.probe_size = pmtu;
378 t->pl.probe_count = 0;
380 } else if (t->pl.state == SCTP_PL_COMPLETE) {
381 if (pmtu >= SCTP_BASE_PLPMTU && pmtu < t->pl.pmtu) {
382 t->pl.state = SCTP_PL_BASE; /* Complete -> Base */
383 t->pl.probe_size = SCTP_BASE_PLPMTU;
384 t->pl.probe_count = 0;
386 t->pl.probe_high = 0;
387 t->pl.pmtu = SCTP_BASE_PLPMTU;
388 t->pathmtu = t->pl.pmtu + sctp_transport_pl_hlen(t);
389 sctp_transport_reset_probe_timer(t);
397 bool sctp_transport_update_pmtu(struct sctp_transport *t, u32 pmtu)
399 struct sock *sk = t->asoc->base.sk;
400 struct dst_entry *dst;
403 if (unlikely(pmtu < SCTP_DEFAULT_MINSEGMENT)) {
404 pr_warn_ratelimited("%s: Reported pmtu %d too low, using default minimum of %d\n",
405 __func__, pmtu, SCTP_DEFAULT_MINSEGMENT);
406 /* Use default minimum segment instead */
407 pmtu = SCTP_DEFAULT_MINSEGMENT;
409 pmtu = SCTP_TRUNC4(pmtu);
411 if (sctp_transport_pl_enabled(t))
412 return sctp_transport_pl_toobig(t, pmtu - sctp_transport_pl_hlen(t));
414 dst = sctp_transport_dst_check(t);
416 struct sctp_pf *pf = sctp_get_pf_specific(dst->ops->family);
417 union sctp_addr addr;
419 pf->af->from_sk(&addr, sk);
420 pf->to_sk_daddr(&t->ipaddr, sk);
421 dst->ops->update_pmtu(dst, sk, NULL, pmtu, true);
422 pf->to_sk_daddr(&addr, sk);
424 dst = sctp_transport_dst_check(t);
428 t->af_specific->get_dst(t, &t->saddr, &t->fl, sk);
433 /* Re-fetch, as under layers may have a higher minimum size */
434 pmtu = sctp_dst_mtu(dst);
435 change = t->pathmtu != pmtu;
442 /* Caches the dst entry and source address for a transport's destination
445 void sctp_transport_route(struct sctp_transport *transport,
446 union sctp_addr *saddr, struct sctp_sock *opt)
448 struct sctp_association *asoc = transport->asoc;
449 struct sctp_af *af = transport->af_specific;
451 sctp_transport_dst_release(transport);
452 af->get_dst(transport, saddr, &transport->fl, sctp_opt2sk(opt));
455 memcpy(&transport->saddr, saddr, sizeof(union sctp_addr));
457 af->get_saddr(opt, transport, &transport->fl);
459 sctp_transport_pmtu(transport, sctp_opt2sk(opt));
461 /* Initialize sk->sk_rcv_saddr, if the transport is the
462 * association's active path for getsockname().
464 if (transport->dst && asoc &&
465 (!asoc->peer.primary_path || transport == asoc->peer.active_path))
466 opt->pf->to_sk_saddr(&transport->saddr, asoc->base.sk);
469 /* Hold a reference to a transport. */
470 int sctp_transport_hold(struct sctp_transport *transport)
472 return refcount_inc_not_zero(&transport->refcnt);
475 /* Release a reference to a transport and clean up
476 * if there are no more references.
478 void sctp_transport_put(struct sctp_transport *transport)
480 if (refcount_dec_and_test(&transport->refcnt))
481 sctp_transport_destroy(transport);
484 /* Update transport's RTO based on the newly calculated RTT. */
485 void sctp_transport_update_rto(struct sctp_transport *tp, __u32 rtt)
487 if (unlikely(!tp->rto_pending))
488 /* We should not be doing any RTO updates unless rto_pending is set. */
489 pr_debug("%s: rto_pending not set on transport %p!\n", __func__, tp);
491 if (tp->rttvar || tp->srtt) {
492 struct net *net = tp->asoc->base.net;
493 /* 6.3.1 C3) When a new RTT measurement R' is made, set
494 * RTTVAR <- (1 - RTO.Beta) * RTTVAR + RTO.Beta * |SRTT - R'|
495 * SRTT <- (1 - RTO.Alpha) * SRTT + RTO.Alpha * R'
498 /* Note: The above algorithm has been rewritten to
499 * express rto_beta and rto_alpha as inverse powers
501 * For example, assuming the default value of RTO.Alpha of
502 * 1/8, rto_alpha would be expressed as 3.
504 tp->rttvar = tp->rttvar - (tp->rttvar >> net->sctp.rto_beta)
505 + (((__u32)abs((__s64)tp->srtt - (__s64)rtt)) >> net->sctp.rto_beta);
506 tp->srtt = tp->srtt - (tp->srtt >> net->sctp.rto_alpha)
507 + (rtt >> net->sctp.rto_alpha);
509 /* 6.3.1 C2) When the first RTT measurement R is made, set
510 * SRTT <- R, RTTVAR <- R/2.
513 tp->rttvar = rtt >> 1;
516 /* 6.3.1 G1) Whenever RTTVAR is computed, if RTTVAR = 0, then
517 * adjust RTTVAR <- G, where G is the CLOCK GRANULARITY.
520 tp->rttvar = SCTP_CLOCK_GRANULARITY;
522 /* 6.3.1 C3) After the computation, update RTO <- SRTT + 4 * RTTVAR. */
523 tp->rto = tp->srtt + (tp->rttvar << 2);
525 /* 6.3.1 C6) Whenever RTO is computed, if it is less than RTO.Min
526 * seconds then it is rounded up to RTO.Min seconds.
528 if (tp->rto < tp->asoc->rto_min)
529 tp->rto = tp->asoc->rto_min;
531 /* 6.3.1 C7) A maximum value may be placed on RTO provided it is
532 * at least RTO.max seconds.
534 if (tp->rto > tp->asoc->rto_max)
535 tp->rto = tp->asoc->rto_max;
537 sctp_max_rto(tp->asoc, tp);
540 /* Reset rto_pending so that a new RTT measurement is started when a
541 * new data chunk is sent.
545 pr_debug("%s: transport:%p, rtt:%d, srtt:%d rttvar:%d, rto:%ld\n",
546 __func__, tp, rtt, tp->srtt, tp->rttvar, tp->rto);
549 /* This routine updates the transport's cwnd and partial_bytes_acked
550 * parameters based on the bytes acked in the received SACK.
552 void sctp_transport_raise_cwnd(struct sctp_transport *transport,
553 __u32 sack_ctsn, __u32 bytes_acked)
555 struct sctp_association *asoc = transport->asoc;
556 __u32 cwnd, ssthresh, flight_size, pba, pmtu;
558 cwnd = transport->cwnd;
559 flight_size = transport->flight_size;
561 /* See if we need to exit Fast Recovery first */
562 if (asoc->fast_recovery &&
563 TSN_lte(asoc->fast_recovery_exit, sack_ctsn))
564 asoc->fast_recovery = 0;
566 ssthresh = transport->ssthresh;
567 pba = transport->partial_bytes_acked;
568 pmtu = transport->asoc->pathmtu;
570 if (cwnd <= ssthresh) {
572 * o When cwnd is less than or equal to ssthresh, an SCTP
573 * endpoint MUST use the slow-start algorithm to increase
574 * cwnd only if the current congestion window is being fully
575 * utilized, an incoming SACK advances the Cumulative TSN
576 * Ack Point, and the data sender is not in Fast Recovery.
577 * Only when these three conditions are met can the cwnd be
578 * increased; otherwise, the cwnd MUST not be increased.
579 * If these conditions are met, then cwnd MUST be increased
580 * by, at most, the lesser of 1) the total size of the
581 * previously outstanding DATA chunk(s) acknowledged, and
582 * 2) the destination's path MTU. This upper bound protects
583 * against the ACK-Splitting attack outlined in [SAVAGE99].
585 if (asoc->fast_recovery)
588 /* The appropriate cwnd increase algorithm is performed
589 * if, and only if the congestion window is being fully
590 * utilized. Note that RFC4960 Errata 3.22 removed the
591 * other condition on ctsn moving.
593 if (flight_size < cwnd)
596 if (bytes_acked > pmtu)
601 pr_debug("%s: slow start: transport:%p, bytes_acked:%d, "
602 "cwnd:%d, ssthresh:%d, flight_size:%d, pba:%d\n",
603 __func__, transport, bytes_acked, cwnd, ssthresh,
606 /* RFC 2960 7.2.2 Whenever cwnd is greater than ssthresh,
607 * upon each SACK arrival, increase partial_bytes_acked
608 * by the total number of bytes of all new chunks
609 * acknowledged in that SACK including chunks
610 * acknowledged by the new Cumulative TSN Ack and by Gap
611 * Ack Blocks. (updated by RFC4960 Errata 3.22)
613 * When partial_bytes_acked is greater than cwnd and
614 * before the arrival of the SACK the sender had less
615 * bytes of data outstanding than cwnd (i.e., before
616 * arrival of the SACK, flightsize was less than cwnd),
617 * reset partial_bytes_acked to cwnd. (RFC 4960 Errata
620 * When partial_bytes_acked is equal to or greater than
621 * cwnd and before the arrival of the SACK the sender
622 * had cwnd or more bytes of data outstanding (i.e.,
623 * before arrival of the SACK, flightsize was greater
624 * than or equal to cwnd), partial_bytes_acked is reset
625 * to (partial_bytes_acked - cwnd). Next, cwnd is
626 * increased by MTU. (RFC 4960 Errata 3.12)
629 if (pba > cwnd && flight_size < cwnd)
631 if (pba >= cwnd && flight_size >= cwnd) {
636 pr_debug("%s: congestion avoidance: transport:%p, "
637 "bytes_acked:%d, cwnd:%d, ssthresh:%d, "
638 "flight_size:%d, pba:%d\n", __func__,
639 transport, bytes_acked, cwnd, ssthresh,
643 transport->cwnd = cwnd;
644 transport->partial_bytes_acked = pba;
647 /* This routine is used to lower the transport's cwnd when congestion is
650 void sctp_transport_lower_cwnd(struct sctp_transport *transport,
651 enum sctp_lower_cwnd reason)
653 struct sctp_association *asoc = transport->asoc;
656 case SCTP_LOWER_CWND_T3_RTX:
657 /* RFC 2960 Section 7.2.3, sctpimpguide
658 * When the T3-rtx timer expires on an address, SCTP should
659 * perform slow start by:
660 * ssthresh = max(cwnd/2, 4*MTU)
662 * partial_bytes_acked = 0
664 transport->ssthresh = max(transport->cwnd/2,
666 transport->cwnd = asoc->pathmtu;
668 /* T3-rtx also clears fast recovery */
669 asoc->fast_recovery = 0;
672 case SCTP_LOWER_CWND_FAST_RTX:
673 /* RFC 2960 7.2.4 Adjust the ssthresh and cwnd of the
674 * destination address(es) to which the missing DATA chunks
675 * were last sent, according to the formula described in
678 * RFC 2960 7.2.3, sctpimpguide Upon detection of packet
679 * losses from SACK (see Section 7.2.4), An endpoint
680 * should do the following:
681 * ssthresh = max(cwnd/2, 4*MTU)
683 * partial_bytes_acked = 0
685 if (asoc->fast_recovery)
688 /* Mark Fast recovery */
689 asoc->fast_recovery = 1;
690 asoc->fast_recovery_exit = asoc->next_tsn - 1;
692 transport->ssthresh = max(transport->cwnd/2,
694 transport->cwnd = transport->ssthresh;
697 case SCTP_LOWER_CWND_ECNE:
698 /* RFC 2481 Section 6.1.2.
699 * If the sender receives an ECN-Echo ACK packet
700 * then the sender knows that congestion was encountered in the
701 * network on the path from the sender to the receiver. The
702 * indication of congestion should be treated just as a
703 * congestion loss in non-ECN Capable TCP. That is, the TCP
704 * source halves the congestion window "cwnd" and reduces the
705 * slow start threshold "ssthresh".
706 * A critical condition is that TCP does not react to
707 * congestion indications more than once every window of
708 * data (or more loosely more than once every round-trip time).
710 if (time_after(jiffies, transport->last_time_ecne_reduced +
712 transport->ssthresh = max(transport->cwnd/2,
714 transport->cwnd = transport->ssthresh;
715 transport->last_time_ecne_reduced = jiffies;
719 case SCTP_LOWER_CWND_INACTIVE:
720 /* RFC 2960 Section 7.2.1, sctpimpguide
721 * When the endpoint does not transmit data on a given
722 * transport address, the cwnd of the transport address
723 * should be adjusted to max(cwnd/2, 4*MTU) per RTO.
724 * NOTE: Although the draft recommends that this check needs
725 * to be done every RTO interval, we do it every hearbeat
728 transport->cwnd = max(transport->cwnd/2,
730 /* RFC 4960 Errata 3.27.2: also adjust sshthresh */
731 transport->ssthresh = transport->cwnd;
735 transport->partial_bytes_acked = 0;
737 pr_debug("%s: transport:%p, reason:%d, cwnd:%d, ssthresh:%d\n",
738 __func__, transport, reason, transport->cwnd,
739 transport->ssthresh);
742 /* Apply Max.Burst limit to the congestion window:
743 * sctpimpguide-05 2.14.2
744 * D) When the time comes for the sender to
745 * transmit new DATA chunks, the protocol parameter Max.Burst MUST
746 * first be applied to limit how many new DATA chunks may be sent.
747 * The limit is applied by adjusting cwnd as follows:
748 * if ((flightsize+ Max.Burst * MTU) < cwnd)
749 * cwnd = flightsize + Max.Burst * MTU
752 void sctp_transport_burst_limited(struct sctp_transport *t)
754 struct sctp_association *asoc = t->asoc;
755 u32 old_cwnd = t->cwnd;
758 if (t->burst_limited || asoc->max_burst == 0)
761 max_burst_bytes = t->flight_size + (asoc->max_burst * asoc->pathmtu);
762 if (max_burst_bytes < old_cwnd) {
763 t->cwnd = max_burst_bytes;
764 t->burst_limited = old_cwnd;
768 /* Restore the old cwnd congestion window, after the burst had it's
771 void sctp_transport_burst_reset(struct sctp_transport *t)
773 if (t->burst_limited) {
774 t->cwnd = t->burst_limited;
775 t->burst_limited = 0;
779 /* What is the next timeout value for this transport? */
780 unsigned long sctp_transport_timeout(struct sctp_transport *trans)
782 /* RTO + timer slack +/- 50% of RTO */
783 unsigned long timeout = trans->rto >> 1;
785 if (trans->state != SCTP_UNCONFIRMED &&
786 trans->state != SCTP_PF)
787 timeout += trans->hbinterval;
789 return max_t(unsigned long, timeout, HZ / 5);
792 /* Reset transport variables to their initial values */
793 void sctp_transport_reset(struct sctp_transport *t)
795 struct sctp_association *asoc = t->asoc;
797 /* RFC 2960 (bis), Section 5.2.4
798 * All the congestion control parameters (e.g., cwnd, ssthresh)
799 * related to this peer MUST be reset to their initial values
800 * (see Section 6.2.1)
802 t->cwnd = min(4*asoc->pathmtu, max_t(__u32, 2*asoc->pathmtu, 4380));
803 t->burst_limited = 0;
804 t->ssthresh = asoc->peer.i.a_rwnd;
805 t->rto = asoc->rto_initial;
806 sctp_max_rto(asoc, t);
811 /* Reset these additional variables so that we have a clean slate. */
812 t->partial_bytes_acked = 0;
818 /* Initialize the state information for SFR-CACC */
819 t->cacc.changeover_active = 0;
820 t->cacc.cycling_changeover = 0;
821 t->cacc.next_tsn_at_change = 0;
822 t->cacc.cacc_saw_newack = 0;
825 /* Schedule retransmission on the given transport */
826 void sctp_transport_immediate_rtx(struct sctp_transport *t)
828 /* Stop pending T3_rtx_timer */
829 if (del_timer(&t->T3_rtx_timer))
830 sctp_transport_put(t);
832 sctp_retransmit(&t->asoc->outqueue, t, SCTP_RTXR_T3_RTX);
833 if (!timer_pending(&t->T3_rtx_timer)) {
834 if (!mod_timer(&t->T3_rtx_timer, jiffies + t->rto))
835 sctp_transport_hold(t);
840 void sctp_transport_dst_release(struct sctp_transport *t)
844 t->dst_pending_confirm = 0;
847 /* Schedule neighbour confirm */
848 void sctp_transport_dst_confirm(struct sctp_transport *t)
850 t->dst_pending_confirm = 1;