]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - net/sctp/transport.c
UBUNTU: Ubuntu-4.15.0-96.97
[mirror_ubuntu-bionic-kernel.git] / net / sctp / transport.c
1 /* SCTP kernel implementation
2 * Copyright (c) 1999-2000 Cisco, Inc.
3 * Copyright (c) 1999-2001 Motorola, Inc.
4 * Copyright (c) 2001-2003 International Business Machines Corp.
5 * Copyright (c) 2001 Intel Corp.
6 * Copyright (c) 2001 La Monte H.P. Yarroll
7 *
8 * This file is part of the SCTP kernel implementation
9 *
10 * This module provides the abstraction for an SCTP tranport representing
11 * a remote transport address. For local transport addresses, we just use
12 * union sctp_addr.
13 *
14 * This SCTP implementation is free software;
15 * you can redistribute it and/or modify it under the terms of
16 * the GNU General Public License as published by
17 * the Free Software Foundation; either version 2, or (at your option)
18 * any later version.
19 *
20 * This SCTP implementation is distributed in the hope that it
21 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
22 * ************************
23 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
24 * See the GNU General Public License for more details.
25 *
26 * You should have received a copy of the GNU General Public License
27 * along with GNU CC; see the file COPYING. If not, see
28 * <http://www.gnu.org/licenses/>.
29 *
30 * Please send any bug reports or fixes you make to the
31 * email address(es):
32 * lksctp developers <linux-sctp@vger.kernel.org>
33 *
34 * Written or modified by:
35 * La Monte H.P. Yarroll <piggy@acm.org>
36 * Karl Knutson <karl@athena.chicago.il.us>
37 * Jon Grimm <jgrimm@us.ibm.com>
38 * Xingang Guo <xingang.guo@intel.com>
39 * Hui Huang <hui.huang@nokia.com>
40 * Sridhar Samudrala <sri@us.ibm.com>
41 * Ardelle Fan <ardelle.fan@intel.com>
42 */
43
44 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
45
46 #include <linux/slab.h>
47 #include <linux/types.h>
48 #include <linux/random.h>
49 #include <net/sctp/sctp.h>
50 #include <net/sctp/sm.h>
51
52 /* 1st Level Abstractions. */
53
54 /* Initialize a new transport from provided memory. */
55 static struct sctp_transport *sctp_transport_init(struct net *net,
56 struct sctp_transport *peer,
57 const union sctp_addr *addr,
58 gfp_t gfp)
59 {
60 /* Copy in the address. */
61 peer->ipaddr = *addr;
62 peer->af_specific = sctp_get_af_specific(addr->sa.sa_family);
63 memset(&peer->saddr, 0, sizeof(union sctp_addr));
64
65 peer->sack_generation = 0;
66
67 /* From 6.3.1 RTO Calculation:
68 *
69 * C1) Until an RTT measurement has been made for a packet sent to the
70 * given destination transport address, set RTO to the protocol
71 * parameter 'RTO.Initial'.
72 */
73 peer->rto = msecs_to_jiffies(net->sctp.rto_initial);
74
75 peer->last_time_heard = 0;
76 peer->last_time_ecne_reduced = jiffies;
77
78 peer->param_flags = SPP_HB_DISABLE |
79 SPP_PMTUD_ENABLE |
80 SPP_SACKDELAY_ENABLE;
81
82 /* Initialize the default path max_retrans. */
83 peer->pathmaxrxt = net->sctp.max_retrans_path;
84 peer->pf_retrans = net->sctp.pf_retrans;
85
86 INIT_LIST_HEAD(&peer->transmitted);
87 INIT_LIST_HEAD(&peer->send_ready);
88 INIT_LIST_HEAD(&peer->transports);
89
90 timer_setup(&peer->T3_rtx_timer, sctp_generate_t3_rtx_event, 0);
91 timer_setup(&peer->hb_timer, sctp_generate_heartbeat_event, 0);
92 timer_setup(&peer->reconf_timer, sctp_generate_reconf_event, 0);
93 timer_setup(&peer->proto_unreach_timer,
94 sctp_generate_proto_unreach_event, 0);
95
96 /* Initialize the 64-bit random nonce sent with heartbeat. */
97 get_random_bytes(&peer->hb_nonce, sizeof(peer->hb_nonce));
98
99 refcount_set(&peer->refcnt, 1);
100
101 return peer;
102 }
103
104 /* Allocate and initialize a new transport. */
105 struct sctp_transport *sctp_transport_new(struct net *net,
106 const union sctp_addr *addr,
107 gfp_t gfp)
108 {
109 struct sctp_transport *transport;
110
111 transport = kzalloc(sizeof(*transport), gfp);
112 if (!transport)
113 goto fail;
114
115 if (!sctp_transport_init(net, transport, addr, gfp))
116 goto fail_init;
117
118 SCTP_DBG_OBJCNT_INC(transport);
119
120 return transport;
121
122 fail_init:
123 kfree(transport);
124
125 fail:
126 return NULL;
127 }
128
129 /* This transport is no longer needed. Free up if possible, or
130 * delay until it last reference count.
131 */
132 void sctp_transport_free(struct sctp_transport *transport)
133 {
134 /* Try to delete the heartbeat timer. */
135 if (del_timer(&transport->hb_timer))
136 sctp_transport_put(transport);
137
138 /* Delete the T3_rtx timer if it's active.
139 * There is no point in not doing this now and letting
140 * structure hang around in memory since we know
141 * the tranport is going away.
142 */
143 if (del_timer(&transport->T3_rtx_timer))
144 sctp_transport_put(transport);
145
146 if (del_timer(&transport->reconf_timer))
147 sctp_transport_put(transport);
148
149 /* Delete the ICMP proto unreachable timer if it's active. */
150 if (del_timer(&transport->proto_unreach_timer))
151 sctp_association_put(transport->asoc);
152
153 sctp_transport_put(transport);
154 }
155
156 static void sctp_transport_destroy_rcu(struct rcu_head *head)
157 {
158 struct sctp_transport *transport;
159
160 transport = container_of(head, struct sctp_transport, rcu);
161
162 dst_release(transport->dst);
163 kfree(transport);
164 SCTP_DBG_OBJCNT_DEC(transport);
165 }
166
167 /* Destroy the transport data structure.
168 * Assumes there are no more users of this structure.
169 */
170 static void sctp_transport_destroy(struct sctp_transport *transport)
171 {
172 if (unlikely(refcount_read(&transport->refcnt))) {
173 WARN(1, "Attempt to destroy undead transport %p!\n", transport);
174 return;
175 }
176
177 sctp_packet_free(&transport->packet);
178
179 if (transport->asoc)
180 sctp_association_put(transport->asoc);
181
182 call_rcu(&transport->rcu, sctp_transport_destroy_rcu);
183 }
184
185 /* Start T3_rtx timer if it is not already running and update the heartbeat
186 * timer. This routine is called every time a DATA chunk is sent.
187 */
188 void sctp_transport_reset_t3_rtx(struct sctp_transport *transport)
189 {
190 /* RFC 2960 6.3.2 Retransmission Timer Rules
191 *
192 * R1) Every time a DATA chunk is sent to any address(including a
193 * retransmission), if the T3-rtx timer of that address is not running
194 * start it running so that it will expire after the RTO of that
195 * address.
196 */
197
198 if (!timer_pending(&transport->T3_rtx_timer))
199 if (!mod_timer(&transport->T3_rtx_timer,
200 jiffies + transport->rto))
201 sctp_transport_hold(transport);
202 }
203
204 void sctp_transport_reset_hb_timer(struct sctp_transport *transport)
205 {
206 unsigned long expires;
207
208 /* When a data chunk is sent, reset the heartbeat interval. */
209 expires = jiffies + sctp_transport_timeout(transport);
210 if ((time_before(transport->hb_timer.expires, expires) ||
211 !timer_pending(&transport->hb_timer)) &&
212 !mod_timer(&transport->hb_timer,
213 expires + prandom_u32_max(transport->rto)))
214 sctp_transport_hold(transport);
215 }
216
217 void sctp_transport_reset_reconf_timer(struct sctp_transport *transport)
218 {
219 if (!timer_pending(&transport->reconf_timer))
220 if (!mod_timer(&transport->reconf_timer,
221 jiffies + transport->rto))
222 sctp_transport_hold(transport);
223 }
224
225 /* This transport has been assigned to an association.
226 * Initialize fields from the association or from the sock itself.
227 * Register the reference count in the association.
228 */
229 void sctp_transport_set_owner(struct sctp_transport *transport,
230 struct sctp_association *asoc)
231 {
232 transport->asoc = asoc;
233 sctp_association_hold(asoc);
234 }
235
236 /* Initialize the pmtu of a transport. */
237 void sctp_transport_pmtu(struct sctp_transport *transport, struct sock *sk)
238 {
239 /* If we don't have a fresh route, look one up */
240 if (!transport->dst || transport->dst->obsolete) {
241 sctp_transport_dst_release(transport);
242 transport->af_specific->get_dst(transport, &transport->saddr,
243 &transport->fl, sk);
244 }
245
246 if (transport->dst)
247 transport->pathmtu = sctp_dst_mtu(transport->dst);
248 else
249 transport->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
250 }
251
252 bool sctp_transport_update_pmtu(struct sctp_transport *t, u32 pmtu)
253 {
254 struct dst_entry *dst = sctp_transport_dst_check(t);
255 struct sock *sk = t->asoc->base.sk;
256 bool change = true;
257
258 if (unlikely(pmtu < SCTP_DEFAULT_MINSEGMENT)) {
259 pr_warn_ratelimited("%s: Reported pmtu %d too low, using default minimum of %d\n",
260 __func__, pmtu, SCTP_DEFAULT_MINSEGMENT);
261 /* Use default minimum segment instead */
262 pmtu = SCTP_DEFAULT_MINSEGMENT;
263 }
264 pmtu = SCTP_TRUNC4(pmtu);
265
266 if (dst) {
267 struct sctp_pf *pf = sctp_get_pf_specific(dst->ops->family);
268 union sctp_addr addr;
269
270 pf->af->from_sk(&addr, sk);
271 pf->to_sk_daddr(&t->ipaddr, sk);
272 dst->ops->update_pmtu(dst, sk, NULL, pmtu, true);
273 pf->to_sk_daddr(&addr, sk);
274
275 dst = sctp_transport_dst_check(t);
276 }
277
278 if (!dst) {
279 t->af_specific->get_dst(t, &t->saddr, &t->fl, sk);
280 dst = t->dst;
281 }
282
283 if (dst) {
284 /* Re-fetch, as under layers may have a higher minimum size */
285 pmtu = sctp_dst_mtu(dst);
286 change = t->pathmtu != pmtu;
287 }
288 t->pathmtu = pmtu;
289
290 return change;
291 }
292
293 /* Caches the dst entry and source address for a transport's destination
294 * address.
295 */
296 void sctp_transport_route(struct sctp_transport *transport,
297 union sctp_addr *saddr, struct sctp_sock *opt)
298 {
299 struct sctp_association *asoc = transport->asoc;
300 struct sctp_af *af = transport->af_specific;
301
302 af->get_dst(transport, saddr, &transport->fl, sctp_opt2sk(opt));
303
304 if (saddr)
305 memcpy(&transport->saddr, saddr, sizeof(union sctp_addr));
306 else
307 af->get_saddr(opt, transport, &transport->fl);
308
309 if ((transport->param_flags & SPP_PMTUD_DISABLE) && transport->pathmtu) {
310 return;
311 }
312 if (transport->dst) {
313 transport->pathmtu = SCTP_TRUNC4(dst_mtu(transport->dst));
314
315 /* Initialize sk->sk_rcv_saddr, if the transport is the
316 * association's active path for getsockname().
317 */
318 if (asoc && (!asoc->peer.primary_path ||
319 (transport == asoc->peer.active_path)))
320 opt->pf->to_sk_saddr(&transport->saddr,
321 asoc->base.sk);
322 } else
323 transport->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
324 }
325
326 /* Hold a reference to a transport. */
327 int sctp_transport_hold(struct sctp_transport *transport)
328 {
329 return refcount_inc_not_zero(&transport->refcnt);
330 }
331
332 /* Release a reference to a transport and clean up
333 * if there are no more references.
334 */
335 void sctp_transport_put(struct sctp_transport *transport)
336 {
337 if (refcount_dec_and_test(&transport->refcnt))
338 sctp_transport_destroy(transport);
339 }
340
341 /* Update transport's RTO based on the newly calculated RTT. */
342 void sctp_transport_update_rto(struct sctp_transport *tp, __u32 rtt)
343 {
344 if (unlikely(!tp->rto_pending))
345 /* We should not be doing any RTO updates unless rto_pending is set. */
346 pr_debug("%s: rto_pending not set on transport %p!\n", __func__, tp);
347
348 if (tp->rttvar || tp->srtt) {
349 struct net *net = sock_net(tp->asoc->base.sk);
350 /* 6.3.1 C3) When a new RTT measurement R' is made, set
351 * RTTVAR <- (1 - RTO.Beta) * RTTVAR + RTO.Beta * |SRTT - R'|
352 * SRTT <- (1 - RTO.Alpha) * SRTT + RTO.Alpha * R'
353 */
354
355 /* Note: The above algorithm has been rewritten to
356 * express rto_beta and rto_alpha as inverse powers
357 * of two.
358 * For example, assuming the default value of RTO.Alpha of
359 * 1/8, rto_alpha would be expressed as 3.
360 */
361 tp->rttvar = tp->rttvar - (tp->rttvar >> net->sctp.rto_beta)
362 + (((__u32)abs((__s64)tp->srtt - (__s64)rtt)) >> net->sctp.rto_beta);
363 tp->srtt = tp->srtt - (tp->srtt >> net->sctp.rto_alpha)
364 + (rtt >> net->sctp.rto_alpha);
365 } else {
366 /* 6.3.1 C2) When the first RTT measurement R is made, set
367 * SRTT <- R, RTTVAR <- R/2.
368 */
369 tp->srtt = rtt;
370 tp->rttvar = rtt >> 1;
371 }
372
373 /* 6.3.1 G1) Whenever RTTVAR is computed, if RTTVAR = 0, then
374 * adjust RTTVAR <- G, where G is the CLOCK GRANULARITY.
375 */
376 if (tp->rttvar == 0)
377 tp->rttvar = SCTP_CLOCK_GRANULARITY;
378
379 /* 6.3.1 C3) After the computation, update RTO <- SRTT + 4 * RTTVAR. */
380 tp->rto = tp->srtt + (tp->rttvar << 2);
381
382 /* 6.3.1 C6) Whenever RTO is computed, if it is less than RTO.Min
383 * seconds then it is rounded up to RTO.Min seconds.
384 */
385 if (tp->rto < tp->asoc->rto_min)
386 tp->rto = tp->asoc->rto_min;
387
388 /* 6.3.1 C7) A maximum value may be placed on RTO provided it is
389 * at least RTO.max seconds.
390 */
391 if (tp->rto > tp->asoc->rto_max)
392 tp->rto = tp->asoc->rto_max;
393
394 sctp_max_rto(tp->asoc, tp);
395 tp->rtt = rtt;
396
397 /* Reset rto_pending so that a new RTT measurement is started when a
398 * new data chunk is sent.
399 */
400 tp->rto_pending = 0;
401
402 pr_debug("%s: transport:%p, rtt:%d, srtt:%d rttvar:%d, rto:%ld\n",
403 __func__, tp, rtt, tp->srtt, tp->rttvar, tp->rto);
404 }
405
406 /* This routine updates the transport's cwnd and partial_bytes_acked
407 * parameters based on the bytes acked in the received SACK.
408 */
409 void sctp_transport_raise_cwnd(struct sctp_transport *transport,
410 __u32 sack_ctsn, __u32 bytes_acked)
411 {
412 struct sctp_association *asoc = transport->asoc;
413 __u32 cwnd, ssthresh, flight_size, pba, pmtu;
414
415 cwnd = transport->cwnd;
416 flight_size = transport->flight_size;
417
418 /* See if we need to exit Fast Recovery first */
419 if (asoc->fast_recovery &&
420 TSN_lte(asoc->fast_recovery_exit, sack_ctsn))
421 asoc->fast_recovery = 0;
422
423 ssthresh = transport->ssthresh;
424 pba = transport->partial_bytes_acked;
425 pmtu = transport->asoc->pathmtu;
426
427 if (cwnd <= ssthresh) {
428 /* RFC 4960 7.2.1
429 * o When cwnd is less than or equal to ssthresh, an SCTP
430 * endpoint MUST use the slow-start algorithm to increase
431 * cwnd only if the current congestion window is being fully
432 * utilized, an incoming SACK advances the Cumulative TSN
433 * Ack Point, and the data sender is not in Fast Recovery.
434 * Only when these three conditions are met can the cwnd be
435 * increased; otherwise, the cwnd MUST not be increased.
436 * If these conditions are met, then cwnd MUST be increased
437 * by, at most, the lesser of 1) the total size of the
438 * previously outstanding DATA chunk(s) acknowledged, and
439 * 2) the destination's path MTU. This upper bound protects
440 * against the ACK-Splitting attack outlined in [SAVAGE99].
441 */
442 if (asoc->fast_recovery)
443 return;
444
445 /* The appropriate cwnd increase algorithm is performed
446 * if, and only if the congestion window is being fully
447 * utilized. Note that RFC4960 Errata 3.22 removed the
448 * other condition on ctsn moving.
449 */
450 if (flight_size < cwnd)
451 return;
452
453 if (bytes_acked > pmtu)
454 cwnd += pmtu;
455 else
456 cwnd += bytes_acked;
457
458 pr_debug("%s: slow start: transport:%p, bytes_acked:%d, "
459 "cwnd:%d, ssthresh:%d, flight_size:%d, pba:%d\n",
460 __func__, transport, bytes_acked, cwnd, ssthresh,
461 flight_size, pba);
462 } else {
463 /* RFC 2960 7.2.2 Whenever cwnd is greater than ssthresh,
464 * upon each SACK arrival, increase partial_bytes_acked
465 * by the total number of bytes of all new chunks
466 * acknowledged in that SACK including chunks
467 * acknowledged by the new Cumulative TSN Ack and by Gap
468 * Ack Blocks. (updated by RFC4960 Errata 3.22)
469 *
470 * When partial_bytes_acked is greater than cwnd and
471 * before the arrival of the SACK the sender had less
472 * bytes of data outstanding than cwnd (i.e., before
473 * arrival of the SACK, flightsize was less than cwnd),
474 * reset partial_bytes_acked to cwnd. (RFC 4960 Errata
475 * 3.26)
476 *
477 * When partial_bytes_acked is equal to or greater than
478 * cwnd and before the arrival of the SACK the sender
479 * had cwnd or more bytes of data outstanding (i.e.,
480 * before arrival of the SACK, flightsize was greater
481 * than or equal to cwnd), partial_bytes_acked is reset
482 * to (partial_bytes_acked - cwnd). Next, cwnd is
483 * increased by MTU. (RFC 4960 Errata 3.12)
484 */
485 pba += bytes_acked;
486 if (pba > cwnd && flight_size < cwnd)
487 pba = cwnd;
488 if (pba >= cwnd && flight_size >= cwnd) {
489 pba = pba - cwnd;
490 cwnd += pmtu;
491 }
492
493 pr_debug("%s: congestion avoidance: transport:%p, "
494 "bytes_acked:%d, cwnd:%d, ssthresh:%d, "
495 "flight_size:%d, pba:%d\n", __func__,
496 transport, bytes_acked, cwnd, ssthresh,
497 flight_size, pba);
498 }
499
500 transport->cwnd = cwnd;
501 transport->partial_bytes_acked = pba;
502 }
503
504 /* This routine is used to lower the transport's cwnd when congestion is
505 * detected.
506 */
507 void sctp_transport_lower_cwnd(struct sctp_transport *transport,
508 enum sctp_lower_cwnd reason)
509 {
510 struct sctp_association *asoc = transport->asoc;
511
512 switch (reason) {
513 case SCTP_LOWER_CWND_T3_RTX:
514 /* RFC 2960 Section 7.2.3, sctpimpguide
515 * When the T3-rtx timer expires on an address, SCTP should
516 * perform slow start by:
517 * ssthresh = max(cwnd/2, 4*MTU)
518 * cwnd = 1*MTU
519 * partial_bytes_acked = 0
520 */
521 transport->ssthresh = max(transport->cwnd/2,
522 4*asoc->pathmtu);
523 transport->cwnd = asoc->pathmtu;
524
525 /* T3-rtx also clears fast recovery */
526 asoc->fast_recovery = 0;
527 break;
528
529 case SCTP_LOWER_CWND_FAST_RTX:
530 /* RFC 2960 7.2.4 Adjust the ssthresh and cwnd of the
531 * destination address(es) to which the missing DATA chunks
532 * were last sent, according to the formula described in
533 * Section 7.2.3.
534 *
535 * RFC 2960 7.2.3, sctpimpguide Upon detection of packet
536 * losses from SACK (see Section 7.2.4), An endpoint
537 * should do the following:
538 * ssthresh = max(cwnd/2, 4*MTU)
539 * cwnd = ssthresh
540 * partial_bytes_acked = 0
541 */
542 if (asoc->fast_recovery)
543 return;
544
545 /* Mark Fast recovery */
546 asoc->fast_recovery = 1;
547 asoc->fast_recovery_exit = asoc->next_tsn - 1;
548
549 transport->ssthresh = max(transport->cwnd/2,
550 4*asoc->pathmtu);
551 transport->cwnd = transport->ssthresh;
552 break;
553
554 case SCTP_LOWER_CWND_ECNE:
555 /* RFC 2481 Section 6.1.2.
556 * If the sender receives an ECN-Echo ACK packet
557 * then the sender knows that congestion was encountered in the
558 * network on the path from the sender to the receiver. The
559 * indication of congestion should be treated just as a
560 * congestion loss in non-ECN Capable TCP. That is, the TCP
561 * source halves the congestion window "cwnd" and reduces the
562 * slow start threshold "ssthresh".
563 * A critical condition is that TCP does not react to
564 * congestion indications more than once every window of
565 * data (or more loosely more than once every round-trip time).
566 */
567 if (time_after(jiffies, transport->last_time_ecne_reduced +
568 transport->rtt)) {
569 transport->ssthresh = max(transport->cwnd/2,
570 4*asoc->pathmtu);
571 transport->cwnd = transport->ssthresh;
572 transport->last_time_ecne_reduced = jiffies;
573 }
574 break;
575
576 case SCTP_LOWER_CWND_INACTIVE:
577 /* RFC 2960 Section 7.2.1, sctpimpguide
578 * When the endpoint does not transmit data on a given
579 * transport address, the cwnd of the transport address
580 * should be adjusted to max(cwnd/2, 4*MTU) per RTO.
581 * NOTE: Although the draft recommends that this check needs
582 * to be done every RTO interval, we do it every hearbeat
583 * interval.
584 */
585 transport->cwnd = max(transport->cwnd/2,
586 4*asoc->pathmtu);
587 /* RFC 4960 Errata 3.27.2: also adjust sshthresh */
588 transport->ssthresh = transport->cwnd;
589 break;
590 }
591
592 transport->partial_bytes_acked = 0;
593
594 pr_debug("%s: transport:%p, reason:%d, cwnd:%d, ssthresh:%d\n",
595 __func__, transport, reason, transport->cwnd,
596 transport->ssthresh);
597 }
598
599 /* Apply Max.Burst limit to the congestion window:
600 * sctpimpguide-05 2.14.2
601 * D) When the time comes for the sender to
602 * transmit new DATA chunks, the protocol parameter Max.Burst MUST
603 * first be applied to limit how many new DATA chunks may be sent.
604 * The limit is applied by adjusting cwnd as follows:
605 * if ((flightsize+ Max.Burst * MTU) < cwnd)
606 * cwnd = flightsize + Max.Burst * MTU
607 */
608
609 void sctp_transport_burst_limited(struct sctp_transport *t)
610 {
611 struct sctp_association *asoc = t->asoc;
612 u32 old_cwnd = t->cwnd;
613 u32 max_burst_bytes;
614
615 if (t->burst_limited || asoc->max_burst == 0)
616 return;
617
618 max_burst_bytes = t->flight_size + (asoc->max_burst * asoc->pathmtu);
619 if (max_burst_bytes < old_cwnd) {
620 t->cwnd = max_burst_bytes;
621 t->burst_limited = old_cwnd;
622 }
623 }
624
625 /* Restore the old cwnd congestion window, after the burst had it's
626 * desired effect.
627 */
628 void sctp_transport_burst_reset(struct sctp_transport *t)
629 {
630 if (t->burst_limited) {
631 t->cwnd = t->burst_limited;
632 t->burst_limited = 0;
633 }
634 }
635
636 /* What is the next timeout value for this transport? */
637 unsigned long sctp_transport_timeout(struct sctp_transport *trans)
638 {
639 /* RTO + timer slack +/- 50% of RTO */
640 unsigned long timeout = trans->rto >> 1;
641
642 if (trans->state != SCTP_UNCONFIRMED &&
643 trans->state != SCTP_PF)
644 timeout += trans->hbinterval;
645
646 return max_t(unsigned long, timeout, HZ / 5);
647 }
648
649 /* Reset transport variables to their initial values */
650 void sctp_transport_reset(struct sctp_transport *t)
651 {
652 struct sctp_association *asoc = t->asoc;
653
654 /* RFC 2960 (bis), Section 5.2.4
655 * All the congestion control parameters (e.g., cwnd, ssthresh)
656 * related to this peer MUST be reset to their initial values
657 * (see Section 6.2.1)
658 */
659 t->cwnd = min(4*asoc->pathmtu, max_t(__u32, 2*asoc->pathmtu, 4380));
660 t->burst_limited = 0;
661 t->ssthresh = asoc->peer.i.a_rwnd;
662 t->rto = asoc->rto_initial;
663 sctp_max_rto(asoc, t);
664 t->rtt = 0;
665 t->srtt = 0;
666 t->rttvar = 0;
667
668 /* Reset these additional variables so that we have a clean slate. */
669 t->partial_bytes_acked = 0;
670 t->flight_size = 0;
671 t->error_count = 0;
672 t->rto_pending = 0;
673 t->hb_sent = 0;
674
675 /* Initialize the state information for SFR-CACC */
676 t->cacc.changeover_active = 0;
677 t->cacc.cycling_changeover = 0;
678 t->cacc.next_tsn_at_change = 0;
679 t->cacc.cacc_saw_newack = 0;
680 }
681
682 /* Schedule retransmission on the given transport */
683 void sctp_transport_immediate_rtx(struct sctp_transport *t)
684 {
685 /* Stop pending T3_rtx_timer */
686 if (del_timer(&t->T3_rtx_timer))
687 sctp_transport_put(t);
688
689 sctp_retransmit(&t->asoc->outqueue, t, SCTP_RTXR_T3_RTX);
690 if (!timer_pending(&t->T3_rtx_timer)) {
691 if (!mod_timer(&t->T3_rtx_timer, jiffies + t->rto))
692 sctp_transport_hold(t);
693 }
694 }
695
696 /* Drop dst */
697 void sctp_transport_dst_release(struct sctp_transport *t)
698 {
699 dst_release(t->dst);
700 t->dst = NULL;
701 t->dst_pending_confirm = 0;
702 }
703
704 /* Schedule neighbour confirm */
705 void sctp_transport_dst_confirm(struct sctp_transport *t)
706 {
707 t->dst_pending_confirm = 1;
708 }