^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) // SPDX-License-Identifier: GPL-2.0-or-later
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2) /* incoming call handling
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) * Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) * Written by David Howells (dhowells@redhat.com)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) #include <linux/module.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) #include <linux/net.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) #include <linux/skbuff.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) #include <linux/errqueue.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) #include <linux/udp.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) #include <linux/in.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) #include <linux/in6.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) #include <linux/icmp.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) #include <linux/gfp.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19) #include <linux/circ_buf.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) #include <net/sock.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) #include <net/af_rxrpc.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) #include <net/ip.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) #include "ar-internal.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) static void rxrpc_dummy_notify(struct sock *sk, struct rxrpc_call *call,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) unsigned long user_call_ID)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) * Preallocate a single service call, connection and peer and, if possible,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) * give them a user ID and attach the user's side of the ID to them.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) static int rxrpc_service_prealloc_one(struct rxrpc_sock *rx,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35) struct rxrpc_backlog *b,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) rxrpc_notify_rx_t notify_rx,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) rxrpc_user_attach_call_t user_attach_call,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) unsigned long user_call_ID, gfp_t gfp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) unsigned int debug_id)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) const void *here = __builtin_return_address(0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) struct rxrpc_call *call, *xcall;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) struct rxrpc_net *rxnet = rxrpc_net(sock_net(&rx->sk));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) struct rb_node *parent, **pp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) int max, tmp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) unsigned int size = RXRPC_BACKLOG_MAX;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47) unsigned int head, tail, call_head, call_tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) max = rx->sk.sk_max_ack_backlog;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50) tmp = rx->sk.sk_ack_backlog;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) if (tmp >= max) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) _leave(" = -ENOBUFS [full %u]", max);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) return -ENOBUFS;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55) max -= tmp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) /* We don't need more conns and peers than we have calls, but on the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) * other hand, we shouldn't ever use more peers than conns or conns
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) * than calls.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) call_head = b->call_backlog_head;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) call_tail = READ_ONCE(b->call_backlog_tail);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63) tmp = CIRC_CNT(call_head, call_tail, size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) if (tmp >= max) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) _leave(" = -ENOBUFS [enough %u]", tmp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) return -ENOBUFS;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68) max = tmp + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) head = b->peer_backlog_head;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71) tail = READ_ONCE(b->peer_backlog_tail);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) if (CIRC_CNT(head, tail, size) < max) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) struct rxrpc_peer *peer = rxrpc_alloc_peer(rx->local, gfp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74) if (!peer)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) b->peer_backlog[head] = peer;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77) smp_store_release(&b->peer_backlog_head,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78) (head + 1) & (size - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81) head = b->conn_backlog_head;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82) tail = READ_ONCE(b->conn_backlog_tail);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) if (CIRC_CNT(head, tail, size) < max) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84) struct rxrpc_connection *conn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) conn = rxrpc_prealloc_service_connection(rxnet, gfp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) if (!conn)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) b->conn_backlog[head] = conn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) smp_store_release(&b->conn_backlog_head,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) (head + 1) & (size - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93) trace_rxrpc_conn(conn->debug_id, rxrpc_conn_new_service,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94) atomic_read(&conn->usage), here);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97) /* Now it gets complicated, because calls get registered with the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98) * socket here, with a user ID preassigned by the user.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) call = rxrpc_alloc_call(rx, gfp, debug_id);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) if (!call)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) call->flags |= (1 << RXRPC_CALL_IS_SERVICE);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104) call->state = RXRPC_CALL_SERVER_PREALLOC;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) trace_rxrpc_call(call->debug_id, rxrpc_call_new_service,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) atomic_read(&call->usage),
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) here, (const void *)user_call_ID);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) write_lock(&rx->call_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) /* Check the user ID isn't already in use */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113) pp = &rx->calls.rb_node;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) parent = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) while (*pp) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) parent = *pp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) xcall = rb_entry(parent, struct rxrpc_call, sock_node);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) if (user_call_ID < xcall->user_call_ID)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) pp = &(*pp)->rb_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) else if (user_call_ID > xcall->user_call_ID)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) pp = &(*pp)->rb_right;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) goto id_in_use;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) call->user_call_ID = user_call_ID;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) call->notify_rx = notify_rx;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) if (user_attach_call) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129) rxrpc_get_call(call, rxrpc_call_got_kernel);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) user_attach_call(call, user_call_ID);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) rxrpc_get_call(call, rxrpc_call_got_userid);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) rb_link_node(&call->sock_node, parent, pp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) rb_insert_color(&call->sock_node, &rx->calls);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136) set_bit(RXRPC_CALL_HAS_USERID, &call->flags);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) list_add(&call->sock_link, &rx->sock_calls);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) write_unlock(&rx->call_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) rxnet = call->rxnet;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) write_lock(&rxnet->call_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) list_add_tail(&call->link, &rxnet->calls);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) write_unlock(&rxnet->call_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) b->call_backlog[call_head] = call;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) smp_store_release(&b->call_backlog_head, (call_head + 1) & (size - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) _leave(" = 0 [%d -> %lx]", call->debug_id, user_call_ID);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) id_in_use:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) write_unlock(&rx->call_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) rxrpc_cleanup_call(call);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155) _leave(" = -EBADSLT");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) return -EBADSLT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) * Allocate the preallocation buffers for incoming service calls. These must
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) * be charged manually.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) int rxrpc_service_prealloc(struct rxrpc_sock *rx, gfp_t gfp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) struct rxrpc_backlog *b = rx->backlog;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167) if (!b) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) b = kzalloc(sizeof(struct rxrpc_backlog), gfp);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) if (!b)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) return -ENOMEM;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) rx->backlog = b;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) * Discard the preallocation on a service.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) void rxrpc_discard_prealloc(struct rxrpc_sock *rx)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) struct rxrpc_backlog *b = rx->backlog;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) struct rxrpc_net *rxnet = rxrpc_net(sock_net(&rx->sk));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) unsigned int size = RXRPC_BACKLOG_MAX, head, tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186) if (!b)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) return;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) rx->backlog = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) /* Make sure that there aren't any incoming calls in progress before we
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) * clear the preallocation buffers.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) spin_lock_bh(&rx->incoming_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) spin_unlock_bh(&rx->incoming_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) head = b->peer_backlog_head;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197) tail = b->peer_backlog_tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) while (CIRC_CNT(head, tail, size) > 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) struct rxrpc_peer *peer = b->peer_backlog[tail];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) rxrpc_put_local(peer->local);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) kfree(peer);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) tail = (tail + 1) & (size - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) head = b->conn_backlog_head;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206) tail = b->conn_backlog_tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) while (CIRC_CNT(head, tail, size) > 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) struct rxrpc_connection *conn = b->conn_backlog[tail];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) write_lock(&rxnet->conn_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) list_del(&conn->link);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) list_del(&conn->proc_link);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) write_unlock(&rxnet->conn_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) kfree(conn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) if (atomic_dec_and_test(&rxnet->nr_conns))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215) wake_up_var(&rxnet->nr_conns);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) tail = (tail + 1) & (size - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) head = b->call_backlog_head;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) tail = b->call_backlog_tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) while (CIRC_CNT(head, tail, size) > 0) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) struct rxrpc_call *call = b->call_backlog[tail];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) rcu_assign_pointer(call->socket, rx);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) if (rx->discard_new_call) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) _debug("discard %lx", call->user_call_ID);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226) rx->discard_new_call(call, call->user_call_ID);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) if (call->notify_rx)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) call->notify_rx = rxrpc_dummy_notify;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) rxrpc_put_call(call, rxrpc_call_put_kernel);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) rxrpc_call_completed(call);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) rxrpc_release_call(rx, call);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) rxrpc_put_call(call, rxrpc_call_put);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) tail = (tail + 1) & (size - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) kfree(b);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) * Ping the other end to fill our RTT cache and to retrieve the rwind
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) * and MTU parameters.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) static void rxrpc_send_ping(struct rxrpc_call *call, struct sk_buff *skb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247) ktime_t now = skb->tstamp;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) if (call->peer->rtt_count < 3 ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) ktime_before(ktime_add_ms(call->peer->rtt_last_req, 1000), now))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) rxrpc_propose_ACK(call, RXRPC_ACK_PING, sp->hdr.serial,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) true, true,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) rxrpc_propose_ack_ping_for_params);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) * Allocate a new incoming call from the prealloc pool, along with a connection
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) * and a peer as necessary.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) static struct rxrpc_call *rxrpc_alloc_incoming_call(struct rxrpc_sock *rx,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) struct rxrpc_local *local,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262) struct rxrpc_peer *peer,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263) struct rxrpc_connection *conn,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) const struct rxrpc_security *sec,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) struct key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) struct sk_buff *skb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268) struct rxrpc_backlog *b = rx->backlog;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) struct rxrpc_call *call;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) unsigned short call_head, conn_head, peer_head;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271) unsigned short call_tail, conn_tail, peer_tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) unsigned short call_count, conn_count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274) /* #calls >= #conns >= #peers must hold true. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) call_head = smp_load_acquire(&b->call_backlog_head);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) call_tail = b->call_backlog_tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) call_count = CIRC_CNT(call_head, call_tail, RXRPC_BACKLOG_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) conn_head = smp_load_acquire(&b->conn_backlog_head);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279) conn_tail = b->conn_backlog_tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280) conn_count = CIRC_CNT(conn_head, conn_tail, RXRPC_BACKLOG_MAX);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281) ASSERTCMP(conn_count, >=, call_count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282) peer_head = smp_load_acquire(&b->peer_backlog_head);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283) peer_tail = b->peer_backlog_tail;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284) ASSERTCMP(CIRC_CNT(peer_head, peer_tail, RXRPC_BACKLOG_MAX), >=,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285) conn_count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287) if (call_count == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290) if (!conn) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) if (peer && !rxrpc_get_peer_maybe(peer))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292) peer = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) if (!peer) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294) peer = b->peer_backlog[peer_tail];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295) if (rxrpc_extract_addr_from_skb(&peer->srx, skb) < 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296) return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) b->peer_backlog[peer_tail] = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298) smp_store_release(&b->peer_backlog_tail,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) (peer_tail + 1) &
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300) (RXRPC_BACKLOG_MAX - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) rxrpc_new_incoming_peer(rx, local, peer);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305) /* Now allocate and set up the connection */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306) conn = b->conn_backlog[conn_tail];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) b->conn_backlog[conn_tail] = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308) smp_store_release(&b->conn_backlog_tail,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309) (conn_tail + 1) & (RXRPC_BACKLOG_MAX - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310) conn->params.local = rxrpc_get_local(local);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) conn->params.peer = peer;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312) rxrpc_see_connection(conn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313) rxrpc_new_incoming_connection(rx, conn, sec, key, skb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) } else {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315) rxrpc_get_connection(conn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) /* And now we can allocate and set up a new call */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) call = b->call_backlog[call_tail];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320) b->call_backlog[call_tail] = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321) smp_store_release(&b->call_backlog_tail,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322) (call_tail + 1) & (RXRPC_BACKLOG_MAX - 1));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324) rxrpc_see_call(call);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325) call->conn = conn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326) call->security = conn->security;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) call->security_ix = conn->security_ix;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328) call->peer = rxrpc_get_peer(conn->params.peer);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329) call->cong_cwnd = call->peer->cong_cwnd;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) return call;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334) * Set up a new incoming call. Called in BH context with the RCU read lock
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) * held.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337) * If this is for a kernel service, when we allocate the call, it will have
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) * three refs on it: (1) the kernel service, (2) the user_call_ID tree, (3) the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339) * retainer ref obtained from the backlog buffer. Prealloc calls for userspace
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340) * services only have the ref from the backlog buffer. We want to pass this
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341) * ref to non-BH context to dispose of.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343) * If we want to report an error, we mark the skb with the packet type and
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344) * abort code and return NULL.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346) * The call is returned with the user access mutex held.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348) struct rxrpc_call *rxrpc_new_incoming_call(struct rxrpc_local *local,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349) struct rxrpc_sock *rx,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350) struct sk_buff *skb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352) struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) const struct rxrpc_security *sec = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) struct rxrpc_connection *conn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355) struct rxrpc_peer *peer = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356) struct rxrpc_call *call = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357) struct key *key = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) _enter("");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361) spin_lock(&rx->incoming_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362) if (rx->sk.sk_state == RXRPC_SERVER_LISTEN_DISABLED ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363) rx->sk.sk_state == RXRPC_CLOSE) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364) trace_rxrpc_abort(0, "CLS", sp->hdr.cid, sp->hdr.callNumber,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365) sp->hdr.seq, RX_INVALID_OPERATION, ESHUTDOWN);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366) skb->mark = RXRPC_SKB_MARK_REJECT_ABORT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367) skb->priority = RX_INVALID_OPERATION;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) goto no_call;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371) /* The peer, connection and call may all have sprung into existence due
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372) * to a duplicate packet being handled on another CPU in parallel, so
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373) * we have to recheck the routing. However, we're now holding
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) * rx->incoming_lock, so the values should remain stable.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) conn = rxrpc_find_connection_rcu(local, skb, &peer);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) if (!conn && !rxrpc_look_up_server_security(local, rx, &sec, &key, skb))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379) goto no_call;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381) call = rxrpc_alloc_incoming_call(rx, local, peer, conn, sec, key, skb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382) key_put(key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383) if (!call) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) skb->mark = RXRPC_SKB_MARK_REJECT_BUSY;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385) goto no_call;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388) trace_rxrpc_receive(call, rxrpc_receive_incoming,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) sp->hdr.serial, sp->hdr.seq);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391) /* Make the call live. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392) rxrpc_incoming_call(rx, call, skb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) conn = call->conn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395) if (rx->notify_new_call)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396) rx->notify_new_call(&rx->sk, call, call->user_call_ID);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398) spin_lock(&conn->state_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399) switch (conn->state) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400) case RXRPC_CONN_SERVICE_UNSECURED:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401) conn->state = RXRPC_CONN_SERVICE_CHALLENGING;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402) set_bit(RXRPC_CONN_EV_CHALLENGE, &call->conn->events);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) rxrpc_queue_conn(call->conn);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406) case RXRPC_CONN_SERVICE:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407) write_lock(&call->state_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408) if (call->state < RXRPC_CALL_COMPLETE)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409) call->state = RXRPC_CALL_SERVER_RECV_REQUEST;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410) write_unlock(&call->state_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413) case RXRPC_CONN_REMOTELY_ABORTED:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) rxrpc_set_call_completion(call, RXRPC_CALL_REMOTELY_ABORTED,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415) conn->abort_code, conn->error);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) case RXRPC_CONN_LOCALLY_ABORTED:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418) rxrpc_abort_call("CON", call, sp->hdr.seq,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419) conn->abort_code, conn->error);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420) break;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) spin_unlock(&conn->state_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425) spin_unlock(&rx->incoming_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427) rxrpc_send_ping(call, skb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 429) /* We have to discard the prealloc queue's ref here and rely on a
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 430) * combination of the RCU read lock and refs held either by the socket
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 431) * (recvmsg queue, to-be-accepted queue or user ID tree) or the kernel
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432) * service to prevent the call from being deallocated too early.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434) rxrpc_put_call(call, rxrpc_call_put);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436) _leave(" = %p{%d}", call, call->debug_id);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437) return call;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) no_call:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440) spin_unlock(&rx->incoming_lock);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441) _leave(" = NULL [%u]", skb->mark);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) return NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) * Charge up socket with preallocated calls, attaching user call IDs.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448) int rxrpc_user_charge_accept(struct rxrpc_sock *rx, unsigned long user_call_ID)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450) struct rxrpc_backlog *b = rx->backlog;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) if (rx->sk.sk_state == RXRPC_CLOSE)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) return -ESHUTDOWN;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455) return rxrpc_service_prealloc_one(rx, b, NULL, NULL, user_call_ID,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) GFP_KERNEL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457) atomic_inc_return(&rxrpc_debug_id));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461) * rxrpc_kernel_charge_accept - Charge up socket with preallocated calls
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462) * @sock: The socket on which to preallocate
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) * @notify_rx: Event notification function for the call
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464) * @user_attach_call: Func to attach call to user_call_ID
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465) * @user_call_ID: The tag to attach to the preallocated call
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) * @gfp: The allocation conditions.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) * @debug_id: The tracing debug ID.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) * Charge up the socket with preallocated calls, each with a user ID. A
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470) * function should be provided to effect the attachment from the user's side.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) * The user is given a ref to hold on the call.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) * Note that the call may be come connected before this function returns.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475) int rxrpc_kernel_charge_accept(struct socket *sock,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) rxrpc_notify_rx_t notify_rx,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477) rxrpc_user_attach_call_t user_attach_call,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478) unsigned long user_call_ID, gfp_t gfp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479) unsigned int debug_id)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481) struct rxrpc_sock *rx = rxrpc_sk(sock->sk);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482) struct rxrpc_backlog *b = rx->backlog;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484) if (sock->sk->sk_state == RXRPC_CLOSE)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485) return -ESHUTDOWN;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487) return rxrpc_service_prealloc_one(rx, b, notify_rx,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488) user_attach_call, user_call_ID,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489) gfp, debug_id);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491) EXPORT_SYMBOL(rxrpc_kernel_charge_accept);