2007-04-27 05:49:28 +07:00
|
|
|
/* AFS cell and server record management
|
2005-04-17 05:20:36 +07:00
|
|
|
*
|
2017-11-02 22:27:50 +07:00
|
|
|
* Copyright (C) 2002, 2017 Red Hat, Inc. All Rights Reserved.
|
2005-04-17 05:20:36 +07:00
|
|
|
* Written by David Howells (dhowells@redhat.com)
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/slab.h>
|
2007-04-27 05:57:07 +07:00
|
|
|
#include <linux/key.h>
|
|
|
|
#include <linux/ctype.h>
|
2010-08-04 21:16:38 +07:00
|
|
|
#include <linux/dns_resolver.h>
|
Detach sched.h from mm.h
First thing mm.h does is including sched.h solely for can_do_mlock() inline
function which has "current" dereference inside. By dealing with can_do_mlock()
mm.h can be detached from sched.h which is good. See below, why.
This patch
a) removes unconditional inclusion of sched.h from mm.h
b) makes can_do_mlock() normal function in mm/mlock.c
c) exports can_do_mlock() to not break compilation
d) adds sched.h inclusions back to files that were getting it indirectly.
e) adds less bloated headers to some files (asm/signal.h, jiffies.h) that were
getting them indirectly
Net result is:
a) mm.h users would get less code to open, read, preprocess, parse, ... if
they don't need sched.h
b) sched.h stops being dependency for significant number of files:
on x86_64 allmodconfig touching sched.h results in recompile of 4083 files,
after patch it's only 3744 (-8.3%).
Cross-compile tested on
all arm defconfigs, all mips defconfigs, all powerpc defconfigs,
alpha alpha-up
arm
i386 i386-up i386-defconfig i386-allnoconfig
ia64 ia64-up
m68k
mips
parisc parisc-up
powerpc powerpc-up
s390 s390-up
sparc sparc-up
sparc64 sparc64-up
um-x86_64
x86_64 x86_64-up x86_64-defconfig x86_64-allnoconfig
as well as my two usual configs.
Signed-off-by: Alexey Dobriyan <adobriyan@gmail.com>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-05-21 04:22:52 +07:00
|
|
|
#include <linux/sched.h>
|
2017-11-02 22:27:47 +07:00
|
|
|
#include <linux/inet.h>
|
2018-06-15 21:19:22 +07:00
|
|
|
#include <linux/namei.h>
|
2007-04-27 05:57:07 +07:00
|
|
|
#include <keys/rxrpc-type.h>
|
2005-04-17 05:20:36 +07:00
|
|
|
#include "internal.h"
|
|
|
|
|
2018-04-10 03:12:31 +07:00
|
|
|
static unsigned __read_mostly afs_cell_gc_delay = 10;
|
2018-10-20 06:57:57 +07:00
|
|
|
static unsigned __read_mostly afs_cell_min_ttl = 10 * 60;
|
|
|
|
static unsigned __read_mostly afs_cell_max_ttl = 24 * 60 * 60;
|
2017-11-02 22:27:50 +07:00
|
|
|
|
|
|
|
static void afs_manage_cell(struct work_struct *);
|
|
|
|
|
|
|
|
static void afs_dec_cells_outstanding(struct afs_net *net)
|
|
|
|
{
|
|
|
|
if (atomic_dec_and_test(&net->cells_outstanding))
|
2018-03-15 17:42:28 +07:00
|
|
|
wake_up_var(&net->cells_outstanding);
|
2017-11-02 22:27:50 +07:00
|
|
|
}
|
|
|
|
|
2005-04-17 05:20:36 +07:00
|
|
|
/*
|
2017-11-02 22:27:50 +07:00
|
|
|
* Set the cell timer to fire after a given delay, assuming it's not already
|
|
|
|
* set for an earlier time.
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2017-11-02 22:27:50 +07:00
|
|
|
static void afs_set_cell_timer(struct afs_net *net, time64_t delay)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2017-11-02 22:27:50 +07:00
|
|
|
if (net->live) {
|
|
|
|
atomic_inc(&net->cells_outstanding);
|
|
|
|
if (timer_reduce(&net->cells_timer, jiffies + delay * HZ))
|
|
|
|
afs_dec_cells_outstanding(net);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Look up and get an activation reference on a cell record under RCU
|
|
|
|
* conditions. The caller must hold the RCU read lock.
|
|
|
|
*/
|
|
|
|
struct afs_cell *afs_lookup_cell_rcu(struct afs_net *net,
|
|
|
|
const char *name, unsigned int namesz)
|
|
|
|
{
|
|
|
|
struct afs_cell *cell = NULL;
|
|
|
|
struct rb_node *p;
|
|
|
|
int n, seq = 0, ret = 0;
|
|
|
|
|
|
|
|
_enter("%*.*s", namesz, namesz, name);
|
|
|
|
|
|
|
|
if (name && namesz == 0)
|
|
|
|
return ERR_PTR(-EINVAL);
|
|
|
|
if (namesz > AFS_MAXCELLNAME)
|
|
|
|
return ERR_PTR(-ENAMETOOLONG);
|
|
|
|
|
|
|
|
do {
|
|
|
|
/* Unfortunately, rbtree walking doesn't give reliable results
|
|
|
|
* under just the RCU read lock, so we have to check for
|
|
|
|
* changes.
|
|
|
|
*/
|
|
|
|
if (cell)
|
|
|
|
afs_put_cell(net, cell);
|
|
|
|
cell = NULL;
|
|
|
|
ret = -ENOENT;
|
|
|
|
|
|
|
|
read_seqbegin_or_lock(&net->cells_lock, &seq);
|
|
|
|
|
|
|
|
if (!name) {
|
|
|
|
cell = rcu_dereference_raw(net->ws_cell);
|
|
|
|
if (cell) {
|
|
|
|
afs_get_cell(cell);
|
2018-04-10 03:12:31 +07:00
|
|
|
break;
|
2017-11-02 22:27:50 +07:00
|
|
|
}
|
|
|
|
ret = -EDESTADDRREQ;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
p = rcu_dereference_raw(net->cells.rb_node);
|
|
|
|
while (p) {
|
|
|
|
cell = rb_entry(p, struct afs_cell, net_node);
|
|
|
|
|
|
|
|
n = strncasecmp(cell->name, name,
|
|
|
|
min_t(size_t, cell->name_len, namesz));
|
|
|
|
if (n == 0)
|
|
|
|
n = cell->name_len - namesz;
|
|
|
|
if (n < 0) {
|
|
|
|
p = rcu_dereference_raw(p->rb_left);
|
|
|
|
} else if (n > 0) {
|
|
|
|
p = rcu_dereference_raw(p->rb_right);
|
|
|
|
} else {
|
|
|
|
if (atomic_inc_not_zero(&cell->usage)) {
|
|
|
|
ret = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* We want to repeat the search, this time with
|
|
|
|
* the lock properly locked.
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
cell = NULL;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
} while (need_seqretry(&net->cells_lock, seq));
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
done_seqretry(&net->cells_lock, seq);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
return ret == 0 ? cell : ERR_PTR(ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up a cell record and fill in its name, VL server address list and
|
|
|
|
* allocate an anonymous key
|
|
|
|
*/
|
|
|
|
static struct afs_cell *afs_alloc_cell(struct afs_net *net,
|
|
|
|
const char *name, unsigned int namelen,
|
2018-10-20 06:57:57 +07:00
|
|
|
const char *addresses)
|
2017-11-02 22:27:50 +07:00
|
|
|
{
|
|
|
|
struct afs_cell *cell;
|
|
|
|
int i, ret;
|
|
|
|
|
|
|
|
ASSERT(name);
|
|
|
|
if (namelen == 0)
|
|
|
|
return ERR_PTR(-EINVAL);
|
2010-08-04 21:16:38 +07:00
|
|
|
if (namelen > AFS_MAXCELLNAME) {
|
|
|
|
_leave(" = -ENAMETOOLONG");
|
2007-04-27 05:57:07 +07:00
|
|
|
return ERR_PTR(-ENAMETOOLONG);
|
2010-08-04 21:16:38 +07:00
|
|
|
}
|
2018-04-06 20:17:23 +07:00
|
|
|
if (namelen == 5 && memcmp(name, "@cell", 5) == 0)
|
|
|
|
return ERR_PTR(-EINVAL);
|
2007-04-27 05:57:07 +07:00
|
|
|
|
2018-10-20 06:57:57 +07:00
|
|
|
_enter("%*.*s,%s", namelen, namelen, name, addresses);
|
2017-11-02 22:27:50 +07:00
|
|
|
|
|
|
|
cell = kzalloc(sizeof(struct afs_cell), GFP_KERNEL);
|
2005-04-17 05:20:36 +07:00
|
|
|
if (!cell) {
|
|
|
|
_leave(" = -ENOMEM");
|
2007-04-27 05:55:03 +07:00
|
|
|
return ERR_PTR(-ENOMEM);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2017-11-02 22:27:45 +07:00
|
|
|
cell->net = net;
|
2017-11-02 22:27:50 +07:00
|
|
|
cell->name_len = namelen;
|
|
|
|
for (i = 0; i < namelen; i++)
|
|
|
|
cell->name[i] = tolower(name[i]);
|
|
|
|
|
|
|
|
atomic_set(&cell->usage, 2);
|
|
|
|
INIT_WORK(&cell->manager, afs_manage_cell);
|
2017-11-02 22:27:50 +07:00
|
|
|
cell->flags = ((1 << AFS_CELL_FL_NOT_READY) |
|
|
|
|
(1 << AFS_CELL_FL_NO_LOOKUP_YET));
|
afs: Overhaul volume and server record caching and fileserver rotation
The current code assumes that volumes and servers are per-cell and are
never shared, but this is not enforced, and, indeed, public cells do exist
that are aliases of each other. Further, an organisation can, say, set up
a public cell and a private cell with overlapping, but not identical, sets
of servers. The difference is purely in the database attached to the VL
servers.
The current code will malfunction if it sees a server in two cells as it
assumes global address -> server record mappings and that each server is in
just one cell.
Further, each server may have multiple addresses - and may have addresses
of different families (IPv4 and IPv6, say).
To this end, the following structural changes are made:
(1) Server record management is overhauled:
(a) Server records are made independent of cell. The namespace keeps
track of them, volume records have lists of them and each vnode
has a server on which its callback interest currently resides.
(b) The cell record no longer keeps a list of servers known to be in
that cell.
(c) The server records are now kept in a flat list because there's no
single address to sort on.
(d) Server records are now keyed by their UUID within the namespace.
(e) The addresses for a server are obtained with the VL.GetAddrsU
rather than with VL.GetEntryByName, using the server's UUID as a
parameter.
(f) Cached server records are garbage collected after a period of
non-use and are counted out of existence before purging is allowed
to complete. This protects the work functions against rmmod.
(g) The servers list is now in /proc/fs/afs/servers.
(2) Volume record management is overhauled:
(a) An RCU-replaceable server list is introduced. This tracks both
servers and their coresponding callback interests.
(b) The superblock is now keyed on cell record and numeric volume ID.
(c) The volume record is now tied to the superblock which mounts it,
and is activated when mounted and deactivated when unmounted.
This makes it easier to handle the cache cookie without causing a
double-use in fscache.
(d) The volume record is loaded from the VLDB using VL.GetEntryByNameU
to get the server UUID list.
(e) The volume name is updated if it is seen to have changed when the
volume is updated (the update is keyed on the volume ID).
(3) The vlocation record is got rid of and VLDB records are no longer
cached. Sufficient information is stored in the volume record, though
an update to a volume record is now no longer shared between related
volumes (volumes come in bundles of three: R/W, R/O and backup).
and the following procedural changes are made:
(1) The fileserver cursor introduced previously is now fleshed out and
used to iterate over fileservers and their addresses.
(2) Volume status is checked during iteration, and the server list is
replaced if a change is detected.
(3) Server status is checked during iteration, and the address list is
replaced if a change is detected.
(4) The abort code is saved into the address list cursor and -ECONNABORTED
returned in afs_make_call() if a remote abort happened rather than
translating the abort into an error message. This allows actions to
be taken depending on the abort code more easily.
(a) If a VMOVED abort is seen then this is handled by rechecking the
volume and restarting the iteration.
(b) If a VBUSY, VRESTARTING or VSALVAGING abort is seen then this is
handled by sleeping for a short period and retrying and/or trying
other servers that might serve that volume. A message is also
displayed once until the condition has cleared.
(c) If a VOFFLINE abort is seen, then this is handled as VBUSY for the
moment.
(d) If a VNOVOL abort is seen, the volume is rechecked in the VLDB to
see if it has been deleted; if not, the fileserver is probably
indicating that the volume couldn't be attached and needs
salvaging.
(e) If statfs() sees one of these aborts, it does not sleep, but
rather returns an error, so as not to block the umount program.
(5) The fileserver iteration functions in vnode.c are now merged into
their callers and more heavily macroised around the cursor. vnode.c
is removed.
(6) Operations on a particular vnode are serialised on that vnode because
the server will lock that vnode whilst it operates on it, so a second
op sent will just have to wait.
(7) Fileservers are probed with FS.GetCapabilities before being used.
This is where service upgrade will be done.
(8) A callback interest on a fileserver is set up before an FS operation
is performed and passed through to afs_make_call() so that it can be
set on the vnode if the operation returns a callback. The callback
interest is passed through to afs_iget() also so that it can be set
there too.
In general, record updating is done on an as-needed basis when we try to
access servers, volumes or vnodes rather than offloading it to work items
and special threads.
Notes:
(1) Pre AFS-3.4 servers are no longer supported, though this can be added
back if necessary (AFS-3.4 was released in 1998).
(2) VBUSY is retried forever for the moment at intervals of 1s.
(3) /proc/fs/afs/<cell>/servers no longer exists.
Signed-off-by: David Howells <dhowells@redhat.com>
2017-11-02 22:27:50 +07:00
|
|
|
INIT_LIST_HEAD(&cell->proc_volumes);
|
|
|
|
rwlock_init(&cell->proc_lock);
|
2018-10-20 06:57:57 +07:00
|
|
|
rwlock_init(&cell->vl_servers_lock);
|
2017-11-02 22:27:47 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/* Fill in the VL server list if we were given a list of addresses to
|
|
|
|
* use.
|
|
|
|
*/
|
2018-10-20 06:57:57 +07:00
|
|
|
if (addresses) {
|
|
|
|
struct afs_vlserver_list *vllist;
|
|
|
|
|
|
|
|
vllist = afs_parse_text_addrs(net,
|
|
|
|
addresses, strlen(addresses), ':',
|
|
|
|
VL_SERVICE, AFS_VL_PORT);
|
|
|
|
if (IS_ERR(vllist)) {
|
|
|
|
ret = PTR_ERR(vllist);
|
2017-11-02 22:27:50 +07:00
|
|
|
goto parse_failed;
|
|
|
|
}
|
2007-04-27 05:57:07 +07:00
|
|
|
|
2018-10-20 06:57:57 +07:00
|
|
|
rcu_assign_pointer(cell->vl_servers, vllist);
|
2017-11-02 22:27:50 +07:00
|
|
|
cell->dns_expiry = TIME64_MAX;
|
2019-02-22 05:04:32 +07:00
|
|
|
__clear_bit(AFS_CELL_FL_NO_LOOKUP_YET, &cell->flags);
|
2018-10-20 06:57:57 +07:00
|
|
|
} else {
|
|
|
|
cell->dns_expiry = ktime_get_real_seconds();
|
2007-04-27 05:57:07 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
_leave(" = %p", cell);
|
|
|
|
return cell;
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
parse_failed:
|
|
|
|
if (ret == -EINVAL)
|
|
|
|
printk(KERN_ERR "kAFS: bad VL server IP address\n");
|
2007-04-27 05:57:07 +07:00
|
|
|
kfree(cell);
|
|
|
|
_leave(" = %d", ret);
|
|
|
|
return ERR_PTR(ret);
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2007-04-27 05:57:07 +07:00
|
|
|
/*
|
2017-11-02 22:27:50 +07:00
|
|
|
* afs_lookup_cell - Look up or create a cell record.
|
2017-11-02 22:27:45 +07:00
|
|
|
* @net: The network namespace
|
2017-11-02 22:27:50 +07:00
|
|
|
* @name: The name of the cell.
|
|
|
|
* @namesz: The strlen of the cell name.
|
|
|
|
* @vllist: A colon/comma separated list of numeric IP addresses or NULL.
|
|
|
|
* @excl: T if an error should be given if the cell name already exists.
|
|
|
|
*
|
|
|
|
* Look up a cell record by name and query the DNS for VL server addresses if
|
|
|
|
* needed. Note that that actual DNS query is punted off to the manager thread
|
|
|
|
* so that this function can return immediately if interrupted whilst allowing
|
|
|
|
* cell records to be shared even if not yet fully constructed.
|
2007-04-27 05:57:07 +07:00
|
|
|
*/
|
2017-11-02 22:27:50 +07:00
|
|
|
struct afs_cell *afs_lookup_cell(struct afs_net *net,
|
|
|
|
const char *name, unsigned int namesz,
|
|
|
|
const char *vllist, bool excl)
|
2007-04-27 05:57:07 +07:00
|
|
|
{
|
2017-11-02 22:27:50 +07:00
|
|
|
struct afs_cell *cell, *candidate, *cursor;
|
|
|
|
struct rb_node *parent, **pp;
|
|
|
|
int ret, n;
|
|
|
|
|
|
|
|
_enter("%s,%s", name, vllist);
|
|
|
|
|
|
|
|
if (!excl) {
|
|
|
|
rcu_read_lock();
|
|
|
|
cell = afs_lookup_cell_rcu(net, name, namesz);
|
|
|
|
rcu_read_unlock();
|
2017-11-18 05:40:32 +07:00
|
|
|
if (!IS_ERR(cell))
|
2017-11-02 22:27:50 +07:00
|
|
|
goto wait_for_cell;
|
|
|
|
}
|
2007-04-27 05:57:07 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/* Assume we're probably going to create a cell and preallocate and
|
|
|
|
* mostly set up a candidate record. We can then use this to stash the
|
|
|
|
* name, the net namespace and VL server addresses.
|
|
|
|
*
|
|
|
|
* We also want to do this before we hold any locks as it may involve
|
|
|
|
* upcalling to userspace to make DNS queries.
|
|
|
|
*/
|
|
|
|
candidate = afs_alloc_cell(net, name, namesz, vllist);
|
|
|
|
if (IS_ERR(candidate)) {
|
|
|
|
_leave(" = %ld", PTR_ERR(candidate));
|
|
|
|
return candidate;
|
2008-03-29 04:15:55 +07:00
|
|
|
}
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/* Find the insertion point and check to see if someone else added a
|
|
|
|
* cell whilst we were allocating.
|
|
|
|
*/
|
|
|
|
write_seqlock(&net->cells_lock);
|
|
|
|
|
|
|
|
pp = &net->cells.rb_node;
|
|
|
|
parent = NULL;
|
|
|
|
while (*pp) {
|
|
|
|
parent = *pp;
|
|
|
|
cursor = rb_entry(parent, struct afs_cell, net_node);
|
|
|
|
|
|
|
|
n = strncasecmp(cursor->name, name,
|
|
|
|
min_t(size_t, cursor->name_len, namesz));
|
|
|
|
if (n == 0)
|
|
|
|
n = cursor->name_len - namesz;
|
|
|
|
if (n < 0)
|
|
|
|
pp = &(*pp)->rb_left;
|
|
|
|
else if (n > 0)
|
|
|
|
pp = &(*pp)->rb_right;
|
|
|
|
else
|
|
|
|
goto cell_already_exists;
|
2007-04-27 05:57:07 +07:00
|
|
|
}
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
cell = candidate;
|
|
|
|
candidate = NULL;
|
|
|
|
rb_link_node_rcu(&cell->net_node, parent, pp);
|
|
|
|
rb_insert_color(&cell->net_node, &net->cells);
|
|
|
|
atomic_inc(&net->cells_outstanding);
|
|
|
|
write_sequnlock(&net->cells_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
queue_work(afs_wq, &cell->manager);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
wait_for_cell:
|
|
|
|
_debug("wait_for_cell");
|
|
|
|
ret = wait_on_bit(&cell->flags, AFS_CELL_FL_NOT_READY, TASK_INTERRUPTIBLE);
|
|
|
|
smp_rmb();
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
switch (READ_ONCE(cell->state)) {
|
|
|
|
case AFS_CELL_FAILED:
|
|
|
|
ret = cell->error;
|
|
|
|
goto error;
|
|
|
|
default:
|
|
|
|
_debug("weird %u %d", cell->state, cell->error);
|
|
|
|
goto error;
|
|
|
|
case AFS_CELL_ACTIVE:
|
|
|
|
break;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
_leave(" = %p [cell]", cell);
|
2007-04-27 05:55:03 +07:00
|
|
|
return cell;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
cell_already_exists:
|
|
|
|
_debug("cell exists");
|
|
|
|
cell = cursor;
|
|
|
|
if (excl) {
|
|
|
|
ret = -EEXIST;
|
|
|
|
} else {
|
|
|
|
afs_get_cell(cursor);
|
|
|
|
ret = 0;
|
|
|
|
}
|
|
|
|
write_sequnlock(&net->cells_lock);
|
|
|
|
kfree(candidate);
|
|
|
|
if (ret == 0)
|
|
|
|
goto wait_for_cell;
|
2017-11-02 22:27:50 +07:00
|
|
|
goto error_noput;
|
2007-04-27 05:49:28 +07:00
|
|
|
error:
|
2017-11-02 22:27:50 +07:00
|
|
|
afs_put_cell(net, cell);
|
2017-11-02 22:27:50 +07:00
|
|
|
error_noput:
|
2017-11-02 22:27:50 +07:00
|
|
|
_leave(" = %d [error]", ret);
|
2007-04-27 05:55:03 +07:00
|
|
|
return ERR_PTR(ret);
|
2007-04-27 05:49:28 +07:00
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
2007-04-27 05:55:03 +07:00
|
|
|
* set the root cell information
|
|
|
|
* - can be called with a module parameter string
|
|
|
|
* - can be called from a write to /proc/fs/afs/rootcell
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2017-11-02 22:27:50 +07:00
|
|
|
int afs_cell_init(struct afs_net *net, const char *rootcell)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
|
|
|
struct afs_cell *old_root, *new_root;
|
2017-11-02 22:27:50 +07:00
|
|
|
const char *cp, *vllist;
|
|
|
|
size_t len;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
_enter("");
|
|
|
|
|
|
|
|
if (!rootcell) {
|
|
|
|
/* module is loaded with no parameters, or built statically.
|
|
|
|
* - in the future we might initialize cell DB here.
|
|
|
|
*/
|
2007-04-27 05:55:03 +07:00
|
|
|
_leave(" = 0 [no root]");
|
2005-04-17 05:20:36 +07:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
cp = strchr(rootcell, ':');
|
2017-11-02 22:27:50 +07:00
|
|
|
if (!cp) {
|
2010-08-04 21:16:38 +07:00
|
|
|
_debug("kAFS: no VL server IP addresses specified");
|
2017-11-02 22:27:50 +07:00
|
|
|
vllist = NULL;
|
|
|
|
len = strlen(rootcell);
|
|
|
|
} else {
|
|
|
|
vllist = cp + 1;
|
|
|
|
len = cp - rootcell;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/* allocate a cell record for the root cell */
|
2017-11-02 22:27:50 +07:00
|
|
|
new_root = afs_lookup_cell(net, rootcell, len, vllist, false);
|
2007-04-27 05:55:03 +07:00
|
|
|
if (IS_ERR(new_root)) {
|
|
|
|
_leave(" = %ld", PTR_ERR(new_root));
|
|
|
|
return PTR_ERR(new_root);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2018-04-10 03:12:31 +07:00
|
|
|
if (!test_and_set_bit(AFS_CELL_FL_NO_GC, &new_root->flags))
|
|
|
|
afs_get_cell(new_root);
|
2017-11-02 22:27:50 +07:00
|
|
|
|
2007-04-27 05:55:03 +07:00
|
|
|
/* install the new cell */
|
2017-11-02 22:27:50 +07:00
|
|
|
write_seqlock(&net->cells_lock);
|
2018-05-23 17:51:29 +07:00
|
|
|
old_root = rcu_access_pointer(net->ws_cell);
|
|
|
|
rcu_assign_pointer(net->ws_cell, new_root);
|
2017-11-02 22:27:50 +07:00
|
|
|
write_sequnlock(&net->cells_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
afs_put_cell(net, old_root);
|
2007-04-27 05:55:03 +07:00
|
|
|
_leave(" = 0");
|
|
|
|
return 0;
|
2007-04-27 05:49:28 +07:00
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
2017-11-02 22:27:50 +07:00
|
|
|
* Update a cell's VL server address list from the DNS.
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2017-11-02 22:27:50 +07:00
|
|
|
static void afs_update_cell(struct afs_cell *cell)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2018-10-20 06:57:57 +07:00
|
|
|
struct afs_vlserver_list *vllist, *old;
|
2018-10-20 06:57:57 +07:00
|
|
|
unsigned int min_ttl = READ_ONCE(afs_cell_min_ttl);
|
|
|
|
unsigned int max_ttl = READ_ONCE(afs_cell_max_ttl);
|
|
|
|
time64_t now, expiry = 0;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
_enter("%s", cell->name);
|
|
|
|
|
2018-10-20 06:57:57 +07:00
|
|
|
vllist = afs_dns_query(cell, &expiry);
|
2018-10-20 06:57:57 +07:00
|
|
|
|
|
|
|
now = ktime_get_real_seconds();
|
|
|
|
if (min_ttl > max_ttl)
|
|
|
|
max_ttl = min_ttl;
|
|
|
|
if (expiry < now + min_ttl)
|
|
|
|
expiry = now + min_ttl;
|
|
|
|
else if (expiry > now + max_ttl)
|
|
|
|
expiry = now + max_ttl;
|
|
|
|
|
2018-10-20 06:57:57 +07:00
|
|
|
if (IS_ERR(vllist)) {
|
|
|
|
switch (PTR_ERR(vllist)) {
|
2017-11-02 22:27:50 +07:00
|
|
|
case -ENODATA:
|
2018-10-20 06:57:57 +07:00
|
|
|
case -EDESTADDRREQ:
|
|
|
|
/* The DNS said that the cell does not exist or there
|
|
|
|
* weren't any addresses to be had.
|
|
|
|
*/
|
2017-11-02 22:27:50 +07:00
|
|
|
set_bit(AFS_CELL_FL_NOT_FOUND, &cell->flags);
|
|
|
|
clear_bit(AFS_CELL_FL_DNS_FAIL, &cell->flags);
|
2018-10-20 06:57:57 +07:00
|
|
|
cell->dns_expiry = expiry;
|
2017-11-02 22:27:50 +07:00
|
|
|
break;
|
2017-11-02 22:27:50 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
case -EAGAIN:
|
|
|
|
case -ECONNREFUSED:
|
|
|
|
default:
|
|
|
|
set_bit(AFS_CELL_FL_DNS_FAIL, &cell->flags);
|
2018-10-20 06:57:57 +07:00
|
|
|
cell->dns_expiry = now + 10;
|
2017-11-02 22:27:50 +07:00
|
|
|
break;
|
|
|
|
}
|
2017-11-02 22:27:50 +07:00
|
|
|
|
|
|
|
cell->error = -EDESTADDRREQ;
|
2017-11-02 22:27:50 +07:00
|
|
|
} else {
|
|
|
|
clear_bit(AFS_CELL_FL_DNS_FAIL, &cell->flags);
|
|
|
|
clear_bit(AFS_CELL_FL_NOT_FOUND, &cell->flags);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/* Exclusion on changing vl_addrs is achieved by a
|
|
|
|
* non-reentrant work item.
|
|
|
|
*/
|
2018-10-20 06:57:57 +07:00
|
|
|
old = rcu_dereference_protected(cell->vl_servers, true);
|
|
|
|
rcu_assign_pointer(cell->vl_servers, vllist);
|
2017-11-02 22:27:50 +07:00
|
|
|
cell->dns_expiry = expiry;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
if (old)
|
2018-10-20 06:57:57 +07:00
|
|
|
afs_put_vlserverlist(cell->net, old);
|
2017-11-02 22:27:50 +07:00
|
|
|
}
|
2010-08-11 15:38:04 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
if (test_and_clear_bit(AFS_CELL_FL_NO_LOOKUP_YET, &cell->flags))
|
|
|
|
wake_up_bit(&cell->flags, AFS_CELL_FL_NO_LOOKUP_YET);
|
2010-08-11 15:38:04 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
now = ktime_get_real_seconds();
|
2017-11-02 22:27:50 +07:00
|
|
|
afs_set_cell_timer(cell->net, cell->dns_expiry - now);
|
2017-11-02 22:27:50 +07:00
|
|
|
_leave("");
|
2007-04-27 05:49:28 +07:00
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
2017-11-02 22:27:50 +07:00
|
|
|
* Destroy a cell record
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2017-11-02 22:27:50 +07:00
|
|
|
static void afs_cell_destroy(struct rcu_head *rcu)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2017-11-02 22:27:50 +07:00
|
|
|
struct afs_cell *cell = container_of(rcu, struct afs_cell, rcu);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
_enter("%p{%s}", cell, cell->name);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
ASSERTCMP(atomic_read(&cell->usage), ==, 0);
|
|
|
|
|
2018-10-20 06:57:57 +07:00
|
|
|
afs_put_vlserverlist(cell->net, rcu_access_pointer(cell->vl_servers));
|
2017-11-02 22:27:50 +07:00
|
|
|
key_put(cell->anonymous_key);
|
|
|
|
kfree(cell);
|
|
|
|
|
|
|
|
_leave(" [destroyed]");
|
2007-04-27 05:49:28 +07:00
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
2017-11-02 22:27:50 +07:00
|
|
|
* Queue the cell manager.
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2017-11-02 22:27:50 +07:00
|
|
|
static void afs_queue_cell_manager(struct afs_net *net)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2017-11-02 22:27:50 +07:00
|
|
|
int outstanding = atomic_inc_return(&net->cells_outstanding);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
_enter("%d", outstanding);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
if (!queue_work(afs_wq, &net->cells_manager))
|
|
|
|
afs_dec_cells_outstanding(net);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Cell management timer. We have an increment on cells_outstanding that we
|
|
|
|
* need to pass along to the work item.
|
|
|
|
*/
|
|
|
|
void afs_cells_timer(struct timer_list *timer)
|
|
|
|
{
|
|
|
|
struct afs_net *net = container_of(timer, struct afs_net, cells_timer);
|
|
|
|
|
|
|
|
_enter("");
|
|
|
|
if (!queue_work(afs_wq, &net->cells_manager))
|
|
|
|
afs_dec_cells_outstanding(net);
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/*
|
|
|
|
* Get a reference on a cell record.
|
|
|
|
*/
|
|
|
|
struct afs_cell *afs_get_cell(struct afs_cell *cell)
|
|
|
|
{
|
|
|
|
atomic_inc(&cell->usage);
|
|
|
|
return cell;
|
|
|
|
}
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/*
|
|
|
|
* Drop a reference on a cell record.
|
|
|
|
*/
|
|
|
|
void afs_put_cell(struct afs_net *net, struct afs_cell *cell)
|
|
|
|
{
|
|
|
|
time64_t now, expire_delay;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
if (!cell)
|
2005-04-17 05:20:36 +07:00
|
|
|
return;
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
_enter("%s", cell->name);
|
2007-04-27 05:55:03 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
now = ktime_get_real_seconds();
|
|
|
|
cell->last_inactive = now;
|
|
|
|
expire_delay = 0;
|
|
|
|
if (!test_bit(AFS_CELL_FL_DNS_FAIL, &cell->flags) &&
|
|
|
|
!test_bit(AFS_CELL_FL_NOT_FOUND, &cell->flags))
|
|
|
|
expire_delay = afs_cell_gc_delay;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
if (atomic_dec_return(&cell->usage) > 1)
|
|
|
|
return;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/* 'cell' may now be garbage collected. */
|
|
|
|
afs_set_cell_timer(net, expire_delay);
|
2007-04-27 05:49:28 +07:00
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
2017-11-02 22:27:50 +07:00
|
|
|
* Allocate a key to use as a placeholder for anonymous user security.
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2017-11-02 22:27:50 +07:00
|
|
|
static int afs_alloc_anon_key(struct afs_cell *cell)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2017-11-02 22:27:50 +07:00
|
|
|
struct key *key;
|
|
|
|
char keyname[4 + AFS_MAXCELLNAME + 1], *cp, *dp;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/* Create a key to represent an anonymous user. */
|
|
|
|
memcpy(keyname, "afs@", 4);
|
|
|
|
dp = keyname + 4;
|
|
|
|
cp = cell->name;
|
|
|
|
do {
|
|
|
|
*dp++ = tolower(*cp);
|
|
|
|
} while (*cp++);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
key = rxrpc_get_null_key(keyname);
|
|
|
|
if (IS_ERR(key))
|
|
|
|
return PTR_ERR(key);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
cell->anonymous_key = key;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
_debug("anon key %p{%x}",
|
|
|
|
cell->anonymous_key, key_serial(cell->anonymous_key));
|
|
|
|
return 0;
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/*
|
|
|
|
* Activate a cell.
|
|
|
|
*/
|
|
|
|
static int afs_activate_cell(struct afs_net *net, struct afs_cell *cell)
|
|
|
|
{
|
2018-10-12 04:45:49 +07:00
|
|
|
struct hlist_node **p;
|
|
|
|
struct afs_cell *pcell;
|
2017-11-02 22:27:50 +07:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (!cell->anonymous_key) {
|
|
|
|
ret = afs_alloc_anon_key(cell);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
2007-04-27 05:55:03 +07:00
|
|
|
}
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
#ifdef CONFIG_AFS_FSCACHE
|
|
|
|
cell->cache = fscache_acquire_cookie(afs_cache_netfs.primary_index,
|
|
|
|
&afs_cell_cache_index_def,
|
2018-04-04 19:41:28 +07:00
|
|
|
cell->name, strlen(cell->name),
|
|
|
|
NULL, 0,
|
2018-04-04 19:41:28 +07:00
|
|
|
cell, 0, true);
|
2017-11-02 22:27:50 +07:00
|
|
|
#endif
|
2018-05-18 17:46:15 +07:00
|
|
|
ret = afs_proc_cell_setup(cell);
|
2017-11-02 22:27:50 +07:00
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
2018-06-15 21:19:22 +07:00
|
|
|
|
|
|
|
mutex_lock(&net->proc_cells_lock);
|
2018-10-12 04:45:49 +07:00
|
|
|
for (p = &net->proc_cells.first; *p; p = &(*p)->next) {
|
|
|
|
pcell = hlist_entry(*p, struct afs_cell, proc_link);
|
|
|
|
if (strcmp(cell->name, pcell->name) < 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
cell->proc_link.pprev = p;
|
|
|
|
cell->proc_link.next = *p;
|
|
|
|
rcu_assign_pointer(*p, &cell->proc_link.next);
|
|
|
|
if (cell->proc_link.next)
|
|
|
|
cell->proc_link.next->pprev = &cell->proc_link.next;
|
|
|
|
|
2018-06-15 21:19:22 +07:00
|
|
|
afs_dynroot_mkdir(net, cell);
|
|
|
|
mutex_unlock(&net->proc_cells_lock);
|
2017-11-02 22:27:50 +07:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Deactivate a cell.
|
|
|
|
*/
|
|
|
|
static void afs_deactivate_cell(struct afs_net *net, struct afs_cell *cell)
|
|
|
|
{
|
|
|
|
_enter("%s", cell->name);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2018-05-18 17:46:15 +07:00
|
|
|
afs_proc_cell_remove(cell);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2018-06-15 21:19:22 +07:00
|
|
|
mutex_lock(&net->proc_cells_lock);
|
2018-10-12 04:45:49 +07:00
|
|
|
hlist_del_rcu(&cell->proc_link);
|
2018-06-15 21:19:22 +07:00
|
|
|
afs_dynroot_rmdir(net, cell);
|
|
|
|
mutex_unlock(&net->proc_cells_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2009-04-03 22:42:41 +07:00
|
|
|
#ifdef CONFIG_AFS_FSCACHE
|
2018-04-04 19:41:28 +07:00
|
|
|
fscache_relinquish_cookie(cell->cache, NULL, false);
|
2017-11-02 22:27:50 +07:00
|
|
|
cell->cache = NULL;
|
2005-04-17 05:20:36 +07:00
|
|
|
#endif
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
_leave("");
|
2007-04-27 05:49:28 +07:00
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
/*
|
2017-11-02 22:27:50 +07:00
|
|
|
* Manage a cell record, initialising and destroying it, maintaining its DNS
|
|
|
|
* records.
|
2005-04-17 05:20:36 +07:00
|
|
|
*/
|
2017-11-02 22:27:50 +07:00
|
|
|
static void afs_manage_cell(struct work_struct *work)
|
2005-04-17 05:20:36 +07:00
|
|
|
{
|
2017-11-02 22:27:50 +07:00
|
|
|
struct afs_cell *cell = container_of(work, struct afs_cell, manager);
|
|
|
|
struct afs_net *net = cell->net;
|
|
|
|
bool deleted;
|
|
|
|
int ret, usage;
|
|
|
|
|
|
|
|
_enter("%s", cell->name);
|
|
|
|
|
|
|
|
again:
|
|
|
|
_debug("state %u", cell->state);
|
|
|
|
switch (cell->state) {
|
|
|
|
case AFS_CELL_INACTIVE:
|
|
|
|
case AFS_CELL_FAILED:
|
|
|
|
write_seqlock(&net->cells_lock);
|
|
|
|
usage = 1;
|
|
|
|
deleted = atomic_try_cmpxchg_relaxed(&cell->usage, &usage, 0);
|
|
|
|
if (deleted)
|
|
|
|
rb_erase(&cell->net_node, &net->cells);
|
|
|
|
write_sequnlock(&net->cells_lock);
|
|
|
|
if (deleted)
|
|
|
|
goto final_destruction;
|
|
|
|
if (cell->state == AFS_CELL_FAILED)
|
|
|
|
goto done;
|
|
|
|
cell->state = AFS_CELL_UNSET;
|
|
|
|
goto again;
|
|
|
|
|
|
|
|
case AFS_CELL_UNSET:
|
|
|
|
cell->state = AFS_CELL_ACTIVATING;
|
|
|
|
goto again;
|
|
|
|
|
|
|
|
case AFS_CELL_ACTIVATING:
|
|
|
|
ret = afs_activate_cell(net, cell);
|
|
|
|
if (ret < 0)
|
|
|
|
goto activation_failed;
|
|
|
|
|
|
|
|
cell->state = AFS_CELL_ACTIVE;
|
|
|
|
smp_wmb();
|
|
|
|
clear_bit(AFS_CELL_FL_NOT_READY, &cell->flags);
|
|
|
|
wake_up_bit(&cell->flags, AFS_CELL_FL_NOT_READY);
|
|
|
|
goto again;
|
|
|
|
|
|
|
|
case AFS_CELL_ACTIVE:
|
|
|
|
if (atomic_read(&cell->usage) > 1) {
|
|
|
|
time64_t now = ktime_get_real_seconds();
|
|
|
|
if (cell->dns_expiry <= now && net->live)
|
|
|
|
afs_update_cell(cell);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
cell->state = AFS_CELL_DEACTIVATING;
|
|
|
|
goto again;
|
|
|
|
|
|
|
|
case AFS_CELL_DEACTIVATING:
|
|
|
|
set_bit(AFS_CELL_FL_NOT_READY, &cell->flags);
|
|
|
|
if (atomic_read(&cell->usage) > 1)
|
|
|
|
goto reverse_deactivation;
|
|
|
|
afs_deactivate_cell(net, cell);
|
|
|
|
cell->state = AFS_CELL_INACTIVE;
|
|
|
|
goto again;
|
|
|
|
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
_debug("bad state %u", cell->state);
|
|
|
|
BUG(); /* Unhandled state */
|
|
|
|
|
|
|
|
activation_failed:
|
|
|
|
cell->error = ret;
|
|
|
|
afs_deactivate_cell(net, cell);
|
|
|
|
|
|
|
|
cell->state = AFS_CELL_FAILED;
|
|
|
|
smp_wmb();
|
|
|
|
if (test_and_clear_bit(AFS_CELL_FL_NOT_READY, &cell->flags))
|
|
|
|
wake_up_bit(&cell->flags, AFS_CELL_FL_NOT_READY);
|
|
|
|
goto again;
|
|
|
|
|
|
|
|
reverse_deactivation:
|
|
|
|
cell->state = AFS_CELL_ACTIVE;
|
|
|
|
smp_wmb();
|
|
|
|
clear_bit(AFS_CELL_FL_NOT_READY, &cell->flags);
|
|
|
|
wake_up_bit(&cell->flags, AFS_CELL_FL_NOT_READY);
|
|
|
|
_leave(" [deact->act]");
|
|
|
|
return;
|
|
|
|
|
|
|
|
done:
|
|
|
|
_leave(" [done %u]", cell->state);
|
|
|
|
return;
|
|
|
|
|
|
|
|
final_destruction:
|
|
|
|
call_rcu(&cell->rcu, afs_cell_destroy);
|
|
|
|
afs_dec_cells_outstanding(net);
|
|
|
|
_leave(" [destruct %d]", atomic_read(&net->cells_outstanding));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Manage the records of cells known to a network namespace. This includes
|
|
|
|
* updating the DNS records and garbage collecting unused cells that were
|
|
|
|
* automatically added.
|
|
|
|
*
|
|
|
|
* Note that constructed cell records may only be removed from net->cells by
|
|
|
|
* this work item, so it is safe for this work item to stash a cursor pointing
|
|
|
|
* into the tree and then return to caller (provided it skips cells that are
|
|
|
|
* still under construction).
|
|
|
|
*
|
|
|
|
* Note also that we were given an increment on net->cells_outstanding by
|
|
|
|
* whoever queued us that we need to deal with before returning.
|
|
|
|
*/
|
|
|
|
void afs_manage_cells(struct work_struct *work)
|
|
|
|
{
|
|
|
|
struct afs_net *net = container_of(work, struct afs_net, cells_manager);
|
|
|
|
struct rb_node *cursor;
|
|
|
|
time64_t now = ktime_get_real_seconds(), next_manage = TIME64_MAX;
|
|
|
|
bool purging = !net->live;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
|
|
|
_enter("");
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/* Trawl the cell database looking for cells that have expired from
|
|
|
|
* lack of use and cells whose DNS results have expired and dispatch
|
|
|
|
* their managers.
|
|
|
|
*/
|
|
|
|
read_seqlock_excl(&net->cells_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
for (cursor = rb_first(&net->cells); cursor; cursor = rb_next(cursor)) {
|
|
|
|
struct afs_cell *cell =
|
|
|
|
rb_entry(cursor, struct afs_cell, net_node);
|
|
|
|
unsigned usage;
|
|
|
|
bool sched_cell = false;
|
2007-04-27 05:55:03 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
usage = atomic_read(&cell->usage);
|
|
|
|
_debug("manage %s %u", cell->name, usage);
|
|
|
|
|
|
|
|
ASSERTCMP(usage, >=, 1);
|
|
|
|
|
|
|
|
if (purging) {
|
|
|
|
if (test_and_clear_bit(AFS_CELL_FL_NO_GC, &cell->flags))
|
|
|
|
usage = atomic_dec_return(&cell->usage);
|
|
|
|
ASSERTCMP(usage, ==, 1);
|
|
|
|
}
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
if (usage == 1) {
|
|
|
|
time64_t expire_at = cell->last_inactive;
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
if (!test_bit(AFS_CELL_FL_DNS_FAIL, &cell->flags) &&
|
|
|
|
!test_bit(AFS_CELL_FL_NOT_FOUND, &cell->flags))
|
|
|
|
expire_at += afs_cell_gc_delay;
|
|
|
|
if (purging || expire_at <= now)
|
|
|
|
sched_cell = true;
|
|
|
|
else if (expire_at < next_manage)
|
|
|
|
next_manage = expire_at;
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
if (!purging) {
|
|
|
|
if (cell->dns_expiry <= now)
|
|
|
|
sched_cell = true;
|
|
|
|
else if (cell->dns_expiry <= next_manage)
|
|
|
|
next_manage = cell->dns_expiry;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (sched_cell)
|
|
|
|
queue_work(afs_wq, &cell->manager);
|
|
|
|
}
|
|
|
|
|
|
|
|
read_sequnlock_excl(&net->cells_lock);
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
/* Update the timer on the way out. We have to pass an increment on
|
|
|
|
* cells_outstanding in the namespace that we are in to the timer or
|
|
|
|
* the work scheduler.
|
|
|
|
*/
|
|
|
|
if (!purging && next_manage < TIME64_MAX) {
|
|
|
|
now = ktime_get_real_seconds();
|
2005-04-17 05:20:36 +07:00
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
if (next_manage - now <= 0) {
|
|
|
|
if (queue_work(afs_wq, &net->cells_manager))
|
|
|
|
atomic_inc(&net->cells_outstanding);
|
|
|
|
} else {
|
|
|
|
afs_set_cell_timer(net, next_manage - now);
|
2005-04-17 05:20:36 +07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-11-02 22:27:50 +07:00
|
|
|
afs_dec_cells_outstanding(net);
|
|
|
|
_leave(" [%d]", atomic_read(&net->cells_outstanding));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Purge in-memory cell database.
|
|
|
|
*/
|
|
|
|
void afs_cell_purge(struct afs_net *net)
|
|
|
|
{
|
|
|
|
struct afs_cell *ws;
|
|
|
|
|
|
|
|
_enter("");
|
|
|
|
|
|
|
|
write_seqlock(&net->cells_lock);
|
2018-05-23 17:51:29 +07:00
|
|
|
ws = rcu_access_pointer(net->ws_cell);
|
|
|
|
RCU_INIT_POINTER(net->ws_cell, NULL);
|
2017-11-02 22:27:50 +07:00
|
|
|
write_sequnlock(&net->cells_lock);
|
|
|
|
afs_put_cell(net, ws);
|
|
|
|
|
|
|
|
_debug("del timer");
|
|
|
|
if (del_timer_sync(&net->cells_timer))
|
|
|
|
atomic_dec(&net->cells_outstanding);
|
|
|
|
|
|
|
|
_debug("kick mgr");
|
|
|
|
afs_queue_cell_manager(net);
|
|
|
|
|
|
|
|
_debug("wait");
|
2018-03-15 17:42:28 +07:00
|
|
|
wait_var_event(&net->cells_outstanding,
|
|
|
|
!atomic_read(&net->cells_outstanding));
|
2005-04-17 05:20:36 +07:00
|
|
|
_leave("");
|
2007-04-27 05:49:28 +07:00
|
|
|
}
|