ccid2.c 21 KB

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