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