transport.c 20 KB

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