Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/* Client connection-specific management code.
3 *
4 * Copyright (C) 2016 Red Hat, Inc. All Rights Reserved.
5 * Written by David Howells (dhowells@redhat.com)
6 *
7 * Client connections need to be cached for a little while after they've made a
8 * call so as to handle retransmitted DATA packets in case the server didn't
9 * receive the final ACK or terminating ABORT we sent it.
10 *
11 * Client connections can be in one of a number of cache states:
12 *
13 * (1) INACTIVE - The connection is not held in any list and may not have been
14 * exposed to the world. If it has been previously exposed, it was
15 * discarded from the idle list after expiring.
16 *
17 * (2) WAITING - The connection is waiting for the number of client conns to
18 * drop below the maximum capacity. Calls may be in progress upon it from
19 * when it was active and got culled.
20 *
21 * The connection is on the rxrpc_waiting_client_conns list which is kept
22 * in to-be-granted order. Culled conns with waiters go to the back of
23 * the queue just like new conns.
24 *
25 * (3) ACTIVE - The connection has at least one call in progress upon it, it
26 * may freely grant available channels to new calls and calls may be
27 * waiting on it for channels to become available.
28 *
29 * The connection is on the rxnet->active_client_conns list which is kept
30 * in activation order for culling purposes.
31 *
32 * rxrpc_nr_active_client_conns is held incremented also.
33 *
34 * (4) UPGRADE - As for ACTIVE, but only one call may be in progress and is
35 * being used to probe for service upgrade.
36 *
37 * (5) CULLED - The connection got summarily culled to try and free up
38 * capacity. Calls currently in progress on the connection are allowed to
39 * continue, but new calls will have to wait. There can be no waiters in
40 * this state - the conn would have to go to the WAITING state instead.
41 *
42 * (6) IDLE - The connection has no calls in progress upon it and must have
43 * been exposed to the world (ie. the EXPOSED flag must be set). When it
44 * expires, the EXPOSED flag is cleared and the connection transitions to
45 * the INACTIVE state.
46 *
47 * The connection is on the rxnet->idle_client_conns list which is kept in
48 * order of how soon they'll expire.
49 *
50 * There are flags of relevance to the cache:
51 *
52 * (1) EXPOSED - The connection ID got exposed to the world. If this flag is
53 * set, an extra ref is added to the connection preventing it from being
54 * reaped when it has no calls outstanding. This flag is cleared and the
55 * ref dropped when a conn is discarded from the idle list.
56 *
57 * This allows us to move terminal call state retransmission to the
58 * connection and to discard the call immediately we think it is done
59 * with. It also give us a chance to reuse the connection.
60 *
61 * (2) DONT_REUSE - The connection should be discarded as soon as possible and
62 * should not be reused. This is set when an exclusive connection is used
63 * or a call ID counter overflows.
64 *
65 * The caching state may only be changed if the cache lock is held.
66 *
67 * There are two idle client connection expiry durations. If the total number
68 * of connections is below the reap threshold, we use the normal duration; if
69 * it's above, we use the fast duration.
70 */
71
72#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
73
74#include <linux/slab.h>
75#include <linux/idr.h>
76#include <linux/timer.h>
77#include <linux/sched/signal.h>
78
79#include "ar-internal.h"
80
81__read_mostly unsigned int rxrpc_max_client_connections = 1000;
82__read_mostly unsigned int rxrpc_reap_client_connections = 900;
83__read_mostly unsigned long rxrpc_conn_idle_client_expiry = 2 * 60 * HZ;
84__read_mostly unsigned long rxrpc_conn_idle_client_fast_expiry = 2 * HZ;
85
86/*
87 * We use machine-unique IDs for our client connections.
88 */
89DEFINE_IDR(rxrpc_client_conn_ids);
90static DEFINE_SPINLOCK(rxrpc_conn_id_lock);
91
92static void rxrpc_cull_active_client_conns(struct rxrpc_net *);
93
94/*
95 * Get a connection ID and epoch for a client connection from the global pool.
96 * The connection struct pointer is then recorded in the idr radix tree. The
97 * epoch doesn't change until the client is rebooted (or, at least, unless the
98 * module is unloaded).
99 */
100static int rxrpc_get_client_connection_id(struct rxrpc_connection *conn,
101 gfp_t gfp)
102{
103 struct rxrpc_net *rxnet = conn->params.local->rxnet;
104 int id;
105
106 _enter("");
107
108 idr_preload(gfp);
109 spin_lock(&rxrpc_conn_id_lock);
110
111 id = idr_alloc_cyclic(&rxrpc_client_conn_ids, conn,
112 1, 0x40000000, GFP_NOWAIT);
113 if (id < 0)
114 goto error;
115
116 spin_unlock(&rxrpc_conn_id_lock);
117 idr_preload_end();
118
119 conn->proto.epoch = rxnet->epoch;
120 conn->proto.cid = id << RXRPC_CIDSHIFT;
121 set_bit(RXRPC_CONN_HAS_IDR, &conn->flags);
122 _leave(" [CID %x]", conn->proto.cid);
123 return 0;
124
125error:
126 spin_unlock(&rxrpc_conn_id_lock);
127 idr_preload_end();
128 _leave(" = %d", id);
129 return id;
130}
131
132/*
133 * Release a connection ID for a client connection from the global pool.
134 */
135static void rxrpc_put_client_connection_id(struct rxrpc_connection *conn)
136{
137 if (test_bit(RXRPC_CONN_HAS_IDR, &conn->flags)) {
138 spin_lock(&rxrpc_conn_id_lock);
139 idr_remove(&rxrpc_client_conn_ids,
140 conn->proto.cid >> RXRPC_CIDSHIFT);
141 spin_unlock(&rxrpc_conn_id_lock);
142 }
143}
144
145/*
146 * Destroy the client connection ID tree.
147 */
148void rxrpc_destroy_client_conn_ids(void)
149{
150 struct rxrpc_connection *conn;
151 int id;
152
153 if (!idr_is_empty(&rxrpc_client_conn_ids)) {
154 idr_for_each_entry(&rxrpc_client_conn_ids, conn, id) {
155 pr_err("AF_RXRPC: Leaked client conn %p {%d}\n",
156 conn, atomic_read(&conn->usage));
157 }
158 BUG();
159 }
160
161 idr_destroy(&rxrpc_client_conn_ids);
162}
163
164/*
165 * Allocate a client connection.
166 */
167static struct rxrpc_connection *
168rxrpc_alloc_client_connection(struct rxrpc_conn_parameters *cp, gfp_t gfp)
169{
170 struct rxrpc_connection *conn;
171 struct rxrpc_net *rxnet = cp->local->rxnet;
172 int ret;
173
174 _enter("");
175
176 conn = rxrpc_alloc_connection(gfp);
177 if (!conn) {
178 _leave(" = -ENOMEM");
179 return ERR_PTR(-ENOMEM);
180 }
181
182 atomic_set(&conn->usage, 1);
183 if (cp->exclusive)
184 __set_bit(RXRPC_CONN_DONT_REUSE, &conn->flags);
185 if (cp->upgrade)
186 __set_bit(RXRPC_CONN_PROBING_FOR_UPGRADE, &conn->flags);
187
188 conn->params = *cp;
189 conn->out_clientflag = RXRPC_CLIENT_INITIATED;
190 conn->state = RXRPC_CONN_CLIENT;
191 conn->service_id = cp->service_id;
192
193 ret = rxrpc_get_client_connection_id(conn, gfp);
194 if (ret < 0)
195 goto error_0;
196
197 ret = rxrpc_init_client_conn_security(conn);
198 if (ret < 0)
199 goto error_1;
200
201 ret = conn->security->prime_packet_security(conn);
202 if (ret < 0)
203 goto error_2;
204
205 atomic_inc(&rxnet->nr_conns);
206 write_lock(&rxnet->conn_lock);
207 list_add_tail(&conn->proc_link, &rxnet->conn_proc_list);
208 write_unlock(&rxnet->conn_lock);
209
210 /* We steal the caller's peer ref. */
211 cp->peer = NULL;
212 rxrpc_get_local(conn->params.local);
213 key_get(conn->params.key);
214
215 trace_rxrpc_conn(conn->debug_id, rxrpc_conn_new_client,
216 atomic_read(&conn->usage),
217 __builtin_return_address(0));
218 trace_rxrpc_client(conn, -1, rxrpc_client_alloc);
219 _leave(" = %p", conn);
220 return conn;
221
222error_2:
223 conn->security->clear(conn);
224error_1:
225 rxrpc_put_client_connection_id(conn);
226error_0:
227 kfree(conn);
228 _leave(" = %d", ret);
229 return ERR_PTR(ret);
230}
231
232/*
233 * Determine if a connection may be reused.
234 */
235static bool rxrpc_may_reuse_conn(struct rxrpc_connection *conn)
236{
237 struct rxrpc_net *rxnet = conn->params.local->rxnet;
238 int id_cursor, id, distance, limit;
239
240 if (test_bit(RXRPC_CONN_DONT_REUSE, &conn->flags))
241 goto dont_reuse;
242
243 if (conn->proto.epoch != rxnet->epoch)
244 goto mark_dont_reuse;
245
246 /* The IDR tree gets very expensive on memory if the connection IDs are
247 * widely scattered throughout the number space, so we shall want to
248 * kill off connections that, say, have an ID more than about four
249 * times the maximum number of client conns away from the current
250 * allocation point to try and keep the IDs concentrated.
251 */
252 id_cursor = idr_get_cursor(&rxrpc_client_conn_ids);
253 id = conn->proto.cid >> RXRPC_CIDSHIFT;
254 distance = id - id_cursor;
255 if (distance < 0)
256 distance = -distance;
257 limit = max(rxrpc_max_client_connections * 4, 1024U);
258 if (distance > limit)
259 goto mark_dont_reuse;
260
261 return true;
262
263mark_dont_reuse:
264 set_bit(RXRPC_CONN_DONT_REUSE, &conn->flags);
265dont_reuse:
266 return false;
267}
268
269/*
270 * Create or find a client connection to use for a call.
271 *
272 * If we return with a connection, the call will be on its waiting list. It's
273 * left to the caller to assign a channel and wake up the call.
274 */
275static int rxrpc_get_client_conn(struct rxrpc_sock *rx,
276 struct rxrpc_call *call,
277 struct rxrpc_conn_parameters *cp,
278 struct sockaddr_rxrpc *srx,
279 gfp_t gfp)
280{
281 struct rxrpc_connection *conn, *candidate = NULL;
282 struct rxrpc_local *local = cp->local;
283 struct rb_node *p, **pp, *parent;
284 long diff;
285 int ret = -ENOMEM;
286
287 _enter("{%d,%lx},", call->debug_id, call->user_call_ID);
288
289 cp->peer = rxrpc_lookup_peer(rx, cp->local, srx, gfp);
290 if (!cp->peer)
291 goto error;
292
293 call->cong_cwnd = cp->peer->cong_cwnd;
294 if (call->cong_cwnd >= call->cong_ssthresh)
295 call->cong_mode = RXRPC_CALL_CONGEST_AVOIDANCE;
296 else
297 call->cong_mode = RXRPC_CALL_SLOW_START;
298
299 /* If the connection is not meant to be exclusive, search the available
300 * connections to see if the connection we want to use already exists.
301 */
302 if (!cp->exclusive) {
303 _debug("search 1");
304 spin_lock(&local->client_conns_lock);
305 p = local->client_conns.rb_node;
306 while (p) {
307 conn = rb_entry(p, struct rxrpc_connection, client_node);
308
309#define cmp(X) ((long)conn->params.X - (long)cp->X)
310 diff = (cmp(peer) ?:
311 cmp(key) ?:
312 cmp(security_level) ?:
313 cmp(upgrade));
314#undef cmp
315 if (diff < 0) {
316 p = p->rb_left;
317 } else if (diff > 0) {
318 p = p->rb_right;
319 } else {
320 if (rxrpc_may_reuse_conn(conn) &&
321 rxrpc_get_connection_maybe(conn))
322 goto found_extant_conn;
323 /* The connection needs replacing. It's better
324 * to effect that when we have something to
325 * replace it with so that we don't have to
326 * rebalance the tree twice.
327 */
328 break;
329 }
330 }
331 spin_unlock(&local->client_conns_lock);
332 }
333
334 /* There wasn't a connection yet or we need an exclusive connection.
335 * We need to create a candidate and then potentially redo the search
336 * in case we're racing with another thread also trying to connect on a
337 * shareable connection.
338 */
339 _debug("new conn");
340 candidate = rxrpc_alloc_client_connection(cp, gfp);
341 if (IS_ERR(candidate)) {
342 ret = PTR_ERR(candidate);
343 goto error_peer;
344 }
345
346 /* Add the call to the new connection's waiting list in case we're
347 * going to have to wait for the connection to come live. It's our
348 * connection, so we want first dibs on the channel slots. We would
349 * normally have to take channel_lock but we do this before anyone else
350 * can see the connection.
351 */
352 list_add(&call->chan_wait_link, &candidate->waiting_calls);
353
354 if (cp->exclusive) {
355 call->conn = candidate;
356 call->security = candidate->security;
357 call->security_ix = candidate->security_ix;
358 call->service_id = candidate->service_id;
359 _leave(" = 0 [exclusive %d]", candidate->debug_id);
360 return 0;
361 }
362
363 /* Publish the new connection for userspace to find. We need to redo
364 * the search before doing this lest we race with someone else adding a
365 * conflicting instance.
366 */
367 _debug("search 2");
368 spin_lock(&local->client_conns_lock);
369
370 pp = &local->client_conns.rb_node;
371 parent = NULL;
372 while (*pp) {
373 parent = *pp;
374 conn = rb_entry(parent, struct rxrpc_connection, client_node);
375
376#define cmp(X) ((long)conn->params.X - (long)candidate->params.X)
377 diff = (cmp(peer) ?:
378 cmp(key) ?:
379 cmp(security_level) ?:
380 cmp(upgrade));
381#undef cmp
382 if (diff < 0) {
383 pp = &(*pp)->rb_left;
384 } else if (diff > 0) {
385 pp = &(*pp)->rb_right;
386 } else {
387 if (rxrpc_may_reuse_conn(conn) &&
388 rxrpc_get_connection_maybe(conn))
389 goto found_extant_conn;
390 /* The old connection is from an outdated epoch. */
391 _debug("replace conn");
392 clear_bit(RXRPC_CONN_IN_CLIENT_CONNS, &conn->flags);
393 rb_replace_node(&conn->client_node,
394 &candidate->client_node,
395 &local->client_conns);
396 trace_rxrpc_client(conn, -1, rxrpc_client_replace);
397 goto candidate_published;
398 }
399 }
400
401 _debug("new conn");
402 rb_link_node(&candidate->client_node, parent, pp);
403 rb_insert_color(&candidate->client_node, &local->client_conns);
404
405candidate_published:
406 set_bit(RXRPC_CONN_IN_CLIENT_CONNS, &candidate->flags);
407 call->conn = candidate;
408 call->security = candidate->security;
409 call->security_ix = candidate->security_ix;
410 call->service_id = candidate->service_id;
411 spin_unlock(&local->client_conns_lock);
412 _leave(" = 0 [new %d]", candidate->debug_id);
413 return 0;
414
415 /* We come here if we found a suitable connection already in existence.
416 * Discard any candidate we may have allocated, and try to get a
417 * channel on this one.
418 */
419found_extant_conn:
420 _debug("found conn");
421 spin_unlock(&local->client_conns_lock);
422
423 if (candidate) {
424 trace_rxrpc_client(candidate, -1, rxrpc_client_duplicate);
425 rxrpc_put_connection(candidate);
426 candidate = NULL;
427 }
428
429 spin_lock(&conn->channel_lock);
430 call->conn = conn;
431 call->security = conn->security;
432 call->security_ix = conn->security_ix;
433 call->service_id = conn->service_id;
434 list_add_tail(&call->chan_wait_link, &conn->waiting_calls);
435 spin_unlock(&conn->channel_lock);
436 _leave(" = 0 [extant %d]", conn->debug_id);
437 return 0;
438
439error_peer:
440 rxrpc_put_peer(cp->peer);
441 cp->peer = NULL;
442error:
443 _leave(" = %d", ret);
444 return ret;
445}
446
447/*
448 * Activate a connection.
449 */
450static void rxrpc_activate_conn(struct rxrpc_net *rxnet,
451 struct rxrpc_connection *conn)
452{
453 if (test_bit(RXRPC_CONN_PROBING_FOR_UPGRADE, &conn->flags)) {
454 trace_rxrpc_client(conn, -1, rxrpc_client_to_upgrade);
455 conn->cache_state = RXRPC_CONN_CLIENT_UPGRADE;
456 } else {
457 trace_rxrpc_client(conn, -1, rxrpc_client_to_active);
458 conn->cache_state = RXRPC_CONN_CLIENT_ACTIVE;
459 }
460 rxnet->nr_active_client_conns++;
461 list_move_tail(&conn->cache_link, &rxnet->active_client_conns);
462}
463
464/*
465 * Attempt to animate a connection for a new call.
466 *
467 * If it's not exclusive, the connection is in the endpoint tree, and we're in
468 * the conn's list of those waiting to grab a channel. There is, however, a
469 * limit on the number of live connections allowed at any one time, so we may
470 * have to wait for capacity to become available.
471 *
472 * Note that a connection on the waiting queue might *also* have active
473 * channels if it has been culled to make space and then re-requested by a new
474 * call.
475 */
476static void rxrpc_animate_client_conn(struct rxrpc_net *rxnet,
477 struct rxrpc_connection *conn)
478{
479 unsigned int nr_conns;
480
481 _enter("%d,%d", conn->debug_id, conn->cache_state);
482
483 if (conn->cache_state == RXRPC_CONN_CLIENT_ACTIVE ||
484 conn->cache_state == RXRPC_CONN_CLIENT_UPGRADE)
485 goto out;
486
487 spin_lock(&rxnet->client_conn_cache_lock);
488
489 nr_conns = rxnet->nr_client_conns;
490 if (!test_and_set_bit(RXRPC_CONN_COUNTED, &conn->flags)) {
491 trace_rxrpc_client(conn, -1, rxrpc_client_count);
492 rxnet->nr_client_conns = nr_conns + 1;
493 }
494
495 switch (conn->cache_state) {
496 case RXRPC_CONN_CLIENT_ACTIVE:
497 case RXRPC_CONN_CLIENT_UPGRADE:
498 case RXRPC_CONN_CLIENT_WAITING:
499 break;
500
501 case RXRPC_CONN_CLIENT_INACTIVE:
502 case RXRPC_CONN_CLIENT_CULLED:
503 case RXRPC_CONN_CLIENT_IDLE:
504 if (nr_conns >= rxrpc_max_client_connections)
505 goto wait_for_capacity;
506 goto activate_conn;
507
508 default:
509 BUG();
510 }
511
512out_unlock:
513 spin_unlock(&rxnet->client_conn_cache_lock);
514out:
515 _leave(" [%d]", conn->cache_state);
516 return;
517
518activate_conn:
519 _debug("activate");
520 rxrpc_activate_conn(rxnet, conn);
521 goto out_unlock;
522
523wait_for_capacity:
524 _debug("wait");
525 trace_rxrpc_client(conn, -1, rxrpc_client_to_waiting);
526 conn->cache_state = RXRPC_CONN_CLIENT_WAITING;
527 list_move_tail(&conn->cache_link, &rxnet->waiting_client_conns);
528 goto out_unlock;
529}
530
531/*
532 * Deactivate a channel.
533 */
534static void rxrpc_deactivate_one_channel(struct rxrpc_connection *conn,
535 unsigned int channel)
536{
537 struct rxrpc_channel *chan = &conn->channels[channel];
538
539 rcu_assign_pointer(chan->call, NULL);
540 conn->active_chans &= ~(1 << channel);
541}
542
543/*
544 * Assign a channel to the call at the front of the queue and wake the call up.
545 * We don't increment the callNumber counter until this number has been exposed
546 * to the world.
547 */
548static void rxrpc_activate_one_channel(struct rxrpc_connection *conn,
549 unsigned int channel)
550{
551 struct rxrpc_channel *chan = &conn->channels[channel];
552 struct rxrpc_call *call = list_entry(conn->waiting_calls.next,
553 struct rxrpc_call, chan_wait_link);
554 u32 call_id = chan->call_counter + 1;
555
556 trace_rxrpc_client(conn, channel, rxrpc_client_chan_activate);
557
558 /* Cancel the final ACK on the previous call if it hasn't been sent yet
559 * as the DATA packet will implicitly ACK it.
560 */
561 clear_bit(RXRPC_CONN_FINAL_ACK_0 + channel, &conn->flags);
562
563 write_lock_bh(&call->state_lock);
564 call->state = RXRPC_CALL_CLIENT_SEND_REQUEST;
565 write_unlock_bh(&call->state_lock);
566
567 rxrpc_see_call(call);
568 list_del_init(&call->chan_wait_link);
569 conn->active_chans |= 1 << channel;
570 call->peer = rxrpc_get_peer(conn->params.peer);
571 call->cid = conn->proto.cid | channel;
572 call->call_id = call_id;
573
574 trace_rxrpc_connect_call(call);
575 _net("CONNECT call %08x:%08x as call %d on conn %d",
576 call->cid, call->call_id, call->debug_id, conn->debug_id);
577
578 /* Paired with the read barrier in rxrpc_wait_for_channel(). This
579 * orders cid and epoch in the connection wrt to call_id without the
580 * need to take the channel_lock.
581 *
582 * We provisionally assign a callNumber at this point, but we don't
583 * confirm it until the call is about to be exposed.
584 *
585 * TODO: Pair with a barrier in the data_ready handler when that looks
586 * at the call ID through a connection channel.
587 */
588 smp_wmb();
589 chan->call_id = call_id;
590 chan->call_debug_id = call->debug_id;
591 rcu_assign_pointer(chan->call, call);
592 wake_up(&call->waitq);
593}
594
595/*
596 * Assign channels and callNumbers to waiting calls with channel_lock
597 * held by caller.
598 */
599static void rxrpc_activate_channels_locked(struct rxrpc_connection *conn)
600{
601 u8 avail, mask;
602
603 switch (conn->cache_state) {
604 case RXRPC_CONN_CLIENT_ACTIVE:
605 mask = RXRPC_ACTIVE_CHANS_MASK;
606 break;
607 case RXRPC_CONN_CLIENT_UPGRADE:
608 mask = 0x01;
609 break;
610 default:
611 return;
612 }
613
614 while (!list_empty(&conn->waiting_calls) &&
615 (avail = ~conn->active_chans,
616 avail &= mask,
617 avail != 0))
618 rxrpc_activate_one_channel(conn, __ffs(avail));
619}
620
621/*
622 * Assign channels and callNumbers to waiting calls.
623 */
624static void rxrpc_activate_channels(struct rxrpc_connection *conn)
625{
626 _enter("%d", conn->debug_id);
627
628 trace_rxrpc_client(conn, -1, rxrpc_client_activate_chans);
629
630 if (conn->active_chans == RXRPC_ACTIVE_CHANS_MASK)
631 return;
632
633 spin_lock(&conn->channel_lock);
634 rxrpc_activate_channels_locked(conn);
635 spin_unlock(&conn->channel_lock);
636 _leave("");
637}
638
639/*
640 * Wait for a callNumber and a channel to be granted to a call.
641 */
642static int rxrpc_wait_for_channel(struct rxrpc_call *call, gfp_t gfp)
643{
644 int ret = 0;
645
646 _enter("%d", call->debug_id);
647
648 if (!call->call_id) {
649 DECLARE_WAITQUEUE(myself, current);
650
651 if (!gfpflags_allow_blocking(gfp)) {
652 ret = -EAGAIN;
653 goto out;
654 }
655
656 add_wait_queue_exclusive(&call->waitq, &myself);
657 for (;;) {
658 if (test_bit(RXRPC_CALL_IS_INTR, &call->flags))
659 set_current_state(TASK_INTERRUPTIBLE);
660 else
661 set_current_state(TASK_UNINTERRUPTIBLE);
662 if (call->call_id)
663 break;
664 if (test_bit(RXRPC_CALL_IS_INTR, &call->flags) &&
665 signal_pending(current)) {
666 ret = -ERESTARTSYS;
667 break;
668 }
669 schedule();
670 }
671 remove_wait_queue(&call->waitq, &myself);
672 __set_current_state(TASK_RUNNING);
673 }
674
675 /* Paired with the write barrier in rxrpc_activate_one_channel(). */
676 smp_rmb();
677
678out:
679 _leave(" = %d", ret);
680 return ret;
681}
682
683/*
684 * find a connection for a call
685 * - called in process context with IRQs enabled
686 */
687int rxrpc_connect_call(struct rxrpc_sock *rx,
688 struct rxrpc_call *call,
689 struct rxrpc_conn_parameters *cp,
690 struct sockaddr_rxrpc *srx,
691 gfp_t gfp)
692{
693 struct rxrpc_net *rxnet = cp->local->rxnet;
694 int ret;
695
696 _enter("{%d,%lx},", call->debug_id, call->user_call_ID);
697
698 rxrpc_discard_expired_client_conns(&rxnet->client_conn_reaper);
699 rxrpc_cull_active_client_conns(rxnet);
700
701 ret = rxrpc_get_client_conn(rx, call, cp, srx, gfp);
702 if (ret < 0)
703 goto out;
704
705 rxrpc_animate_client_conn(rxnet, call->conn);
706 rxrpc_activate_channels(call->conn);
707
708 ret = rxrpc_wait_for_channel(call, gfp);
709 if (ret < 0) {
710 trace_rxrpc_client(call->conn, ret, rxrpc_client_chan_wait_failed);
711 rxrpc_disconnect_client_call(call);
712 goto out;
713 }
714
715 spin_lock_bh(&call->conn->params.peer->lock);
716 hlist_add_head_rcu(&call->error_link,
717 &call->conn->params.peer->error_targets);
718 spin_unlock_bh(&call->conn->params.peer->lock);
719
720out:
721 _leave(" = %d", ret);
722 return ret;
723}
724
725/*
726 * Note that a connection is about to be exposed to the world. Once it is
727 * exposed, we maintain an extra ref on it that stops it from being summarily
728 * discarded before it's (a) had a chance to deal with retransmission and (b)
729 * had a chance at re-use (the per-connection security negotiation is
730 * expensive).
731 */
732static void rxrpc_expose_client_conn(struct rxrpc_connection *conn,
733 unsigned int channel)
734{
735 if (!test_and_set_bit(RXRPC_CONN_EXPOSED, &conn->flags)) {
736 trace_rxrpc_client(conn, channel, rxrpc_client_exposed);
737 rxrpc_get_connection(conn);
738 }
739}
740
741/*
742 * Note that a call, and thus a connection, is about to be exposed to the
743 * world.
744 */
745void rxrpc_expose_client_call(struct rxrpc_call *call)
746{
747 unsigned int channel = call->cid & RXRPC_CHANNELMASK;
748 struct rxrpc_connection *conn = call->conn;
749 struct rxrpc_channel *chan = &conn->channels[channel];
750
751 if (!test_and_set_bit(RXRPC_CALL_EXPOSED, &call->flags)) {
752 /* Mark the call ID as being used. If the callNumber counter
753 * exceeds ~2 billion, we kill the connection after its
754 * outstanding calls have finished so that the counter doesn't
755 * wrap.
756 */
757 chan->call_counter++;
758 if (chan->call_counter >= INT_MAX)
759 set_bit(RXRPC_CONN_DONT_REUSE, &conn->flags);
760 rxrpc_expose_client_conn(conn, channel);
761 }
762}
763
764/*
765 * Set the reap timer.
766 */
767static void rxrpc_set_client_reap_timer(struct rxrpc_net *rxnet)
768{
769 unsigned long now = jiffies;
770 unsigned long reap_at = now + rxrpc_conn_idle_client_expiry;
771
772 if (rxnet->live)
773 timer_reduce(&rxnet->client_conn_reap_timer, reap_at);
774}
775
776/*
777 * Disconnect a client call.
778 */
779void rxrpc_disconnect_client_call(struct rxrpc_call *call)
780{
781 struct rxrpc_connection *conn = call->conn;
782 struct rxrpc_channel *chan = NULL;
783 struct rxrpc_net *rxnet = conn->params.local->rxnet;
784 unsigned int channel = -1;
785 u32 cid;
786
787 spin_lock(&conn->channel_lock);
788
789 cid = call->cid;
790 if (cid) {
791 channel = cid & RXRPC_CHANNELMASK;
792 chan = &conn->channels[channel];
793 }
794 trace_rxrpc_client(conn, channel, rxrpc_client_chan_disconnect);
795 call->conn = NULL;
796
797 /* Calls that have never actually been assigned a channel can simply be
798 * discarded. If the conn didn't get used either, it will follow
799 * immediately unless someone else grabs it in the meantime.
800 */
801 if (!list_empty(&call->chan_wait_link)) {
802 _debug("call is waiting");
803 ASSERTCMP(call->call_id, ==, 0);
804 ASSERT(!test_bit(RXRPC_CALL_EXPOSED, &call->flags));
805 list_del_init(&call->chan_wait_link);
806
807 trace_rxrpc_client(conn, channel, rxrpc_client_chan_unstarted);
808
809 /* We must deactivate or idle the connection if it's now
810 * waiting for nothing.
811 */
812 spin_lock(&rxnet->client_conn_cache_lock);
813 if (conn->cache_state == RXRPC_CONN_CLIENT_WAITING &&
814 list_empty(&conn->waiting_calls) &&
815 !conn->active_chans)
816 goto idle_connection;
817 goto out;
818 }
819
820 if (rcu_access_pointer(chan->call) != call) {
821 spin_unlock(&conn->channel_lock);
822 BUG();
823 }
824
825 /* If a client call was exposed to the world, we save the result for
826 * retransmission.
827 *
828 * We use a barrier here so that the call number and abort code can be
829 * read without needing to take a lock.
830 *
831 * TODO: Make the incoming packet handler check this and handle
832 * terminal retransmission without requiring access to the call.
833 */
834 if (test_bit(RXRPC_CALL_EXPOSED, &call->flags)) {
835 _debug("exposed %u,%u", call->call_id, call->abort_code);
836 __rxrpc_disconnect_call(conn, call);
837 }
838
839 /* See if we can pass the channel directly to another call. */
840 if (conn->cache_state == RXRPC_CONN_CLIENT_ACTIVE &&
841 !list_empty(&conn->waiting_calls)) {
842 trace_rxrpc_client(conn, channel, rxrpc_client_chan_pass);
843 rxrpc_activate_one_channel(conn, channel);
844 goto out_2;
845 }
846
847 /* Schedule the final ACK to be transmitted in a short while so that it
848 * can be skipped if we find a follow-on call. The first DATA packet
849 * of the follow on call will implicitly ACK this call.
850 */
851 if (call->completion == RXRPC_CALL_SUCCEEDED &&
852 test_bit(RXRPC_CALL_EXPOSED, &call->flags)) {
853 unsigned long final_ack_at = jiffies + 2;
854
855 WRITE_ONCE(chan->final_ack_at, final_ack_at);
856 smp_wmb(); /* vs rxrpc_process_delayed_final_acks() */
857 set_bit(RXRPC_CONN_FINAL_ACK_0 + channel, &conn->flags);
858 rxrpc_reduce_conn_timer(conn, final_ack_at);
859 }
860
861 /* Things are more complex and we need the cache lock. We might be
862 * able to simply idle the conn or it might now be lurking on the wait
863 * list. It might even get moved back to the active list whilst we're
864 * waiting for the lock.
865 */
866 spin_lock(&rxnet->client_conn_cache_lock);
867
868 switch (conn->cache_state) {
869 case RXRPC_CONN_CLIENT_UPGRADE:
870 /* Deal with termination of a service upgrade probe. */
871 if (test_bit(RXRPC_CONN_EXPOSED, &conn->flags)) {
872 clear_bit(RXRPC_CONN_PROBING_FOR_UPGRADE, &conn->flags);
873 trace_rxrpc_client(conn, channel, rxrpc_client_to_active);
874 conn->cache_state = RXRPC_CONN_CLIENT_ACTIVE;
875 rxrpc_activate_channels_locked(conn);
876 }
877 /* fall through */
878 case RXRPC_CONN_CLIENT_ACTIVE:
879 if (list_empty(&conn->waiting_calls)) {
880 rxrpc_deactivate_one_channel(conn, channel);
881 if (!conn->active_chans) {
882 rxnet->nr_active_client_conns--;
883 goto idle_connection;
884 }
885 goto out;
886 }
887
888 trace_rxrpc_client(conn, channel, rxrpc_client_chan_pass);
889 rxrpc_activate_one_channel(conn, channel);
890 goto out;
891
892 case RXRPC_CONN_CLIENT_CULLED:
893 rxrpc_deactivate_one_channel(conn, channel);
894 ASSERT(list_empty(&conn->waiting_calls));
895 if (!conn->active_chans)
896 goto idle_connection;
897 goto out;
898
899 case RXRPC_CONN_CLIENT_WAITING:
900 rxrpc_deactivate_one_channel(conn, channel);
901 goto out;
902
903 default:
904 BUG();
905 }
906
907out:
908 spin_unlock(&rxnet->client_conn_cache_lock);
909out_2:
910 spin_unlock(&conn->channel_lock);
911 rxrpc_put_connection(conn);
912 _leave("");
913 return;
914
915idle_connection:
916 /* As no channels remain active, the connection gets deactivated
917 * immediately or moved to the idle list for a short while.
918 */
919 if (test_bit(RXRPC_CONN_EXPOSED, &conn->flags)) {
920 trace_rxrpc_client(conn, channel, rxrpc_client_to_idle);
921 conn->idle_timestamp = jiffies;
922 conn->cache_state = RXRPC_CONN_CLIENT_IDLE;
923 list_move_tail(&conn->cache_link, &rxnet->idle_client_conns);
924 if (rxnet->idle_client_conns.next == &conn->cache_link &&
925 !rxnet->kill_all_client_conns)
926 rxrpc_set_client_reap_timer(rxnet);
927 } else {
928 trace_rxrpc_client(conn, channel, rxrpc_client_to_inactive);
929 conn->cache_state = RXRPC_CONN_CLIENT_INACTIVE;
930 list_del_init(&conn->cache_link);
931 }
932 goto out;
933}
934
935/*
936 * Clean up a dead client connection.
937 */
938static struct rxrpc_connection *
939rxrpc_put_one_client_conn(struct rxrpc_connection *conn)
940{
941 struct rxrpc_connection *next = NULL;
942 struct rxrpc_local *local = conn->params.local;
943 struct rxrpc_net *rxnet = local->rxnet;
944 unsigned int nr_conns;
945
946 trace_rxrpc_client(conn, -1, rxrpc_client_cleanup);
947
948 if (test_bit(RXRPC_CONN_IN_CLIENT_CONNS, &conn->flags)) {
949 spin_lock(&local->client_conns_lock);
950 if (test_and_clear_bit(RXRPC_CONN_IN_CLIENT_CONNS,
951 &conn->flags))
952 rb_erase(&conn->client_node, &local->client_conns);
953 spin_unlock(&local->client_conns_lock);
954 }
955
956 rxrpc_put_client_connection_id(conn);
957
958 ASSERTCMP(conn->cache_state, ==, RXRPC_CONN_CLIENT_INACTIVE);
959
960 if (test_bit(RXRPC_CONN_COUNTED, &conn->flags)) {
961 trace_rxrpc_client(conn, -1, rxrpc_client_uncount);
962 spin_lock(&rxnet->client_conn_cache_lock);
963 nr_conns = --rxnet->nr_client_conns;
964
965 if (nr_conns < rxrpc_max_client_connections &&
966 !list_empty(&rxnet->waiting_client_conns)) {
967 next = list_entry(rxnet->waiting_client_conns.next,
968 struct rxrpc_connection, cache_link);
969 rxrpc_get_connection(next);
970 rxrpc_activate_conn(rxnet, next);
971 }
972
973 spin_unlock(&rxnet->client_conn_cache_lock);
974 }
975
976 rxrpc_kill_connection(conn);
977 if (next)
978 rxrpc_activate_channels(next);
979
980 /* We need to get rid of the temporary ref we took upon next, but we
981 * can't call rxrpc_put_connection() recursively.
982 */
983 return next;
984}
985
986/*
987 * Clean up a dead client connections.
988 */
989void rxrpc_put_client_conn(struct rxrpc_connection *conn)
990{
991 const void *here = __builtin_return_address(0);
992 unsigned int debug_id = conn->debug_id;
993 int n;
994
995 do {
996 n = atomic_dec_return(&conn->usage);
997 trace_rxrpc_conn(debug_id, rxrpc_conn_put_client, n, here);
998 if (n > 0)
999 return;
1000 ASSERTCMP(n, >=, 0);
1001
1002 conn = rxrpc_put_one_client_conn(conn);
1003 } while (conn);
1004}
1005
1006/*
1007 * Kill the longest-active client connections to make room for new ones.
1008 */
1009static void rxrpc_cull_active_client_conns(struct rxrpc_net *rxnet)
1010{
1011 struct rxrpc_connection *conn;
1012 unsigned int nr_conns = rxnet->nr_client_conns;
1013 unsigned int nr_active, limit;
1014
1015 _enter("");
1016
1017 ASSERTCMP(nr_conns, >=, 0);
1018 if (nr_conns < rxrpc_max_client_connections) {
1019 _leave(" [ok]");
1020 return;
1021 }
1022 limit = rxrpc_reap_client_connections;
1023
1024 spin_lock(&rxnet->client_conn_cache_lock);
1025 nr_active = rxnet->nr_active_client_conns;
1026
1027 while (nr_active > limit) {
1028 ASSERT(!list_empty(&rxnet->active_client_conns));
1029 conn = list_entry(rxnet->active_client_conns.next,
1030 struct rxrpc_connection, cache_link);
1031 ASSERTIFCMP(conn->cache_state != RXRPC_CONN_CLIENT_ACTIVE,
1032 conn->cache_state, ==, RXRPC_CONN_CLIENT_UPGRADE);
1033
1034 if (list_empty(&conn->waiting_calls)) {
1035 trace_rxrpc_client(conn, -1, rxrpc_client_to_culled);
1036 conn->cache_state = RXRPC_CONN_CLIENT_CULLED;
1037 list_del_init(&conn->cache_link);
1038 } else {
1039 trace_rxrpc_client(conn, -1, rxrpc_client_to_waiting);
1040 conn->cache_state = RXRPC_CONN_CLIENT_WAITING;
1041 list_move_tail(&conn->cache_link,
1042 &rxnet->waiting_client_conns);
1043 }
1044
1045 nr_active--;
1046 }
1047
1048 rxnet->nr_active_client_conns = nr_active;
1049 spin_unlock(&rxnet->client_conn_cache_lock);
1050 ASSERTCMP(nr_active, >=, 0);
1051 _leave(" [culled]");
1052}
1053
1054/*
1055 * Discard expired client connections from the idle list. Each conn in the
1056 * idle list has been exposed and holds an extra ref because of that.
1057 *
1058 * This may be called from conn setup or from a work item so cannot be
1059 * considered non-reentrant.
1060 */
1061void rxrpc_discard_expired_client_conns(struct work_struct *work)
1062{
1063 struct rxrpc_connection *conn;
1064 struct rxrpc_net *rxnet =
1065 container_of(work, struct rxrpc_net, client_conn_reaper);
1066 unsigned long expiry, conn_expires_at, now;
1067 unsigned int nr_conns;
1068
1069 _enter("");
1070
1071 if (list_empty(&rxnet->idle_client_conns)) {
1072 _leave(" [empty]");
1073 return;
1074 }
1075
1076 /* Don't double up on the discarding */
1077 if (!spin_trylock(&rxnet->client_conn_discard_lock)) {
1078 _leave(" [already]");
1079 return;
1080 }
1081
1082 /* We keep an estimate of what the number of conns ought to be after
1083 * we've discarded some so that we don't overdo the discarding.
1084 */
1085 nr_conns = rxnet->nr_client_conns;
1086
1087next:
1088 spin_lock(&rxnet->client_conn_cache_lock);
1089
1090 if (list_empty(&rxnet->idle_client_conns))
1091 goto out;
1092
1093 conn = list_entry(rxnet->idle_client_conns.next,
1094 struct rxrpc_connection, cache_link);
1095 ASSERT(test_bit(RXRPC_CONN_EXPOSED, &conn->flags));
1096
1097 if (!rxnet->kill_all_client_conns) {
1098 /* If the number of connections is over the reap limit, we
1099 * expedite discard by reducing the expiry timeout. We must,
1100 * however, have at least a short grace period to be able to do
1101 * final-ACK or ABORT retransmission.
1102 */
1103 expiry = rxrpc_conn_idle_client_expiry;
1104 if (nr_conns > rxrpc_reap_client_connections)
1105 expiry = rxrpc_conn_idle_client_fast_expiry;
1106 if (conn->params.local->service_closed)
1107 expiry = rxrpc_closed_conn_expiry * HZ;
1108
1109 conn_expires_at = conn->idle_timestamp + expiry;
1110
1111 now = READ_ONCE(jiffies);
1112 if (time_after(conn_expires_at, now))
1113 goto not_yet_expired;
1114 }
1115
1116 trace_rxrpc_client(conn, -1, rxrpc_client_discard);
1117 if (!test_and_clear_bit(RXRPC_CONN_EXPOSED, &conn->flags))
1118 BUG();
1119 conn->cache_state = RXRPC_CONN_CLIENT_INACTIVE;
1120 list_del_init(&conn->cache_link);
1121
1122 spin_unlock(&rxnet->client_conn_cache_lock);
1123
1124 /* When we cleared the EXPOSED flag, we took on responsibility for the
1125 * reference that that had on the usage count. We deal with that here.
1126 * If someone re-sets the flag and re-gets the ref, that's fine.
1127 */
1128 rxrpc_put_connection(conn);
1129 nr_conns--;
1130 goto next;
1131
1132not_yet_expired:
1133 /* The connection at the front of the queue hasn't yet expired, so
1134 * schedule the work item for that point if we discarded something.
1135 *
1136 * We don't worry if the work item is already scheduled - it can look
1137 * after rescheduling itself at a later time. We could cancel it, but
1138 * then things get messier.
1139 */
1140 _debug("not yet");
1141 if (!rxnet->kill_all_client_conns)
1142 timer_reduce(&rxnet->client_conn_reap_timer,
1143 conn_expires_at);
1144
1145out:
1146 spin_unlock(&rxnet->client_conn_cache_lock);
1147 spin_unlock(&rxnet->client_conn_discard_lock);
1148 _leave("");
1149}
1150
1151/*
1152 * Preemptively destroy all the client connection records rather than waiting
1153 * for them to time out
1154 */
1155void rxrpc_destroy_all_client_connections(struct rxrpc_net *rxnet)
1156{
1157 _enter("");
1158
1159 spin_lock(&rxnet->client_conn_cache_lock);
1160 rxnet->kill_all_client_conns = true;
1161 spin_unlock(&rxnet->client_conn_cache_lock);
1162
1163 del_timer_sync(&rxnet->client_conn_reap_timer);
1164
1165 if (!rxrpc_queue_work(&rxnet->client_conn_reaper))
1166 _debug("destroy: queue failed");
1167
1168 _leave("");
1169}
1170
1171/*
1172 * Clean up the client connections on a local endpoint.
1173 */
1174void rxrpc_clean_up_local_conns(struct rxrpc_local *local)
1175{
1176 struct rxrpc_connection *conn, *tmp;
1177 struct rxrpc_net *rxnet = local->rxnet;
1178 unsigned int nr_active;
1179 LIST_HEAD(graveyard);
1180
1181 _enter("");
1182
1183 spin_lock(&rxnet->client_conn_cache_lock);
1184 nr_active = rxnet->nr_active_client_conns;
1185
1186 list_for_each_entry_safe(conn, tmp, &rxnet->idle_client_conns,
1187 cache_link) {
1188 if (conn->params.local == local) {
1189 ASSERTCMP(conn->cache_state, ==, RXRPC_CONN_CLIENT_IDLE);
1190
1191 trace_rxrpc_client(conn, -1, rxrpc_client_discard);
1192 if (!test_and_clear_bit(RXRPC_CONN_EXPOSED, &conn->flags))
1193 BUG();
1194 conn->cache_state = RXRPC_CONN_CLIENT_INACTIVE;
1195 list_move(&conn->cache_link, &graveyard);
1196 nr_active--;
1197 }
1198 }
1199
1200 rxnet->nr_active_client_conns = nr_active;
1201 spin_unlock(&rxnet->client_conn_cache_lock);
1202 ASSERTCMP(nr_active, >=, 0);
1203
1204 while (!list_empty(&graveyard)) {
1205 conn = list_entry(graveyard.next,
1206 struct rxrpc_connection, cache_link);
1207 list_del_init(&conn->cache_link);
1208
1209 rxrpc_put_connection(conn);
1210 }
1211
1212 _leave(" [culled]");
1213}
1// SPDX-License-Identifier: GPL-2.0-or-later
2/* Client connection-specific management code.
3 *
4 * Copyright (C) 2016, 2020 Red Hat, Inc. All Rights Reserved.
5 * Written by David Howells (dhowells@redhat.com)
6 *
7 * Client connections need to be cached for a little while after they've made a
8 * call so as to handle retransmitted DATA packets in case the server didn't
9 * receive the final ACK or terminating ABORT we sent it.
10 *
11 * There are flags of relevance to the cache:
12 *
13 * (2) DONT_REUSE - The connection should be discarded as soon as possible and
14 * should not be reused. This is set when an exclusive connection is used
15 * or a call ID counter overflows.
16 *
17 * The caching state may only be changed if the cache lock is held.
18 *
19 * There are two idle client connection expiry durations. If the total number
20 * of connections is below the reap threshold, we use the normal duration; if
21 * it's above, we use the fast duration.
22 */
23
24#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
25
26#include <linux/slab.h>
27#include <linux/idr.h>
28#include <linux/timer.h>
29#include <linux/sched/signal.h>
30
31#include "ar-internal.h"
32
33__read_mostly unsigned int rxrpc_reap_client_connections = 900;
34__read_mostly unsigned long rxrpc_conn_idle_client_expiry = 2 * 60 * HZ;
35__read_mostly unsigned long rxrpc_conn_idle_client_fast_expiry = 2 * HZ;
36
37static void rxrpc_activate_bundle(struct rxrpc_bundle *bundle)
38{
39 atomic_inc(&bundle->active);
40}
41
42/*
43 * Release a connection ID for a client connection.
44 */
45static void rxrpc_put_client_connection_id(struct rxrpc_local *local,
46 struct rxrpc_connection *conn)
47{
48 idr_remove(&local->conn_ids, conn->proto.cid >> RXRPC_CIDSHIFT);
49}
50
51/*
52 * Destroy the client connection ID tree.
53 */
54static void rxrpc_destroy_client_conn_ids(struct rxrpc_local *local)
55{
56 struct rxrpc_connection *conn;
57 int id;
58
59 if (!idr_is_empty(&local->conn_ids)) {
60 idr_for_each_entry(&local->conn_ids, conn, id) {
61 pr_err("AF_RXRPC: Leaked client conn %p {%d}\n",
62 conn, refcount_read(&conn->ref));
63 }
64 BUG();
65 }
66
67 idr_destroy(&local->conn_ids);
68}
69
70/*
71 * Allocate a connection bundle.
72 */
73static struct rxrpc_bundle *rxrpc_alloc_bundle(struct rxrpc_call *call,
74 gfp_t gfp)
75{
76 static atomic_t rxrpc_bundle_id;
77 struct rxrpc_bundle *bundle;
78
79 bundle = kzalloc(sizeof(*bundle), gfp);
80 if (bundle) {
81 bundle->local = call->local;
82 bundle->peer = rxrpc_get_peer(call->peer, rxrpc_peer_get_bundle);
83 bundle->key = key_get(call->key);
84 bundle->security = call->security;
85 bundle->exclusive = test_bit(RXRPC_CALL_EXCLUSIVE, &call->flags);
86 bundle->upgrade = test_bit(RXRPC_CALL_UPGRADE, &call->flags);
87 bundle->service_id = call->dest_srx.srx_service;
88 bundle->security_level = call->security_level;
89 bundle->debug_id = atomic_inc_return(&rxrpc_bundle_id);
90 refcount_set(&bundle->ref, 1);
91 atomic_set(&bundle->active, 1);
92 INIT_LIST_HEAD(&bundle->waiting_calls);
93 trace_rxrpc_bundle(bundle->debug_id, 1, rxrpc_bundle_new);
94
95 write_lock(&bundle->local->rxnet->conn_lock);
96 list_add_tail(&bundle->proc_link, &bundle->local->rxnet->bundle_proc_list);
97 write_unlock(&bundle->local->rxnet->conn_lock);
98 }
99 return bundle;
100}
101
102struct rxrpc_bundle *rxrpc_get_bundle(struct rxrpc_bundle *bundle,
103 enum rxrpc_bundle_trace why)
104{
105 int r;
106
107 __refcount_inc(&bundle->ref, &r);
108 trace_rxrpc_bundle(bundle->debug_id, r + 1, why);
109 return bundle;
110}
111
112static void rxrpc_free_bundle(struct rxrpc_bundle *bundle)
113{
114 trace_rxrpc_bundle(bundle->debug_id, refcount_read(&bundle->ref),
115 rxrpc_bundle_free);
116 write_lock(&bundle->local->rxnet->conn_lock);
117 list_del(&bundle->proc_link);
118 write_unlock(&bundle->local->rxnet->conn_lock);
119 rxrpc_put_peer(bundle->peer, rxrpc_peer_put_bundle);
120 key_put(bundle->key);
121 kfree(bundle);
122}
123
124void rxrpc_put_bundle(struct rxrpc_bundle *bundle, enum rxrpc_bundle_trace why)
125{
126 unsigned int id;
127 bool dead;
128 int r;
129
130 if (bundle) {
131 id = bundle->debug_id;
132 dead = __refcount_dec_and_test(&bundle->ref, &r);
133 trace_rxrpc_bundle(id, r - 1, why);
134 if (dead)
135 rxrpc_free_bundle(bundle);
136 }
137}
138
139/*
140 * Get rid of outstanding client connection preallocations when a local
141 * endpoint is destroyed.
142 */
143void rxrpc_purge_client_connections(struct rxrpc_local *local)
144{
145 rxrpc_destroy_client_conn_ids(local);
146}
147
148/*
149 * Allocate a client connection.
150 */
151static struct rxrpc_connection *
152rxrpc_alloc_client_connection(struct rxrpc_bundle *bundle)
153{
154 struct rxrpc_connection *conn;
155 struct rxrpc_local *local = bundle->local;
156 struct rxrpc_net *rxnet = local->rxnet;
157 int id;
158
159 _enter("");
160
161 conn = rxrpc_alloc_connection(rxnet, GFP_ATOMIC | __GFP_NOWARN);
162 if (!conn)
163 return ERR_PTR(-ENOMEM);
164
165 id = idr_alloc_cyclic(&local->conn_ids, conn, 1, 0x40000000,
166 GFP_ATOMIC | __GFP_NOWARN);
167 if (id < 0) {
168 kfree(conn);
169 return ERR_PTR(id);
170 }
171
172 refcount_set(&conn->ref, 1);
173 conn->proto.cid = id << RXRPC_CIDSHIFT;
174 conn->proto.epoch = local->rxnet->epoch;
175 conn->out_clientflag = RXRPC_CLIENT_INITIATED;
176 conn->bundle = rxrpc_get_bundle(bundle, rxrpc_bundle_get_client_conn);
177 conn->local = rxrpc_get_local(bundle->local, rxrpc_local_get_client_conn);
178 conn->peer = rxrpc_get_peer(bundle->peer, rxrpc_peer_get_client_conn);
179 conn->key = key_get(bundle->key);
180 conn->security = bundle->security;
181 conn->exclusive = bundle->exclusive;
182 conn->upgrade = bundle->upgrade;
183 conn->orig_service_id = bundle->service_id;
184 conn->security_level = bundle->security_level;
185 conn->state = RXRPC_CONN_CLIENT_UNSECURED;
186 conn->service_id = conn->orig_service_id;
187
188 if (conn->security == &rxrpc_no_security)
189 conn->state = RXRPC_CONN_CLIENT;
190
191 atomic_inc(&rxnet->nr_conns);
192 write_lock(&rxnet->conn_lock);
193 list_add_tail(&conn->proc_link, &rxnet->conn_proc_list);
194 write_unlock(&rxnet->conn_lock);
195
196 rxrpc_see_connection(conn, rxrpc_conn_new_client);
197
198 atomic_inc(&rxnet->nr_client_conns);
199 trace_rxrpc_client(conn, -1, rxrpc_client_alloc);
200 return conn;
201}
202
203/*
204 * Determine if a connection may be reused.
205 */
206static bool rxrpc_may_reuse_conn(struct rxrpc_connection *conn)
207{
208 struct rxrpc_net *rxnet;
209 int id_cursor, id, distance, limit;
210
211 if (!conn)
212 goto dont_reuse;
213
214 rxnet = conn->rxnet;
215 if (test_bit(RXRPC_CONN_DONT_REUSE, &conn->flags))
216 goto dont_reuse;
217
218 if ((conn->state != RXRPC_CONN_CLIENT_UNSECURED &&
219 conn->state != RXRPC_CONN_CLIENT) ||
220 conn->proto.epoch != rxnet->epoch)
221 goto mark_dont_reuse;
222
223 /* The IDR tree gets very expensive on memory if the connection IDs are
224 * widely scattered throughout the number space, so we shall want to
225 * kill off connections that, say, have an ID more than about four
226 * times the maximum number of client conns away from the current
227 * allocation point to try and keep the IDs concentrated.
228 */
229 id_cursor = idr_get_cursor(&conn->local->conn_ids);
230 id = conn->proto.cid >> RXRPC_CIDSHIFT;
231 distance = id - id_cursor;
232 if (distance < 0)
233 distance = -distance;
234 limit = max_t(unsigned long, atomic_read(&rxnet->nr_conns) * 4, 1024);
235 if (distance > limit)
236 goto mark_dont_reuse;
237
238 return true;
239
240mark_dont_reuse:
241 set_bit(RXRPC_CONN_DONT_REUSE, &conn->flags);
242dont_reuse:
243 return false;
244}
245
246/*
247 * Look up the conn bundle that matches the connection parameters, adding it if
248 * it doesn't yet exist.
249 */
250int rxrpc_look_up_bundle(struct rxrpc_call *call, gfp_t gfp)
251{
252 struct rxrpc_bundle *bundle, *candidate;
253 struct rxrpc_local *local = call->local;
254 struct rb_node *p, **pp, *parent;
255 long diff;
256 bool upgrade = test_bit(RXRPC_CALL_UPGRADE, &call->flags);
257
258 _enter("{%px,%x,%u,%u}",
259 call->peer, key_serial(call->key), call->security_level,
260 upgrade);
261
262 if (test_bit(RXRPC_CALL_EXCLUSIVE, &call->flags)) {
263 call->bundle = rxrpc_alloc_bundle(call, gfp);
264 return call->bundle ? 0 : -ENOMEM;
265 }
266
267 /* First, see if the bundle is already there. */
268 _debug("search 1");
269 spin_lock(&local->client_bundles_lock);
270 p = local->client_bundles.rb_node;
271 while (p) {
272 bundle = rb_entry(p, struct rxrpc_bundle, local_node);
273
274#define cmp(X, Y) ((long)(X) - (long)(Y))
275 diff = (cmp(bundle->peer, call->peer) ?:
276 cmp(bundle->key, call->key) ?:
277 cmp(bundle->security_level, call->security_level) ?:
278 cmp(bundle->upgrade, upgrade));
279#undef cmp
280 if (diff < 0)
281 p = p->rb_left;
282 else if (diff > 0)
283 p = p->rb_right;
284 else
285 goto found_bundle;
286 }
287 spin_unlock(&local->client_bundles_lock);
288 _debug("not found");
289
290 /* It wasn't. We need to add one. */
291 candidate = rxrpc_alloc_bundle(call, gfp);
292 if (!candidate)
293 return -ENOMEM;
294
295 _debug("search 2");
296 spin_lock(&local->client_bundles_lock);
297 pp = &local->client_bundles.rb_node;
298 parent = NULL;
299 while (*pp) {
300 parent = *pp;
301 bundle = rb_entry(parent, struct rxrpc_bundle, local_node);
302
303#define cmp(X, Y) ((long)(X) - (long)(Y))
304 diff = (cmp(bundle->peer, call->peer) ?:
305 cmp(bundle->key, call->key) ?:
306 cmp(bundle->security_level, call->security_level) ?:
307 cmp(bundle->upgrade, upgrade));
308#undef cmp
309 if (diff < 0)
310 pp = &(*pp)->rb_left;
311 else if (diff > 0)
312 pp = &(*pp)->rb_right;
313 else
314 goto found_bundle_free;
315 }
316
317 _debug("new bundle");
318 rb_link_node(&candidate->local_node, parent, pp);
319 rb_insert_color(&candidate->local_node, &local->client_bundles);
320 call->bundle = rxrpc_get_bundle(candidate, rxrpc_bundle_get_client_call);
321 spin_unlock(&local->client_bundles_lock);
322 _leave(" = B=%u [new]", call->bundle->debug_id);
323 return 0;
324
325found_bundle_free:
326 rxrpc_free_bundle(candidate);
327found_bundle:
328 call->bundle = rxrpc_get_bundle(bundle, rxrpc_bundle_get_client_call);
329 rxrpc_activate_bundle(bundle);
330 spin_unlock(&local->client_bundles_lock);
331 _leave(" = B=%u [found]", call->bundle->debug_id);
332 return 0;
333}
334
335/*
336 * Allocate a new connection and add it into a bundle.
337 */
338static bool rxrpc_add_conn_to_bundle(struct rxrpc_bundle *bundle,
339 unsigned int slot)
340{
341 struct rxrpc_connection *conn, *old;
342 unsigned int shift = slot * RXRPC_MAXCALLS;
343 unsigned int i;
344
345 old = bundle->conns[slot];
346 if (old) {
347 bundle->conns[slot] = NULL;
348 bundle->conn_ids[slot] = 0;
349 trace_rxrpc_client(old, -1, rxrpc_client_replace);
350 rxrpc_put_connection(old, rxrpc_conn_put_noreuse);
351 }
352
353 conn = rxrpc_alloc_client_connection(bundle);
354 if (IS_ERR(conn)) {
355 bundle->alloc_error = PTR_ERR(conn);
356 return false;
357 }
358
359 rxrpc_activate_bundle(bundle);
360 conn->bundle_shift = shift;
361 bundle->conns[slot] = conn;
362 bundle->conn_ids[slot] = conn->debug_id;
363 for (i = 0; i < RXRPC_MAXCALLS; i++)
364 set_bit(shift + i, &bundle->avail_chans);
365 return true;
366}
367
368/*
369 * Add a connection to a bundle if there are no usable connections or we have
370 * connections waiting for extra capacity.
371 */
372static bool rxrpc_bundle_has_space(struct rxrpc_bundle *bundle)
373{
374 int slot = -1, i, usable;
375
376 _enter("");
377
378 bundle->alloc_error = 0;
379
380 /* See if there are any usable connections. */
381 usable = 0;
382 for (i = 0; i < ARRAY_SIZE(bundle->conns); i++) {
383 if (rxrpc_may_reuse_conn(bundle->conns[i]))
384 usable++;
385 else if (slot == -1)
386 slot = i;
387 }
388
389 if (!usable && bundle->upgrade)
390 bundle->try_upgrade = true;
391
392 if (!usable)
393 goto alloc_conn;
394
395 if (!bundle->avail_chans &&
396 !bundle->try_upgrade &&
397 usable < ARRAY_SIZE(bundle->conns))
398 goto alloc_conn;
399
400 _leave("");
401 return usable;
402
403alloc_conn:
404 return slot >= 0 ? rxrpc_add_conn_to_bundle(bundle, slot) : false;
405}
406
407/*
408 * Assign a channel to the call at the front of the queue and wake the call up.
409 * We don't increment the callNumber counter until this number has been exposed
410 * to the world.
411 */
412static void rxrpc_activate_one_channel(struct rxrpc_connection *conn,
413 unsigned int channel)
414{
415 struct rxrpc_channel *chan = &conn->channels[channel];
416 struct rxrpc_bundle *bundle = conn->bundle;
417 struct rxrpc_call *call = list_entry(bundle->waiting_calls.next,
418 struct rxrpc_call, wait_link);
419 u32 call_id = chan->call_counter + 1;
420
421 _enter("C=%x,%u", conn->debug_id, channel);
422
423 list_del_init(&call->wait_link);
424
425 trace_rxrpc_client(conn, channel, rxrpc_client_chan_activate);
426
427 /* Cancel the final ACK on the previous call if it hasn't been sent yet
428 * as the DATA packet will implicitly ACK it.
429 */
430 clear_bit(RXRPC_CONN_FINAL_ACK_0 + channel, &conn->flags);
431 clear_bit(conn->bundle_shift + channel, &bundle->avail_chans);
432
433 rxrpc_see_call(call, rxrpc_call_see_activate_client);
434 call->conn = rxrpc_get_connection(conn, rxrpc_conn_get_activate_call);
435 call->cid = conn->proto.cid | channel;
436 call->call_id = call_id;
437 call->dest_srx.srx_service = conn->service_id;
438 call->cong_ssthresh = call->peer->cong_ssthresh;
439 if (call->cong_cwnd >= call->cong_ssthresh)
440 call->cong_mode = RXRPC_CALL_CONGEST_AVOIDANCE;
441 else
442 call->cong_mode = RXRPC_CALL_SLOW_START;
443
444 chan->call_id = call_id;
445 chan->call_debug_id = call->debug_id;
446 chan->call = call;
447
448 rxrpc_see_call(call, rxrpc_call_see_connected);
449 trace_rxrpc_connect_call(call);
450 call->tx_last_sent = ktime_get_real();
451 rxrpc_start_call_timer(call);
452 rxrpc_set_call_state(call, RXRPC_CALL_CLIENT_SEND_REQUEST);
453 wake_up(&call->waitq);
454}
455
456/*
457 * Remove a connection from the idle list if it's on it.
458 */
459static void rxrpc_unidle_conn(struct rxrpc_connection *conn)
460{
461 if (!list_empty(&conn->cache_link)) {
462 list_del_init(&conn->cache_link);
463 rxrpc_put_connection(conn, rxrpc_conn_put_unidle);
464 }
465}
466
467/*
468 * Assign channels and callNumbers to waiting calls.
469 */
470static void rxrpc_activate_channels(struct rxrpc_bundle *bundle)
471{
472 struct rxrpc_connection *conn;
473 unsigned long avail, mask;
474 unsigned int channel, slot;
475
476 trace_rxrpc_client(NULL, -1, rxrpc_client_activate_chans);
477
478 if (bundle->try_upgrade)
479 mask = 1;
480 else
481 mask = ULONG_MAX;
482
483 while (!list_empty(&bundle->waiting_calls)) {
484 avail = bundle->avail_chans & mask;
485 if (!avail)
486 break;
487 channel = __ffs(avail);
488 clear_bit(channel, &bundle->avail_chans);
489
490 slot = channel / RXRPC_MAXCALLS;
491 conn = bundle->conns[slot];
492 if (!conn)
493 break;
494
495 if (bundle->try_upgrade)
496 set_bit(RXRPC_CONN_PROBING_FOR_UPGRADE, &conn->flags);
497 rxrpc_unidle_conn(conn);
498
499 channel &= (RXRPC_MAXCALLS - 1);
500 conn->act_chans |= 1 << channel;
501 rxrpc_activate_one_channel(conn, channel);
502 }
503}
504
505/*
506 * Connect waiting channels (called from the I/O thread).
507 */
508void rxrpc_connect_client_calls(struct rxrpc_local *local)
509{
510 struct rxrpc_call *call;
511
512 while ((call = list_first_entry_or_null(&local->new_client_calls,
513 struct rxrpc_call, wait_link))
514 ) {
515 struct rxrpc_bundle *bundle = call->bundle;
516
517 spin_lock(&local->client_call_lock);
518 list_move_tail(&call->wait_link, &bundle->waiting_calls);
519 rxrpc_see_call(call, rxrpc_call_see_waiting_call);
520 spin_unlock(&local->client_call_lock);
521
522 if (rxrpc_bundle_has_space(bundle))
523 rxrpc_activate_channels(bundle);
524 }
525}
526
527/*
528 * Note that a call, and thus a connection, is about to be exposed to the
529 * world.
530 */
531void rxrpc_expose_client_call(struct rxrpc_call *call)
532{
533 unsigned int channel = call->cid & RXRPC_CHANNELMASK;
534 struct rxrpc_connection *conn = call->conn;
535 struct rxrpc_channel *chan = &conn->channels[channel];
536
537 if (!test_and_set_bit(RXRPC_CALL_EXPOSED, &call->flags)) {
538 /* Mark the call ID as being used. If the callNumber counter
539 * exceeds ~2 billion, we kill the connection after its
540 * outstanding calls have finished so that the counter doesn't
541 * wrap.
542 */
543 chan->call_counter++;
544 if (chan->call_counter >= INT_MAX)
545 set_bit(RXRPC_CONN_DONT_REUSE, &conn->flags);
546 trace_rxrpc_client(conn, channel, rxrpc_client_exposed);
547
548 spin_lock(&call->peer->lock);
549 hlist_add_head(&call->error_link, &call->peer->error_targets);
550 spin_unlock(&call->peer->lock);
551 }
552}
553
554/*
555 * Set the reap timer.
556 */
557static void rxrpc_set_client_reap_timer(struct rxrpc_local *local)
558{
559 if (!local->kill_all_client_conns) {
560 unsigned long now = jiffies;
561 unsigned long reap_at = now + rxrpc_conn_idle_client_expiry;
562
563 if (local->rxnet->live)
564 timer_reduce(&local->client_conn_reap_timer, reap_at);
565 }
566}
567
568/*
569 * Disconnect a client call.
570 */
571void rxrpc_disconnect_client_call(struct rxrpc_bundle *bundle, struct rxrpc_call *call)
572{
573 struct rxrpc_connection *conn;
574 struct rxrpc_channel *chan = NULL;
575 struct rxrpc_local *local = bundle->local;
576 unsigned int channel;
577 bool may_reuse;
578 u32 cid;
579
580 _enter("c=%x", call->debug_id);
581
582 /* Calls that have never actually been assigned a channel can simply be
583 * discarded.
584 */
585 conn = call->conn;
586 if (!conn) {
587 _debug("call is waiting");
588 ASSERTCMP(call->call_id, ==, 0);
589 ASSERT(!test_bit(RXRPC_CALL_EXPOSED, &call->flags));
590 /* May still be on ->new_client_calls. */
591 spin_lock(&local->client_call_lock);
592 list_del_init(&call->wait_link);
593 spin_unlock(&local->client_call_lock);
594 return;
595 }
596
597 cid = call->cid;
598 channel = cid & RXRPC_CHANNELMASK;
599 chan = &conn->channels[channel];
600 trace_rxrpc_client(conn, channel, rxrpc_client_chan_disconnect);
601
602 if (WARN_ON(chan->call != call))
603 return;
604
605 may_reuse = rxrpc_may_reuse_conn(conn);
606
607 /* If a client call was exposed to the world, we save the result for
608 * retransmission.
609 *
610 * We use a barrier here so that the call number and abort code can be
611 * read without needing to take a lock.
612 *
613 * TODO: Make the incoming packet handler check this and handle
614 * terminal retransmission without requiring access to the call.
615 */
616 if (test_bit(RXRPC_CALL_EXPOSED, &call->flags)) {
617 _debug("exposed %u,%u", call->call_id, call->abort_code);
618 __rxrpc_disconnect_call(conn, call);
619
620 if (test_and_clear_bit(RXRPC_CONN_PROBING_FOR_UPGRADE, &conn->flags)) {
621 trace_rxrpc_client(conn, channel, rxrpc_client_to_active);
622 bundle->try_upgrade = false;
623 if (may_reuse)
624 rxrpc_activate_channels(bundle);
625 }
626 }
627
628 /* See if we can pass the channel directly to another call. */
629 if (may_reuse && !list_empty(&bundle->waiting_calls)) {
630 trace_rxrpc_client(conn, channel, rxrpc_client_chan_pass);
631 rxrpc_activate_one_channel(conn, channel);
632 return;
633 }
634
635 /* Schedule the final ACK to be transmitted in a short while so that it
636 * can be skipped if we find a follow-on call. The first DATA packet
637 * of the follow on call will implicitly ACK this call.
638 */
639 if (call->completion == RXRPC_CALL_SUCCEEDED &&
640 test_bit(RXRPC_CALL_EXPOSED, &call->flags)) {
641 unsigned long final_ack_at = jiffies + 2;
642
643 chan->final_ack_at = final_ack_at;
644 smp_wmb(); /* vs rxrpc_process_delayed_final_acks() */
645 set_bit(RXRPC_CONN_FINAL_ACK_0 + channel, &conn->flags);
646 rxrpc_reduce_conn_timer(conn, final_ack_at);
647 }
648
649 /* Deactivate the channel. */
650 chan->call = NULL;
651 set_bit(conn->bundle_shift + channel, &conn->bundle->avail_chans);
652 conn->act_chans &= ~(1 << channel);
653
654 /* If no channels remain active, then put the connection on the idle
655 * list for a short while. Give it a ref to stop it going away if it
656 * becomes unbundled.
657 */
658 if (!conn->act_chans) {
659 trace_rxrpc_client(conn, channel, rxrpc_client_to_idle);
660 conn->idle_timestamp = jiffies;
661
662 rxrpc_get_connection(conn, rxrpc_conn_get_idle);
663 list_move_tail(&conn->cache_link, &local->idle_client_conns);
664
665 rxrpc_set_client_reap_timer(local);
666 }
667}
668
669/*
670 * Remove a connection from a bundle.
671 */
672static void rxrpc_unbundle_conn(struct rxrpc_connection *conn)
673{
674 struct rxrpc_bundle *bundle = conn->bundle;
675 unsigned int bindex;
676 int i;
677
678 _enter("C=%x", conn->debug_id);
679
680 if (conn->flags & RXRPC_CONN_FINAL_ACK_MASK)
681 rxrpc_process_delayed_final_acks(conn, true);
682
683 bindex = conn->bundle_shift / RXRPC_MAXCALLS;
684 if (bundle->conns[bindex] == conn) {
685 _debug("clear slot %u", bindex);
686 bundle->conns[bindex] = NULL;
687 bundle->conn_ids[bindex] = 0;
688 for (i = 0; i < RXRPC_MAXCALLS; i++)
689 clear_bit(conn->bundle_shift + i, &bundle->avail_chans);
690 rxrpc_put_client_connection_id(bundle->local, conn);
691 rxrpc_deactivate_bundle(bundle);
692 rxrpc_put_connection(conn, rxrpc_conn_put_unbundle);
693 }
694}
695
696/*
697 * Drop the active count on a bundle.
698 */
699void rxrpc_deactivate_bundle(struct rxrpc_bundle *bundle)
700{
701 struct rxrpc_local *local;
702 bool need_put = false;
703
704 if (!bundle)
705 return;
706
707 local = bundle->local;
708 if (atomic_dec_and_lock(&bundle->active, &local->client_bundles_lock)) {
709 if (!bundle->exclusive) {
710 _debug("erase bundle");
711 rb_erase(&bundle->local_node, &local->client_bundles);
712 need_put = true;
713 }
714
715 spin_unlock(&local->client_bundles_lock);
716 if (need_put)
717 rxrpc_put_bundle(bundle, rxrpc_bundle_put_discard);
718 }
719}
720
721/*
722 * Clean up a dead client connection.
723 */
724void rxrpc_kill_client_conn(struct rxrpc_connection *conn)
725{
726 struct rxrpc_local *local = conn->local;
727 struct rxrpc_net *rxnet = local->rxnet;
728
729 _enter("C=%x", conn->debug_id);
730
731 trace_rxrpc_client(conn, -1, rxrpc_client_cleanup);
732 atomic_dec(&rxnet->nr_client_conns);
733
734 rxrpc_put_client_connection_id(local, conn);
735}
736
737/*
738 * Discard expired client connections from the idle list. Each conn in the
739 * idle list has been exposed and holds an extra ref because of that.
740 *
741 * This may be called from conn setup or from a work item so cannot be
742 * considered non-reentrant.
743 */
744void rxrpc_discard_expired_client_conns(struct rxrpc_local *local)
745{
746 struct rxrpc_connection *conn;
747 unsigned long expiry, conn_expires_at, now;
748 unsigned int nr_conns;
749
750 _enter("");
751
752 /* We keep an estimate of what the number of conns ought to be after
753 * we've discarded some so that we don't overdo the discarding.
754 */
755 nr_conns = atomic_read(&local->rxnet->nr_client_conns);
756
757next:
758 conn = list_first_entry_or_null(&local->idle_client_conns,
759 struct rxrpc_connection, cache_link);
760 if (!conn)
761 return;
762
763 if (!local->kill_all_client_conns) {
764 /* If the number of connections is over the reap limit, we
765 * expedite discard by reducing the expiry timeout. We must,
766 * however, have at least a short grace period to be able to do
767 * final-ACK or ABORT retransmission.
768 */
769 expiry = rxrpc_conn_idle_client_expiry;
770 if (nr_conns > rxrpc_reap_client_connections)
771 expiry = rxrpc_conn_idle_client_fast_expiry;
772 if (conn->local->service_closed)
773 expiry = rxrpc_closed_conn_expiry * HZ;
774
775 conn_expires_at = conn->idle_timestamp + expiry;
776
777 now = jiffies;
778 if (time_after(conn_expires_at, now))
779 goto not_yet_expired;
780 }
781
782 atomic_dec(&conn->active);
783 trace_rxrpc_client(conn, -1, rxrpc_client_discard);
784 list_del_init(&conn->cache_link);
785
786 rxrpc_unbundle_conn(conn);
787 /* Drop the ->cache_link ref */
788 rxrpc_put_connection(conn, rxrpc_conn_put_discard_idle);
789
790 nr_conns--;
791 goto next;
792
793not_yet_expired:
794 /* The connection at the front of the queue hasn't yet expired, so
795 * schedule the work item for that point if we discarded something.
796 *
797 * We don't worry if the work item is already scheduled - it can look
798 * after rescheduling itself at a later time. We could cancel it, but
799 * then things get messier.
800 */
801 _debug("not yet");
802 if (!local->kill_all_client_conns)
803 timer_reduce(&local->client_conn_reap_timer, conn_expires_at);
804
805 _leave("");
806}
807
808/*
809 * Clean up the client connections on a local endpoint.
810 */
811void rxrpc_clean_up_local_conns(struct rxrpc_local *local)
812{
813 struct rxrpc_connection *conn;
814
815 _enter("");
816
817 local->kill_all_client_conns = true;
818
819 del_timer_sync(&local->client_conn_reap_timer);
820
821 while ((conn = list_first_entry_or_null(&local->idle_client_conns,
822 struct rxrpc_connection, cache_link))) {
823 list_del_init(&conn->cache_link);
824 atomic_dec(&conn->active);
825 trace_rxrpc_client(conn, -1, rxrpc_client_discard);
826 rxrpc_unbundle_conn(conn);
827 rxrpc_put_connection(conn, rxrpc_conn_put_local_dead);
828 }
829
830 _leave(" [culled]");
831}