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