tcp_cong.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442
  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. * Copyright (C) 2005 Stephen Hemminger <shemminger@osdl.org>
  7. */
  8. #define pr_fmt(fmt) "TCP: " fmt
  9. #include <linux/module.h>
  10. #include <linux/mm.h>
  11. #include <linux/types.h>
  12. #include <linux/list.h>
  13. #include <linux/gfp.h>
  14. #include <linux/jhash.h>
  15. #include <net/tcp.h>
  16. static DEFINE_SPINLOCK(tcp_cong_list_lock);
  17. static LIST_HEAD(tcp_cong_list);
  18. /* Simple linear search, don't expect many entries! */
  19. static struct tcp_congestion_ops *tcp_ca_find(const char *name)
  20. {
  21. struct tcp_congestion_ops *e;
  22. list_for_each_entry_rcu(e, &tcp_cong_list, list) {
  23. if (strcmp(e->name, name) == 0)
  24. return e;
  25. }
  26. return NULL;
  27. }
  28. /* Must be called with rcu lock held */
  29. static const struct tcp_congestion_ops *__tcp_ca_find_autoload(const char *name)
  30. {
  31. const struct tcp_congestion_ops *ca = tcp_ca_find(name);
  32. #ifdef CONFIG_MODULES
  33. if (!ca && capable(CAP_NET_ADMIN)) {
  34. rcu_read_unlock();
  35. request_module("tcp_%s", name);
  36. rcu_read_lock();
  37. ca = tcp_ca_find(name);
  38. }
  39. #endif
  40. return ca;
  41. }
  42. /* Simple linear search, not much in here. */
  43. struct tcp_congestion_ops *tcp_ca_find_key(u32 key)
  44. {
  45. struct tcp_congestion_ops *e;
  46. list_for_each_entry_rcu(e, &tcp_cong_list, list) {
  47. if (e->key == key)
  48. return e;
  49. }
  50. return NULL;
  51. }
  52. /*
  53. * Attach new congestion control algorithm to the list
  54. * of available options.
  55. */
  56. int tcp_register_congestion_control(struct tcp_congestion_ops *ca)
  57. {
  58. int ret = 0;
  59. /* all algorithms must implement ssthresh and cong_avoid ops */
  60. if (!ca->ssthresh || !ca->cong_avoid) {
  61. pr_err("%s does not implement required ops\n", ca->name);
  62. return -EINVAL;
  63. }
  64. ca->key = jhash(ca->name, sizeof(ca->name), strlen(ca->name));
  65. spin_lock(&tcp_cong_list_lock);
  66. if (ca->key == TCP_CA_UNSPEC || tcp_ca_find_key(ca->key)) {
  67. pr_notice("%s already registered or non-unique key\n",
  68. ca->name);
  69. ret = -EEXIST;
  70. } else {
  71. list_add_tail_rcu(&ca->list, &tcp_cong_list);
  72. pr_debug("%s registered\n", ca->name);
  73. }
  74. spin_unlock(&tcp_cong_list_lock);
  75. return ret;
  76. }
  77. EXPORT_SYMBOL_GPL(tcp_register_congestion_control);
  78. /*
  79. * Remove congestion control algorithm, called from
  80. * the module's remove function. Module ref counts are used
  81. * to ensure that this can't be done till all sockets using
  82. * that method are closed.
  83. */
  84. void tcp_unregister_congestion_control(struct tcp_congestion_ops *ca)
  85. {
  86. spin_lock(&tcp_cong_list_lock);
  87. list_del_rcu(&ca->list);
  88. spin_unlock(&tcp_cong_list_lock);
  89. /* Wait for outstanding readers to complete before the
  90. * module gets removed entirely.
  91. *
  92. * A try_module_get() should fail by now as our module is
  93. * in "going" state since no refs are held anymore and
  94. * module_exit() handler being called.
  95. */
  96. synchronize_rcu();
  97. }
  98. EXPORT_SYMBOL_GPL(tcp_unregister_congestion_control);
  99. u32 tcp_ca_get_key_by_name(const char *name, bool *ecn_ca)
  100. {
  101. const struct tcp_congestion_ops *ca;
  102. u32 key = TCP_CA_UNSPEC;
  103. might_sleep();
  104. rcu_read_lock();
  105. ca = __tcp_ca_find_autoload(name);
  106. if (ca) {
  107. key = ca->key;
  108. *ecn_ca = ca->flags & TCP_CONG_NEEDS_ECN;
  109. }
  110. rcu_read_unlock();
  111. return key;
  112. }
  113. EXPORT_SYMBOL_GPL(tcp_ca_get_key_by_name);
  114. char *tcp_ca_get_name_by_key(u32 key, char *buffer)
  115. {
  116. const struct tcp_congestion_ops *ca;
  117. char *ret = NULL;
  118. rcu_read_lock();
  119. ca = tcp_ca_find_key(key);
  120. if (ca)
  121. ret = strncpy(buffer, ca->name,
  122. TCP_CA_NAME_MAX);
  123. rcu_read_unlock();
  124. return ret;
  125. }
  126. EXPORT_SYMBOL_GPL(tcp_ca_get_name_by_key);
  127. /* Assign choice of congestion control. */
  128. void tcp_assign_congestion_control(struct sock *sk)
  129. {
  130. struct inet_connection_sock *icsk = inet_csk(sk);
  131. struct tcp_congestion_ops *ca;
  132. rcu_read_lock();
  133. list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
  134. if (likely(try_module_get(ca->owner))) {
  135. icsk->icsk_ca_ops = ca;
  136. goto out;
  137. }
  138. /* Fallback to next available. The last really
  139. * guaranteed fallback is Reno from this list.
  140. */
  141. }
  142. out:
  143. rcu_read_unlock();
  144. /* Clear out private data before diag gets it and
  145. * the ca has not been initialized.
  146. */
  147. if (ca->get_info)
  148. memset(icsk->icsk_ca_priv, 0, sizeof(icsk->icsk_ca_priv));
  149. }
  150. void tcp_init_congestion_control(struct sock *sk)
  151. {
  152. const struct inet_connection_sock *icsk = inet_csk(sk);
  153. if (icsk->icsk_ca_ops->init)
  154. icsk->icsk_ca_ops->init(sk);
  155. }
  156. static void tcp_reinit_congestion_control(struct sock *sk,
  157. const struct tcp_congestion_ops *ca)
  158. {
  159. struct inet_connection_sock *icsk = inet_csk(sk);
  160. tcp_cleanup_congestion_control(sk);
  161. icsk->icsk_ca_ops = ca;
  162. icsk->icsk_ca_setsockopt = 1;
  163. if (sk->sk_state != TCP_CLOSE && icsk->icsk_ca_ops->init)
  164. icsk->icsk_ca_ops->init(sk);
  165. }
  166. /* Manage refcounts on socket close. */
  167. void tcp_cleanup_congestion_control(struct sock *sk)
  168. {
  169. struct inet_connection_sock *icsk = inet_csk(sk);
  170. if (icsk->icsk_ca_ops->release)
  171. icsk->icsk_ca_ops->release(sk);
  172. module_put(icsk->icsk_ca_ops->owner);
  173. }
  174. /* Used by sysctl to change default congestion control */
  175. int tcp_set_default_congestion_control(const char *name)
  176. {
  177. struct tcp_congestion_ops *ca;
  178. int ret = -ENOENT;
  179. spin_lock(&tcp_cong_list_lock);
  180. ca = tcp_ca_find(name);
  181. #ifdef CONFIG_MODULES
  182. if (!ca && capable(CAP_NET_ADMIN)) {
  183. spin_unlock(&tcp_cong_list_lock);
  184. request_module("tcp_%s", name);
  185. spin_lock(&tcp_cong_list_lock);
  186. ca = tcp_ca_find(name);
  187. }
  188. #endif
  189. if (ca) {
  190. ca->flags |= TCP_CONG_NON_RESTRICTED; /* default is always allowed */
  191. list_move(&ca->list, &tcp_cong_list);
  192. ret = 0;
  193. }
  194. spin_unlock(&tcp_cong_list_lock);
  195. return ret;
  196. }
  197. /* Set default value from kernel configuration at bootup */
  198. static int __init tcp_congestion_default(void)
  199. {
  200. return tcp_set_default_congestion_control(CONFIG_DEFAULT_TCP_CONG);
  201. }
  202. late_initcall(tcp_congestion_default);
  203. /* Build string with list of available congestion control values */
  204. void tcp_get_available_congestion_control(char *buf, size_t maxlen)
  205. {
  206. struct tcp_congestion_ops *ca;
  207. size_t offs = 0;
  208. rcu_read_lock();
  209. list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
  210. offs += snprintf(buf + offs, maxlen - offs,
  211. "%s%s",
  212. offs == 0 ? "" : " ", ca->name);
  213. }
  214. rcu_read_unlock();
  215. }
  216. /* Get current default congestion control */
  217. void tcp_get_default_congestion_control(char *name)
  218. {
  219. struct tcp_congestion_ops *ca;
  220. /* We will always have reno... */
  221. BUG_ON(list_empty(&tcp_cong_list));
  222. rcu_read_lock();
  223. ca = list_entry(tcp_cong_list.next, struct tcp_congestion_ops, list);
  224. strncpy(name, ca->name, TCP_CA_NAME_MAX);
  225. rcu_read_unlock();
  226. }
  227. /* Built list of non-restricted congestion control values */
  228. void tcp_get_allowed_congestion_control(char *buf, size_t maxlen)
  229. {
  230. struct tcp_congestion_ops *ca;
  231. size_t offs = 0;
  232. *buf = '\0';
  233. rcu_read_lock();
  234. list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
  235. if (!(ca->flags & TCP_CONG_NON_RESTRICTED))
  236. continue;
  237. offs += snprintf(buf + offs, maxlen - offs,
  238. "%s%s",
  239. offs == 0 ? "" : " ", ca->name);
  240. }
  241. rcu_read_unlock();
  242. }
  243. /* Change list of non-restricted congestion control */
  244. int tcp_set_allowed_congestion_control(char *val)
  245. {
  246. struct tcp_congestion_ops *ca;
  247. char *saved_clone, *clone, *name;
  248. int ret = 0;
  249. saved_clone = clone = kstrdup(val, GFP_USER);
  250. if (!clone)
  251. return -ENOMEM;
  252. spin_lock(&tcp_cong_list_lock);
  253. /* pass 1 check for bad entries */
  254. while ((name = strsep(&clone, " ")) && *name) {
  255. ca = tcp_ca_find(name);
  256. if (!ca) {
  257. ret = -ENOENT;
  258. goto out;
  259. }
  260. }
  261. /* pass 2 clear old values */
  262. list_for_each_entry_rcu(ca, &tcp_cong_list, list)
  263. ca->flags &= ~TCP_CONG_NON_RESTRICTED;
  264. /* pass 3 mark as allowed */
  265. while ((name = strsep(&val, " ")) && *name) {
  266. ca = tcp_ca_find(name);
  267. WARN_ON(!ca);
  268. if (ca)
  269. ca->flags |= TCP_CONG_NON_RESTRICTED;
  270. }
  271. out:
  272. spin_unlock(&tcp_cong_list_lock);
  273. kfree(saved_clone);
  274. return ret;
  275. }
  276. /* Change congestion control for socket */
  277. int tcp_set_congestion_control(struct sock *sk, const char *name)
  278. {
  279. struct inet_connection_sock *icsk = inet_csk(sk);
  280. const struct tcp_congestion_ops *ca;
  281. int err = 0;
  282. if (icsk->icsk_ca_dst_locked)
  283. return -EPERM;
  284. rcu_read_lock();
  285. ca = __tcp_ca_find_autoload(name);
  286. /* No change asking for existing value */
  287. if (ca == icsk->icsk_ca_ops) {
  288. icsk->icsk_ca_setsockopt = 1;
  289. goto out;
  290. }
  291. if (!ca)
  292. err = -ENOENT;
  293. else if (!((ca->flags & TCP_CONG_NON_RESTRICTED) ||
  294. ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN)))
  295. err = -EPERM;
  296. else if (!try_module_get(ca->owner))
  297. err = -EBUSY;
  298. else
  299. tcp_reinit_congestion_control(sk, ca);
  300. out:
  301. rcu_read_unlock();
  302. return err;
  303. }
  304. /* Slow start is used when congestion window is no greater than the slow start
  305. * threshold. We base on RFC2581 and also handle stretch ACKs properly.
  306. * We do not implement RFC3465 Appropriate Byte Counting (ABC) per se but
  307. * something better;) a packet is only considered (s)acked in its entirety to
  308. * defend the ACK attacks described in the RFC. Slow start processes a stretch
  309. * ACK of degree N as if N acks of degree 1 are received back to back except
  310. * ABC caps N to 2. Slow start exits when cwnd grows over ssthresh and
  311. * returns the leftover acks to adjust cwnd in congestion avoidance mode.
  312. */
  313. u32 tcp_slow_start(struct tcp_sock *tp, u32 acked)
  314. {
  315. u32 cwnd = min(tp->snd_cwnd + acked, tp->snd_ssthresh);
  316. acked -= cwnd - tp->snd_cwnd;
  317. tp->snd_cwnd = min(cwnd, tp->snd_cwnd_clamp);
  318. return acked;
  319. }
  320. EXPORT_SYMBOL_GPL(tcp_slow_start);
  321. /* In theory this is tp->snd_cwnd += 1 / tp->snd_cwnd (or alternative w),
  322. * for every packet that was ACKed.
  323. */
  324. void tcp_cong_avoid_ai(struct tcp_sock *tp, u32 w, u32 acked)
  325. {
  326. /* If credits accumulated at a higher w, apply them gently now. */
  327. if (tp->snd_cwnd_cnt >= w) {
  328. tp->snd_cwnd_cnt = 0;
  329. tp->snd_cwnd++;
  330. }
  331. tp->snd_cwnd_cnt += acked;
  332. if (tp->snd_cwnd_cnt >= w) {
  333. u32 delta = tp->snd_cwnd_cnt / w;
  334. tp->snd_cwnd_cnt -= delta * w;
  335. tp->snd_cwnd += delta;
  336. }
  337. tp->snd_cwnd = min(tp->snd_cwnd, tp->snd_cwnd_clamp);
  338. }
  339. EXPORT_SYMBOL_GPL(tcp_cong_avoid_ai);
  340. /*
  341. * TCP Reno congestion control
  342. * This is special case used for fallback as well.
  343. */
  344. /* This is Jacobson's slow start and congestion avoidance.
  345. * SIGCOMM '88, p. 328.
  346. */
  347. void tcp_reno_cong_avoid(struct sock *sk, u32 ack, u32 acked)
  348. {
  349. struct tcp_sock *tp = tcp_sk(sk);
  350. if (!tcp_is_cwnd_limited(sk))
  351. return;
  352. /* In "safe" area, increase. */
  353. if (tcp_in_slow_start(tp)) {
  354. acked = tcp_slow_start(tp, acked);
  355. if (!acked)
  356. return;
  357. }
  358. /* In dangerous area, increase slowly. */
  359. tcp_cong_avoid_ai(tp, tp->snd_cwnd, acked);
  360. }
  361. EXPORT_SYMBOL_GPL(tcp_reno_cong_avoid);
  362. /* Slow start threshold is half the congestion window (min 2) */
  363. u32 tcp_reno_ssthresh(struct sock *sk)
  364. {
  365. const struct tcp_sock *tp = tcp_sk(sk);
  366. return max(tp->snd_cwnd >> 1U, 2U);
  367. }
  368. EXPORT_SYMBOL_GPL(tcp_reno_ssthresh);
  369. struct tcp_congestion_ops tcp_reno = {
  370. .flags = TCP_CONG_NON_RESTRICTED,
  371. .name = "reno",
  372. .owner = THIS_MODULE,
  373. .ssthresh = tcp_reno_ssthresh,
  374. .cong_avoid = tcp_reno_cong_avoid,
  375. };