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