proc.c 19 KB

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