blob: fafd2a461ba0bee0f5d8d4750ae9b3b73bdac079 [file] [log] [blame]
Vlad Yasevich60c778b2008-01-11 09:57:09 -05001/* SCTP kernel implementation
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * 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 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -05008 * This file is part of the SCTP kernel implementation
Linus Torvalds1da177e2005-04-16 15:20:36 -07009 *
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 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -050014 * This SCTP implementation is free software;
Linus Torvalds1da177e2005-04-16 15:20:36 -070015 * 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 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -050020 * This SCTP implementation is distributed in the hope that it
Linus Torvalds1da177e2005-04-16 15:20:36 -070021 * 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, write to
28 * the Free Software Foundation, 59 Temple Place - Suite 330,
29 * Boston, MA 02111-1307, USA.
30 *
31 * Please send any bug reports or fixes you make to the
32 * email address(es):
33 * lksctp developers <lksctp-developers@lists.sourceforge.net>
34 *
35 * Or submit a bug report through the following website:
36 * http://www.sf.net/projects/lksctp
37 *
38 * Written or modified by:
39 * La Monte H.P. Yarroll <piggy@acm.org>
40 * Karl Knutson <karl@athena.chicago.il.us>
41 * Jon Grimm <jgrimm@us.ibm.com>
42 * Xingang Guo <xingang.guo@intel.com>
43 * Hui Huang <hui.huang@nokia.com>
44 * Sridhar Samudrala <sri@us.ibm.com>
45 * Ardelle Fan <ardelle.fan@intel.com>
46 *
47 * Any bugs reported given to us we will try to fix... any fixes shared will
48 * be incorporated into the next SCTP release.
49 */
50
Joe Perches145ce502010-08-24 13:21:08 +000051#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
52
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090053#include <linux/slab.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070054#include <linux/types.h>
Sridhar Samudralaad8fec12006-07-21 14:48:50 -070055#include <linux/random.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070056#include <net/sctp/sctp.h>
57#include <net/sctp/sm.h>
58
59/* 1st Level Abstractions. */
60
61/* Initialize a new transport from provided memory. */
Eric W. Biederman89bf3452012-08-07 07:26:14 +000062static struct sctp_transport *sctp_transport_init(struct net *net,
63 struct sctp_transport *peer,
Linus Torvalds1da177e2005-04-16 15:20:36 -070064 const union sctp_addr *addr,
Al Virodd0fc662005-10-07 07:46:04 +010065 gfp_t gfp)
Linus Torvalds1da177e2005-04-16 15:20:36 -070066{
67 /* Copy in the address. */
68 peer->ipaddr = *addr;
69 peer->af_specific = sctp_get_af_specific(addr->sa.sa_family);
Linus Torvalds1da177e2005-04-16 15:20:36 -070070 memset(&peer->saddr, 0, sizeof(union sctp_addr));
71
Neil Horman42448542012-06-30 03:04:26 +000072 peer->sack_generation = 0;
73
Linus Torvalds1da177e2005-04-16 15:20:36 -070074 /* From 6.3.1 RTO Calculation:
75 *
76 * C1) Until an RTT measurement has been made for a packet sent to the
77 * given destination transport address, set RTO to the protocol
78 * parameter 'RTO.Initial'.
79 */
Eric W. Biedermane1fc3b12012-08-07 07:29:57 +000080 peer->rto = msecs_to_jiffies(net->sctp.rto_initial);
Linus Torvalds1da177e2005-04-16 15:20:36 -070081
82 peer->last_time_heard = jiffies;
Linus Torvalds1da177e2005-04-16 15:20:36 -070083 peer->last_time_ecne_reduced = jiffies;
84
Frank Filz52ccb8e2005-12-22 11:36:46 -080085 peer->param_flags = SPP_HB_DISABLE |
86 SPP_PMTUD_ENABLE |
87 SPP_SACKDELAY_ENABLE;
Linus Torvalds1da177e2005-04-16 15:20:36 -070088
89 /* Initialize the default path max_retrans. */
Eric W. Biedermane1fc3b12012-08-07 07:29:57 +000090 peer->pathmaxrxt = net->sctp.max_retrans_path;
91 peer->pf_retrans = net->sctp.pf_retrans;
Linus Torvalds1da177e2005-04-16 15:20:36 -070092
93 INIT_LIST_HEAD(&peer->transmitted);
94 INIT_LIST_HEAD(&peer->send_ready);
95 INIT_LIST_HEAD(&peer->transports);
96
Pavel Emelyanovb24b8a22008-01-23 21:20:07 -080097 setup_timer(&peer->T3_rtx_timer, sctp_generate_t3_rtx_event,
98 (unsigned long)peer);
99 setup_timer(&peer->hb_timer, sctp_generate_heartbeat_event,
100 (unsigned long)peer);
Vlad Yasevich50b5d6a2010-05-06 00:56:07 -0700101 setup_timer(&peer->proto_unreach_timer,
102 sctp_generate_proto_unreach_event, (unsigned long)peer);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103
Sridhar Samudralaad8fec12006-07-21 14:48:50 -0700104 /* Initialize the 64-bit random nonce sent with heartbeat. */
105 get_random_bytes(&peer->hb_nonce, sizeof(peer->hb_nonce));
106
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107 atomic_set(&peer->refcnt, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108
109 return peer;
110}
111
112/* Allocate and initialize a new transport. */
Eric W. Biederman89bf3452012-08-07 07:26:14 +0000113struct sctp_transport *sctp_transport_new(struct net *net,
114 const union sctp_addr *addr,
Al Virodd0fc662005-10-07 07:46:04 +0100115 gfp_t gfp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116{
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900117 struct sctp_transport *transport;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900119 transport = t_new(struct sctp_transport, gfp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120 if (!transport)
121 goto fail;
122
Eric W. Biederman89bf3452012-08-07 07:26:14 +0000123 if (!sctp_transport_init(net, transport, addr, gfp))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 goto fail_init;
125
126 transport->malloced = 1;
127 SCTP_DBG_OBJCNT_INC(transport);
128
129 return transport;
130
131fail_init:
132 kfree(transport);
133
134fail:
135 return NULL;
136}
137
138/* This transport is no longer needed. Free up if possible, or
139 * delay until it last reference count.
140 */
141void sctp_transport_free(struct sctp_transport *transport)
142{
143 transport->dead = 1;
144
145 /* Try to delete the heartbeat timer. */
146 if (del_timer(&transport->hb_timer))
147 sctp_transport_put(transport);
148
149 /* Delete the T3_rtx timer if it's active.
150 * There is no point in not doing this now and letting
151 * structure hang around in memory since we know
152 * the tranport is going away.
153 */
Ying Xue25cc4ae2013-02-03 20:32:57 +0000154 if (del_timer(&transport->T3_rtx_timer))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155 sctp_transport_put(transport);
156
Wei Yongjun55fa0cf2010-05-09 16:56:07 +0000157 /* Delete the ICMP proto unreachable timer if it's active. */
Ying Xue25cc4ae2013-02-03 20:32:57 +0000158 if (del_timer(&transport->proto_unreach_timer))
Wei Yongjun55fa0cf2010-05-09 16:56:07 +0000159 sctp_association_put(transport->asoc);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700160
161 sctp_transport_put(transport);
162}
163
Thomas Graf45122ca262012-12-06 09:25:05 +0000164static void sctp_transport_destroy_rcu(struct rcu_head *head)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165{
Thomas Graf45122ca262012-12-06 09:25:05 +0000166 struct sctp_transport *transport;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167
Thomas Graf45122ca262012-12-06 09:25:05 +0000168 transport = container_of(head, struct sctp_transport, rcu);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169
170 dst_release(transport->dst);
171 kfree(transport);
172 SCTP_DBG_OBJCNT_DEC(transport);
173}
174
Thomas Graf45122ca262012-12-06 09:25:05 +0000175/* Destroy the transport data structure.
176 * Assumes there are no more users of this structure.
177 */
178static void sctp_transport_destroy(struct sctp_transport *transport)
179{
180 SCTP_ASSERT(transport->dead, "Transport is not dead", return);
181
182 call_rcu(&transport->rcu, sctp_transport_destroy_rcu);
Daniel Borkmann8c986532013-02-01 04:37:43 +0000183
184 sctp_packet_free(&transport->packet);
185
186 if (transport->asoc)
187 sctp_association_put(transport->asoc);
Thomas Graf45122ca262012-12-06 09:25:05 +0000188}
189
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190/* Start T3_rtx timer if it is not already running and update the heartbeat
191 * timer. This routine is called every time a DATA chunk is sent.
192 */
Vlad Yasevichd9efc222010-04-30 22:41:09 -0400193void sctp_transport_reset_timers(struct sctp_transport *transport)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194{
195 /* RFC 2960 6.3.2 Retransmission Timer Rules
196 *
197 * R1) Every time a DATA chunk is sent to any address(including a
198 * retransmission), if the T3-rtx timer of that address is not running
199 * start it running so that it will expire after the RTO of that
200 * address.
201 */
202
Vlad Yasevichd9efc222010-04-30 22:41:09 -0400203 if (!timer_pending(&transport->T3_rtx_timer))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204 if (!mod_timer(&transport->T3_rtx_timer,
205 jiffies + transport->rto))
206 sctp_transport_hold(transport);
207
208 /* When a data chunk is sent, reset the heartbeat interval. */
209 if (!mod_timer(&transport->hb_timer,
210 sctp_transport_timeout(transport)))
211 sctp_transport_hold(transport);
212}
213
214/* This transport has been assigned to an association.
215 * Initialize fields from the association or from the sock itself.
216 * Register the reference count in the association.
217 */
218void sctp_transport_set_owner(struct sctp_transport *transport,
219 struct sctp_association *asoc)
220{
221 transport->asoc = asoc;
222 sctp_association_hold(asoc);
223}
224
225/* Initialize the pmtu of a transport. */
Vlad Yasevich9914ae32011-04-26 21:51:31 +0000226void sctp_transport_pmtu(struct sctp_transport *transport, struct sock *sk)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700227{
Vlad Yasevichda0420b2011-04-26 21:54:17 +0000228 /* If we don't have a fresh route, look one up */
David S. Millerf5b0a872012-07-19 12:31:33 -0700229 if (!transport->dst || transport->dst->obsolete) {
Vlad Yasevichda0420b2011-04-26 21:54:17 +0000230 dst_release(transport->dst);
231 transport->af_specific->get_dst(transport, &transport->saddr,
David S. Miller8663c932011-05-06 16:32:47 -0700232 &transport->fl, sk);
Vlad Yasevichda0420b2011-04-26 21:54:17 +0000233 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700234
Vlad Yasevichda0420b2011-04-26 21:54:17 +0000235 if (transport->dst) {
236 transport->pathmtu = dst_mtu(transport->dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700237 } else
Frank Filz52ccb8e2005-12-22 11:36:46 -0800238 transport->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700239}
240
David S. Miller02f3d4c2012-07-16 03:57:14 -0700241void sctp_transport_update_pmtu(struct sock *sk, struct sctp_transport *t, u32 pmtu)
Vlad Yasevichc910b472007-06-07 13:47:03 -0400242{
243 struct dst_entry *dst;
244
245 if (unlikely(pmtu < SCTP_DEFAULT_MINSEGMENT)) {
Joe Perches145ce502010-08-24 13:21:08 +0000246 pr_warn("%s: Reported pmtu %d too low, using default minimum of %d\n",
247 __func__, pmtu,
248 SCTP_DEFAULT_MINSEGMENT);
Vlad Yasevichc910b472007-06-07 13:47:03 -0400249 /* Use default minimum segment size and disable
250 * pmtu discovery on this transport.
251 */
252 t->pathmtu = SCTP_DEFAULT_MINSEGMENT;
Vlad Yasevichc910b472007-06-07 13:47:03 -0400253 } else {
254 t->pathmtu = pmtu;
255 }
256
257 dst = sctp_transport_dst_check(t);
David S. Miller02f3d4c2012-07-16 03:57:14 -0700258 if (!dst)
259 t->af_specific->get_dst(t, &t->saddr, &t->fl, sk);
260
261 if (dst) {
David S. Miller6700c272012-07-17 03:29:28 -0700262 dst->ops->update_pmtu(dst, sk, NULL, pmtu);
David S. Miller02f3d4c2012-07-16 03:57:14 -0700263
264 dst = sctp_transport_dst_check(t);
265 if (!dst)
266 t->af_specific->get_dst(t, &t->saddr, &t->fl, sk);
267 }
Vlad Yasevichc910b472007-06-07 13:47:03 -0400268}
269
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270/* Caches the dst entry and source address for a transport's destination
271 * address.
272 */
273void sctp_transport_route(struct sctp_transport *transport,
274 union sctp_addr *saddr, struct sctp_sock *opt)
275{
276 struct sctp_association *asoc = transport->asoc;
277 struct sctp_af *af = transport->af_specific;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700278
David S. Miller8663c932011-05-06 16:32:47 -0700279 af->get_dst(transport, saddr, &transport->fl, sctp_opt2sk(opt));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280
281 if (saddr)
282 memcpy(&transport->saddr, saddr, sizeof(union sctp_addr));
283 else
David S. Miller8663c932011-05-06 16:32:47 -0700284 af->get_saddr(opt, transport, &transport->fl);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285
Frank Filz52ccb8e2005-12-22 11:36:46 -0800286 if ((transport->param_flags & SPP_PMTUD_DISABLE) && transport->pathmtu) {
287 return;
288 }
Vlad Yasevichda0420b2011-04-26 21:54:17 +0000289 if (transport->dst) {
290 transport->pathmtu = dst_mtu(transport->dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291
292 /* Initialize sk->sk_rcv_saddr, if the transport is the
293 * association's active path for getsockname().
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900294 */
Vlad Yasevicha78102e2009-11-11 11:54:37 +0000295 if (asoc && (!asoc->peer.primary_path ||
296 (transport == asoc->peer.active_path)))
Neil Hormanbf031ff2005-12-02 20:32:29 -0800297 opt->pf->af->to_sk_saddr(&transport->saddr,
298 asoc->base.sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299 } else
Frank Filz52ccb8e2005-12-22 11:36:46 -0800300 transport->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301}
302
303/* Hold a reference to a transport. */
304void sctp_transport_hold(struct sctp_transport *transport)
305{
306 atomic_inc(&transport->refcnt);
307}
308
309/* Release a reference to a transport and clean up
310 * if there are no more references.
311 */
312void sctp_transport_put(struct sctp_transport *transport)
313{
314 if (atomic_dec_and_test(&transport->refcnt))
315 sctp_transport_destroy(transport);
316}
317
318/* Update transport's RTO based on the newly calculated RTT. */
319void sctp_transport_update_rto(struct sctp_transport *tp, __u32 rtt)
320{
321 /* Check for valid transport. */
322 SCTP_ASSERT(tp, "NULL transport", return);
323
324 /* We should not be doing any RTO updates unless rto_pending is set. */
325 SCTP_ASSERT(tp->rto_pending, "rto_pending not set", return);
326
327 if (tp->rttvar || tp->srtt) {
Eric W. Biedermane1fc3b12012-08-07 07:29:57 +0000328 struct net *net = sock_net(tp->asoc->base.sk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329 /* 6.3.1 C3) When a new RTT measurement R' is made, set
330 * RTTVAR <- (1 - RTO.Beta) * RTTVAR + RTO.Beta * |SRTT - R'|
331 * SRTT <- (1 - RTO.Alpha) * SRTT + RTO.Alpha * R'
332 */
333
334 /* Note: The above algorithm has been rewritten to
335 * express rto_beta and rto_alpha as inverse powers
336 * of two.
337 * For example, assuming the default value of RTO.Alpha of
338 * 1/8, rto_alpha would be expressed as 3.
339 */
Eric W. Biedermane1fc3b12012-08-07 07:29:57 +0000340 tp->rttvar = tp->rttvar - (tp->rttvar >> net->sctp.rto_beta)
Schoch Christian92d64c22012-11-28 05:18:29 +0000341 + (((__u32)abs64((__s64)tp->srtt - (__s64)rtt)) >> net->sctp.rto_beta);
Eric W. Biedermane1fc3b12012-08-07 07:29:57 +0000342 tp->srtt = tp->srtt - (tp->srtt >> net->sctp.rto_alpha)
343 + (rtt >> net->sctp.rto_alpha);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700344 } else {
345 /* 6.3.1 C2) When the first RTT measurement R is made, set
346 * SRTT <- R, RTTVAR <- R/2.
347 */
348 tp->srtt = rtt;
349 tp->rttvar = rtt >> 1;
350 }
351
352 /* 6.3.1 G1) Whenever RTTVAR is computed, if RTTVAR = 0, then
353 * adjust RTTVAR <- G, where G is the CLOCK GRANULARITY.
354 */
355 if (tp->rttvar == 0)
356 tp->rttvar = SCTP_CLOCK_GRANULARITY;
357
358 /* 6.3.1 C3) After the computation, update RTO <- SRTT + 4 * RTTVAR. */
359 tp->rto = tp->srtt + (tp->rttvar << 2);
360
361 /* 6.3.1 C6) Whenever RTO is computed, if it is less than RTO.Min
362 * seconds then it is rounded up to RTO.Min seconds.
363 */
364 if (tp->rto < tp->asoc->rto_min)
365 tp->rto = tp->asoc->rto_min;
366
367 /* 6.3.1 C7) A maximum value may be placed on RTO provided it is
368 * at least RTO.max seconds.
369 */
370 if (tp->rto > tp->asoc->rto_max)
371 tp->rto = tp->asoc->rto_max;
372
Michele Baldessari196d6752012-12-01 04:49:42 +0000373 sctp_max_rto(tp->asoc, tp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700374 tp->rtt = rtt;
375
376 /* Reset rto_pending so that a new RTT measurement is started when a
377 * new data chunk is sent.
378 */
379 tp->rto_pending = 0;
380
381 SCTP_DEBUG_PRINTK("%s: transport: %p, rtt: %d, srtt: %d "
Harvey Harrison0dc47872008-03-05 20:47:47 -0800382 "rttvar: %d, rto: %ld\n", __func__,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383 tp, rtt, tp->srtt, tp->rttvar, tp->rto);
384}
385
386/* This routine updates the transport's cwnd and partial_bytes_acked
387 * parameters based on the bytes acked in the received SACK.
388 */
389void sctp_transport_raise_cwnd(struct sctp_transport *transport,
390 __u32 sack_ctsn, __u32 bytes_acked)
391{
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400392 struct sctp_association *asoc = transport->asoc;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393 __u32 cwnd, ssthresh, flight_size, pba, pmtu;
394
395 cwnd = transport->cwnd;
396 flight_size = transport->flight_size;
397
Vlad Yasevicha6465232008-06-04 12:38:43 -0700398 /* See if we need to exit Fast Recovery first */
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400399 if (asoc->fast_recovery &&
400 TSN_lte(asoc->fast_recovery_exit, sack_ctsn))
401 asoc->fast_recovery = 0;
Vlad Yasevicha6465232008-06-04 12:38:43 -0700402
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403 /* The appropriate cwnd increase algorithm is performed if, and only
Vlad Yasevicha6465232008-06-04 12:38:43 -0700404 * if the cumulative TSN whould advanced and the congestion window is
Linus Torvalds1da177e2005-04-16 15:20:36 -0700405 * being fully utilized.
406 */
Vlad Yasevicha6465232008-06-04 12:38:43 -0700407 if (TSN_lte(sack_ctsn, transport->asoc->ctsn_ack_point) ||
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408 (flight_size < cwnd))
409 return;
410
411 ssthresh = transport->ssthresh;
412 pba = transport->partial_bytes_acked;
Frank Filz52ccb8e2005-12-22 11:36:46 -0800413 pmtu = transport->asoc->pathmtu;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414
415 if (cwnd <= ssthresh) {
Vlad Yasevicha6465232008-06-04 12:38:43 -0700416 /* RFC 4960 7.2.1
417 * o When cwnd is less than or equal to ssthresh, an SCTP
418 * endpoint MUST use the slow-start algorithm to increase
419 * cwnd only if the current congestion window is being fully
420 * utilized, an incoming SACK advances the Cumulative TSN
421 * Ack Point, and the data sender is not in Fast Recovery.
422 * Only when these three conditions are met can the cwnd be
423 * increased; otherwise, the cwnd MUST not be increased.
424 * If these conditions are met, then cwnd MUST be increased
425 * by, at most, the lesser of 1) the total size of the
426 * previously outstanding DATA chunk(s) acknowledged, and
427 * 2) the destination's path MTU. This upper bound protects
428 * against the ACK-Splitting attack outlined in [SAVAGE99].
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429 */
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400430 if (asoc->fast_recovery)
Vlad Yasevicha6465232008-06-04 12:38:43 -0700431 return;
432
Linus Torvalds1da177e2005-04-16 15:20:36 -0700433 if (bytes_acked > pmtu)
434 cwnd += pmtu;
435 else
436 cwnd += bytes_acked;
437 SCTP_DEBUG_PRINTK("%s: SLOW START: transport: %p, "
438 "bytes_acked: %d, cwnd: %d, ssthresh: %d, "
439 "flight_size: %d, pba: %d\n",
Harvey Harrison0dc47872008-03-05 20:47:47 -0800440 __func__,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441 transport, bytes_acked, cwnd,
442 ssthresh, flight_size, pba);
443 } else {
444 /* RFC 2960 7.2.2 Whenever cwnd is greater than ssthresh,
445 * upon each SACK arrival that advances the Cumulative TSN Ack
446 * Point, increase partial_bytes_acked by the total number of
447 * bytes of all new chunks acknowledged in that SACK including
448 * chunks acknowledged by the new Cumulative TSN Ack and by
449 * Gap Ack Blocks.
450 *
451 * When partial_bytes_acked is equal to or greater than cwnd
452 * and before the arrival of the SACK the sender had cwnd or
453 * more bytes of data outstanding (i.e., before arrival of the
454 * SACK, flightsize was greater than or equal to cwnd),
455 * increase cwnd by MTU, and reset partial_bytes_acked to
456 * (partial_bytes_acked - cwnd).
457 */
458 pba += bytes_acked;
459 if (pba >= cwnd) {
460 cwnd += pmtu;
461 pba = ((cwnd < pba) ? (pba - cwnd) : 0);
462 }
463 SCTP_DEBUG_PRINTK("%s: CONGESTION AVOIDANCE: "
464 "transport: %p, bytes_acked: %d, cwnd: %d, "
465 "ssthresh: %d, flight_size: %d, pba: %d\n",
Harvey Harrison0dc47872008-03-05 20:47:47 -0800466 __func__,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700467 transport, bytes_acked, cwnd,
468 ssthresh, flight_size, pba);
469 }
470
471 transport->cwnd = cwnd;
472 transport->partial_bytes_acked = pba;
473}
474
475/* This routine is used to lower the transport's cwnd when congestion is
476 * detected.
477 */
478void sctp_transport_lower_cwnd(struct sctp_transport *transport,
479 sctp_lower_cwnd_t reason)
480{
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400481 struct sctp_association *asoc = transport->asoc;
482
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483 switch (reason) {
484 case SCTP_LOWER_CWND_T3_RTX:
485 /* RFC 2960 Section 7.2.3, sctpimpguide
486 * When the T3-rtx timer expires on an address, SCTP should
487 * perform slow start by:
488 * ssthresh = max(cwnd/2, 4*MTU)
489 * cwnd = 1*MTU
490 * partial_bytes_acked = 0
491 */
492 transport->ssthresh = max(transport->cwnd/2,
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400493 4*asoc->pathmtu);
494 transport->cwnd = asoc->pathmtu;
Vlad Yasevich33ce8282009-09-04 18:20:58 -0400495
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400496 /* T3-rtx also clears fast recovery */
497 asoc->fast_recovery = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700498 break;
499
500 case SCTP_LOWER_CWND_FAST_RTX:
501 /* RFC 2960 7.2.4 Adjust the ssthresh and cwnd of the
502 * destination address(es) to which the missing DATA chunks
503 * were last sent, according to the formula described in
504 * Section 7.2.3.
YOSHIFUJI Hideakid808ad92007-02-09 23:25:18 +0900505 *
506 * RFC 2960 7.2.3, sctpimpguide Upon detection of packet
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507 * losses from SACK (see Section 7.2.4), An endpoint
508 * should do the following:
509 * ssthresh = max(cwnd/2, 4*MTU)
510 * cwnd = ssthresh
511 * partial_bytes_acked = 0
512 */
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400513 if (asoc->fast_recovery)
Vlad Yasevicha6465232008-06-04 12:38:43 -0700514 return;
515
516 /* Mark Fast recovery */
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400517 asoc->fast_recovery = 1;
518 asoc->fast_recovery_exit = asoc->next_tsn - 1;
Vlad Yasevicha6465232008-06-04 12:38:43 -0700519
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 transport->ssthresh = max(transport->cwnd/2,
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400521 4*asoc->pathmtu);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522 transport->cwnd = transport->ssthresh;
523 break;
524
525 case SCTP_LOWER_CWND_ECNE:
526 /* RFC 2481 Section 6.1.2.
527 * If the sender receives an ECN-Echo ACK packet
528 * then the sender knows that congestion was encountered in the
529 * network on the path from the sender to the receiver. The
530 * indication of congestion should be treated just as a
531 * congestion loss in non-ECN Capable TCP. That is, the TCP
532 * source halves the congestion window "cwnd" and reduces the
533 * slow start threshold "ssthresh".
534 * A critical condition is that TCP does not react to
535 * congestion indications more than once every window of
536 * data (or more loosely more than once every round-trip time).
537 */
Wei Yongjunf61f6f82009-03-02 09:46:13 +0000538 if (time_after(jiffies, transport->last_time_ecne_reduced +
539 transport->rtt)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700540 transport->ssthresh = max(transport->cwnd/2,
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400541 4*asoc->pathmtu);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700542 transport->cwnd = transport->ssthresh;
543 transport->last_time_ecne_reduced = jiffies;
544 }
545 break;
546
547 case SCTP_LOWER_CWND_INACTIVE:
548 /* RFC 2960 Section 7.2.1, sctpimpguide
549 * When the endpoint does not transmit data on a given
550 * transport address, the cwnd of the transport address
551 * should be adjusted to max(cwnd/2, 4*MTU) per RTO.
552 * NOTE: Although the draft recommends that this check needs
553 * to be done every RTO interval, we do it every hearbeat
554 * interval.
555 */
Vlad Yasevich245cba72009-11-23 15:53:58 -0500556 transport->cwnd = max(transport->cwnd/2,
Vlad Yasevichcf9b4812010-04-30 22:41:10 -0400557 4*asoc->pathmtu);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700558 break;
Stephen Hemminger3ff50b72007-04-20 17:09:22 -0700559 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700560
561 transport->partial_bytes_acked = 0;
562 SCTP_DEBUG_PRINTK("%s: transport: %p reason: %d cwnd: "
Harvey Harrison0dc47872008-03-05 20:47:47 -0800563 "%d ssthresh: %d\n", __func__,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700564 transport, reason,
565 transport->cwnd, transport->ssthresh);
566}
567
Vlad Yasevich46d5a802009-11-23 15:54:00 -0500568/* Apply Max.Burst limit to the congestion window:
569 * sctpimpguide-05 2.14.2
570 * D) When the time comes for the sender to
571 * transmit new DATA chunks, the protocol parameter Max.Burst MUST
572 * first be applied to limit how many new DATA chunks may be sent.
573 * The limit is applied by adjusting cwnd as follows:
574 * if ((flightsize+ Max.Burst * MTU) < cwnd)
575 * cwnd = flightsize + Max.Burst * MTU
576 */
577
578void sctp_transport_burst_limited(struct sctp_transport *t)
579{
580 struct sctp_association *asoc = t->asoc;
581 u32 old_cwnd = t->cwnd;
582 u32 max_burst_bytes;
583
584 if (t->burst_limited)
585 return;
586
587 max_burst_bytes = t->flight_size + (asoc->max_burst * asoc->pathmtu);
588 if (max_burst_bytes < old_cwnd) {
589 t->cwnd = max_burst_bytes;
590 t->burst_limited = old_cwnd;
591 }
592}
593
594/* Restore the old cwnd congestion window, after the burst had it's
595 * desired effect.
596 */
597void sctp_transport_burst_reset(struct sctp_transport *t)
598{
599 if (t->burst_limited) {
600 t->cwnd = t->burst_limited;
601 t->burst_limited = 0;
602 }
603}
604
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605/* What is the next timeout value for this transport? */
606unsigned long sctp_transport_timeout(struct sctp_transport *t)
607{
608 unsigned long timeout;
Sridhar Samudralaad8fec12006-07-21 14:48:50 -0700609 timeout = t->rto + sctp_jitter(t->rto);
Neil Horman5aa93bc2012-07-21 07:56:07 +0000610 if ((t->state != SCTP_UNCONFIRMED) &&
611 (t->state != SCTP_PF))
Sridhar Samudralaad8fec12006-07-21 14:48:50 -0700612 timeout += t->hbinterval;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700613 timeout += jiffies;
614 return timeout;
615}
Vlad Yasevich749bf922007-03-19 17:02:30 -0700616
617/* Reset transport variables to their initial values */
618void sctp_transport_reset(struct sctp_transport *t)
619{
620 struct sctp_association *asoc = t->asoc;
621
622 /* RFC 2960 (bis), Section 5.2.4
623 * All the congestion control parameters (e.g., cwnd, ssthresh)
624 * related to this peer MUST be reset to their initial values
625 * (see Section 6.2.1)
626 */
627 t->cwnd = min(4*asoc->pathmtu, max_t(__u32, 2*asoc->pathmtu, 4380));
Vlad Yasevich46d5a802009-11-23 15:54:00 -0500628 t->burst_limited = 0;
Vlad Yasevich289f4242007-03-22 12:26:25 -0700629 t->ssthresh = asoc->peer.i.a_rwnd;
Andrei Pelinescu-Onciul5fdd4ba2009-11-29 00:14:02 -0800630 t->rto = asoc->rto_initial;
Michele Baldessari196d6752012-12-01 04:49:42 +0000631 sctp_max_rto(asoc, t);
Vlad Yasevich749bf922007-03-19 17:02:30 -0700632 t->rtt = 0;
633 t->srtt = 0;
634 t->rttvar = 0;
635
636 /* Reset these additional varibles so that we have a clean
637 * slate.
638 */
639 t->partial_bytes_acked = 0;
640 t->flight_size = 0;
641 t->error_count = 0;
642 t->rto_pending = 0;
Vlad Yasevichfaee47c2009-02-13 08:33:43 +0000643 t->hb_sent = 0;
Vlad Yasevich749bf922007-03-19 17:02:30 -0700644
645 /* Initialize the state information for SFR-CACC */
646 t->cacc.changeover_active = 0;
647 t->cacc.cycling_changeover = 0;
648 t->cacc.next_tsn_at_change = 0;
649 t->cacc.cacc_saw_newack = 0;
650}
Michio Hondaddc4bbe2011-06-17 11:03:23 +0900651
652/* Schedule retransmission on the given transport */
653void sctp_transport_immediate_rtx(struct sctp_transport *t)
654{
655 /* Stop pending T3_rtx_timer */
Ying Xue25cc4ae2013-02-03 20:32:57 +0000656 if (del_timer(&t->T3_rtx_timer))
Michio Hondaddc4bbe2011-06-17 11:03:23 +0900657 sctp_transport_put(t);
Ying Xue25cc4ae2013-02-03 20:32:57 +0000658
Michio Hondaddc4bbe2011-06-17 11:03:23 +0900659 sctp_retransmit(&t->asoc->outqueue, t, SCTP_RTXR_T3_RTX);
660 if (!timer_pending(&t->T3_rtx_timer)) {
661 if (!mod_timer(&t->T3_rtx_timer, jiffies + t->rto))
662 sctp_transport_hold(t);
663 }
664 return;
665}