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