recv.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665
  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/sock.h>
  36. #include <linux/in.h>
  37. #include <linux/export.h>
  38. #include <linux/time.h>
  39. #include <linux/rds.h>
  40. #include "rds.h"
  41. void rds_inc_init(struct rds_incoming *inc, struct rds_connection *conn,
  42. __be32 saddr)
  43. {
  44. atomic_set(&inc->i_refcount, 1);
  45. INIT_LIST_HEAD(&inc->i_item);
  46. inc->i_conn = conn;
  47. inc->i_saddr = saddr;
  48. inc->i_rdma_cookie = 0;
  49. inc->i_rx_tstamp.tv_sec = 0;
  50. inc->i_rx_tstamp.tv_usec = 0;
  51. }
  52. EXPORT_SYMBOL_GPL(rds_inc_init);
  53. void rds_inc_path_init(struct rds_incoming *inc, struct rds_conn_path *cp,
  54. __be32 saddr)
  55. {
  56. atomic_set(&inc->i_refcount, 1);
  57. INIT_LIST_HEAD(&inc->i_item);
  58. inc->i_conn = cp->cp_conn;
  59. inc->i_conn_path = cp;
  60. inc->i_saddr = saddr;
  61. inc->i_rdma_cookie = 0;
  62. inc->i_rx_tstamp.tv_sec = 0;
  63. inc->i_rx_tstamp.tv_usec = 0;
  64. }
  65. EXPORT_SYMBOL_GPL(rds_inc_path_init);
  66. static void rds_inc_addref(struct rds_incoming *inc)
  67. {
  68. rdsdebug("addref inc %p ref %d\n", inc, atomic_read(&inc->i_refcount));
  69. atomic_inc(&inc->i_refcount);
  70. }
  71. void rds_inc_put(struct rds_incoming *inc)
  72. {
  73. rdsdebug("put inc %p ref %d\n", inc, atomic_read(&inc->i_refcount));
  74. if (atomic_dec_and_test(&inc->i_refcount)) {
  75. BUG_ON(!list_empty(&inc->i_item));
  76. inc->i_conn->c_trans->inc_free(inc);
  77. }
  78. }
  79. EXPORT_SYMBOL_GPL(rds_inc_put);
  80. static void rds_recv_rcvbuf_delta(struct rds_sock *rs, struct sock *sk,
  81. struct rds_cong_map *map,
  82. int delta, __be16 port)
  83. {
  84. int now_congested;
  85. if (delta == 0)
  86. return;
  87. rs->rs_rcv_bytes += delta;
  88. now_congested = rs->rs_rcv_bytes > rds_sk_rcvbuf(rs);
  89. rdsdebug("rs %p (%pI4:%u) recv bytes %d buf %d "
  90. "now_cong %d delta %d\n",
  91. rs, &rs->rs_bound_addr,
  92. ntohs(rs->rs_bound_port), rs->rs_rcv_bytes,
  93. rds_sk_rcvbuf(rs), now_congested, delta);
  94. /* wasn't -> am congested */
  95. if (!rs->rs_congested && now_congested) {
  96. rs->rs_congested = 1;
  97. rds_cong_set_bit(map, port);
  98. rds_cong_queue_updates(map);
  99. }
  100. /* was -> aren't congested */
  101. /* Require more free space before reporting uncongested to prevent
  102. bouncing cong/uncong state too often */
  103. else if (rs->rs_congested && (rs->rs_rcv_bytes < (rds_sk_rcvbuf(rs)/2))) {
  104. rs->rs_congested = 0;
  105. rds_cong_clear_bit(map, port);
  106. rds_cong_queue_updates(map);
  107. }
  108. /* do nothing if no change in cong state */
  109. }
  110. /*
  111. * Process all extension headers that come with this message.
  112. */
  113. static void rds_recv_incoming_exthdrs(struct rds_incoming *inc, struct rds_sock *rs)
  114. {
  115. struct rds_header *hdr = &inc->i_hdr;
  116. unsigned int pos = 0, type, len;
  117. union {
  118. struct rds_ext_header_version version;
  119. struct rds_ext_header_rdma rdma;
  120. struct rds_ext_header_rdma_dest rdma_dest;
  121. } buffer;
  122. while (1) {
  123. len = sizeof(buffer);
  124. type = rds_message_next_extension(hdr, &pos, &buffer, &len);
  125. if (type == RDS_EXTHDR_NONE)
  126. break;
  127. /* Process extension header here */
  128. switch (type) {
  129. case RDS_EXTHDR_RDMA:
  130. rds_rdma_unuse(rs, be32_to_cpu(buffer.rdma.h_rdma_rkey), 0);
  131. break;
  132. case RDS_EXTHDR_RDMA_DEST:
  133. /* We ignore the size for now. We could stash it
  134. * somewhere and use it for error checking. */
  135. inc->i_rdma_cookie = rds_rdma_make_cookie(
  136. be32_to_cpu(buffer.rdma_dest.h_rdma_rkey),
  137. be32_to_cpu(buffer.rdma_dest.h_rdma_offset));
  138. break;
  139. }
  140. }
  141. }
  142. static void rds_recv_hs_exthdrs(struct rds_header *hdr,
  143. struct rds_connection *conn)
  144. {
  145. unsigned int pos = 0, type, len;
  146. union {
  147. struct rds_ext_header_version version;
  148. u16 rds_npaths;
  149. } buffer;
  150. while (1) {
  151. len = sizeof(buffer);
  152. type = rds_message_next_extension(hdr, &pos, &buffer, &len);
  153. if (type == RDS_EXTHDR_NONE)
  154. break;
  155. /* Process extension header here */
  156. switch (type) {
  157. case RDS_EXTHDR_NPATHS:
  158. conn->c_npaths = min_t(int, RDS_MPATH_WORKERS,
  159. buffer.rds_npaths);
  160. break;
  161. default:
  162. pr_warn_ratelimited("ignoring unknown exthdr type "
  163. "0x%x\n", type);
  164. }
  165. }
  166. /* if RDS_EXTHDR_NPATHS was not found, default to a single-path */
  167. conn->c_npaths = max_t(int, conn->c_npaths, 1);
  168. }
  169. /* rds_start_mprds() will synchronously start multiple paths when appropriate.
  170. * The scheme is based on the following rules:
  171. *
  172. * 1. rds_sendmsg on first connect attempt sends the probe ping, with the
  173. * sender's npaths (s_npaths)
  174. * 2. rcvr of probe-ping knows the mprds_paths = min(s_npaths, r_npaths). It
  175. * sends back a probe-pong with r_npaths. After that, if rcvr is the
  176. * smaller ip addr, it starts rds_conn_path_connect_if_down on all
  177. * mprds_paths.
  178. * 3. sender gets woken up, and can move to rds_conn_path_connect_if_down.
  179. * If it is the smaller ipaddr, rds_conn_path_connect_if_down can be
  180. * called after reception of the probe-pong on all mprds_paths.
  181. * Otherwise (sender of probe-ping is not the smaller ip addr): just call
  182. * rds_conn_path_connect_if_down on the hashed path. (see rule 4)
  183. * 4. when cp_index > 0, rds_connect_worker must only trigger
  184. * a connection if laddr < faddr.
  185. * 5. sender may end up queuing the packet on the cp. will get sent out later.
  186. * when connection is completed.
  187. */
  188. static void rds_start_mprds(struct rds_connection *conn)
  189. {
  190. int i;
  191. struct rds_conn_path *cp;
  192. if (conn->c_npaths > 1 && conn->c_laddr < conn->c_faddr) {
  193. for (i = 1; i < conn->c_npaths; i++) {
  194. cp = &conn->c_path[i];
  195. rds_conn_path_connect_if_down(cp);
  196. }
  197. }
  198. }
  199. /*
  200. * The transport must make sure that this is serialized against other
  201. * rx and conn reset on this specific conn.
  202. *
  203. * We currently assert that only one fragmented message will be sent
  204. * down a connection at a time. This lets us reassemble in the conn
  205. * instead of per-flow which means that we don't have to go digging through
  206. * flows to tear down partial reassembly progress on conn failure and
  207. * we save flow lookup and locking for each frag arrival. It does mean
  208. * that small messages will wait behind large ones. Fragmenting at all
  209. * is only to reduce the memory consumption of pre-posted buffers.
  210. *
  211. * The caller passes in saddr and daddr instead of us getting it from the
  212. * conn. This lets loopback, who only has one conn for both directions,
  213. * tell us which roles the addrs in the conn are playing for this message.
  214. */
  215. void rds_recv_incoming(struct rds_connection *conn, __be32 saddr, __be32 daddr,
  216. struct rds_incoming *inc, gfp_t gfp)
  217. {
  218. struct rds_sock *rs = NULL;
  219. struct sock *sk;
  220. unsigned long flags;
  221. struct rds_conn_path *cp;
  222. inc->i_conn = conn;
  223. inc->i_rx_jiffies = jiffies;
  224. if (conn->c_trans->t_mp_capable)
  225. cp = inc->i_conn_path;
  226. else
  227. cp = &conn->c_path[0];
  228. rdsdebug("conn %p next %llu inc %p seq %llu len %u sport %u dport %u "
  229. "flags 0x%x rx_jiffies %lu\n", conn,
  230. (unsigned long long)cp->cp_next_rx_seq,
  231. inc,
  232. (unsigned long long)be64_to_cpu(inc->i_hdr.h_sequence),
  233. be32_to_cpu(inc->i_hdr.h_len),
  234. be16_to_cpu(inc->i_hdr.h_sport),
  235. be16_to_cpu(inc->i_hdr.h_dport),
  236. inc->i_hdr.h_flags,
  237. inc->i_rx_jiffies);
  238. /*
  239. * Sequence numbers should only increase. Messages get their
  240. * sequence number as they're queued in a sending conn. They
  241. * can be dropped, though, if the sending socket is closed before
  242. * they hit the wire. So sequence numbers can skip forward
  243. * under normal operation. They can also drop back in the conn
  244. * failover case as previously sent messages are resent down the
  245. * new instance of a conn. We drop those, otherwise we have
  246. * to assume that the next valid seq does not come after a
  247. * hole in the fragment stream.
  248. *
  249. * The headers don't give us a way to realize if fragments of
  250. * a message have been dropped. We assume that frags that arrive
  251. * to a flow are part of the current message on the flow that is
  252. * being reassembled. This means that senders can't drop messages
  253. * from the sending conn until all their frags are sent.
  254. *
  255. * XXX we could spend more on the wire to get more robust failure
  256. * detection, arguably worth it to avoid data corruption.
  257. */
  258. if (be64_to_cpu(inc->i_hdr.h_sequence) < cp->cp_next_rx_seq &&
  259. (inc->i_hdr.h_flags & RDS_FLAG_RETRANSMITTED)) {
  260. rds_stats_inc(s_recv_drop_old_seq);
  261. goto out;
  262. }
  263. cp->cp_next_rx_seq = be64_to_cpu(inc->i_hdr.h_sequence) + 1;
  264. if (rds_sysctl_ping_enable && inc->i_hdr.h_dport == 0) {
  265. if (inc->i_hdr.h_sport == 0) {
  266. rdsdebug("ignore ping with 0 sport from 0x%x\n", saddr);
  267. goto out;
  268. }
  269. rds_stats_inc(s_recv_ping);
  270. rds_send_pong(cp, inc->i_hdr.h_sport);
  271. /* if this is a handshake ping, start multipath if necessary */
  272. if (RDS_HS_PROBE(inc->i_hdr.h_sport, inc->i_hdr.h_dport)) {
  273. rds_recv_hs_exthdrs(&inc->i_hdr, cp->cp_conn);
  274. rds_start_mprds(cp->cp_conn);
  275. }
  276. goto out;
  277. }
  278. if (inc->i_hdr.h_dport == RDS_FLAG_PROBE_PORT &&
  279. inc->i_hdr.h_sport == 0) {
  280. rds_recv_hs_exthdrs(&inc->i_hdr, cp->cp_conn);
  281. /* if this is a handshake pong, start multipath if necessary */
  282. rds_start_mprds(cp->cp_conn);
  283. wake_up(&cp->cp_conn->c_hs_waitq);
  284. goto out;
  285. }
  286. rs = rds_find_bound(daddr, inc->i_hdr.h_dport);
  287. if (!rs) {
  288. rds_stats_inc(s_recv_drop_no_sock);
  289. goto out;
  290. }
  291. /* Process extension headers */
  292. rds_recv_incoming_exthdrs(inc, rs);
  293. /* We can be racing with rds_release() which marks the socket dead. */
  294. sk = rds_rs_to_sk(rs);
  295. /* serialize with rds_release -> sock_orphan */
  296. write_lock_irqsave(&rs->rs_recv_lock, flags);
  297. if (!sock_flag(sk, SOCK_DEAD)) {
  298. rdsdebug("adding inc %p to rs %p's recv queue\n", inc, rs);
  299. rds_stats_inc(s_recv_queued);
  300. rds_recv_rcvbuf_delta(rs, sk, inc->i_conn->c_lcong,
  301. be32_to_cpu(inc->i_hdr.h_len),
  302. inc->i_hdr.h_dport);
  303. if (sock_flag(sk, SOCK_RCVTSTAMP))
  304. do_gettimeofday(&inc->i_rx_tstamp);
  305. rds_inc_addref(inc);
  306. list_add_tail(&inc->i_item, &rs->rs_recv_queue);
  307. __rds_wake_sk_sleep(sk);
  308. } else {
  309. rds_stats_inc(s_recv_drop_dead_sock);
  310. }
  311. write_unlock_irqrestore(&rs->rs_recv_lock, flags);
  312. out:
  313. if (rs)
  314. rds_sock_put(rs);
  315. }
  316. EXPORT_SYMBOL_GPL(rds_recv_incoming);
  317. /*
  318. * be very careful here. This is being called as the condition in
  319. * wait_event_*() needs to cope with being called many times.
  320. */
  321. static int rds_next_incoming(struct rds_sock *rs, struct rds_incoming **inc)
  322. {
  323. unsigned long flags;
  324. if (!*inc) {
  325. read_lock_irqsave(&rs->rs_recv_lock, flags);
  326. if (!list_empty(&rs->rs_recv_queue)) {
  327. *inc = list_entry(rs->rs_recv_queue.next,
  328. struct rds_incoming,
  329. i_item);
  330. rds_inc_addref(*inc);
  331. }
  332. read_unlock_irqrestore(&rs->rs_recv_lock, flags);
  333. }
  334. return *inc != NULL;
  335. }
  336. static int rds_still_queued(struct rds_sock *rs, struct rds_incoming *inc,
  337. int drop)
  338. {
  339. struct sock *sk = rds_rs_to_sk(rs);
  340. int ret = 0;
  341. unsigned long flags;
  342. write_lock_irqsave(&rs->rs_recv_lock, flags);
  343. if (!list_empty(&inc->i_item)) {
  344. ret = 1;
  345. if (drop) {
  346. /* XXX make sure this i_conn is reliable */
  347. rds_recv_rcvbuf_delta(rs, sk, inc->i_conn->c_lcong,
  348. -be32_to_cpu(inc->i_hdr.h_len),
  349. inc->i_hdr.h_dport);
  350. list_del_init(&inc->i_item);
  351. rds_inc_put(inc);
  352. }
  353. }
  354. write_unlock_irqrestore(&rs->rs_recv_lock, flags);
  355. rdsdebug("inc %p rs %p still %d dropped %d\n", inc, rs, ret, drop);
  356. return ret;
  357. }
  358. /*
  359. * Pull errors off the error queue.
  360. * If msghdr is NULL, we will just purge the error queue.
  361. */
  362. int rds_notify_queue_get(struct rds_sock *rs, struct msghdr *msghdr)
  363. {
  364. struct rds_notifier *notifier;
  365. struct rds_rdma_notify cmsg = { 0 }; /* fill holes with zero */
  366. unsigned int count = 0, max_messages = ~0U;
  367. unsigned long flags;
  368. LIST_HEAD(copy);
  369. int err = 0;
  370. /* put_cmsg copies to user space and thus may sleep. We can't do this
  371. * with rs_lock held, so first grab as many notifications as we can stuff
  372. * in the user provided cmsg buffer. We don't try to copy more, to avoid
  373. * losing notifications - except when the buffer is so small that it wouldn't
  374. * even hold a single notification. Then we give him as much of this single
  375. * msg as we can squeeze in, and set MSG_CTRUNC.
  376. */
  377. if (msghdr) {
  378. max_messages = msghdr->msg_controllen / CMSG_SPACE(sizeof(cmsg));
  379. if (!max_messages)
  380. max_messages = 1;
  381. }
  382. spin_lock_irqsave(&rs->rs_lock, flags);
  383. while (!list_empty(&rs->rs_notify_queue) && count < max_messages) {
  384. notifier = list_entry(rs->rs_notify_queue.next,
  385. struct rds_notifier, n_list);
  386. list_move(&notifier->n_list, &copy);
  387. count++;
  388. }
  389. spin_unlock_irqrestore(&rs->rs_lock, flags);
  390. if (!count)
  391. return 0;
  392. while (!list_empty(&copy)) {
  393. notifier = list_entry(copy.next, struct rds_notifier, n_list);
  394. if (msghdr) {
  395. cmsg.user_token = notifier->n_user_token;
  396. cmsg.status = notifier->n_status;
  397. err = put_cmsg(msghdr, SOL_RDS, RDS_CMSG_RDMA_STATUS,
  398. sizeof(cmsg), &cmsg);
  399. if (err)
  400. break;
  401. }
  402. list_del_init(&notifier->n_list);
  403. kfree(notifier);
  404. }
  405. /* If we bailed out because of an error in put_cmsg,
  406. * we may be left with one or more notifications that we
  407. * didn't process. Return them to the head of the list. */
  408. if (!list_empty(&copy)) {
  409. spin_lock_irqsave(&rs->rs_lock, flags);
  410. list_splice(&copy, &rs->rs_notify_queue);
  411. spin_unlock_irqrestore(&rs->rs_lock, flags);
  412. }
  413. return err;
  414. }
  415. /*
  416. * Queue a congestion notification
  417. */
  418. static int rds_notify_cong(struct rds_sock *rs, struct msghdr *msghdr)
  419. {
  420. uint64_t notify = rs->rs_cong_notify;
  421. unsigned long flags;
  422. int err;
  423. err = put_cmsg(msghdr, SOL_RDS, RDS_CMSG_CONG_UPDATE,
  424. sizeof(notify), &notify);
  425. if (err)
  426. return err;
  427. spin_lock_irqsave(&rs->rs_lock, flags);
  428. rs->rs_cong_notify &= ~notify;
  429. spin_unlock_irqrestore(&rs->rs_lock, flags);
  430. return 0;
  431. }
  432. /*
  433. * Receive any control messages.
  434. */
  435. static int rds_cmsg_recv(struct rds_incoming *inc, struct msghdr *msg,
  436. struct rds_sock *rs)
  437. {
  438. int ret = 0;
  439. if (inc->i_rdma_cookie) {
  440. ret = put_cmsg(msg, SOL_RDS, RDS_CMSG_RDMA_DEST,
  441. sizeof(inc->i_rdma_cookie), &inc->i_rdma_cookie);
  442. if (ret)
  443. return ret;
  444. }
  445. if ((inc->i_rx_tstamp.tv_sec != 0) &&
  446. sock_flag(rds_rs_to_sk(rs), SOCK_RCVTSTAMP)) {
  447. ret = put_cmsg(msg, SOL_SOCKET, SCM_TIMESTAMP,
  448. sizeof(struct timeval),
  449. &inc->i_rx_tstamp);
  450. if (ret)
  451. return ret;
  452. }
  453. return 0;
  454. }
  455. int rds_recvmsg(struct socket *sock, struct msghdr *msg, size_t size,
  456. int msg_flags)
  457. {
  458. struct sock *sk = sock->sk;
  459. struct rds_sock *rs = rds_sk_to_rs(sk);
  460. long timeo;
  461. int ret = 0, nonblock = msg_flags & MSG_DONTWAIT;
  462. DECLARE_SOCKADDR(struct sockaddr_in *, sin, msg->msg_name);
  463. struct rds_incoming *inc = NULL;
  464. /* udp_recvmsg()->sock_recvtimeo() gets away without locking too.. */
  465. timeo = sock_rcvtimeo(sk, nonblock);
  466. rdsdebug("size %zu flags 0x%x timeo %ld\n", size, msg_flags, timeo);
  467. if (msg_flags & MSG_OOB)
  468. goto out;
  469. while (1) {
  470. struct iov_iter save;
  471. /* If there are pending notifications, do those - and nothing else */
  472. if (!list_empty(&rs->rs_notify_queue)) {
  473. ret = rds_notify_queue_get(rs, msg);
  474. break;
  475. }
  476. if (rs->rs_cong_notify) {
  477. ret = rds_notify_cong(rs, msg);
  478. break;
  479. }
  480. if (!rds_next_incoming(rs, &inc)) {
  481. if (nonblock) {
  482. ret = -EAGAIN;
  483. break;
  484. }
  485. timeo = wait_event_interruptible_timeout(*sk_sleep(sk),
  486. (!list_empty(&rs->rs_notify_queue) ||
  487. rs->rs_cong_notify ||
  488. rds_next_incoming(rs, &inc)), timeo);
  489. rdsdebug("recvmsg woke inc %p timeo %ld\n", inc,
  490. timeo);
  491. if (timeo > 0 || timeo == MAX_SCHEDULE_TIMEOUT)
  492. continue;
  493. ret = timeo;
  494. if (ret == 0)
  495. ret = -ETIMEDOUT;
  496. break;
  497. }
  498. rdsdebug("copying inc %p from %pI4:%u to user\n", inc,
  499. &inc->i_conn->c_faddr,
  500. ntohs(inc->i_hdr.h_sport));
  501. save = msg->msg_iter;
  502. ret = inc->i_conn->c_trans->inc_copy_to_user(inc, &msg->msg_iter);
  503. if (ret < 0)
  504. break;
  505. /*
  506. * if the message we just copied isn't at the head of the
  507. * recv queue then someone else raced us to return it, try
  508. * to get the next message.
  509. */
  510. if (!rds_still_queued(rs, inc, !(msg_flags & MSG_PEEK))) {
  511. rds_inc_put(inc);
  512. inc = NULL;
  513. rds_stats_inc(s_recv_deliver_raced);
  514. msg->msg_iter = save;
  515. continue;
  516. }
  517. if (ret < be32_to_cpu(inc->i_hdr.h_len)) {
  518. if (msg_flags & MSG_TRUNC)
  519. ret = be32_to_cpu(inc->i_hdr.h_len);
  520. msg->msg_flags |= MSG_TRUNC;
  521. }
  522. if (rds_cmsg_recv(inc, msg, rs)) {
  523. ret = -EFAULT;
  524. goto out;
  525. }
  526. rds_stats_inc(s_recv_delivered);
  527. if (sin) {
  528. sin->sin_family = AF_INET;
  529. sin->sin_port = inc->i_hdr.h_sport;
  530. sin->sin_addr.s_addr = inc->i_saddr;
  531. memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
  532. msg->msg_namelen = sizeof(*sin);
  533. }
  534. break;
  535. }
  536. if (inc)
  537. rds_inc_put(inc);
  538. out:
  539. return ret;
  540. }
  541. /*
  542. * The socket is being shut down and we're asked to drop messages that were
  543. * queued for recvmsg. The caller has unbound the socket so the receive path
  544. * won't queue any more incoming fragments or messages on the socket.
  545. */
  546. void rds_clear_recv_queue(struct rds_sock *rs)
  547. {
  548. struct sock *sk = rds_rs_to_sk(rs);
  549. struct rds_incoming *inc, *tmp;
  550. unsigned long flags;
  551. write_lock_irqsave(&rs->rs_recv_lock, flags);
  552. list_for_each_entry_safe(inc, tmp, &rs->rs_recv_queue, i_item) {
  553. rds_recv_rcvbuf_delta(rs, sk, inc->i_conn->c_lcong,
  554. -be32_to_cpu(inc->i_hdr.h_len),
  555. inc->i_hdr.h_dport);
  556. list_del_init(&inc->i_item);
  557. rds_inc_put(inc);
  558. }
  559. write_unlock_irqrestore(&rs->rs_recv_lock, flags);
  560. }
  561. /*
  562. * inc->i_saddr isn't used here because it is only set in the receive
  563. * path.
  564. */
  565. void rds_inc_info_copy(struct rds_incoming *inc,
  566. struct rds_info_iterator *iter,
  567. __be32 saddr, __be32 daddr, int flip)
  568. {
  569. struct rds_info_message minfo;
  570. minfo.seq = be64_to_cpu(inc->i_hdr.h_sequence);
  571. minfo.len = be32_to_cpu(inc->i_hdr.h_len);
  572. if (flip) {
  573. minfo.laddr = daddr;
  574. minfo.faddr = saddr;
  575. minfo.lport = inc->i_hdr.h_dport;
  576. minfo.fport = inc->i_hdr.h_sport;
  577. } else {
  578. minfo.laddr = saddr;
  579. minfo.faddr = daddr;
  580. minfo.lport = inc->i_hdr.h_sport;
  581. minfo.fport = inc->i_hdr.h_dport;
  582. }
  583. minfo.flags = 0;
  584. rds_info_copy(iter, &minfo, sizeof(minfo));
  585. }