Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/* /proc interface for AFS
3 *
4 * Copyright (C) 2002 Red Hat, Inc. All Rights Reserved.
5 * Written by David Howells (dhowells@redhat.com)
6 */
7
8#include <linux/slab.h>
9#include <linux/module.h>
10#include <linux/proc_fs.h>
11#include <linux/seq_file.h>
12#include <linux/sched.h>
13#include <linux/uaccess.h>
14#include "internal.h"
15
16struct afs_vl_seq_net_private {
17 struct seq_net_private seq; /* Must be first */
18 struct afs_vlserver_list *vllist;
19};
20
21static inline struct afs_net *afs_seq2net(struct seq_file *m)
22{
23 return afs_net(seq_file_net(m));
24}
25
26static inline struct afs_net *afs_seq2net_single(struct seq_file *m)
27{
28 return afs_net(seq_file_single_net(m));
29}
30
31/*
32 * Display the list of cells known to the namespace.
33 */
34static int afs_proc_cells_show(struct seq_file *m, void *v)
35{
36 struct afs_vlserver_list *vllist;
37 struct afs_cell *cell;
38
39 if (v == SEQ_START_TOKEN) {
40 /* display header on line 1 */
41 seq_puts(m, "USE ACT TTL SV ST NAME\n");
42 return 0;
43 }
44
45 cell = list_entry(v, struct afs_cell, proc_link);
46 vllist = rcu_dereference(cell->vl_servers);
47
48 /* display one cell per line on subsequent lines */
49 seq_printf(m, "%3u %3u %6lld %2u %2u %s\n",
50 refcount_read(&cell->ref),
51 atomic_read(&cell->active),
52 cell->dns_expiry - ktime_get_real_seconds(),
53 vllist ? vllist->nr_servers : 0,
54 cell->state,
55 cell->name);
56 return 0;
57}
58
59static void *afs_proc_cells_start(struct seq_file *m, loff_t *_pos)
60 __acquires(rcu)
61{
62 rcu_read_lock();
63 return seq_hlist_start_head_rcu(&afs_seq2net(m)->proc_cells, *_pos);
64}
65
66static void *afs_proc_cells_next(struct seq_file *m, void *v, loff_t *pos)
67{
68 return seq_hlist_next_rcu(v, &afs_seq2net(m)->proc_cells, pos);
69}
70
71static void afs_proc_cells_stop(struct seq_file *m, void *v)
72 __releases(rcu)
73{
74 rcu_read_unlock();
75}
76
77static const struct seq_operations afs_proc_cells_ops = {
78 .start = afs_proc_cells_start,
79 .next = afs_proc_cells_next,
80 .stop = afs_proc_cells_stop,
81 .show = afs_proc_cells_show,
82};
83
84/*
85 * handle writes to /proc/fs/afs/cells
86 * - to add cells: echo "add <cellname> <IP>[:<IP>][:<IP>]"
87 */
88static int afs_proc_cells_write(struct file *file, char *buf, size_t size)
89{
90 struct seq_file *m = file->private_data;
91 struct afs_net *net = afs_seq2net(m);
92 char *name, *args;
93 int ret;
94
95 /* trim to first NL */
96 name = memchr(buf, '\n', size);
97 if (name)
98 *name = 0;
99
100 /* split into command, name and argslist */
101 name = strchr(buf, ' ');
102 if (!name)
103 goto inval;
104 do {
105 *name++ = 0;
106 } while(*name == ' ');
107 if (!*name)
108 goto inval;
109
110 args = strchr(name, ' ');
111 if (args) {
112 do {
113 *args++ = 0;
114 } while(*args == ' ');
115 if (!*args)
116 goto inval;
117 }
118
119 /* determine command to perform */
120 _debug("cmd=%s name=%s args=%s", buf, name, args);
121
122 if (strcmp(buf, "add") == 0) {
123 struct afs_cell *cell;
124
125 cell = afs_lookup_cell(net, name, strlen(name), args, true);
126 if (IS_ERR(cell)) {
127 ret = PTR_ERR(cell);
128 goto done;
129 }
130
131 if (test_and_set_bit(AFS_CELL_FL_NO_GC, &cell->flags))
132 afs_unuse_cell(net, cell, afs_cell_trace_unuse_no_pin);
133 } else {
134 goto inval;
135 }
136
137 ret = 0;
138
139done:
140 _leave(" = %d", ret);
141 return ret;
142
143inval:
144 ret = -EINVAL;
145 printk("kAFS: Invalid Command on /proc/fs/afs/cells file\n");
146 goto done;
147}
148
149/*
150 * Display the list of addr_prefs known to the namespace.
151 */
152static int afs_proc_addr_prefs_show(struct seq_file *m, void *v)
153{
154 struct afs_addr_preference_list *preflist;
155 struct afs_addr_preference *pref;
156 struct afs_net *net = afs_seq2net_single(m);
157 union {
158 struct sockaddr_in sin;
159 struct sockaddr_in6 sin6;
160 } addr;
161 unsigned int i;
162 char buf[44]; /* Maximum ipv6 + max subnet is 43 */
163
164 rcu_read_lock();
165 preflist = rcu_dereference(net->address_prefs);
166
167 if (!preflist) {
168 seq_puts(m, "NO PREFS\n");
169 goto out;
170 }
171
172 seq_printf(m, "PROT SUBNET PRIOR (v=%u n=%u/%u/%u)\n",
173 preflist->version, preflist->ipv6_off, preflist->nr, preflist->max_prefs);
174
175 memset(&addr, 0, sizeof(addr));
176
177 for (i = 0; i < preflist->nr; i++) {
178 pref = &preflist->prefs[i];
179
180 addr.sin.sin_family = pref->family;
181 if (pref->family == AF_INET) {
182 memcpy(&addr.sin.sin_addr, &pref->ipv4_addr,
183 sizeof(addr.sin.sin_addr));
184 snprintf(buf, sizeof(buf), "%pISc/%u", &addr.sin, pref->subnet_mask);
185 seq_printf(m, "UDP %-43.43s %5u\n", buf, pref->prio);
186 } else {
187 memcpy(&addr.sin6.sin6_addr, &pref->ipv6_addr,
188 sizeof(addr.sin6.sin6_addr));
189 snprintf(buf, sizeof(buf), "%pISc/%u", &addr.sin6, pref->subnet_mask);
190 seq_printf(m, "UDP %-43.43s %5u\n", buf, pref->prio);
191 }
192 }
193
194out:
195 rcu_read_unlock();
196 return 0;
197}
198
199/*
200 * Display the name of the current workstation cell.
201 */
202static int afs_proc_rootcell_show(struct seq_file *m, void *v)
203{
204 struct afs_cell *cell;
205 struct afs_net *net;
206
207 net = afs_seq2net_single(m);
208 down_read(&net->cells_lock);
209 cell = net->ws_cell;
210 if (cell)
211 seq_printf(m, "%s\n", cell->name);
212 up_read(&net->cells_lock);
213 return 0;
214}
215
216/*
217 * Set the current workstation cell and optionally supply its list of volume
218 * location servers.
219 *
220 * echo "cell.name:192.168.231.14" >/proc/fs/afs/rootcell
221 */
222static int afs_proc_rootcell_write(struct file *file, char *buf, size_t size)
223{
224 struct seq_file *m = file->private_data;
225 struct afs_net *net = afs_seq2net_single(m);
226 char *s;
227 int ret;
228
229 ret = -EINVAL;
230 if (buf[0] == '.')
231 goto out;
232 if (memchr(buf, '/', size))
233 goto out;
234
235 /* trim to first NL */
236 s = memchr(buf, '\n', size);
237 if (s)
238 *s = 0;
239
240 /* determine command to perform */
241 _debug("rootcell=%s", buf);
242
243 ret = afs_cell_init(net, buf);
244
245out:
246 _leave(" = %d", ret);
247 return ret;
248}
249
250static const char afs_vol_types[3][3] = {
251 [AFSVL_RWVOL] = "RW",
252 [AFSVL_ROVOL] = "RO",
253 [AFSVL_BACKVOL] = "BK",
254};
255
256/*
257 * Display the list of volumes known to a cell.
258 */
259static int afs_proc_cell_volumes_show(struct seq_file *m, void *v)
260{
261 struct afs_volume *vol = hlist_entry(v, struct afs_volume, proc_link);
262
263 /* Display header on line 1 */
264 if (v == SEQ_START_TOKEN) {
265 seq_puts(m, "USE VID TY NAME\n");
266 return 0;
267 }
268
269 seq_printf(m, "%3d %08llx %s %s\n",
270 refcount_read(&vol->ref), vol->vid,
271 afs_vol_types[vol->type],
272 vol->name);
273
274 return 0;
275}
276
277static void *afs_proc_cell_volumes_start(struct seq_file *m, loff_t *_pos)
278 __acquires(cell->proc_lock)
279{
280 struct afs_cell *cell = pde_data(file_inode(m->file));
281
282 rcu_read_lock();
283 return seq_hlist_start_head_rcu(&cell->proc_volumes, *_pos);
284}
285
286static void *afs_proc_cell_volumes_next(struct seq_file *m, void *v,
287 loff_t *_pos)
288{
289 struct afs_cell *cell = pde_data(file_inode(m->file));
290
291 return seq_hlist_next_rcu(v, &cell->proc_volumes, _pos);
292}
293
294static void afs_proc_cell_volumes_stop(struct seq_file *m, void *v)
295 __releases(cell->proc_lock)
296{
297 rcu_read_unlock();
298}
299
300static const struct seq_operations afs_proc_cell_volumes_ops = {
301 .start = afs_proc_cell_volumes_start,
302 .next = afs_proc_cell_volumes_next,
303 .stop = afs_proc_cell_volumes_stop,
304 .show = afs_proc_cell_volumes_show,
305};
306
307static const char *const dns_record_sources[NR__dns_record_source + 1] = {
308 [DNS_RECORD_UNAVAILABLE] = "unav",
309 [DNS_RECORD_FROM_CONFIG] = "cfg",
310 [DNS_RECORD_FROM_DNS_A] = "A",
311 [DNS_RECORD_FROM_DNS_AFSDB] = "AFSDB",
312 [DNS_RECORD_FROM_DNS_SRV] = "SRV",
313 [DNS_RECORD_FROM_NSS] = "nss",
314 [NR__dns_record_source] = "[weird]"
315};
316
317static const char *const dns_lookup_statuses[NR__dns_lookup_status + 1] = {
318 [DNS_LOOKUP_NOT_DONE] = "no-lookup",
319 [DNS_LOOKUP_GOOD] = "good",
320 [DNS_LOOKUP_GOOD_WITH_BAD] = "good/bad",
321 [DNS_LOOKUP_BAD] = "bad",
322 [DNS_LOOKUP_GOT_NOT_FOUND] = "not-found",
323 [DNS_LOOKUP_GOT_LOCAL_FAILURE] = "local-failure",
324 [DNS_LOOKUP_GOT_TEMP_FAILURE] = "temp-failure",
325 [DNS_LOOKUP_GOT_NS_FAILURE] = "ns-failure",
326 [NR__dns_lookup_status] = "[weird]"
327};
328
329/*
330 * Display the list of Volume Location servers we're using for a cell.
331 */
332static int afs_proc_cell_vlservers_show(struct seq_file *m, void *v)
333{
334 const struct afs_vl_seq_net_private *priv = m->private;
335 const struct afs_vlserver_list *vllist = priv->vllist;
336 const struct afs_vlserver_entry *entry;
337 const struct afs_vlserver *vlserver;
338 const struct afs_addr_list *alist;
339 int i;
340
341 if (v == SEQ_START_TOKEN) {
342 seq_printf(m, "# source %s, status %s\n",
343 dns_record_sources[vllist ? vllist->source : 0],
344 dns_lookup_statuses[vllist ? vllist->status : 0]);
345 return 0;
346 }
347
348 entry = v;
349 vlserver = entry->server;
350 alist = rcu_dereference(vlserver->addresses);
351
352 seq_printf(m, "%s [p=%hu w=%hu s=%s,%s]:\n",
353 vlserver->name, entry->priority, entry->weight,
354 dns_record_sources[alist ? alist->source : entry->source],
355 dns_lookup_statuses[alist ? alist->status : entry->status]);
356 if (alist) {
357 for (i = 0; i < alist->nr_addrs; i++)
358 seq_printf(m, " %c %pISpc\n",
359 alist->preferred == i ? '>' : '-',
360 rxrpc_kernel_remote_addr(alist->addrs[i].peer));
361 }
362 seq_printf(m, " info: fl=%lx rtt=%d\n", vlserver->flags, vlserver->rtt);
363 seq_printf(m, " probe: fl=%x e=%d ac=%d out=%d\n",
364 vlserver->probe.flags, vlserver->probe.error,
365 vlserver->probe.abort_code,
366 atomic_read(&vlserver->probe_outstanding));
367 return 0;
368}
369
370static void *afs_proc_cell_vlservers_start(struct seq_file *m, loff_t *_pos)
371 __acquires(rcu)
372{
373 struct afs_vl_seq_net_private *priv = m->private;
374 struct afs_vlserver_list *vllist;
375 struct afs_cell *cell = pde_data(file_inode(m->file));
376 loff_t pos = *_pos;
377
378 rcu_read_lock();
379
380 vllist = rcu_dereference(cell->vl_servers);
381 priv->vllist = vllist;
382
383 if (pos < 0)
384 *_pos = pos = 0;
385 if (pos == 0)
386 return SEQ_START_TOKEN;
387
388 if (pos - 1 >= vllist->nr_servers)
389 return NULL;
390
391 return &vllist->servers[pos - 1];
392}
393
394static void *afs_proc_cell_vlservers_next(struct seq_file *m, void *v,
395 loff_t *_pos)
396{
397 struct afs_vl_seq_net_private *priv = m->private;
398 struct afs_vlserver_list *vllist = priv->vllist;
399 loff_t pos;
400
401 pos = *_pos;
402 pos++;
403 *_pos = pos;
404 if (!vllist || pos - 1 >= vllist->nr_servers)
405 return NULL;
406
407 return &vllist->servers[pos - 1];
408}
409
410static void afs_proc_cell_vlservers_stop(struct seq_file *m, void *v)
411 __releases(rcu)
412{
413 rcu_read_unlock();
414}
415
416static const struct seq_operations afs_proc_cell_vlservers_ops = {
417 .start = afs_proc_cell_vlservers_start,
418 .next = afs_proc_cell_vlservers_next,
419 .stop = afs_proc_cell_vlservers_stop,
420 .show = afs_proc_cell_vlservers_show,
421};
422
423/*
424 * Display the list of fileservers we're using within a namespace.
425 */
426static int afs_proc_servers_show(struct seq_file *m, void *v)
427{
428 struct afs_endpoint_state *estate;
429 struct afs_addr_list *alist;
430 struct afs_server *server;
431 unsigned long failed;
432 int i;
433
434 if (v == SEQ_START_TOKEN) {
435 seq_puts(m, "UUID REF ACT CELL\n");
436 return 0;
437 }
438
439 server = list_entry(v, struct afs_server, proc_link);
440 estate = rcu_dereference(server->endpoint_state);
441 alist = estate->addresses;
442 seq_printf(m, "%pU %3d %3d %s\n",
443 &server->uuid,
444 refcount_read(&server->ref),
445 atomic_read(&server->active),
446 server->cell->name);
447 seq_printf(m, " - info: fl=%lx rtt=%u\n",
448 server->flags, server->rtt);
449 seq_printf(m, " - probe: last=%d\n",
450 (int)(jiffies - server->probed_at) / HZ);
451 failed = estate->failed_set;
452 seq_printf(m, " - ESTATE pq=%x np=%u rsp=%lx f=%lx\n",
453 estate->probe_seq, atomic_read(&estate->nr_probing),
454 estate->responsive_set, estate->failed_set);
455 seq_printf(m, " - ALIST v=%u ap=%u\n",
456 alist->version, alist->addr_pref_version);
457 for (i = 0; i < alist->nr_addrs; i++) {
458 const struct afs_address *addr = &alist->addrs[i];
459
460 seq_printf(m, " [%x] %pISpc%s rtt=%d err=%d p=%u\n",
461 i, rxrpc_kernel_remote_addr(addr->peer),
462 alist->preferred == i ? "*" :
463 test_bit(i, &failed) ? "!" : "",
464 rxrpc_kernel_get_srtt(addr->peer),
465 addr->last_error, addr->prio);
466 }
467 return 0;
468}
469
470static void *afs_proc_servers_start(struct seq_file *m, loff_t *_pos)
471 __acquires(rcu)
472{
473 rcu_read_lock();
474 return seq_hlist_start_head_rcu(&afs_seq2net(m)->fs_proc, *_pos);
475}
476
477static void *afs_proc_servers_next(struct seq_file *m, void *v, loff_t *_pos)
478{
479 return seq_hlist_next_rcu(v, &afs_seq2net(m)->fs_proc, _pos);
480}
481
482static void afs_proc_servers_stop(struct seq_file *m, void *v)
483 __releases(rcu)
484{
485 rcu_read_unlock();
486}
487
488static const struct seq_operations afs_proc_servers_ops = {
489 .start = afs_proc_servers_start,
490 .next = afs_proc_servers_next,
491 .stop = afs_proc_servers_stop,
492 .show = afs_proc_servers_show,
493};
494
495/*
496 * Display the list of strings that may be substituted for the @sys pathname
497 * macro.
498 */
499static int afs_proc_sysname_show(struct seq_file *m, void *v)
500{
501 struct afs_net *net = afs_seq2net(m);
502 struct afs_sysnames *sysnames = net->sysnames;
503 unsigned int i = (unsigned long)v - 1;
504
505 if (i < sysnames->nr)
506 seq_printf(m, "%s\n", sysnames->subs[i]);
507 return 0;
508}
509
510static void *afs_proc_sysname_start(struct seq_file *m, loff_t *pos)
511 __acquires(&net->sysnames_lock)
512{
513 struct afs_net *net = afs_seq2net(m);
514 struct afs_sysnames *names;
515
516 read_lock(&net->sysnames_lock);
517
518 names = net->sysnames;
519 if (*pos >= names->nr)
520 return NULL;
521 return (void *)(unsigned long)(*pos + 1);
522}
523
524static void *afs_proc_sysname_next(struct seq_file *m, void *v, loff_t *pos)
525{
526 struct afs_net *net = afs_seq2net(m);
527 struct afs_sysnames *names = net->sysnames;
528
529 *pos += 1;
530 if (*pos >= names->nr)
531 return NULL;
532 return (void *)(unsigned long)(*pos + 1);
533}
534
535static void afs_proc_sysname_stop(struct seq_file *m, void *v)
536 __releases(&net->sysnames_lock)
537{
538 struct afs_net *net = afs_seq2net(m);
539
540 read_unlock(&net->sysnames_lock);
541}
542
543static const struct seq_operations afs_proc_sysname_ops = {
544 .start = afs_proc_sysname_start,
545 .next = afs_proc_sysname_next,
546 .stop = afs_proc_sysname_stop,
547 .show = afs_proc_sysname_show,
548};
549
550/*
551 * Allow the @sys substitution to be configured.
552 */
553static int afs_proc_sysname_write(struct file *file, char *buf, size_t size)
554{
555 struct afs_sysnames *sysnames, *kill;
556 struct seq_file *m = file->private_data;
557 struct afs_net *net = afs_seq2net(m);
558 char *s, *p, *sub;
559 int ret, len;
560
561 sysnames = kzalloc(sizeof(*sysnames), GFP_KERNEL);
562 if (!sysnames)
563 return -ENOMEM;
564 refcount_set(&sysnames->usage, 1);
565 kill = sysnames;
566
567 p = buf;
568 while ((s = strsep(&p, " \t\n"))) {
569 len = strlen(s);
570 if (len == 0)
571 continue;
572 ret = -ENAMETOOLONG;
573 if (len >= AFSNAMEMAX)
574 goto error;
575
576 if (len >= 4 &&
577 s[len - 4] == '@' &&
578 s[len - 3] == 's' &&
579 s[len - 2] == 'y' &&
580 s[len - 1] == 's')
581 /* Protect against recursion */
582 goto invalid;
583
584 if (s[0] == '.' &&
585 (len < 2 || (len == 2 && s[1] == '.')))
586 goto invalid;
587
588 if (memchr(s, '/', len))
589 goto invalid;
590
591 ret = -EFBIG;
592 if (sysnames->nr >= AFS_NR_SYSNAME)
593 goto out;
594
595 if (strcmp(s, afs_init_sysname) == 0) {
596 sub = (char *)afs_init_sysname;
597 } else {
598 ret = -ENOMEM;
599 sub = kmemdup(s, len + 1, GFP_KERNEL);
600 if (!sub)
601 goto out;
602 }
603
604 sysnames->subs[sysnames->nr] = sub;
605 sysnames->nr++;
606 }
607
608 if (sysnames->nr == 0) {
609 sysnames->subs[0] = sysnames->blank;
610 sysnames->nr++;
611 }
612
613 write_lock(&net->sysnames_lock);
614 kill = net->sysnames;
615 net->sysnames = sysnames;
616 write_unlock(&net->sysnames_lock);
617 ret = 0;
618out:
619 afs_put_sysnames(kill);
620 return ret;
621
622invalid:
623 ret = -EINVAL;
624error:
625 goto out;
626}
627
628void afs_put_sysnames(struct afs_sysnames *sysnames)
629{
630 int i;
631
632 if (sysnames && refcount_dec_and_test(&sysnames->usage)) {
633 for (i = 0; i < sysnames->nr; i++)
634 if (sysnames->subs[i] != afs_init_sysname &&
635 sysnames->subs[i] != sysnames->blank)
636 kfree(sysnames->subs[i]);
637 kfree(sysnames);
638 }
639}
640
641/*
642 * Display general per-net namespace statistics
643 */
644static int afs_proc_stats_show(struct seq_file *m, void *v)
645{
646 struct afs_net *net = afs_seq2net_single(m);
647
648 seq_puts(m, "kAFS statistics\n");
649
650 seq_printf(m, "dir-mgmt: look=%u reval=%u inval=%u relpg=%u\n",
651 atomic_read(&net->n_lookup),
652 atomic_read(&net->n_reval),
653 atomic_read(&net->n_inval),
654 atomic_read(&net->n_relpg));
655
656 seq_printf(m, "dir-data: rdpg=%u\n",
657 atomic_read(&net->n_read_dir));
658
659 seq_printf(m, "dir-edit: cr=%u rm=%u\n",
660 atomic_read(&net->n_dir_cr),
661 atomic_read(&net->n_dir_rm));
662
663 seq_printf(m, "file-rd : n=%u nb=%lu\n",
664 atomic_read(&net->n_fetches),
665 atomic_long_read(&net->n_fetch_bytes));
666 seq_printf(m, "file-wr : n=%u nb=%lu\n",
667 atomic_read(&net->n_stores),
668 atomic_long_read(&net->n_store_bytes));
669 return 0;
670}
671
672/*
673 * initialise /proc/fs/afs/<cell>/
674 */
675int afs_proc_cell_setup(struct afs_cell *cell)
676{
677 struct proc_dir_entry *dir;
678 struct afs_net *net = cell->net;
679
680 _enter("%p{%s},%p", cell, cell->name, net->proc_afs);
681
682 dir = proc_net_mkdir(net->net, cell->name, net->proc_afs);
683 if (!dir)
684 goto error_dir;
685
686 if (!proc_create_net_data("vlservers", 0444, dir,
687 &afs_proc_cell_vlservers_ops,
688 sizeof(struct afs_vl_seq_net_private),
689 cell) ||
690 !proc_create_net_data("volumes", 0444, dir,
691 &afs_proc_cell_volumes_ops,
692 sizeof(struct seq_net_private),
693 cell))
694 goto error_tree;
695
696 _leave(" = 0");
697 return 0;
698
699error_tree:
700 remove_proc_subtree(cell->name, net->proc_afs);
701error_dir:
702 _leave(" = -ENOMEM");
703 return -ENOMEM;
704}
705
706/*
707 * remove /proc/fs/afs/<cell>/
708 */
709void afs_proc_cell_remove(struct afs_cell *cell)
710{
711 struct afs_net *net = cell->net;
712
713 _enter("");
714 remove_proc_subtree(cell->name, net->proc_afs);
715 _leave("");
716}
717
718/*
719 * initialise the /proc/fs/afs/ directory
720 */
721int afs_proc_init(struct afs_net *net)
722{
723 struct proc_dir_entry *p;
724
725 _enter("");
726
727 p = proc_net_mkdir(net->net, "afs", net->net->proc_net);
728 if (!p)
729 goto error_dir;
730
731 if (!proc_create_net_data_write("cells", 0644, p,
732 &afs_proc_cells_ops,
733 afs_proc_cells_write,
734 sizeof(struct seq_net_private),
735 NULL) ||
736 !proc_create_net_single_write("rootcell", 0644, p,
737 afs_proc_rootcell_show,
738 afs_proc_rootcell_write,
739 NULL) ||
740 !proc_create_net("servers", 0444, p, &afs_proc_servers_ops,
741 sizeof(struct seq_net_private)) ||
742 !proc_create_net_single("stats", 0444, p, afs_proc_stats_show, NULL) ||
743 !proc_create_net_data_write("sysname", 0644, p,
744 &afs_proc_sysname_ops,
745 afs_proc_sysname_write,
746 sizeof(struct seq_net_private),
747 NULL) ||
748 !proc_create_net_single_write("addr_prefs", 0644, p,
749 afs_proc_addr_prefs_show,
750 afs_proc_addr_prefs_write,
751 NULL))
752 goto error_tree;
753
754 net->proc_afs = p;
755 _leave(" = 0");
756 return 0;
757
758error_tree:
759 proc_remove(p);
760error_dir:
761 _leave(" = -ENOMEM");
762 return -ENOMEM;
763}
764
765/*
766 * clean up the /proc/fs/afs/ directory
767 */
768void afs_proc_cleanup(struct afs_net *net)
769{
770 proc_remove(net->proc_afs);
771 net->proc_afs = NULL;
772}
1/* /proc interface for AFS
2 *
3 * Copyright (C) 2002 Red Hat, Inc. All Rights Reserved.
4 * Written by David Howells (dhowells@redhat.com)
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 */
11
12#include <linux/slab.h>
13#include <linux/module.h>
14#include <linux/proc_fs.h>
15#include <linux/seq_file.h>
16#include <linux/sched.h>
17#include <asm/uaccess.h>
18#include "internal.h"
19
20static struct proc_dir_entry *proc_afs;
21
22
23static int afs_proc_cells_open(struct inode *inode, struct file *file);
24static void *afs_proc_cells_start(struct seq_file *p, loff_t *pos);
25static void *afs_proc_cells_next(struct seq_file *p, void *v, loff_t *pos);
26static void afs_proc_cells_stop(struct seq_file *p, void *v);
27static int afs_proc_cells_show(struct seq_file *m, void *v);
28static ssize_t afs_proc_cells_write(struct file *file, const char __user *buf,
29 size_t size, loff_t *_pos);
30
31static const struct seq_operations afs_proc_cells_ops = {
32 .start = afs_proc_cells_start,
33 .next = afs_proc_cells_next,
34 .stop = afs_proc_cells_stop,
35 .show = afs_proc_cells_show,
36};
37
38static const struct file_operations afs_proc_cells_fops = {
39 .open = afs_proc_cells_open,
40 .read = seq_read,
41 .write = afs_proc_cells_write,
42 .llseek = seq_lseek,
43 .release = seq_release,
44};
45
46static ssize_t afs_proc_rootcell_read(struct file *file, char __user *buf,
47 size_t size, loff_t *_pos);
48static ssize_t afs_proc_rootcell_write(struct file *file,
49 const char __user *buf,
50 size_t size, loff_t *_pos);
51
52static const struct file_operations afs_proc_rootcell_fops = {
53 .read = afs_proc_rootcell_read,
54 .write = afs_proc_rootcell_write,
55 .llseek = no_llseek,
56};
57
58static int afs_proc_cell_volumes_open(struct inode *inode, struct file *file);
59static void *afs_proc_cell_volumes_start(struct seq_file *p, loff_t *pos);
60static void *afs_proc_cell_volumes_next(struct seq_file *p, void *v,
61 loff_t *pos);
62static void afs_proc_cell_volumes_stop(struct seq_file *p, void *v);
63static int afs_proc_cell_volumes_show(struct seq_file *m, void *v);
64
65static const struct seq_operations afs_proc_cell_volumes_ops = {
66 .start = afs_proc_cell_volumes_start,
67 .next = afs_proc_cell_volumes_next,
68 .stop = afs_proc_cell_volumes_stop,
69 .show = afs_proc_cell_volumes_show,
70};
71
72static const struct file_operations afs_proc_cell_volumes_fops = {
73 .open = afs_proc_cell_volumes_open,
74 .read = seq_read,
75 .llseek = seq_lseek,
76 .release = seq_release,
77};
78
79static int afs_proc_cell_vlservers_open(struct inode *inode,
80 struct file *file);
81static void *afs_proc_cell_vlservers_start(struct seq_file *p, loff_t *pos);
82static void *afs_proc_cell_vlservers_next(struct seq_file *p, void *v,
83 loff_t *pos);
84static void afs_proc_cell_vlservers_stop(struct seq_file *p, void *v);
85static int afs_proc_cell_vlservers_show(struct seq_file *m, void *v);
86
87static const struct seq_operations afs_proc_cell_vlservers_ops = {
88 .start = afs_proc_cell_vlservers_start,
89 .next = afs_proc_cell_vlservers_next,
90 .stop = afs_proc_cell_vlservers_stop,
91 .show = afs_proc_cell_vlservers_show,
92};
93
94static const struct file_operations afs_proc_cell_vlservers_fops = {
95 .open = afs_proc_cell_vlservers_open,
96 .read = seq_read,
97 .llseek = seq_lseek,
98 .release = seq_release,
99};
100
101static int afs_proc_cell_servers_open(struct inode *inode, struct file *file);
102static void *afs_proc_cell_servers_start(struct seq_file *p, loff_t *pos);
103static void *afs_proc_cell_servers_next(struct seq_file *p, void *v,
104 loff_t *pos);
105static void afs_proc_cell_servers_stop(struct seq_file *p, void *v);
106static int afs_proc_cell_servers_show(struct seq_file *m, void *v);
107
108static const struct seq_operations afs_proc_cell_servers_ops = {
109 .start = afs_proc_cell_servers_start,
110 .next = afs_proc_cell_servers_next,
111 .stop = afs_proc_cell_servers_stop,
112 .show = afs_proc_cell_servers_show,
113};
114
115static const struct file_operations afs_proc_cell_servers_fops = {
116 .open = afs_proc_cell_servers_open,
117 .read = seq_read,
118 .llseek = seq_lseek,
119 .release = seq_release,
120};
121
122/*
123 * initialise the /proc/fs/afs/ directory
124 */
125int afs_proc_init(void)
126{
127 _enter("");
128
129 proc_afs = proc_mkdir("fs/afs", NULL);
130 if (!proc_afs)
131 goto error_dir;
132
133 if (!proc_create("cells", 0644, proc_afs, &afs_proc_cells_fops) ||
134 !proc_create("rootcell", 0644, proc_afs, &afs_proc_rootcell_fops))
135 goto error_tree;
136
137 _leave(" = 0");
138 return 0;
139
140error_tree:
141 remove_proc_subtree("fs/afs", NULL);
142error_dir:
143 _leave(" = -ENOMEM");
144 return -ENOMEM;
145}
146
147/*
148 * clean up the /proc/fs/afs/ directory
149 */
150void afs_proc_cleanup(void)
151{
152 remove_proc_subtree("fs/afs", NULL);
153}
154
155/*
156 * open "/proc/fs/afs/cells" which provides a summary of extant cells
157 */
158static int afs_proc_cells_open(struct inode *inode, struct file *file)
159{
160 struct seq_file *m;
161 int ret;
162
163 ret = seq_open(file, &afs_proc_cells_ops);
164 if (ret < 0)
165 return ret;
166
167 m = file->private_data;
168 m->private = PDE_DATA(inode);
169
170 return 0;
171}
172
173/*
174 * set up the iterator to start reading from the cells list and return the
175 * first item
176 */
177static void *afs_proc_cells_start(struct seq_file *m, loff_t *_pos)
178{
179 /* lock the list against modification */
180 down_read(&afs_proc_cells_sem);
181 return seq_list_start_head(&afs_proc_cells, *_pos);
182}
183
184/*
185 * move to next cell in cells list
186 */
187static void *afs_proc_cells_next(struct seq_file *p, void *v, loff_t *pos)
188{
189 return seq_list_next(v, &afs_proc_cells, pos);
190}
191
192/*
193 * clean up after reading from the cells list
194 */
195static void afs_proc_cells_stop(struct seq_file *p, void *v)
196{
197 up_read(&afs_proc_cells_sem);
198}
199
200/*
201 * display a header line followed by a load of cell lines
202 */
203static int afs_proc_cells_show(struct seq_file *m, void *v)
204{
205 struct afs_cell *cell = list_entry(v, struct afs_cell, proc_link);
206
207 if (v == &afs_proc_cells) {
208 /* display header on line 1 */
209 seq_puts(m, "USE NAME\n");
210 return 0;
211 }
212
213 /* display one cell per line on subsequent lines */
214 seq_printf(m, "%3d %s\n",
215 atomic_read(&cell->usage), cell->name);
216 return 0;
217}
218
219/*
220 * handle writes to /proc/fs/afs/cells
221 * - to add cells: echo "add <cellname> <IP>[:<IP>][:<IP>]"
222 */
223static ssize_t afs_proc_cells_write(struct file *file, const char __user *buf,
224 size_t size, loff_t *_pos)
225{
226 char *kbuf, *name, *args;
227 int ret;
228
229 /* start by dragging the command into memory */
230 if (size <= 1 || size >= PAGE_SIZE)
231 return -EINVAL;
232
233 kbuf = kmalloc(size + 1, GFP_KERNEL);
234 if (!kbuf)
235 return -ENOMEM;
236
237 ret = -EFAULT;
238 if (copy_from_user(kbuf, buf, size) != 0)
239 goto done;
240 kbuf[size] = 0;
241
242 /* trim to first NL */
243 name = memchr(kbuf, '\n', size);
244 if (name)
245 *name = 0;
246
247 /* split into command, name and argslist */
248 name = strchr(kbuf, ' ');
249 if (!name)
250 goto inval;
251 do {
252 *name++ = 0;
253 } while(*name == ' ');
254 if (!*name)
255 goto inval;
256
257 args = strchr(name, ' ');
258 if (!args)
259 goto inval;
260 do {
261 *args++ = 0;
262 } while(*args == ' ');
263 if (!*args)
264 goto inval;
265
266 /* determine command to perform */
267 _debug("cmd=%s name=%s args=%s", kbuf, name, args);
268
269 if (strcmp(kbuf, "add") == 0) {
270 struct afs_cell *cell;
271
272 cell = afs_cell_create(name, strlen(name), args, false);
273 if (IS_ERR(cell)) {
274 ret = PTR_ERR(cell);
275 goto done;
276 }
277
278 afs_put_cell(cell);
279 printk("kAFS: Added new cell '%s'\n", name);
280 } else {
281 goto inval;
282 }
283
284 ret = size;
285
286done:
287 kfree(kbuf);
288 _leave(" = %d", ret);
289 return ret;
290
291inval:
292 ret = -EINVAL;
293 printk("kAFS: Invalid Command on /proc/fs/afs/cells file\n");
294 goto done;
295}
296
297static ssize_t afs_proc_rootcell_read(struct file *file, char __user *buf,
298 size_t size, loff_t *_pos)
299{
300 return 0;
301}
302
303/*
304 * handle writes to /proc/fs/afs/rootcell
305 * - to initialize rootcell: echo "cell.name:192.168.231.14"
306 */
307static ssize_t afs_proc_rootcell_write(struct file *file,
308 const char __user *buf,
309 size_t size, loff_t *_pos)
310{
311 char *kbuf, *s;
312 int ret;
313
314 /* start by dragging the command into memory */
315 if (size <= 1 || size >= PAGE_SIZE)
316 return -EINVAL;
317
318 ret = -ENOMEM;
319 kbuf = kmalloc(size + 1, GFP_KERNEL);
320 if (!kbuf)
321 goto nomem;
322
323 ret = -EFAULT;
324 if (copy_from_user(kbuf, buf, size) != 0)
325 goto infault;
326 kbuf[size] = 0;
327
328 /* trim to first NL */
329 s = memchr(kbuf, '\n', size);
330 if (s)
331 *s = 0;
332
333 /* determine command to perform */
334 _debug("rootcell=%s", kbuf);
335
336 ret = afs_cell_init(kbuf);
337 if (ret >= 0)
338 ret = size; /* consume everything, always */
339
340infault:
341 kfree(kbuf);
342nomem:
343 _leave(" = %d", ret);
344 return ret;
345}
346
347/*
348 * initialise /proc/fs/afs/<cell>/
349 */
350int afs_proc_cell_setup(struct afs_cell *cell)
351{
352 struct proc_dir_entry *dir;
353
354 _enter("%p{%s}", cell, cell->name);
355
356 dir = proc_mkdir(cell->name, proc_afs);
357 if (!dir)
358 goto error_dir;
359
360 if (!proc_create_data("servers", 0, dir,
361 &afs_proc_cell_servers_fops, cell) ||
362 !proc_create_data("vlservers", 0, dir,
363 &afs_proc_cell_vlservers_fops, cell) ||
364 !proc_create_data("volumes", 0, dir,
365 &afs_proc_cell_volumes_fops, cell))
366 goto error_tree;
367
368 _leave(" = 0");
369 return 0;
370
371error_tree:
372 remove_proc_subtree(cell->name, proc_afs);
373error_dir:
374 _leave(" = -ENOMEM");
375 return -ENOMEM;
376}
377
378/*
379 * remove /proc/fs/afs/<cell>/
380 */
381void afs_proc_cell_remove(struct afs_cell *cell)
382{
383 _enter("");
384
385 remove_proc_subtree(cell->name, proc_afs);
386
387 _leave("");
388}
389
390/*
391 * open "/proc/fs/afs/<cell>/volumes" which provides a summary of extant cells
392 */
393static int afs_proc_cell_volumes_open(struct inode *inode, struct file *file)
394{
395 struct afs_cell *cell;
396 struct seq_file *m;
397 int ret;
398
399 cell = PDE_DATA(inode);
400 if (!cell)
401 return -ENOENT;
402
403 ret = seq_open(file, &afs_proc_cell_volumes_ops);
404 if (ret < 0)
405 return ret;
406
407 m = file->private_data;
408 m->private = cell;
409
410 return 0;
411}
412
413/*
414 * set up the iterator to start reading from the cells list and return the
415 * first item
416 */
417static void *afs_proc_cell_volumes_start(struct seq_file *m, loff_t *_pos)
418{
419 struct afs_cell *cell = m->private;
420
421 _enter("cell=%p pos=%Ld", cell, *_pos);
422
423 /* lock the list against modification */
424 down_read(&cell->vl_sem);
425 return seq_list_start_head(&cell->vl_list, *_pos);
426}
427
428/*
429 * move to next cell in cells list
430 */
431static void *afs_proc_cell_volumes_next(struct seq_file *p, void *v,
432 loff_t *_pos)
433{
434 struct afs_cell *cell = p->private;
435
436 _enter("cell=%p pos=%Ld", cell, *_pos);
437 return seq_list_next(v, &cell->vl_list, _pos);
438}
439
440/*
441 * clean up after reading from the cells list
442 */
443static void afs_proc_cell_volumes_stop(struct seq_file *p, void *v)
444{
445 struct afs_cell *cell = p->private;
446
447 up_read(&cell->vl_sem);
448}
449
450static const char afs_vlocation_states[][4] = {
451 [AFS_VL_NEW] = "New",
452 [AFS_VL_CREATING] = "Crt",
453 [AFS_VL_VALID] = "Val",
454 [AFS_VL_NO_VOLUME] = "NoV",
455 [AFS_VL_UPDATING] = "Upd",
456 [AFS_VL_VOLUME_DELETED] = "Del",
457 [AFS_VL_UNCERTAIN] = "Unc",
458};
459
460/*
461 * display a header line followed by a load of volume lines
462 */
463static int afs_proc_cell_volumes_show(struct seq_file *m, void *v)
464{
465 struct afs_cell *cell = m->private;
466 struct afs_vlocation *vlocation =
467 list_entry(v, struct afs_vlocation, link);
468
469 /* display header on line 1 */
470 if (v == &cell->vl_list) {
471 seq_puts(m, "USE STT VLID[0] VLID[1] VLID[2] NAME\n");
472 return 0;
473 }
474
475 /* display one cell per line on subsequent lines */
476 seq_printf(m, "%3d %s %08x %08x %08x %s\n",
477 atomic_read(&vlocation->usage),
478 afs_vlocation_states[vlocation->state],
479 vlocation->vldb.vid[0],
480 vlocation->vldb.vid[1],
481 vlocation->vldb.vid[2],
482 vlocation->vldb.name);
483
484 return 0;
485}
486
487/*
488 * open "/proc/fs/afs/<cell>/vlservers" which provides a list of volume
489 * location server
490 */
491static int afs_proc_cell_vlservers_open(struct inode *inode, struct file *file)
492{
493 struct afs_cell *cell;
494 struct seq_file *m;
495 int ret;
496
497 cell = PDE_DATA(inode);
498 if (!cell)
499 return -ENOENT;
500
501 ret = seq_open(file, &afs_proc_cell_vlservers_ops);
502 if (ret<0)
503 return ret;
504
505 m = file->private_data;
506 m->private = cell;
507
508 return 0;
509}
510
511/*
512 * set up the iterator to start reading from the cells list and return the
513 * first item
514 */
515static void *afs_proc_cell_vlservers_start(struct seq_file *m, loff_t *_pos)
516{
517 struct afs_cell *cell = m->private;
518 loff_t pos = *_pos;
519
520 _enter("cell=%p pos=%Ld", cell, *_pos);
521
522 /* lock the list against modification */
523 down_read(&cell->vl_sem);
524
525 /* allow for the header line */
526 if (!pos)
527 return (void *) 1;
528 pos--;
529
530 if (pos >= cell->vl_naddrs)
531 return NULL;
532
533 return &cell->vl_addrs[pos];
534}
535
536/*
537 * move to next cell in cells list
538 */
539static void *afs_proc_cell_vlservers_next(struct seq_file *p, void *v,
540 loff_t *_pos)
541{
542 struct afs_cell *cell = p->private;
543 loff_t pos;
544
545 _enter("cell=%p{nad=%u} pos=%Ld", cell, cell->vl_naddrs, *_pos);
546
547 pos = *_pos;
548 (*_pos)++;
549 if (pos >= cell->vl_naddrs)
550 return NULL;
551
552 return &cell->vl_addrs[pos];
553}
554
555/*
556 * clean up after reading from the cells list
557 */
558static void afs_proc_cell_vlservers_stop(struct seq_file *p, void *v)
559{
560 struct afs_cell *cell = p->private;
561
562 up_read(&cell->vl_sem);
563}
564
565/*
566 * display a header line followed by a load of volume lines
567 */
568static int afs_proc_cell_vlservers_show(struct seq_file *m, void *v)
569{
570 struct in_addr *addr = v;
571
572 /* display header on line 1 */
573 if (v == (struct in_addr *) 1) {
574 seq_puts(m, "ADDRESS\n");
575 return 0;
576 }
577
578 /* display one cell per line on subsequent lines */
579 seq_printf(m, "%pI4\n", &addr->s_addr);
580 return 0;
581}
582
583/*
584 * open "/proc/fs/afs/<cell>/servers" which provides a summary of active
585 * servers
586 */
587static int afs_proc_cell_servers_open(struct inode *inode, struct file *file)
588{
589 struct afs_cell *cell;
590 struct seq_file *m;
591 int ret;
592
593 cell = PDE_DATA(inode);
594 if (!cell)
595 return -ENOENT;
596
597 ret = seq_open(file, &afs_proc_cell_servers_ops);
598 if (ret < 0)
599 return ret;
600
601 m = file->private_data;
602 m->private = cell;
603 return 0;
604}
605
606/*
607 * set up the iterator to start reading from the cells list and return the
608 * first item
609 */
610static void *afs_proc_cell_servers_start(struct seq_file *m, loff_t *_pos)
611 __acquires(m->private->servers_lock)
612{
613 struct afs_cell *cell = m->private;
614
615 _enter("cell=%p pos=%Ld", cell, *_pos);
616
617 /* lock the list against modification */
618 read_lock(&cell->servers_lock);
619 return seq_list_start_head(&cell->servers, *_pos);
620}
621
622/*
623 * move to next cell in cells list
624 */
625static void *afs_proc_cell_servers_next(struct seq_file *p, void *v,
626 loff_t *_pos)
627{
628 struct afs_cell *cell = p->private;
629
630 _enter("cell=%p pos=%Ld", cell, *_pos);
631 return seq_list_next(v, &cell->servers, _pos);
632}
633
634/*
635 * clean up after reading from the cells list
636 */
637static void afs_proc_cell_servers_stop(struct seq_file *p, void *v)
638 __releases(p->private->servers_lock)
639{
640 struct afs_cell *cell = p->private;
641
642 read_unlock(&cell->servers_lock);
643}
644
645/*
646 * display a header line followed by a load of volume lines
647 */
648static int afs_proc_cell_servers_show(struct seq_file *m, void *v)
649{
650 struct afs_cell *cell = m->private;
651 struct afs_server *server = list_entry(v, struct afs_server, link);
652 char ipaddr[20];
653
654 /* display header on line 1 */
655 if (v == &cell->servers) {
656 seq_puts(m, "USE ADDR STATE\n");
657 return 0;
658 }
659
660 /* display one cell per line on subsequent lines */
661 sprintf(ipaddr, "%pI4", &server->addr);
662 seq_printf(m, "%3d %-15.15s %5d\n",
663 atomic_read(&server->usage), ipaddr, server->fs_state);
664
665 return 0;
666}