tcp_cong.c 10.9 KB
Newer Older
1
/*
2
 * Pluggable TCP congestion control support and newReno
3
 * congestion control.
4
 * Based on ideas from I/O scheduler support and Web100.
5 6 7 8
 *
 * Copyright (C) 2005 Stephen Hemminger <shemminger@osdl.org>
 */

9 10
#define pr_fmt(fmt) "TCP: " fmt

11 12 13 14
#include <linux/module.h>
#include <linux/mm.h>
#include <linux/types.h>
#include <linux/list.h>
15
#include <linux/gfp.h>
16
#include <linux/jhash.h>
17 18 19 20 21 22 23 24 25 26
#include <net/tcp.h>

static DEFINE_SPINLOCK(tcp_cong_list_lock);
static LIST_HEAD(tcp_cong_list);

/* Simple linear search, don't expect many entries! */
static struct tcp_congestion_ops *tcp_ca_find(const char *name)
{
	struct tcp_congestion_ops *e;

27
	list_for_each_entry_rcu(e, &tcp_cong_list, list) {
28 29 30 31 32 33 34
		if (strcmp(e->name, name) == 0)
			return e;
	}

	return NULL;
}

35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62
/* Must be called with rcu lock held */
static const struct tcp_congestion_ops *__tcp_ca_find_autoload(const char *name)
{
	const struct tcp_congestion_ops *ca = tcp_ca_find(name);
#ifdef CONFIG_MODULES
	if (!ca && capable(CAP_NET_ADMIN)) {
		rcu_read_unlock();
		request_module("tcp_%s", name);
		rcu_read_lock();
		ca = tcp_ca_find(name);
	}
#endif
	return ca;
}

/* Simple linear search, not much in here. */
struct tcp_congestion_ops *tcp_ca_find_key(u32 key)
{
	struct tcp_congestion_ops *e;

	list_for_each_entry_rcu(e, &tcp_cong_list, list) {
		if (e->key == key)
			return e;
	}

	return NULL;
}

63
/*
R
Robert P. J. Day 已提交
64
 * Attach new congestion control algorithm to the list
65 66 67 68 69 70 71
 * of available options.
 */
int tcp_register_congestion_control(struct tcp_congestion_ops *ca)
{
	int ret = 0;

	/* all algorithms must implement ssthresh and cong_avoid ops */
72
	if (!ca->ssthresh || !(ca->cong_avoid || ca->cong_control)) {
73
		pr_err("%s does not implement required ops\n", ca->name);
74 75 76
		return -EINVAL;
	}

77 78
	ca->key = jhash(ca->name, sizeof(ca->name), strlen(ca->name));

79
	spin_lock(&tcp_cong_list_lock);
80 81 82
	if (ca->key == TCP_CA_UNSPEC || tcp_ca_find_key(ca->key)) {
		pr_notice("%s already registered or non-unique key\n",
			  ca->name);
83 84
		ret = -EEXIST;
	} else {
85
		list_add_tail_rcu(&ca->list, &tcp_cong_list);
86
		pr_debug("%s registered\n", ca->name);
87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104
	}
	spin_unlock(&tcp_cong_list_lock);

	return ret;
}
EXPORT_SYMBOL_GPL(tcp_register_congestion_control);

/*
 * Remove congestion control algorithm, called from
 * the module's remove function.  Module ref counts are used
 * to ensure that this can't be done till all sockets using
 * that method are closed.
 */
void tcp_unregister_congestion_control(struct tcp_congestion_ops *ca)
{
	spin_lock(&tcp_cong_list_lock);
	list_del_rcu(&ca->list);
	spin_unlock(&tcp_cong_list_lock);
105 106 107 108 109 110 111 112 113

	/* Wait for outstanding readers to complete before the
	 * module gets removed entirely.
	 *
	 * A try_module_get() should fail by now as our module is
	 * in "going" state since no refs are held anymore and
	 * module_exit() handler being called.
	 */
	synchronize_rcu();
114 115 116
}
EXPORT_SYMBOL_GPL(tcp_unregister_congestion_control);

117
u32 tcp_ca_get_key_by_name(const char *name, bool *ecn_ca)
118 119
{
	const struct tcp_congestion_ops *ca;
120
	u32 key = TCP_CA_UNSPEC;
121 122 123 124 125

	might_sleep();

	rcu_read_lock();
	ca = __tcp_ca_find_autoload(name);
126 127 128 129
	if (ca) {
		key = ca->key;
		*ecn_ca = ca->flags & TCP_CONG_NEEDS_ECN;
	}
130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151
	rcu_read_unlock();

	return key;
}
EXPORT_SYMBOL_GPL(tcp_ca_get_key_by_name);

char *tcp_ca_get_name_by_key(u32 key, char *buffer)
{
	const struct tcp_congestion_ops *ca;
	char *ret = NULL;

	rcu_read_lock();
	ca = tcp_ca_find_key(key);
	if (ca)
		ret = strncpy(buffer, ca->name,
			      TCP_CA_NAME_MAX);
	rcu_read_unlock();

	return ret;
}
EXPORT_SYMBOL_GPL(tcp_ca_get_name_by_key);

152
/* Assign choice of congestion control. */
153
void tcp_assign_congestion_control(struct sock *sk)
154
{
155
	struct inet_connection_sock *icsk = inet_csk(sk);
156 157
	struct tcp_congestion_ops *ca;

158 159 160 161 162
	rcu_read_lock();
	list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
		if (likely(try_module_get(ca->owner))) {
			icsk->icsk_ca_ops = ca;
			goto out;
163
		}
164 165 166
		/* Fallback to next available. The last really
		 * guaranteed fallback is Reno from this list.
		 */
167
	}
168 169 170 171 172 173 174 175
out:
	rcu_read_unlock();

	/* Clear out private data before diag gets it and
	 * the ca has not been initialized.
	 */
	if (ca->get_info)
		memset(icsk->icsk_ca_priv, 0, sizeof(icsk->icsk_ca_priv));
176 177 178 179
	if (ca->flags & TCP_CONG_NEEDS_ECN)
		INET_ECN_xmit(sk);
	else
		INET_ECN_dontxmit(sk);
180 181 182 183 184
}

void tcp_init_congestion_control(struct sock *sk)
{
	const struct inet_connection_sock *icsk = inet_csk(sk);
185

186 187
	if (icsk->icsk_ca_ops->init)
		icsk->icsk_ca_ops->init(sk);
188 189 190 191
	if (tcp_ca_needs_ecn(sk))
		INET_ECN_xmit(sk);
	else
		INET_ECN_dontxmit(sk);
192 193
}

194 195 196 197 198 199 200
static void tcp_reinit_congestion_control(struct sock *sk,
					  const struct tcp_congestion_ops *ca)
{
	struct inet_connection_sock *icsk = inet_csk(sk);

	tcp_cleanup_congestion_control(sk);
	icsk->icsk_ca_ops = ca;
201
	icsk->icsk_ca_setsockopt = 1;
202

203 204
	if (sk->sk_state != TCP_CLOSE)
		tcp_init_congestion_control(sk);
205 206
}

207
/* Manage refcounts on socket close. */
208
void tcp_cleanup_congestion_control(struct sock *sk)
209
{
210 211 212 213 214
	struct inet_connection_sock *icsk = inet_csk(sk);

	if (icsk->icsk_ca_ops->release)
		icsk->icsk_ca_ops->release(sk);
	module_put(icsk->icsk_ca_ops->owner);
215 216 217 218 219 220 221 222 223 224
}

/* Used by sysctl to change default congestion control */
int tcp_set_default_congestion_control(const char *name)
{
	struct tcp_congestion_ops *ca;
	int ret = -ENOENT;

	spin_lock(&tcp_cong_list_lock);
	ca = tcp_ca_find(name);
225
#ifdef CONFIG_MODULES
226
	if (!ca && capable(CAP_NET_ADMIN)) {
227 228 229 230 231 232 233 234 235
		spin_unlock(&tcp_cong_list_lock);

		request_module("tcp_%s", name);
		spin_lock(&tcp_cong_list_lock);
		ca = tcp_ca_find(name);
	}
#endif

	if (ca) {
236
		ca->flags |= TCP_CONG_NON_RESTRICTED;	/* default is always allowed */
237 238 239 240 241 242 243 244
		list_move(&ca->list, &tcp_cong_list);
		ret = 0;
	}
	spin_unlock(&tcp_cong_list_lock);

	return ret;
}

245 246 247 248 249 250 251
/* Set default value from kernel configuration at bootup */
static int __init tcp_congestion_default(void)
{
	return tcp_set_default_congestion_control(CONFIG_DEFAULT_TCP_CONG);
}
late_initcall(tcp_congestion_default);

252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
/* Build string with list of available congestion control values */
void tcp_get_available_congestion_control(char *buf, size_t maxlen)
{
	struct tcp_congestion_ops *ca;
	size_t offs = 0;

	rcu_read_lock();
	list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
		offs += snprintf(buf + offs, maxlen - offs,
				 "%s%s",
				 offs == 0 ? "" : " ", ca->name);
	}
	rcu_read_unlock();
}

267 268 269 270 271 272 273 274 275 276 277 278 279
/* Get current default congestion control */
void tcp_get_default_congestion_control(char *name)
{
	struct tcp_congestion_ops *ca;
	/* We will always have reno... */
	BUG_ON(list_empty(&tcp_cong_list));

	rcu_read_lock();
	ca = list_entry(tcp_cong_list.next, struct tcp_congestion_ops, list);
	strncpy(name, ca->name, TCP_CA_NAME_MAX);
	rcu_read_unlock();
}

280 281 282 283 284 285 286 287 288
/* Built list of non-restricted congestion control values */
void tcp_get_allowed_congestion_control(char *buf, size_t maxlen)
{
	struct tcp_congestion_ops *ca;
	size_t offs = 0;

	*buf = '\0';
	rcu_read_lock();
	list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
289
		if (!(ca->flags & TCP_CONG_NON_RESTRICTED))
290 291 292 293 294 295 296 297 298 299 300 301
			continue;
		offs += snprintf(buf + offs, maxlen - offs,
				 "%s%s",
				 offs == 0 ? "" : " ", ca->name);
	}
	rcu_read_unlock();
}

/* Change list of non-restricted congestion control */
int tcp_set_allowed_congestion_control(char *val)
{
	struct tcp_congestion_ops *ca;
302
	char *saved_clone, *clone, *name;
303 304
	int ret = 0;

305
	saved_clone = clone = kstrdup(val, GFP_USER);
306 307 308 309 310 311 312 313 314 315 316 317 318
	if (!clone)
		return -ENOMEM;

	spin_lock(&tcp_cong_list_lock);
	/* pass 1 check for bad entries */
	while ((name = strsep(&clone, " ")) && *name) {
		ca = tcp_ca_find(name);
		if (!ca) {
			ret = -ENOENT;
			goto out;
		}
	}

319
	/* pass 2 clear old values */
320
	list_for_each_entry_rcu(ca, &tcp_cong_list, list)
321
		ca->flags &= ~TCP_CONG_NON_RESTRICTED;
322 323 324 325 326 327

	/* pass 3 mark as allowed */
	while ((name = strsep(&val, " ")) && *name) {
		ca = tcp_ca_find(name);
		WARN_ON(!ca);
		if (ca)
328
			ca->flags |= TCP_CONG_NON_RESTRICTED;
329 330 331
	}
out:
	spin_unlock(&tcp_cong_list_lock);
332
	kfree(saved_clone);
333 334 335 336

	return ret;
}

337
/* Change congestion control for socket */
338
int tcp_set_congestion_control(struct sock *sk, const char *name)
339
{
340
	struct inet_connection_sock *icsk = inet_csk(sk);
341
	const struct tcp_congestion_ops *ca;
342 343
	int err = 0;

344 345
	if (icsk->icsk_ca_dst_locked)
		return -EPERM;
346

347 348 349
	rcu_read_lock();
	ca = __tcp_ca_find_autoload(name);
	/* No change asking for existing value */
350 351
	if (ca == icsk->icsk_ca_ops) {
		icsk->icsk_ca_setsockopt = 1;
352
		goto out;
353
	}
354 355
	if (!ca)
		err = -ENOENT;
356 357
	else if (!((ca->flags & TCP_CONG_NON_RESTRICTED) ||
		   ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN)))
358
		err = -EPERM;
359 360
	else if (!try_module_get(ca->owner))
		err = -EBUSY;
361 362
	else
		tcp_reinit_congestion_control(sk, ca);
363 364 365 366 367
 out:
	rcu_read_unlock();
	return err;
}

368 369 370 371 372 373 374 375
/* Slow start is used when congestion window is no greater than the slow start
 * threshold. We base on RFC2581 and also handle stretch ACKs properly.
 * We do not implement RFC3465 Appropriate Byte Counting (ABC) per se but
 * something better;) a packet is only considered (s)acked in its entirety to
 * defend the ACK attacks described in the RFC. Slow start processes a stretch
 * ACK of degree N as if N acks of degree 1 are received back to back except
 * ABC caps N to 2. Slow start exits when cwnd grows over ssthresh and
 * returns the leftover acks to adjust cwnd in congestion avoidance mode.
S
Stephen Hemminger 已提交
376
 */
N
Neal Cardwell 已提交
377
u32 tcp_slow_start(struct tcp_sock *tp, u32 acked)
S
Stephen Hemminger 已提交
378
{
379
	u32 cwnd = min(tp->snd_cwnd + acked, tp->snd_ssthresh);
380

N
Neal Cardwell 已提交
381
	acked -= cwnd - tp->snd_cwnd;
382
	tp->snd_cwnd = min(cwnd, tp->snd_cwnd_clamp);
N
Neal Cardwell 已提交
383 384

	return acked;
S
Stephen Hemminger 已提交
385 386 387
}
EXPORT_SYMBOL_GPL(tcp_slow_start);

388 389 390
/* In theory this is tp->snd_cwnd += 1 / tp->snd_cwnd (or alternative w),
 * for every packet that was ACKed.
 */
N
Neal Cardwell 已提交
391
void tcp_cong_avoid_ai(struct tcp_sock *tp, u32 w, u32 acked)
392
{
393 394 395 396 397 398
	/* If credits accumulated at a higher w, apply them gently now. */
	if (tp->snd_cwnd_cnt >= w) {
		tp->snd_cwnd_cnt = 0;
		tp->snd_cwnd++;
	}

399
	tp->snd_cwnd_cnt += acked;
400
	if (tp->snd_cwnd_cnt >= w) {
401 402 403 404
		u32 delta = tp->snd_cwnd_cnt / w;

		tp->snd_cwnd_cnt -= delta * w;
		tp->snd_cwnd += delta;
405
	}
406
	tp->snd_cwnd = min(tp->snd_cwnd, tp->snd_cwnd_clamp);
407 408 409
}
EXPORT_SYMBOL_GPL(tcp_cong_avoid_ai);

410 411 412 413 414 415 416
/*
 * TCP Reno congestion control
 * This is special case used for fallback as well.
 */
/* This is Jacobson's slow start and congestion avoidance.
 * SIGCOMM '88, p. 328.
 */
417
void tcp_reno_cong_avoid(struct sock *sk, u32 ack, u32 acked)
418
{
419 420
	struct tcp_sock *tp = tcp_sk(sk);

421
	if (!tcp_is_cwnd_limited(sk))
422 423
		return;

424
	/* In "safe" area, increase. */
425
	if (tcp_in_slow_start(tp)) {
426 427 428 429
		acked = tcp_slow_start(tp, acked);
		if (!acked)
			return;
	}
430
	/* In dangerous area, increase slowly. */
431
	tcp_cong_avoid_ai(tp, tp->snd_cwnd, acked);
432 433 434 435
}
EXPORT_SYMBOL_GPL(tcp_reno_cong_avoid);

/* Slow start threshold is half the congestion window (min 2) */
436
u32 tcp_reno_ssthresh(struct sock *sk)
437
{
438
	const struct tcp_sock *tp = tcp_sk(sk);
S
stephen hemminger 已提交
439

440 441 442 443 444
	return max(tp->snd_cwnd >> 1U, 2U);
}
EXPORT_SYMBOL_GPL(tcp_reno_ssthresh);

struct tcp_congestion_ops tcp_reno = {
445
	.flags		= TCP_CONG_NON_RESTRICTED,
446 447 448 449 450
	.name		= "reno",
	.owner		= THIS_MODULE,
	.ssthresh	= tcp_reno_ssthresh,
	.cong_avoid	= tcp_reno_cong_avoid,
};