proc.c 18 KB

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