code style scripts/checkpatch.pl (linux-3.9-rc1) formatting
[linux-2.6.34.14-moxart.git] / net / sctp / transport.c
blob165d54e07fcd4bc571642fff9ad020411e417c00
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
8 * This file is part of the SCTP kernel implementation
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.
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.
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.
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.
31 * Please send any bug reports or fixes you make to the
32 * email address(es):
33 * lksctp developers <lksctp-developers@lists.sourceforge.net>
35 * Or submit a bug report through the following website:
36 * http://www.sf.net/projects/lksctp
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>
47 * Any bugs reported given to us we will try to fix... any fixes shared will
48 * be incorporated into the next SCTP release.
51 #include <linux/slab.h>
52 #include <linux/types.h>
53 #include <linux/random.h>
54 #include <net/sctp/sctp.h>
55 #include <net/sctp/sm.h>
57 /* 1st Level Abstractions. */
59 /* Initialize a new transport from provided memory. */
60 static struct sctp_transport *sctp_transport_init(struct sctp_transport *peer,
61 const union sctp_addr *addr,
62 gfp_t gfp)
64 /* Copy in the address. */
65 peer->ipaddr = *addr;
66 peer->af_specific = sctp_get_af_specific(addr->sa.sa_family);
67 peer->asoc = NULL;
69 peer->dst = NULL;
70 memset(&peer->saddr, 0, sizeof(union sctp_addr));
72 /* From 6.3.1 RTO Calculation:
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'.
78 peer->rto = msecs_to_jiffies(sctp_rto_initial);
79 peer->rtt = 0;
80 peer->rttvar = 0;
81 peer->srtt = 0;
82 peer->rto_pending = 0;
83 peer->hb_sent = 0;
84 peer->fast_recovery = 0;
86 peer->last_time_heard = jiffies;
87 peer->last_time_ecne_reduced = jiffies;
89 peer->init_sent_count = 0;
91 peer->param_flags = SPP_HB_DISABLE |
92 SPP_PMTUD_ENABLE |
93 SPP_SACKDELAY_ENABLE;
94 peer->hbinterval = 0;
96 /* Initialize the default path max_retrans. */
97 peer->pathmaxrxt = sctp_max_retrans_path;
98 peer->error_count = 0;
100 INIT_LIST_HEAD(&peer->transmitted);
101 INIT_LIST_HEAD(&peer->send_ready);
102 INIT_LIST_HEAD(&peer->transports);
104 peer->T3_rtx_timer.expires = 0;
105 peer->hb_timer.expires = 0;
107 setup_timer(&peer->T3_rtx_timer, sctp_generate_t3_rtx_event,
108 (unsigned long)peer);
109 setup_timer(&peer->hb_timer, sctp_generate_heartbeat_event,
110 (unsigned long)peer);
111 setup_timer(&peer->proto_unreach_timer,
112 sctp_generate_proto_unreach_event, (unsigned long)peer);
114 /* Initialize the 64-bit random nonce sent with heartbeat. */
115 get_random_bytes(&peer->hb_nonce, sizeof(peer->hb_nonce));
117 atomic_set(&peer->refcnt, 1);
118 peer->dead = 0;
120 peer->malloced = 0;
122 /* Initialize the state information for SFR-CACC */
123 peer->cacc.changeover_active = 0;
124 peer->cacc.cycling_changeover = 0;
125 peer->cacc.next_tsn_at_change = 0;
126 peer->cacc.cacc_saw_newack = 0;
128 return peer;
131 /* Allocate and initialize a new transport. */
132 struct sctp_transport *sctp_transport_new(const union sctp_addr *addr,
133 gfp_t gfp)
135 struct sctp_transport *transport;
137 transport = t_new(struct sctp_transport, gfp);
138 if (!transport)
139 goto fail;
141 if (!sctp_transport_init(transport, addr, gfp))
142 goto fail_init;
144 transport->malloced = 1;
145 SCTP_DBG_OBJCNT_INC(transport);
147 return transport;
149 fail_init:
150 kfree(transport);
152 fail:
153 return NULL;
156 /* This transport is no longer needed. Free up if possible, or
157 * delay until it last reference count.
159 void sctp_transport_free(struct sctp_transport *transport)
161 transport->dead = 1;
163 /* Try to delete the heartbeat timer. */
164 if (del_timer(&transport->hb_timer))
165 sctp_transport_put(transport);
167 /* Delete the T3_rtx timer if it's active.
168 * There is no point in not doing this now and letting
169 * structure hang around in memory since we know
170 * the tranport is going away.
172 if (timer_pending(&transport->T3_rtx_timer) &&
173 del_timer(&transport->T3_rtx_timer))
174 sctp_transport_put(transport);
176 /* Delete the ICMP proto unreachable timer if it's active. */
177 if (timer_pending(&transport->proto_unreach_timer) &&
178 del_timer(&transport->proto_unreach_timer))
179 sctp_association_put(transport->asoc);
181 sctp_transport_put(transport);
184 /* Destroy the transport data structure.
185 * Assumes there are no more users of this structure.
187 static void sctp_transport_destroy(struct sctp_transport *transport)
189 SCTP_ASSERT(transport->dead, "Transport is not dead", return);
191 if (transport->asoc)
192 sctp_association_put(transport->asoc);
194 sctp_packet_free(&transport->packet);
196 dst_release(transport->dst);
197 kfree(transport);
198 SCTP_DBG_OBJCNT_DEC(transport);
201 /* Start T3_rtx timer if it is not already running and update the heartbeat
202 * timer. This routine is called every time a DATA chunk is sent.
204 void sctp_transport_reset_timers(struct sctp_transport *transport, int force)
206 /* RFC 2960 6.3.2 Retransmission Timer Rules
208 * R1) Every time a DATA chunk is sent to any address(including a
209 * retransmission), if the T3-rtx timer of that address is not running
210 * start it running so that it will expire after the RTO of that
211 * address.
214 if (force || !timer_pending(&transport->T3_rtx_timer))
215 if (!mod_timer(&transport->T3_rtx_timer,
216 jiffies + transport->rto))
217 sctp_transport_hold(transport);
219 /* When a data chunk is sent, reset the heartbeat interval. */
220 if (!mod_timer(&transport->hb_timer,
221 sctp_transport_timeout(transport)))
222 sctp_transport_hold(transport);
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.
229 void sctp_transport_set_owner(struct sctp_transport *transport,
230 struct sctp_association *asoc)
232 transport->asoc = asoc;
233 sctp_association_hold(asoc);
236 /* Initialize the pmtu of a transport. */
237 void sctp_transport_pmtu(struct sctp_transport *transport)
239 struct dst_entry *dst;
241 dst = transport->af_specific->get_dst(NULL, &transport->ipaddr, NULL);
243 if (dst) {
244 transport->pathmtu = dst_mtu(dst);
245 dst_release(dst);
246 } else
247 transport->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
250 /* this is a complete rip-off from __sk_dst_check
251 * the cookie is always 0 since this is how it's used in the
252 * pmtu code
254 static struct dst_entry *sctp_transport_dst_check(struct sctp_transport *t)
256 struct dst_entry *dst = t->dst;
258 if (dst && dst->obsolete && dst->ops->check(dst, 0) == NULL) {
259 dst_release(t->dst);
260 t->dst = NULL;
261 return NULL;
264 return dst;
267 void sctp_transport_update_pmtu(struct sctp_transport *t, u32 pmtu)
269 struct dst_entry *dst;
271 if (unlikely(pmtu < SCTP_DEFAULT_MINSEGMENT)) {
272 printk(KERN_WARNING "%s: Reported pmtu %d too low, "
273 "using default minimum of %d\n",
274 __func__, pmtu,
275 SCTP_DEFAULT_MINSEGMENT);
276 /* Use default minimum segment size and disable
277 * pmtu discovery on this transport.
279 t->pathmtu = SCTP_DEFAULT_MINSEGMENT;
280 } else {
281 t->pathmtu = pmtu;
284 dst = sctp_transport_dst_check(t);
285 if (dst)
286 dst->ops->update_pmtu(dst, pmtu);
289 /* Caches the dst entry and source address for a transport's destination
290 * address.
292 void sctp_transport_route(struct sctp_transport *transport,
293 union sctp_addr *saddr, struct sctp_sock *opt)
295 struct sctp_association *asoc = transport->asoc;
296 struct sctp_af *af = transport->af_specific;
297 union sctp_addr *daddr = &transport->ipaddr;
298 struct dst_entry *dst;
300 dst = af->get_dst(asoc, daddr, saddr);
302 if (saddr)
303 memcpy(&transport->saddr, saddr, sizeof(union sctp_addr));
304 else
305 af->get_saddr(opt, asoc, dst, daddr, &transport->saddr);
307 transport->dst = dst;
308 if ((transport->param_flags & SPP_PMTUD_DISABLE) && transport->pathmtu) {
309 return;
311 if (dst) {
312 transport->pathmtu = dst_mtu(dst);
314 /* Initialize sk->sk_rcv_saddr, if the transport is the
315 * association's active path for getsockname().
317 if (asoc && (!asoc->peer.primary_path ||
318 (transport == asoc->peer.active_path)))
319 opt->pf->af->to_sk_saddr(&transport->saddr,
320 asoc->base.sk);
321 } else
322 transport->pathmtu = SCTP_DEFAULT_MAXSEGMENT;
325 /* Hold a reference to a transport. */
326 void sctp_transport_hold(struct sctp_transport *transport)
328 atomic_inc(&transport->refcnt);
331 /* Release a reference to a transport and clean up
332 * if there are no more references.
334 void sctp_transport_put(struct sctp_transport *transport)
336 if (atomic_dec_and_test(&transport->refcnt))
337 sctp_transport_destroy(transport);
340 /* Update transport's RTO based on the newly calculated RTT. */
341 void sctp_transport_update_rto(struct sctp_transport *tp, __u32 rtt)
343 /* Check for valid transport. */
344 SCTP_ASSERT(tp, "NULL transport", return);
346 /* We should not be doing any RTO updates unless rto_pending is set. */
347 SCTP_ASSERT(tp->rto_pending, "rto_pending not set", return);
349 if (tp->rttvar || tp->srtt) {
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'
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.
361 tp->rttvar = tp->rttvar - (tp->rttvar >> sctp_rto_beta)
362 + ((abs(tp->srtt - rtt)) >> sctp_rto_beta);
363 tp->srtt = tp->srtt - (tp->srtt >> sctp_rto_alpha)
364 + (rtt >> 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.
369 tp->srtt = rtt;
370 tp->rttvar = rtt >> 1;
373 /* 6.3.1 G1) Whenever RTTVAR is computed, if RTTVAR = 0, then
374 * adjust RTTVAR <- G, where G is the CLOCK GRANULARITY.
376 if (tp->rttvar == 0)
377 tp->rttvar = SCTP_CLOCK_GRANULARITY;
379 /* 6.3.1 C3) After the computation, update RTO <- SRTT + 4 * RTTVAR. */
380 tp->rto = tp->srtt + (tp->rttvar << 2);
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.
385 if (tp->rto < tp->asoc->rto_min)
386 tp->rto = tp->asoc->rto_min;
388 /* 6.3.1 C7) A maximum value may be placed on RTO provided it is
389 * at least RTO.max seconds.
391 if (tp->rto > tp->asoc->rto_max)
392 tp->rto = tp->asoc->rto_max;
394 tp->rtt = rtt;
396 /* Reset rto_pending so that a new RTT measurement is started when a
397 * new data chunk is sent.
399 tp->rto_pending = 0;
401 SCTP_DEBUG_PRINTK("%s: transport: %p, rtt: %d, srtt: %d "
402 "rttvar: %d, rto: %ld\n", __func__,
403 tp, rtt, tp->srtt, tp->rttvar, tp->rto);
406 /* This routine updates the transport's cwnd and partial_bytes_acked
407 * parameters based on the bytes acked in the received SACK.
409 void sctp_transport_raise_cwnd(struct sctp_transport *transport,
410 __u32 sack_ctsn, __u32 bytes_acked)
412 __u32 cwnd, ssthresh, flight_size, pba, pmtu;
414 cwnd = transport->cwnd;
415 flight_size = transport->flight_size;
417 /* See if we need to exit Fast Recovery first */
418 if (transport->fast_recovery &&
419 TSN_lte(transport->fast_recovery_exit, sack_ctsn))
420 transport->fast_recovery = 0;
422 /* The appropriate cwnd increase algorithm is performed if, and only
423 * if the cumulative TSN whould advanced and the congestion window is
424 * being fully utilized.
426 if (TSN_lte(sack_ctsn, transport->asoc->ctsn_ack_point) ||
427 (flight_size < cwnd))
428 return;
430 ssthresh = transport->ssthresh;
431 pba = transport->partial_bytes_acked;
432 pmtu = transport->asoc->pathmtu;
434 if (cwnd <= ssthresh) {
435 /* RFC 4960 7.2.1
436 * o When cwnd is less than or equal to ssthresh, an SCTP
437 * endpoint MUST use the slow-start algorithm to increase
438 * cwnd only if the current congestion window is being fully
439 * utilized, an incoming SACK advances the Cumulative TSN
440 * Ack Point, and the data sender is not in Fast Recovery.
441 * Only when these three conditions are met can the cwnd be
442 * increased; otherwise, the cwnd MUST not be increased.
443 * If these conditions are met, then cwnd MUST be increased
444 * by, at most, the lesser of 1) the total size of the
445 * previously outstanding DATA chunk(s) acknowledged, and
446 * 2) the destination's path MTU. This upper bound protects
447 * against the ACK-Splitting attack outlined in [SAVAGE99].
449 if (transport->fast_recovery)
450 return;
452 if (bytes_acked > pmtu)
453 cwnd += pmtu;
454 else
455 cwnd += bytes_acked;
456 SCTP_DEBUG_PRINTK("%s: SLOW START: transport: %p, "
457 "bytes_acked: %d, cwnd: %d, ssthresh: %d, "
458 "flight_size: %d, pba: %d\n",
459 __func__,
460 transport, bytes_acked, cwnd,
461 ssthresh, flight_size, pba);
462 } else {
463 /* RFC 2960 7.2.2 Whenever cwnd is greater than ssthresh,
464 * upon each SACK arrival that advances the Cumulative TSN Ack
465 * Point, increase partial_bytes_acked by the total number of
466 * bytes of all new chunks acknowledged in that SACK including
467 * chunks acknowledged by the new Cumulative TSN Ack and by
468 * Gap Ack Blocks.
470 * When partial_bytes_acked is equal to or greater than cwnd
471 * and before the arrival of the SACK the sender had cwnd or
472 * more bytes of data outstanding (i.e., before arrival of the
473 * SACK, flightsize was greater than or equal to cwnd),
474 * increase cwnd by MTU, and reset partial_bytes_acked to
475 * (partial_bytes_acked - cwnd).
477 pba += bytes_acked;
478 if (pba >= cwnd) {
479 cwnd += pmtu;
480 pba = ((cwnd < pba) ? (pba - cwnd) : 0);
482 SCTP_DEBUG_PRINTK("%s: CONGESTION AVOIDANCE: "
483 "transport: %p, bytes_acked: %d, cwnd: %d, "
484 "ssthresh: %d, flight_size: %d, pba: %d\n",
485 __func__,
486 transport, bytes_acked, cwnd,
487 ssthresh, flight_size, pba);
490 transport->cwnd = cwnd;
491 transport->partial_bytes_acked = pba;
494 /* This routine is used to lower the transport's cwnd when congestion is
495 * detected.
497 void sctp_transport_lower_cwnd(struct sctp_transport *transport,
498 sctp_lower_cwnd_t reason)
500 switch (reason) {
501 case SCTP_LOWER_CWND_T3_RTX:
502 /* RFC 2960 Section 7.2.3, sctpimpguide
503 * When the T3-rtx timer expires on an address, SCTP should
504 * perform slow start by:
505 * ssthresh = max(cwnd/2, 4*MTU)
506 * cwnd = 1*MTU
507 * partial_bytes_acked = 0
509 transport->ssthresh = max(transport->cwnd/2,
510 4*transport->asoc->pathmtu);
511 transport->cwnd = transport->asoc->pathmtu;
513 /* T3-rtx also clears fast recovery on the transport */
514 transport->fast_recovery = 0;
515 break;
517 case SCTP_LOWER_CWND_FAST_RTX:
518 /* RFC 2960 7.2.4 Adjust the ssthresh and cwnd of the
519 * destination address(es) to which the missing DATA chunks
520 * were last sent, according to the formula described in
521 * Section 7.2.3.
523 * RFC 2960 7.2.3, sctpimpguide Upon detection of packet
524 * losses from SACK (see Section 7.2.4), An endpoint
525 * should do the following:
526 * ssthresh = max(cwnd/2, 4*MTU)
527 * cwnd = ssthresh
528 * partial_bytes_acked = 0
530 if (transport->fast_recovery)
531 return;
533 /* Mark Fast recovery */
534 transport->fast_recovery = 1;
535 transport->fast_recovery_exit = transport->asoc->next_tsn - 1;
537 transport->ssthresh = max(transport->cwnd/2,
538 4*transport->asoc->pathmtu);
539 transport->cwnd = transport->ssthresh;
540 break;
542 case SCTP_LOWER_CWND_ECNE:
543 /* RFC 2481 Section 6.1.2.
544 * If the sender receives an ECN-Echo ACK packet
545 * then the sender knows that congestion was encountered in the
546 * network on the path from the sender to the receiver. The
547 * indication of congestion should be treated just as a
548 * congestion loss in non-ECN Capable TCP. That is, the TCP
549 * source halves the congestion window "cwnd" and reduces the
550 * slow start threshold "ssthresh".
551 * A critical condition is that TCP does not react to
552 * congestion indications more than once every window of
553 * data (or more loosely more than once every round-trip time).
555 if (time_after(jiffies, transport->last_time_ecne_reduced +
556 transport->rtt)) {
557 transport->ssthresh = max(transport->cwnd/2,
558 4*transport->asoc->pathmtu);
559 transport->cwnd = transport->ssthresh;
560 transport->last_time_ecne_reduced = jiffies;
562 break;
564 case SCTP_LOWER_CWND_INACTIVE:
565 /* RFC 2960 Section 7.2.1, sctpimpguide
566 * When the endpoint does not transmit data on a given
567 * transport address, the cwnd of the transport address
568 * should be adjusted to max(cwnd/2, 4*MTU) per RTO.
569 * NOTE: Although the draft recommends that this check needs
570 * to be done every RTO interval, we do it every hearbeat
571 * interval.
573 transport->cwnd = max(transport->cwnd/2,
574 4*transport->asoc->pathmtu);
575 break;
578 transport->partial_bytes_acked = 0;
579 SCTP_DEBUG_PRINTK("%s: transport: %p reason: %d cwnd: "
580 "%d ssthresh: %d\n", __func__,
581 transport, reason,
582 transport->cwnd, transport->ssthresh);
585 /* Apply Max.Burst limit to the congestion window:
586 * sctpimpguide-05 2.14.2
587 * D) When the time comes for the sender to
588 * transmit new DATA chunks, the protocol parameter Max.Burst MUST
589 * first be applied to limit how many new DATA chunks may be sent.
590 * The limit is applied by adjusting cwnd as follows:
591 * if ((flightsize+ Max.Burst * MTU) < cwnd)
592 * cwnd = flightsize + Max.Burst * MTU
595 void sctp_transport_burst_limited(struct sctp_transport *t)
597 struct sctp_association *asoc = t->asoc;
598 u32 old_cwnd = t->cwnd;
599 u32 max_burst_bytes;
601 if (t->burst_limited)
602 return;
604 max_burst_bytes = t->flight_size + (asoc->max_burst * asoc->pathmtu);
605 if (max_burst_bytes < old_cwnd) {
606 t->cwnd = max_burst_bytes;
607 t->burst_limited = old_cwnd;
611 /* Restore the old cwnd congestion window, after the burst had it's
612 * desired effect.
614 void sctp_transport_burst_reset(struct sctp_transport *t)
616 if (t->burst_limited) {
617 t->cwnd = t->burst_limited;
618 t->burst_limited = 0;
622 /* What is the next timeout value for this transport? */
623 unsigned long sctp_transport_timeout(struct sctp_transport *t)
625 unsigned long timeout;
626 timeout = t->rto + sctp_jitter(t->rto);
627 if (t->state != SCTP_UNCONFIRMED)
628 timeout += t->hbinterval;
629 timeout += jiffies;
630 return timeout;
633 /* Reset transport variables to their initial values */
634 void sctp_transport_reset(struct sctp_transport *t)
636 struct sctp_association *asoc = t->asoc;
638 /* RFC 2960 (bis), Section 5.2.4
639 * All the congestion control parameters (e.g., cwnd, ssthresh)
640 * related to this peer MUST be reset to their initial values
641 * (see Section 6.2.1)
643 t->cwnd = min(4*asoc->pathmtu, max_t(__u32, 2*asoc->pathmtu, 4380));
644 t->burst_limited = 0;
645 t->ssthresh = asoc->peer.i.a_rwnd;
646 t->rto = asoc->rto_initial;
647 t->rtt = 0;
648 t->srtt = 0;
649 t->rttvar = 0;
651 /* Reset these additional varibles so that we have a clean
652 * slate.
654 t->partial_bytes_acked = 0;
655 t->flight_size = 0;
656 t->error_count = 0;
657 t->rto_pending = 0;
658 t->hb_sent = 0;
659 t->fast_recovery = 0;
661 /* Initialize the state information for SFR-CACC */
662 t->cacc.changeover_active = 0;
663 t->cacc.cycling_changeover = 0;
664 t->cacc.next_tsn_at_change = 0;
665 t->cacc.cacc_saw_newack = 0;