ccid2.c 22 KB

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