rjw | 1f88458 | 2022-01-06 17:20:42 +0800 | [diff] [blame^] | 1 | /* RxRPC individual remote procedure call handling |
| 2 | * |
| 3 | * Copyright (C) 2007 Red Hat, Inc. All Rights Reserved. |
| 4 | * Written by David Howells (dhowells@redhat.com) |
| 5 | * |
| 6 | * This program is free software; you can redistribute it and/or |
| 7 | * modify it under the terms of the GNU General Public License |
| 8 | * as published by the Free Software Foundation; either version |
| 9 | * 2 of the License, or (at your option) any later version. |
| 10 | */ |
| 11 | |
| 12 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
| 13 | |
| 14 | #include <linux/slab.h> |
| 15 | #include <linux/module.h> |
| 16 | #include <linux/circ_buf.h> |
| 17 | #include <linux/spinlock_types.h> |
| 18 | #include <net/sock.h> |
| 19 | #include <net/af_rxrpc.h> |
| 20 | #include "ar-internal.h" |
| 21 | |
| 22 | const char *const rxrpc_call_states[NR__RXRPC_CALL_STATES] = { |
| 23 | [RXRPC_CALL_UNINITIALISED] = "Uninit ", |
| 24 | [RXRPC_CALL_CLIENT_AWAIT_CONN] = "ClWtConn", |
| 25 | [RXRPC_CALL_CLIENT_SEND_REQUEST] = "ClSndReq", |
| 26 | [RXRPC_CALL_CLIENT_AWAIT_REPLY] = "ClAwtRpl", |
| 27 | [RXRPC_CALL_CLIENT_RECV_REPLY] = "ClRcvRpl", |
| 28 | [RXRPC_CALL_SERVER_PREALLOC] = "SvPrealc", |
| 29 | [RXRPC_CALL_SERVER_SECURING] = "SvSecure", |
| 30 | [RXRPC_CALL_SERVER_ACCEPTING] = "SvAccept", |
| 31 | [RXRPC_CALL_SERVER_RECV_REQUEST] = "SvRcvReq", |
| 32 | [RXRPC_CALL_SERVER_ACK_REQUEST] = "SvAckReq", |
| 33 | [RXRPC_CALL_SERVER_SEND_REPLY] = "SvSndRpl", |
| 34 | [RXRPC_CALL_SERVER_AWAIT_ACK] = "SvAwtACK", |
| 35 | [RXRPC_CALL_COMPLETE] = "Complete", |
| 36 | }; |
| 37 | |
| 38 | const char *const rxrpc_call_completions[NR__RXRPC_CALL_COMPLETIONS] = { |
| 39 | [RXRPC_CALL_SUCCEEDED] = "Complete", |
| 40 | [RXRPC_CALL_REMOTELY_ABORTED] = "RmtAbort", |
| 41 | [RXRPC_CALL_LOCALLY_ABORTED] = "LocAbort", |
| 42 | [RXRPC_CALL_LOCAL_ERROR] = "LocError", |
| 43 | [RXRPC_CALL_NETWORK_ERROR] = "NetError", |
| 44 | }; |
| 45 | |
| 46 | struct kmem_cache *rxrpc_call_jar; |
| 47 | |
| 48 | static void rxrpc_call_timer_expired(unsigned long _call) |
| 49 | { |
| 50 | struct rxrpc_call *call = (struct rxrpc_call *)_call; |
| 51 | |
| 52 | _enter("%d", call->debug_id); |
| 53 | |
| 54 | if (call->state < RXRPC_CALL_COMPLETE) |
| 55 | rxrpc_set_timer(call, rxrpc_timer_expired, ktime_get_real()); |
| 56 | } |
| 57 | |
| 58 | static struct lock_class_key rxrpc_call_user_mutex_lock_class_key; |
| 59 | |
| 60 | /* |
| 61 | * find an extant server call |
| 62 | * - called in process context with IRQs enabled |
| 63 | */ |
| 64 | struct rxrpc_call *rxrpc_find_call_by_user_ID(struct rxrpc_sock *rx, |
| 65 | unsigned long user_call_ID) |
| 66 | { |
| 67 | struct rxrpc_call *call; |
| 68 | struct rb_node *p; |
| 69 | |
| 70 | _enter("%p,%lx", rx, user_call_ID); |
| 71 | |
| 72 | read_lock(&rx->call_lock); |
| 73 | |
| 74 | p = rx->calls.rb_node; |
| 75 | while (p) { |
| 76 | call = rb_entry(p, struct rxrpc_call, sock_node); |
| 77 | |
| 78 | if (user_call_ID < call->user_call_ID) |
| 79 | p = p->rb_left; |
| 80 | else if (user_call_ID > call->user_call_ID) |
| 81 | p = p->rb_right; |
| 82 | else |
| 83 | goto found_extant_call; |
| 84 | } |
| 85 | |
| 86 | read_unlock(&rx->call_lock); |
| 87 | _leave(" = NULL"); |
| 88 | return NULL; |
| 89 | |
| 90 | found_extant_call: |
| 91 | rxrpc_get_call(call, rxrpc_call_got); |
| 92 | read_unlock(&rx->call_lock); |
| 93 | _leave(" = %p [%d]", call, atomic_read(&call->usage)); |
| 94 | return call; |
| 95 | } |
| 96 | |
| 97 | /* |
| 98 | * allocate a new call |
| 99 | */ |
| 100 | struct rxrpc_call *rxrpc_alloc_call(struct rxrpc_sock *rx, gfp_t gfp) |
| 101 | { |
| 102 | struct rxrpc_call *call; |
| 103 | |
| 104 | call = kmem_cache_zalloc(rxrpc_call_jar, gfp); |
| 105 | if (!call) |
| 106 | return NULL; |
| 107 | |
| 108 | call->rxtx_buffer = kcalloc(RXRPC_RXTX_BUFF_SIZE, |
| 109 | sizeof(struct sk_buff *), |
| 110 | gfp); |
| 111 | if (!call->rxtx_buffer) |
| 112 | goto nomem; |
| 113 | |
| 114 | call->rxtx_annotations = kcalloc(RXRPC_RXTX_BUFF_SIZE, sizeof(u8), gfp); |
| 115 | if (!call->rxtx_annotations) |
| 116 | goto nomem_2; |
| 117 | |
| 118 | mutex_init(&call->user_mutex); |
| 119 | |
| 120 | /* Prevent lockdep reporting a deadlock false positive between the afs |
| 121 | * filesystem and sys_sendmsg() via the mmap sem. |
| 122 | */ |
| 123 | if (rx->sk.sk_kern_sock) |
| 124 | lockdep_set_class(&call->user_mutex, |
| 125 | &rxrpc_call_user_mutex_lock_class_key); |
| 126 | |
| 127 | setup_timer(&call->timer, rxrpc_call_timer_expired, |
| 128 | (unsigned long)call); |
| 129 | INIT_WORK(&call->processor, &rxrpc_process_call); |
| 130 | INIT_LIST_HEAD(&call->link); |
| 131 | INIT_LIST_HEAD(&call->chan_wait_link); |
| 132 | INIT_LIST_HEAD(&call->accept_link); |
| 133 | INIT_LIST_HEAD(&call->recvmsg_link); |
| 134 | INIT_LIST_HEAD(&call->sock_link); |
| 135 | init_waitqueue_head(&call->waitq); |
| 136 | spin_lock_init(&call->lock); |
| 137 | rwlock_init(&call->state_lock); |
| 138 | atomic_set(&call->usage, 1); |
| 139 | call->debug_id = atomic_inc_return(&rxrpc_debug_id); |
| 140 | call->tx_total_len = -1; |
| 141 | |
| 142 | memset(&call->sock_node, 0xed, sizeof(call->sock_node)); |
| 143 | |
| 144 | /* Leave space in the ring to handle a maxed-out jumbo packet */ |
| 145 | call->rx_winsize = rxrpc_rx_window_size; |
| 146 | call->tx_winsize = 16; |
| 147 | call->rx_expect_next = 1; |
| 148 | |
| 149 | call->cong_cwnd = 2; |
| 150 | call->cong_ssthresh = RXRPC_RXTX_BUFF_SIZE - 1; |
| 151 | return call; |
| 152 | |
| 153 | nomem_2: |
| 154 | kfree(call->rxtx_buffer); |
| 155 | nomem: |
| 156 | kmem_cache_free(rxrpc_call_jar, call); |
| 157 | return NULL; |
| 158 | } |
| 159 | |
| 160 | /* |
| 161 | * Allocate a new client call. |
| 162 | */ |
| 163 | static struct rxrpc_call *rxrpc_alloc_client_call(struct rxrpc_sock *rx, |
| 164 | struct sockaddr_rxrpc *srx, |
| 165 | gfp_t gfp) |
| 166 | { |
| 167 | struct rxrpc_call *call; |
| 168 | ktime_t now; |
| 169 | |
| 170 | _enter(""); |
| 171 | |
| 172 | call = rxrpc_alloc_call(rx, gfp); |
| 173 | if (!call) |
| 174 | return ERR_PTR(-ENOMEM); |
| 175 | call->state = RXRPC_CALL_CLIENT_AWAIT_CONN; |
| 176 | call->service_id = srx->srx_service; |
| 177 | call->tx_phase = true; |
| 178 | now = ktime_get_real(); |
| 179 | call->acks_latest_ts = now; |
| 180 | call->cong_tstamp = now; |
| 181 | |
| 182 | _leave(" = %p", call); |
| 183 | return call; |
| 184 | } |
| 185 | |
| 186 | /* |
| 187 | * Initiate the call ack/resend/expiry timer. |
| 188 | */ |
| 189 | static void rxrpc_start_call_timer(struct rxrpc_call *call) |
| 190 | { |
| 191 | ktime_t now = ktime_get_real(), expire_at; |
| 192 | |
| 193 | expire_at = ktime_add_ms(now, rxrpc_max_call_lifetime); |
| 194 | call->expire_at = expire_at; |
| 195 | call->ack_at = expire_at; |
| 196 | call->ping_at = expire_at; |
| 197 | call->resend_at = expire_at; |
| 198 | call->timer.expires = jiffies + LONG_MAX / 2; |
| 199 | rxrpc_set_timer(call, rxrpc_timer_begin, now); |
| 200 | } |
| 201 | |
| 202 | /* |
| 203 | * Set up a call for the given parameters. |
| 204 | * - Called with the socket lock held, which it must release. |
| 205 | * - If it returns a call, the call's lock will need releasing by the caller. |
| 206 | */ |
| 207 | struct rxrpc_call *rxrpc_new_client_call(struct rxrpc_sock *rx, |
| 208 | struct rxrpc_conn_parameters *cp, |
| 209 | struct sockaddr_rxrpc *srx, |
| 210 | unsigned long user_call_ID, |
| 211 | s64 tx_total_len, |
| 212 | gfp_t gfp) |
| 213 | __releases(&rx->sk.sk_lock.slock) |
| 214 | { |
| 215 | struct rxrpc_call *call, *xcall; |
| 216 | struct rxrpc_net *rxnet = rxrpc_net(sock_net(&rx->sk)); |
| 217 | struct rb_node *parent, **pp; |
| 218 | const void *here = __builtin_return_address(0); |
| 219 | int ret; |
| 220 | |
| 221 | _enter("%p,%lx", rx, user_call_ID); |
| 222 | |
| 223 | call = rxrpc_alloc_client_call(rx, srx, gfp); |
| 224 | if (IS_ERR(call)) { |
| 225 | release_sock(&rx->sk); |
| 226 | _leave(" = %ld", PTR_ERR(call)); |
| 227 | return call; |
| 228 | } |
| 229 | |
| 230 | call->tx_total_len = tx_total_len; |
| 231 | trace_rxrpc_call(call, rxrpc_call_new_client, atomic_read(&call->usage), |
| 232 | here, (const void *)user_call_ID); |
| 233 | |
| 234 | /* We need to protect a partially set up call against the user as we |
| 235 | * will be acting outside the socket lock. |
| 236 | */ |
| 237 | mutex_lock(&call->user_mutex); |
| 238 | |
| 239 | /* Publish the call, even though it is incompletely set up as yet */ |
| 240 | write_lock(&rx->call_lock); |
| 241 | |
| 242 | pp = &rx->calls.rb_node; |
| 243 | parent = NULL; |
| 244 | while (*pp) { |
| 245 | parent = *pp; |
| 246 | xcall = rb_entry(parent, struct rxrpc_call, sock_node); |
| 247 | |
| 248 | if (user_call_ID < xcall->user_call_ID) |
| 249 | pp = &(*pp)->rb_left; |
| 250 | else if (user_call_ID > xcall->user_call_ID) |
| 251 | pp = &(*pp)->rb_right; |
| 252 | else |
| 253 | goto error_dup_user_ID; |
| 254 | } |
| 255 | |
| 256 | rcu_assign_pointer(call->socket, rx); |
| 257 | call->user_call_ID = user_call_ID; |
| 258 | __set_bit(RXRPC_CALL_HAS_USERID, &call->flags); |
| 259 | rxrpc_get_call(call, rxrpc_call_got_userid); |
| 260 | rb_link_node(&call->sock_node, parent, pp); |
| 261 | rb_insert_color(&call->sock_node, &rx->calls); |
| 262 | list_add(&call->sock_link, &rx->sock_calls); |
| 263 | |
| 264 | write_unlock(&rx->call_lock); |
| 265 | |
| 266 | write_lock(&rxnet->call_lock); |
| 267 | list_add_tail(&call->link, &rxnet->calls); |
| 268 | write_unlock(&rxnet->call_lock); |
| 269 | |
| 270 | /* From this point on, the call is protected by its own lock. */ |
| 271 | release_sock(&rx->sk); |
| 272 | |
| 273 | /* Set up or get a connection record and set the protocol parameters, |
| 274 | * including channel number and call ID. |
| 275 | */ |
| 276 | ret = rxrpc_connect_call(call, cp, srx, gfp); |
| 277 | if (ret < 0) |
| 278 | goto error_attached_to_socket; |
| 279 | |
| 280 | trace_rxrpc_call(call, rxrpc_call_connected, atomic_read(&call->usage), |
| 281 | here, NULL); |
| 282 | |
| 283 | rxrpc_start_call_timer(call); |
| 284 | |
| 285 | _net("CALL new %d on CONN %d", call->debug_id, call->conn->debug_id); |
| 286 | |
| 287 | _leave(" = %p [new]", call); |
| 288 | return call; |
| 289 | |
| 290 | /* We unexpectedly found the user ID in the list after taking |
| 291 | * the call_lock. This shouldn't happen unless the user races |
| 292 | * with itself and tries to add the same user ID twice at the |
| 293 | * same time in different threads. |
| 294 | */ |
| 295 | error_dup_user_ID: |
| 296 | write_unlock(&rx->call_lock); |
| 297 | release_sock(&rx->sk); |
| 298 | __rxrpc_set_call_completion(call, RXRPC_CALL_LOCAL_ERROR, |
| 299 | RX_CALL_DEAD, -EEXIST); |
| 300 | trace_rxrpc_call(call, rxrpc_call_error, atomic_read(&call->usage), |
| 301 | here, ERR_PTR(-EEXIST)); |
| 302 | rxrpc_release_call(rx, call); |
| 303 | mutex_unlock(&call->user_mutex); |
| 304 | rxrpc_put_call(call, rxrpc_call_put); |
| 305 | _leave(" = -EEXIST"); |
| 306 | return ERR_PTR(-EEXIST); |
| 307 | |
| 308 | /* We got an error, but the call is attached to the socket and is in |
| 309 | * need of release. However, we might now race with recvmsg() when |
| 310 | * completing the call queues it. Return 0 from sys_sendmsg() and |
| 311 | * leave the error to recvmsg() to deal with. |
| 312 | */ |
| 313 | error_attached_to_socket: |
| 314 | trace_rxrpc_call(call, rxrpc_call_error, atomic_read(&call->usage), |
| 315 | here, ERR_PTR(ret)); |
| 316 | set_bit(RXRPC_CALL_DISCONNECTED, &call->flags); |
| 317 | __rxrpc_set_call_completion(call, RXRPC_CALL_LOCAL_ERROR, |
| 318 | RX_CALL_DEAD, ret); |
| 319 | _leave(" = c=%08x [err]", call->debug_id); |
| 320 | return call; |
| 321 | } |
| 322 | |
| 323 | /* |
| 324 | * Retry a call to a new address. It is expected that the Tx queue of the call |
| 325 | * will contain data previously packaged for an old call. |
| 326 | */ |
| 327 | int rxrpc_retry_client_call(struct rxrpc_sock *rx, |
| 328 | struct rxrpc_call *call, |
| 329 | struct rxrpc_conn_parameters *cp, |
| 330 | struct sockaddr_rxrpc *srx, |
| 331 | gfp_t gfp) |
| 332 | { |
| 333 | const void *here = __builtin_return_address(0); |
| 334 | int ret; |
| 335 | |
| 336 | /* Set up or get a connection record and set the protocol parameters, |
| 337 | * including channel number and call ID. |
| 338 | */ |
| 339 | ret = rxrpc_connect_call(call, cp, srx, gfp); |
| 340 | if (ret < 0) |
| 341 | goto error; |
| 342 | |
| 343 | trace_rxrpc_call(call, rxrpc_call_connected, atomic_read(&call->usage), |
| 344 | here, NULL); |
| 345 | |
| 346 | rxrpc_start_call_timer(call); |
| 347 | |
| 348 | _net("CALL new %d on CONN %d", call->debug_id, call->conn->debug_id); |
| 349 | |
| 350 | if (!test_and_set_bit(RXRPC_CALL_EV_RESEND, &call->events)) |
| 351 | rxrpc_queue_call(call); |
| 352 | |
| 353 | _leave(" = 0"); |
| 354 | return 0; |
| 355 | |
| 356 | error: |
| 357 | rxrpc_set_call_completion(call, RXRPC_CALL_LOCAL_ERROR, |
| 358 | RX_CALL_DEAD, ret); |
| 359 | trace_rxrpc_call(call, rxrpc_call_error, atomic_read(&call->usage), |
| 360 | here, ERR_PTR(ret)); |
| 361 | _leave(" = %d", ret); |
| 362 | return ret; |
| 363 | } |
| 364 | |
| 365 | /* |
| 366 | * Set up an incoming call. call->conn points to the connection. |
| 367 | * This is called in BH context and isn't allowed to fail. |
| 368 | */ |
| 369 | void rxrpc_incoming_call(struct rxrpc_sock *rx, |
| 370 | struct rxrpc_call *call, |
| 371 | struct sk_buff *skb) |
| 372 | { |
| 373 | struct rxrpc_connection *conn = call->conn; |
| 374 | struct rxrpc_skb_priv *sp = rxrpc_skb(skb); |
| 375 | u32 chan; |
| 376 | |
| 377 | _enter(",%d", call->conn->debug_id); |
| 378 | |
| 379 | rcu_assign_pointer(call->socket, rx); |
| 380 | call->call_id = sp->hdr.callNumber; |
| 381 | call->service_id = sp->hdr.serviceId; |
| 382 | call->cid = sp->hdr.cid; |
| 383 | call->state = RXRPC_CALL_SERVER_ACCEPTING; |
| 384 | if (sp->hdr.securityIndex > 0) |
| 385 | call->state = RXRPC_CALL_SERVER_SECURING; |
| 386 | call->cong_tstamp = skb->tstamp; |
| 387 | |
| 388 | /* Set the channel for this call. We don't get channel_lock as we're |
| 389 | * only defending against the data_ready handler (which we're called |
| 390 | * from) and the RESPONSE packet parser (which is only really |
| 391 | * interested in call_counter and can cope with a disagreement with the |
| 392 | * call pointer). |
| 393 | */ |
| 394 | chan = sp->hdr.cid & RXRPC_CHANNELMASK; |
| 395 | conn->channels[chan].call_counter = call->call_id; |
| 396 | conn->channels[chan].call_id = call->call_id; |
| 397 | rcu_assign_pointer(conn->channels[chan].call, call); |
| 398 | |
| 399 | spin_lock(&conn->params.peer->lock); |
| 400 | hlist_add_head(&call->error_link, &conn->params.peer->error_targets); |
| 401 | spin_unlock(&conn->params.peer->lock); |
| 402 | |
| 403 | _net("CALL incoming %d on CONN %d", call->debug_id, call->conn->debug_id); |
| 404 | |
| 405 | rxrpc_start_call_timer(call); |
| 406 | _leave(""); |
| 407 | } |
| 408 | |
| 409 | /* |
| 410 | * Queue a call's work processor, getting a ref to pass to the work queue. |
| 411 | */ |
| 412 | bool rxrpc_queue_call(struct rxrpc_call *call) |
| 413 | { |
| 414 | const void *here = __builtin_return_address(0); |
| 415 | int n = __atomic_add_unless(&call->usage, 1, 0); |
| 416 | if (n == 0) |
| 417 | return false; |
| 418 | if (rxrpc_queue_work(&call->processor)) |
| 419 | trace_rxrpc_call(call, rxrpc_call_queued, n + 1, here, NULL); |
| 420 | else |
| 421 | rxrpc_put_call(call, rxrpc_call_put_noqueue); |
| 422 | return true; |
| 423 | } |
| 424 | |
| 425 | /* |
| 426 | * Queue a call's work processor, passing the callers ref to the work queue. |
| 427 | */ |
| 428 | bool __rxrpc_queue_call(struct rxrpc_call *call) |
| 429 | { |
| 430 | const void *here = __builtin_return_address(0); |
| 431 | int n = atomic_read(&call->usage); |
| 432 | ASSERTCMP(n, >=, 1); |
| 433 | if (rxrpc_queue_work(&call->processor)) |
| 434 | trace_rxrpc_call(call, rxrpc_call_queued_ref, n, here, NULL); |
| 435 | else |
| 436 | rxrpc_put_call(call, rxrpc_call_put_noqueue); |
| 437 | return true; |
| 438 | } |
| 439 | |
| 440 | /* |
| 441 | * Note the re-emergence of a call. |
| 442 | */ |
| 443 | void rxrpc_see_call(struct rxrpc_call *call) |
| 444 | { |
| 445 | const void *here = __builtin_return_address(0); |
| 446 | if (call) { |
| 447 | int n = atomic_read(&call->usage); |
| 448 | |
| 449 | trace_rxrpc_call(call, rxrpc_call_seen, n, here, NULL); |
| 450 | } |
| 451 | } |
| 452 | |
| 453 | /* |
| 454 | * Note the addition of a ref on a call. |
| 455 | */ |
| 456 | void rxrpc_get_call(struct rxrpc_call *call, enum rxrpc_call_trace op) |
| 457 | { |
| 458 | const void *here = __builtin_return_address(0); |
| 459 | int n = atomic_inc_return(&call->usage); |
| 460 | |
| 461 | trace_rxrpc_call(call, op, n, here, NULL); |
| 462 | } |
| 463 | |
| 464 | /* |
| 465 | * Detach a call from its owning socket. |
| 466 | */ |
| 467 | void rxrpc_release_call(struct rxrpc_sock *rx, struct rxrpc_call *call) |
| 468 | { |
| 469 | const void *here = __builtin_return_address(0); |
| 470 | struct rxrpc_connection *conn = call->conn; |
| 471 | bool put = false; |
| 472 | int i; |
| 473 | |
| 474 | _enter("{%d,%d}", call->debug_id, atomic_read(&call->usage)); |
| 475 | |
| 476 | trace_rxrpc_call(call, rxrpc_call_release, atomic_read(&call->usage), |
| 477 | here, (const void *)call->flags); |
| 478 | |
| 479 | ASSERTCMP(call->state, ==, RXRPC_CALL_COMPLETE); |
| 480 | |
| 481 | spin_lock_bh(&call->lock); |
| 482 | if (test_and_set_bit(RXRPC_CALL_RELEASED, &call->flags)) |
| 483 | BUG(); |
| 484 | spin_unlock_bh(&call->lock); |
| 485 | |
| 486 | del_timer_sync(&call->timer); |
| 487 | |
| 488 | /* Make sure we don't get any more notifications */ |
| 489 | write_lock_bh(&rx->recvmsg_lock); |
| 490 | |
| 491 | if (!list_empty(&call->recvmsg_link)) { |
| 492 | _debug("unlinking once-pending call %p { e=%lx f=%lx }", |
| 493 | call, call->events, call->flags); |
| 494 | list_del(&call->recvmsg_link); |
| 495 | put = true; |
| 496 | } |
| 497 | |
| 498 | /* list_empty() must return false in rxrpc_notify_socket() */ |
| 499 | call->recvmsg_link.next = NULL; |
| 500 | call->recvmsg_link.prev = NULL; |
| 501 | |
| 502 | write_unlock_bh(&rx->recvmsg_lock); |
| 503 | if (put) |
| 504 | rxrpc_put_call(call, rxrpc_call_put); |
| 505 | |
| 506 | write_lock(&rx->call_lock); |
| 507 | |
| 508 | if (test_and_clear_bit(RXRPC_CALL_HAS_USERID, &call->flags)) { |
| 509 | rb_erase(&call->sock_node, &rx->calls); |
| 510 | memset(&call->sock_node, 0xdd, sizeof(call->sock_node)); |
| 511 | rxrpc_put_call(call, rxrpc_call_put_userid); |
| 512 | } |
| 513 | |
| 514 | list_del(&call->sock_link); |
| 515 | write_unlock(&rx->call_lock); |
| 516 | |
| 517 | _debug("RELEASE CALL %p (%d CONN %p)", call, call->debug_id, conn); |
| 518 | |
| 519 | if (conn && !test_bit(RXRPC_CALL_DISCONNECTED, &call->flags)) |
| 520 | rxrpc_disconnect_call(call); |
| 521 | |
| 522 | for (i = 0; i < RXRPC_RXTX_BUFF_SIZE; i++) { |
| 523 | rxrpc_free_skb(call->rxtx_buffer[i], |
| 524 | (call->tx_phase ? rxrpc_skb_tx_cleaned : |
| 525 | rxrpc_skb_rx_cleaned)); |
| 526 | call->rxtx_buffer[i] = NULL; |
| 527 | } |
| 528 | |
| 529 | _leave(""); |
| 530 | } |
| 531 | |
| 532 | /* |
| 533 | * Prepare a kernel service call for retry. |
| 534 | */ |
| 535 | int rxrpc_prepare_call_for_retry(struct rxrpc_sock *rx, struct rxrpc_call *call) |
| 536 | { |
| 537 | const void *here = __builtin_return_address(0); |
| 538 | int i; |
| 539 | u8 last = 0; |
| 540 | |
| 541 | _enter("{%d,%d}", call->debug_id, atomic_read(&call->usage)); |
| 542 | |
| 543 | trace_rxrpc_call(call, rxrpc_call_release, atomic_read(&call->usage), |
| 544 | here, (const void *)call->flags); |
| 545 | |
| 546 | ASSERTCMP(call->state, ==, RXRPC_CALL_COMPLETE); |
| 547 | ASSERTCMP(call->completion, !=, RXRPC_CALL_REMOTELY_ABORTED); |
| 548 | ASSERTCMP(call->completion, !=, RXRPC_CALL_LOCALLY_ABORTED); |
| 549 | ASSERT(list_empty(&call->recvmsg_link)); |
| 550 | |
| 551 | del_timer_sync(&call->timer); |
| 552 | |
| 553 | _debug("RELEASE CALL %p (%d CONN %p)", call, call->debug_id, call->conn); |
| 554 | |
| 555 | if (call->conn) |
| 556 | rxrpc_disconnect_call(call); |
| 557 | |
| 558 | if (rxrpc_is_service_call(call) || |
| 559 | !call->tx_phase || |
| 560 | call->tx_hard_ack != 0 || |
| 561 | call->rx_hard_ack != 0 || |
| 562 | call->rx_top != 0) |
| 563 | return -EINVAL; |
| 564 | |
| 565 | call->state = RXRPC_CALL_UNINITIALISED; |
| 566 | call->completion = RXRPC_CALL_SUCCEEDED; |
| 567 | call->call_id = 0; |
| 568 | call->cid = 0; |
| 569 | call->cong_cwnd = 0; |
| 570 | call->cong_extra = 0; |
| 571 | call->cong_ssthresh = 0; |
| 572 | call->cong_mode = 0; |
| 573 | call->cong_dup_acks = 0; |
| 574 | call->cong_cumul_acks = 0; |
| 575 | call->acks_lowest_nak = 0; |
| 576 | |
| 577 | for (i = 0; i < RXRPC_RXTX_BUFF_SIZE; i++) { |
| 578 | last |= call->rxtx_annotations[i]; |
| 579 | call->rxtx_annotations[i] &= RXRPC_TX_ANNO_LAST; |
| 580 | call->rxtx_annotations[i] |= RXRPC_TX_ANNO_RETRANS; |
| 581 | } |
| 582 | |
| 583 | _leave(" = 0"); |
| 584 | return 0; |
| 585 | } |
| 586 | |
| 587 | /* |
| 588 | * release all the calls associated with a socket |
| 589 | */ |
| 590 | void rxrpc_release_calls_on_socket(struct rxrpc_sock *rx) |
| 591 | { |
| 592 | struct rxrpc_call *call; |
| 593 | |
| 594 | _enter("%p", rx); |
| 595 | |
| 596 | while (!list_empty(&rx->to_be_accepted)) { |
| 597 | call = list_entry(rx->to_be_accepted.next, |
| 598 | struct rxrpc_call, accept_link); |
| 599 | list_del(&call->accept_link); |
| 600 | rxrpc_abort_call("SKR", call, 0, RX_CALL_DEAD, -ECONNRESET); |
| 601 | rxrpc_put_call(call, rxrpc_call_put); |
| 602 | } |
| 603 | |
| 604 | while (!list_empty(&rx->sock_calls)) { |
| 605 | call = list_entry(rx->sock_calls.next, |
| 606 | struct rxrpc_call, sock_link); |
| 607 | rxrpc_get_call(call, rxrpc_call_got); |
| 608 | rxrpc_abort_call("SKT", call, 0, RX_CALL_DEAD, -ECONNRESET); |
| 609 | rxrpc_send_abort_packet(call); |
| 610 | rxrpc_release_call(rx, call); |
| 611 | rxrpc_put_call(call, rxrpc_call_put); |
| 612 | } |
| 613 | |
| 614 | _leave(""); |
| 615 | } |
| 616 | |
| 617 | /* |
| 618 | * release a call |
| 619 | */ |
| 620 | void rxrpc_put_call(struct rxrpc_call *call, enum rxrpc_call_trace op) |
| 621 | { |
| 622 | struct rxrpc_net *rxnet; |
| 623 | const void *here = __builtin_return_address(0); |
| 624 | int n; |
| 625 | |
| 626 | ASSERT(call != NULL); |
| 627 | |
| 628 | n = atomic_dec_return(&call->usage); |
| 629 | trace_rxrpc_call(call, op, n, here, NULL); |
| 630 | ASSERTCMP(n, >=, 0); |
| 631 | if (n == 0) { |
| 632 | _debug("call %d dead", call->debug_id); |
| 633 | ASSERTCMP(call->state, ==, RXRPC_CALL_COMPLETE); |
| 634 | |
| 635 | if (!list_empty(&call->link)) { |
| 636 | rxnet = rxrpc_net(sock_net(&call->socket->sk)); |
| 637 | write_lock(&rxnet->call_lock); |
| 638 | list_del_init(&call->link); |
| 639 | write_unlock(&rxnet->call_lock); |
| 640 | } |
| 641 | |
| 642 | rxrpc_cleanup_call(call); |
| 643 | } |
| 644 | } |
| 645 | |
| 646 | /* |
| 647 | * Final call destruction under RCU. |
| 648 | */ |
| 649 | static void rxrpc_rcu_destroy_call(struct rcu_head *rcu) |
| 650 | { |
| 651 | struct rxrpc_call *call = container_of(rcu, struct rxrpc_call, rcu); |
| 652 | |
| 653 | rxrpc_put_connection(call->conn); |
| 654 | rxrpc_put_peer(call->peer); |
| 655 | kfree(call->rxtx_buffer); |
| 656 | kfree(call->rxtx_annotations); |
| 657 | kmem_cache_free(rxrpc_call_jar, call); |
| 658 | } |
| 659 | |
| 660 | /* |
| 661 | * clean up a call |
| 662 | */ |
| 663 | void rxrpc_cleanup_call(struct rxrpc_call *call) |
| 664 | { |
| 665 | int i; |
| 666 | |
| 667 | _net("DESTROY CALL %d", call->debug_id); |
| 668 | |
| 669 | memset(&call->sock_node, 0xcd, sizeof(call->sock_node)); |
| 670 | |
| 671 | del_timer_sync(&call->timer); |
| 672 | |
| 673 | ASSERTCMP(call->state, ==, RXRPC_CALL_COMPLETE); |
| 674 | ASSERT(test_bit(RXRPC_CALL_RELEASED, &call->flags)); |
| 675 | |
| 676 | /* Clean up the Rx/Tx buffer */ |
| 677 | for (i = 0; i < RXRPC_RXTX_BUFF_SIZE; i++) |
| 678 | rxrpc_free_skb(call->rxtx_buffer[i], |
| 679 | (call->tx_phase ? rxrpc_skb_tx_cleaned : |
| 680 | rxrpc_skb_rx_cleaned)); |
| 681 | |
| 682 | rxrpc_free_skb(call->tx_pending, rxrpc_skb_tx_cleaned); |
| 683 | |
| 684 | call_rcu(&call->rcu, rxrpc_rcu_destroy_call); |
| 685 | } |
| 686 | |
| 687 | /* |
| 688 | * Make sure that all calls are gone from a network namespace. To reach this |
| 689 | * point, any open UDP sockets in that namespace must have been closed, so any |
| 690 | * outstanding calls cannot be doing I/O. |
| 691 | */ |
| 692 | void rxrpc_destroy_all_calls(struct rxrpc_net *rxnet) |
| 693 | { |
| 694 | struct rxrpc_call *call; |
| 695 | |
| 696 | _enter(""); |
| 697 | |
| 698 | if (!list_empty(&rxnet->calls)) { |
| 699 | write_lock(&rxnet->call_lock); |
| 700 | |
| 701 | while (!list_empty(&rxnet->calls)) { |
| 702 | call = list_entry(rxnet->calls.next, |
| 703 | struct rxrpc_call, link); |
| 704 | _debug("Zapping call %p", call); |
| 705 | |
| 706 | rxrpc_see_call(call); |
| 707 | list_del_init(&call->link); |
| 708 | |
| 709 | pr_err("Call %p still in use (%d,%s,%lx,%lx)!\n", |
| 710 | call, atomic_read(&call->usage), |
| 711 | rxrpc_call_states[call->state], |
| 712 | call->flags, call->events); |
| 713 | |
| 714 | write_unlock(&rxnet->call_lock); |
| 715 | cond_resched(); |
| 716 | write_lock(&rxnet->call_lock); |
| 717 | } |
| 718 | |
| 719 | write_unlock(&rxnet->call_lock); |
| 720 | } |
| 721 | } |