]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - net/sctp/transport.c
spi: allow registering empty spi_board_info lists
[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 setup_timer(&peer->T3_rtx_timer, sctp_generate_t3_rtx_event,
91 (unsigned long)peer);
92 setup_timer(&peer->hb_timer, sctp_generate_heartbeat_event,
93 (unsigned long)peer);
94 setup_timer(&peer->reconf_timer, sctp_generate_reconf_event,
95 (unsigned long)peer);
96 setup_timer(&peer->proto_unreach_timer,
97 sctp_generate_proto_unreach_event, (unsigned long)peer);
98
99 /* Initialize the 64-bit random nonce sent with heartbeat. */
100 get_random_bytes(&peer->hb_nonce, sizeof(peer->hb_nonce));
101
102 atomic_set(&peer->refcnt, 1);
103
104 return peer;
105 }
106
107 /* Allocate and initialize a new transport. */
108 struct sctp_transport *sctp_transport_new(struct net *net,
109 const union sctp_addr *addr,
110 gfp_t gfp)
111 {
112 struct sctp_transport *transport;
113
114 transport = kzalloc(sizeof(*transport), gfp);
115 if (!transport)
116 goto fail;
117
118 if (!sctp_transport_init(net, transport, addr, gfp))
119 goto fail_init;
120
121 SCTP_DBG_OBJCNT_INC(transport);
122
123 return transport;
124
125 fail_init:
126 kfree(transport);
127
128 fail:
129 return NULL;
130 }
131
132 /* This transport is no longer needed. Free up if possible, or
133 * delay until it last reference count.
134 */
135 void sctp_transport_free(struct sctp_transport *transport)
136 {
137 /* Try to delete the heartbeat timer. */
138 if (del_timer(&transport->hb_timer))
139 sctp_transport_put(transport);
140
141 /* Delete the T3_rtx timer if it's active.
142 * There is no point in not doing this now and letting
143 * structure hang around in memory since we know
144 * the tranport is going away.
145 */
146 if (del_timer(&transport->T3_rtx_timer))
147 sctp_transport_put(transport);
148
149 if (del_timer(&transport->reconf_timer))
150 sctp_transport_put(transport);
151
152 /* Delete the ICMP proto unreachable timer if it's active. */
153 if (del_timer(&transport->proto_unreach_timer))
154 sctp_association_put(transport->asoc);
155
156 sctp_transport_put(transport);
157 }
158
159 static void sctp_transport_destroy_rcu(struct rcu_head *head)
160 {
161 struct sctp_transport *transport;
162
163 transport = container_of(head, struct sctp_transport, rcu);
164
165 dst_release(transport->dst);
166 kfree(transport);
167 SCTP_DBG_OBJCNT_DEC(transport);
168 }
169
170 /* Destroy the transport data structure.
171 * Assumes there are no more users of this structure.
172 */
173 static void sctp_transport_destroy(struct sctp_transport *transport)
174 {
175 if (unlikely(atomic_read(&transport->refcnt))) {
176 WARN(1, "Attempt to destroy undead transport %p!\n", transport);
177 return;
178 }
179
180 sctp_packet_free(&transport->packet);
181
182 if (transport->asoc)
183 sctp_association_put(transport->asoc);
184
185 call_rcu(&transport->rcu, sctp_transport_destroy_rcu);
186 }
187
188 /* Start T3_rtx timer if it is not already running and update the heartbeat
189 * timer. This routine is called every time a DATA chunk is sent.
190 */
191 void sctp_transport_reset_t3_rtx(struct sctp_transport *transport)
192 {
193 /* RFC 2960 6.3.2 Retransmission Timer Rules
194 *
195 * R1) Every time a DATA chunk is sent to any address(including a
196 * retransmission), if the T3-rtx timer of that address is not running
197 * start it running so that it will expire after the RTO of that
198 * address.
199 */
200
201 if (!timer_pending(&transport->T3_rtx_timer))
202 if (!mod_timer(&transport->T3_rtx_timer,
203 jiffies + transport->rto))
204 sctp_transport_hold(transport);
205 }
206
207 void sctp_transport_reset_hb_timer(struct sctp_transport *transport)
208 {
209 unsigned long expires;
210
211 /* When a data chunk is sent, reset the heartbeat interval. */
212 expires = jiffies + sctp_transport_timeout(transport);
213 if (time_before(transport->hb_timer.expires, expires) &&
214 !mod_timer(&transport->hb_timer,
215 expires + prandom_u32_max(transport->rto)))
216 sctp_transport_hold(transport);
217 }
218
219 void sctp_transport_reset_reconf_timer(struct sctp_transport *transport)
220 {
221 if (!timer_pending(&transport->reconf_timer))
222 if (!mod_timer(&transport->reconf_timer,
223 jiffies + transport->rto))
224 sctp_transport_hold(transport);
225 }
226
227 /* This transport has been assigned to an association.
228 * Initialize fields from the association or from the sock itself.
229 * Register the reference count in the association.
230 */
231 void sctp_transport_set_owner(struct sctp_transport *transport,
232 struct sctp_association *asoc)
233 {
234 transport->asoc = asoc;
235 sctp_association_hold(asoc);
236 }
237
238 /* Initialize the pmtu of a transport. */
239 void sctp_transport_pmtu(struct sctp_transport *transport, struct sock *sk)
240 {
241 /* If we don't have a fresh route, look one up */
242 if (!transport->dst || transport->dst->obsolete) {
243 sctp_transport_dst_release(transport);
244 transport->af_specific->get_dst(transport, &transport->saddr,
245 &transport->fl, sk);
246 }
247
248 if (transport->dst) {
249 transport->pathmtu = SCTP_TRUNC4(dst_mtu(transport->dst));
250 } else
251 transport->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
252 }
253
254 void sctp_transport_update_pmtu(struct sock *sk, struct sctp_transport *t, u32 pmtu)
255 {
256 struct dst_entry *dst;
257
258 if (unlikely(pmtu < SCTP_DEFAULT_MINSEGMENT)) {
259 pr_warn("%s: Reported pmtu %d too low, using default minimum of %d\n",
260 __func__, pmtu,
261 SCTP_DEFAULT_MINSEGMENT);
262 /* Use default minimum segment size and disable
263 * pmtu discovery on this transport.
264 */
265 t->pathmtu = SCTP_DEFAULT_MINSEGMENT;
266 } else {
267 t->pathmtu = pmtu;
268 }
269
270 dst = sctp_transport_dst_check(t);
271 if (!dst)
272 t->af_specific->get_dst(t, &t->saddr, &t->fl, sk);
273
274 if (dst) {
275 dst->ops->update_pmtu(dst, sk, NULL, pmtu);
276
277 dst = sctp_transport_dst_check(t);
278 if (!dst)
279 t->af_specific->get_dst(t, &t->saddr, &t->fl, sk);
280 }
281 }
282
283 /* Caches the dst entry and source address for a transport's destination
284 * address.
285 */
286 void sctp_transport_route(struct sctp_transport *transport,
287 union sctp_addr *saddr, struct sctp_sock *opt)
288 {
289 struct sctp_association *asoc = transport->asoc;
290 struct sctp_af *af = transport->af_specific;
291
292 af->get_dst(transport, saddr, &transport->fl, sctp_opt2sk(opt));
293
294 if (saddr)
295 memcpy(&transport->saddr, saddr, sizeof(union sctp_addr));
296 else
297 af->get_saddr(opt, transport, &transport->fl);
298
299 if ((transport->param_flags & SPP_PMTUD_DISABLE) && transport->pathmtu) {
300 return;
301 }
302 if (transport->dst) {
303 transport->pathmtu = SCTP_TRUNC4(dst_mtu(transport->dst));
304
305 /* Initialize sk->sk_rcv_saddr, if the transport is the
306 * association's active path for getsockname().
307 */
308 if (asoc && (!asoc->peer.primary_path ||
309 (transport == asoc->peer.active_path)))
310 opt->pf->to_sk_saddr(&transport->saddr,
311 asoc->base.sk);
312 } else
313 transport->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
314 }
315
316 /* Hold a reference to a transport. */
317 int sctp_transport_hold(struct sctp_transport *transport)
318 {
319 return atomic_add_unless(&transport->refcnt, 1, 0);
320 }
321
322 /* Release a reference to a transport and clean up
323 * if there are no more references.
324 */
325 void sctp_transport_put(struct sctp_transport *transport)
326 {
327 if (atomic_dec_and_test(&transport->refcnt))
328 sctp_transport_destroy(transport);
329 }
330
331 /* Update transport's RTO based on the newly calculated RTT. */
332 void sctp_transport_update_rto(struct sctp_transport *tp, __u32 rtt)
333 {
334 if (unlikely(!tp->rto_pending))
335 /* We should not be doing any RTO updates unless rto_pending is set. */
336 pr_debug("%s: rto_pending not set on transport %p!\n", __func__, tp);
337
338 if (tp->rttvar || tp->srtt) {
339 struct net *net = sock_net(tp->asoc->base.sk);
340 /* 6.3.1 C3) When a new RTT measurement R' is made, set
341 * RTTVAR <- (1 - RTO.Beta) * RTTVAR + RTO.Beta * |SRTT - R'|
342 * SRTT <- (1 - RTO.Alpha) * SRTT + RTO.Alpha * R'
343 */
344
345 /* Note: The above algorithm has been rewritten to
346 * express rto_beta and rto_alpha as inverse powers
347 * of two.
348 * For example, assuming the default value of RTO.Alpha of
349 * 1/8, rto_alpha would be expressed as 3.
350 */
351 tp->rttvar = tp->rttvar - (tp->rttvar >> net->sctp.rto_beta)
352 + (((__u32)abs((__s64)tp->srtt - (__s64)rtt)) >> net->sctp.rto_beta);
353 tp->srtt = tp->srtt - (tp->srtt >> net->sctp.rto_alpha)
354 + (rtt >> net->sctp.rto_alpha);
355 } else {
356 /* 6.3.1 C2) When the first RTT measurement R is made, set
357 * SRTT <- R, RTTVAR <- R/2.
358 */
359 tp->srtt = rtt;
360 tp->rttvar = rtt >> 1;
361 }
362
363 /* 6.3.1 G1) Whenever RTTVAR is computed, if RTTVAR = 0, then
364 * adjust RTTVAR <- G, where G is the CLOCK GRANULARITY.
365 */
366 if (tp->rttvar == 0)
367 tp->rttvar = SCTP_CLOCK_GRANULARITY;
368
369 /* 6.3.1 C3) After the computation, update RTO <- SRTT + 4 * RTTVAR. */
370 tp->rto = tp->srtt + (tp->rttvar << 2);
371
372 /* 6.3.1 C6) Whenever RTO is computed, if it is less than RTO.Min
373 * seconds then it is rounded up to RTO.Min seconds.
374 */
375 if (tp->rto < tp->asoc->rto_min)
376 tp->rto = tp->asoc->rto_min;
377
378 /* 6.3.1 C7) A maximum value may be placed on RTO provided it is
379 * at least RTO.max seconds.
380 */
381 if (tp->rto > tp->asoc->rto_max)
382 tp->rto = tp->asoc->rto_max;
383
384 sctp_max_rto(tp->asoc, tp);
385 tp->rtt = rtt;
386
387 /* Reset rto_pending so that a new RTT measurement is started when a
388 * new data chunk is sent.
389 */
390 tp->rto_pending = 0;
391
392 pr_debug("%s: transport:%p, rtt:%d, srtt:%d rttvar:%d, rto:%ld\n",
393 __func__, tp, rtt, tp->srtt, tp->rttvar, tp->rto);
394 }
395
396 /* This routine updates the transport's cwnd and partial_bytes_acked
397 * parameters based on the bytes acked in the received SACK.
398 */
399 void sctp_transport_raise_cwnd(struct sctp_transport *transport,
400 __u32 sack_ctsn, __u32 bytes_acked)
401 {
402 struct sctp_association *asoc = transport->asoc;
403 __u32 cwnd, ssthresh, flight_size, pba, pmtu;
404
405 cwnd = transport->cwnd;
406 flight_size = transport->flight_size;
407
408 /* See if we need to exit Fast Recovery first */
409 if (asoc->fast_recovery &&
410 TSN_lte(asoc->fast_recovery_exit, sack_ctsn))
411 asoc->fast_recovery = 0;
412
413 /* The appropriate cwnd increase algorithm is performed if, and only
414 * if the cumulative TSN whould advanced and the congestion window is
415 * being fully utilized.
416 */
417 if (TSN_lte(sack_ctsn, transport->asoc->ctsn_ack_point) ||
418 (flight_size < cwnd))
419 return;
420
421 ssthresh = transport->ssthresh;
422 pba = transport->partial_bytes_acked;
423 pmtu = transport->asoc->pathmtu;
424
425 if (cwnd <= ssthresh) {
426 /* RFC 4960 7.2.1
427 * o When cwnd is less than or equal to ssthresh, an SCTP
428 * endpoint MUST use the slow-start algorithm to increase
429 * cwnd only if the current congestion window is being fully
430 * utilized, an incoming SACK advances the Cumulative TSN
431 * Ack Point, and the data sender is not in Fast Recovery.
432 * Only when these three conditions are met can the cwnd be
433 * increased; otherwise, the cwnd MUST not be increased.
434 * If these conditions are met, then cwnd MUST be increased
435 * by, at most, the lesser of 1) the total size of the
436 * previously outstanding DATA chunk(s) acknowledged, and
437 * 2) the destination's path MTU. This upper bound protects
438 * against the ACK-Splitting attack outlined in [SAVAGE99].
439 */
440 if (asoc->fast_recovery)
441 return;
442
443 if (bytes_acked > pmtu)
444 cwnd += pmtu;
445 else
446 cwnd += bytes_acked;
447
448 pr_debug("%s: slow start: transport:%p, bytes_acked:%d, "
449 "cwnd:%d, ssthresh:%d, flight_size:%d, pba:%d\n",
450 __func__, transport, bytes_acked, cwnd, ssthresh,
451 flight_size, pba);
452 } else {
453 /* RFC 2960 7.2.2 Whenever cwnd is greater than ssthresh,
454 * upon each SACK arrival that advances the Cumulative TSN Ack
455 * Point, increase partial_bytes_acked by the total number of
456 * bytes of all new chunks acknowledged in that SACK including
457 * chunks acknowledged by the new Cumulative TSN Ack and by
458 * Gap Ack Blocks.
459 *
460 * When partial_bytes_acked is equal to or greater than cwnd
461 * and before the arrival of the SACK the sender had cwnd or
462 * more bytes of data outstanding (i.e., before arrival of the
463 * SACK, flightsize was greater than or equal to cwnd),
464 * increase cwnd by MTU, and reset partial_bytes_acked to
465 * (partial_bytes_acked - cwnd).
466 */
467 pba += bytes_acked;
468 if (pba >= cwnd) {
469 cwnd += pmtu;
470 pba = ((cwnd < pba) ? (pba - cwnd) : 0);
471 }
472
473 pr_debug("%s: congestion avoidance: transport:%p, "
474 "bytes_acked:%d, cwnd:%d, ssthresh:%d, "
475 "flight_size:%d, pba:%d\n", __func__,
476 transport, bytes_acked, cwnd, ssthresh,
477 flight_size, pba);
478 }
479
480 transport->cwnd = cwnd;
481 transport->partial_bytes_acked = pba;
482 }
483
484 /* This routine is used to lower the transport's cwnd when congestion is
485 * detected.
486 */
487 void sctp_transport_lower_cwnd(struct sctp_transport *transport,
488 sctp_lower_cwnd_t reason)
489 {
490 struct sctp_association *asoc = transport->asoc;
491
492 switch (reason) {
493 case SCTP_LOWER_CWND_T3_RTX:
494 /* RFC 2960 Section 7.2.3, sctpimpguide
495 * When the T3-rtx timer expires on an address, SCTP should
496 * perform slow start by:
497 * ssthresh = max(cwnd/2, 4*MTU)
498 * cwnd = 1*MTU
499 * partial_bytes_acked = 0
500 */
501 transport->ssthresh = max(transport->cwnd/2,
502 4*asoc->pathmtu);
503 transport->cwnd = asoc->pathmtu;
504
505 /* T3-rtx also clears fast recovery */
506 asoc->fast_recovery = 0;
507 break;
508
509 case SCTP_LOWER_CWND_FAST_RTX:
510 /* RFC 2960 7.2.4 Adjust the ssthresh and cwnd of the
511 * destination address(es) to which the missing DATA chunks
512 * were last sent, according to the formula described in
513 * Section 7.2.3.
514 *
515 * RFC 2960 7.2.3, sctpimpguide Upon detection of packet
516 * losses from SACK (see Section 7.2.4), An endpoint
517 * should do the following:
518 * ssthresh = max(cwnd/2, 4*MTU)
519 * cwnd = ssthresh
520 * partial_bytes_acked = 0
521 */
522 if (asoc->fast_recovery)
523 return;
524
525 /* Mark Fast recovery */
526 asoc->fast_recovery = 1;
527 asoc->fast_recovery_exit = asoc->next_tsn - 1;
528
529 transport->ssthresh = max(transport->cwnd/2,
530 4*asoc->pathmtu);
531 transport->cwnd = transport->ssthresh;
532 break;
533
534 case SCTP_LOWER_CWND_ECNE:
535 /* RFC 2481 Section 6.1.2.
536 * If the sender receives an ECN-Echo ACK packet
537 * then the sender knows that congestion was encountered in the
538 * network on the path from the sender to the receiver. The
539 * indication of congestion should be treated just as a
540 * congestion loss in non-ECN Capable TCP. That is, the TCP
541 * source halves the congestion window "cwnd" and reduces the
542 * slow start threshold "ssthresh".
543 * A critical condition is that TCP does not react to
544 * congestion indications more than once every window of
545 * data (or more loosely more than once every round-trip time).
546 */
547 if (time_after(jiffies, transport->last_time_ecne_reduced +
548 transport->rtt)) {
549 transport->ssthresh = max(transport->cwnd/2,
550 4*asoc->pathmtu);
551 transport->cwnd = transport->ssthresh;
552 transport->last_time_ecne_reduced = jiffies;
553 }
554 break;
555
556 case SCTP_LOWER_CWND_INACTIVE:
557 /* RFC 2960 Section 7.2.1, sctpimpguide
558 * When the endpoint does not transmit data on a given
559 * transport address, the cwnd of the transport address
560 * should be adjusted to max(cwnd/2, 4*MTU) per RTO.
561 * NOTE: Although the draft recommends that this check needs
562 * to be done every RTO interval, we do it every hearbeat
563 * interval.
564 */
565 transport->cwnd = max(transport->cwnd/2,
566 4*asoc->pathmtu);
567 break;
568 }
569
570 transport->partial_bytes_acked = 0;
571
572 pr_debug("%s: transport:%p, reason:%d, cwnd:%d, ssthresh:%d\n",
573 __func__, transport, reason, transport->cwnd,
574 transport->ssthresh);
575 }
576
577 /* Apply Max.Burst limit to the congestion window:
578 * sctpimpguide-05 2.14.2
579 * D) When the time comes for the sender to
580 * transmit new DATA chunks, the protocol parameter Max.Burst MUST
581 * first be applied to limit how many new DATA chunks may be sent.
582 * The limit is applied by adjusting cwnd as follows:
583 * if ((flightsize+ Max.Burst * MTU) < cwnd)
584 * cwnd = flightsize + Max.Burst * MTU
585 */
586
587 void sctp_transport_burst_limited(struct sctp_transport *t)
588 {
589 struct sctp_association *asoc = t->asoc;
590 u32 old_cwnd = t->cwnd;
591 u32 max_burst_bytes;
592
593 if (t->burst_limited || asoc->max_burst == 0)
594 return;
595
596 max_burst_bytes = t->flight_size + (asoc->max_burst * asoc->pathmtu);
597 if (max_burst_bytes < old_cwnd) {
598 t->cwnd = max_burst_bytes;
599 t->burst_limited = old_cwnd;
600 }
601 }
602
603 /* Restore the old cwnd congestion window, after the burst had it's
604 * desired effect.
605 */
606 void sctp_transport_burst_reset(struct sctp_transport *t)
607 {
608 if (t->burst_limited) {
609 t->cwnd = t->burst_limited;
610 t->burst_limited = 0;
611 }
612 }
613
614 /* What is the next timeout value for this transport? */
615 unsigned long sctp_transport_timeout(struct sctp_transport *trans)
616 {
617 /* RTO + timer slack +/- 50% of RTO */
618 unsigned long timeout = trans->rto >> 1;
619
620 if (trans->state != SCTP_UNCONFIRMED &&
621 trans->state != SCTP_PF)
622 timeout += trans->hbinterval;
623
624 return timeout;
625 }
626
627 /* Reset transport variables to their initial values */
628 void sctp_transport_reset(struct sctp_transport *t)
629 {
630 struct sctp_association *asoc = t->asoc;
631
632 /* RFC 2960 (bis), Section 5.2.4
633 * All the congestion control parameters (e.g., cwnd, ssthresh)
634 * related to this peer MUST be reset to their initial values
635 * (see Section 6.2.1)
636 */
637 t->cwnd = min(4*asoc->pathmtu, max_t(__u32, 2*asoc->pathmtu, 4380));
638 t->burst_limited = 0;
639 t->ssthresh = asoc->peer.i.a_rwnd;
640 t->rto = asoc->rto_initial;
641 sctp_max_rto(asoc, t);
642 t->rtt = 0;
643 t->srtt = 0;
644 t->rttvar = 0;
645
646 /* Reset these additional variables so that we have a clean slate. */
647 t->partial_bytes_acked = 0;
648 t->flight_size = 0;
649 t->error_count = 0;
650 t->rto_pending = 0;
651 t->hb_sent = 0;
652
653 /* Initialize the state information for SFR-CACC */
654 t->cacc.changeover_active = 0;
655 t->cacc.cycling_changeover = 0;
656 t->cacc.next_tsn_at_change = 0;
657 t->cacc.cacc_saw_newack = 0;
658 }
659
660 /* Schedule retransmission on the given transport */
661 void sctp_transport_immediate_rtx(struct sctp_transport *t)
662 {
663 /* Stop pending T3_rtx_timer */
664 if (del_timer(&t->T3_rtx_timer))
665 sctp_transport_put(t);
666
667 sctp_retransmit(&t->asoc->outqueue, t, SCTP_RTXR_T3_RTX);
668 if (!timer_pending(&t->T3_rtx_timer)) {
669 if (!mod_timer(&t->T3_rtx_timer, jiffies + t->rto))
670 sctp_transport_hold(t);
671 }
672 }
673
674 /* Drop dst */
675 void sctp_transport_dst_release(struct sctp_transport *t)
676 {
677 dst_release(t->dst);
678 t->dst = NULL;
679 t->dst_pending_confirm = 0;
680 }
681
682 /* Schedule neighbour confirm */
683 void sctp_transport_dst_confirm(struct sctp_transport *t)
684 {
685 t->dst_pending_confirm = 1;
686 }