d2ddc776a4
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>
629 lines
14 KiB
C
629 lines
14 KiB
C
/* /proc interface for AFS
|
|
*
|
|
* Copyright (C) 2002 Red Hat, Inc. All Rights Reserved.
|
|
* 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>
|
|
#include <linux/module.h>
|
|
#include <linux/proc_fs.h>
|
|
#include <linux/seq_file.h>
|
|
#include <linux/sched.h>
|
|
#include <linux/uaccess.h>
|
|
#include "internal.h"
|
|
|
|
static inline struct afs_net *afs_proc2net(struct file *f)
|
|
{
|
|
return &__afs_net;
|
|
}
|
|
|
|
static inline struct afs_net *afs_seq2net(struct seq_file *m)
|
|
{
|
|
return &__afs_net; // TODO: use seq_file_net(m)
|
|
}
|
|
|
|
static int afs_proc_cells_open(struct inode *inode, struct file *file);
|
|
static void *afs_proc_cells_start(struct seq_file *p, loff_t *pos);
|
|
static void *afs_proc_cells_next(struct seq_file *p, void *v, loff_t *pos);
|
|
static void afs_proc_cells_stop(struct seq_file *p, void *v);
|
|
static int afs_proc_cells_show(struct seq_file *m, void *v);
|
|
static ssize_t afs_proc_cells_write(struct file *file, const char __user *buf,
|
|
size_t size, loff_t *_pos);
|
|
|
|
static const struct seq_operations afs_proc_cells_ops = {
|
|
.start = afs_proc_cells_start,
|
|
.next = afs_proc_cells_next,
|
|
.stop = afs_proc_cells_stop,
|
|
.show = afs_proc_cells_show,
|
|
};
|
|
|
|
static const struct file_operations afs_proc_cells_fops = {
|
|
.open = afs_proc_cells_open,
|
|
.read = seq_read,
|
|
.write = afs_proc_cells_write,
|
|
.llseek = seq_lseek,
|
|
.release = seq_release,
|
|
};
|
|
|
|
static ssize_t afs_proc_rootcell_read(struct file *file, char __user *buf,
|
|
size_t size, loff_t *_pos);
|
|
static ssize_t afs_proc_rootcell_write(struct file *file,
|
|
const char __user *buf,
|
|
size_t size, loff_t *_pos);
|
|
|
|
static const struct file_operations afs_proc_rootcell_fops = {
|
|
.read = afs_proc_rootcell_read,
|
|
.write = afs_proc_rootcell_write,
|
|
.llseek = no_llseek,
|
|
};
|
|
|
|
static int afs_proc_cell_volumes_open(struct inode *inode, struct file *file);
|
|
static void *afs_proc_cell_volumes_start(struct seq_file *p, loff_t *pos);
|
|
static void *afs_proc_cell_volumes_next(struct seq_file *p, void *v,
|
|
loff_t *pos);
|
|
static void afs_proc_cell_volumes_stop(struct seq_file *p, void *v);
|
|
static int afs_proc_cell_volumes_show(struct seq_file *m, void *v);
|
|
|
|
static const struct seq_operations afs_proc_cell_volumes_ops = {
|
|
.start = afs_proc_cell_volumes_start,
|
|
.next = afs_proc_cell_volumes_next,
|
|
.stop = afs_proc_cell_volumes_stop,
|
|
.show = afs_proc_cell_volumes_show,
|
|
};
|
|
|
|
static const struct file_operations afs_proc_cell_volumes_fops = {
|
|
.open = afs_proc_cell_volumes_open,
|
|
.read = seq_read,
|
|
.llseek = seq_lseek,
|
|
.release = seq_release,
|
|
};
|
|
|
|
static int afs_proc_cell_vlservers_open(struct inode *inode,
|
|
struct file *file);
|
|
static void *afs_proc_cell_vlservers_start(struct seq_file *p, loff_t *pos);
|
|
static void *afs_proc_cell_vlservers_next(struct seq_file *p, void *v,
|
|
loff_t *pos);
|
|
static void afs_proc_cell_vlservers_stop(struct seq_file *p, void *v);
|
|
static int afs_proc_cell_vlservers_show(struct seq_file *m, void *v);
|
|
|
|
static const struct seq_operations afs_proc_cell_vlservers_ops = {
|
|
.start = afs_proc_cell_vlservers_start,
|
|
.next = afs_proc_cell_vlservers_next,
|
|
.stop = afs_proc_cell_vlservers_stop,
|
|
.show = afs_proc_cell_vlservers_show,
|
|
};
|
|
|
|
static const struct file_operations afs_proc_cell_vlservers_fops = {
|
|
.open = afs_proc_cell_vlservers_open,
|
|
.read = seq_read,
|
|
.llseek = seq_lseek,
|
|
.release = seq_release,
|
|
};
|
|
|
|
static int afs_proc_servers_open(struct inode *inode, struct file *file);
|
|
static void *afs_proc_servers_start(struct seq_file *p, loff_t *pos);
|
|
static void *afs_proc_servers_next(struct seq_file *p, void *v,
|
|
loff_t *pos);
|
|
static void afs_proc_servers_stop(struct seq_file *p, void *v);
|
|
static int afs_proc_servers_show(struct seq_file *m, void *v);
|
|
|
|
static const struct seq_operations afs_proc_servers_ops = {
|
|
.start = afs_proc_servers_start,
|
|
.next = afs_proc_servers_next,
|
|
.stop = afs_proc_servers_stop,
|
|
.show = afs_proc_servers_show,
|
|
};
|
|
|
|
static const struct file_operations afs_proc_servers_fops = {
|
|
.open = afs_proc_servers_open,
|
|
.read = seq_read,
|
|
.llseek = seq_lseek,
|
|
.release = seq_release,
|
|
};
|
|
|
|
/*
|
|
* initialise the /proc/fs/afs/ directory
|
|
*/
|
|
int afs_proc_init(struct afs_net *net)
|
|
{
|
|
_enter("");
|
|
|
|
net->proc_afs = proc_mkdir("fs/afs", NULL);
|
|
if (!net->proc_afs)
|
|
goto error_dir;
|
|
|
|
if (!proc_create("cells", 0644, net->proc_afs, &afs_proc_cells_fops) ||
|
|
!proc_create("rootcell", 0644, net->proc_afs, &afs_proc_rootcell_fops) ||
|
|
!proc_create("servers", 0644, net->proc_afs, &afs_proc_servers_fops))
|
|
goto error_tree;
|
|
|
|
_leave(" = 0");
|
|
return 0;
|
|
|
|
error_tree:
|
|
proc_remove(net->proc_afs);
|
|
error_dir:
|
|
_leave(" = -ENOMEM");
|
|
return -ENOMEM;
|
|
}
|
|
|
|
/*
|
|
* clean up the /proc/fs/afs/ directory
|
|
*/
|
|
void afs_proc_cleanup(struct afs_net *net)
|
|
{
|
|
proc_remove(net->proc_afs);
|
|
net->proc_afs = NULL;
|
|
}
|
|
|
|
/*
|
|
* open "/proc/fs/afs/cells" which provides a summary of extant cells
|
|
*/
|
|
static int afs_proc_cells_open(struct inode *inode, struct file *file)
|
|
{
|
|
struct seq_file *m;
|
|
int ret;
|
|
|
|
ret = seq_open(file, &afs_proc_cells_ops);
|
|
if (ret < 0)
|
|
return ret;
|
|
|
|
m = file->private_data;
|
|
m->private = PDE_DATA(inode);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* set up the iterator to start reading from the cells list and return the
|
|
* first item
|
|
*/
|
|
static void *afs_proc_cells_start(struct seq_file *m, loff_t *_pos)
|
|
{
|
|
struct afs_net *net = afs_seq2net(m);
|
|
|
|
rcu_read_lock();
|
|
return seq_list_start_head(&net->proc_cells, *_pos);
|
|
}
|
|
|
|
/*
|
|
* move to next cell in cells list
|
|
*/
|
|
static void *afs_proc_cells_next(struct seq_file *m, void *v, loff_t *pos)
|
|
{
|
|
struct afs_net *net = afs_seq2net(m);
|
|
|
|
return seq_list_next(v, &net->proc_cells, pos);
|
|
}
|
|
|
|
/*
|
|
* clean up after reading from the cells list
|
|
*/
|
|
static void afs_proc_cells_stop(struct seq_file *m, void *v)
|
|
{
|
|
rcu_read_unlock();
|
|
}
|
|
|
|
/*
|
|
* display a header line followed by a load of cell lines
|
|
*/
|
|
static int afs_proc_cells_show(struct seq_file *m, void *v)
|
|
{
|
|
struct afs_cell *cell = list_entry(v, struct afs_cell, proc_link);
|
|
struct afs_net *net = afs_seq2net(m);
|
|
|
|
if (v == &net->proc_cells) {
|
|
/* display header on line 1 */
|
|
seq_puts(m, "USE NAME\n");
|
|
return 0;
|
|
}
|
|
|
|
/* display one cell per line on subsequent lines */
|
|
seq_printf(m, "%3u %s\n", atomic_read(&cell->usage), cell->name);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* handle writes to /proc/fs/afs/cells
|
|
* - to add cells: echo "add <cellname> <IP>[:<IP>][:<IP>]"
|
|
*/
|
|
static ssize_t afs_proc_cells_write(struct file *file, const char __user *buf,
|
|
size_t size, loff_t *_pos)
|
|
{
|
|
struct afs_net *net = afs_proc2net(file);
|
|
char *kbuf, *name, *args;
|
|
int ret;
|
|
|
|
/* start by dragging the command into memory */
|
|
if (size <= 1 || size >= PAGE_SIZE)
|
|
return -EINVAL;
|
|
|
|
kbuf = memdup_user_nul(buf, size);
|
|
if (IS_ERR(kbuf))
|
|
return PTR_ERR(kbuf);
|
|
|
|
/* trim to first NL */
|
|
name = memchr(kbuf, '\n', size);
|
|
if (name)
|
|
*name = 0;
|
|
|
|
/* split into command, name and argslist */
|
|
name = strchr(kbuf, ' ');
|
|
if (!name)
|
|
goto inval;
|
|
do {
|
|
*name++ = 0;
|
|
} while(*name == ' ');
|
|
if (!*name)
|
|
goto inval;
|
|
|
|
args = strchr(name, ' ');
|
|
if (!args)
|
|
goto inval;
|
|
do {
|
|
*args++ = 0;
|
|
} while(*args == ' ');
|
|
if (!*args)
|
|
goto inval;
|
|
|
|
/* determine command to perform */
|
|
_debug("cmd=%s name=%s args=%s", kbuf, name, args);
|
|
|
|
if (strcmp(kbuf, "add") == 0) {
|
|
struct afs_cell *cell;
|
|
|
|
cell = afs_lookup_cell(net, name, strlen(name), args, true);
|
|
if (IS_ERR(cell)) {
|
|
ret = PTR_ERR(cell);
|
|
goto done;
|
|
}
|
|
|
|
set_bit(AFS_CELL_FL_NO_GC, &cell->flags);
|
|
printk("kAFS: Added new cell '%s'\n", name);
|
|
} else {
|
|
goto inval;
|
|
}
|
|
|
|
ret = size;
|
|
|
|
done:
|
|
kfree(kbuf);
|
|
_leave(" = %d", ret);
|
|
return ret;
|
|
|
|
inval:
|
|
ret = -EINVAL;
|
|
printk("kAFS: Invalid Command on /proc/fs/afs/cells file\n");
|
|
goto done;
|
|
}
|
|
|
|
static ssize_t afs_proc_rootcell_read(struct file *file, char __user *buf,
|
|
size_t size, loff_t *_pos)
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* handle writes to /proc/fs/afs/rootcell
|
|
* - to initialize rootcell: echo "cell.name:192.168.231.14"
|
|
*/
|
|
static ssize_t afs_proc_rootcell_write(struct file *file,
|
|
const char __user *buf,
|
|
size_t size, loff_t *_pos)
|
|
{
|
|
struct afs_net *net = afs_proc2net(file);
|
|
char *kbuf, *s;
|
|
int ret;
|
|
|
|
/* start by dragging the command into memory */
|
|
if (size <= 1 || size >= PAGE_SIZE)
|
|
return -EINVAL;
|
|
|
|
kbuf = memdup_user_nul(buf, size);
|
|
if (IS_ERR(kbuf))
|
|
return PTR_ERR(kbuf);
|
|
|
|
/* trim to first NL */
|
|
s = memchr(kbuf, '\n', size);
|
|
if (s)
|
|
*s = 0;
|
|
|
|
/* determine command to perform */
|
|
_debug("rootcell=%s", kbuf);
|
|
|
|
ret = afs_cell_init(net, kbuf);
|
|
if (ret >= 0)
|
|
ret = size; /* consume everything, always */
|
|
|
|
kfree(kbuf);
|
|
_leave(" = %d", ret);
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
* initialise /proc/fs/afs/<cell>/
|
|
*/
|
|
int afs_proc_cell_setup(struct afs_net *net, struct afs_cell *cell)
|
|
{
|
|
struct proc_dir_entry *dir;
|
|
|
|
_enter("%p{%s},%p", cell, cell->name, net->proc_afs);
|
|
|
|
dir = proc_mkdir(cell->name, net->proc_afs);
|
|
if (!dir)
|
|
goto error_dir;
|
|
|
|
if (!proc_create_data("vlservers", 0, dir,
|
|
&afs_proc_cell_vlservers_fops, cell) ||
|
|
!proc_create_data("volumes", 0, dir,
|
|
&afs_proc_cell_volumes_fops, cell))
|
|
goto error_tree;
|
|
|
|
_leave(" = 0");
|
|
return 0;
|
|
|
|
error_tree:
|
|
remove_proc_subtree(cell->name, net->proc_afs);
|
|
error_dir:
|
|
_leave(" = -ENOMEM");
|
|
return -ENOMEM;
|
|
}
|
|
|
|
/*
|
|
* remove /proc/fs/afs/<cell>/
|
|
*/
|
|
void afs_proc_cell_remove(struct afs_net *net, struct afs_cell *cell)
|
|
{
|
|
_enter("");
|
|
|
|
remove_proc_subtree(cell->name, net->proc_afs);
|
|
|
|
_leave("");
|
|
}
|
|
|
|
/*
|
|
* open "/proc/fs/afs/<cell>/volumes" which provides a summary of extant cells
|
|
*/
|
|
static int afs_proc_cell_volumes_open(struct inode *inode, struct file *file)
|
|
{
|
|
struct afs_cell *cell;
|
|
struct seq_file *m;
|
|
int ret;
|
|
|
|
cell = PDE_DATA(inode);
|
|
if (!cell)
|
|
return -ENOENT;
|
|
|
|
ret = seq_open(file, &afs_proc_cell_volumes_ops);
|
|
if (ret < 0)
|
|
return ret;
|
|
|
|
m = file->private_data;
|
|
m->private = cell;
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* set up the iterator to start reading from the cells list and return the
|
|
* first item
|
|
*/
|
|
static void *afs_proc_cell_volumes_start(struct seq_file *m, loff_t *_pos)
|
|
{
|
|
struct afs_cell *cell = m->private;
|
|
|
|
_enter("cell=%p pos=%Ld", cell, *_pos);
|
|
|
|
read_lock(&cell->proc_lock);
|
|
return seq_list_start_head(&cell->proc_volumes, *_pos);
|
|
}
|
|
|
|
/*
|
|
* move to next cell in cells list
|
|
*/
|
|
static void *afs_proc_cell_volumes_next(struct seq_file *p, void *v,
|
|
loff_t *_pos)
|
|
{
|
|
struct afs_cell *cell = p->private;
|
|
|
|
_enter("cell=%p pos=%Ld", cell, *_pos);
|
|
return seq_list_next(v, &cell->proc_volumes, _pos);
|
|
}
|
|
|
|
/*
|
|
* clean up after reading from the cells list
|
|
*/
|
|
static void afs_proc_cell_volumes_stop(struct seq_file *p, void *v)
|
|
{
|
|
struct afs_cell *cell = p->private;
|
|
|
|
read_unlock(&cell->proc_lock);
|
|
}
|
|
|
|
static const char afs_vol_types[3][3] = {
|
|
[AFSVL_RWVOL] = "RW",
|
|
[AFSVL_ROVOL] = "RO",
|
|
[AFSVL_BACKVOL] = "BK",
|
|
};
|
|
|
|
/*
|
|
* display a header line followed by a load of volume lines
|
|
*/
|
|
static int afs_proc_cell_volumes_show(struct seq_file *m, void *v)
|
|
{
|
|
struct afs_cell *cell = m->private;
|
|
struct afs_volume *vol = list_entry(v, struct afs_volume, proc_link);
|
|
|
|
/* Display header on line 1 */
|
|
if (v == &cell->proc_volumes) {
|
|
seq_puts(m, "USE VID TY\n");
|
|
return 0;
|
|
}
|
|
|
|
seq_printf(m, "%3d %08x %s\n",
|
|
atomic_read(&vol->usage), vol->vid,
|
|
afs_vol_types[vol->type]);
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* open "/proc/fs/afs/<cell>/vlservers" which provides a list of volume
|
|
* location server
|
|
*/
|
|
static int afs_proc_cell_vlservers_open(struct inode *inode, struct file *file)
|
|
{
|
|
struct afs_cell *cell;
|
|
struct seq_file *m;
|
|
int ret;
|
|
|
|
cell = PDE_DATA(inode);
|
|
if (!cell)
|
|
return -ENOENT;
|
|
|
|
ret = seq_open(file, &afs_proc_cell_vlservers_ops);
|
|
if (ret<0)
|
|
return ret;
|
|
|
|
m = file->private_data;
|
|
m->private = cell;
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* set up the iterator to start reading from the cells list and return the
|
|
* first item
|
|
*/
|
|
static void *afs_proc_cell_vlservers_start(struct seq_file *m, loff_t *_pos)
|
|
{
|
|
struct afs_addr_list *alist;
|
|
struct afs_cell *cell = m->private;
|
|
loff_t pos = *_pos;
|
|
|
|
rcu_read_lock();
|
|
|
|
alist = rcu_dereference(cell->vl_addrs);
|
|
|
|
/* allow for the header line */
|
|
if (!pos)
|
|
return (void *) 1;
|
|
pos--;
|
|
|
|
if (!alist || pos >= alist->nr_addrs)
|
|
return NULL;
|
|
|
|
return alist->addrs + pos;
|
|
}
|
|
|
|
/*
|
|
* move to next cell in cells list
|
|
*/
|
|
static void *afs_proc_cell_vlservers_next(struct seq_file *p, void *v,
|
|
loff_t *_pos)
|
|
{
|
|
struct afs_addr_list *alist;
|
|
struct afs_cell *cell = p->private;
|
|
loff_t pos;
|
|
|
|
alist = rcu_dereference(cell->vl_addrs);
|
|
|
|
pos = *_pos;
|
|
(*_pos)++;
|
|
if (!alist || pos >= alist->nr_addrs)
|
|
return NULL;
|
|
|
|
return alist->addrs + pos;
|
|
}
|
|
|
|
/*
|
|
* clean up after reading from the cells list
|
|
*/
|
|
static void afs_proc_cell_vlservers_stop(struct seq_file *p, void *v)
|
|
{
|
|
rcu_read_unlock();
|
|
}
|
|
|
|
/*
|
|
* display a header line followed by a load of volume lines
|
|
*/
|
|
static int afs_proc_cell_vlservers_show(struct seq_file *m, void *v)
|
|
{
|
|
struct sockaddr_rxrpc *addr = v;
|
|
|
|
/* display header on line 1 */
|
|
if (v == (void *)1) {
|
|
seq_puts(m, "ADDRESS\n");
|
|
return 0;
|
|
}
|
|
|
|
/* display one cell per line on subsequent lines */
|
|
seq_printf(m, "%pISp\n", &addr->transport);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* open "/proc/fs/afs/servers" which provides a summary of active
|
|
* servers
|
|
*/
|
|
static int afs_proc_servers_open(struct inode *inode, struct file *file)
|
|
{
|
|
return seq_open(file, &afs_proc_servers_ops);
|
|
}
|
|
|
|
/*
|
|
* Set up the iterator to start reading from the server list and return the
|
|
* first item.
|
|
*/
|
|
static void *afs_proc_servers_start(struct seq_file *m, loff_t *_pos)
|
|
{
|
|
struct afs_net *net = afs_seq2net(m);
|
|
|
|
rcu_read_lock();
|
|
return seq_hlist_start_head_rcu(&net->fs_proc, *_pos);
|
|
}
|
|
|
|
/*
|
|
* move to next cell in cells list
|
|
*/
|
|
static void *afs_proc_servers_next(struct seq_file *m, void *v, loff_t *_pos)
|
|
{
|
|
struct afs_net *net = afs_seq2net(m);
|
|
|
|
return seq_hlist_next_rcu(v, &net->fs_proc, _pos);
|
|
}
|
|
|
|
/*
|
|
* clean up after reading from the cells list
|
|
*/
|
|
static void afs_proc_servers_stop(struct seq_file *p, void *v)
|
|
{
|
|
rcu_read_unlock();
|
|
}
|
|
|
|
/*
|
|
* display a header line followed by a load of volume lines
|
|
*/
|
|
static int afs_proc_servers_show(struct seq_file *m, void *v)
|
|
{
|
|
struct afs_server *server;
|
|
struct afs_addr_list *alist;
|
|
|
|
if (v == SEQ_START_TOKEN) {
|
|
seq_puts(m, "UUID USE ADDR\n");
|
|
return 0;
|
|
}
|
|
|
|
server = list_entry(v, struct afs_server, proc_link);
|
|
alist = rcu_dereference(server->addresses);
|
|
seq_printf(m, "%pU %3d %pISp\n",
|
|
&server->uuid,
|
|
atomic_read(&server->usage),
|
|
&alist->addrs[alist->index].transport);
|
|
return 0;
|
|
}
|