ccid2.c 21 KB

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