tcp_recv.c 9.4 KB

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