]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* SCTP kernel reference 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 reference 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 | * The SCTP reference 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 | * The SCTP reference 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, 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 | ||
51 | #include <linux/types.h> | |
52 | #include <net/sctp/sctp.h> | |
53 | #include <net/sctp/sm.h> | |
54 | ||
55 | /* 1st Level Abstractions. */ | |
56 | ||
57 | /* Initialize a new transport from provided memory. */ | |
58 | static struct sctp_transport *sctp_transport_init(struct sctp_transport *peer, | |
59 | const union sctp_addr *addr, | |
dd0fc66f | 60 | gfp_t gfp) |
1da177e4 LT |
61 | { |
62 | /* Copy in the address. */ | |
63 | peer->ipaddr = *addr; | |
64 | peer->af_specific = sctp_get_af_specific(addr->sa.sa_family); | |
65 | peer->asoc = NULL; | |
66 | ||
67 | peer->dst = NULL; | |
68 | memset(&peer->saddr, 0, sizeof(union sctp_addr)); | |
69 | ||
70 | /* From 6.3.1 RTO Calculation: | |
71 | * | |
72 | * C1) Until an RTT measurement has been made for a packet sent to the | |
73 | * given destination transport address, set RTO to the protocol | |
74 | * parameter 'RTO.Initial'. | |
75 | */ | |
76 | peer->rtt = 0; | |
77 | peer->rto = sctp_rto_initial; | |
78 | peer->rttvar = 0; | |
79 | peer->srtt = 0; | |
80 | peer->rto_pending = 0; | |
81 | ||
82 | peer->last_time_heard = jiffies; | |
83 | peer->last_time_used = jiffies; | |
84 | peer->last_time_ecne_reduced = jiffies; | |
85 | ||
3f7a87d2 FF |
86 | peer->init_sent_count = 0; |
87 | ||
88 | peer->state = SCTP_ACTIVE; | |
1da177e4 LT |
89 | peer->hb_allowed = 0; |
90 | ||
91 | /* Initialize the default path max_retrans. */ | |
92 | peer->max_retrans = sctp_max_retrans_path; | |
93 | peer->error_count = 0; | |
94 | ||
95 | INIT_LIST_HEAD(&peer->transmitted); | |
96 | INIT_LIST_HEAD(&peer->send_ready); | |
97 | INIT_LIST_HEAD(&peer->transports); | |
98 | ||
99 | /* Set up the retransmission timer. */ | |
100 | init_timer(&peer->T3_rtx_timer); | |
101 | peer->T3_rtx_timer.function = sctp_generate_t3_rtx_event; | |
102 | peer->T3_rtx_timer.data = (unsigned long)peer; | |
103 | ||
104 | /* Set up the heartbeat timer. */ | |
105 | init_timer(&peer->hb_timer); | |
1da177e4 LT |
106 | peer->hb_timer.function = sctp_generate_heartbeat_event; |
107 | peer->hb_timer.data = (unsigned long)peer; | |
108 | ||
109 | atomic_set(&peer->refcnt, 1); | |
110 | peer->dead = 0; | |
111 | ||
112 | peer->malloced = 0; | |
113 | ||
114 | /* Initialize the state information for SFR-CACC */ | |
115 | peer->cacc.changeover_active = 0; | |
116 | peer->cacc.cycling_changeover = 0; | |
117 | peer->cacc.next_tsn_at_change = 0; | |
118 | peer->cacc.cacc_saw_newack = 0; | |
119 | ||
120 | return peer; | |
121 | } | |
122 | ||
123 | /* Allocate and initialize a new transport. */ | |
3182cd84 | 124 | struct sctp_transport *sctp_transport_new(const union sctp_addr *addr, |
dd0fc66f | 125 | gfp_t gfp) |
1da177e4 LT |
126 | { |
127 | struct sctp_transport *transport; | |
128 | ||
129 | transport = t_new(struct sctp_transport, gfp); | |
130 | if (!transport) | |
131 | goto fail; | |
132 | ||
133 | if (!sctp_transport_init(transport, addr, gfp)) | |
134 | goto fail_init; | |
135 | ||
136 | transport->malloced = 1; | |
137 | SCTP_DBG_OBJCNT_INC(transport); | |
138 | ||
139 | return transport; | |
140 | ||
141 | fail_init: | |
142 | kfree(transport); | |
143 | ||
144 | fail: | |
145 | return NULL; | |
146 | } | |
147 | ||
148 | /* This transport is no longer needed. Free up if possible, or | |
149 | * delay until it last reference count. | |
150 | */ | |
151 | void sctp_transport_free(struct sctp_transport *transport) | |
152 | { | |
153 | transport->dead = 1; | |
154 | ||
155 | /* Try to delete the heartbeat timer. */ | |
156 | if (del_timer(&transport->hb_timer)) | |
157 | sctp_transport_put(transport); | |
158 | ||
159 | /* Delete the T3_rtx timer if it's active. | |
160 | * There is no point in not doing this now and letting | |
161 | * structure hang around in memory since we know | |
162 | * the tranport is going away. | |
163 | */ | |
164 | if (timer_pending(&transport->T3_rtx_timer) && | |
165 | del_timer(&transport->T3_rtx_timer)) | |
166 | sctp_transport_put(transport); | |
167 | ||
168 | ||
169 | sctp_transport_put(transport); | |
170 | } | |
171 | ||
172 | /* Destroy the transport data structure. | |
173 | * Assumes there are no more users of this structure. | |
174 | */ | |
175 | static void sctp_transport_destroy(struct sctp_transport *transport) | |
176 | { | |
177 | SCTP_ASSERT(transport->dead, "Transport is not dead", return); | |
178 | ||
179 | if (transport->asoc) | |
180 | sctp_association_put(transport->asoc); | |
181 | ||
182 | sctp_packet_free(&transport->packet); | |
183 | ||
184 | dst_release(transport->dst); | |
185 | kfree(transport); | |
186 | SCTP_DBG_OBJCNT_DEC(transport); | |
187 | } | |
188 | ||
189 | /* Start T3_rtx timer if it is not already running and update the heartbeat | |
190 | * timer. This routine is called every time a DATA chunk is sent. | |
191 | */ | |
192 | void sctp_transport_reset_timers(struct sctp_transport *transport) | |
193 | { | |
194 | /* RFC 2960 6.3.2 Retransmission Timer Rules | |
195 | * | |
196 | * R1) Every time a DATA chunk is sent to any address(including a | |
197 | * retransmission), if the T3-rtx timer of that address is not running | |
198 | * start it running so that it will expire after the RTO of that | |
199 | * address. | |
200 | */ | |
201 | ||
202 | if (!timer_pending(&transport->T3_rtx_timer)) | |
203 | if (!mod_timer(&transport->T3_rtx_timer, | |
204 | jiffies + transport->rto)) | |
205 | sctp_transport_hold(transport); | |
206 | ||
207 | /* When a data chunk is sent, reset the heartbeat interval. */ | |
208 | if (!mod_timer(&transport->hb_timer, | |
209 | sctp_transport_timeout(transport))) | |
210 | sctp_transport_hold(transport); | |
211 | } | |
212 | ||
213 | /* This transport has been assigned to an association. | |
214 | * Initialize fields from the association or from the sock itself. | |
215 | * Register the reference count in the association. | |
216 | */ | |
217 | void sctp_transport_set_owner(struct sctp_transport *transport, | |
218 | struct sctp_association *asoc) | |
219 | { | |
220 | transport->asoc = asoc; | |
221 | sctp_association_hold(asoc); | |
222 | } | |
223 | ||
224 | /* Initialize the pmtu of a transport. */ | |
225 | void sctp_transport_pmtu(struct sctp_transport *transport) | |
226 | { | |
227 | struct dst_entry *dst; | |
228 | ||
229 | dst = transport->af_specific->get_dst(NULL, &transport->ipaddr, NULL); | |
230 | ||
231 | if (dst) { | |
232 | transport->pmtu = dst_mtu(dst); | |
233 | dst_release(dst); | |
234 | } else | |
235 | transport->pmtu = SCTP_DEFAULT_MAXSEGMENT; | |
236 | } | |
237 | ||
238 | /* Caches the dst entry and source address for a transport's destination | |
239 | * address. | |
240 | */ | |
241 | void sctp_transport_route(struct sctp_transport *transport, | |
242 | union sctp_addr *saddr, struct sctp_sock *opt) | |
243 | { | |
244 | struct sctp_association *asoc = transport->asoc; | |
245 | struct sctp_af *af = transport->af_specific; | |
246 | union sctp_addr *daddr = &transport->ipaddr; | |
247 | struct dst_entry *dst; | |
248 | ||
249 | dst = af->get_dst(asoc, daddr, saddr); | |
250 | ||
251 | if (saddr) | |
252 | memcpy(&transport->saddr, saddr, sizeof(union sctp_addr)); | |
253 | else | |
254 | af->get_saddr(asoc, dst, daddr, &transport->saddr); | |
255 | ||
256 | transport->dst = dst; | |
257 | if (dst) { | |
258 | transport->pmtu = dst_mtu(dst); | |
259 | ||
260 | /* Initialize sk->sk_rcv_saddr, if the transport is the | |
261 | * association's active path for getsockname(). | |
262 | */ | |
263 | if (asoc && (transport == asoc->peer.active_path)) | |
bf031fff NH |
264 | opt->pf->af->to_sk_saddr(&transport->saddr, |
265 | asoc->base.sk); | |
1da177e4 LT |
266 | } else |
267 | transport->pmtu = SCTP_DEFAULT_MAXSEGMENT; | |
268 | } | |
269 | ||
270 | /* Hold a reference to a transport. */ | |
271 | void sctp_transport_hold(struct sctp_transport *transport) | |
272 | { | |
273 | atomic_inc(&transport->refcnt); | |
274 | } | |
275 | ||
276 | /* Release a reference to a transport and clean up | |
277 | * if there are no more references. | |
278 | */ | |
279 | void sctp_transport_put(struct sctp_transport *transport) | |
280 | { | |
281 | if (atomic_dec_and_test(&transport->refcnt)) | |
282 | sctp_transport_destroy(transport); | |
283 | } | |
284 | ||
285 | /* Update transport's RTO based on the newly calculated RTT. */ | |
286 | void sctp_transport_update_rto(struct sctp_transport *tp, __u32 rtt) | |
287 | { | |
288 | /* Check for valid transport. */ | |
289 | SCTP_ASSERT(tp, "NULL transport", return); | |
290 | ||
291 | /* We should not be doing any RTO updates unless rto_pending is set. */ | |
292 | SCTP_ASSERT(tp->rto_pending, "rto_pending not set", return); | |
293 | ||
294 | if (tp->rttvar || tp->srtt) { | |
295 | /* 6.3.1 C3) When a new RTT measurement R' is made, set | |
296 | * RTTVAR <- (1 - RTO.Beta) * RTTVAR + RTO.Beta * |SRTT - R'| | |
297 | * SRTT <- (1 - RTO.Alpha) * SRTT + RTO.Alpha * R' | |
298 | */ | |
299 | ||
300 | /* Note: The above algorithm has been rewritten to | |
301 | * express rto_beta and rto_alpha as inverse powers | |
302 | * of two. | |
303 | * For example, assuming the default value of RTO.Alpha of | |
304 | * 1/8, rto_alpha would be expressed as 3. | |
305 | */ | |
306 | tp->rttvar = tp->rttvar - (tp->rttvar >> sctp_rto_beta) | |
307 | + ((abs(tp->srtt - rtt)) >> sctp_rto_beta); | |
308 | tp->srtt = tp->srtt - (tp->srtt >> sctp_rto_alpha) | |
309 | + (rtt >> sctp_rto_alpha); | |
310 | } else { | |
311 | /* 6.3.1 C2) When the first RTT measurement R is made, set | |
312 | * SRTT <- R, RTTVAR <- R/2. | |
313 | */ | |
314 | tp->srtt = rtt; | |
315 | tp->rttvar = rtt >> 1; | |
316 | } | |
317 | ||
318 | /* 6.3.1 G1) Whenever RTTVAR is computed, if RTTVAR = 0, then | |
319 | * adjust RTTVAR <- G, where G is the CLOCK GRANULARITY. | |
320 | */ | |
321 | if (tp->rttvar == 0) | |
322 | tp->rttvar = SCTP_CLOCK_GRANULARITY; | |
323 | ||
324 | /* 6.3.1 C3) After the computation, update RTO <- SRTT + 4 * RTTVAR. */ | |
325 | tp->rto = tp->srtt + (tp->rttvar << 2); | |
326 | ||
327 | /* 6.3.1 C6) Whenever RTO is computed, if it is less than RTO.Min | |
328 | * seconds then it is rounded up to RTO.Min seconds. | |
329 | */ | |
330 | if (tp->rto < tp->asoc->rto_min) | |
331 | tp->rto = tp->asoc->rto_min; | |
332 | ||
333 | /* 6.3.1 C7) A maximum value may be placed on RTO provided it is | |
334 | * at least RTO.max seconds. | |
335 | */ | |
336 | if (tp->rto > tp->asoc->rto_max) | |
337 | tp->rto = tp->asoc->rto_max; | |
338 | ||
339 | tp->rtt = rtt; | |
340 | ||
341 | /* Reset rto_pending so that a new RTT measurement is started when a | |
342 | * new data chunk is sent. | |
343 | */ | |
344 | tp->rto_pending = 0; | |
345 | ||
346 | SCTP_DEBUG_PRINTK("%s: transport: %p, rtt: %d, srtt: %d " | |
347 | "rttvar: %d, rto: %d\n", __FUNCTION__, | |
348 | tp, rtt, tp->srtt, tp->rttvar, tp->rto); | |
349 | } | |
350 | ||
351 | /* This routine updates the transport's cwnd and partial_bytes_acked | |
352 | * parameters based on the bytes acked in the received SACK. | |
353 | */ | |
354 | void sctp_transport_raise_cwnd(struct sctp_transport *transport, | |
355 | __u32 sack_ctsn, __u32 bytes_acked) | |
356 | { | |
357 | __u32 cwnd, ssthresh, flight_size, pba, pmtu; | |
358 | ||
359 | cwnd = transport->cwnd; | |
360 | flight_size = transport->flight_size; | |
361 | ||
362 | /* The appropriate cwnd increase algorithm is performed if, and only | |
363 | * if the cumulative TSN has advanced and the congestion window is | |
364 | * being fully utilized. | |
365 | */ | |
366 | if ((transport->asoc->ctsn_ack_point >= sack_ctsn) || | |
367 | (flight_size < cwnd)) | |
368 | return; | |
369 | ||
370 | ssthresh = transport->ssthresh; | |
371 | pba = transport->partial_bytes_acked; | |
372 | pmtu = transport->asoc->pmtu; | |
373 | ||
374 | if (cwnd <= ssthresh) { | |
375 | /* RFC 2960 7.2.1, sctpimpguide-05 2.14.2 When cwnd is less | |
376 | * than or equal to ssthresh an SCTP endpoint MUST use the | |
377 | * slow start algorithm to increase cwnd only if the current | |
378 | * congestion window is being fully utilized and an incoming | |
379 | * SACK advances the Cumulative TSN Ack Point. Only when these | |
380 | * two conditions are met can the cwnd be increased otherwise | |
381 | * the cwnd MUST not be increased. If these conditions are met | |
382 | * then cwnd MUST be increased by at most the lesser of | |
383 | * 1) the total size of the previously outstanding DATA | |
384 | * chunk(s) acknowledged, and 2) the destination's path MTU. | |
385 | */ | |
386 | if (bytes_acked > pmtu) | |
387 | cwnd += pmtu; | |
388 | else | |
389 | cwnd += bytes_acked; | |
390 | SCTP_DEBUG_PRINTK("%s: SLOW START: transport: %p, " | |
391 | "bytes_acked: %d, cwnd: %d, ssthresh: %d, " | |
392 | "flight_size: %d, pba: %d\n", | |
393 | __FUNCTION__, | |
394 | transport, bytes_acked, cwnd, | |
395 | ssthresh, flight_size, pba); | |
396 | } else { | |
397 | /* RFC 2960 7.2.2 Whenever cwnd is greater than ssthresh, | |
398 | * upon each SACK arrival that advances the Cumulative TSN Ack | |
399 | * Point, increase partial_bytes_acked by the total number of | |
400 | * bytes of all new chunks acknowledged in that SACK including | |
401 | * chunks acknowledged by the new Cumulative TSN Ack and by | |
402 | * Gap Ack Blocks. | |
403 | * | |
404 | * When partial_bytes_acked is equal to or greater than cwnd | |
405 | * and before the arrival of the SACK the sender had cwnd or | |
406 | * more bytes of data outstanding (i.e., before arrival of the | |
407 | * SACK, flightsize was greater than or equal to cwnd), | |
408 | * increase cwnd by MTU, and reset partial_bytes_acked to | |
409 | * (partial_bytes_acked - cwnd). | |
410 | */ | |
411 | pba += bytes_acked; | |
412 | if (pba >= cwnd) { | |
413 | cwnd += pmtu; | |
414 | pba = ((cwnd < pba) ? (pba - cwnd) : 0); | |
415 | } | |
416 | SCTP_DEBUG_PRINTK("%s: CONGESTION AVOIDANCE: " | |
417 | "transport: %p, bytes_acked: %d, cwnd: %d, " | |
418 | "ssthresh: %d, flight_size: %d, pba: %d\n", | |
419 | __FUNCTION__, | |
420 | transport, bytes_acked, cwnd, | |
421 | ssthresh, flight_size, pba); | |
422 | } | |
423 | ||
424 | transport->cwnd = cwnd; | |
425 | transport->partial_bytes_acked = pba; | |
426 | } | |
427 | ||
428 | /* This routine is used to lower the transport's cwnd when congestion is | |
429 | * detected. | |
430 | */ | |
431 | void sctp_transport_lower_cwnd(struct sctp_transport *transport, | |
432 | sctp_lower_cwnd_t reason) | |
433 | { | |
434 | switch (reason) { | |
435 | case SCTP_LOWER_CWND_T3_RTX: | |
436 | /* RFC 2960 Section 7.2.3, sctpimpguide | |
437 | * When the T3-rtx timer expires on an address, SCTP should | |
438 | * perform slow start by: | |
439 | * ssthresh = max(cwnd/2, 4*MTU) | |
440 | * cwnd = 1*MTU | |
441 | * partial_bytes_acked = 0 | |
442 | */ | |
443 | transport->ssthresh = max(transport->cwnd/2, | |
444 | 4*transport->asoc->pmtu); | |
445 | transport->cwnd = transport->asoc->pmtu; | |
446 | break; | |
447 | ||
448 | case SCTP_LOWER_CWND_FAST_RTX: | |
449 | /* RFC 2960 7.2.4 Adjust the ssthresh and cwnd of the | |
450 | * destination address(es) to which the missing DATA chunks | |
451 | * were last sent, according to the formula described in | |
452 | * Section 7.2.3. | |
453 | * | |
454 | * RFC 2960 7.2.3, sctpimpguide Upon detection of packet | |
455 | * losses from SACK (see Section 7.2.4), An endpoint | |
456 | * should do the following: | |
457 | * ssthresh = max(cwnd/2, 4*MTU) | |
458 | * cwnd = ssthresh | |
459 | * partial_bytes_acked = 0 | |
460 | */ | |
461 | transport->ssthresh = max(transport->cwnd/2, | |
462 | 4*transport->asoc->pmtu); | |
463 | transport->cwnd = transport->ssthresh; | |
464 | break; | |
465 | ||
466 | case SCTP_LOWER_CWND_ECNE: | |
467 | /* RFC 2481 Section 6.1.2. | |
468 | * If the sender receives an ECN-Echo ACK packet | |
469 | * then the sender knows that congestion was encountered in the | |
470 | * network on the path from the sender to the receiver. The | |
471 | * indication of congestion should be treated just as a | |
472 | * congestion loss in non-ECN Capable TCP. That is, the TCP | |
473 | * source halves the congestion window "cwnd" and reduces the | |
474 | * slow start threshold "ssthresh". | |
475 | * A critical condition is that TCP does not react to | |
476 | * congestion indications more than once every window of | |
477 | * data (or more loosely more than once every round-trip time). | |
478 | */ | |
479 | if ((jiffies - transport->last_time_ecne_reduced) > | |
480 | transport->rtt) { | |
481 | transport->ssthresh = max(transport->cwnd/2, | |
482 | 4*transport->asoc->pmtu); | |
483 | transport->cwnd = transport->ssthresh; | |
484 | transport->last_time_ecne_reduced = jiffies; | |
485 | } | |
486 | break; | |
487 | ||
488 | case SCTP_LOWER_CWND_INACTIVE: | |
489 | /* RFC 2960 Section 7.2.1, sctpimpguide | |
490 | * When the endpoint does not transmit data on a given | |
491 | * transport address, the cwnd of the transport address | |
492 | * should be adjusted to max(cwnd/2, 4*MTU) per RTO. | |
493 | * NOTE: Although the draft recommends that this check needs | |
494 | * to be done every RTO interval, we do it every hearbeat | |
495 | * interval. | |
496 | */ | |
497 | if ((jiffies - transport->last_time_used) > transport->rto) | |
498 | transport->cwnd = max(transport->cwnd/2, | |
499 | 4*transport->asoc->pmtu); | |
500 | break; | |
501 | }; | |
502 | ||
503 | transport->partial_bytes_acked = 0; | |
504 | SCTP_DEBUG_PRINTK("%s: transport: %p reason: %d cwnd: " | |
505 | "%d ssthresh: %d\n", __FUNCTION__, | |
506 | transport, reason, | |
507 | transport->cwnd, transport->ssthresh); | |
508 | } | |
509 | ||
510 | /* What is the next timeout value for this transport? */ | |
511 | unsigned long sctp_transport_timeout(struct sctp_transport *t) | |
512 | { | |
513 | unsigned long timeout; | |
514 | timeout = t->hb_interval + t->rto + sctp_jitter(t->rto); | |
515 | timeout += jiffies; | |
516 | return timeout; | |
517 | } |