1 // SPDX-License-Identifier: GPL-2.0-or-later 1 // SPDX-License-Identifier: GPL-2.0-or-later
2 /* Client connection-specific management code. 2 /* Client connection-specific management code.
3 * 3 *
4 * Copyright (C) 2016, 2020 Red Hat, Inc. All 4 * Copyright (C) 2016, 2020 Red Hat, Inc. All Rights Reserved.
5 * Written by David Howells (dhowells@redhat.c 5 * Written by David Howells (dhowells@redhat.com)
6 * 6 *
7 * Client connections need to be cached for a 7 * Client connections need to be cached for a little while after they've made a
8 * call so as to handle retransmitted DATA pac 8 * call so as to handle retransmitted DATA packets in case the server didn't
9 * receive the final ACK or terminating ABORT 9 * receive the final ACK or terminating ABORT we sent it.
10 * 10 *
11 * There are flags of relevance to the cache: 11 * There are flags of relevance to the cache:
12 * 12 *
13 * (2) DONT_REUSE - The connection should be 13 * (2) DONT_REUSE - The connection should be discarded as soon as possible and
14 * should not be reused. This is set whe 14 * should not be reused. This is set when an exclusive connection is used
15 * or a call ID counter overflows. 15 * or a call ID counter overflows.
16 * 16 *
17 * The caching state may only be changed if th 17 * The caching state may only be changed if the cache lock is held.
18 * 18 *
19 * There are two idle client connection expiry 19 * There are two idle client connection expiry durations. If the total number
20 * of connections is below the reap threshold, 20 * of connections is below the reap threshold, we use the normal duration; if
21 * it's above, we use the fast duration. 21 * it's above, we use the fast duration.
22 */ 22 */
23 23
24 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt 24 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
25 25
26 #include <linux/slab.h> 26 #include <linux/slab.h>
27 #include <linux/idr.h> 27 #include <linux/idr.h>
28 #include <linux/timer.h> 28 #include <linux/timer.h>
29 #include <linux/sched/signal.h> 29 #include <linux/sched/signal.h>
30 30
31 #include "ar-internal.h" 31 #include "ar-internal.h"
32 32
33 __read_mostly unsigned int rxrpc_reap_client_c 33 __read_mostly unsigned int rxrpc_reap_client_connections = 900;
34 __read_mostly unsigned long rxrpc_conn_idle_cl 34 __read_mostly unsigned long rxrpc_conn_idle_client_expiry = 2 * 60 * HZ;
35 __read_mostly unsigned long rxrpc_conn_idle_cl 35 __read_mostly unsigned long rxrpc_conn_idle_client_fast_expiry = 2 * HZ;
36 36
37 static void rxrpc_activate_bundle(struct rxrpc 37 static void rxrpc_activate_bundle(struct rxrpc_bundle *bundle)
38 { 38 {
39 atomic_inc(&bundle->active); 39 atomic_inc(&bundle->active);
40 } 40 }
41 41
42 /* 42 /*
43 * Release a connection ID for a client connec 43 * Release a connection ID for a client connection.
44 */ 44 */
45 static void rxrpc_put_client_connection_id(str 45 static void rxrpc_put_client_connection_id(struct rxrpc_local *local,
46 str 46 struct rxrpc_connection *conn)
47 { 47 {
48 idr_remove(&local->conn_ids, conn->pro 48 idr_remove(&local->conn_ids, conn->proto.cid >> RXRPC_CIDSHIFT);
49 } 49 }
50 50
51 /* 51 /*
52 * Destroy the client connection ID tree. 52 * Destroy the client connection ID tree.
53 */ 53 */
54 static void rxrpc_destroy_client_conn_ids(stru 54 static void rxrpc_destroy_client_conn_ids(struct rxrpc_local *local)
55 { 55 {
56 struct rxrpc_connection *conn; 56 struct rxrpc_connection *conn;
57 int id; 57 int id;
58 58
59 if (!idr_is_empty(&local->conn_ids)) { 59 if (!idr_is_empty(&local->conn_ids)) {
60 idr_for_each_entry(&local->con 60 idr_for_each_entry(&local->conn_ids, conn, id) {
61 pr_err("AF_RXRPC: Leak 61 pr_err("AF_RXRPC: Leaked client conn %p {%d}\n",
62 conn, refcount_ 62 conn, refcount_read(&conn->ref));
63 } 63 }
64 BUG(); 64 BUG();
65 } 65 }
66 66
67 idr_destroy(&local->conn_ids); 67 idr_destroy(&local->conn_ids);
68 } 68 }
69 69
70 /* 70 /*
71 * Allocate a connection bundle. 71 * Allocate a connection bundle.
72 */ 72 */
73 static struct rxrpc_bundle *rxrpc_alloc_bundle 73 static struct rxrpc_bundle *rxrpc_alloc_bundle(struct rxrpc_call *call,
74 74 gfp_t gfp)
75 { 75 {
76 static atomic_t rxrpc_bundle_id; 76 static atomic_t rxrpc_bundle_id;
77 struct rxrpc_bundle *bundle; 77 struct rxrpc_bundle *bundle;
78 78
79 bundle = kzalloc(sizeof(*bundle), gfp) 79 bundle = kzalloc(sizeof(*bundle), gfp);
80 if (bundle) { 80 if (bundle) {
81 bundle->local = call 81 bundle->local = call->local;
82 bundle->peer = rxrp 82 bundle->peer = rxrpc_get_peer(call->peer, rxrpc_peer_get_bundle);
83 bundle->key = key_ 83 bundle->key = key_get(call->key);
84 bundle->security = call 84 bundle->security = call->security;
85 bundle->exclusive = test 85 bundle->exclusive = test_bit(RXRPC_CALL_EXCLUSIVE, &call->flags);
86 bundle->upgrade = test 86 bundle->upgrade = test_bit(RXRPC_CALL_UPGRADE, &call->flags);
87 bundle->service_id = call 87 bundle->service_id = call->dest_srx.srx_service;
88 bundle->security_level = call 88 bundle->security_level = call->security_level;
89 bundle->debug_id = atom 89 bundle->debug_id = atomic_inc_return(&rxrpc_bundle_id);
90 refcount_set(&bundle->ref, 1); 90 refcount_set(&bundle->ref, 1);
91 atomic_set(&bundle->active, 1) 91 atomic_set(&bundle->active, 1);
92 INIT_LIST_HEAD(&bundle->waitin 92 INIT_LIST_HEAD(&bundle->waiting_calls);
93 trace_rxrpc_bundle(bundle->deb 93 trace_rxrpc_bundle(bundle->debug_id, 1, rxrpc_bundle_new);
94 <<
95 write_lock(&bundle->local->rxn <<
96 list_add_tail(&bundle->proc_li <<
97 write_unlock(&bundle->local->r <<
98 } 94 }
99 return bundle; 95 return bundle;
100 } 96 }
101 97
102 struct rxrpc_bundle *rxrpc_get_bundle(struct r 98 struct rxrpc_bundle *rxrpc_get_bundle(struct rxrpc_bundle *bundle,
103 enum rxr 99 enum rxrpc_bundle_trace why)
104 { 100 {
105 int r; 101 int r;
106 102
107 __refcount_inc(&bundle->ref, &r); 103 __refcount_inc(&bundle->ref, &r);
108 trace_rxrpc_bundle(bundle->debug_id, r 104 trace_rxrpc_bundle(bundle->debug_id, r + 1, why);
109 return bundle; 105 return bundle;
110 } 106 }
111 107
112 static void rxrpc_free_bundle(struct rxrpc_bun 108 static void rxrpc_free_bundle(struct rxrpc_bundle *bundle)
113 { 109 {
114 trace_rxrpc_bundle(bundle->debug_id, r 110 trace_rxrpc_bundle(bundle->debug_id, refcount_read(&bundle->ref),
115 rxrpc_bundle_free); 111 rxrpc_bundle_free);
116 write_lock(&bundle->local->rxnet->conn <<
117 list_del(&bundle->proc_link); <<
118 write_unlock(&bundle->local->rxnet->co <<
119 rxrpc_put_peer(bundle->peer, rxrpc_pee 112 rxrpc_put_peer(bundle->peer, rxrpc_peer_put_bundle);
120 key_put(bundle->key); 113 key_put(bundle->key);
121 kfree(bundle); 114 kfree(bundle);
122 } 115 }
123 116
124 void rxrpc_put_bundle(struct rxrpc_bundle *bun 117 void rxrpc_put_bundle(struct rxrpc_bundle *bundle, enum rxrpc_bundle_trace why)
125 { 118 {
126 unsigned int id; 119 unsigned int id;
127 bool dead; 120 bool dead;
128 int r; 121 int r;
129 122
130 if (bundle) { 123 if (bundle) {
131 id = bundle->debug_id; 124 id = bundle->debug_id;
132 dead = __refcount_dec_and_test 125 dead = __refcount_dec_and_test(&bundle->ref, &r);
133 trace_rxrpc_bundle(id, r - 1, 126 trace_rxrpc_bundle(id, r - 1, why);
134 if (dead) 127 if (dead)
135 rxrpc_free_bundle(bund 128 rxrpc_free_bundle(bundle);
136 } 129 }
137 } 130 }
138 131
139 /* 132 /*
140 * Get rid of outstanding client connection pr 133 * Get rid of outstanding client connection preallocations when a local
141 * endpoint is destroyed. 134 * endpoint is destroyed.
142 */ 135 */
143 void rxrpc_purge_client_connections(struct rxr 136 void rxrpc_purge_client_connections(struct rxrpc_local *local)
144 { 137 {
145 rxrpc_destroy_client_conn_ids(local); 138 rxrpc_destroy_client_conn_ids(local);
146 } 139 }
147 140
148 /* 141 /*
149 * Allocate a client connection. 142 * Allocate a client connection.
150 */ 143 */
151 static struct rxrpc_connection * 144 static struct rxrpc_connection *
152 rxrpc_alloc_client_connection(struct rxrpc_bun 145 rxrpc_alloc_client_connection(struct rxrpc_bundle *bundle)
153 { 146 {
154 struct rxrpc_connection *conn; 147 struct rxrpc_connection *conn;
155 struct rxrpc_local *local = bundle->lo 148 struct rxrpc_local *local = bundle->local;
156 struct rxrpc_net *rxnet = local->rxnet 149 struct rxrpc_net *rxnet = local->rxnet;
157 int id; 150 int id;
158 151
159 _enter(""); 152 _enter("");
160 153
161 conn = rxrpc_alloc_connection(rxnet, G 154 conn = rxrpc_alloc_connection(rxnet, GFP_ATOMIC | __GFP_NOWARN);
162 if (!conn) 155 if (!conn)
163 return ERR_PTR(-ENOMEM); 156 return ERR_PTR(-ENOMEM);
164 157
165 id = idr_alloc_cyclic(&local->conn_ids 158 id = idr_alloc_cyclic(&local->conn_ids, conn, 1, 0x40000000,
166 GFP_ATOMIC | __G 159 GFP_ATOMIC | __GFP_NOWARN);
167 if (id < 0) { 160 if (id < 0) {
168 kfree(conn); 161 kfree(conn);
169 return ERR_PTR(id); 162 return ERR_PTR(id);
170 } 163 }
171 164
172 refcount_set(&conn->ref, 1); 165 refcount_set(&conn->ref, 1);
173 conn->proto.cid = id << RXRPC_ 166 conn->proto.cid = id << RXRPC_CIDSHIFT;
174 conn->proto.epoch = local->rxnet 167 conn->proto.epoch = local->rxnet->epoch;
175 conn->out_clientflag = RXRPC_CLIENT 168 conn->out_clientflag = RXRPC_CLIENT_INITIATED;
176 conn->bundle = rxrpc_get_bu 169 conn->bundle = rxrpc_get_bundle(bundle, rxrpc_bundle_get_client_conn);
177 conn->local = rxrpc_get_lo 170 conn->local = rxrpc_get_local(bundle->local, rxrpc_local_get_client_conn);
178 conn->peer = rxrpc_get_pe 171 conn->peer = rxrpc_get_peer(bundle->peer, rxrpc_peer_get_client_conn);
179 conn->key = key_get(bund 172 conn->key = key_get(bundle->key);
180 conn->security = bundle->secu 173 conn->security = bundle->security;
181 conn->exclusive = bundle->excl 174 conn->exclusive = bundle->exclusive;
182 conn->upgrade = bundle->upgr 175 conn->upgrade = bundle->upgrade;
183 conn->orig_service_id = bundle->serv 176 conn->orig_service_id = bundle->service_id;
184 conn->security_level = bundle->secu 177 conn->security_level = bundle->security_level;
185 conn->state = RXRPC_CONN_C 178 conn->state = RXRPC_CONN_CLIENT_UNSECURED;
186 conn->service_id = conn->orig_s 179 conn->service_id = conn->orig_service_id;
187 180
188 if (conn->security == &rxrpc_no_securi 181 if (conn->security == &rxrpc_no_security)
189 conn->state = RXRPC_CONN_C 182 conn->state = RXRPC_CONN_CLIENT;
190 183
191 atomic_inc(&rxnet->nr_conns); 184 atomic_inc(&rxnet->nr_conns);
192 write_lock(&rxnet->conn_lock); 185 write_lock(&rxnet->conn_lock);
193 list_add_tail(&conn->proc_link, &rxnet 186 list_add_tail(&conn->proc_link, &rxnet->conn_proc_list);
194 write_unlock(&rxnet->conn_lock); 187 write_unlock(&rxnet->conn_lock);
195 188
196 rxrpc_see_connection(conn, rxrpc_conn_ 189 rxrpc_see_connection(conn, rxrpc_conn_new_client);
197 190
198 atomic_inc(&rxnet->nr_client_conns); 191 atomic_inc(&rxnet->nr_client_conns);
199 trace_rxrpc_client(conn, -1, rxrpc_cli 192 trace_rxrpc_client(conn, -1, rxrpc_client_alloc);
200 return conn; 193 return conn;
201 } 194 }
202 195
203 /* 196 /*
204 * Determine if a connection may be reused. 197 * Determine if a connection may be reused.
205 */ 198 */
206 static bool rxrpc_may_reuse_conn(struct rxrpc_ 199 static bool rxrpc_may_reuse_conn(struct rxrpc_connection *conn)
207 { 200 {
208 struct rxrpc_net *rxnet; 201 struct rxrpc_net *rxnet;
209 int id_cursor, id, distance, limit; 202 int id_cursor, id, distance, limit;
210 203
211 if (!conn) 204 if (!conn)
212 goto dont_reuse; 205 goto dont_reuse;
213 206
214 rxnet = conn->rxnet; 207 rxnet = conn->rxnet;
215 if (test_bit(RXRPC_CONN_DONT_REUSE, &c 208 if (test_bit(RXRPC_CONN_DONT_REUSE, &conn->flags))
216 goto dont_reuse; 209 goto dont_reuse;
217 210
218 if ((conn->state != RXRPC_CONN_CLIENT_ 211 if ((conn->state != RXRPC_CONN_CLIENT_UNSECURED &&
219 conn->state != RXRPC_CONN_CLIENT) 212 conn->state != RXRPC_CONN_CLIENT) ||
220 conn->proto.epoch != rxnet->epoch) 213 conn->proto.epoch != rxnet->epoch)
221 goto mark_dont_reuse; 214 goto mark_dont_reuse;
222 215
223 /* The IDR tree gets very expensive on 216 /* The IDR tree gets very expensive on memory if the connection IDs are
224 * widely scattered throughout the num 217 * widely scattered throughout the number space, so we shall want to
225 * kill off connections that, say, hav 218 * kill off connections that, say, have an ID more than about four
226 * times the maximum number of client 219 * times the maximum number of client conns away from the current
227 * allocation point to try and keep th 220 * allocation point to try and keep the IDs concentrated.
228 */ 221 */
229 id_cursor = idr_get_cursor(&conn->loca 222 id_cursor = idr_get_cursor(&conn->local->conn_ids);
230 id = conn->proto.cid >> RXRPC_CIDSHIFT 223 id = conn->proto.cid >> RXRPC_CIDSHIFT;
231 distance = id - id_cursor; 224 distance = id - id_cursor;
232 if (distance < 0) 225 if (distance < 0)
233 distance = -distance; 226 distance = -distance;
234 limit = max_t(unsigned long, atomic_re 227 limit = max_t(unsigned long, atomic_read(&rxnet->nr_conns) * 4, 1024);
235 if (distance > limit) 228 if (distance > limit)
236 goto mark_dont_reuse; 229 goto mark_dont_reuse;
237 230
238 return true; 231 return true;
239 232
240 mark_dont_reuse: 233 mark_dont_reuse:
241 set_bit(RXRPC_CONN_DONT_REUSE, &conn-> 234 set_bit(RXRPC_CONN_DONT_REUSE, &conn->flags);
242 dont_reuse: 235 dont_reuse:
243 return false; 236 return false;
244 } 237 }
245 238
246 /* 239 /*
247 * Look up the conn bundle that matches the co 240 * Look up the conn bundle that matches the connection parameters, adding it if
248 * it doesn't yet exist. 241 * it doesn't yet exist.
249 */ 242 */
250 int rxrpc_look_up_bundle(struct rxrpc_call *ca 243 int rxrpc_look_up_bundle(struct rxrpc_call *call, gfp_t gfp)
251 { 244 {
252 struct rxrpc_bundle *bundle, *candidat 245 struct rxrpc_bundle *bundle, *candidate;
253 struct rxrpc_local *local = call->loca 246 struct rxrpc_local *local = call->local;
254 struct rb_node *p, **pp, *parent; 247 struct rb_node *p, **pp, *parent;
255 long diff; 248 long diff;
256 bool upgrade = test_bit(RXRPC_CALL_UPG 249 bool upgrade = test_bit(RXRPC_CALL_UPGRADE, &call->flags);
257 250
258 _enter("{%px,%x,%u,%u}", 251 _enter("{%px,%x,%u,%u}",
259 call->peer, key_serial(call->ke 252 call->peer, key_serial(call->key), call->security_level,
260 upgrade); 253 upgrade);
261 254
262 if (test_bit(RXRPC_CALL_EXCLUSIVE, &ca 255 if (test_bit(RXRPC_CALL_EXCLUSIVE, &call->flags)) {
263 call->bundle = rxrpc_alloc_bun 256 call->bundle = rxrpc_alloc_bundle(call, gfp);
264 return call->bundle ? 0 : -ENO 257 return call->bundle ? 0 : -ENOMEM;
265 } 258 }
266 259
267 /* First, see if the bundle is already 260 /* First, see if the bundle is already there. */
268 _debug("search 1"); 261 _debug("search 1");
269 spin_lock(&local->client_bundles_lock) 262 spin_lock(&local->client_bundles_lock);
270 p = local->client_bundles.rb_node; 263 p = local->client_bundles.rb_node;
271 while (p) { 264 while (p) {
272 bundle = rb_entry(p, struct rx 265 bundle = rb_entry(p, struct rxrpc_bundle, local_node);
273 266
274 #define cmp(X, Y) ((long)(X) - (long)(Y)) 267 #define cmp(X, Y) ((long)(X) - (long)(Y))
275 diff = (cmp(bundle->peer, call 268 diff = (cmp(bundle->peer, call->peer) ?:
276 cmp(bundle->key, call- 269 cmp(bundle->key, call->key) ?:
277 cmp(bundle->security_l 270 cmp(bundle->security_level, call->security_level) ?:
278 cmp(bundle->upgrade, u 271 cmp(bundle->upgrade, upgrade));
279 #undef cmp 272 #undef cmp
280 if (diff < 0) 273 if (diff < 0)
281 p = p->rb_left; 274 p = p->rb_left;
282 else if (diff > 0) 275 else if (diff > 0)
283 p = p->rb_right; 276 p = p->rb_right;
284 else 277 else
285 goto found_bundle; 278 goto found_bundle;
286 } 279 }
287 spin_unlock(&local->client_bundles_loc 280 spin_unlock(&local->client_bundles_lock);
288 _debug("not found"); 281 _debug("not found");
289 282
290 /* It wasn't. We need to add one. */ 283 /* It wasn't. We need to add one. */
291 candidate = rxrpc_alloc_bundle(call, g 284 candidate = rxrpc_alloc_bundle(call, gfp);
292 if (!candidate) 285 if (!candidate)
293 return -ENOMEM; 286 return -ENOMEM;
294 287
295 _debug("search 2"); 288 _debug("search 2");
296 spin_lock(&local->client_bundles_lock) 289 spin_lock(&local->client_bundles_lock);
297 pp = &local->client_bundles.rb_node; 290 pp = &local->client_bundles.rb_node;
298 parent = NULL; 291 parent = NULL;
299 while (*pp) { 292 while (*pp) {
300 parent = *pp; 293 parent = *pp;
301 bundle = rb_entry(parent, stru 294 bundle = rb_entry(parent, struct rxrpc_bundle, local_node);
302 295
303 #define cmp(X, Y) ((long)(X) - (long)(Y)) 296 #define cmp(X, Y) ((long)(X) - (long)(Y))
304 diff = (cmp(bundle->peer, call 297 diff = (cmp(bundle->peer, call->peer) ?:
305 cmp(bundle->key, call- 298 cmp(bundle->key, call->key) ?:
306 cmp(bundle->security_l 299 cmp(bundle->security_level, call->security_level) ?:
307 cmp(bundle->upgrade, u 300 cmp(bundle->upgrade, upgrade));
308 #undef cmp 301 #undef cmp
309 if (diff < 0) 302 if (diff < 0)
310 pp = &(*pp)->rb_left; 303 pp = &(*pp)->rb_left;
311 else if (diff > 0) 304 else if (diff > 0)
312 pp = &(*pp)->rb_right; 305 pp = &(*pp)->rb_right;
313 else 306 else
314 goto found_bundle_free 307 goto found_bundle_free;
315 } 308 }
316 309
317 _debug("new bundle"); 310 _debug("new bundle");
318 rb_link_node(&candidate->local_node, p 311 rb_link_node(&candidate->local_node, parent, pp);
319 rb_insert_color(&candidate->local_node 312 rb_insert_color(&candidate->local_node, &local->client_bundles);
320 call->bundle = rxrpc_get_bundle(candid 313 call->bundle = rxrpc_get_bundle(candidate, rxrpc_bundle_get_client_call);
321 spin_unlock(&local->client_bundles_loc 314 spin_unlock(&local->client_bundles_lock);
322 _leave(" = B=%u [new]", call->bundle-> 315 _leave(" = B=%u [new]", call->bundle->debug_id);
323 return 0; 316 return 0;
324 317
325 found_bundle_free: 318 found_bundle_free:
326 rxrpc_free_bundle(candidate); 319 rxrpc_free_bundle(candidate);
327 found_bundle: 320 found_bundle:
328 call->bundle = rxrpc_get_bundle(bundle 321 call->bundle = rxrpc_get_bundle(bundle, rxrpc_bundle_get_client_call);
329 rxrpc_activate_bundle(bundle); 322 rxrpc_activate_bundle(bundle);
330 spin_unlock(&local->client_bundles_loc 323 spin_unlock(&local->client_bundles_lock);
331 _leave(" = B=%u [found]", call->bundle 324 _leave(" = B=%u [found]", call->bundle->debug_id);
332 return 0; 325 return 0;
333 } 326 }
334 327
335 /* 328 /*
336 * Allocate a new connection and add it into a 329 * Allocate a new connection and add it into a bundle.
337 */ 330 */
338 static bool rxrpc_add_conn_to_bundle(struct rx 331 static bool rxrpc_add_conn_to_bundle(struct rxrpc_bundle *bundle,
339 unsigned 332 unsigned int slot)
340 { 333 {
341 struct rxrpc_connection *conn, *old; 334 struct rxrpc_connection *conn, *old;
342 unsigned int shift = slot * RXRPC_MAXC 335 unsigned int shift = slot * RXRPC_MAXCALLS;
343 unsigned int i; 336 unsigned int i;
344 337
345 old = bundle->conns[slot]; 338 old = bundle->conns[slot];
346 if (old) { 339 if (old) {
347 bundle->conns[slot] = NULL; 340 bundle->conns[slot] = NULL;
348 bundle->conn_ids[slot] = 0; <<
349 trace_rxrpc_client(old, -1, rx 341 trace_rxrpc_client(old, -1, rxrpc_client_replace);
350 rxrpc_put_connection(old, rxrp 342 rxrpc_put_connection(old, rxrpc_conn_put_noreuse);
351 } 343 }
352 344
353 conn = rxrpc_alloc_client_connection(b 345 conn = rxrpc_alloc_client_connection(bundle);
354 if (IS_ERR(conn)) { 346 if (IS_ERR(conn)) {
355 bundle->alloc_error = PTR_ERR( 347 bundle->alloc_error = PTR_ERR(conn);
356 return false; 348 return false;
357 } 349 }
358 350
359 rxrpc_activate_bundle(bundle); 351 rxrpc_activate_bundle(bundle);
360 conn->bundle_shift = shift; 352 conn->bundle_shift = shift;
361 bundle->conns[slot] = conn; 353 bundle->conns[slot] = conn;
362 bundle->conn_ids[slot] = conn->debug_i <<
363 for (i = 0; i < RXRPC_MAXCALLS; i++) 354 for (i = 0; i < RXRPC_MAXCALLS; i++)
364 set_bit(shift + i, &bundle->av 355 set_bit(shift + i, &bundle->avail_chans);
365 return true; 356 return true;
366 } 357 }
367 358
368 /* 359 /*
369 * Add a connection to a bundle if there are n 360 * Add a connection to a bundle if there are no usable connections or we have
370 * connections waiting for extra capacity. 361 * connections waiting for extra capacity.
371 */ 362 */
372 static bool rxrpc_bundle_has_space(struct rxrp 363 static bool rxrpc_bundle_has_space(struct rxrpc_bundle *bundle)
373 { 364 {
374 int slot = -1, i, usable; 365 int slot = -1, i, usable;
375 366
376 _enter(""); 367 _enter("");
377 368
378 bundle->alloc_error = 0; 369 bundle->alloc_error = 0;
379 370
380 /* See if there are any usable connect 371 /* See if there are any usable connections. */
381 usable = 0; 372 usable = 0;
382 for (i = 0; i < ARRAY_SIZE(bundle->con 373 for (i = 0; i < ARRAY_SIZE(bundle->conns); i++) {
383 if (rxrpc_may_reuse_conn(bundl 374 if (rxrpc_may_reuse_conn(bundle->conns[i]))
384 usable++; 375 usable++;
385 else if (slot == -1) 376 else if (slot == -1)
386 slot = i; 377 slot = i;
387 } 378 }
388 379
389 if (!usable && bundle->upgrade) 380 if (!usable && bundle->upgrade)
390 bundle->try_upgrade = true; 381 bundle->try_upgrade = true;
391 382
392 if (!usable) 383 if (!usable)
393 goto alloc_conn; 384 goto alloc_conn;
394 385
395 if (!bundle->avail_chans && 386 if (!bundle->avail_chans &&
396 !bundle->try_upgrade && 387 !bundle->try_upgrade &&
397 usable < ARRAY_SIZE(bundle->conns) 388 usable < ARRAY_SIZE(bundle->conns))
398 goto alloc_conn; 389 goto alloc_conn;
399 390
400 _leave(""); 391 _leave("");
401 return usable; 392 return usable;
402 393
403 alloc_conn: 394 alloc_conn:
404 return slot >= 0 ? rxrpc_add_conn_to_b 395 return slot >= 0 ? rxrpc_add_conn_to_bundle(bundle, slot) : false;
405 } 396 }
406 397
407 /* 398 /*
408 * Assign a channel to the call at the front o 399 * 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 u 400 * We don't increment the callNumber counter until this number has been exposed
410 * to the world. 401 * to the world.
411 */ 402 */
412 static void rxrpc_activate_one_channel(struct 403 static void rxrpc_activate_one_channel(struct rxrpc_connection *conn,
413 unsigne 404 unsigned int channel)
414 { 405 {
415 struct rxrpc_channel *chan = &conn->ch 406 struct rxrpc_channel *chan = &conn->channels[channel];
416 struct rxrpc_bundle *bundle = conn->bu 407 struct rxrpc_bundle *bundle = conn->bundle;
417 struct rxrpc_call *call = list_entry(b 408 struct rxrpc_call *call = list_entry(bundle->waiting_calls.next,
418 s 409 struct rxrpc_call, wait_link);
419 u32 call_id = chan->call_counter + 1; 410 u32 call_id = chan->call_counter + 1;
420 411
421 _enter("C=%x,%u", conn->debug_id, chan 412 _enter("C=%x,%u", conn->debug_id, channel);
422 413
423 list_del_init(&call->wait_link); 414 list_del_init(&call->wait_link);
424 415
425 trace_rxrpc_client(conn, channel, rxrp 416 trace_rxrpc_client(conn, channel, rxrpc_client_chan_activate);
426 417
427 /* Cancel the final ACK on the previou 418 /* Cancel the final ACK on the previous call if it hasn't been sent yet
428 * as the DATA packet will implicitly 419 * as the DATA packet will implicitly ACK it.
429 */ 420 */
430 clear_bit(RXRPC_CONN_FINAL_ACK_0 + cha 421 clear_bit(RXRPC_CONN_FINAL_ACK_0 + channel, &conn->flags);
431 clear_bit(conn->bundle_shift + channel 422 clear_bit(conn->bundle_shift + channel, &bundle->avail_chans);
432 423
433 rxrpc_see_call(call, rxrpc_call_see_ac 424 rxrpc_see_call(call, rxrpc_call_see_activate_client);
434 call->conn = rxrpc_get_connection 425 call->conn = rxrpc_get_connection(conn, rxrpc_conn_get_activate_call);
435 call->cid = conn->proto.cid | ch 426 call->cid = conn->proto.cid | channel;
436 call->call_id = call_id; 427 call->call_id = call_id;
437 call->dest_srx.srx_service = conn->ser 428 call->dest_srx.srx_service = conn->service_id;
438 call->cong_ssthresh = call->peer->cong 429 call->cong_ssthresh = call->peer->cong_ssthresh;
439 if (call->cong_cwnd >= call->cong_ssth 430 if (call->cong_cwnd >= call->cong_ssthresh)
440 call->cong_mode = RXRPC_CALL_C 431 call->cong_mode = RXRPC_CALL_CONGEST_AVOIDANCE;
441 else 432 else
442 call->cong_mode = RXRPC_CALL_S 433 call->cong_mode = RXRPC_CALL_SLOW_START;
443 434
444 chan->call_id = call_id; 435 chan->call_id = call_id;
445 chan->call_debug_id = call->debug_ 436 chan->call_debug_id = call->debug_id;
446 chan->call = call; 437 chan->call = call;
447 438
448 rxrpc_see_call(call, rxrpc_call_see_co 439 rxrpc_see_call(call, rxrpc_call_see_connected);
449 trace_rxrpc_connect_call(call); 440 trace_rxrpc_connect_call(call);
450 call->tx_last_sent = ktime_get_real(); 441 call->tx_last_sent = ktime_get_real();
451 rxrpc_start_call_timer(call); 442 rxrpc_start_call_timer(call);
452 rxrpc_set_call_state(call, RXRPC_CALL_ 443 rxrpc_set_call_state(call, RXRPC_CALL_CLIENT_SEND_REQUEST);
453 wake_up(&call->waitq); 444 wake_up(&call->waitq);
454 } 445 }
455 446
456 /* 447 /*
457 * Remove a connection from the idle list if i 448 * Remove a connection from the idle list if it's on it.
458 */ 449 */
459 static void rxrpc_unidle_conn(struct rxrpc_con 450 static void rxrpc_unidle_conn(struct rxrpc_connection *conn)
460 { 451 {
461 if (!list_empty(&conn->cache_link)) { 452 if (!list_empty(&conn->cache_link)) {
462 list_del_init(&conn->cache_lin 453 list_del_init(&conn->cache_link);
463 rxrpc_put_connection(conn, rxr 454 rxrpc_put_connection(conn, rxrpc_conn_put_unidle);
464 } 455 }
465 } 456 }
466 457
467 /* 458 /*
468 * Assign channels and callNumbers to waiting 459 * Assign channels and callNumbers to waiting calls.
469 */ 460 */
470 static void rxrpc_activate_channels(struct rxr 461 static void rxrpc_activate_channels(struct rxrpc_bundle *bundle)
471 { 462 {
472 struct rxrpc_connection *conn; 463 struct rxrpc_connection *conn;
473 unsigned long avail, mask; 464 unsigned long avail, mask;
474 unsigned int channel, slot; 465 unsigned int channel, slot;
475 466
476 trace_rxrpc_client(NULL, -1, rxrpc_cli 467 trace_rxrpc_client(NULL, -1, rxrpc_client_activate_chans);
477 468
478 if (bundle->try_upgrade) 469 if (bundle->try_upgrade)
479 mask = 1; 470 mask = 1;
480 else 471 else
481 mask = ULONG_MAX; 472 mask = ULONG_MAX;
482 473
483 while (!list_empty(&bundle->waiting_ca 474 while (!list_empty(&bundle->waiting_calls)) {
484 avail = bundle->avail_chans & 475 avail = bundle->avail_chans & mask;
485 if (!avail) 476 if (!avail)
486 break; 477 break;
487 channel = __ffs(avail); 478 channel = __ffs(avail);
488 clear_bit(channel, &bundle->av 479 clear_bit(channel, &bundle->avail_chans);
489 480
490 slot = channel / RXRPC_MAXCALL 481 slot = channel / RXRPC_MAXCALLS;
491 conn = bundle->conns[slot]; 482 conn = bundle->conns[slot];
492 if (!conn) 483 if (!conn)
493 break; 484 break;
494 485
495 if (bundle->try_upgrade) 486 if (bundle->try_upgrade)
496 set_bit(RXRPC_CONN_PRO 487 set_bit(RXRPC_CONN_PROBING_FOR_UPGRADE, &conn->flags);
497 rxrpc_unidle_conn(conn); 488 rxrpc_unidle_conn(conn);
498 489
499 channel &= (RXRPC_MAXCALLS - 1 490 channel &= (RXRPC_MAXCALLS - 1);
500 conn->act_chans |= 1 << channe 491 conn->act_chans |= 1 << channel;
501 rxrpc_activate_one_channel(con 492 rxrpc_activate_one_channel(conn, channel);
502 } 493 }
503 } 494 }
504 495
505 /* 496 /*
506 * Connect waiting channels (called from the I 497 * Connect waiting channels (called from the I/O thread).
507 */ 498 */
508 void rxrpc_connect_client_calls(struct rxrpc_l 499 void rxrpc_connect_client_calls(struct rxrpc_local *local)
509 { 500 {
510 struct rxrpc_call *call; 501 struct rxrpc_call *call;
511 502
512 while ((call = list_first_entry_or_nul 503 while ((call = list_first_entry_or_null(&local->new_client_calls,
513 504 struct rxrpc_call, wait_link))
514 ) { 505 ) {
515 struct rxrpc_bundle *bundle = 506 struct rxrpc_bundle *bundle = call->bundle;
516 507
517 spin_lock(&local->client_call_ 508 spin_lock(&local->client_call_lock);
518 list_move_tail(&call->wait_lin 509 list_move_tail(&call->wait_link, &bundle->waiting_calls);
519 rxrpc_see_call(call, rxrpc_cal <<
520 spin_unlock(&local->client_cal 510 spin_unlock(&local->client_call_lock);
521 511
522 if (rxrpc_bundle_has_space(bun 512 if (rxrpc_bundle_has_space(bundle))
523 rxrpc_activate_channel 513 rxrpc_activate_channels(bundle);
524 } 514 }
525 } 515 }
526 516
527 /* 517 /*
528 * Note that a call, and thus a connection, is 518 * Note that a call, and thus a connection, is about to be exposed to the
529 * world. 519 * world.
530 */ 520 */
531 void rxrpc_expose_client_call(struct rxrpc_cal 521 void rxrpc_expose_client_call(struct rxrpc_call *call)
532 { 522 {
533 unsigned int channel = call->cid & RXR 523 unsigned int channel = call->cid & RXRPC_CHANNELMASK;
534 struct rxrpc_connection *conn = call-> 524 struct rxrpc_connection *conn = call->conn;
535 struct rxrpc_channel *chan = &conn->ch 525 struct rxrpc_channel *chan = &conn->channels[channel];
536 526
537 if (!test_and_set_bit(RXRPC_CALL_EXPOS 527 if (!test_and_set_bit(RXRPC_CALL_EXPOSED, &call->flags)) {
538 /* Mark the call ID as being u 528 /* Mark the call ID as being used. If the callNumber counter
539 * exceeds ~2 billion, we kill 529 * exceeds ~2 billion, we kill the connection after its
540 * outstanding calls have fini 530 * outstanding calls have finished so that the counter doesn't
541 * wrap. 531 * wrap.
542 */ 532 */
543 chan->call_counter++; 533 chan->call_counter++;
544 if (chan->call_counter >= INT_ 534 if (chan->call_counter >= INT_MAX)
545 set_bit(RXRPC_CONN_DON 535 set_bit(RXRPC_CONN_DONT_REUSE, &conn->flags);
546 trace_rxrpc_client(conn, chann 536 trace_rxrpc_client(conn, channel, rxrpc_client_exposed);
547 537
548 spin_lock(&call->peer->lock); 538 spin_lock(&call->peer->lock);
549 hlist_add_head(&call->error_li 539 hlist_add_head(&call->error_link, &call->peer->error_targets);
550 spin_unlock(&call->peer->lock) 540 spin_unlock(&call->peer->lock);
551 } 541 }
552 } 542 }
553 543
554 /* 544 /*
555 * Set the reap timer. 545 * Set the reap timer.
556 */ 546 */
557 static void rxrpc_set_client_reap_timer(struct 547 static void rxrpc_set_client_reap_timer(struct rxrpc_local *local)
558 { 548 {
559 if (!local->kill_all_client_conns) { 549 if (!local->kill_all_client_conns) {
560 unsigned long now = jiffies; 550 unsigned long now = jiffies;
561 unsigned long reap_at = now + 551 unsigned long reap_at = now + rxrpc_conn_idle_client_expiry;
562 552
563 if (local->rxnet->live) 553 if (local->rxnet->live)
564 timer_reduce(&local->c 554 timer_reduce(&local->client_conn_reap_timer, reap_at);
565 } 555 }
566 } 556 }
567 557
568 /* 558 /*
569 * Disconnect a client call. 559 * Disconnect a client call.
570 */ 560 */
571 void rxrpc_disconnect_client_call(struct rxrpc 561 void rxrpc_disconnect_client_call(struct rxrpc_bundle *bundle, struct rxrpc_call *call)
572 { 562 {
573 struct rxrpc_connection *conn; 563 struct rxrpc_connection *conn;
574 struct rxrpc_channel *chan = NULL; 564 struct rxrpc_channel *chan = NULL;
575 struct rxrpc_local *local = bundle->lo 565 struct rxrpc_local *local = bundle->local;
576 unsigned int channel; 566 unsigned int channel;
577 bool may_reuse; 567 bool may_reuse;
578 u32 cid; 568 u32 cid;
579 569
580 _enter("c=%x", call->debug_id); 570 _enter("c=%x", call->debug_id);
581 571
582 /* Calls that have never actually been 572 /* Calls that have never actually been assigned a channel can simply be
583 * discarded. 573 * discarded.
584 */ 574 */
585 conn = call->conn; 575 conn = call->conn;
586 if (!conn) { 576 if (!conn) {
587 _debug("call is waiting"); 577 _debug("call is waiting");
588 ASSERTCMP(call->call_id, ==, 0 578 ASSERTCMP(call->call_id, ==, 0);
589 ASSERT(!test_bit(RXRPC_CALL_EX 579 ASSERT(!test_bit(RXRPC_CALL_EXPOSED, &call->flags));
590 /* May still be on ->new_clien <<
591 spin_lock(&local->client_call_ <<
592 list_del_init(&call->wait_link 580 list_del_init(&call->wait_link);
593 spin_unlock(&local->client_cal <<
594 return; 581 return;
595 } 582 }
596 583
597 cid = call->cid; 584 cid = call->cid;
598 channel = cid & RXRPC_CHANNELMASK; 585 channel = cid & RXRPC_CHANNELMASK;
599 chan = &conn->channels[channel]; 586 chan = &conn->channels[channel];
600 trace_rxrpc_client(conn, channel, rxrp 587 trace_rxrpc_client(conn, channel, rxrpc_client_chan_disconnect);
601 588
602 if (WARN_ON(chan->call != call)) 589 if (WARN_ON(chan->call != call))
603 return; 590 return;
604 591
605 may_reuse = rxrpc_may_reuse_conn(conn) 592 may_reuse = rxrpc_may_reuse_conn(conn);
606 593
607 /* If a client call was exposed to the 594 /* If a client call was exposed to the world, we save the result for
608 * retransmission. 595 * retransmission.
609 * 596 *
610 * We use a barrier here so that the c 597 * We use a barrier here so that the call number and abort code can be
611 * read without needing to take a lock 598 * read without needing to take a lock.
612 * 599 *
613 * TODO: Make the incoming packet hand 600 * TODO: Make the incoming packet handler check this and handle
614 * terminal retransmission without req 601 * terminal retransmission without requiring access to the call.
615 */ 602 */
616 if (test_bit(RXRPC_CALL_EXPOSED, &call 603 if (test_bit(RXRPC_CALL_EXPOSED, &call->flags)) {
617 _debug("exposed %u,%u", call-> 604 _debug("exposed %u,%u", call->call_id, call->abort_code);
618 __rxrpc_disconnect_call(conn, 605 __rxrpc_disconnect_call(conn, call);
619 606
620 if (test_and_clear_bit(RXRPC_C 607 if (test_and_clear_bit(RXRPC_CONN_PROBING_FOR_UPGRADE, &conn->flags)) {
621 trace_rxrpc_client(con 608 trace_rxrpc_client(conn, channel, rxrpc_client_to_active);
622 bundle->try_upgrade = 609 bundle->try_upgrade = false;
623 if (may_reuse) 610 if (may_reuse)
624 rxrpc_activate 611 rxrpc_activate_channels(bundle);
625 } 612 }
626 } 613 }
627 614
628 /* See if we can pass the channel dire 615 /* See if we can pass the channel directly to another call. */
629 if (may_reuse && !list_empty(&bundle-> 616 if (may_reuse && !list_empty(&bundle->waiting_calls)) {
630 trace_rxrpc_client(conn, chann 617 trace_rxrpc_client(conn, channel, rxrpc_client_chan_pass);
631 rxrpc_activate_one_channel(con 618 rxrpc_activate_one_channel(conn, channel);
632 return; 619 return;
633 } 620 }
634 621
635 /* Schedule the final ACK to be transm 622 /* Schedule the final ACK to be transmitted in a short while so that it
636 * can be skipped if we find a follow- 623 * can be skipped if we find a follow-on call. The first DATA packet
637 * of the follow on call will implicit 624 * of the follow on call will implicitly ACK this call.
638 */ 625 */
639 if (call->completion == RXRPC_CALL_SUC 626 if (call->completion == RXRPC_CALL_SUCCEEDED &&
640 test_bit(RXRPC_CALL_EXPOSED, &call 627 test_bit(RXRPC_CALL_EXPOSED, &call->flags)) {
641 unsigned long final_ack_at = j 628 unsigned long final_ack_at = jiffies + 2;
642 629
643 chan->final_ack_at = final_ack !! 630 WRITE_ONCE(chan->final_ack_at, final_ack_at);
644 smp_wmb(); /* vs rxrpc_process 631 smp_wmb(); /* vs rxrpc_process_delayed_final_acks() */
645 set_bit(RXRPC_CONN_FINAL_ACK_0 632 set_bit(RXRPC_CONN_FINAL_ACK_0 + channel, &conn->flags);
646 rxrpc_reduce_conn_timer(conn, 633 rxrpc_reduce_conn_timer(conn, final_ack_at);
647 } 634 }
648 635
649 /* Deactivate the channel. */ 636 /* Deactivate the channel. */
650 chan->call = NULL; 637 chan->call = NULL;
651 set_bit(conn->bundle_shift + channel, 638 set_bit(conn->bundle_shift + channel, &conn->bundle->avail_chans);
652 conn->act_chans &= ~(1 << channel); 639 conn->act_chans &= ~(1 << channel);
653 640
654 /* If no channels remain active, then 641 /* If no channels remain active, then put the connection on the idle
655 * list for a short while. Give it a 642 * list for a short while. Give it a ref to stop it going away if it
656 * becomes unbundled. 643 * becomes unbundled.
657 */ 644 */
658 if (!conn->act_chans) { 645 if (!conn->act_chans) {
659 trace_rxrpc_client(conn, chann 646 trace_rxrpc_client(conn, channel, rxrpc_client_to_idle);
660 conn->idle_timestamp = jiffies 647 conn->idle_timestamp = jiffies;
661 648
662 rxrpc_get_connection(conn, rxr 649 rxrpc_get_connection(conn, rxrpc_conn_get_idle);
663 list_move_tail(&conn->cache_li 650 list_move_tail(&conn->cache_link, &local->idle_client_conns);
664 651
665 rxrpc_set_client_reap_timer(lo 652 rxrpc_set_client_reap_timer(local);
666 } 653 }
667 } 654 }
668 655
669 /* 656 /*
670 * Remove a connection from a bundle. 657 * Remove a connection from a bundle.
671 */ 658 */
672 static void rxrpc_unbundle_conn(struct rxrpc_c 659 static void rxrpc_unbundle_conn(struct rxrpc_connection *conn)
673 { 660 {
674 struct rxrpc_bundle *bundle = conn->bu 661 struct rxrpc_bundle *bundle = conn->bundle;
675 unsigned int bindex; 662 unsigned int bindex;
676 int i; 663 int i;
677 664
678 _enter("C=%x", conn->debug_id); 665 _enter("C=%x", conn->debug_id);
679 666
680 if (conn->flags & RXRPC_CONN_FINAL_ACK 667 if (conn->flags & RXRPC_CONN_FINAL_ACK_MASK)
681 rxrpc_process_delayed_final_ac 668 rxrpc_process_delayed_final_acks(conn, true);
682 669
683 bindex = conn->bundle_shift / RXRPC_MA 670 bindex = conn->bundle_shift / RXRPC_MAXCALLS;
684 if (bundle->conns[bindex] == conn) { 671 if (bundle->conns[bindex] == conn) {
685 _debug("clear slot %u", bindex 672 _debug("clear slot %u", bindex);
686 bundle->conns[bindex] = NULL; 673 bundle->conns[bindex] = NULL;
687 bundle->conn_ids[bindex] = 0; <<
688 for (i = 0; i < RXRPC_MAXCALLS 674 for (i = 0; i < RXRPC_MAXCALLS; i++)
689 clear_bit(conn->bundle 675 clear_bit(conn->bundle_shift + i, &bundle->avail_chans);
690 rxrpc_put_client_connection_id 676 rxrpc_put_client_connection_id(bundle->local, conn);
691 rxrpc_deactivate_bundle(bundle 677 rxrpc_deactivate_bundle(bundle);
692 rxrpc_put_connection(conn, rxr 678 rxrpc_put_connection(conn, rxrpc_conn_put_unbundle);
693 } 679 }
694 } 680 }
695 681
696 /* 682 /*
697 * Drop the active count on a bundle. 683 * Drop the active count on a bundle.
698 */ 684 */
699 void rxrpc_deactivate_bundle(struct rxrpc_bund 685 void rxrpc_deactivate_bundle(struct rxrpc_bundle *bundle)
700 { 686 {
701 struct rxrpc_local *local; 687 struct rxrpc_local *local;
702 bool need_put = false; 688 bool need_put = false;
703 689
704 if (!bundle) 690 if (!bundle)
705 return; 691 return;
706 692
707 local = bundle->local; 693 local = bundle->local;
708 if (atomic_dec_and_lock(&bundle->activ 694 if (atomic_dec_and_lock(&bundle->active, &local->client_bundles_lock)) {
709 if (!bundle->exclusive) { 695 if (!bundle->exclusive) {
710 _debug("erase bundle") 696 _debug("erase bundle");
711 rb_erase(&bundle->loca 697 rb_erase(&bundle->local_node, &local->client_bundles);
712 need_put = true; 698 need_put = true;
713 } 699 }
714 700
715 spin_unlock(&local->client_bun 701 spin_unlock(&local->client_bundles_lock);
716 if (need_put) 702 if (need_put)
717 rxrpc_put_bundle(bundl 703 rxrpc_put_bundle(bundle, rxrpc_bundle_put_discard);
718 } 704 }
719 } 705 }
720 706
721 /* 707 /*
722 * Clean up a dead client connection. 708 * Clean up a dead client connection.
723 */ 709 */
724 void rxrpc_kill_client_conn(struct rxrpc_conne 710 void rxrpc_kill_client_conn(struct rxrpc_connection *conn)
725 { 711 {
726 struct rxrpc_local *local = conn->loca 712 struct rxrpc_local *local = conn->local;
727 struct rxrpc_net *rxnet = local->rxnet 713 struct rxrpc_net *rxnet = local->rxnet;
728 714
729 _enter("C=%x", conn->debug_id); 715 _enter("C=%x", conn->debug_id);
730 716
731 trace_rxrpc_client(conn, -1, rxrpc_cli 717 trace_rxrpc_client(conn, -1, rxrpc_client_cleanup);
732 atomic_dec(&rxnet->nr_client_conns); 718 atomic_dec(&rxnet->nr_client_conns);
733 719
734 rxrpc_put_client_connection_id(local, 720 rxrpc_put_client_connection_id(local, conn);
735 } 721 }
736 722
737 /* 723 /*
738 * Discard expired client connections from the 724 * Discard expired client connections from the idle list. Each conn in the
739 * idle list has been exposed and holds an ext 725 * idle list has been exposed and holds an extra ref because of that.
740 * 726 *
741 * This may be called from conn setup or from 727 * This may be called from conn setup or from a work item so cannot be
742 * considered non-reentrant. 728 * considered non-reentrant.
743 */ 729 */
744 void rxrpc_discard_expired_client_conns(struct 730 void rxrpc_discard_expired_client_conns(struct rxrpc_local *local)
745 { 731 {
746 struct rxrpc_connection *conn; 732 struct rxrpc_connection *conn;
747 unsigned long expiry, conn_expires_at, 733 unsigned long expiry, conn_expires_at, now;
748 unsigned int nr_conns; 734 unsigned int nr_conns;
749 735
750 _enter(""); 736 _enter("");
751 737
752 /* We keep an estimate of what the num 738 /* We keep an estimate of what the number of conns ought to be after
753 * we've discarded some so that we don 739 * we've discarded some so that we don't overdo the discarding.
754 */ 740 */
755 nr_conns = atomic_read(&local->rxnet-> 741 nr_conns = atomic_read(&local->rxnet->nr_client_conns);
756 742
757 next: 743 next:
758 conn = list_first_entry_or_null(&local 744 conn = list_first_entry_or_null(&local->idle_client_conns,
759 struct 745 struct rxrpc_connection, cache_link);
760 if (!conn) 746 if (!conn)
761 return; 747 return;
762 748
763 if (!local->kill_all_client_conns) { 749 if (!local->kill_all_client_conns) {
764 /* If the number of connection 750 /* If the number of connections is over the reap limit, we
765 * expedite discard by reducin 751 * expedite discard by reducing the expiry timeout. We must,
766 * however, have at least a sh 752 * however, have at least a short grace period to be able to do
767 * final-ACK or ABORT retransm 753 * final-ACK or ABORT retransmission.
768 */ 754 */
769 expiry = rxrpc_conn_idle_clien 755 expiry = rxrpc_conn_idle_client_expiry;
770 if (nr_conns > rxrpc_reap_clie 756 if (nr_conns > rxrpc_reap_client_connections)
771 expiry = rxrpc_conn_id 757 expiry = rxrpc_conn_idle_client_fast_expiry;
772 if (conn->local->service_close 758 if (conn->local->service_closed)
773 expiry = rxrpc_closed_ 759 expiry = rxrpc_closed_conn_expiry * HZ;
774 760
775 conn_expires_at = conn->idle_t 761 conn_expires_at = conn->idle_timestamp + expiry;
776 762
777 now = jiffies; !! 763 now = READ_ONCE(jiffies);
778 if (time_after(conn_expires_at 764 if (time_after(conn_expires_at, now))
779 goto not_yet_expired; 765 goto not_yet_expired;
780 } 766 }
781 767
782 atomic_dec(&conn->active); 768 atomic_dec(&conn->active);
783 trace_rxrpc_client(conn, -1, rxrpc_cli 769 trace_rxrpc_client(conn, -1, rxrpc_client_discard);
784 list_del_init(&conn->cache_link); 770 list_del_init(&conn->cache_link);
785 771
786 rxrpc_unbundle_conn(conn); 772 rxrpc_unbundle_conn(conn);
787 /* Drop the ->cache_link ref */ 773 /* Drop the ->cache_link ref */
788 rxrpc_put_connection(conn, rxrpc_conn_ 774 rxrpc_put_connection(conn, rxrpc_conn_put_discard_idle);
789 775
790 nr_conns--; 776 nr_conns--;
791 goto next; 777 goto next;
792 778
793 not_yet_expired: 779 not_yet_expired:
794 /* The connection at the front of the 780 /* The connection at the front of the queue hasn't yet expired, so
795 * schedule the work item for that poi 781 * schedule the work item for that point if we discarded something.
796 * 782 *
797 * We don't worry if the work item is 783 * We don't worry if the work item is already scheduled - it can look
798 * after rescheduling itself at a late 784 * after rescheduling itself at a later time. We could cancel it, but
799 * then things get messier. 785 * then things get messier.
800 */ 786 */
801 _debug("not yet"); 787 _debug("not yet");
802 if (!local->kill_all_client_conns) 788 if (!local->kill_all_client_conns)
803 timer_reduce(&local->client_co 789 timer_reduce(&local->client_conn_reap_timer, conn_expires_at);
804 790
805 _leave(""); 791 _leave("");
806 } 792 }
807 793
808 /* 794 /*
809 * Clean up the client connections on a local 795 * Clean up the client connections on a local endpoint.
810 */ 796 */
811 void rxrpc_clean_up_local_conns(struct rxrpc_l 797 void rxrpc_clean_up_local_conns(struct rxrpc_local *local)
812 { 798 {
813 struct rxrpc_connection *conn; 799 struct rxrpc_connection *conn;
814 800
815 _enter(""); 801 _enter("");
816 802
817 local->kill_all_client_conns = true; 803 local->kill_all_client_conns = true;
818 804
819 del_timer_sync(&local->client_conn_rea 805 del_timer_sync(&local->client_conn_reap_timer);
820 806
821 while ((conn = list_first_entry_or_nul 807 while ((conn = list_first_entry_or_null(&local->idle_client_conns,
822 808 struct rxrpc_connection, cache_link))) {
823 list_del_init(&conn->cache_lin 809 list_del_init(&conn->cache_link);
824 atomic_dec(&conn->active); 810 atomic_dec(&conn->active);
825 trace_rxrpc_client(conn, -1, r 811 trace_rxrpc_client(conn, -1, rxrpc_client_discard);
826 rxrpc_unbundle_conn(conn); 812 rxrpc_unbundle_conn(conn);
827 rxrpc_put_connection(conn, rxr 813 rxrpc_put_connection(conn, rxrpc_conn_put_local_dead);
828 } 814 }
829 815
830 _leave(" [culled]"); 816 _leave(" [culled]");
831 } 817 }
832 818
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.