recv.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825
  1. /*
  2. * Copyright (c) 2006, 2019 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/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. struct in6_addr *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. struct in6_addr *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 (%pI6c:%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. rds_addr_cmp(&conn->c_laddr, &conn->c_faddr) < 0) {
  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, struct in6_addr *saddr,
  260. struct in6_addr *daddr,
  261. struct rds_incoming *inc, gfp_t gfp)
  262. {
  263. struct rds_sock *rs = NULL;
  264. struct sock *sk;
  265. unsigned long flags;
  266. struct rds_conn_path *cp;
  267. inc->i_conn = conn;
  268. inc->i_rx_jiffies = jiffies;
  269. if (conn->c_trans->t_mp_capable)
  270. cp = inc->i_conn_path;
  271. else
  272. cp = &conn->c_path[0];
  273. rdsdebug("conn %p next %llu inc %p seq %llu len %u sport %u dport %u "
  274. "flags 0x%x rx_jiffies %lu\n", conn,
  275. (unsigned long long)cp->cp_next_rx_seq,
  276. inc,
  277. (unsigned long long)be64_to_cpu(inc->i_hdr.h_sequence),
  278. be32_to_cpu(inc->i_hdr.h_len),
  279. be16_to_cpu(inc->i_hdr.h_sport),
  280. be16_to_cpu(inc->i_hdr.h_dport),
  281. inc->i_hdr.h_flags,
  282. inc->i_rx_jiffies);
  283. /*
  284. * Sequence numbers should only increase. Messages get their
  285. * sequence number as they're queued in a sending conn. They
  286. * can be dropped, though, if the sending socket is closed before
  287. * they hit the wire. So sequence numbers can skip forward
  288. * under normal operation. They can also drop back in the conn
  289. * failover case as previously sent messages are resent down the
  290. * new instance of a conn. We drop those, otherwise we have
  291. * to assume that the next valid seq does not come after a
  292. * hole in the fragment stream.
  293. *
  294. * The headers don't give us a way to realize if fragments of
  295. * a message have been dropped. We assume that frags that arrive
  296. * to a flow are part of the current message on the flow that is
  297. * being reassembled. This means that senders can't drop messages
  298. * from the sending conn until all their frags are sent.
  299. *
  300. * XXX we could spend more on the wire to get more robust failure
  301. * detection, arguably worth it to avoid data corruption.
  302. */
  303. if (be64_to_cpu(inc->i_hdr.h_sequence) < cp->cp_next_rx_seq &&
  304. (inc->i_hdr.h_flags & RDS_FLAG_RETRANSMITTED)) {
  305. rds_stats_inc(s_recv_drop_old_seq);
  306. goto out;
  307. }
  308. cp->cp_next_rx_seq = be64_to_cpu(inc->i_hdr.h_sequence) + 1;
  309. if (rds_sysctl_ping_enable && inc->i_hdr.h_dport == 0) {
  310. if (inc->i_hdr.h_sport == 0) {
  311. rdsdebug("ignore ping with 0 sport from %pI6c\n",
  312. saddr);
  313. goto out;
  314. }
  315. rds_stats_inc(s_recv_ping);
  316. rds_send_pong(cp, inc->i_hdr.h_sport);
  317. /* if this is a handshake ping, start multipath if necessary */
  318. if (RDS_HS_PROBE(be16_to_cpu(inc->i_hdr.h_sport),
  319. be16_to_cpu(inc->i_hdr.h_dport))) {
  320. rds_recv_hs_exthdrs(&inc->i_hdr, cp->cp_conn);
  321. rds_start_mprds(cp->cp_conn);
  322. }
  323. goto out;
  324. }
  325. if (be16_to_cpu(inc->i_hdr.h_dport) == RDS_FLAG_PROBE_PORT &&
  326. inc->i_hdr.h_sport == 0) {
  327. rds_recv_hs_exthdrs(&inc->i_hdr, cp->cp_conn);
  328. /* if this is a handshake pong, start multipath if necessary */
  329. rds_start_mprds(cp->cp_conn);
  330. wake_up(&cp->cp_conn->c_hs_waitq);
  331. goto out;
  332. }
  333. rs = rds_find_bound(daddr, inc->i_hdr.h_dport, conn->c_bound_if);
  334. if (!rs) {
  335. rds_stats_inc(s_recv_drop_no_sock);
  336. goto out;
  337. }
  338. /* Process extension headers */
  339. rds_recv_incoming_exthdrs(inc, rs);
  340. /* We can be racing with rds_release() which marks the socket dead. */
  341. sk = rds_rs_to_sk(rs);
  342. /* serialize with rds_release -> sock_orphan */
  343. write_lock_irqsave(&rs->rs_recv_lock, flags);
  344. if (!sock_flag(sk, SOCK_DEAD)) {
  345. rdsdebug("adding inc %p to rs %p's recv queue\n", inc, rs);
  346. rds_stats_inc(s_recv_queued);
  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. if (sock_flag(sk, SOCK_RCVTSTAMP))
  351. do_gettimeofday(&inc->i_rx_tstamp);
  352. rds_inc_addref(inc);
  353. inc->i_rx_lat_trace[RDS_MSG_RX_END] = local_clock();
  354. list_add_tail(&inc->i_item, &rs->rs_recv_queue);
  355. __rds_wake_sk_sleep(sk);
  356. } else {
  357. rds_stats_inc(s_recv_drop_dead_sock);
  358. }
  359. write_unlock_irqrestore(&rs->rs_recv_lock, flags);
  360. out:
  361. if (rs)
  362. rds_sock_put(rs);
  363. }
  364. EXPORT_SYMBOL_GPL(rds_recv_incoming);
  365. /*
  366. * be very careful here. This is being called as the condition in
  367. * wait_event_*() needs to cope with being called many times.
  368. */
  369. static int rds_next_incoming(struct rds_sock *rs, struct rds_incoming **inc)
  370. {
  371. unsigned long flags;
  372. if (!*inc) {
  373. read_lock_irqsave(&rs->rs_recv_lock, flags);
  374. if (!list_empty(&rs->rs_recv_queue)) {
  375. *inc = list_entry(rs->rs_recv_queue.next,
  376. struct rds_incoming,
  377. i_item);
  378. rds_inc_addref(*inc);
  379. }
  380. read_unlock_irqrestore(&rs->rs_recv_lock, flags);
  381. }
  382. return *inc != NULL;
  383. }
  384. static int rds_still_queued(struct rds_sock *rs, struct rds_incoming *inc,
  385. int drop)
  386. {
  387. struct sock *sk = rds_rs_to_sk(rs);
  388. int ret = 0;
  389. unsigned long flags;
  390. write_lock_irqsave(&rs->rs_recv_lock, flags);
  391. if (!list_empty(&inc->i_item)) {
  392. ret = 1;
  393. if (drop) {
  394. /* XXX make sure this i_conn is reliable */
  395. rds_recv_rcvbuf_delta(rs, sk, inc->i_conn->c_lcong,
  396. -be32_to_cpu(inc->i_hdr.h_len),
  397. inc->i_hdr.h_dport);
  398. list_del_init(&inc->i_item);
  399. rds_inc_put(inc);
  400. }
  401. }
  402. write_unlock_irqrestore(&rs->rs_recv_lock, flags);
  403. rdsdebug("inc %p rs %p still %d dropped %d\n", inc, rs, ret, drop);
  404. return ret;
  405. }
  406. /*
  407. * Pull errors off the error queue.
  408. * If msghdr is NULL, we will just purge the error queue.
  409. */
  410. int rds_notify_queue_get(struct rds_sock *rs, struct msghdr *msghdr)
  411. {
  412. struct rds_notifier *notifier;
  413. struct rds_rdma_notify cmsg;
  414. unsigned int count = 0, max_messages = ~0U;
  415. unsigned long flags;
  416. LIST_HEAD(copy);
  417. int err = 0;
  418. memset(&cmsg, 0, sizeof(cmsg)); /* fill holes with zero */
  419. /* put_cmsg copies to user space and thus may sleep. We can't do this
  420. * with rs_lock held, so first grab as many notifications as we can stuff
  421. * in the user provided cmsg buffer. We don't try to copy more, to avoid
  422. * losing notifications - except when the buffer is so small that it wouldn't
  423. * even hold a single notification. Then we give him as much of this single
  424. * msg as we can squeeze in, and set MSG_CTRUNC.
  425. */
  426. if (msghdr) {
  427. max_messages = msghdr->msg_controllen / CMSG_SPACE(sizeof(cmsg));
  428. if (!max_messages)
  429. max_messages = 1;
  430. }
  431. spin_lock_irqsave(&rs->rs_lock, flags);
  432. while (!list_empty(&rs->rs_notify_queue) && count < max_messages) {
  433. notifier = list_entry(rs->rs_notify_queue.next,
  434. struct rds_notifier, n_list);
  435. list_move(&notifier->n_list, &copy);
  436. count++;
  437. }
  438. spin_unlock_irqrestore(&rs->rs_lock, flags);
  439. if (!count)
  440. return 0;
  441. while (!list_empty(&copy)) {
  442. notifier = list_entry(copy.next, struct rds_notifier, n_list);
  443. if (msghdr) {
  444. cmsg.user_token = notifier->n_user_token;
  445. cmsg.status = notifier->n_status;
  446. err = put_cmsg(msghdr, SOL_RDS, RDS_CMSG_RDMA_STATUS,
  447. sizeof(cmsg), &cmsg);
  448. if (err)
  449. break;
  450. }
  451. list_del_init(&notifier->n_list);
  452. kfree(notifier);
  453. }
  454. /* If we bailed out because of an error in put_cmsg,
  455. * we may be left with one or more notifications that we
  456. * didn't process. Return them to the head of the list. */
  457. if (!list_empty(&copy)) {
  458. spin_lock_irqsave(&rs->rs_lock, flags);
  459. list_splice(&copy, &rs->rs_notify_queue);
  460. spin_unlock_irqrestore(&rs->rs_lock, flags);
  461. }
  462. return err;
  463. }
  464. /*
  465. * Queue a congestion notification
  466. */
  467. static int rds_notify_cong(struct rds_sock *rs, struct msghdr *msghdr)
  468. {
  469. uint64_t notify = rs->rs_cong_notify;
  470. unsigned long flags;
  471. int err;
  472. err = put_cmsg(msghdr, SOL_RDS, RDS_CMSG_CONG_UPDATE,
  473. sizeof(notify), &notify);
  474. if (err)
  475. return err;
  476. spin_lock_irqsave(&rs->rs_lock, flags);
  477. rs->rs_cong_notify &= ~notify;
  478. spin_unlock_irqrestore(&rs->rs_lock, flags);
  479. return 0;
  480. }
  481. /*
  482. * Receive any control messages.
  483. */
  484. static int rds_cmsg_recv(struct rds_incoming *inc, struct msghdr *msg,
  485. struct rds_sock *rs)
  486. {
  487. int ret = 0;
  488. if (inc->i_rdma_cookie) {
  489. ret = put_cmsg(msg, SOL_RDS, RDS_CMSG_RDMA_DEST,
  490. sizeof(inc->i_rdma_cookie), &inc->i_rdma_cookie);
  491. if (ret)
  492. goto out;
  493. }
  494. if ((inc->i_rx_tstamp.tv_sec != 0) &&
  495. sock_flag(rds_rs_to_sk(rs), SOCK_RCVTSTAMP)) {
  496. ret = put_cmsg(msg, SOL_SOCKET, SCM_TIMESTAMP,
  497. sizeof(struct timeval),
  498. &inc->i_rx_tstamp);
  499. if (ret)
  500. goto out;
  501. }
  502. if (rs->rs_rx_traces) {
  503. struct rds_cmsg_rx_trace t;
  504. int i, j;
  505. memset(&t, 0, sizeof(t));
  506. inc->i_rx_lat_trace[RDS_MSG_RX_CMSG] = local_clock();
  507. t.rx_traces = rs->rs_rx_traces;
  508. for (i = 0; i < rs->rs_rx_traces; i++) {
  509. j = rs->rs_rx_trace[i];
  510. t.rx_trace_pos[i] = j;
  511. t.rx_trace[i] = inc->i_rx_lat_trace[j + 1] -
  512. inc->i_rx_lat_trace[j];
  513. }
  514. ret = put_cmsg(msg, SOL_RDS, RDS_CMSG_RXPATH_LATENCY,
  515. sizeof(t), &t);
  516. if (ret)
  517. goto out;
  518. }
  519. out:
  520. return ret;
  521. }
  522. static bool rds_recvmsg_zcookie(struct rds_sock *rs, struct msghdr *msg)
  523. {
  524. struct rds_msg_zcopy_queue *q = &rs->rs_zcookie_queue;
  525. struct rds_msg_zcopy_info *info = NULL;
  526. struct rds_zcopy_cookies *done;
  527. unsigned long flags;
  528. if (!msg->msg_control)
  529. return false;
  530. if (!sock_flag(rds_rs_to_sk(rs), SOCK_ZEROCOPY) ||
  531. msg->msg_controllen < CMSG_SPACE(sizeof(*done)))
  532. return false;
  533. spin_lock_irqsave(&q->lock, flags);
  534. if (!list_empty(&q->zcookie_head)) {
  535. info = list_entry(q->zcookie_head.next,
  536. struct rds_msg_zcopy_info, rs_zcookie_next);
  537. list_del(&info->rs_zcookie_next);
  538. }
  539. spin_unlock_irqrestore(&q->lock, flags);
  540. if (!info)
  541. return false;
  542. done = &info->zcookies;
  543. if (put_cmsg(msg, SOL_RDS, RDS_CMSG_ZCOPY_COMPLETION, sizeof(*done),
  544. done)) {
  545. spin_lock_irqsave(&q->lock, flags);
  546. list_add(&info->rs_zcookie_next, &q->zcookie_head);
  547. spin_unlock_irqrestore(&q->lock, flags);
  548. return false;
  549. }
  550. kfree(info);
  551. return true;
  552. }
  553. int rds_recvmsg(struct socket *sock, struct msghdr *msg, size_t size,
  554. int msg_flags)
  555. {
  556. struct sock *sk = sock->sk;
  557. struct rds_sock *rs = rds_sk_to_rs(sk);
  558. long timeo;
  559. int ret = 0, nonblock = msg_flags & MSG_DONTWAIT;
  560. DECLARE_SOCKADDR(struct sockaddr_in6 *, sin6, msg->msg_name);
  561. DECLARE_SOCKADDR(struct sockaddr_in *, sin, msg->msg_name);
  562. struct rds_incoming *inc = NULL;
  563. /* udp_recvmsg()->sock_recvtimeo() gets away without locking too.. */
  564. timeo = sock_rcvtimeo(sk, nonblock);
  565. rdsdebug("size %zu flags 0x%x timeo %ld\n", size, msg_flags, timeo);
  566. if (msg_flags & MSG_OOB)
  567. goto out;
  568. if (msg_flags & MSG_ERRQUEUE)
  569. return sock_recv_errqueue(sk, msg, size, SOL_IP, IP_RECVERR);
  570. while (1) {
  571. /* If there are pending notifications, do those - and nothing else */
  572. if (!list_empty(&rs->rs_notify_queue)) {
  573. ret = rds_notify_queue_get(rs, msg);
  574. break;
  575. }
  576. if (rs->rs_cong_notify) {
  577. ret = rds_notify_cong(rs, msg);
  578. break;
  579. }
  580. if (!rds_next_incoming(rs, &inc)) {
  581. if (nonblock) {
  582. bool reaped = rds_recvmsg_zcookie(rs, msg);
  583. ret = reaped ? 0 : -EAGAIN;
  584. break;
  585. }
  586. timeo = wait_event_interruptible_timeout(*sk_sleep(sk),
  587. (!list_empty(&rs->rs_notify_queue) ||
  588. rs->rs_cong_notify ||
  589. rds_next_incoming(rs, &inc)), timeo);
  590. rdsdebug("recvmsg woke inc %p timeo %ld\n", inc,
  591. timeo);
  592. if (timeo > 0 || timeo == MAX_SCHEDULE_TIMEOUT)
  593. continue;
  594. ret = timeo;
  595. if (ret == 0)
  596. ret = -ETIMEDOUT;
  597. break;
  598. }
  599. rdsdebug("copying inc %p from %pI6c:%u to user\n", inc,
  600. &inc->i_conn->c_faddr,
  601. ntohs(inc->i_hdr.h_sport));
  602. ret = inc->i_conn->c_trans->inc_copy_to_user(inc, &msg->msg_iter);
  603. if (ret < 0)
  604. break;
  605. /*
  606. * if the message we just copied isn't at the head of the
  607. * recv queue then someone else raced us to return it, try
  608. * to get the next message.
  609. */
  610. if (!rds_still_queued(rs, inc, !(msg_flags & MSG_PEEK))) {
  611. rds_inc_put(inc);
  612. inc = NULL;
  613. rds_stats_inc(s_recv_deliver_raced);
  614. iov_iter_revert(&msg->msg_iter, ret);
  615. continue;
  616. }
  617. if (ret < be32_to_cpu(inc->i_hdr.h_len)) {
  618. if (msg_flags & MSG_TRUNC)
  619. ret = be32_to_cpu(inc->i_hdr.h_len);
  620. msg->msg_flags |= MSG_TRUNC;
  621. }
  622. if (rds_cmsg_recv(inc, msg, rs)) {
  623. ret = -EFAULT;
  624. goto out;
  625. }
  626. rds_recvmsg_zcookie(rs, msg);
  627. rds_stats_inc(s_recv_delivered);
  628. if (msg->msg_name) {
  629. if (ipv6_addr_v4mapped(&inc->i_saddr)) {
  630. sin = (struct sockaddr_in *)msg->msg_name;
  631. sin->sin_family = AF_INET;
  632. sin->sin_port = inc->i_hdr.h_sport;
  633. sin->sin_addr.s_addr =
  634. inc->i_saddr.s6_addr32[3];
  635. memset(sin->sin_zero, 0, sizeof(sin->sin_zero));
  636. msg->msg_namelen = sizeof(*sin);
  637. } else {
  638. sin6 = (struct sockaddr_in6 *)msg->msg_name;
  639. sin6->sin6_family = AF_INET6;
  640. sin6->sin6_port = inc->i_hdr.h_sport;
  641. sin6->sin6_addr = inc->i_saddr;
  642. sin6->sin6_flowinfo = 0;
  643. sin6->sin6_scope_id = rs->rs_bound_scope_id;
  644. msg->msg_namelen = sizeof(*sin6);
  645. }
  646. }
  647. break;
  648. }
  649. if (inc)
  650. rds_inc_put(inc);
  651. out:
  652. return ret;
  653. }
  654. /*
  655. * The socket is being shut down and we're asked to drop messages that were
  656. * queued for recvmsg. The caller has unbound the socket so the receive path
  657. * won't queue any more incoming fragments or messages on the socket.
  658. */
  659. void rds_clear_recv_queue(struct rds_sock *rs)
  660. {
  661. struct sock *sk = rds_rs_to_sk(rs);
  662. struct rds_incoming *inc, *tmp;
  663. unsigned long flags;
  664. write_lock_irqsave(&rs->rs_recv_lock, flags);
  665. list_for_each_entry_safe(inc, tmp, &rs->rs_recv_queue, i_item) {
  666. rds_recv_rcvbuf_delta(rs, sk, inc->i_conn->c_lcong,
  667. -be32_to_cpu(inc->i_hdr.h_len),
  668. inc->i_hdr.h_dport);
  669. list_del_init(&inc->i_item);
  670. rds_inc_put(inc);
  671. }
  672. write_unlock_irqrestore(&rs->rs_recv_lock, flags);
  673. }
  674. /*
  675. * inc->i_saddr isn't used here because it is only set in the receive
  676. * path.
  677. */
  678. void rds_inc_info_copy(struct rds_incoming *inc,
  679. struct rds_info_iterator *iter,
  680. __be32 saddr, __be32 daddr, int flip)
  681. {
  682. struct rds_info_message minfo;
  683. minfo.seq = be64_to_cpu(inc->i_hdr.h_sequence);
  684. minfo.len = be32_to_cpu(inc->i_hdr.h_len);
  685. if (flip) {
  686. minfo.laddr = daddr;
  687. minfo.faddr = saddr;
  688. minfo.lport = inc->i_hdr.h_dport;
  689. minfo.fport = inc->i_hdr.h_sport;
  690. } else {
  691. minfo.laddr = saddr;
  692. minfo.faddr = daddr;
  693. minfo.lport = inc->i_hdr.h_sport;
  694. minfo.fport = inc->i_hdr.h_dport;
  695. }
  696. minfo.flags = 0;
  697. rds_info_copy(iter, &minfo, sizeof(minfo));
  698. }
  699. #if IS_ENABLED(CONFIG_IPV6)
  700. void rds6_inc_info_copy(struct rds_incoming *inc,
  701. struct rds_info_iterator *iter,
  702. struct in6_addr *saddr, struct in6_addr *daddr,
  703. int flip)
  704. {
  705. struct rds6_info_message minfo6;
  706. minfo6.seq = be64_to_cpu(inc->i_hdr.h_sequence);
  707. minfo6.len = be32_to_cpu(inc->i_hdr.h_len);
  708. minfo6.tos = 0;
  709. if (flip) {
  710. minfo6.laddr = *daddr;
  711. minfo6.faddr = *saddr;
  712. minfo6.lport = inc->i_hdr.h_dport;
  713. minfo6.fport = inc->i_hdr.h_sport;
  714. } else {
  715. minfo6.laddr = *saddr;
  716. minfo6.faddr = *daddr;
  717. minfo6.lport = inc->i_hdr.h_sport;
  718. minfo6.fport = inc->i_hdr.h_dport;
  719. }
  720. minfo6.flags = 0;
  721. rds_info_copy(iter, &minfo6, sizeof(minfo6));
  722. }
  723. #endif