Commit | Line | Data |
---|---|---|
2874c5fd | 1 | // SPDX-License-Identifier: GPL-2.0-or-later |
ec26815a | 2 | /* AFS cell and server record management |
1da177e4 | 3 | * |
989782dc | 4 | * Copyright (C) 2002, 2017 Red Hat, Inc. All Rights Reserved. |
1da177e4 | 5 | * Written by David Howells (dhowells@redhat.com) |
1da177e4 LT |
6 | */ |
7 | ||
1da177e4 | 8 | #include <linux/slab.h> |
00d3b7a4 DH |
9 | #include <linux/key.h> |
10 | #include <linux/ctype.h> | |
07567a55 | 11 | #include <linux/dns_resolver.h> |
e8edc6e0 | 12 | #include <linux/sched.h> |
3838d3ec | 13 | #include <linux/inet.h> |
0da0b7fd | 14 | #include <linux/namei.h> |
00d3b7a4 | 15 | #include <keys/rxrpc-type.h> |
1da177e4 LT |
16 | #include "internal.h" |
17 | ||
fe342cf7 | 18 | static unsigned __read_mostly afs_cell_gc_delay = 10; |
ded2f4c5 DH |
19 | static unsigned __read_mostly afs_cell_min_ttl = 10 * 60; |
20 | static unsigned __read_mostly afs_cell_max_ttl = 24 * 60 * 60; | |
989782dc DH |
21 | |
22 | static void afs_manage_cell(struct work_struct *); | |
23 | ||
24 | static void afs_dec_cells_outstanding(struct afs_net *net) | |
25 | { | |
26 | if (atomic_dec_and_test(&net->cells_outstanding)) | |
ab1fbe32 | 27 | wake_up_var(&net->cells_outstanding); |
989782dc DH |
28 | } |
29 | ||
1da177e4 | 30 | /* |
989782dc DH |
31 | * Set the cell timer to fire after a given delay, assuming it's not already |
32 | * set for an earlier time. | |
1da177e4 | 33 | */ |
989782dc | 34 | static void afs_set_cell_timer(struct afs_net *net, time64_t delay) |
1da177e4 | 35 | { |
989782dc DH |
36 | if (net->live) { |
37 | atomic_inc(&net->cells_outstanding); | |
38 | if (timer_reduce(&net->cells_timer, jiffies + delay * HZ)) | |
39 | afs_dec_cells_outstanding(net); | |
40 | } | |
41 | } | |
42 | ||
43 | /* | |
44 | * Look up and get an activation reference on a cell record under RCU | |
45 | * conditions. The caller must hold the RCU read lock. | |
46 | */ | |
47 | struct afs_cell *afs_lookup_cell_rcu(struct afs_net *net, | |
48 | const char *name, unsigned int namesz) | |
49 | { | |
50 | struct afs_cell *cell = NULL; | |
51 | struct rb_node *p; | |
52 | int n, seq = 0, ret = 0; | |
53 | ||
54 | _enter("%*.*s", namesz, namesz, name); | |
55 | ||
56 | if (name && namesz == 0) | |
57 | return ERR_PTR(-EINVAL); | |
58 | if (namesz > AFS_MAXCELLNAME) | |
59 | return ERR_PTR(-ENAMETOOLONG); | |
60 | ||
61 | do { | |
62 | /* Unfortunately, rbtree walking doesn't give reliable results | |
63 | * under just the RCU read lock, so we have to check for | |
64 | * changes. | |
65 | */ | |
66 | if (cell) | |
67 | afs_put_cell(net, cell); | |
68 | cell = NULL; | |
69 | ret = -ENOENT; | |
70 | ||
71 | read_seqbegin_or_lock(&net->cells_lock, &seq); | |
72 | ||
73 | if (!name) { | |
74 | cell = rcu_dereference_raw(net->ws_cell); | |
75 | if (cell) { | |
76 | afs_get_cell(cell); | |
a5fb8e6c | 77 | ret = 0; |
fe342cf7 | 78 | break; |
989782dc DH |
79 | } |
80 | ret = -EDESTADDRREQ; | |
81 | continue; | |
82 | } | |
83 | ||
84 | p = rcu_dereference_raw(net->cells.rb_node); | |
85 | while (p) { | |
86 | cell = rb_entry(p, struct afs_cell, net_node); | |
87 | ||
88 | n = strncasecmp(cell->name, name, | |
89 | min_t(size_t, cell->name_len, namesz)); | |
90 | if (n == 0) | |
91 | n = cell->name_len - namesz; | |
92 | if (n < 0) { | |
93 | p = rcu_dereference_raw(p->rb_left); | |
94 | } else if (n > 0) { | |
95 | p = rcu_dereference_raw(p->rb_right); | |
96 | } else { | |
97 | if (atomic_inc_not_zero(&cell->usage)) { | |
98 | ret = 0; | |
99 | break; | |
100 | } | |
101 | /* We want to repeat the search, this time with | |
102 | * the lock properly locked. | |
103 | */ | |
104 | } | |
105 | cell = NULL; | |
106 | } | |
1da177e4 | 107 | |
989782dc | 108 | } while (need_seqretry(&net->cells_lock, seq)); |
1da177e4 | 109 | |
989782dc | 110 | done_seqretry(&net->cells_lock, seq); |
1da177e4 | 111 | |
a5fb8e6c DH |
112 | if (ret != 0 && cell) |
113 | afs_put_cell(net, cell); | |
114 | ||
989782dc DH |
115 | return ret == 0 ? cell : ERR_PTR(ret); |
116 | } | |
117 | ||
118 | /* | |
119 | * Set up a cell record and fill in its name, VL server address list and | |
120 | * allocate an anonymous key | |
121 | */ | |
122 | static struct afs_cell *afs_alloc_cell(struct afs_net *net, | |
123 | const char *name, unsigned int namelen, | |
0a5143f2 | 124 | const char *addresses) |
989782dc | 125 | { |
ca1cbbdc | 126 | struct afs_vlserver_list *vllist; |
989782dc DH |
127 | struct afs_cell *cell; |
128 | int i, ret; | |
129 | ||
130 | ASSERT(name); | |
131 | if (namelen == 0) | |
132 | return ERR_PTR(-EINVAL); | |
07567a55 WL |
133 | if (namelen > AFS_MAXCELLNAME) { |
134 | _leave(" = -ENAMETOOLONG"); | |
00d3b7a4 | 135 | return ERR_PTR(-ENAMETOOLONG); |
07567a55 | 136 | } |
a45ea48e DH |
137 | |
138 | /* Prohibit cell names that contain unprintable chars, '/' and '@' or | |
139 | * that begin with a dot. This also precludes "@cell". | |
140 | */ | |
141 | if (name[0] == '.') | |
37ab6368 | 142 | return ERR_PTR(-EINVAL); |
a45ea48e DH |
143 | for (i = 0; i < namelen; i++) { |
144 | char ch = name[i]; | |
145 | if (!isprint(ch) || ch == '/' || ch == '@') | |
146 | return ERR_PTR(-EINVAL); | |
147 | } | |
00d3b7a4 | 148 | |
0a5143f2 | 149 | _enter("%*.*s,%s", namelen, namelen, name, addresses); |
989782dc DH |
150 | |
151 | cell = kzalloc(sizeof(struct afs_cell), GFP_KERNEL); | |
1da177e4 LT |
152 | if (!cell) { |
153 | _leave(" = -ENOMEM"); | |
08e0e7c8 | 154 | return ERR_PTR(-ENOMEM); |
1da177e4 LT |
155 | } |
156 | ||
719fdd32 DH |
157 | cell->name = kmalloc(namelen + 1, GFP_KERNEL); |
158 | if (!cell->name) { | |
159 | kfree(cell); | |
160 | return ERR_PTR(-ENOMEM); | |
161 | } | |
162 | ||
f044c884 | 163 | cell->net = net; |
989782dc DH |
164 | cell->name_len = namelen; |
165 | for (i = 0; i < namelen; i++) | |
166 | cell->name[i] = tolower(name[i]); | |
719fdd32 | 167 | cell->name[i] = 0; |
989782dc DH |
168 | |
169 | atomic_set(&cell->usage, 2); | |
170 | INIT_WORK(&cell->manager, afs_manage_cell); | |
20325960 DH |
171 | cell->volumes = RB_ROOT; |
172 | INIT_HLIST_HEAD(&cell->proc_volumes); | |
173 | seqlock_init(&cell->volume_lock); | |
174 | cell->fs_servers = RB_ROOT; | |
175 | seqlock_init(&cell->fs_lock); | |
0a5143f2 | 176 | rwlock_init(&cell->vl_servers_lock); |
8a070a96 | 177 | cell->flags = (1 << AFS_CELL_FL_CHECK_ALIAS); |
4d9df986 | 178 | |
ca1cbbdc DH |
179 | /* Provide a VL server list, filling it in if we were given a list of |
180 | * addresses to use. | |
989782dc | 181 | */ |
0a5143f2 | 182 | if (addresses) { |
0a5143f2 DH |
183 | vllist = afs_parse_text_addrs(net, |
184 | addresses, strlen(addresses), ':', | |
185 | VL_SERVICE, AFS_VL_PORT); | |
186 | if (IS_ERR(vllist)) { | |
187 | ret = PTR_ERR(vllist); | |
8b2a464c DH |
188 | goto parse_failed; |
189 | } | |
00d3b7a4 | 190 | |
d5c32c89 DH |
191 | vllist->source = DNS_RECORD_FROM_CONFIG; |
192 | vllist->status = DNS_LOOKUP_NOT_DONE; | |
989782dc | 193 | cell->dns_expiry = TIME64_MAX; |
ded2f4c5 | 194 | } else { |
ca1cbbdc DH |
195 | ret = -ENOMEM; |
196 | vllist = afs_alloc_vlserver_list(0); | |
197 | if (!vllist) | |
198 | goto error; | |
d5c32c89 DH |
199 | vllist->source = DNS_RECORD_UNAVAILABLE; |
200 | vllist->status = DNS_LOOKUP_NOT_DONE; | |
ded2f4c5 | 201 | cell->dns_expiry = ktime_get_real_seconds(); |
00d3b7a4 | 202 | } |
00d3b7a4 | 203 | |
ca1cbbdc DH |
204 | rcu_assign_pointer(cell->vl_servers, vllist); |
205 | ||
d5c32c89 DH |
206 | cell->dns_source = vllist->source; |
207 | cell->dns_status = vllist->status; | |
208 | smp_store_release(&cell->dns_lookup_count, 1); /* vs source/status */ | |
209 | ||
00d3b7a4 DH |
210 | _leave(" = %p", cell); |
211 | return cell; | |
212 | ||
8b2a464c DH |
213 | parse_failed: |
214 | if (ret == -EINVAL) | |
215 | printk(KERN_ERR "kAFS: bad VL server IP address\n"); | |
ca1cbbdc | 216 | error: |
719fdd32 | 217 | kfree(cell->name); |
00d3b7a4 DH |
218 | kfree(cell); |
219 | _leave(" = %d", ret); | |
220 | return ERR_PTR(ret); | |
221 | } | |
1da177e4 | 222 | |
00d3b7a4 | 223 | /* |
989782dc | 224 | * afs_lookup_cell - Look up or create a cell record. |
f044c884 | 225 | * @net: The network namespace |
989782dc DH |
226 | * @name: The name of the cell. |
227 | * @namesz: The strlen of the cell name. | |
228 | * @vllist: A colon/comma separated list of numeric IP addresses or NULL. | |
229 | * @excl: T if an error should be given if the cell name already exists. | |
230 | * | |
231 | * Look up a cell record by name and query the DNS for VL server addresses if | |
232 | * needed. Note that that actual DNS query is punted off to the manager thread | |
233 | * so that this function can return immediately if interrupted whilst allowing | |
234 | * cell records to be shared even if not yet fully constructed. | |
00d3b7a4 | 235 | */ |
989782dc DH |
236 | struct afs_cell *afs_lookup_cell(struct afs_net *net, |
237 | const char *name, unsigned int namesz, | |
238 | const char *vllist, bool excl) | |
00d3b7a4 | 239 | { |
989782dc DH |
240 | struct afs_cell *cell, *candidate, *cursor; |
241 | struct rb_node *parent, **pp; | |
d5c32c89 | 242 | enum afs_cell_state state; |
989782dc DH |
243 | int ret, n; |
244 | ||
245 | _enter("%s,%s", name, vllist); | |
246 | ||
247 | if (!excl) { | |
248 | rcu_read_lock(); | |
249 | cell = afs_lookup_cell_rcu(net, name, namesz); | |
250 | rcu_read_unlock(); | |
68327951 | 251 | if (!IS_ERR(cell)) |
989782dc | 252 | goto wait_for_cell; |
989782dc | 253 | } |
00d3b7a4 | 254 | |
989782dc DH |
255 | /* Assume we're probably going to create a cell and preallocate and |
256 | * mostly set up a candidate record. We can then use this to stash the | |
257 | * name, the net namespace and VL server addresses. | |
258 | * | |
259 | * We also want to do this before we hold any locks as it may involve | |
260 | * upcalling to userspace to make DNS queries. | |
261 | */ | |
262 | candidate = afs_alloc_cell(net, name, namesz, vllist); | |
263 | if (IS_ERR(candidate)) { | |
264 | _leave(" = %ld", PTR_ERR(candidate)); | |
265 | return candidate; | |
5214b729 | 266 | } |
5214b729 | 267 | |
989782dc DH |
268 | /* Find the insertion point and check to see if someone else added a |
269 | * cell whilst we were allocating. | |
270 | */ | |
271 | write_seqlock(&net->cells_lock); | |
272 | ||
273 | pp = &net->cells.rb_node; | |
274 | parent = NULL; | |
275 | while (*pp) { | |
276 | parent = *pp; | |
277 | cursor = rb_entry(parent, struct afs_cell, net_node); | |
278 | ||
279 | n = strncasecmp(cursor->name, name, | |
280 | min_t(size_t, cursor->name_len, namesz)); | |
281 | if (n == 0) | |
282 | n = cursor->name_len - namesz; | |
283 | if (n < 0) | |
284 | pp = &(*pp)->rb_left; | |
285 | else if (n > 0) | |
286 | pp = &(*pp)->rb_right; | |
287 | else | |
288 | goto cell_already_exists; | |
00d3b7a4 DH |
289 | } |
290 | ||
989782dc DH |
291 | cell = candidate; |
292 | candidate = NULL; | |
293 | rb_link_node_rcu(&cell->net_node, parent, pp); | |
294 | rb_insert_color(&cell->net_node, &net->cells); | |
295 | atomic_inc(&net->cells_outstanding); | |
296 | write_sequnlock(&net->cells_lock); | |
1da177e4 | 297 | |
989782dc | 298 | queue_work(afs_wq, &cell->manager); |
1da177e4 | 299 | |
989782dc DH |
300 | wait_for_cell: |
301 | _debug("wait_for_cell"); | |
d5c32c89 DH |
302 | wait_var_event(&cell->state, |
303 | ({ | |
304 | state = smp_load_acquire(&cell->state); /* vs error */ | |
305 | state == AFS_CELL_ACTIVE || state == AFS_CELL_FAILED; | |
306 | })); | |
307 | ||
308 | /* Check the state obtained from the wait check. */ | |
309 | if (state == AFS_CELL_FAILED) { | |
989782dc DH |
310 | ret = cell->error; |
311 | goto error; | |
989782dc | 312 | } |
1da177e4 | 313 | |
989782dc | 314 | _leave(" = %p [cell]", cell); |
08e0e7c8 | 315 | return cell; |
1da177e4 | 316 | |
989782dc DH |
317 | cell_already_exists: |
318 | _debug("cell exists"); | |
319 | cell = cursor; | |
320 | if (excl) { | |
321 | ret = -EEXIST; | |
322 | } else { | |
989782dc DH |
323 | afs_get_cell(cursor); |
324 | ret = 0; | |
325 | } | |
326 | write_sequnlock(&net->cells_lock); | |
327 | kfree(candidate); | |
328 | if (ret == 0) | |
329 | goto wait_for_cell; | |
8b2a464c | 330 | goto error_noput; |
ec26815a | 331 | error: |
989782dc | 332 | afs_put_cell(net, cell); |
8b2a464c | 333 | error_noput: |
989782dc | 334 | _leave(" = %d [error]", ret); |
08e0e7c8 | 335 | return ERR_PTR(ret); |
ec26815a | 336 | } |
1da177e4 | 337 | |
1da177e4 | 338 | /* |
08e0e7c8 DH |
339 | * set the root cell information |
340 | * - can be called with a module parameter string | |
341 | * - can be called from a write to /proc/fs/afs/rootcell | |
1da177e4 | 342 | */ |
989782dc | 343 | int afs_cell_init(struct afs_net *net, const char *rootcell) |
1da177e4 LT |
344 | { |
345 | struct afs_cell *old_root, *new_root; | |
989782dc DH |
346 | const char *cp, *vllist; |
347 | size_t len; | |
1da177e4 LT |
348 | |
349 | _enter(""); | |
350 | ||
351 | if (!rootcell) { | |
352 | /* module is loaded with no parameters, or built statically. | |
353 | * - in the future we might initialize cell DB here. | |
354 | */ | |
08e0e7c8 | 355 | _leave(" = 0 [no root]"); |
1da177e4 LT |
356 | return 0; |
357 | } | |
358 | ||
359 | cp = strchr(rootcell, ':'); | |
989782dc | 360 | if (!cp) { |
07567a55 | 361 | _debug("kAFS: no VL server IP addresses specified"); |
989782dc DH |
362 | vllist = NULL; |
363 | len = strlen(rootcell); | |
364 | } else { | |
365 | vllist = cp + 1; | |
366 | len = cp - rootcell; | |
367 | } | |
1da177e4 LT |
368 | |
369 | /* allocate a cell record for the root cell */ | |
989782dc | 370 | new_root = afs_lookup_cell(net, rootcell, len, vllist, false); |
08e0e7c8 DH |
371 | if (IS_ERR(new_root)) { |
372 | _leave(" = %ld", PTR_ERR(new_root)); | |
373 | return PTR_ERR(new_root); | |
1da177e4 LT |
374 | } |
375 | ||
17814aef DH |
376 | if (!test_and_set_bit(AFS_CELL_FL_NO_GC, &new_root->flags)) |
377 | afs_get_cell(new_root); | |
989782dc | 378 | |
08e0e7c8 | 379 | /* install the new cell */ |
989782dc | 380 | write_seqlock(&net->cells_lock); |
1588def9 DH |
381 | old_root = rcu_access_pointer(net->ws_cell); |
382 | rcu_assign_pointer(net->ws_cell, new_root); | |
989782dc | 383 | write_sequnlock(&net->cells_lock); |
1da177e4 | 384 | |
989782dc | 385 | afs_put_cell(net, old_root); |
08e0e7c8 DH |
386 | _leave(" = 0"); |
387 | return 0; | |
ec26815a | 388 | } |
1da177e4 | 389 | |
1da177e4 | 390 | /* |
989782dc | 391 | * Update a cell's VL server address list from the DNS. |
1da177e4 | 392 | */ |
d5c32c89 | 393 | static int afs_update_cell(struct afs_cell *cell) |
1da177e4 | 394 | { |
d5c32c89 | 395 | struct afs_vlserver_list *vllist, *old = NULL, *p; |
ded2f4c5 DH |
396 | unsigned int min_ttl = READ_ONCE(afs_cell_min_ttl); |
397 | unsigned int max_ttl = READ_ONCE(afs_cell_max_ttl); | |
398 | time64_t now, expiry = 0; | |
d5c32c89 | 399 | int ret = 0; |
1da177e4 | 400 | |
989782dc DH |
401 | _enter("%s", cell->name); |
402 | ||
0a5143f2 | 403 | vllist = afs_dns_query(cell, &expiry); |
d5c32c89 DH |
404 | if (IS_ERR(vllist)) { |
405 | ret = PTR_ERR(vllist); | |
406 | ||
407 | _debug("%s: fail %d", cell->name, ret); | |
408 | if (ret == -ENOMEM) | |
409 | goto out_wake; | |
410 | ||
411 | ret = -ENOMEM; | |
412 | vllist = afs_alloc_vlserver_list(0); | |
413 | if (!vllist) | |
414 | goto out_wake; | |
415 | ||
416 | switch (ret) { | |
417 | case -ENODATA: | |
418 | case -EDESTADDRREQ: | |
419 | vllist->status = DNS_LOOKUP_GOT_NOT_FOUND; | |
420 | break; | |
421 | case -EAGAIN: | |
422 | case -ECONNREFUSED: | |
423 | vllist->status = DNS_LOOKUP_GOT_TEMP_FAILURE; | |
424 | break; | |
425 | default: | |
426 | vllist->status = DNS_LOOKUP_GOT_LOCAL_FAILURE; | |
427 | break; | |
428 | } | |
429 | } | |
430 | ||
431 | _debug("%s: got list %d %d", cell->name, vllist->source, vllist->status); | |
432 | cell->dns_status = vllist->status; | |
ded2f4c5 DH |
433 | |
434 | now = ktime_get_real_seconds(); | |
435 | if (min_ttl > max_ttl) | |
436 | max_ttl = min_ttl; | |
437 | if (expiry < now + min_ttl) | |
438 | expiry = now + min_ttl; | |
439 | else if (expiry > now + max_ttl) | |
440 | expiry = now + max_ttl; | |
441 | ||
d5c32c89 DH |
442 | _debug("%s: status %d", cell->name, vllist->status); |
443 | if (vllist->source == DNS_RECORD_UNAVAILABLE) { | |
444 | switch (vllist->status) { | |
445 | case DNS_LOOKUP_GOT_NOT_FOUND: | |
ded2f4c5 DH |
446 | /* The DNS said that the cell does not exist or there |
447 | * weren't any addresses to be had. | |
448 | */ | |
ded2f4c5 | 449 | cell->dns_expiry = expiry; |
8b2a464c | 450 | break; |
989782dc | 451 | |
d5c32c89 DH |
452 | case DNS_LOOKUP_BAD: |
453 | case DNS_LOOKUP_GOT_LOCAL_FAILURE: | |
454 | case DNS_LOOKUP_GOT_TEMP_FAILURE: | |
455 | case DNS_LOOKUP_GOT_NS_FAILURE: | |
8b2a464c | 456 | default: |
ded2f4c5 | 457 | cell->dns_expiry = now + 10; |
8b2a464c DH |
458 | break; |
459 | } | |
8b2a464c | 460 | } else { |
8b2a464c | 461 | cell->dns_expiry = expiry; |
8b2a464c | 462 | } |
bec5eb61 | 463 | |
d5c32c89 DH |
464 | /* Replace the VL server list if the new record has servers or the old |
465 | * record doesn't. | |
466 | */ | |
467 | write_lock(&cell->vl_servers_lock); | |
468 | p = rcu_dereference_protected(cell->vl_servers, true); | |
469 | if (vllist->nr_servers > 0 || p->nr_servers == 0) { | |
470 | rcu_assign_pointer(cell->vl_servers, vllist); | |
471 | cell->dns_source = vllist->source; | |
472 | old = p; | |
473 | } | |
474 | write_unlock(&cell->vl_servers_lock); | |
475 | afs_put_vlserverlist(cell->net, old); | |
bec5eb61 | 476 | |
d5c32c89 DH |
477 | out_wake: |
478 | smp_store_release(&cell->dns_lookup_count, | |
479 | cell->dns_lookup_count + 1); /* vs source/status */ | |
480 | wake_up_var(&cell->dns_lookup_count); | |
481 | _leave(" = %d", ret); | |
482 | return ret; | |
ec26815a | 483 | } |
1da177e4 | 484 | |
1da177e4 | 485 | /* |
989782dc | 486 | * Destroy a cell record |
1da177e4 | 487 | */ |
989782dc | 488 | static void afs_cell_destroy(struct rcu_head *rcu) |
1da177e4 | 489 | { |
989782dc | 490 | struct afs_cell *cell = container_of(rcu, struct afs_cell, rcu); |
1da177e4 | 491 | |
989782dc | 492 | _enter("%p{%s}", cell, cell->name); |
1da177e4 | 493 | |
989782dc DH |
494 | ASSERTCMP(atomic_read(&cell->usage), ==, 0); |
495 | ||
cca37d45 | 496 | afs_put_volume(cell->net, cell->root_volume, afs_volume_trace_put_cell_root); |
0a5143f2 | 497 | afs_put_vlserverlist(cell->net, rcu_access_pointer(cell->vl_servers)); |
8a070a96 | 498 | afs_put_cell(cell->net, cell->alias_of); |
989782dc | 499 | key_put(cell->anonymous_key); |
719fdd32 | 500 | kfree(cell->name); |
989782dc DH |
501 | kfree(cell); |
502 | ||
503 | _leave(" [destroyed]"); | |
ec26815a | 504 | } |
1da177e4 | 505 | |
1da177e4 | 506 | /* |
989782dc | 507 | * Queue the cell manager. |
1da177e4 | 508 | */ |
989782dc | 509 | static void afs_queue_cell_manager(struct afs_net *net) |
1da177e4 | 510 | { |
989782dc | 511 | int outstanding = atomic_inc_return(&net->cells_outstanding); |
1da177e4 | 512 | |
989782dc | 513 | _enter("%d", outstanding); |
1da177e4 | 514 | |
989782dc DH |
515 | if (!queue_work(afs_wq, &net->cells_manager)) |
516 | afs_dec_cells_outstanding(net); | |
517 | } | |
518 | ||
519 | /* | |
520 | * Cell management timer. We have an increment on cells_outstanding that we | |
521 | * need to pass along to the work item. | |
522 | */ | |
523 | void afs_cells_timer(struct timer_list *timer) | |
524 | { | |
525 | struct afs_net *net = container_of(timer, struct afs_net, cells_timer); | |
526 | ||
527 | _enter(""); | |
528 | if (!queue_work(afs_wq, &net->cells_manager)) | |
529 | afs_dec_cells_outstanding(net); | |
530 | } | |
1da177e4 | 531 | |
8b2a464c DH |
532 | /* |
533 | * Get a reference on a cell record. | |
534 | */ | |
535 | struct afs_cell *afs_get_cell(struct afs_cell *cell) | |
536 | { | |
537 | atomic_inc(&cell->usage); | |
538 | return cell; | |
539 | } | |
540 | ||
989782dc DH |
541 | /* |
542 | * Drop a reference on a cell record. | |
543 | */ | |
544 | void afs_put_cell(struct afs_net *net, struct afs_cell *cell) | |
545 | { | |
546 | time64_t now, expire_delay; | |
1da177e4 | 547 | |
989782dc | 548 | if (!cell) |
1da177e4 | 549 | return; |
1da177e4 | 550 | |
989782dc | 551 | _enter("%s", cell->name); |
08e0e7c8 | 552 | |
989782dc DH |
553 | now = ktime_get_real_seconds(); |
554 | cell->last_inactive = now; | |
555 | expire_delay = 0; | |
d5c32c89 | 556 | if (cell->vl_servers->nr_servers) |
989782dc | 557 | expire_delay = afs_cell_gc_delay; |
1da177e4 | 558 | |
989782dc DH |
559 | if (atomic_dec_return(&cell->usage) > 1) |
560 | return; | |
1da177e4 | 561 | |
989782dc DH |
562 | /* 'cell' may now be garbage collected. */ |
563 | afs_set_cell_timer(net, expire_delay); | |
ec26815a | 564 | } |
1da177e4 | 565 | |
1da177e4 | 566 | /* |
989782dc | 567 | * Allocate a key to use as a placeholder for anonymous user security. |
1da177e4 | 568 | */ |
989782dc | 569 | static int afs_alloc_anon_key(struct afs_cell *cell) |
1da177e4 | 570 | { |
989782dc DH |
571 | struct key *key; |
572 | char keyname[4 + AFS_MAXCELLNAME + 1], *cp, *dp; | |
1da177e4 | 573 | |
989782dc DH |
574 | /* Create a key to represent an anonymous user. */ |
575 | memcpy(keyname, "afs@", 4); | |
576 | dp = keyname + 4; | |
577 | cp = cell->name; | |
578 | do { | |
579 | *dp++ = tolower(*cp); | |
580 | } while (*cp++); | |
1da177e4 | 581 | |
989782dc DH |
582 | key = rxrpc_get_null_key(keyname); |
583 | if (IS_ERR(key)) | |
584 | return PTR_ERR(key); | |
1da177e4 | 585 | |
989782dc | 586 | cell->anonymous_key = key; |
1da177e4 | 587 | |
989782dc DH |
588 | _debug("anon key %p{%x}", |
589 | cell->anonymous_key, key_serial(cell->anonymous_key)); | |
590 | return 0; | |
591 | } | |
1da177e4 | 592 | |
989782dc DH |
593 | /* |
594 | * Activate a cell. | |
595 | */ | |
596 | static int afs_activate_cell(struct afs_net *net, struct afs_cell *cell) | |
597 | { | |
6b3944e4 DH |
598 | struct hlist_node **p; |
599 | struct afs_cell *pcell; | |
989782dc DH |
600 | int ret; |
601 | ||
602 | if (!cell->anonymous_key) { | |
603 | ret = afs_alloc_anon_key(cell); | |
604 | if (ret < 0) | |
605 | return ret; | |
08e0e7c8 DH |
606 | } |
607 | ||
989782dc DH |
608 | #ifdef CONFIG_AFS_FSCACHE |
609 | cell->cache = fscache_acquire_cookie(afs_cache_netfs.primary_index, | |
610 | &afs_cell_cache_index_def, | |
402cb8dd DH |
611 | cell->name, strlen(cell->name), |
612 | NULL, 0, | |
ee1235a9 | 613 | cell, 0, true); |
989782dc | 614 | #endif |
5b86d4ff | 615 | ret = afs_proc_cell_setup(cell); |
989782dc DH |
616 | if (ret < 0) |
617 | return ret; | |
0da0b7fd DH |
618 | |
619 | mutex_lock(&net->proc_cells_lock); | |
6b3944e4 DH |
620 | for (p = &net->proc_cells.first; *p; p = &(*p)->next) { |
621 | pcell = hlist_entry(*p, struct afs_cell, proc_link); | |
622 | if (strcmp(cell->name, pcell->name) < 0) | |
623 | break; | |
624 | } | |
625 | ||
626 | cell->proc_link.pprev = p; | |
627 | cell->proc_link.next = *p; | |
628 | rcu_assign_pointer(*p, &cell->proc_link.next); | |
629 | if (cell->proc_link.next) | |
630 | cell->proc_link.next->pprev = &cell->proc_link.next; | |
631 | ||
0da0b7fd DH |
632 | afs_dynroot_mkdir(net, cell); |
633 | mutex_unlock(&net->proc_cells_lock); | |
989782dc DH |
634 | return 0; |
635 | } | |
636 | ||
637 | /* | |
638 | * Deactivate a cell. | |
639 | */ | |
640 | static void afs_deactivate_cell(struct afs_net *net, struct afs_cell *cell) | |
641 | { | |
642 | _enter("%s", cell->name); | |
1da177e4 | 643 | |
5b86d4ff | 644 | afs_proc_cell_remove(cell); |
1da177e4 | 645 | |
0da0b7fd | 646 | mutex_lock(&net->proc_cells_lock); |
6b3944e4 | 647 | hlist_del_rcu(&cell->proc_link); |
0da0b7fd DH |
648 | afs_dynroot_rmdir(net, cell); |
649 | mutex_unlock(&net->proc_cells_lock); | |
1da177e4 | 650 | |
9b3f26c9 | 651 | #ifdef CONFIG_AFS_FSCACHE |
402cb8dd | 652 | fscache_relinquish_cookie(cell->cache, NULL, false); |
989782dc | 653 | cell->cache = NULL; |
1da177e4 | 654 | #endif |
1da177e4 | 655 | |
989782dc | 656 | _leave(""); |
ec26815a | 657 | } |
1da177e4 | 658 | |
1da177e4 | 659 | /* |
989782dc DH |
660 | * Manage a cell record, initialising and destroying it, maintaining its DNS |
661 | * records. | |
1da177e4 | 662 | */ |
989782dc | 663 | static void afs_manage_cell(struct work_struct *work) |
1da177e4 | 664 | { |
989782dc DH |
665 | struct afs_cell *cell = container_of(work, struct afs_cell, manager); |
666 | struct afs_net *net = cell->net; | |
667 | bool deleted; | |
668 | int ret, usage; | |
669 | ||
670 | _enter("%s", cell->name); | |
671 | ||
672 | again: | |
673 | _debug("state %u", cell->state); | |
674 | switch (cell->state) { | |
675 | case AFS_CELL_INACTIVE: | |
676 | case AFS_CELL_FAILED: | |
677 | write_seqlock(&net->cells_lock); | |
678 | usage = 1; | |
679 | deleted = atomic_try_cmpxchg_relaxed(&cell->usage, &usage, 0); | |
680 | if (deleted) | |
681 | rb_erase(&cell->net_node, &net->cells); | |
682 | write_sequnlock(&net->cells_lock); | |
683 | if (deleted) | |
684 | goto final_destruction; | |
685 | if (cell->state == AFS_CELL_FAILED) | |
686 | goto done; | |
d5c32c89 DH |
687 | smp_store_release(&cell->state, AFS_CELL_UNSET); |
688 | wake_up_var(&cell->state); | |
989782dc DH |
689 | goto again; |
690 | ||
691 | case AFS_CELL_UNSET: | |
d5c32c89 DH |
692 | smp_store_release(&cell->state, AFS_CELL_ACTIVATING); |
693 | wake_up_var(&cell->state); | |
989782dc DH |
694 | goto again; |
695 | ||
696 | case AFS_CELL_ACTIVATING: | |
697 | ret = afs_activate_cell(net, cell); | |
698 | if (ret < 0) | |
699 | goto activation_failed; | |
700 | ||
d5c32c89 DH |
701 | smp_store_release(&cell->state, AFS_CELL_ACTIVE); |
702 | wake_up_var(&cell->state); | |
989782dc DH |
703 | goto again; |
704 | ||
705 | case AFS_CELL_ACTIVE: | |
706 | if (atomic_read(&cell->usage) > 1) { | |
d5c32c89 DH |
707 | if (test_and_clear_bit(AFS_CELL_FL_DO_LOOKUP, &cell->flags)) { |
708 | ret = afs_update_cell(cell); | |
709 | if (ret < 0) | |
710 | cell->error = ret; | |
711 | } | |
989782dc DH |
712 | goto done; |
713 | } | |
d5c32c89 DH |
714 | smp_store_release(&cell->state, AFS_CELL_DEACTIVATING); |
715 | wake_up_var(&cell->state); | |
989782dc DH |
716 | goto again; |
717 | ||
718 | case AFS_CELL_DEACTIVATING: | |
989782dc DH |
719 | if (atomic_read(&cell->usage) > 1) |
720 | goto reverse_deactivation; | |
721 | afs_deactivate_cell(net, cell); | |
d5c32c89 DH |
722 | smp_store_release(&cell->state, AFS_CELL_INACTIVE); |
723 | wake_up_var(&cell->state); | |
989782dc DH |
724 | goto again; |
725 | ||
726 | default: | |
727 | break; | |
728 | } | |
729 | _debug("bad state %u", cell->state); | |
730 | BUG(); /* Unhandled state */ | |
731 | ||
732 | activation_failed: | |
733 | cell->error = ret; | |
734 | afs_deactivate_cell(net, cell); | |
735 | ||
d5c32c89 DH |
736 | smp_store_release(&cell->state, AFS_CELL_FAILED); /* vs error */ |
737 | wake_up_var(&cell->state); | |
989782dc DH |
738 | goto again; |
739 | ||
740 | reverse_deactivation: | |
d5c32c89 DH |
741 | smp_store_release(&cell->state, AFS_CELL_ACTIVE); |
742 | wake_up_var(&cell->state); | |
989782dc DH |
743 | _leave(" [deact->act]"); |
744 | return; | |
745 | ||
746 | done: | |
747 | _leave(" [done %u]", cell->state); | |
748 | return; | |
749 | ||
750 | final_destruction: | |
751 | call_rcu(&cell->rcu, afs_cell_destroy); | |
752 | afs_dec_cells_outstanding(net); | |
753 | _leave(" [destruct %d]", atomic_read(&net->cells_outstanding)); | |
754 | } | |
755 | ||
756 | /* | |
757 | * Manage the records of cells known to a network namespace. This includes | |
758 | * updating the DNS records and garbage collecting unused cells that were | |
759 | * automatically added. | |
760 | * | |
761 | * Note that constructed cell records may only be removed from net->cells by | |
762 | * this work item, so it is safe for this work item to stash a cursor pointing | |
763 | * into the tree and then return to caller (provided it skips cells that are | |
764 | * still under construction). | |
765 | * | |
766 | * Note also that we were given an increment on net->cells_outstanding by | |
767 | * whoever queued us that we need to deal with before returning. | |
768 | */ | |
769 | void afs_manage_cells(struct work_struct *work) | |
770 | { | |
771 | struct afs_net *net = container_of(work, struct afs_net, cells_manager); | |
772 | struct rb_node *cursor; | |
773 | time64_t now = ktime_get_real_seconds(), next_manage = TIME64_MAX; | |
774 | bool purging = !net->live; | |
1da177e4 LT |
775 | |
776 | _enter(""); | |
777 | ||
989782dc DH |
778 | /* Trawl the cell database looking for cells that have expired from |
779 | * lack of use and cells whose DNS results have expired and dispatch | |
780 | * their managers. | |
781 | */ | |
782 | read_seqlock_excl(&net->cells_lock); | |
1da177e4 | 783 | |
989782dc DH |
784 | for (cursor = rb_first(&net->cells); cursor; cursor = rb_next(cursor)) { |
785 | struct afs_cell *cell = | |
786 | rb_entry(cursor, struct afs_cell, net_node); | |
787 | unsigned usage; | |
788 | bool sched_cell = false; | |
08e0e7c8 | 789 | |
989782dc DH |
790 | usage = atomic_read(&cell->usage); |
791 | _debug("manage %s %u", cell->name, usage); | |
792 | ||
793 | ASSERTCMP(usage, >=, 1); | |
794 | ||
795 | if (purging) { | |
796 | if (test_and_clear_bit(AFS_CELL_FL_NO_GC, &cell->flags)) | |
797 | usage = atomic_dec_return(&cell->usage); | |
798 | ASSERTCMP(usage, ==, 1); | |
799 | } | |
1da177e4 | 800 | |
989782dc | 801 | if (usage == 1) { |
d5c32c89 | 802 | struct afs_vlserver_list *vllist; |
989782dc | 803 | time64_t expire_at = cell->last_inactive; |
1da177e4 | 804 | |
d5c32c89 DH |
805 | read_lock(&cell->vl_servers_lock); |
806 | vllist = rcu_dereference_protected( | |
807 | cell->vl_servers, | |
808 | lockdep_is_held(&cell->vl_servers_lock)); | |
809 | if (vllist->nr_servers > 0) | |
989782dc | 810 | expire_at += afs_cell_gc_delay; |
d5c32c89 | 811 | read_unlock(&cell->vl_servers_lock); |
989782dc DH |
812 | if (purging || expire_at <= now) |
813 | sched_cell = true; | |
814 | else if (expire_at < next_manage) | |
815 | next_manage = expire_at; | |
1da177e4 LT |
816 | } |
817 | ||
989782dc | 818 | if (!purging) { |
d5c32c89 | 819 | if (test_bit(AFS_CELL_FL_DO_LOOKUP, &cell->flags)) |
989782dc | 820 | sched_cell = true; |
989782dc DH |
821 | } |
822 | ||
823 | if (sched_cell) | |
824 | queue_work(afs_wq, &cell->manager); | |
825 | } | |
826 | ||
827 | read_sequnlock_excl(&net->cells_lock); | |
1da177e4 | 828 | |
989782dc DH |
829 | /* Update the timer on the way out. We have to pass an increment on |
830 | * cells_outstanding in the namespace that we are in to the timer or | |
831 | * the work scheduler. | |
832 | */ | |
833 | if (!purging && next_manage < TIME64_MAX) { | |
834 | now = ktime_get_real_seconds(); | |
1da177e4 | 835 | |
989782dc DH |
836 | if (next_manage - now <= 0) { |
837 | if (queue_work(afs_wq, &net->cells_manager)) | |
838 | atomic_inc(&net->cells_outstanding); | |
839 | } else { | |
840 | afs_set_cell_timer(net, next_manage - now); | |
1da177e4 LT |
841 | } |
842 | } | |
843 | ||
989782dc DH |
844 | afs_dec_cells_outstanding(net); |
845 | _leave(" [%d]", atomic_read(&net->cells_outstanding)); | |
846 | } | |
847 | ||
848 | /* | |
849 | * Purge in-memory cell database. | |
850 | */ | |
851 | void afs_cell_purge(struct afs_net *net) | |
852 | { | |
853 | struct afs_cell *ws; | |
854 | ||
855 | _enter(""); | |
856 | ||
857 | write_seqlock(&net->cells_lock); | |
1588def9 DH |
858 | ws = rcu_access_pointer(net->ws_cell); |
859 | RCU_INIT_POINTER(net->ws_cell, NULL); | |
989782dc DH |
860 | write_sequnlock(&net->cells_lock); |
861 | afs_put_cell(net, ws); | |
862 | ||
863 | _debug("del timer"); | |
864 | if (del_timer_sync(&net->cells_timer)) | |
865 | atomic_dec(&net->cells_outstanding); | |
866 | ||
867 | _debug("kick mgr"); | |
868 | afs_queue_cell_manager(net); | |
869 | ||
870 | _debug("wait"); | |
ab1fbe32 PZ |
871 | wait_var_event(&net->cells_outstanding, |
872 | !atomic_read(&net->cells_outstanding)); | |
1da177e4 | 873 | _leave(""); |
ec26815a | 874 | } |