recv.c 22 KB

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