proc.c 16 KB

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