ccid2.c 22 KB

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