tcp_recv.c 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356
  1. /*
  2. * Copyright (c) 2006 Oracle. 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 <net/tcp.h>
  35. #include "rds.h"
  36. #include "tcp.h"
  37. static struct kmem_cache *rds_tcp_incoming_slab;
  38. void rds_tcp_inc_purge(struct rds_incoming *inc)
  39. {
  40. struct rds_tcp_incoming *tinc;
  41. tinc = container_of(inc, struct rds_tcp_incoming, ti_inc);
  42. rdsdebug("purging tinc %p inc %p\n", tinc, inc);
  43. skb_queue_purge(&tinc->ti_skb_list);
  44. }
  45. void rds_tcp_inc_free(struct rds_incoming *inc)
  46. {
  47. struct rds_tcp_incoming *tinc;
  48. tinc = container_of(inc, struct rds_tcp_incoming, ti_inc);
  49. rds_tcp_inc_purge(inc);
  50. rdsdebug("freeing tinc %p inc %p\n", tinc, inc);
  51. kmem_cache_free(rds_tcp_incoming_slab, tinc);
  52. }
  53. /*
  54. * this is pretty lame, but, whatever.
  55. */
  56. int rds_tcp_inc_copy_to_user(struct rds_incoming *inc, struct iovec *first_iov,
  57. size_t size)
  58. {
  59. struct rds_tcp_incoming *tinc;
  60. struct iovec *iov, tmp;
  61. struct sk_buff *skb;
  62. unsigned long to_copy, skb_off;
  63. int ret = 0;
  64. if (size == 0)
  65. goto out;
  66. tinc = container_of(inc, struct rds_tcp_incoming, ti_inc);
  67. iov = first_iov;
  68. tmp = *iov;
  69. skb_queue_walk(&tinc->ti_skb_list, skb) {
  70. skb_off = 0;
  71. while (skb_off < skb->len) {
  72. while (tmp.iov_len == 0) {
  73. iov++;
  74. tmp = *iov;
  75. }
  76. to_copy = min(tmp.iov_len, size);
  77. to_copy = min(to_copy, skb->len - skb_off);
  78. rdsdebug("ret %d size %zu skb %p skb_off %lu "
  79. "skblen %d iov_base %p iov_len %zu cpy %lu\n",
  80. ret, size, skb, skb_off, skb->len,
  81. tmp.iov_base, tmp.iov_len, to_copy);
  82. /* modifies tmp as it copies */
  83. if (skb_copy_datagram_iovec(skb, skb_off, &tmp,
  84. to_copy)) {
  85. ret = -EFAULT;
  86. goto out;
  87. }
  88. size -= to_copy;
  89. ret += to_copy;
  90. skb_off += to_copy;
  91. if (size == 0)
  92. goto out;
  93. }
  94. }
  95. out:
  96. return ret;
  97. }
  98. /*
  99. * We have a series of skbs that have fragmented pieces of the congestion
  100. * bitmap. They must add up to the exact size of the congestion bitmap. We
  101. * use the skb helpers to copy those into the pages that make up the in-memory
  102. * congestion bitmap for the remote address of this connection. We then tell
  103. * the congestion core that the bitmap has been changed so that it can wake up
  104. * sleepers.
  105. *
  106. * This is racing with sending paths which are using test_bit to see if the
  107. * bitmap indicates that their recipient is congested.
  108. */
  109. static void rds_tcp_cong_recv(struct rds_connection *conn,
  110. struct rds_tcp_incoming *tinc)
  111. {
  112. struct sk_buff *skb;
  113. unsigned int to_copy, skb_off;
  114. unsigned int map_off;
  115. unsigned int map_page;
  116. struct rds_cong_map *map;
  117. int ret;
  118. /* catch completely corrupt packets */
  119. if (be32_to_cpu(tinc->ti_inc.i_hdr.h_len) != RDS_CONG_MAP_BYTES)
  120. return;
  121. map_page = 0;
  122. map_off = 0;
  123. map = conn->c_fcong;
  124. skb_queue_walk(&tinc->ti_skb_list, skb) {
  125. skb_off = 0;
  126. while (skb_off < skb->len) {
  127. to_copy = min_t(unsigned int, PAGE_SIZE - map_off,
  128. skb->len - skb_off);
  129. BUG_ON(map_page >= RDS_CONG_MAP_PAGES);
  130. /* only returns 0 or -error */
  131. ret = skb_copy_bits(skb, skb_off,
  132. (void *)map->m_page_addrs[map_page] + map_off,
  133. to_copy);
  134. BUG_ON(ret != 0);
  135. skb_off += to_copy;
  136. map_off += to_copy;
  137. if (map_off == PAGE_SIZE) {
  138. map_off = 0;
  139. map_page++;
  140. }
  141. }
  142. }
  143. rds_cong_map_updated(map, ~(u64) 0);
  144. }
  145. struct rds_tcp_desc_arg {
  146. struct rds_connection *conn;
  147. gfp_t gfp;
  148. enum km_type km;
  149. };
  150. static int rds_tcp_data_recv(read_descriptor_t *desc, struct sk_buff *skb,
  151. unsigned int offset, size_t len)
  152. {
  153. struct rds_tcp_desc_arg *arg = desc->arg.data;
  154. struct rds_connection *conn = arg->conn;
  155. struct rds_tcp_connection *tc = conn->c_transport_data;
  156. struct rds_tcp_incoming *tinc = tc->t_tinc;
  157. struct sk_buff *clone;
  158. size_t left = len, to_copy;
  159. rdsdebug("tcp data tc %p skb %p offset %u len %zu\n", tc, skb, offset,
  160. len);
  161. /*
  162. * tcp_read_sock() interprets partial progress as an indication to stop
  163. * processing.
  164. */
  165. while (left) {
  166. if (tinc == NULL) {
  167. tinc = kmem_cache_alloc(rds_tcp_incoming_slab,
  168. arg->gfp);
  169. if (tinc == NULL) {
  170. desc->error = -ENOMEM;
  171. goto out;
  172. }
  173. tc->t_tinc = tinc;
  174. rdsdebug("alloced tinc %p\n", tinc);
  175. rds_inc_init(&tinc->ti_inc, conn, conn->c_faddr);
  176. /*
  177. * XXX * we might be able to use the __ variants when
  178. * we've already serialized at a higher level.
  179. */
  180. skb_queue_head_init(&tinc->ti_skb_list);
  181. }
  182. if (left && tc->t_tinc_hdr_rem) {
  183. to_copy = min(tc->t_tinc_hdr_rem, left);
  184. rdsdebug("copying %zu header from skb %p\n", to_copy,
  185. skb);
  186. skb_copy_bits(skb, offset,
  187. (char *)&tinc->ti_inc.i_hdr +
  188. sizeof(struct rds_header) -
  189. tc->t_tinc_hdr_rem,
  190. to_copy);
  191. tc->t_tinc_hdr_rem -= to_copy;
  192. left -= to_copy;
  193. offset += to_copy;
  194. if (tc->t_tinc_hdr_rem == 0) {
  195. /* could be 0 for a 0 len message */
  196. tc->t_tinc_data_rem =
  197. be32_to_cpu(tinc->ti_inc.i_hdr.h_len);
  198. }
  199. }
  200. if (left && tc->t_tinc_data_rem) {
  201. clone = skb_clone(skb, arg->gfp);
  202. if (clone == NULL) {
  203. desc->error = -ENOMEM;
  204. goto out;
  205. }
  206. to_copy = min(tc->t_tinc_data_rem, left);
  207. pskb_pull(clone, offset);
  208. pskb_trim(clone, to_copy);
  209. skb_queue_tail(&tinc->ti_skb_list, clone);
  210. rdsdebug("skb %p data %p len %d off %u to_copy %zu -> "
  211. "clone %p data %p len %d\n",
  212. skb, skb->data, skb->len, offset, to_copy,
  213. clone, clone->data, clone->len);
  214. tc->t_tinc_data_rem -= to_copy;
  215. left -= to_copy;
  216. offset += to_copy;
  217. }
  218. if (tc->t_tinc_hdr_rem == 0 && tc->t_tinc_data_rem == 0) {
  219. if (tinc->ti_inc.i_hdr.h_flags == RDS_FLAG_CONG_BITMAP)
  220. rds_tcp_cong_recv(conn, tinc);
  221. else
  222. rds_recv_incoming(conn, conn->c_faddr,
  223. conn->c_laddr, &tinc->ti_inc,
  224. arg->gfp, arg->km);
  225. tc->t_tinc_hdr_rem = sizeof(struct rds_header);
  226. tc->t_tinc_data_rem = 0;
  227. tc->t_tinc = NULL;
  228. rds_inc_put(&tinc->ti_inc);
  229. tinc = NULL;
  230. }
  231. }
  232. out:
  233. rdsdebug("returning len %zu left %zu skb len %d rx queue depth %d\n",
  234. len, left, skb->len,
  235. skb_queue_len(&tc->t_sock->sk->sk_receive_queue));
  236. return len - left;
  237. }
  238. /* the caller has to hold the sock lock */
  239. int rds_tcp_read_sock(struct rds_connection *conn, gfp_t gfp, enum km_type km)
  240. {
  241. struct rds_tcp_connection *tc = conn->c_transport_data;
  242. struct socket *sock = tc->t_sock;
  243. read_descriptor_t desc;
  244. struct rds_tcp_desc_arg arg;
  245. /* It's like glib in the kernel! */
  246. arg.conn = conn;
  247. arg.gfp = gfp;
  248. arg.km = km;
  249. desc.arg.data = &arg;
  250. desc.error = 0;
  251. desc.count = 1; /* give more than one skb per call */
  252. tcp_read_sock(sock->sk, &desc, rds_tcp_data_recv);
  253. rdsdebug("tcp_read_sock for tc %p gfp 0x%x returned %d\n", tc, gfp,
  254. desc.error);
  255. return desc.error;
  256. }
  257. /*
  258. * We hold the sock lock to serialize our rds_tcp_recv->tcp_read_sock from
  259. * data_ready.
  260. *
  261. * if we fail to allocate we're in trouble.. blindly wait some time before
  262. * trying again to see if the VM can free up something for us.
  263. */
  264. int rds_tcp_recv(struct rds_connection *conn)
  265. {
  266. struct rds_tcp_connection *tc = conn->c_transport_data;
  267. struct socket *sock = tc->t_sock;
  268. int ret = 0;
  269. rdsdebug("recv worker conn %p tc %p sock %p\n", conn, tc, sock);
  270. lock_sock(sock->sk);
  271. ret = rds_tcp_read_sock(conn, GFP_KERNEL, KM_USER0);
  272. release_sock(sock->sk);
  273. return ret;
  274. }
  275. void rds_tcp_data_ready(struct sock *sk, int bytes)
  276. {
  277. void (*ready)(struct sock *sk, int bytes);
  278. struct rds_connection *conn;
  279. struct rds_tcp_connection *tc;
  280. rdsdebug("data ready sk %p bytes %d\n", sk, bytes);
  281. read_lock(&sk->sk_callback_lock);
  282. conn = sk->sk_user_data;
  283. if (conn == NULL) { /* check for teardown race */
  284. ready = sk->sk_data_ready;
  285. goto out;
  286. }
  287. tc = conn->c_transport_data;
  288. ready = tc->t_orig_data_ready;
  289. rds_tcp_stats_inc(s_tcp_data_ready_calls);
  290. if (rds_tcp_read_sock(conn, GFP_ATOMIC, KM_SOFTIRQ0) == -ENOMEM)
  291. queue_delayed_work(rds_wq, &conn->c_recv_w, 0);
  292. out:
  293. read_unlock(&sk->sk_callback_lock);
  294. ready(sk, bytes);
  295. }
  296. int __init rds_tcp_recv_init(void)
  297. {
  298. rds_tcp_incoming_slab = kmem_cache_create("rds_tcp_incoming",
  299. sizeof(struct rds_tcp_incoming),
  300. 0, 0, NULL);
  301. if (rds_tcp_incoming_slab == NULL)
  302. return -ENOMEM;
  303. return 0;
  304. }
  305. void rds_tcp_recv_exit(void)
  306. {
  307. kmem_cache_destroy(rds_tcp_incoming_slab);
  308. }