ccid2.c 21.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
/*
 *  net/dccp/ccids/ccid2.c
 *
 *  Copyright (c) 2005, 2006 Andrea Bittau <a.bittau@cs.ucl.ac.uk>
 *
 *  Changes to meet Linux coding standards, and DCCP infrastructure fixes.
 *
 *  Copyright (c) 2006 Arnaldo Carvalho de Melo <acme@conectiva.com.br>
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

/*
26
 * This implementation should follow RFC 4341
27 28 29 30 31 32 33
 */

#include "../ccid.h"
#include "../dccp.h"
#include "ccid2.h"


34
#ifdef CONFIG_IP_DCCP_CCID2_DEBUG
35 36
static int ccid2_debug;
#define ccid2_pr_debug(format, a...)	DCCP_PR_DEBUG(ccid2_debug, format, ##a)
37 38 39 40 41

static void ccid2_hc_tx_check_sanity(const struct ccid2_hc_tx_sock *hctx)
{
	int len = 0;
	int pipe = 0;
42
	struct ccid2_seq *seqp = hctx->ccid2hctx_seqh;
43 44 45 46 47 48 49 50 51

	/* there is data in the chain */
	if (seqp != hctx->ccid2hctx_seqt) {
		seqp = seqp->ccid2s_prev;
		len++;
		if (!seqp->ccid2s_acked)
			pipe++;

		while (seqp != hctx->ccid2hctx_seqt) {
52
			struct ccid2_seq *prev = seqp->ccid2s_prev;
53 54 55 56 57 58

			len++;
			if (!prev->ccid2s_acked)
				pipe++;

			/* packets are sent sequentially */
59 60
			BUG_ON(dccp_delta_seqno(seqp->ccid2s_seq,
						prev->ccid2s_seq ) >= 0);
61 62
			BUG_ON(time_before(seqp->ccid2s_sent,
					   prev->ccid2s_sent));
63 64 65 66 67 68 69 70 71 72 73

			seqp = prev;
		}
	}

	BUG_ON(pipe != hctx->ccid2hctx_pipe);
	ccid2_pr_debug("len of chain=%d\n", len);

	do {
		seqp = seqp->ccid2s_prev;
		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 81
#define ccid2_pr_debug(format, a...)
#define ccid2_hc_tx_check_sanity(hctx)
82 83
#endif

G
Gerrit Renker 已提交
84
static int ccid2_hc_tx_alloc_seq(struct ccid2_hc_tx_sock *hctx)
85 86 87 88 89 90 91 92 93 94
{
	struct ccid2_seq *seqp;
	int i;

	/* check if we have space to preserve the pointer to the buffer */
	if (hctx->ccid2hctx_seqbufc >= (sizeof(hctx->ccid2hctx_seqbuf) /
					sizeof(struct ccid2_seq*)))
		return -ENOMEM;

	/* allocate buffer and initialize linked list */
G
Gerrit Renker 已提交
95
	seqp = kmalloc(CCID2_SEQBUF_LEN * sizeof(struct ccid2_seq), gfp_any());
96 97 98
	if (seqp == NULL)
		return -ENOMEM;

G
Gerrit Renker 已提交
99
	for (i = 0; i < (CCID2_SEQBUF_LEN - 1); i++) {
100 101 102
		seqp[i].ccid2s_next = &seqp[i + 1];
		seqp[i + 1].ccid2s_prev = &seqp[i];
	}
G
Gerrit Renker 已提交
103 104
	seqp[CCID2_SEQBUF_LEN - 1].ccid2s_next = seqp;
	seqp->ccid2s_prev = &seqp[CCID2_SEQBUF_LEN - 1];
105 106 107 108 109 110 111 112 113

	/* This is the first allocation.  Initiate the head and tail.  */
	if (hctx->ccid2hctx_seqbufc == 0)
		hctx->ccid2hctx_seqh = hctx->ccid2hctx_seqt = seqp;
	else {
		/* link the existing list with the one we just created */
		hctx->ccid2hctx_seqh->ccid2s_next = seqp;
		seqp->ccid2s_prev = hctx->ccid2hctx_seqh;

G
Gerrit Renker 已提交
114 115
		hctx->ccid2hctx_seqt->ccid2s_prev = &seqp[CCID2_SEQBUF_LEN - 1];
		seqp[CCID2_SEQBUF_LEN - 1].ccid2s_next = hctx->ccid2hctx_seqt;
116 117 118 119 120 121 122 123 124
	}

	/* store the original pointer to the buffer so we can free it */
	hctx->ccid2hctx_seqbuf[hctx->ccid2hctx_seqbufc] = seqp;
	hctx->ccid2hctx_seqbufc++;

	return 0;
}

125
static 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 130 131 132 133 134 135 136 137 138 139

	ccid2_pr_debug("pipe=%d cwnd=%d\n", hctx->ccid2hctx_pipe,
		       hctx->ccid2hctx_cwnd);

	if (hctx->ccid2hctx_pipe < hctx->ccid2hctx_cwnd) {
		/* OK we can send... make sure previous packet was sent off */
		if (!hctx->ccid2hctx_sendwait) {
			hctx->ccid2hctx_sendwait = 1;
			return 0;
		}
	}

140
	return 1; /* XXX CCID should dequeue when ready instead of polling */
141 142
}

143
static void ccid2_change_l_ack_ratio(struct sock *sk, u32 val)
144 145 146 147 148 149 150 151
{
	struct dccp_sock *dp = dccp_sk(sk);
	/*
	 * XXX I don't really agree with val != 2.  If cwnd is 1, ack ratio
	 * should be 1... it shouldn't be allowed to become 2.
	 * -sorbo.
	 */
	if (val != 2) {
152
		const struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
153 154 155 156 157 158 159 160 161
		int max = hctx->ccid2hctx_cwnd / 2;

		/* round up */
		if (hctx->ccid2hctx_cwnd & 1)
			max++;

		if (val > max)
			val = max;
	}
162 163
	if (val > 0xFFFF)		/* RFC 4340, 11.3 */
		val = 0xFFFF;
164

165
	ccid2_pr_debug("changing local ack ratio to %u\n", val);
166 167 168
	dp->dccps_l_ack_ratio = val;
}

G
Gerrit Renker 已提交
169
static void ccid2_change_cwnd(struct ccid2_hc_tx_sock *hctx, u32 val)
170 171
{
	/* XXX do we need to change ack ratio? */
G
Gerrit Renker 已提交
172 173
	hctx->ccid2hctx_cwnd = val? : 1;
	ccid2_pr_debug("changed cwnd to %u\n", hctx->ccid2hctx_cwnd);
174 175
}

176 177 178 179 180 181 182 183 184 185 186
static void ccid2_change_srtt(struct ccid2_hc_tx_sock *hctx, long val)
{
	ccid2_pr_debug("change SRTT to %ld\n", val);
	hctx->ccid2hctx_srtt = val;
}

static void ccid2_change_pipe(struct ccid2_hc_tx_sock *hctx, long val)
{
	hctx->ccid2hctx_pipe = val;
}

187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215
static void ccid2_start_rto_timer(struct sock *sk);

static void ccid2_hc_tx_rto_expire(unsigned long data)
{
	struct sock *sk = (struct sock *)data;
	struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
	long s;

	bh_lock_sock(sk);
	if (sock_owned_by_user(sk)) {
		sk_reset_timer(sk, &hctx->ccid2hctx_rtotimer,
			       jiffies + HZ / 5);
		goto out;
	}

	ccid2_pr_debug("RTO_EXPIRE\n");

	ccid2_hc_tx_check_sanity(hctx);

	/* back-off timer */
	hctx->ccid2hctx_rto <<= 1;

	s = hctx->ccid2hctx_rto / HZ;
	if (s > 60)
		hctx->ccid2hctx_rto = 60 * HZ;

	ccid2_start_rto_timer(sk);

	/* adjust pipe, cwnd etc */
216
	ccid2_change_pipe(hctx, 0);
217 218 219
	hctx->ccid2hctx_ssthresh = hctx->ccid2hctx_cwnd >> 1;
	if (hctx->ccid2hctx_ssthresh < 2)
		hctx->ccid2hctx_ssthresh = 2;
220
	ccid2_change_cwnd(hctx, 1);
221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236

	/* clear state about stuff we sent */
	hctx->ccid2hctx_seqt	= hctx->ccid2hctx_seqh;
	hctx->ccid2hctx_ssacks	= 0;
	hctx->ccid2hctx_acks	= 0;
	hctx->ccid2hctx_sent	= 0;

	/* clear ack ratio state. */
	hctx->ccid2hctx_arsent	 = 0;
	hctx->ccid2hctx_ackloss  = 0;
	hctx->ccid2hctx_rpseq	 = 0;
	hctx->ccid2hctx_rpdupack = -1;
	ccid2_change_l_ack_ratio(sk, 1);
	ccid2_hc_tx_check_sanity(hctx);
out:
	bh_unlock_sock(sk);
237
	sock_put(sk);
238 239 240 241 242 243 244 245 246 247 248 249 250
}

static void ccid2_start_rto_timer(struct sock *sk)
{
	struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);

	ccid2_pr_debug("setting RTO timeout=%ld\n", hctx->ccid2hctx_rto);

	BUG_ON(timer_pending(&hctx->ccid2hctx_rtotimer));
	sk_reset_timer(sk, &hctx->ccid2hctx_rtotimer,
		       jiffies + hctx->ccid2hctx_rto);
}

251
static void ccid2_hc_tx_packet_sent(struct sock *sk, int more, unsigned int len)
252 253 254
{
	struct dccp_sock *dp = dccp_sk(sk);
	struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
255
	struct ccid2_seq *next;
256 257 258 259 260 261
	u64 seq;

	ccid2_hc_tx_check_sanity(hctx);

	BUG_ON(!hctx->ccid2hctx_sendwait);
	hctx->ccid2hctx_sendwait = 0;
262
	ccid2_change_pipe(hctx, hctx->ccid2hctx_pipe + 1);
263 264 265 266 267 268 269 270 271 272 273 274 275
	BUG_ON(hctx->ccid2hctx_pipe < 0);

	/* There is an issue.  What if another packet is sent between
	 * packet_send() and packet_sent().  Then the sequence number would be
	 * wrong.
	 * -sorbo.
	 */
	seq = dp->dccps_gss;

	hctx->ccid2hctx_seqh->ccid2s_seq   = seq;
	hctx->ccid2hctx_seqh->ccid2s_acked = 0;
	hctx->ccid2hctx_seqh->ccid2s_sent  = jiffies;

276 277 278
	next = hctx->ccid2hctx_seqh->ccid2s_next;
	/* check if we need to alloc more space */
	if (next == hctx->ccid2hctx_seqt) {
G
Gerrit Renker 已提交
279 280 281 282 283
		if (ccid2_hc_tx_alloc_seq(hctx)) {
			DCCP_CRIT("packet history - out of memory!");
			/* FIXME: find a more graceful way to bail out */
			return;
		}
284 285
		next = hctx->ccid2hctx_seqh->ccid2s_next;
		BUG_ON(next == hctx->ccid2hctx_seqt);
286
	}
287 288 289 290
	hctx->ccid2hctx_seqh = next;

	ccid2_pr_debug("cwnd=%d pipe=%d\n", hctx->ccid2hctx_cwnd,
		       hctx->ccid2hctx_pipe);
291 292 293 294 295 296 297 298

	hctx->ccid2hctx_sent++;

	/* Ack Ratio.  Need to maintain a concept of how many windows we sent */
	hctx->ccid2hctx_arsent++;
	/* We had an ack loss in this window... */
	if (hctx->ccid2hctx_ackloss) {
		if (hctx->ccid2hctx_arsent >= hctx->ccid2hctx_cwnd) {
299 300
			hctx->ccid2hctx_arsent	= 0;
			hctx->ccid2hctx_ackloss	= 0;
301
		}
302 303
	} else {
		/* No acks lost up to now... */
304 305 306
		/* decrease ack ratio if enough packets were sent */
		if (dp->dccps_l_ack_ratio > 1) {
			/* XXX don't calculate denominator each time */
307 308
			int denom = dp->dccps_l_ack_ratio * dp->dccps_l_ack_ratio -
				    dp->dccps_l_ack_ratio;
309 310 311 312 313 314 315

			denom = hctx->ccid2hctx_cwnd * hctx->ccid2hctx_cwnd / denom;

			if (hctx->ccid2hctx_arsent >= denom) {
				ccid2_change_l_ack_ratio(sk, dp->dccps_l_ack_ratio - 1);
				hctx->ccid2hctx_arsent = 0;
			}
316 317
		} else {
			/* we can't increase ack ratio further [1] */
318 319 320 321 322
			hctx->ccid2hctx_arsent = 0; /* or maybe set it to cwnd*/
		}
	}

	/* setup RTO timer */
323
	if (!timer_pending(&hctx->ccid2hctx_rtotimer))
324
		ccid2_start_rto_timer(sk);
325

326
#ifdef CONFIG_IP_DCCP_CCID2_DEBUG
327
	ccid2_pr_debug("pipe=%d\n", hctx->ccid2hctx_pipe);
R
Randy Dunlap 已提交
328
	ccid2_pr_debug("Sent: seq=%llu\n", (unsigned long long)seq);
329 330 331 332 333
	do {
		struct ccid2_seq *seqp = hctx->ccid2hctx_seqt;

		while (seqp != hctx->ccid2hctx_seqh) {
			ccid2_pr_debug("out seq=%llu acked=%d time=%lu\n",
334
				       (unsigned long long)seqp->ccid2s_seq,
R
Randy Dunlap 已提交
335
				       seqp->ccid2s_acked, seqp->ccid2s_sent);
336 337
			seqp = seqp->ccid2s_next;
		}
338
	} while (0);
339 340 341 342 343 344 345 346 347 348 349 350
	ccid2_pr_debug("=========\n");
	ccid2_hc_tx_check_sanity(hctx);
#endif
}

/* XXX Lame code duplication!
 * returns -1 if none was found.
 * else returns the next offset to use in the function call.
 */
static int ccid2_ackvector(struct sock *sk, struct sk_buff *skb, int offset,
			   unsigned char **vec, unsigned char *veclen)
{
351 352 353 354 355 356 357
	const struct dccp_hdr *dh = dccp_hdr(skb);
	unsigned char *options = (unsigned char *)dh + dccp_hdr_len(skb);
	unsigned char *opt_ptr;
	const unsigned char *opt_end = (unsigned char *)dh +
					(dh->dccph_doff * 4);
	unsigned char opt, len;
	unsigned char *value;
358 359 360 361 362 363 364 365

	BUG_ON(offset < 0);
	options += offset;
	opt_ptr = options;
	if (opt_ptr >= opt_end)
		return -1;

	while (opt_ptr != opt_end) {
366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388
		opt   = *opt_ptr++;
		len   = 0;
		value = NULL;

		/* Check if this isn't a single byte option */
		if (opt > DCCPO_MAX_RESERVED) {
			if (opt_ptr == opt_end)
				goto out_invalid_option;

			len = *opt_ptr++;
			if (len < 3)
				goto out_invalid_option;
			/*
			 * Remove the type and len fields, leaving
			 * just the value size
			 */
			len     -= 2;
			value   = opt_ptr;
			opt_ptr += len;

			if (opt_ptr > opt_end)
				goto out_invalid_option;
		}
389 390 391 392 393 394 395 396 397 398 399 400 401

		switch (opt) {
		case DCCPO_ACK_VECTOR_0:
		case DCCPO_ACK_VECTOR_1:
			*vec	= value;
			*veclen = len;
			return offset + (opt_ptr - options);
		}
	}

	return -1;

out_invalid_option:
402
	DCCP_BUG("Invalid option - this should not happen (previous parsing)!");
403 404 405
	return -1;
}

406
static void ccid2_hc_tx_kill_rto_timer(struct sock *sk)
407
{
408 409 410 411
	struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);

	sk_stop_timer(sk, &hctx->ccid2hctx_rtotimer);
	ccid2_pr_debug("deleted RTO timer\n");
412 413 414
}

static inline void ccid2_new_ack(struct sock *sk,
415
				 struct ccid2_seq *seqp,
416 417 418 419 420 421 422 423 424 425 426 427 428
				 unsigned int *maxincr)
{
	struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);

	/* slow start */
	if (hctx->ccid2hctx_cwnd < hctx->ccid2hctx_ssthresh) {
		hctx->ccid2hctx_acks = 0;

		/* We can increase cwnd at most maxincr [ack_ratio/2] */
		if (*maxincr) {
			/* increase every 2 acks */
			hctx->ccid2hctx_ssacks++;
			if (hctx->ccid2hctx_ssacks == 2) {
429
				ccid2_change_cwnd(hctx, hctx->ccid2hctx_cwnd+1);
430 431 432
				hctx->ccid2hctx_ssacks = 0;
				*maxincr = *maxincr - 1;
			}
433 434
		} else {
			/* increased cwnd enough for this single ack */
435 436
			hctx->ccid2hctx_ssacks = 0;
		}
437
	} else {
438 439 440 441
		hctx->ccid2hctx_ssacks = 0;
		hctx->ccid2hctx_acks++;

		if (hctx->ccid2hctx_acks >= hctx->ccid2hctx_cwnd) {
442
			ccid2_change_cwnd(hctx, hctx->ccid2hctx_cwnd + 1);
443 444 445 446 447 448
			hctx->ccid2hctx_acks = 0;
		}
	}

	/* update RTO */
	if (hctx->ccid2hctx_srtt == -1 ||
449 450
	    time_after(jiffies, hctx->ccid2hctx_lastrtt + hctx->ccid2hctx_srtt)) {
		unsigned long r = (long)jiffies - (long)seqp->ccid2s_sent;
451 452 453 454 455
		int s;

		/* first measurement */
		if (hctx->ccid2hctx_srtt == -1) {
			ccid2_pr_debug("R: %lu Time=%lu seq=%llu\n",
456
				       r, jiffies,
R
Randy Dunlap 已提交
457
				       (unsigned long long)seqp->ccid2s_seq);
458
			ccid2_change_srtt(hctx, r);
459
			hctx->ccid2hctx_rttvar = r >> 1;
460
		} else {
461 462
			/* RTTVAR */
			long tmp = hctx->ccid2hctx_srtt - r;
463 464
			long srtt;

465 466 467 468 469 470 471 472 473
			if (tmp < 0)
				tmp *= -1;

			tmp >>= 2;
			hctx->ccid2hctx_rttvar *= 3;
			hctx->ccid2hctx_rttvar >>= 2;
			hctx->ccid2hctx_rttvar += tmp;

			/* SRTT */
474 475 476
			srtt = hctx->ccid2hctx_srtt;
			srtt *= 7;
			srtt >>= 3;
477
			tmp = r >> 3;
478 479
			srtt += tmp;
			ccid2_change_srtt(hctx, srtt);
480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500
		}
		s = hctx->ccid2hctx_rttvar << 2;
		/* clock granularity is 1 when based on jiffies */
		if (!s)
			s = 1;
		hctx->ccid2hctx_rto = hctx->ccid2hctx_srtt + s;

		/* must be at least a second */
		s = hctx->ccid2hctx_rto / HZ;
		/* DCCP doesn't require this [but I like it cuz my code sux] */
#if 1
		if (s < 1)
			hctx->ccid2hctx_rto = HZ;
#endif
		/* max 60 seconds */
		if (s > 60)
			hctx->ccid2hctx_rto = HZ * 60;

		hctx->ccid2hctx_lastrtt = jiffies;

		ccid2_pr_debug("srtt: %ld rttvar: %ld rto: %ld (HZ=%d) R=%lu\n",
501 502
			       hctx->ccid2hctx_srtt, hctx->ccid2hctx_rttvar,
			       hctx->ccid2hctx_rto, HZ, r);
503 504 505 506
		hctx->ccid2hctx_sent = 0;
	}

	/* we got a new ack, so re-start RTO timer */
507
	ccid2_hc_tx_kill_rto_timer(sk);
508 509 510
	ccid2_start_rto_timer(sk);
}

511
static void ccid2_hc_tx_dec_pipe(struct sock *sk)
512
{
513 514
	struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);

515
	ccid2_change_pipe(hctx, hctx->ccid2hctx_pipe-1);
516 517 518
	BUG_ON(hctx->ccid2hctx_pipe < 0);

	if (hctx->ccid2hctx_pipe == 0)
519
		ccid2_hc_tx_kill_rto_timer(sk);
520 521
}

522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537
static void ccid2_congestion_event(struct ccid2_hc_tx_sock *hctx,
				   struct ccid2_seq *seqp)
{
	if (time_before(seqp->ccid2s_sent, hctx->ccid2hctx_last_cong)) {
		ccid2_pr_debug("Multiple losses in an RTT---treating as one\n");
		return;
	}

	hctx->ccid2hctx_last_cong = jiffies;

	ccid2_change_cwnd(hctx, hctx->ccid2hctx_cwnd >> 1);
	hctx->ccid2hctx_ssthresh = hctx->ccid2hctx_cwnd;
	if (hctx->ccid2hctx_ssthresh < 2)
		hctx->ccid2hctx_ssthresh = 2;
}

538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561
static void ccid2_hc_tx_packet_recv(struct sock *sk, struct sk_buff *skb)
{
	struct dccp_sock *dp = dccp_sk(sk);
	struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
	u64 ackno, seqno;
	struct ccid2_seq *seqp;
	unsigned char *vector;
	unsigned char veclen;
	int offset = 0;
	int done = 0;
	unsigned int maxincr = 0;

	ccid2_hc_tx_check_sanity(hctx);
	/* check reverse path congestion */
	seqno = DCCP_SKB_CB(skb)->dccpd_seq;

	/* XXX this whole "algorithm" is broken.  Need to fix it to keep track
	 * of the seqnos of the dupacks so that rpseq and rpdupack are correct
	 * -sorbo.
	 */
	/* need to bootstrap */
	if (hctx->ccid2hctx_rpdupack == -1) {
		hctx->ccid2hctx_rpdupack = 0;
		hctx->ccid2hctx_rpseq = seqno;
562
	} else {
563
		/* check if packet is consecutive */
564 565
		if (dccp_delta_seqno(hctx->ccid2hctx_rpseq, seqno) == 1)
			hctx->ccid2hctx_rpseq = seqno;
566 567 568 569 570 571 572 573 574 575
		/* it's a later packet */
		else if (after48(seqno, hctx->ccid2hctx_rpseq)) {
			hctx->ccid2hctx_rpdupack++;

			/* check if we got enough dupacks */
			if (hctx->ccid2hctx_rpdupack >=
			    hctx->ccid2hctx_numdupack) {
				hctx->ccid2hctx_rpdupack = -1; /* XXX lame */
				hctx->ccid2hctx_rpseq = 0;

576
				ccid2_change_l_ack_ratio(sk, 2 * dp->dccps_l_ack_ratio);
577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594
			}
		}
	}

	/* check forward path congestion */
	/* still didn't send out new data packets */
	if (hctx->ccid2hctx_seqh == hctx->ccid2hctx_seqt)
		return;

	switch (DCCP_SKB_CB(skb)->dccpd_type) {
	case DCCP_PKT_ACK:
	case DCCP_PKT_DATAACK:
		break;
	default:
		return;
	}

	ackno = DCCP_SKB_CB(skb)->dccpd_ack_seq;
A
Andrea Bittau 已提交
595 596 597 598 599 600 601 602 603 604 605
	if (after48(ackno, hctx->ccid2hctx_high_ack))
		hctx->ccid2hctx_high_ack = ackno;

	seqp = hctx->ccid2hctx_seqt;
	while (before48(seqp->ccid2s_seq, ackno)) {
		seqp = seqp->ccid2s_next;
		if (seqp == hctx->ccid2hctx_seqh) {
			seqp = hctx->ccid2hctx_seqh->ccid2s_prev;
			break;
		}
	}
606 607 608 609 610 611 612 613 614 615 616 617 618 619

	/* If in slow-start, cwnd can increase at most Ack Ratio / 2 packets for
	 * this single ack.  I round up.
	 * -sorbo.
	 */
	maxincr = dp->dccps_l_ack_ratio >> 1;
	maxincr++;

	/* go through all ack vectors */
	while ((offset = ccid2_ackvector(sk, skb, offset,
					 &vector, &veclen)) != -1) {
		/* go through this ack vector */
		while (veclen--) {
			const u8 rl = *vector & DCCP_ACKVEC_LEN_MASK;
620
			u64 ackno_end_rl = SUB48(ackno, rl);
621

R
Randy Dunlap 已提交
622 623 624
			ccid2_pr_debug("ackvec start:%llu end:%llu\n",
				       (unsigned long long)ackno,
				       (unsigned long long)ackno_end_rl);
625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642
			/* if the seqno we are analyzing is larger than the
			 * current ackno, then move towards the tail of our
			 * seqnos.
			 */
			while (after48(seqp->ccid2s_seq, ackno)) {
				if (seqp == hctx->ccid2hctx_seqt) {
					done = 1;
					break;
				}
				seqp = seqp->ccid2s_prev;
			}
			if (done)
				break;

			/* check all seqnos in the range of the vector
			 * run length
			 */
			while (between48(seqp->ccid2s_seq,ackno_end_rl,ackno)) {
643 644
				const u8 state = *vector &
						 DCCP_ACKVEC_STATE_MASK;
645 646 647 648

				/* new packet received or marked */
				if (state != DCCP_ACKVEC_STATE_NOT_RECEIVED &&
				    !seqp->ccid2s_acked) {
649
					if (state ==
650
					    DCCP_ACKVEC_STATE_ECN_MARKED) {
651
						ccid2_congestion_event(hctx,
652
								       seqp);
653
					} else
654 655 656 657 658
						ccid2_new_ack(sk, seqp,
							      &maxincr);

					seqp->ccid2s_acked = 1;
					ccid2_pr_debug("Got ack for %llu\n",
R
Randy Dunlap 已提交
659
						       (unsigned long long)seqp->ccid2s_seq);
660
					ccid2_hc_tx_dec_pipe(sk);
661 662 663 664 665
				}
				if (seqp == hctx->ccid2hctx_seqt) {
					done = 1;
					break;
				}
666
				seqp = seqp->ccid2s_prev;
667 668 669 670
			}
			if (done)
				break;

671
			ackno = SUB48(ackno_end_rl, 1);
672 673 674 675 676 677 678 679 680
			vector++;
		}
		if (done)
			break;
	}

	/* The state about what is acked should be correct now
	 * Check for NUMDUPACK
	 */
A
Andrea Bittau 已提交
681 682 683 684 685 686 687 688
	seqp = hctx->ccid2hctx_seqt;
	while (before48(seqp->ccid2s_seq, hctx->ccid2hctx_high_ack)) {
		seqp = seqp->ccid2s_next;
		if (seqp == hctx->ccid2hctx_seqh) {
			seqp = hctx->ccid2hctx_seqh->ccid2s_prev;
			break;
		}
	}
689 690 691 692
	done = 0;
	while (1) {
		if (seqp->ccid2s_acked) {
			done++;
693
			if (done == hctx->ccid2hctx_numdupack)
694 695
				break;
		}
696
		if (seqp == hctx->ccid2hctx_seqt)
697 698 699 700 701 702 703 704 705 706 707 708 709
			break;
		seqp = seqp->ccid2s_prev;
	}

	/* If there are at least 3 acknowledgements, anything unacknowledged
	 * below the last sequence number is considered lost
	 */
	if (done == hctx->ccid2hctx_numdupack) {
		struct ccid2_seq *last_acked = seqp;

		/* check for lost packets */
		while (1) {
			if (!seqp->ccid2s_acked) {
710
				ccid2_pr_debug("Packet lost: %llu\n",
R
Randy Dunlap 已提交
711
					       (unsigned long long)seqp->ccid2s_seq);
712 713 714 715 716
				/* XXX need to traverse from tail -> head in
				 * order to detect multiple congestion events in
				 * one ack vector.
				 */
				ccid2_congestion_event(hctx, seqp);
717
				ccid2_hc_tx_dec_pipe(sk);
718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737
			}
			if (seqp == hctx->ccid2hctx_seqt)
				break;
			seqp = seqp->ccid2s_prev;
		}

		hctx->ccid2hctx_seqt = last_acked;
	}

	/* trim acked packets in tail */
	while (hctx->ccid2hctx_seqt != hctx->ccid2hctx_seqh) {
		if (!hctx->ccid2hctx_seqt->ccid2s_acked)
			break;

		hctx->ccid2hctx_seqt = hctx->ccid2hctx_seqt->ccid2s_next;
	}

	ccid2_hc_tx_check_sanity(hctx);
}

738
static int ccid2_hc_tx_init(struct ccid *ccid, struct sock *sk)
739
{
740
	struct ccid2_hc_tx_sock *hctx = ccid_priv(ccid);
741

742
	ccid2_change_cwnd(hctx, 1);
743 744 745 746 747
	/* Initialize ssthresh to infinity.  This means that we will exit the
	 * initial slow-start after the first packet loss.  This is what we
	 * want.
	 */
	hctx->ccid2hctx_ssthresh  = ~0;
748 749 750
	hctx->ccid2hctx_numdupack = 3;

	/* XXX init ~ to window size... */
G
Gerrit Renker 已提交
751
	if (ccid2_hc_tx_alloc_seq(hctx))
752
		return -ENOMEM;
753

754
	hctx->ccid2hctx_rto	 = 3 * HZ;
755
	ccid2_change_srtt(hctx, -1);
756 757
	hctx->ccid2hctx_rttvar	 = -1;
	hctx->ccid2hctx_rpdupack = -1;
758
	hctx->ccid2hctx_last_cong = jiffies;
759 760
	setup_timer(&hctx->ccid2hctx_rtotimer, ccid2_hc_tx_rto_expire,
			(unsigned long)sk);
761 762 763 764 765 766 767

	ccid2_hc_tx_check_sanity(hctx);
	return 0;
}

static void ccid2_hc_tx_exit(struct sock *sk)
{
768
	struct ccid2_hc_tx_sock *hctx = ccid2_hc_tx_sk(sk);
769
	int i;
770

771
	ccid2_hc_tx_kill_rto_timer(sk);
772 773 774 775

	for (i = 0; i < hctx->ccid2hctx_seqbufc; i++)
		kfree(hctx->ccid2hctx_seqbuf[i]);
	hctx->ccid2hctx_seqbufc = 0;
776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794
}

static void ccid2_hc_rx_packet_recv(struct sock *sk, struct sk_buff *skb)
{
	const struct dccp_sock *dp = dccp_sk(sk);
	struct ccid2_hc_rx_sock *hcrx = ccid2_hc_rx_sk(sk);

	switch (DCCP_SKB_CB(skb)->dccpd_type) {
	case DCCP_PKT_DATA:
	case DCCP_PKT_DATAACK:
		hcrx->ccid2hcrx_data++;
		if (hcrx->ccid2hcrx_data >= dp->dccps_r_ack_ratio) {
			dccp_send_ack(sk);
			hcrx->ccid2hcrx_data = 0;
		}
		break;
	}
}

795
static struct ccid_operations ccid2 = {
I
Ian McDonald 已提交
796
	.ccid_id		= DCCPC_CCID2,
797 798
	.ccid_name		= "ccid2",
	.ccid_owner		= THIS_MODULE,
799
	.ccid_hc_tx_obj_size	= sizeof(struct ccid2_hc_tx_sock),
800 801 802 803 804
	.ccid_hc_tx_init	= ccid2_hc_tx_init,
	.ccid_hc_tx_exit	= ccid2_hc_tx_exit,
	.ccid_hc_tx_send_packet	= ccid2_hc_tx_send_packet,
	.ccid_hc_tx_packet_sent	= ccid2_hc_tx_packet_sent,
	.ccid_hc_tx_packet_recv	= ccid2_hc_tx_packet_recv,
805
	.ccid_hc_rx_obj_size	= sizeof(struct ccid2_hc_rx_sock),
806 807 808
	.ccid_hc_rx_packet_recv	= ccid2_hc_rx_packet_recv,
};

809
#ifdef CONFIG_IP_DCCP_CCID2_DEBUG
810
module_param(ccid2_debug, bool, 0444);
811
MODULE_PARM_DESC(ccid2_debug, "Enable debug messages");
812
#endif
813 814 815 816 817 818 819 820 821 822 823 824 825 826

static __init int ccid2_module_init(void)
{
	return ccid_register(&ccid2);
}
module_init(ccid2_module_init);

static __exit void ccid2_module_exit(void)
{
	ccid_unregister(&ccid2);
}
module_exit(ccid2_module_exit);

MODULE_AUTHOR("Andrea Bittau <a.bittau@cs.ucl.ac.uk>");
827
MODULE_DESCRIPTION("DCCP TCP-Like (CCID2) CCID");
828 829
MODULE_LICENSE("GPL");
MODULE_ALIAS("net-dccp-ccid-2");