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)
  100. {
  101. const struct tcp_congestion_ops *ca;
  102. u32 key;
  103. might_sleep();
  104. rcu_read_lock();
  105. ca = __tcp_ca_find_autoload(name);
  106. key = ca ? ca->key : TCP_CA_UNSPEC;
  107. rcu_read_unlock();
  108. return key;
  109. }
  110. EXPORT_SYMBOL_GPL(tcp_ca_get_key_by_name);
  111. char *tcp_ca_get_name_by_key(u32 key, char *buffer)
  112. {
  113. const struct tcp_congestion_ops *ca;
  114. char *ret = NULL;
  115. rcu_read_lock();
  116. ca = tcp_ca_find_key(key);
  117. if (ca)
  118. ret = strncpy(buffer, ca->name,
  119. TCP_CA_NAME_MAX);
  120. rcu_read_unlock();
  121. return ret;
  122. }
  123. EXPORT_SYMBOL_GPL(tcp_ca_get_name_by_key);
  124. /* Assign choice of congestion control. */
  125. void tcp_assign_congestion_control(struct sock *sk)
  126. {
  127. struct inet_connection_sock *icsk = inet_csk(sk);
  128. struct tcp_congestion_ops *ca;
  129. rcu_read_lock();
  130. list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
  131. if (likely(try_module_get(ca->owner))) {
  132. icsk->icsk_ca_ops = ca;
  133. goto out;
  134. }
  135. /* Fallback to next available. The last really
  136. * guaranteed fallback is Reno from this list.
  137. */
  138. }
  139. out:
  140. rcu_read_unlock();
  141. /* Clear out private data before diag gets it and
  142. * the ca has not been initialized.
  143. */
  144. if (ca->get_info)
  145. memset(icsk->icsk_ca_priv, 0, sizeof(icsk->icsk_ca_priv));
  146. }
  147. void tcp_init_congestion_control(struct sock *sk)
  148. {
  149. const struct inet_connection_sock *icsk = inet_csk(sk);
  150. if (icsk->icsk_ca_ops->init)
  151. icsk->icsk_ca_ops->init(sk);
  152. }
  153. static void tcp_reinit_congestion_control(struct sock *sk,
  154. const struct tcp_congestion_ops *ca)
  155. {
  156. struct inet_connection_sock *icsk = inet_csk(sk);
  157. tcp_cleanup_congestion_control(sk);
  158. icsk->icsk_ca_ops = ca;
  159. icsk->icsk_ca_setsockopt = 1;
  160. if (sk->sk_state != TCP_CLOSE && icsk->icsk_ca_ops->init)
  161. icsk->icsk_ca_ops->init(sk);
  162. }
  163. /* Manage refcounts on socket close. */
  164. void tcp_cleanup_congestion_control(struct sock *sk)
  165. {
  166. struct inet_connection_sock *icsk = inet_csk(sk);
  167. if (icsk->icsk_ca_ops->release)
  168. icsk->icsk_ca_ops->release(sk);
  169. module_put(icsk->icsk_ca_ops->owner);
  170. }
  171. /* Used by sysctl to change default congestion control */
  172. int tcp_set_default_congestion_control(const char *name)
  173. {
  174. struct tcp_congestion_ops *ca;
  175. int ret = -ENOENT;
  176. spin_lock(&tcp_cong_list_lock);
  177. ca = tcp_ca_find(name);
  178. #ifdef CONFIG_MODULES
  179. if (!ca && capable(CAP_NET_ADMIN)) {
  180. spin_unlock(&tcp_cong_list_lock);
  181. request_module("tcp_%s", name);
  182. spin_lock(&tcp_cong_list_lock);
  183. ca = tcp_ca_find(name);
  184. }
  185. #endif
  186. if (ca) {
  187. ca->flags |= TCP_CONG_NON_RESTRICTED; /* default is always allowed */
  188. list_move(&ca->list, &tcp_cong_list);
  189. ret = 0;
  190. }
  191. spin_unlock(&tcp_cong_list_lock);
  192. return ret;
  193. }
  194. /* Set default value from kernel configuration at bootup */
  195. static int __init tcp_congestion_default(void)
  196. {
  197. return tcp_set_default_congestion_control(CONFIG_DEFAULT_TCP_CONG);
  198. }
  199. late_initcall(tcp_congestion_default);
  200. /* Build string with list of available congestion control values */
  201. void tcp_get_available_congestion_control(char *buf, size_t maxlen)
  202. {
  203. struct tcp_congestion_ops *ca;
  204. size_t offs = 0;
  205. rcu_read_lock();
  206. list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
  207. offs += snprintf(buf + offs, maxlen - offs,
  208. "%s%s",
  209. offs == 0 ? "" : " ", ca->name);
  210. }
  211. rcu_read_unlock();
  212. }
  213. /* Get current default congestion control */
  214. void tcp_get_default_congestion_control(char *name)
  215. {
  216. struct tcp_congestion_ops *ca;
  217. /* We will always have reno... */
  218. BUG_ON(list_empty(&tcp_cong_list));
  219. rcu_read_lock();
  220. ca = list_entry(tcp_cong_list.next, struct tcp_congestion_ops, list);
  221. strncpy(name, ca->name, TCP_CA_NAME_MAX);
  222. rcu_read_unlock();
  223. }
  224. /* Built list of non-restricted congestion control values */
  225. void tcp_get_allowed_congestion_control(char *buf, size_t maxlen)
  226. {
  227. struct tcp_congestion_ops *ca;
  228. size_t offs = 0;
  229. *buf = '\0';
  230. rcu_read_lock();
  231. list_for_each_entry_rcu(ca, &tcp_cong_list, list) {
  232. if (!(ca->flags & TCP_CONG_NON_RESTRICTED))
  233. continue;
  234. offs += snprintf(buf + offs, maxlen - offs,
  235. "%s%s",
  236. offs == 0 ? "" : " ", ca->name);
  237. }
  238. rcu_read_unlock();
  239. }
  240. /* Change list of non-restricted congestion control */
  241. int tcp_set_allowed_congestion_control(char *val)
  242. {
  243. struct tcp_congestion_ops *ca;
  244. char *saved_clone, *clone, *name;
  245. int ret = 0;
  246. saved_clone = clone = kstrdup(val, GFP_USER);
  247. if (!clone)
  248. return -ENOMEM;
  249. spin_lock(&tcp_cong_list_lock);
  250. /* pass 1 check for bad entries */
  251. while ((name = strsep(&clone, " ")) && *name) {
  252. ca = tcp_ca_find(name);
  253. if (!ca) {
  254. ret = -ENOENT;
  255. goto out;
  256. }
  257. }
  258. /* pass 2 clear old values */
  259. list_for_each_entry_rcu(ca, &tcp_cong_list, list)
  260. ca->flags &= ~TCP_CONG_NON_RESTRICTED;
  261. /* pass 3 mark as allowed */
  262. while ((name = strsep(&val, " ")) && *name) {
  263. ca = tcp_ca_find(name);
  264. WARN_ON(!ca);
  265. if (ca)
  266. ca->flags |= TCP_CONG_NON_RESTRICTED;
  267. }
  268. out:
  269. spin_unlock(&tcp_cong_list_lock);
  270. kfree(saved_clone);
  271. return ret;
  272. }
  273. /* Change congestion control for socket */
  274. int tcp_set_congestion_control(struct sock *sk, const char *name)
  275. {
  276. struct inet_connection_sock *icsk = inet_csk(sk);
  277. const struct tcp_congestion_ops *ca;
  278. int err = 0;
  279. if (icsk->icsk_ca_dst_locked)
  280. return -EPERM;
  281. rcu_read_lock();
  282. ca = __tcp_ca_find_autoload(name);
  283. /* No change asking for existing value */
  284. if (ca == icsk->icsk_ca_ops) {
  285. icsk->icsk_ca_setsockopt = 1;
  286. goto out;
  287. }
  288. if (!ca)
  289. err = -ENOENT;
  290. else if (!((ca->flags & TCP_CONG_NON_RESTRICTED) ||
  291. ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN)))
  292. err = -EPERM;
  293. else if (!try_module_get(ca->owner))
  294. err = -EBUSY;
  295. else
  296. tcp_reinit_congestion_control(sk, ca);
  297. out:
  298. rcu_read_unlock();
  299. return err;
  300. }
  301. /* Slow start is used when congestion window is no greater than the slow start
  302. * threshold. We base on RFC2581 and also handle stretch ACKs properly.
  303. * We do not implement RFC3465 Appropriate Byte Counting (ABC) per se but
  304. * something better;) a packet is only considered (s)acked in its entirety to
  305. * defend the ACK attacks described in the RFC. Slow start processes a stretch
  306. * ACK of degree N as if N acks of degree 1 are received back to back except
  307. * ABC caps N to 2. Slow start exits when cwnd grows over ssthresh and
  308. * returns the leftover acks to adjust cwnd in congestion avoidance mode.
  309. */
  310. u32 tcp_slow_start(struct tcp_sock *tp, u32 acked)
  311. {
  312. u32 cwnd = tp->snd_cwnd + acked;
  313. if (cwnd > tp->snd_ssthresh)
  314. cwnd = tp->snd_ssthresh + 1;
  315. acked -= cwnd - tp->snd_cwnd;
  316. tp->snd_cwnd = min(cwnd, tp->snd_cwnd_clamp);
  317. return acked;
  318. }
  319. EXPORT_SYMBOL_GPL(tcp_slow_start);
  320. /* In theory this is tp->snd_cwnd += 1 / tp->snd_cwnd (or alternative w),
  321. * for every packet that was ACKed.
  322. */
  323. void tcp_cong_avoid_ai(struct tcp_sock *tp, u32 w, u32 acked)
  324. {
  325. /* If credits accumulated at a higher w, apply them gently now. */
  326. if (tp->snd_cwnd_cnt >= w) {
  327. tp->snd_cwnd_cnt = 0;
  328. tp->snd_cwnd++;
  329. }
  330. tp->snd_cwnd_cnt += acked;
  331. if (tp->snd_cwnd_cnt >= w) {
  332. u32 delta = tp->snd_cwnd_cnt / w;
  333. tp->snd_cwnd_cnt -= delta * w;
  334. tp->snd_cwnd += delta;
  335. }
  336. tp->snd_cwnd = min(tp->snd_cwnd, tp->snd_cwnd_clamp);
  337. }
  338. EXPORT_SYMBOL_GPL(tcp_cong_avoid_ai);
  339. /*
  340. * TCP Reno congestion control
  341. * This is special case used for fallback as well.
  342. */
  343. /* This is Jacobson's slow start and congestion avoidance.
  344. * SIGCOMM '88, p. 328.
  345. */
  346. void tcp_reno_cong_avoid(struct sock *sk, u32 ack, u32 acked)
  347. {
  348. struct tcp_sock *tp = tcp_sk(sk);
  349. if (!tcp_is_cwnd_limited(sk))
  350. return;
  351. /* In "safe" area, increase. */
  352. if (tp->snd_cwnd <= tp->snd_ssthresh) {
  353. acked = tcp_slow_start(tp, acked);
  354. if (!acked)
  355. return;
  356. }
  357. /* In dangerous area, increase slowly. */
  358. tcp_cong_avoid_ai(tp, tp->snd_cwnd, acked);
  359. }
  360. EXPORT_SYMBOL_GPL(tcp_reno_cong_avoid);
  361. /* Slow start threshold is half the congestion window (min 2) */
  362. u32 tcp_reno_ssthresh(struct sock *sk)
  363. {
  364. const struct tcp_sock *tp = tcp_sk(sk);
  365. return max(tp->snd_cwnd >> 1U, 2U);
  366. }
  367. EXPORT_SYMBOL_GPL(tcp_reno_ssthresh);
  368. struct tcp_congestion_ops tcp_reno = {
  369. .flags = TCP_CONG_NON_RESTRICTED,
  370. .name = "reno",
  371. .owner = THIS_MODULE,
  372. .ssthresh = tcp_reno_ssthresh,
  373. .cong_avoid = tcp_reno_cong_avoid,
  374. };