ccid2.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805
  1. /*
  2. * net/dccp/ccids/ccid2.c
  3. *
  4. * Copyright (c) 2005, 2006 Andrea Bittau <a.bittau@cs.ucl.ac.uk>
  5. *
  6. * Changes to meet Linux coding standards, and DCCP infrastructure fixes.
  7. *
  8. * Copyright (c) 2006 Arnaldo Carvalho de Melo <acme@conectiva.com.br>
  9. *
  10. * This program is free software; you can redistribute it and/or modify
  11. * it under the terms of the GNU General Public License as published by
  12. * the Free Software Foundation; either version 2 of the License, or
  13. * (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  18. * GNU General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public License
  21. * along with this program; if not, write to the Free Software
  22. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  23. */
  24. /*
  25. * This implementation should follow RFC 4341
  26. */
  27. #include "../ccid.h"
  28. #include "../dccp.h"
  29. #include "ccid2.h"
  30. #ifdef CONFIG_IP_DCCP_CCID2_DEBUG
  31. static int ccid2_debug;
  32. #define ccid2_pr_debug(format, a...) DCCP_PR_DEBUG(ccid2_debug, format, ##a)
  33. static void ccid2_hc_tx_check_sanity(const struct ccid2_hc_tx_sock *hctx)
  34. {
  35. int len = 0;
  36. int pipe = 0;
  37. struct ccid2_seq *seqp = hctx->ccid2hctx_seqh;
  38. /* there is data in the chain */
  39. if (seqp != hctx->ccid2hctx_seqt) {
  40. seqp = seqp->ccid2s_prev;
  41. len++;
  42. if (!seqp->ccid2s_acked)
  43. pipe++;
  44. while (seqp != hctx->ccid2hctx_seqt) {
  45. struct ccid2_seq *prev = seqp->ccid2s_prev;
  46. len++;
  47. if (!prev->ccid2s_acked)
  48. pipe++;
  49. /* packets are sent sequentially */
  50. BUG_ON(dccp_delta_seqno(seqp->ccid2s_seq,
  51. prev->ccid2s_seq ) >= 0);
  52. BUG_ON(time_before(seqp->ccid2s_sent,
  53. prev->ccid2s_sent));
  54. seqp = prev;
  55. }
  56. }
  57. BUG_ON(pipe != hctx->ccid2hctx_pipe);
  58. ccid2_pr_debug("len of chain=%d\n", len);
  59. do {
  60. seqp = seqp->ccid2s_prev;
  61. len++;
  62. } while (seqp != hctx->ccid2hctx_seqh);
  63. ccid2_pr_debug("total len=%d\n", len);
  64. BUG_ON(len != hctx->ccid2hctx_seqbufc * CCID2_SEQBUF_LEN);
  65. }
  66. #else
  67. #define ccid2_pr_debug(format, a...)
  68. #define ccid2_hc_tx_check_sanity(hctx)
  69. #endif
  70. static int ccid2_hc_tx_alloc_seq(struct ccid2_hc_tx_sock *hctx)
  71. {
  72. struct ccid2_seq *seqp;
  73. int i;
  74. /* check if we have space to preserve the pointer to the buffer */
  75. if (hctx->ccid2hctx_seqbufc >= (sizeof(hctx->ccid2hctx_seqbuf) /
  76. sizeof(struct ccid2_seq*)))
  77. return -ENOMEM;
  78. /* allocate buffer and initialize linked list */
  79. seqp = kmalloc(CCID2_SEQBUF_LEN * sizeof(struct ccid2_seq), gfp_any());
  80. if (seqp == NULL)
  81. return -ENOMEM;
  82. for (i = 0; i < (CCID2_SEQBUF_LEN - 1); i++) {
  83. seqp[i].ccid2s_next = &seqp[i + 1];
  84. seqp[i + 1].ccid2s_prev = &seqp[i];
  85. }
  86. seqp[CCID2_SEQBUF_LEN - 1].ccid2s_next = seqp;
  87. seqp->ccid2s_prev = &seqp[CCID2_SEQBUF_LEN - 1];
  88. /* This is the first allocation. Initiate the head and tail. */
  89. if (hctx->ccid2hctx_seqbufc == 0)
  90. hctx->ccid2hctx_seqh = hctx->ccid2hctx_seqt = seqp;
  91. else {
  92. /* link the existing list with the one we just created */
  93. hctx->ccid2hctx_seqh->ccid2s_next = seqp;
  94. seqp->ccid2s_prev = hctx->ccid2hctx_seqh;
  95. hctx->ccid2hctx_seqt->ccid2s_prev = &seqp[CCID2_SEQBUF_LEN - 1];
  96. seqp[CCID2_SEQBUF_LEN - 1].ccid2s_next = hctx->ccid2hctx_seqt;
  97. }
  98. /* store the original pointer to the buffer so we can free it */
  99. hctx->ccid2hctx_seqbuf[hctx->ccid2hctx_seqbufc] = seqp;
  100. hctx->ccid2hctx_seqbufc++;
  101. return 0;
  102. }
  103. static int ccid2_hc_tx_send_packet(struct sock *sk, struct sk_buff *skb)
  104. {
  105. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  106. if (hctx->ccid2hctx_pipe < hctx->ccid2hctx_cwnd)
  107. return 0;
  108. return 1; /* XXX CCID should dequeue when ready instead of polling */
  109. }
  110. static void ccid2_change_l_ack_ratio(struct sock *sk, u32 val)
  111. {
  112. struct dccp_sock *dp = dccp_sk(sk);
  113. u32 max_ratio = DIV_ROUND_UP(ccid2_hc_tx_sk(sk)->ccid2hctx_cwnd, 2);
  114. /*
  115. * Ensure that Ack Ratio does not exceed ceil(cwnd/2), which is (2) from
  116. * RFC 4341, 6.1.2. We ignore the statement that Ack Ratio 2 is always
  117. * acceptable since this causes starvation/deadlock whenever cwnd < 2.
  118. * The same problem arises when Ack Ratio is 0 (ie. Ack Ratio disabled).
  119. */
  120. if (val == 0 || val > max_ratio) {
  121. DCCP_WARN("Limiting Ack Ratio (%u) to %u\n", val, max_ratio);
  122. val = max_ratio;
  123. }
  124. if (val > 0xFFFF) /* RFC 4340, 11.3 */
  125. val = 0xFFFF;
  126. if (val == dp->dccps_l_ack_ratio)
  127. return;
  128. ccid2_pr_debug("changing local ack ratio to %u\n", val);
  129. dp->dccps_l_ack_ratio = val;
  130. }
  131. static void ccid2_change_srtt(struct ccid2_hc_tx_sock *hctx, long val)
  132. {
  133. ccid2_pr_debug("change SRTT to %ld\n", val);
  134. hctx->ccid2hctx_srtt = val;
  135. }
  136. static void ccid2_start_rto_timer(struct sock *sk);
  137. static void ccid2_hc_tx_rto_expire(unsigned long data)
  138. {
  139. struct sock *sk = (struct sock *)data;
  140. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  141. long s;
  142. bh_lock_sock(sk);
  143. if (sock_owned_by_user(sk)) {
  144. sk_reset_timer(sk, &hctx->ccid2hctx_rtotimer,
  145. jiffies + HZ / 5);
  146. goto out;
  147. }
  148. ccid2_pr_debug("RTO_EXPIRE\n");
  149. ccid2_hc_tx_check_sanity(hctx);
  150. /* back-off timer */
  151. hctx->ccid2hctx_rto <<= 1;
  152. s = hctx->ccid2hctx_rto / HZ;
  153. if (s > 60)
  154. hctx->ccid2hctx_rto = 60 * HZ;
  155. ccid2_start_rto_timer(sk);
  156. /* adjust pipe, cwnd etc */
  157. hctx->ccid2hctx_ssthresh = hctx->ccid2hctx_cwnd / 2;
  158. if (hctx->ccid2hctx_ssthresh < 2)
  159. hctx->ccid2hctx_ssthresh = 2;
  160. hctx->ccid2hctx_cwnd = 1;
  161. hctx->ccid2hctx_pipe = 0;
  162. /* clear state about stuff we sent */
  163. hctx->ccid2hctx_seqt = hctx->ccid2hctx_seqh;
  164. hctx->ccid2hctx_packets_acked = 0;
  165. /* clear ack ratio state. */
  166. hctx->ccid2hctx_rpseq = 0;
  167. hctx->ccid2hctx_rpdupack = -1;
  168. ccid2_change_l_ack_ratio(sk, 1);
  169. ccid2_hc_tx_check_sanity(hctx);
  170. out:
  171. bh_unlock_sock(sk);
  172. sock_put(sk);
  173. }
  174. static void ccid2_start_rto_timer(struct sock *sk)
  175. {
  176. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  177. ccid2_pr_debug("setting RTO timeout=%ld\n", hctx->ccid2hctx_rto);
  178. BUG_ON(timer_pending(&hctx->ccid2hctx_rtotimer));
  179. sk_reset_timer(sk, &hctx->ccid2hctx_rtotimer,
  180. jiffies + hctx->ccid2hctx_rto);
  181. }
  182. static void ccid2_hc_tx_packet_sent(struct sock *sk, int more, unsigned int len)
  183. {
  184. struct dccp_sock *dp = dccp_sk(sk);
  185. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  186. struct ccid2_seq *next;
  187. hctx->ccid2hctx_pipe++;
  188. hctx->ccid2hctx_seqh->ccid2s_seq = dp->dccps_gss;
  189. hctx->ccid2hctx_seqh->ccid2s_acked = 0;
  190. hctx->ccid2hctx_seqh->ccid2s_sent = jiffies;
  191. next = hctx->ccid2hctx_seqh->ccid2s_next;
  192. /* check if we need to alloc more space */
  193. if (next == hctx->ccid2hctx_seqt) {
  194. if (ccid2_hc_tx_alloc_seq(hctx)) {
  195. DCCP_CRIT("packet history - out of memory!");
  196. /* FIXME: find a more graceful way to bail out */
  197. return;
  198. }
  199. next = hctx->ccid2hctx_seqh->ccid2s_next;
  200. BUG_ON(next == hctx->ccid2hctx_seqt);
  201. }
  202. hctx->ccid2hctx_seqh = next;
  203. ccid2_pr_debug("cwnd=%d pipe=%d\n", hctx->ccid2hctx_cwnd,
  204. hctx->ccid2hctx_pipe);
  205. /*
  206. * FIXME: The code below is broken and the variables have been removed
  207. * from the socket struct. The `ackloss' variable was always set to 0,
  208. * and with arsent there are several problems:
  209. * (i) it doesn't just count the number of Acks, but all sent packets;
  210. * (ii) it is expressed in # of packets, not # of windows, so the
  211. * comparison below uses the wrong formula: Appendix A of RFC 4341
  212. * comes up with the number K = cwnd / (R^2 - R) of consecutive windows
  213. * of data with no lost or marked Ack packets. If arsent were the # of
  214. * consecutive Acks received without loss, then Ack Ratio needs to be
  215. * decreased by 1 when
  216. * arsent >= K * cwnd / R = cwnd^2 / (R^3 - R^2)
  217. * where cwnd / R is the number of Acks received per window of data
  218. * (cf. RFC 4341, App. A). The problems are that
  219. * - arsent counts other packets as well;
  220. * - the comparison uses a formula different from RFC 4341;
  221. * - computing a cubic/quadratic equation each time is too complicated.
  222. * Hence a different algorithm is needed.
  223. */
  224. #if 0
  225. /* Ack Ratio. Need to maintain a concept of how many windows we sent */
  226. hctx->ccid2hctx_arsent++;
  227. /* We had an ack loss in this window... */
  228. if (hctx->ccid2hctx_ackloss) {
  229. if (hctx->ccid2hctx_arsent >= hctx->ccid2hctx_cwnd) {
  230. hctx->ccid2hctx_arsent = 0;
  231. hctx->ccid2hctx_ackloss = 0;
  232. }
  233. } else {
  234. /* No acks lost up to now... */
  235. /* decrease ack ratio if enough packets were sent */
  236. if (dp->dccps_l_ack_ratio > 1) {
  237. /* XXX don't calculate denominator each time */
  238. int denom = dp->dccps_l_ack_ratio * dp->dccps_l_ack_ratio -
  239. dp->dccps_l_ack_ratio;
  240. denom = hctx->ccid2hctx_cwnd * hctx->ccid2hctx_cwnd / denom;
  241. if (hctx->ccid2hctx_arsent >= denom) {
  242. ccid2_change_l_ack_ratio(sk, dp->dccps_l_ack_ratio - 1);
  243. hctx->ccid2hctx_arsent = 0;
  244. }
  245. } else {
  246. /* we can't increase ack ratio further [1] */
  247. hctx->ccid2hctx_arsent = 0; /* or maybe set it to cwnd*/
  248. }
  249. }
  250. #endif
  251. /* setup RTO timer */
  252. if (!timer_pending(&hctx->ccid2hctx_rtotimer))
  253. ccid2_start_rto_timer(sk);
  254. #ifdef CONFIG_IP_DCCP_CCID2_DEBUG
  255. do {
  256. struct ccid2_seq *seqp = hctx->ccid2hctx_seqt;
  257. while (seqp != hctx->ccid2hctx_seqh) {
  258. ccid2_pr_debug("out seq=%llu acked=%d time=%lu\n",
  259. (unsigned long long)seqp->ccid2s_seq,
  260. seqp->ccid2s_acked, seqp->ccid2s_sent);
  261. seqp = seqp->ccid2s_next;
  262. }
  263. } while (0);
  264. ccid2_pr_debug("=========\n");
  265. ccid2_hc_tx_check_sanity(hctx);
  266. #endif
  267. }
  268. /* XXX Lame code duplication!
  269. * returns -1 if none was found.
  270. * else returns the next offset to use in the function call.
  271. */
  272. static int ccid2_ackvector(struct sock *sk, struct sk_buff *skb, int offset,
  273. unsigned char **vec, unsigned char *veclen)
  274. {
  275. const struct dccp_hdr *dh = dccp_hdr(skb);
  276. unsigned char *options = (unsigned char *)dh + dccp_hdr_len(skb);
  277. unsigned char *opt_ptr;
  278. const unsigned char *opt_end = (unsigned char *)dh +
  279. (dh->dccph_doff * 4);
  280. unsigned char opt, len;
  281. unsigned char *value;
  282. BUG_ON(offset < 0);
  283. options += offset;
  284. opt_ptr = options;
  285. if (opt_ptr >= opt_end)
  286. return -1;
  287. while (opt_ptr != opt_end) {
  288. opt = *opt_ptr++;
  289. len = 0;
  290. value = NULL;
  291. /* Check if this isn't a single byte option */
  292. if (opt > DCCPO_MAX_RESERVED) {
  293. if (opt_ptr == opt_end)
  294. goto out_invalid_option;
  295. len = *opt_ptr++;
  296. if (len < 3)
  297. goto out_invalid_option;
  298. /*
  299. * Remove the type and len fields, leaving
  300. * just the value size
  301. */
  302. len -= 2;
  303. value = opt_ptr;
  304. opt_ptr += len;
  305. if (opt_ptr > opt_end)
  306. goto out_invalid_option;
  307. }
  308. switch (opt) {
  309. case DCCPO_ACK_VECTOR_0:
  310. case DCCPO_ACK_VECTOR_1:
  311. *vec = value;
  312. *veclen = len;
  313. return offset + (opt_ptr - options);
  314. }
  315. }
  316. return -1;
  317. out_invalid_option:
  318. DCCP_BUG("Invalid option - this should not happen (previous parsing)!");
  319. return -1;
  320. }
  321. static void ccid2_hc_tx_kill_rto_timer(struct sock *sk)
  322. {
  323. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  324. sk_stop_timer(sk, &hctx->ccid2hctx_rtotimer);
  325. ccid2_pr_debug("deleted RTO timer\n");
  326. }
  327. static inline void ccid2_new_ack(struct sock *sk,
  328. struct ccid2_seq *seqp,
  329. unsigned int *maxincr)
  330. {
  331. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  332. if (hctx->ccid2hctx_cwnd < hctx->ccid2hctx_ssthresh) {
  333. if (*maxincr > 0 && ++hctx->ccid2hctx_packets_acked == 2) {
  334. hctx->ccid2hctx_cwnd += 1;
  335. *maxincr -= 1;
  336. hctx->ccid2hctx_packets_acked = 0;
  337. }
  338. } else if (++hctx->ccid2hctx_packets_acked >= hctx->ccid2hctx_cwnd) {
  339. hctx->ccid2hctx_cwnd += 1;
  340. hctx->ccid2hctx_packets_acked = 0;
  341. }
  342. /* update RTO */
  343. if (hctx->ccid2hctx_srtt == -1 ||
  344. time_after(jiffies, hctx->ccid2hctx_lastrtt + hctx->ccid2hctx_srtt)) {
  345. unsigned long r = (long)jiffies - (long)seqp->ccid2s_sent;
  346. int s;
  347. /* first measurement */
  348. if (hctx->ccid2hctx_srtt == -1) {
  349. ccid2_pr_debug("R: %lu Time=%lu seq=%llu\n",
  350. r, jiffies,
  351. (unsigned long long)seqp->ccid2s_seq);
  352. ccid2_change_srtt(hctx, r);
  353. hctx->ccid2hctx_rttvar = r >> 1;
  354. } else {
  355. /* RTTVAR */
  356. long tmp = hctx->ccid2hctx_srtt - r;
  357. long srtt;
  358. if (tmp < 0)
  359. tmp *= -1;
  360. tmp >>= 2;
  361. hctx->ccid2hctx_rttvar *= 3;
  362. hctx->ccid2hctx_rttvar >>= 2;
  363. hctx->ccid2hctx_rttvar += tmp;
  364. /* SRTT */
  365. srtt = hctx->ccid2hctx_srtt;
  366. srtt *= 7;
  367. srtt >>= 3;
  368. tmp = r >> 3;
  369. srtt += tmp;
  370. ccid2_change_srtt(hctx, srtt);
  371. }
  372. s = hctx->ccid2hctx_rttvar << 2;
  373. /* clock granularity is 1 when based on jiffies */
  374. if (!s)
  375. s = 1;
  376. hctx->ccid2hctx_rto = hctx->ccid2hctx_srtt + s;
  377. /* must be at least a second */
  378. s = hctx->ccid2hctx_rto / HZ;
  379. /* DCCP doesn't require this [but I like it cuz my code sux] */
  380. #if 1
  381. if (s < 1)
  382. hctx->ccid2hctx_rto = HZ;
  383. #endif
  384. /* max 60 seconds */
  385. if (s > 60)
  386. hctx->ccid2hctx_rto = HZ * 60;
  387. hctx->ccid2hctx_lastrtt = jiffies;
  388. ccid2_pr_debug("srtt: %ld rttvar: %ld rto: %ld (HZ=%d) R=%lu\n",
  389. hctx->ccid2hctx_srtt, hctx->ccid2hctx_rttvar,
  390. hctx->ccid2hctx_rto, HZ, r);
  391. }
  392. /* we got a new ack, so re-start RTO timer */
  393. ccid2_hc_tx_kill_rto_timer(sk);
  394. ccid2_start_rto_timer(sk);
  395. }
  396. static void ccid2_hc_tx_dec_pipe(struct sock *sk)
  397. {
  398. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  399. if (hctx->ccid2hctx_pipe == 0)
  400. DCCP_BUG("pipe == 0");
  401. else
  402. hctx->ccid2hctx_pipe--;
  403. if (hctx->ccid2hctx_pipe == 0)
  404. ccid2_hc_tx_kill_rto_timer(sk);
  405. }
  406. static void ccid2_congestion_event(struct sock *sk, struct ccid2_seq *seqp)
  407. {
  408. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  409. if (time_before(seqp->ccid2s_sent, hctx->ccid2hctx_last_cong)) {
  410. ccid2_pr_debug("Multiple losses in an RTT---treating as one\n");
  411. return;
  412. }
  413. hctx->ccid2hctx_last_cong = jiffies;
  414. hctx->ccid2hctx_cwnd = hctx->ccid2hctx_cwnd / 2 ? : 1U;
  415. hctx->ccid2hctx_ssthresh = max(hctx->ccid2hctx_cwnd, 2U);
  416. /* Avoid spurious timeouts resulting from Ack Ratio > cwnd */
  417. if (dccp_sk(sk)->dccps_l_ack_ratio > hctx->ccid2hctx_cwnd)
  418. ccid2_change_l_ack_ratio(sk, hctx->ccid2hctx_cwnd);
  419. }
  420. static void ccid2_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
  421. {
  422. struct dccp_sock *dp = dccp_sk(sk);
  423. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  424. u64 ackno, seqno;
  425. struct ccid2_seq *seqp;
  426. unsigned char *vector;
  427. unsigned char veclen;
  428. int offset = 0;
  429. int done = 0;
  430. unsigned int maxincr = 0;
  431. ccid2_hc_tx_check_sanity(hctx);
  432. /* check reverse path congestion */
  433. seqno = DCCP_SKB_CB(skb)->dccpd_seq;
  434. /* XXX this whole "algorithm" is broken. Need to fix it to keep track
  435. * of the seqnos of the dupacks so that rpseq and rpdupack are correct
  436. * -sorbo.
  437. */
  438. /* need to bootstrap */
  439. if (hctx->ccid2hctx_rpdupack == -1) {
  440. hctx->ccid2hctx_rpdupack = 0;
  441. hctx->ccid2hctx_rpseq = seqno;
  442. } else {
  443. /* check if packet is consecutive */
  444. if (dccp_delta_seqno(hctx->ccid2hctx_rpseq, seqno) == 1)
  445. hctx->ccid2hctx_rpseq = seqno;
  446. /* it's a later packet */
  447. else if (after48(seqno, hctx->ccid2hctx_rpseq)) {
  448. hctx->ccid2hctx_rpdupack++;
  449. /* check if we got enough dupacks */
  450. if (hctx->ccid2hctx_rpdupack >= NUMDUPACK) {
  451. hctx->ccid2hctx_rpdupack = -1; /* XXX lame */
  452. hctx->ccid2hctx_rpseq = 0;
  453. ccid2_change_l_ack_ratio(sk, 2 * dp->dccps_l_ack_ratio);
  454. }
  455. }
  456. }
  457. /* check forward path congestion */
  458. /* still didn't send out new data packets */
  459. if (hctx->ccid2hctx_seqh == hctx->ccid2hctx_seqt)
  460. return;
  461. switch (DCCP_SKB_CB(skb)->dccpd_type) {
  462. case DCCP_PKT_ACK:
  463. case DCCP_PKT_DATAACK:
  464. break;
  465. default:
  466. return;
  467. }
  468. ackno = DCCP_SKB_CB(skb)->dccpd_ack_seq;
  469. if (after48(ackno, hctx->ccid2hctx_high_ack))
  470. hctx->ccid2hctx_high_ack = ackno;
  471. seqp = hctx->ccid2hctx_seqt;
  472. while (before48(seqp->ccid2s_seq, ackno)) {
  473. seqp = seqp->ccid2s_next;
  474. if (seqp == hctx->ccid2hctx_seqh) {
  475. seqp = hctx->ccid2hctx_seqh->ccid2s_prev;
  476. break;
  477. }
  478. }
  479. /*
  480. * In slow-start, cwnd can increase up to a maximum of Ack Ratio/2
  481. * packets per acknowledgement. Rounding up avoids that cwnd is not
  482. * advanced when Ack Ratio is 1 and gives a slight edge otherwise.
  483. */
  484. if (hctx->ccid2hctx_cwnd < hctx->ccid2hctx_ssthresh)
  485. maxincr = DIV_ROUND_UP(dp->dccps_l_ack_ratio, 2);
  486. /* go through all ack vectors */
  487. while ((offset = ccid2_ackvector(sk, skb, offset,
  488. &vector, &veclen)) != -1) {
  489. /* go through this ack vector */
  490. while (veclen--) {
  491. const u8 rl = *vector & DCCP_ACKVEC_LEN_MASK;
  492. u64 ackno_end_rl = SUB48(ackno, rl);
  493. ccid2_pr_debug("ackvec start:%llu end:%llu\n",
  494. (unsigned long long)ackno,
  495. (unsigned long long)ackno_end_rl);
  496. /* if the seqno we are analyzing is larger than the
  497. * current ackno, then move towards the tail of our
  498. * seqnos.
  499. */
  500. while (after48(seqp->ccid2s_seq, ackno)) {
  501. if (seqp == hctx->ccid2hctx_seqt) {
  502. done = 1;
  503. break;
  504. }
  505. seqp = seqp->ccid2s_prev;
  506. }
  507. if (done)
  508. break;
  509. /* check all seqnos in the range of the vector
  510. * run length
  511. */
  512. while (between48(seqp->ccid2s_seq,ackno_end_rl,ackno)) {
  513. const u8 state = *vector &
  514. DCCP_ACKVEC_STATE_MASK;
  515. /* new packet received or marked */
  516. if (state != DCCP_ACKVEC_STATE_NOT_RECEIVED &&
  517. !seqp->ccid2s_acked) {
  518. if (state ==
  519. DCCP_ACKVEC_STATE_ECN_MARKED) {
  520. ccid2_congestion_event(sk,
  521. seqp);
  522. } else
  523. ccid2_new_ack(sk, seqp,
  524. &maxincr);
  525. seqp->ccid2s_acked = 1;
  526. ccid2_pr_debug("Got ack for %llu\n",
  527. (unsigned long long)seqp->ccid2s_seq);
  528. ccid2_hc_tx_dec_pipe(sk);
  529. }
  530. if (seqp == hctx->ccid2hctx_seqt) {
  531. done = 1;
  532. break;
  533. }
  534. seqp = seqp->ccid2s_prev;
  535. }
  536. if (done)
  537. break;
  538. ackno = SUB48(ackno_end_rl, 1);
  539. vector++;
  540. }
  541. if (done)
  542. break;
  543. }
  544. /* The state about what is acked should be correct now
  545. * Check for NUMDUPACK
  546. */
  547. seqp = hctx->ccid2hctx_seqt;
  548. while (before48(seqp->ccid2s_seq, hctx->ccid2hctx_high_ack)) {
  549. seqp = seqp->ccid2s_next;
  550. if (seqp == hctx->ccid2hctx_seqh) {
  551. seqp = hctx->ccid2hctx_seqh->ccid2s_prev;
  552. break;
  553. }
  554. }
  555. done = 0;
  556. while (1) {
  557. if (seqp->ccid2s_acked) {
  558. done++;
  559. if (done == NUMDUPACK)
  560. break;
  561. }
  562. if (seqp == hctx->ccid2hctx_seqt)
  563. break;
  564. seqp = seqp->ccid2s_prev;
  565. }
  566. /* If there are at least 3 acknowledgements, anything unacknowledged
  567. * below the last sequence number is considered lost
  568. */
  569. if (done == NUMDUPACK) {
  570. struct ccid2_seq *last_acked = seqp;
  571. /* check for lost packets */
  572. while (1) {
  573. if (!seqp->ccid2s_acked) {
  574. ccid2_pr_debug("Packet lost: %llu\n",
  575. (unsigned long long)seqp->ccid2s_seq);
  576. /* XXX need to traverse from tail -> head in
  577. * order to detect multiple congestion events in
  578. * one ack vector.
  579. */
  580. ccid2_congestion_event(sk, seqp);
  581. ccid2_hc_tx_dec_pipe(sk);
  582. }
  583. if (seqp == hctx->ccid2hctx_seqt)
  584. break;
  585. seqp = seqp->ccid2s_prev;
  586. }
  587. hctx->ccid2hctx_seqt = last_acked;
  588. }
  589. /* trim acked packets in tail */
  590. while (hctx->ccid2hctx_seqt != hctx->ccid2hctx_seqh) {
  591. if (!hctx->ccid2hctx_seqt->ccid2s_acked)
  592. break;
  593. hctx->ccid2hctx_seqt = hctx->ccid2hctx_seqt->ccid2s_next;
  594. }
  595. ccid2_hc_tx_check_sanity(hctx);
  596. }
  597. static int ccid2_hc_tx_init(struct ccid *ccid, struct sock *sk)
  598. {
  599. struct ccid2_hc_tx_sock *hctx = ccid_priv(ccid);
  600. struct dccp_sock *dp = dccp_sk(sk);
  601. u32 max_ratio;
  602. /* RFC 4341, 5: initialise ssthresh to arbitrarily high (max) value */
  603. hctx->ccid2hctx_ssthresh = ~0U;
  604. /*
  605. * RFC 4341, 5: "The cwnd parameter is initialized to at most four
  606. * packets for new connections, following the rules from [RFC3390]".
  607. * We need to convert the bytes of RFC3390 into the packets of RFC 4341.
  608. */
  609. hctx->ccid2hctx_cwnd = clamp(4380U / dp->dccps_mss_cache, 2U, 4U);
  610. /* Make sure that Ack Ratio is enabled and within bounds. */
  611. max_ratio = DIV_ROUND_UP(hctx->ccid2hctx_cwnd, 2);
  612. if (dp->dccps_l_ack_ratio == 0 || dp->dccps_l_ack_ratio > max_ratio)
  613. dp->dccps_l_ack_ratio = max_ratio;
  614. /* XXX init ~ to window size... */
  615. if (ccid2_hc_tx_alloc_seq(hctx))
  616. return -ENOMEM;
  617. hctx->ccid2hctx_rto = 3 * HZ;
  618. ccid2_change_srtt(hctx, -1);
  619. hctx->ccid2hctx_rttvar = -1;
  620. hctx->ccid2hctx_rpdupack = -1;
  621. hctx->ccid2hctx_last_cong = jiffies;
  622. setup_timer(&hctx->ccid2hctx_rtotimer, ccid2_hc_tx_rto_expire,
  623. (unsigned long)sk);
  624. ccid2_hc_tx_check_sanity(hctx);
  625. return 0;
  626. }
  627. static void ccid2_hc_tx_exit(struct sock *sk)
  628. {
  629. struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
  630. int i;
  631. ccid2_hc_tx_kill_rto_timer(sk);
  632. for (i = 0; i < hctx->ccid2hctx_seqbufc; i++)
  633. kfree(hctx->ccid2hctx_seqbuf[i]);
  634. hctx->ccid2hctx_seqbufc = 0;
  635. }
  636. static void ccid2_hc_rx_packet_recv(struct sock *sk, struct sk_buff *skb)
  637. {
  638. const struct dccp_sock *dp = dccp_sk(sk);
  639. struct ccid2_hc_rx_sock *hcrx = ccid2_hc_rx_sk(sk);
  640. switch (DCCP_SKB_CB(skb)->dccpd_type) {
  641. case DCCP_PKT_DATA:
  642. case DCCP_PKT_DATAACK:
  643. hcrx->ccid2hcrx_data++;
  644. if (hcrx->ccid2hcrx_data >= dp->dccps_r_ack_ratio) {
  645. dccp_send_ack(sk);
  646. hcrx->ccid2hcrx_data = 0;
  647. }
  648. break;
  649. }
  650. }
  651. static struct ccid_operations ccid2 = {
  652. .ccid_id = DCCPC_CCID2,
  653. .ccid_name = "TCP-like",
  654. .ccid_owner = THIS_MODULE,
  655. .ccid_hc_tx_obj_size = sizeof(struct ccid2_hc_tx_sock),
  656. .ccid_hc_tx_init = ccid2_hc_tx_init,
  657. .ccid_hc_tx_exit = ccid2_hc_tx_exit,
  658. .ccid_hc_tx_send_packet = ccid2_hc_tx_send_packet,
  659. .ccid_hc_tx_packet_sent = ccid2_hc_tx_packet_sent,
  660. .ccid_hc_tx_packet_recv = ccid2_hc_tx_packet_recv,
  661. .ccid_hc_rx_obj_size = sizeof(struct ccid2_hc_rx_sock),
  662. .ccid_hc_rx_packet_recv = ccid2_hc_rx_packet_recv,
  663. };
  664. #ifdef CONFIG_IP_DCCP_CCID2_DEBUG
  665. module_param(ccid2_debug, bool, 0644);
  666. MODULE_PARM_DESC(ccid2_debug, "Enable debug messages");
  667. #endif
  668. static __init int ccid2_module_init(void)
  669. {
  670. return ccid_register(&ccid2);
  671. }
  672. module_init(ccid2_module_init);
  673. static __exit void ccid2_module_exit(void)
  674. {
  675. ccid_unregister(&ccid2);
  676. }
  677. module_exit(ccid2_module_exit);
  678. MODULE_AUTHOR("Andrea Bittau <a.bittau@cs.ucl.ac.uk>");
  679. MODULE_DESCRIPTION("DCCP TCP-Like (CCID2) CCID");
  680. MODULE_LICENSE("GPL");
  681. MODULE_ALIAS("net-dccp-ccid-2");