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