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 41 #include "rds.h" 42 43 void 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; 51 inc->i_rx_tstamp.tv_sec = 0; 52 inc->i_rx_tstamp.tv_usec = 0; 53 } 54 EXPORT_SYMBOL_GPL(rds_inc_init); 55 56 void 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 } 68 EXPORT_SYMBOL_GPL(rds_inc_path_init); 69 70 static void rds_inc_addref(struct rds_incoming *inc) 71 { 72 rdsdebug("addref inc %p ref %d\n", inc, atomic_read(&inc->i_refcount)); 73 atomic_inc(&inc->i_refcount); 74 } 75 76 void 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 } 85 EXPORT_SYMBOL_GPL(rds_inc_put); 86 87 static 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 */ 126 static 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 */ 175 void rds_recv_incoming(struct rds_connection *conn, __be32 saddr, __be32 daddr, 176 struct rds_incoming *inc, gfp_t gfp) 177 { 178 struct rds_sock *rs = NULL; 179 struct sock *sk; 180 unsigned long flags; 181 struct rds_conn_path *cp; 182 183 inc->i_conn = conn; 184 inc->i_rx_jiffies = jiffies; 185 if (conn->c_trans->t_mp_capable) 186 cp = inc->i_conn_path; 187 else 188 cp = &conn->c_path[0]; 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, 192 (unsigned long long)cp->cp_next_rx_seq, 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 */ 221 if (be64_to_cpu(inc->i_hdr.h_sequence) < cp->cp_next_rx_seq && 222 (inc->i_hdr.h_flags & RDS_FLAG_RETRANSMITTED)) { 223 rds_stats_inc(s_recv_drop_old_seq); 224 goto out; 225 } 226 cp->cp_next_rx_seq = be64_to_cpu(inc->i_hdr.h_sequence) + 1; 227 228 if (rds_sysctl_ping_enable && inc->i_hdr.h_dport == 0) { 229 rds_stats_inc(s_recv_ping); 230 rds_send_pong(cp, inc->i_hdr.h_sport); 231 goto out; 232 } 233 234 rs = rds_find_bound(daddr, inc->i_hdr.h_dport); 235 if (!rs) { 236 rds_stats_inc(s_recv_drop_no_sock); 237 goto out; 238 } 239 240 /* Process extension headers */ 241 rds_recv_incoming_exthdrs(inc, rs); 242 243 /* We can be racing with rds_release() which marks the socket dead. */ 244 sk = rds_rs_to_sk(rs); 245 246 /* serialize with rds_release -> sock_orphan */ 247 write_lock_irqsave(&rs->rs_recv_lock, flags); 248 if (!sock_flag(sk, SOCK_DEAD)) { 249 rdsdebug("adding inc %p to rs %p's recv queue\n", inc, rs); 250 rds_stats_inc(s_recv_queued); 251 rds_recv_rcvbuf_delta(rs, sk, inc->i_conn->c_lcong, 252 be32_to_cpu(inc->i_hdr.h_len), 253 inc->i_hdr.h_dport); 254 if (sock_flag(sk, SOCK_RCVTSTAMP)) 255 do_gettimeofday(&inc->i_rx_tstamp); 256 rds_inc_addref(inc); 257 list_add_tail(&inc->i_item, &rs->rs_recv_queue); 258 __rds_wake_sk_sleep(sk); 259 } else { 260 rds_stats_inc(s_recv_drop_dead_sock); 261 } 262 write_unlock_irqrestore(&rs->rs_recv_lock, flags); 263 264 out: 265 if (rs) 266 rds_sock_put(rs); 267 } 268 EXPORT_SYMBOL_GPL(rds_recv_incoming); 269 270 /* 271 * be very careful here. This is being called as the condition in 272 * wait_event_*() needs to cope with being called many times. 273 */ 274 static int rds_next_incoming(struct rds_sock *rs, struct rds_incoming **inc) 275 { 276 unsigned long flags; 277 278 if (!*inc) { 279 read_lock_irqsave(&rs->rs_recv_lock, flags); 280 if (!list_empty(&rs->rs_recv_queue)) { 281 *inc = list_entry(rs->rs_recv_queue.next, 282 struct rds_incoming, 283 i_item); 284 rds_inc_addref(*inc); 285 } 286 read_unlock_irqrestore(&rs->rs_recv_lock, flags); 287 } 288 289 return *inc != NULL; 290 } 291 292 static int rds_still_queued(struct rds_sock *rs, struct rds_incoming *inc, 293 int drop) 294 { 295 struct sock *sk = rds_rs_to_sk(rs); 296 int ret = 0; 297 unsigned long flags; 298 299 write_lock_irqsave(&rs->rs_recv_lock, flags); 300 if (!list_empty(&inc->i_item)) { 301 ret = 1; 302 if (drop) { 303 /* XXX make sure this i_conn is reliable */ 304 rds_recv_rcvbuf_delta(rs, sk, inc->i_conn->c_lcong, 305 -be32_to_cpu(inc->i_hdr.h_len), 306 inc->i_hdr.h_dport); 307 list_del_init(&inc->i_item); 308 rds_inc_put(inc); 309 } 310 } 311 write_unlock_irqrestore(&rs->rs_recv_lock, flags); 312 313 rdsdebug("inc %p rs %p still %d dropped %d\n", inc, rs, ret, drop); 314 return ret; 315 } 316 317 /* 318 * Pull errors off the error queue. 319 * If msghdr is NULL, we will just purge the error queue. 320 */ 321 int rds_notify_queue_get(struct rds_sock *rs, struct msghdr *msghdr) 322 { 323 struct rds_notifier *notifier; 324 struct rds_rdma_notify cmsg = { 0 }; /* fill holes with zero */ 325 unsigned int count = 0, max_messages = ~0U; 326 unsigned long flags; 327 LIST_HEAD(copy); 328 int err = 0; 329 330 331 /* put_cmsg copies to user space and thus may sleep. We can't do this 332 * with rs_lock held, so first grab as many notifications as we can stuff 333 * in the user provided cmsg buffer. We don't try to copy more, to avoid 334 * losing notifications - except when the buffer is so small that it wouldn't 335 * even hold a single notification. Then we give him as much of this single 336 * msg as we can squeeze in, and set MSG_CTRUNC. 337 */ 338 if (msghdr) { 339 max_messages = msghdr->msg_controllen / CMSG_SPACE(sizeof(cmsg)); 340 if (!max_messages) 341 max_messages = 1; 342 } 343 344 spin_lock_irqsave(&rs->rs_lock, flags); 345 while (!list_empty(&rs->rs_notify_queue) && count < max_messages) { 346 notifier = list_entry(rs->rs_notify_queue.next, 347 struct rds_notifier, n_list); 348 list_move(¬ifier->n_list, ©); 349 count++; 350 } 351 spin_unlock_irqrestore(&rs->rs_lock, flags); 352 353 if (!count) 354 return 0; 355 356 while (!list_empty(©)) { 357 notifier = list_entry(copy.next, struct rds_notifier, n_list); 358 359 if (msghdr) { 360 cmsg.user_token = notifier->n_user_token; 361 cmsg.status = notifier->n_status; 362 363 err = put_cmsg(msghdr, SOL_RDS, RDS_CMSG_RDMA_STATUS, 364 sizeof(cmsg), &cmsg); 365 if (err) 366 break; 367 } 368 369 list_del_init(¬ifier->n_list); 370 kfree(notifier); 371 } 372 373 /* If we bailed out because of an error in put_cmsg, 374 * we may be left with one or more notifications that we 375 * didn't process. Return them to the head of the list. */ 376 if (!list_empty(©)) { 377 spin_lock_irqsave(&rs->rs_lock, flags); 378 list_splice(©, &rs->rs_notify_queue); 379 spin_unlock_irqrestore(&rs->rs_lock, flags); 380 } 381 382 return err; 383 } 384 385 /* 386 * Queue a congestion notification 387 */ 388 static int rds_notify_cong(struct rds_sock *rs, struct msghdr *msghdr) 389 { 390 uint64_t notify = rs->rs_cong_notify; 391 unsigned long flags; 392 int err; 393 394 err = put_cmsg(msghdr, SOL_RDS, RDS_CMSG_CONG_UPDATE, 395 sizeof(notify), ¬ify); 396 if (err) 397 return err; 398 399 spin_lock_irqsave(&rs->rs_lock, flags); 400 rs->rs_cong_notify &= ~notify; 401 spin_unlock_irqrestore(&rs->rs_lock, flags); 402 403 return 0; 404 } 405 406 /* 407 * Receive any control messages. 408 */ 409 static int rds_cmsg_recv(struct rds_incoming *inc, struct msghdr *msg, 410 struct rds_sock *rs) 411 { 412 int ret = 0; 413 414 if (inc->i_rdma_cookie) { 415 ret = put_cmsg(msg, SOL_RDS, RDS_CMSG_RDMA_DEST, 416 sizeof(inc->i_rdma_cookie), &inc->i_rdma_cookie); 417 if (ret) 418 return ret; 419 } 420 421 if ((inc->i_rx_tstamp.tv_sec != 0) && 422 sock_flag(rds_rs_to_sk(rs), SOCK_RCVTSTAMP)) { 423 ret = put_cmsg(msg, SOL_SOCKET, SCM_TIMESTAMP, 424 sizeof(struct timeval), 425 &inc->i_rx_tstamp); 426 if (ret) 427 return ret; 428 } 429 430 return 0; 431 } 432 433 int rds_recvmsg(struct socket *sock, struct msghdr *msg, size_t size, 434 int msg_flags) 435 { 436 struct sock *sk = sock->sk; 437 struct rds_sock *rs = rds_sk_to_rs(sk); 438 long timeo; 439 int ret = 0, nonblock = msg_flags & MSG_DONTWAIT; 440 DECLARE_SOCKADDR(struct sockaddr_in *, sin, msg->msg_name); 441 struct rds_incoming *inc = NULL; 442 443 /* udp_recvmsg()->sock_recvtimeo() gets away without locking too.. */ 444 timeo = sock_rcvtimeo(sk, nonblock); 445 446 rdsdebug("size %zu flags 0x%x timeo %ld\n", size, msg_flags, timeo); 447 448 if (msg_flags & MSG_OOB) 449 goto out; 450 451 while (1) { 452 struct iov_iter save; 453 /* If there are pending notifications, do those - and nothing else */ 454 if (!list_empty(&rs->rs_notify_queue)) { 455 ret = rds_notify_queue_get(rs, msg); 456 break; 457 } 458 459 if (rs->rs_cong_notify) { 460 ret = rds_notify_cong(rs, msg); 461 break; 462 } 463 464 if (!rds_next_incoming(rs, &inc)) { 465 if (nonblock) { 466 ret = -EAGAIN; 467 break; 468 } 469 470 timeo = wait_event_interruptible_timeout(*sk_sleep(sk), 471 (!list_empty(&rs->rs_notify_queue) || 472 rs->rs_cong_notify || 473 rds_next_incoming(rs, &inc)), timeo); 474 rdsdebug("recvmsg woke inc %p timeo %ld\n", inc, 475 timeo); 476 if (timeo > 0 || timeo == MAX_SCHEDULE_TIMEOUT) 477 continue; 478 479 ret = timeo; 480 if (ret == 0) 481 ret = -ETIMEDOUT; 482 break; 483 } 484 485 rdsdebug("copying inc %p from %pI4:%u to user\n", inc, 486 &inc->i_conn->c_faddr, 487 ntohs(inc->i_hdr.h_sport)); 488 save = msg->msg_iter; 489 ret = inc->i_conn->c_trans->inc_copy_to_user(inc, &msg->msg_iter); 490 if (ret < 0) 491 break; 492 493 /* 494 * if the message we just copied isn't at the head of the 495 * recv queue then someone else raced us to return it, try 496 * to get the next message. 497 */ 498 if (!rds_still_queued(rs, inc, !(msg_flags & MSG_PEEK))) { 499 rds_inc_put(inc); 500 inc = NULL; 501 rds_stats_inc(s_recv_deliver_raced); 502 msg->msg_iter = save; 503 continue; 504 } 505 506 if (ret < be32_to_cpu(inc->i_hdr.h_len)) { 507 if (msg_flags & MSG_TRUNC) 508 ret = be32_to_cpu(inc->i_hdr.h_len); 509 msg->msg_flags |= MSG_TRUNC; 510 } 511 512 if (rds_cmsg_recv(inc, msg, rs)) { 513 ret = -EFAULT; 514 goto out; 515 } 516 517 rds_stats_inc(s_recv_delivered); 518 519 if (sin) { 520 sin->sin_family = AF_INET; 521 sin->sin_port = inc->i_hdr.h_sport; 522 sin->sin_addr.s_addr = inc->i_saddr; 523 memset(sin->sin_zero, 0, sizeof(sin->sin_zero)); 524 msg->msg_namelen = sizeof(*sin); 525 } 526 break; 527 } 528 529 if (inc) 530 rds_inc_put(inc); 531 532 out: 533 return ret; 534 } 535 536 /* 537 * The socket is being shut down and we're asked to drop messages that were 538 * queued for recvmsg. The caller has unbound the socket so the receive path 539 * won't queue any more incoming fragments or messages on the socket. 540 */ 541 void rds_clear_recv_queue(struct rds_sock *rs) 542 { 543 struct sock *sk = rds_rs_to_sk(rs); 544 struct rds_incoming *inc, *tmp; 545 unsigned long flags; 546 547 write_lock_irqsave(&rs->rs_recv_lock, flags); 548 list_for_each_entry_safe(inc, tmp, &rs->rs_recv_queue, i_item) { 549 rds_recv_rcvbuf_delta(rs, sk, inc->i_conn->c_lcong, 550 -be32_to_cpu(inc->i_hdr.h_len), 551 inc->i_hdr.h_dport); 552 list_del_init(&inc->i_item); 553 rds_inc_put(inc); 554 } 555 write_unlock_irqrestore(&rs->rs_recv_lock, flags); 556 } 557 558 /* 559 * inc->i_saddr isn't used here because it is only set in the receive 560 * path. 561 */ 562 void rds_inc_info_copy(struct rds_incoming *inc, 563 struct rds_info_iterator *iter, 564 __be32 saddr, __be32 daddr, int flip) 565 { 566 struct rds_info_message minfo; 567 568 minfo.seq = be64_to_cpu(inc->i_hdr.h_sequence); 569 minfo.len = be32_to_cpu(inc->i_hdr.h_len); 570 571 if (flip) { 572 minfo.laddr = daddr; 573 minfo.faddr = saddr; 574 minfo.lport = inc->i_hdr.h_dport; 575 minfo.fport = inc->i_hdr.h_sport; 576 } else { 577 minfo.laddr = saddr; 578 minfo.faddr = daddr; 579 minfo.lport = inc->i_hdr.h_sport; 580 minfo.fport = inc->i_hdr.h_dport; 581 } 582 583 minfo.flags = 0; 584 585 rds_info_copy(iter, &minfo, sizeof(minfo)); 586 } 587