usb: gadgetfs: restrict upper bound on device configuration size
[linux/fpc-iii.git] / net / ipv4 / tcp_cong.c
blobf9038d6b109eb41b2d8a3898a2c7ff6519f2c49b
1 /*
2 * Pluggable TCP congestion control support and newReno
3 * congestion control.
4 * Based on ideas from I/O scheduler support and Web100.
6 * Copyright (C) 2005 Stephen Hemminger <shemminger@osdl.org>
7 */
9 #define pr_fmt(fmt) "TCP: " fmt
11 #include <linux/module.h>
12 #include <linux/mm.h>
13 #include <linux/types.h>
14 #include <linux/list.h>
15 #include <linux/gfp.h>
16 #include <linux/jhash.h>
17 #include <net/tcp.h>
19 static DEFINE_SPINLOCK(tcp_cong_list_lock);
20 static LIST_HEAD(tcp_cong_list);
22 /* Simple linear search, don't expect many entries! */
23 static struct tcp_congestion_ops *tcp_ca_find(const char *name)
25 struct tcp_congestion_ops *e;
27 list_for_each_entry_rcu(e, &tcp_cong_list, list) {
28 if (strcmp(e->name, name) == 0)
29 return e;
32 return NULL;
35 /* Must be called with rcu lock held */
36 static const struct tcp_congestion_ops *__tcp_ca_find_autoload(const char *name)
38 const struct tcp_congestion_ops *ca = tcp_ca_find(name);
39 #ifdef CONFIG_MODULES
40 if (!ca && capable(CAP_NET_ADMIN)) {
41 rcu_read_unlock();
42 request_module("tcp_%s", name);
43 rcu_read_lock();
44 ca = tcp_ca_find(name);
46 #endif
47 return ca;
50 /* Simple linear search, not much in here. */
51 struct tcp_congestion_ops *tcp_ca_find_key(u32 key)
53 struct tcp_congestion_ops *e;
55 list_for_each_entry_rcu(e, &tcp_cong_list, list) {
56 if (e->key == key)
57 return e;
60 return NULL;
64 * Attach new congestion control algorithm to the list
65 * of available options.
67 int tcp_register_congestion_control(struct tcp_congestion_ops *ca)
69 int ret = 0;
71 /* 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 return -EINVAL;
77 ca->key = jhash(ca->name, sizeof(ca->name), strlen(ca->name));
79 spin_lock(&tcp_cong_list_lock);
80 if (ca->key == TCP_CA_UNSPEC || tcp_ca_find_key(ca->key)) {
81 pr_notice("%s already registered or non-unique key\n",
82 ca->name);
83 ret = -EEXIST;
84 } else {
85 list_add_tail_rcu(&ca->list, &tcp_cong_list);
86 pr_debug("%s registered\n", ca->name);
88 spin_unlock(&tcp_cong_list_lock);
90 return ret;
92 EXPORT_SYMBOL_GPL(tcp_register_congestion_control);
95 * Remove congestion control algorithm, called from
96 * the module's remove function. Module ref counts are used
97 * to ensure that this can't be done till all sockets using
98 * that method are closed.
100 void tcp_unregister_congestion_control(struct tcp_congestion_ops *ca)
102 spin_lock(&tcp_cong_list_lock);
103 list_del_rcu(&ca->list);
104 spin_unlock(&tcp_cong_list_lock);
106 /* Wait for outstanding readers to complete before the
107 * module gets removed entirely.
109 * A try_module_get() should fail by now as our module is
110 * in "going" state since no refs are held anymore and
111 * module_exit() handler being called.
113 synchronize_rcu();
115 EXPORT_SYMBOL_GPL(tcp_unregister_congestion_control);
117 u32 tcp_ca_get_key_by_name(const char *name, bool *ecn_ca)
119 const struct tcp_congestion_ops *ca;
120 u32 key = TCP_CA_UNSPEC;
122 might_sleep();
124 rcu_read_lock();
125 ca = __tcp_ca_find_autoload(name);
126 if (ca) {
127 key = ca->key;
128 *ecn_ca = ca->flags & TCP_CONG_NEEDS_ECN;
130 rcu_read_unlock();
132 return key;
134 EXPORT_SYMBOL_GPL(tcp_ca_get_key_by_name);
136 char *tcp_ca_get_name_by_key(u32 key, char *buffer)
138 const struct tcp_congestion_ops *ca;
139 char *ret = NULL;
141 rcu_read_lock();
142 ca = tcp_ca_find_key(key);
143 if (ca)
144 ret = strncpy(buffer, ca->name,
145 TCP_CA_NAME_MAX);
146 rcu_read_unlock();
148 return ret;
150 EXPORT_SYMBOL_GPL(tcp_ca_get_name_by_key);
152 /* Assign choice of congestion control. */
153 void tcp_assign_congestion_control(struct sock *sk)
155 struct inet_connection_sock *icsk = inet_csk(sk);
156 struct tcp_congestion_ops *ca;
158 rcu_read_lock();
159 list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
160 if (likely(try_module_get(ca->owner))) {
161 icsk->icsk_ca_ops = ca;
162 goto out;
164 /* Fallback to next available. The last really
165 * guaranteed fallback is Reno from this list.
168 out:
169 rcu_read_unlock();
171 /* Clear out private data before diag gets it and
172 * the ca has not been initialized.
174 if (ca->get_info)
175 memset(icsk->icsk_ca_priv, 0, sizeof(icsk->icsk_ca_priv));
176 if (ca->flags & TCP_CONG_NEEDS_ECN)
177 INET_ECN_xmit(sk);
178 else
179 INET_ECN_dontxmit(sk);
182 void tcp_init_congestion_control(struct sock *sk)
184 const struct inet_connection_sock *icsk = inet_csk(sk);
186 if (icsk->icsk_ca_ops->init)
187 icsk->icsk_ca_ops->init(sk);
188 if (tcp_ca_needs_ecn(sk))
189 INET_ECN_xmit(sk);
190 else
191 INET_ECN_dontxmit(sk);
194 static void tcp_reinit_congestion_control(struct sock *sk,
195 const struct tcp_congestion_ops *ca)
197 struct inet_connection_sock *icsk = inet_csk(sk);
199 tcp_cleanup_congestion_control(sk);
200 icsk->icsk_ca_ops = ca;
201 icsk->icsk_ca_setsockopt = 1;
203 if (sk->sk_state != TCP_CLOSE) {
204 memset(icsk->icsk_ca_priv, 0, sizeof(icsk->icsk_ca_priv));
205 tcp_init_congestion_control(sk);
209 /* Manage refcounts on socket close. */
210 void tcp_cleanup_congestion_control(struct sock *sk)
212 struct inet_connection_sock *icsk = inet_csk(sk);
214 if (icsk->icsk_ca_ops->release)
215 icsk->icsk_ca_ops->release(sk);
216 module_put(icsk->icsk_ca_ops->owner);
219 /* Used by sysctl to change default congestion control */
220 int tcp_set_default_congestion_control(const char *name)
222 struct tcp_congestion_ops *ca;
223 int ret = -ENOENT;
225 spin_lock(&tcp_cong_list_lock);
226 ca = tcp_ca_find(name);
227 #ifdef CONFIG_MODULES
228 if (!ca && capable(CAP_NET_ADMIN)) {
229 spin_unlock(&tcp_cong_list_lock);
231 request_module("tcp_%s", name);
232 spin_lock(&tcp_cong_list_lock);
233 ca = tcp_ca_find(name);
235 #endif
237 if (ca) {
238 ca->flags |= TCP_CONG_NON_RESTRICTED; /* default is always allowed */
239 list_move(&ca->list, &tcp_cong_list);
240 ret = 0;
242 spin_unlock(&tcp_cong_list_lock);
244 return ret;
247 /* Set default value from kernel configuration at bootup */
248 static int __init tcp_congestion_default(void)
250 return tcp_set_default_congestion_control(CONFIG_DEFAULT_TCP_CONG);
252 late_initcall(tcp_congestion_default);
254 /* Build string with list of available congestion control values */
255 void tcp_get_available_congestion_control(char *buf, size_t maxlen)
257 struct tcp_congestion_ops *ca;
258 size_t offs = 0;
260 rcu_read_lock();
261 list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
262 offs += snprintf(buf + offs, maxlen - offs,
263 "%s%s",
264 offs == 0 ? "" : " ", ca->name);
266 rcu_read_unlock();
269 /* Get current default congestion control */
270 void tcp_get_default_congestion_control(char *name)
272 struct tcp_congestion_ops *ca;
273 /* We will always have reno... */
274 BUG_ON(list_empty(&tcp_cong_list));
276 rcu_read_lock();
277 ca = list_entry(tcp_cong_list.next, struct tcp_congestion_ops, list);
278 strncpy(name, ca->name, TCP_CA_NAME_MAX);
279 rcu_read_unlock();
282 /* Built list of non-restricted congestion control values */
283 void tcp_get_allowed_congestion_control(char *buf, size_t maxlen)
285 struct tcp_congestion_ops *ca;
286 size_t offs = 0;
288 *buf = '\0';
289 rcu_read_lock();
290 list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
291 if (!(ca->flags & TCP_CONG_NON_RESTRICTED))
292 continue;
293 offs += snprintf(buf + offs, maxlen - offs,
294 "%s%s",
295 offs == 0 ? "" : " ", ca->name);
297 rcu_read_unlock();
300 /* Change list of non-restricted congestion control */
301 int tcp_set_allowed_congestion_control(char *val)
303 struct tcp_congestion_ops *ca;
304 char *saved_clone, *clone, *name;
305 int ret = 0;
307 saved_clone = clone = kstrdup(val, GFP_USER);
308 if (!clone)
309 return -ENOMEM;
311 spin_lock(&tcp_cong_list_lock);
312 /* pass 1 check for bad entries */
313 while ((name = strsep(&clone, " ")) && *name) {
314 ca = tcp_ca_find(name);
315 if (!ca) {
316 ret = -ENOENT;
317 goto out;
321 /* pass 2 clear old values */
322 list_for_each_entry_rcu(ca, &tcp_cong_list, list)
323 ca->flags &= ~TCP_CONG_NON_RESTRICTED;
325 /* pass 3 mark as allowed */
326 while ((name = strsep(&val, " ")) && *name) {
327 ca = tcp_ca_find(name);
328 WARN_ON(!ca);
329 if (ca)
330 ca->flags |= TCP_CONG_NON_RESTRICTED;
332 out:
333 spin_unlock(&tcp_cong_list_lock);
334 kfree(saved_clone);
336 return ret;
339 /* Change congestion control for socket */
340 int tcp_set_congestion_control(struct sock *sk, const char *name)
342 struct inet_connection_sock *icsk = inet_csk(sk);
343 const struct tcp_congestion_ops *ca;
344 int err = 0;
346 if (icsk->icsk_ca_dst_locked)
347 return -EPERM;
349 rcu_read_lock();
350 ca = __tcp_ca_find_autoload(name);
351 /* No change asking for existing value */
352 if (ca == icsk->icsk_ca_ops) {
353 icsk->icsk_ca_setsockopt = 1;
354 goto out;
356 if (!ca)
357 err = -ENOENT;
358 else if (!((ca->flags & TCP_CONG_NON_RESTRICTED) ||
359 ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN)))
360 err = -EPERM;
361 else if (!try_module_get(ca->owner))
362 err = -EBUSY;
363 else
364 tcp_reinit_congestion_control(sk, ca);
365 out:
366 rcu_read_unlock();
367 return err;
370 /* Slow start is used when congestion window is no greater than the slow start
371 * threshold. We base on RFC2581 and also handle stretch ACKs properly.
372 * We do not implement RFC3465 Appropriate Byte Counting (ABC) per se but
373 * something better;) a packet is only considered (s)acked in its entirety to
374 * defend the ACK attacks described in the RFC. Slow start processes a stretch
375 * ACK of degree N as if N acks of degree 1 are received back to back except
376 * ABC caps N to 2. Slow start exits when cwnd grows over ssthresh and
377 * returns the leftover acks to adjust cwnd in congestion avoidance mode.
379 u32 tcp_slow_start(struct tcp_sock *tp, u32 acked)
381 u32 cwnd = min(tp->snd_cwnd + acked, tp->snd_ssthresh);
383 acked -= cwnd - tp->snd_cwnd;
384 tp->snd_cwnd = min(cwnd, tp->snd_cwnd_clamp);
386 return acked;
388 EXPORT_SYMBOL_GPL(tcp_slow_start);
390 /* In theory this is tp->snd_cwnd += 1 / tp->snd_cwnd (or alternative w),
391 * for every packet that was ACKed.
393 void tcp_cong_avoid_ai(struct tcp_sock *tp, u32 w, u32 acked)
395 /* If credits accumulated at a higher w, apply them gently now. */
396 if (tp->snd_cwnd_cnt >= w) {
397 tp->snd_cwnd_cnt = 0;
398 tp->snd_cwnd++;
401 tp->snd_cwnd_cnt += acked;
402 if (tp->snd_cwnd_cnt >= w) {
403 u32 delta = tp->snd_cwnd_cnt / w;
405 tp->snd_cwnd_cnt -= delta * w;
406 tp->snd_cwnd += delta;
408 tp->snd_cwnd = min(tp->snd_cwnd, tp->snd_cwnd_clamp);
410 EXPORT_SYMBOL_GPL(tcp_cong_avoid_ai);
413 * TCP Reno congestion control
414 * This is special case used for fallback as well.
416 /* This is Jacobson's slow start and congestion avoidance.
417 * SIGCOMM '88, p. 328.
419 void tcp_reno_cong_avoid(struct sock *sk, u32 ack, u32 acked)
421 struct tcp_sock *tp = tcp_sk(sk);
423 if (!tcp_is_cwnd_limited(sk))
424 return;
426 /* In "safe" area, increase. */
427 if (tcp_in_slow_start(tp)) {
428 acked = tcp_slow_start(tp, acked);
429 if (!acked)
430 return;
432 /* In dangerous area, increase slowly. */
433 tcp_cong_avoid_ai(tp, tp->snd_cwnd, acked);
435 EXPORT_SYMBOL_GPL(tcp_reno_cong_avoid);
437 /* Slow start threshold is half the congestion window (min 2) */
438 u32 tcp_reno_ssthresh(struct sock *sk)
440 const struct tcp_sock *tp = tcp_sk(sk);
442 return max(tp->snd_cwnd >> 1U, 2U);
444 EXPORT_SYMBOL_GPL(tcp_reno_ssthresh);
446 struct tcp_congestion_ops tcp_reno = {
447 .flags = TCP_CONG_NON_RESTRICTED,
448 .name = "reno",
449 .owner = THIS_MODULE,
450 .ssthresh = tcp_reno_ssthresh,
451 .cong_avoid = tcp_reno_cong_avoid,