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