blob: 6d5600889dcfa697199b346ec855564b28533f62 [file] [log] [blame]
David Brazdil0f672f62019-12-10 10:32:29 +00001// SPDX-License-Identifier: GPL-2.0-only
Andrew Scullb4b6d4a2019-01-02 15:54:55 +00002/*
3 * Pluggable TCP congestion control support and newReno
4 * congestion control.
5 * Based on ideas from I/O scheduler support and Web100.
6 *
7 * Copyright (C) 2005 Stephen Hemminger <shemminger@osdl.org>
8 */
9
10#define pr_fmt(fmt) "TCP: " fmt
11
12#include <linux/module.h>
13#include <linux/mm.h>
14#include <linux/types.h>
15#include <linux/list.h>
16#include <linux/gfp.h>
17#include <linux/jhash.h>
18#include <net/tcp.h>
19
20static DEFINE_SPINLOCK(tcp_cong_list_lock);
21static LIST_HEAD(tcp_cong_list);
22
23/* Simple linear search, don't expect many entries! */
24static struct tcp_congestion_ops *tcp_ca_find(const char *name)
25{
26 struct tcp_congestion_ops *e;
27
28 list_for_each_entry_rcu(e, &tcp_cong_list, list) {
29 if (strcmp(e->name, name) == 0)
30 return e;
31 }
32
33 return NULL;
34}
35
36/* Must be called with rcu lock held */
37static struct tcp_congestion_ops *tcp_ca_find_autoload(struct net *net,
38 const char *name)
39{
40 struct tcp_congestion_ops *ca = tcp_ca_find(name);
41
42#ifdef CONFIG_MODULES
43 if (!ca && capable(CAP_NET_ADMIN)) {
44 rcu_read_unlock();
45 request_module("tcp_%s", name);
46 rcu_read_lock();
47 ca = tcp_ca_find(name);
48 }
49#endif
50 return ca;
51}
52
53/* Simple linear search, not much in here. */
54struct tcp_congestion_ops *tcp_ca_find_key(u32 key)
55{
56 struct tcp_congestion_ops *e;
57
58 list_for_each_entry_rcu(e, &tcp_cong_list, list) {
59 if (e->key == key)
60 return e;
61 }
62
63 return NULL;
64}
65
66/*
67 * Attach new congestion control algorithm to the list
68 * of available options.
69 */
70int tcp_register_congestion_control(struct tcp_congestion_ops *ca)
71{
72 int ret = 0;
73
74 /* all algorithms must implement these */
75 if (!ca->ssthresh || !ca->undo_cwnd ||
76 !(ca->cong_avoid || ca->cong_control)) {
77 pr_err("%s does not implement required ops\n", ca->name);
78 return -EINVAL;
79 }
80
81 ca->key = jhash(ca->name, sizeof(ca->name), strlen(ca->name));
82
83 spin_lock(&tcp_cong_list_lock);
84 if (ca->key == TCP_CA_UNSPEC || tcp_ca_find_key(ca->key)) {
85 pr_notice("%s already registered or non-unique key\n",
86 ca->name);
87 ret = -EEXIST;
88 } else {
89 list_add_tail_rcu(&ca->list, &tcp_cong_list);
90 pr_debug("%s registered\n", ca->name);
91 }
92 spin_unlock(&tcp_cong_list_lock);
93
94 return ret;
95}
96EXPORT_SYMBOL_GPL(tcp_register_congestion_control);
97
98/*
99 * Remove congestion control algorithm, called from
100 * the module's remove function. Module ref counts are used
101 * to ensure that this can't be done till all sockets using
102 * that method are closed.
103 */
104void tcp_unregister_congestion_control(struct tcp_congestion_ops *ca)
105{
106 spin_lock(&tcp_cong_list_lock);
107 list_del_rcu(&ca->list);
108 spin_unlock(&tcp_cong_list_lock);
109
110 /* Wait for outstanding readers to complete before the
111 * module gets removed entirely.
112 *
113 * A try_module_get() should fail by now as our module is
114 * in "going" state since no refs are held anymore and
115 * module_exit() handler being called.
116 */
117 synchronize_rcu();
118}
119EXPORT_SYMBOL_GPL(tcp_unregister_congestion_control);
120
121u32 tcp_ca_get_key_by_name(struct net *net, const char *name, bool *ecn_ca)
122{
123 const struct tcp_congestion_ops *ca;
124 u32 key = TCP_CA_UNSPEC;
125
126 might_sleep();
127
128 rcu_read_lock();
129 ca = tcp_ca_find_autoload(net, name);
130 if (ca) {
131 key = ca->key;
132 *ecn_ca = ca->flags & TCP_CONG_NEEDS_ECN;
133 }
134 rcu_read_unlock();
135
136 return key;
137}
138EXPORT_SYMBOL_GPL(tcp_ca_get_key_by_name);
139
140char *tcp_ca_get_name_by_key(u32 key, char *buffer)
141{
142 const struct tcp_congestion_ops *ca;
143 char *ret = NULL;
144
145 rcu_read_lock();
146 ca = tcp_ca_find_key(key);
147 if (ca)
148 ret = strncpy(buffer, ca->name,
149 TCP_CA_NAME_MAX);
150 rcu_read_unlock();
151
152 return ret;
153}
154EXPORT_SYMBOL_GPL(tcp_ca_get_name_by_key);
155
156/* Assign choice of congestion control. */
157void tcp_assign_congestion_control(struct sock *sk)
158{
159 struct net *net = sock_net(sk);
160 struct inet_connection_sock *icsk = inet_csk(sk);
161 const struct tcp_congestion_ops *ca;
162
163 rcu_read_lock();
164 ca = rcu_dereference(net->ipv4.tcp_congestion_control);
165 if (unlikely(!try_module_get(ca->owner)))
166 ca = &tcp_reno;
167 icsk->icsk_ca_ops = ca;
168 rcu_read_unlock();
169
170 memset(icsk->icsk_ca_priv, 0, sizeof(icsk->icsk_ca_priv));
171 if (ca->flags & TCP_CONG_NEEDS_ECN)
172 INET_ECN_xmit(sk);
173 else
174 INET_ECN_dontxmit(sk);
175}
176
177void tcp_init_congestion_control(struct sock *sk)
178{
179 const struct inet_connection_sock *icsk = inet_csk(sk);
180
181 tcp_sk(sk)->prior_ssthresh = 0;
182 if (icsk->icsk_ca_ops->init)
183 icsk->icsk_ca_ops->init(sk);
184 if (tcp_ca_needs_ecn(sk))
185 INET_ECN_xmit(sk);
186 else
187 INET_ECN_dontxmit(sk);
188}
189
190static void tcp_reinit_congestion_control(struct sock *sk,
191 const struct tcp_congestion_ops *ca)
192{
193 struct inet_connection_sock *icsk = inet_csk(sk);
194
195 tcp_cleanup_congestion_control(sk);
196 icsk->icsk_ca_ops = ca;
197 icsk->icsk_ca_setsockopt = 1;
198 memset(icsk->icsk_ca_priv, 0, sizeof(icsk->icsk_ca_priv));
199
Olivier Deprez0e641232021-09-23 10:07:05 +0200200 if (ca->flags & TCP_CONG_NEEDS_ECN)
201 INET_ECN_xmit(sk);
202 else
203 INET_ECN_dontxmit(sk);
204
205 if (!((1 << sk->sk_state) & (TCPF_CLOSE | TCPF_LISTEN)))
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000206 tcp_init_congestion_control(sk);
207}
208
209/* Manage refcounts on socket close. */
210void tcp_cleanup_congestion_control(struct sock *sk)
211{
212 struct inet_connection_sock *icsk = inet_csk(sk);
213
214 if (icsk->icsk_ca_ops->release)
215 icsk->icsk_ca_ops->release(sk);
216 module_put(icsk->icsk_ca_ops->owner);
217}
218
219/* Used by sysctl to change default congestion control */
220int tcp_set_default_congestion_control(struct net *net, const char *name)
221{
222 struct tcp_congestion_ops *ca;
223 const struct tcp_congestion_ops *prev;
224 int ret;
225
226 rcu_read_lock();
227 ca = tcp_ca_find_autoload(net, name);
228 if (!ca) {
229 ret = -ENOENT;
230 } else if (!try_module_get(ca->owner)) {
231 ret = -EBUSY;
Olivier Deprez0e641232021-09-23 10:07:05 +0200232 } else if (!net_eq(net, &init_net) &&
233 !(ca->flags & TCP_CONG_NON_RESTRICTED)) {
234 /* Only init netns can set default to a restricted algorithm */
235 ret = -EPERM;
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000236 } else {
237 prev = xchg(&net->ipv4.tcp_congestion_control, ca);
238 if (prev)
239 module_put(prev->owner);
240
241 ca->flags |= TCP_CONG_NON_RESTRICTED;
242 ret = 0;
243 }
244 rcu_read_unlock();
245
246 return ret;
247}
248
249/* Set default value from kernel configuration at bootup */
250static int __init tcp_congestion_default(void)
251{
252 return tcp_set_default_congestion_control(&init_net,
253 CONFIG_DEFAULT_TCP_CONG);
254}
255late_initcall(tcp_congestion_default);
256
257/* Build string with list of available congestion control values */
258void tcp_get_available_congestion_control(char *buf, size_t maxlen)
259{
260 struct tcp_congestion_ops *ca;
261 size_t offs = 0;
262
263 rcu_read_lock();
264 list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
265 offs += snprintf(buf + offs, maxlen - offs,
266 "%s%s",
267 offs == 0 ? "" : " ", ca->name);
268 }
269 rcu_read_unlock();
270}
271
272/* Get current default congestion control */
273void tcp_get_default_congestion_control(struct net *net, char *name)
274{
275 const struct tcp_congestion_ops *ca;
276
277 rcu_read_lock();
278 ca = rcu_dereference(net->ipv4.tcp_congestion_control);
279 strncpy(name, ca->name, TCP_CA_NAME_MAX);
280 rcu_read_unlock();
281}
282
283/* Built list of non-restricted congestion control values */
284void tcp_get_allowed_congestion_control(char *buf, size_t maxlen)
285{
286 struct tcp_congestion_ops *ca;
287 size_t offs = 0;
288
289 *buf = '\0';
290 rcu_read_lock();
291 list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
292 if (!(ca->flags & TCP_CONG_NON_RESTRICTED))
293 continue;
294 offs += snprintf(buf + offs, maxlen - offs,
295 "%s%s",
296 offs == 0 ? "" : " ", ca->name);
297 }
298 rcu_read_unlock();
299}
300
301/* Change list of non-restricted congestion control */
302int tcp_set_allowed_congestion_control(char *val)
303{
304 struct tcp_congestion_ops *ca;
305 char *saved_clone, *clone, *name;
306 int ret = 0;
307
308 saved_clone = clone = kstrdup(val, GFP_USER);
309 if (!clone)
310 return -ENOMEM;
311
312 spin_lock(&tcp_cong_list_lock);
313 /* pass 1 check for bad entries */
314 while ((name = strsep(&clone, " ")) && *name) {
315 ca = tcp_ca_find(name);
316 if (!ca) {
317 ret = -ENOENT;
318 goto out;
319 }
320 }
321
322 /* pass 2 clear old values */
323 list_for_each_entry_rcu(ca, &tcp_cong_list, list)
324 ca->flags &= ~TCP_CONG_NON_RESTRICTED;
325
326 /* pass 3 mark as allowed */
327 while ((name = strsep(&val, " ")) && *name) {
328 ca = tcp_ca_find(name);
329 WARN_ON(!ca);
330 if (ca)
331 ca->flags |= TCP_CONG_NON_RESTRICTED;
332 }
333out:
334 spin_unlock(&tcp_cong_list_lock);
335 kfree(saved_clone);
336
337 return ret;
338}
339
340/* Change congestion control for socket. If load is false, then it is the
341 * responsibility of the caller to call tcp_init_congestion_control or
342 * tcp_reinit_congestion_control (if the current congestion control was
343 * already initialized.
344 */
David Brazdil0f672f62019-12-10 10:32:29 +0000345int tcp_set_congestion_control(struct sock *sk, const char *name, bool load,
346 bool reinit, bool cap_net_admin)
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000347{
348 struct inet_connection_sock *icsk = inet_csk(sk);
349 const struct tcp_congestion_ops *ca;
350 int err = 0;
351
352 if (icsk->icsk_ca_dst_locked)
353 return -EPERM;
354
355 rcu_read_lock();
356 if (!load)
357 ca = tcp_ca_find(name);
358 else
359 ca = tcp_ca_find_autoload(sock_net(sk), name);
360
361 /* No change asking for existing value */
362 if (ca == icsk->icsk_ca_ops) {
363 icsk->icsk_ca_setsockopt = 1;
364 goto out;
365 }
366
367 if (!ca) {
368 err = -ENOENT;
369 } else if (!load) {
370 const struct tcp_congestion_ops *old_ca = icsk->icsk_ca_ops;
371
372 if (try_module_get(ca->owner)) {
373 if (reinit) {
374 tcp_reinit_congestion_control(sk, ca);
375 } else {
376 icsk->icsk_ca_ops = ca;
377 module_put(old_ca->owner);
378 }
379 } else {
380 err = -EBUSY;
381 }
David Brazdil0f672f62019-12-10 10:32:29 +0000382 } else if (!((ca->flags & TCP_CONG_NON_RESTRICTED) || cap_net_admin)) {
Andrew Scullb4b6d4a2019-01-02 15:54:55 +0000383 err = -EPERM;
384 } else if (!try_module_get(ca->owner)) {
385 err = -EBUSY;
386 } else {
387 tcp_reinit_congestion_control(sk, ca);
388 }
389 out:
390 rcu_read_unlock();
391 return err;
392}
393
394/* Slow start is used when congestion window is no greater than the slow start
395 * threshold. We base on RFC2581 and also handle stretch ACKs properly.
396 * We do not implement RFC3465 Appropriate Byte Counting (ABC) per se but
397 * something better;) a packet is only considered (s)acked in its entirety to
398 * defend the ACK attacks described in the RFC. Slow start processes a stretch
399 * ACK of degree N as if N acks of degree 1 are received back to back except
400 * ABC caps N to 2. Slow start exits when cwnd grows over ssthresh and
401 * returns the leftover acks to adjust cwnd in congestion avoidance mode.
402 */
403u32 tcp_slow_start(struct tcp_sock *tp, u32 acked)
404{
405 u32 cwnd = min(tp->snd_cwnd + acked, tp->snd_ssthresh);
406
407 acked -= cwnd - tp->snd_cwnd;
408 tp->snd_cwnd = min(cwnd, tp->snd_cwnd_clamp);
409
410 return acked;
411}
412EXPORT_SYMBOL_GPL(tcp_slow_start);
413
414/* In theory this is tp->snd_cwnd += 1 / tp->snd_cwnd (or alternative w),
415 * for every packet that was ACKed.
416 */
417void tcp_cong_avoid_ai(struct tcp_sock *tp, u32 w, u32 acked)
418{
419 /* If credits accumulated at a higher w, apply them gently now. */
420 if (tp->snd_cwnd_cnt >= w) {
421 tp->snd_cwnd_cnt = 0;
422 tp->snd_cwnd++;
423 }
424
425 tp->snd_cwnd_cnt += acked;
426 if (tp->snd_cwnd_cnt >= w) {
427 u32 delta = tp->snd_cwnd_cnt / w;
428
429 tp->snd_cwnd_cnt -= delta * w;
430 tp->snd_cwnd += delta;
431 }
432 tp->snd_cwnd = min(tp->snd_cwnd, tp->snd_cwnd_clamp);
433}
434EXPORT_SYMBOL_GPL(tcp_cong_avoid_ai);
435
436/*
437 * TCP Reno congestion control
438 * This is special case used for fallback as well.
439 */
440/* This is Jacobson's slow start and congestion avoidance.
441 * SIGCOMM '88, p. 328.
442 */
443void tcp_reno_cong_avoid(struct sock *sk, u32 ack, u32 acked)
444{
445 struct tcp_sock *tp = tcp_sk(sk);
446
447 if (!tcp_is_cwnd_limited(sk))
448 return;
449
450 /* In "safe" area, increase. */
451 if (tcp_in_slow_start(tp)) {
452 acked = tcp_slow_start(tp, acked);
453 if (!acked)
454 return;
455 }
456 /* In dangerous area, increase slowly. */
457 tcp_cong_avoid_ai(tp, tp->snd_cwnd, acked);
458}
459EXPORT_SYMBOL_GPL(tcp_reno_cong_avoid);
460
461/* Slow start threshold is half the congestion window (min 2) */
462u32 tcp_reno_ssthresh(struct sock *sk)
463{
464 const struct tcp_sock *tp = tcp_sk(sk);
465
466 return max(tp->snd_cwnd >> 1U, 2U);
467}
468EXPORT_SYMBOL_GPL(tcp_reno_ssthresh);
469
470u32 tcp_reno_undo_cwnd(struct sock *sk)
471{
472 const struct tcp_sock *tp = tcp_sk(sk);
473
474 return max(tp->snd_cwnd, tp->prior_cwnd);
475}
476EXPORT_SYMBOL_GPL(tcp_reno_undo_cwnd);
477
478struct tcp_congestion_ops tcp_reno = {
479 .flags = TCP_CONG_NON_RESTRICTED,
480 .name = "reno",
481 .owner = THIS_MODULE,
482 .ssthresh = tcp_reno_ssthresh,
483 .cong_avoid = tcp_reno_cong_avoid,
484 .undo_cwnd = tcp_reno_undo_cwnd,
485};