tcp_recv.c 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349
  1. /*
  2. * Copyright (c) 2006, 2017 Oracle and/or its affiliates. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. *
  32. */
  33. #include <linux/kernel.h>
  34. #include <linux/slab.h>
  35. #include <net/tcp.h>
  36. #include <trace/events/sock.h>
  37. #include "rds.h"
  38. #include "tcp.h"
  39. static struct kmem_cache *rds_tcp_incoming_slab;
  40. static void rds_tcp_inc_purge(struct rds_incoming *inc)
  41. {
  42. struct rds_tcp_incoming *tinc;
  43. tinc = container_of(inc, struct rds_tcp_incoming, ti_inc);
  44. rdsdebug("purging tinc %p inc %p\n", tinc, inc);
  45. skb_queue_purge(&tinc->ti_skb_list);
  46. }
  47. void rds_tcp_inc_free(struct rds_incoming *inc)
  48. {
  49. struct rds_tcp_incoming *tinc;
  50. tinc = container_of(inc, struct rds_tcp_incoming, ti_inc);
  51. rds_tcp_inc_purge(inc);
  52. rdsdebug("freeing tinc %p inc %p\n", tinc, inc);
  53. kmem_cache_free(rds_tcp_incoming_slab, tinc);
  54. }
  55. /*
  56. * this is pretty lame, but, whatever.
  57. */
  58. int rds_tcp_inc_copy_to_user(struct rds_incoming *inc, struct iov_iter *to)
  59. {
  60. struct rds_tcp_incoming *tinc;
  61. struct sk_buff *skb;
  62. int ret = 0;
  63. if (!iov_iter_count(to))
  64. goto out;
  65. tinc = container_of(inc, struct rds_tcp_incoming, ti_inc);
  66. skb_queue_walk(&tinc->ti_skb_list, skb) {
  67. unsigned long to_copy, skb_off;
  68. for (skb_off = 0; skb_off < skb->len; skb_off += to_copy) {
  69. to_copy = iov_iter_count(to);
  70. to_copy = min(to_copy, skb->len - skb_off);
  71. if (skb_copy_datagram_iter(skb, skb_off, to, to_copy))
  72. return -EFAULT;
  73. rds_stats_add(s_copy_to_user, to_copy);
  74. ret += to_copy;
  75. if (!iov_iter_count(to))
  76. goto out;
  77. }
  78. }
  79. out:
  80. return ret;
  81. }
  82. /*
  83. * We have a series of skbs that have fragmented pieces of the congestion
  84. * bitmap. They must add up to the exact size of the congestion bitmap. We
  85. * use the skb helpers to copy those into the pages that make up the in-memory
  86. * congestion bitmap for the remote address of this connection. We then tell
  87. * the congestion core that the bitmap has been changed so that it can wake up
  88. * sleepers.
  89. *
  90. * This is racing with sending paths which are using test_bit to see if the
  91. * bitmap indicates that their recipient is congested.
  92. */
  93. static void rds_tcp_cong_recv(struct rds_connection *conn,
  94. struct rds_tcp_incoming *tinc)
  95. {
  96. struct sk_buff *skb;
  97. unsigned int to_copy, skb_off;
  98. unsigned int map_off;
  99. unsigned int map_page;
  100. struct rds_cong_map *map;
  101. int ret;
  102. /* catch completely corrupt packets */
  103. if (be32_to_cpu(tinc->ti_inc.i_hdr.h_len) != RDS_CONG_MAP_BYTES)
  104. return;
  105. map_page = 0;
  106. map_off = 0;
  107. map = conn->c_fcong;
  108. skb_queue_walk(&tinc->ti_skb_list, skb) {
  109. skb_off = 0;
  110. while (skb_off < skb->len) {
  111. to_copy = min_t(unsigned int, PAGE_SIZE - map_off,
  112. skb->len - skb_off);
  113. BUG_ON(map_page >= RDS_CONG_MAP_PAGES);
  114. /* only returns 0 or -error */
  115. ret = skb_copy_bits(skb, skb_off,
  116. (void *)map->m_page_addrs[map_page] + map_off,
  117. to_copy);
  118. BUG_ON(ret != 0);
  119. skb_off += to_copy;
  120. map_off += to_copy;
  121. if (map_off == PAGE_SIZE) {
  122. map_off = 0;
  123. map_page++;
  124. }
  125. }
  126. }
  127. rds_cong_map_updated(map, ~(u64) 0);
  128. }
  129. struct rds_tcp_desc_arg {
  130. struct rds_conn_path *conn_path;
  131. gfp_t gfp;
  132. };
  133. static int rds_tcp_data_recv(read_descriptor_t *desc, struct sk_buff *skb,
  134. unsigned int offset, size_t len)
  135. {
  136. struct rds_tcp_desc_arg *arg = desc->arg.data;
  137. struct rds_conn_path *cp = arg->conn_path;
  138. struct rds_tcp_connection *tc = cp->cp_transport_data;
  139. struct rds_tcp_incoming *tinc = tc->t_tinc;
  140. struct sk_buff *clone;
  141. size_t left = len, to_copy;
  142. rdsdebug("tcp data tc %p skb %p offset %u len %zu\n", tc, skb, offset,
  143. len);
  144. /*
  145. * tcp_read_sock() interprets partial progress as an indication to stop
  146. * processing.
  147. */
  148. while (left) {
  149. if (!tinc) {
  150. tinc = kmem_cache_alloc(rds_tcp_incoming_slab,
  151. arg->gfp);
  152. if (!tinc) {
  153. desc->error = -ENOMEM;
  154. goto out;
  155. }
  156. tc->t_tinc = tinc;
  157. rdsdebug("allocated tinc %p\n", tinc);
  158. rds_inc_path_init(&tinc->ti_inc, cp,
  159. &cp->cp_conn->c_faddr);
  160. tinc->ti_inc.i_rx_lat_trace[RDS_MSG_RX_HDR] =
  161. local_clock();
  162. /*
  163. * XXX * we might be able to use the __ variants when
  164. * we've already serialized at a higher level.
  165. */
  166. skb_queue_head_init(&tinc->ti_skb_list);
  167. }
  168. if (left && tc->t_tinc_hdr_rem) {
  169. to_copy = min(tc->t_tinc_hdr_rem, left);
  170. rdsdebug("copying %zu header from skb %p\n", to_copy,
  171. skb);
  172. skb_copy_bits(skb, offset,
  173. (char *)&tinc->ti_inc.i_hdr +
  174. sizeof(struct rds_header) -
  175. tc->t_tinc_hdr_rem,
  176. to_copy);
  177. tc->t_tinc_hdr_rem -= to_copy;
  178. left -= to_copy;
  179. offset += to_copy;
  180. if (tc->t_tinc_hdr_rem == 0) {
  181. /* could be 0 for a 0 len message */
  182. tc->t_tinc_data_rem =
  183. be32_to_cpu(tinc->ti_inc.i_hdr.h_len);
  184. tinc->ti_inc.i_rx_lat_trace[RDS_MSG_RX_START] =
  185. local_clock();
  186. }
  187. }
  188. if (left && tc->t_tinc_data_rem) {
  189. to_copy = min(tc->t_tinc_data_rem, left);
  190. clone = pskb_extract(skb, offset, to_copy, arg->gfp);
  191. if (!clone) {
  192. desc->error = -ENOMEM;
  193. goto out;
  194. }
  195. skb_queue_tail(&tinc->ti_skb_list, clone);
  196. rdsdebug("skb %p data %p len %d off %u to_copy %zu -> "
  197. "clone %p data %p len %d\n",
  198. skb, skb->data, skb->len, offset, to_copy,
  199. clone, clone->data, clone->len);
  200. tc->t_tinc_data_rem -= to_copy;
  201. left -= to_copy;
  202. offset += to_copy;
  203. }
  204. if (tc->t_tinc_hdr_rem == 0 && tc->t_tinc_data_rem == 0) {
  205. struct rds_connection *conn = cp->cp_conn;
  206. if (tinc->ti_inc.i_hdr.h_flags == RDS_FLAG_CONG_BITMAP)
  207. rds_tcp_cong_recv(conn, tinc);
  208. else
  209. rds_recv_incoming(conn, &conn->c_faddr,
  210. &conn->c_laddr,
  211. &tinc->ti_inc,
  212. arg->gfp);
  213. tc->t_tinc_hdr_rem = sizeof(struct rds_header);
  214. tc->t_tinc_data_rem = 0;
  215. tc->t_tinc = NULL;
  216. rds_inc_put(&tinc->ti_inc);
  217. tinc = NULL;
  218. }
  219. }
  220. out:
  221. rdsdebug("returning len %zu left %zu skb len %d rx queue depth %d\n",
  222. len, left, skb->len,
  223. skb_queue_len(&tc->t_sock->sk->sk_receive_queue));
  224. return len - left;
  225. }
  226. /* the caller has to hold the sock lock */
  227. static int rds_tcp_read_sock(struct rds_conn_path *cp, gfp_t gfp)
  228. {
  229. struct rds_tcp_connection *tc = cp->cp_transport_data;
  230. struct socket *sock = tc->t_sock;
  231. read_descriptor_t desc;
  232. struct rds_tcp_desc_arg arg;
  233. /* It's like glib in the kernel! */
  234. arg.conn_path = cp;
  235. arg.gfp = gfp;
  236. desc.arg.data = &arg;
  237. desc.error = 0;
  238. desc.count = 1; /* give more than one skb per call */
  239. tcp_read_sock(sock->sk, &desc, rds_tcp_data_recv);
  240. rdsdebug("tcp_read_sock for tc %p gfp 0x%x returned %d\n", tc, gfp,
  241. desc.error);
  242. return desc.error;
  243. }
  244. /*
  245. * We hold the sock lock to serialize our rds_tcp_recv->tcp_read_sock from
  246. * data_ready.
  247. *
  248. * if we fail to allocate we're in trouble.. blindly wait some time before
  249. * trying again to see if the VM can free up something for us.
  250. */
  251. int rds_tcp_recv_path(struct rds_conn_path *cp)
  252. {
  253. struct rds_tcp_connection *tc = cp->cp_transport_data;
  254. struct socket *sock = tc->t_sock;
  255. int ret = 0;
  256. rdsdebug("recv worker path [%d] tc %p sock %p\n",
  257. cp->cp_index, tc, sock);
  258. lock_sock(sock->sk);
  259. ret = rds_tcp_read_sock(cp, GFP_KERNEL);
  260. release_sock(sock->sk);
  261. return ret;
  262. }
  263. void rds_tcp_data_ready(struct sock *sk)
  264. {
  265. void (*ready)(struct sock *sk);
  266. struct rds_conn_path *cp;
  267. struct rds_tcp_connection *tc;
  268. trace_sk_data_ready(sk);
  269. rdsdebug("data ready sk %p\n", sk);
  270. read_lock_bh(&sk->sk_callback_lock);
  271. cp = sk->sk_user_data;
  272. if (!cp) { /* check for teardown race */
  273. ready = sk->sk_data_ready;
  274. goto out;
  275. }
  276. tc = cp->cp_transport_data;
  277. ready = tc->t_orig_data_ready;
  278. rds_tcp_stats_inc(s_tcp_data_ready_calls);
  279. if (rds_tcp_read_sock(cp, GFP_ATOMIC) == -ENOMEM) {
  280. rcu_read_lock();
  281. if (!rds_destroy_pending(cp->cp_conn))
  282. queue_delayed_work(rds_wq, &cp->cp_recv_w, 0);
  283. rcu_read_unlock();
  284. }
  285. out:
  286. read_unlock_bh(&sk->sk_callback_lock);
  287. ready(sk);
  288. }
  289. int rds_tcp_recv_init(void)
  290. {
  291. rds_tcp_incoming_slab = KMEM_CACHE(rds_tcp_incoming, 0);
  292. if (!rds_tcp_incoming_slab)
  293. return -ENOMEM;
  294. return 0;
  295. }
  296. void rds_tcp_recv_exit(void)
  297. {
  298. kmem_cache_destroy(rds_tcp_incoming_slab);
  299. }