afs: Rearrange fs/afs/proc.c to remove remaining predeclarations.
[linux-2.6-block.git] / fs / proc / generic.c
CommitLineData
1da177e4
LT
1/*
2 * proc/fs/generic.c --- generic routines for the proc-fs
3 *
4 * This file contains generic proc-fs routines for handling
5 * directories and files.
6 *
7 * Copyright (C) 1991, 1992 Linus Torvalds.
8 * Copyright (C) 1997 Theodore Ts'o
9 */
10
b4884f23 11#include <linux/cache.h>
1da177e4
LT
12#include <linux/errno.h>
13#include <linux/time.h>
14#include <linux/proc_fs.h>
15#include <linux/stat.h>
1025774c 16#include <linux/mm.h>
1da177e4 17#include <linux/module.h>
1da4d377 18#include <linux/namei.h>
5a0e3ad6 19#include <linux/slab.h>
87ebdc00 20#include <linux/printk.h>
1da177e4 21#include <linux/mount.h>
1da177e4
LT
22#include <linux/init.h>
23#include <linux/idr.h>
1da177e4 24#include <linux/bitops.h>
64a07bd8 25#include <linux/spinlock.h>
786d7e16 26#include <linux/completion.h>
7c0f6ba6 27#include <linux/uaccess.h>
fddda2b7 28#include <linux/seq_file.h>
1da177e4 29
fee781e6
AB
30#include "internal.h"
31
ecf1a3df 32static DEFINE_RWLOCK(proc_subdir_lock);
64a07bd8 33
b4884f23
AD
34struct kmem_cache *proc_dir_entry_cache __ro_after_init;
35
36void pde_free(struct proc_dir_entry *pde)
37{
38 if (S_ISLNK(pde->mode))
39 kfree(pde->data);
40 if (pde->name != pde->inline_name)
41 kfree(pde->name);
42 kmem_cache_free(proc_dir_entry_cache, pde);
43}
44
93ad5bc6 45static int proc_match(const char *name, struct proc_dir_entry *de, unsigned int len)
1da177e4 46{
710585d4
ND
47 if (len < de->namelen)
48 return -1;
49 if (len > de->namelen)
50 return 1;
51
52 return memcmp(name, de->name, len);
53}
54
55static struct proc_dir_entry *pde_subdir_first(struct proc_dir_entry *dir)
56{
4f113437
AD
57 return rb_entry_safe(rb_first(&dir->subdir), struct proc_dir_entry,
58 subdir_node);
710585d4
ND
59}
60
61static struct proc_dir_entry *pde_subdir_next(struct proc_dir_entry *dir)
62{
2fc1e948
ND
63 return rb_entry_safe(rb_next(&dir->subdir_node), struct proc_dir_entry,
64 subdir_node);
710585d4
ND
65}
66
67static struct proc_dir_entry *pde_subdir_find(struct proc_dir_entry *dir,
68 const char *name,
69 unsigned int len)
70{
4f113437 71 struct rb_node *node = dir->subdir.rb_node;
710585d4
ND
72
73 while (node) {
4e4a7fb7
GT
74 struct proc_dir_entry *de = rb_entry(node,
75 struct proc_dir_entry,
76 subdir_node);
93ad5bc6 77 int result = proc_match(name, de, len);
710585d4
ND
78
79 if (result < 0)
80 node = node->rb_left;
81 else if (result > 0)
82 node = node->rb_right;
83 else
84 return de;
85 }
86 return NULL;
87}
88
89static bool pde_subdir_insert(struct proc_dir_entry *dir,
90 struct proc_dir_entry *de)
91{
4f113437
AD
92 struct rb_root *root = &dir->subdir;
93 struct rb_node **new = &root->rb_node, *parent = NULL;
710585d4
ND
94
95 /* Figure out where to put new node */
96 while (*new) {
4e4a7fb7
GT
97 struct proc_dir_entry *this = rb_entry(*new,
98 struct proc_dir_entry,
99 subdir_node);
93ad5bc6 100 int result = proc_match(de->name, this, de->namelen);
710585d4
ND
101
102 parent = *new;
103 if (result < 0)
104 new = &(*new)->rb_left;
4f113437 105 else if (result > 0)
710585d4 106 new = &(*new)->rb_right;
4f113437 107 else
710585d4
ND
108 return false;
109 }
110
111 /* Add new node and rebalance tree. */
112 rb_link_node(&de->subdir_node, parent, new);
4f113437 113 rb_insert_color(&de->subdir_node, root);
710585d4 114 return true;
1da177e4
LT
115}
116
1da177e4
LT
117static int proc_notify_change(struct dentry *dentry, struct iattr *iattr)
118{
2b0143b5 119 struct inode *inode = d_inode(dentry);
1da177e4
LT
120 struct proc_dir_entry *de = PDE(inode);
121 int error;
122
31051c85 123 error = setattr_prepare(dentry, iattr);
1da177e4 124 if (error)
1025774c 125 return error;
1da177e4 126
1025774c
CH
127 setattr_copy(inode, iattr);
128 mark_inode_dirty(inode);
46f69557 129
cdf7e8dd 130 proc_set_user(de, inode->i_uid, inode->i_gid);
1da177e4 131 de->mode = inode->i_mode;
1025774c 132 return 0;
1da177e4
LT
133}
134
a528d35e
DH
135static int proc_getattr(const struct path *path, struct kstat *stat,
136 u32 request_mask, unsigned int query_flags)
2b579bee 137{
a528d35e 138 struct inode *inode = d_inode(path->dentry);
6bee55f9 139 struct proc_dir_entry *de = PDE(inode);
2b579bee 140 if (de && de->nlink)
bfe86848 141 set_nlink(inode, de->nlink);
2b579bee
MS
142
143 generic_fillattr(inode, stat);
144 return 0;
145}
146
c5ef1c42 147static const struct inode_operations proc_file_inode_operations = {
1da177e4
LT
148 .setattr = proc_notify_change,
149};
150
151/*
152 * This function parses a name such as "tty/driver/serial", and
153 * returns the struct proc_dir_entry for "/proc/tty/driver", and
154 * returns "serial" in residual.
155 */
e17a5765
AD
156static int __xlate_proc_name(const char *name, struct proc_dir_entry **ret,
157 const char **residual)
1da177e4
LT
158{
159 const char *cp = name, *next;
160 struct proc_dir_entry *de;
312ec7e5 161 unsigned int len;
1da177e4 162
7cee4e00
AD
163 de = *ret;
164 if (!de)
165 de = &proc_root;
166
1da177e4
LT
167 while (1) {
168 next = strchr(cp, '/');
169 if (!next)
170 break;
171
172 len = next - cp;
710585d4 173 de = pde_subdir_find(de, cp, len);
12bac0d9
AD
174 if (!de) {
175 WARN(1, "name '%s'\n", name);
e17a5765 176 return -ENOENT;
12bac0d9 177 }
1da177e4
LT
178 cp += len + 1;
179 }
180 *residual = cp;
181 *ret = de;
e17a5765
AD
182 return 0;
183}
184
185static int xlate_proc_name(const char *name, struct proc_dir_entry **ret,
186 const char **residual)
187{
188 int rv;
189
ecf1a3df 190 read_lock(&proc_subdir_lock);
e17a5765 191 rv = __xlate_proc_name(name, ret, residual);
ecf1a3df 192 read_unlock(&proc_subdir_lock);
e17a5765 193 return rv;
1da177e4
LT
194}
195
9a185409 196static DEFINE_IDA(proc_inum_ida);
1da177e4 197
67935df4 198#define PROC_DYNAMIC_FIRST 0xF0000000U
1da177e4
LT
199
200/*
201 * Return an inode number between PROC_DYNAMIC_FIRST and
202 * 0xffffffff, or zero on failure.
203 */
33d6dce6 204int proc_alloc_inum(unsigned int *inum)
1da177e4 205{
cde1b693 206 int i;
1da177e4 207
cde1b693
HK
208 i = ida_simple_get(&proc_inum_ida, 0, UINT_MAX - PROC_DYNAMIC_FIRST + 1,
209 GFP_KERNEL);
210 if (i < 0)
211 return i;
1da177e4 212
cde1b693 213 *inum = PROC_DYNAMIC_FIRST + (unsigned int)i;
33d6dce6 214 return 0;
1da177e4
LT
215}
216
33d6dce6 217void proc_free_inum(unsigned int inum)
1da177e4 218{
cde1b693 219 ida_simple_remove(&proc_inum_ida, inum - PROC_DYNAMIC_FIRST);
1da177e4
LT
220}
221
1da4d377
AD
222static int proc_misc_d_revalidate(struct dentry *dentry, unsigned int flags)
223{
224 if (flags & LOOKUP_RCU)
225 return -ECHILD;
226
227 if (atomic_read(&PDE(d_inode(dentry))->in_use) < 0)
228 return 0; /* revalidate */
229 return 1;
230}
231
232static int proc_misc_d_delete(const struct dentry *dentry)
233{
234 return atomic_read(&PDE(d_inode(dentry))->in_use) < 0;
235}
236
237static const struct dentry_operations proc_misc_dentry_ops = {
238 .d_revalidate = proc_misc_d_revalidate,
239 .d_delete = proc_misc_d_delete,
240};
241
1da177e4
LT
242/*
243 * Don't create negative dentries here, return -ENOENT by hand
244 * instead.
245 */
93ad5bc6
AD
246struct dentry *proc_lookup_de(struct inode *dir, struct dentry *dentry,
247 struct proc_dir_entry *de)
1da177e4 248{
d3d009cb 249 struct inode *inode;
1da177e4 250
ecf1a3df 251 read_lock(&proc_subdir_lock);
710585d4
ND
252 de = pde_subdir_find(de, dentry->d_name.name, dentry->d_name.len);
253 if (de) {
254 pde_get(de);
ecf1a3df 255 read_unlock(&proc_subdir_lock);
710585d4
ND
256 inode = proc_get_inode(dir->i_sb, de);
257 if (!inode)
258 return ERR_PTR(-ENOMEM);
1da4d377 259 d_set_d_op(dentry, &proc_misc_dentry_ops);
710585d4
ND
260 d_add(dentry, inode);
261 return NULL;
1da177e4 262 }
ecf1a3df 263 read_unlock(&proc_subdir_lock);
d3d009cb 264 return ERR_PTR(-ENOENT);
1da177e4
LT
265}
266
e9720acd 267struct dentry *proc_lookup(struct inode *dir, struct dentry *dentry,
00cd8dd3 268 unsigned int flags)
e9720acd 269{
93ad5bc6 270 return proc_lookup_de(dir, dentry, PDE(dir));
e9720acd
PE
271}
272
1da177e4
LT
273/*
274 * This returns non-zero if at EOF, so that the /proc
275 * root directory can use this and check if it should
276 * continue with the <pid> entries..
277 *
278 * Note that the VFS-layer doesn't care about the return
279 * value of the readdir() call, as long as it's non-negative
280 * for success..
281 */
93ad5bc6
AD
282int proc_readdir_de(struct file *file, struct dir_context *ctx,
283 struct proc_dir_entry *de)
1da177e4 284{
1da177e4 285 int i;
f0c3b509
AV
286
287 if (!dir_emit_dots(file, ctx))
288 return 0;
289
ecf1a3df 290 read_lock(&proc_subdir_lock);
710585d4 291 de = pde_subdir_first(de);
f0c3b509
AV
292 i = ctx->pos - 2;
293 for (;;) {
294 if (!de) {
ecf1a3df 295 read_unlock(&proc_subdir_lock);
f0c3b509
AV
296 return 0;
297 }
298 if (!i)
299 break;
710585d4 300 de = pde_subdir_next(de);
f0c3b509 301 i--;
1da177e4 302 }
f0c3b509
AV
303
304 do {
305 struct proc_dir_entry *next;
306 pde_get(de);
ecf1a3df 307 read_unlock(&proc_subdir_lock);
f0c3b509
AV
308 if (!dir_emit(ctx, de->name, de->namelen,
309 de->low_ino, de->mode >> 12)) {
310 pde_put(de);
311 return 0;
312 }
ecf1a3df 313 read_lock(&proc_subdir_lock);
f0c3b509 314 ctx->pos++;
710585d4 315 next = pde_subdir_next(de);
f0c3b509
AV
316 pde_put(de);
317 de = next;
318 } while (de);
ecf1a3df 319 read_unlock(&proc_subdir_lock);
fd3930f7 320 return 1;
1da177e4
LT
321}
322
f0c3b509 323int proc_readdir(struct file *file, struct dir_context *ctx)
e9720acd 324{
f0c3b509 325 struct inode *inode = file_inode(file);
e9720acd 326
93ad5bc6 327 return proc_readdir_de(file, ctx, PDE(inode));
e9720acd
PE
328}
329
1da177e4
LT
330/*
331 * These are the generic /proc directory operations. They
332 * use the in-memory "struct proc_dir_entry" tree to parse
333 * the /proc directory.
334 */
00977a59 335static const struct file_operations proc_dir_operations = {
b4df2b92 336 .llseek = generic_file_llseek,
1da177e4 337 .read = generic_read_dir,
f50752ea 338 .iterate_shared = proc_readdir,
1da177e4
LT
339};
340
341/*
342 * proc directories can do almost nothing..
343 */
c5ef1c42 344static const struct inode_operations proc_dir_inode_operations = {
1da177e4 345 .lookup = proc_lookup,
2b579bee 346 .getattr = proc_getattr,
1da177e4
LT
347 .setattr = proc_notify_change,
348};
349
61172eae
CH
350/* returns the registered entry, or frees dp and returns NULL on failure */
351struct proc_dir_entry *proc_register(struct proc_dir_entry *dir,
352 struct proc_dir_entry *dp)
1da177e4 353{
61172eae
CH
354 if (proc_alloc_inum(&dp->low_ino))
355 goto out_free_entry;
64a07bd8 356
ecf1a3df 357 write_lock(&proc_subdir_lock);
99fc06df 358 dp->parent = dir;
b208d54b 359 if (pde_subdir_insert(dir, dp) == false) {
710585d4
ND
360 WARN(1, "proc_dir_entry '%s/%s' already registered\n",
361 dir->name, dp->name);
ecf1a3df 362 write_unlock(&proc_subdir_lock);
61172eae 363 goto out_free_inum;
b208d54b 364 }
ecf1a3df 365 write_unlock(&proc_subdir_lock);
99fc06df 366
61172eae
CH
367 return dp;
368out_free_inum:
369 proc_free_inum(dp->low_ino);
370out_free_entry:
371 pde_free(dp);
372 return NULL;
1da177e4
LT
373}
374
2d3a4e36 375static struct proc_dir_entry *__proc_create(struct proc_dir_entry **parent,
1da177e4 376 const char *name,
d161a13f 377 umode_t mode,
1da177e4
LT
378 nlink_t nlink)
379{
380 struct proc_dir_entry *ent = NULL;
dbcdb504
AD
381 const char *fn;
382 struct qstr qstr;
1da177e4 383
7cee4e00 384 if (xlate_proc_name(name, parent, &fn) != 0)
1da177e4 385 goto out;
dbcdb504
AD
386 qstr.name = fn;
387 qstr.len = strlen(fn);
388 if (qstr.len == 0 || qstr.len >= 256) {
389 WARN(1, "name len %u\n", qstr.len);
390 return NULL;
391 }
b77d70db
AD
392 if (qstr.len == 1 && fn[0] == '.') {
393 WARN(1, "name '.'\n");
394 return NULL;
395 }
396 if (qstr.len == 2 && fn[0] == '.' && fn[1] == '.') {
397 WARN(1, "name '..'\n");
398 return NULL;
399 }
dbcdb504
AD
400 if (*parent == &proc_root && name_to_int(&qstr) != ~0U) {
401 WARN(1, "create '/proc/%s' by hand\n", qstr.name);
402 return NULL;
403 }
eb6d38d5
EB
404 if (is_empty_pde(*parent)) {
405 WARN(1, "attempt to add to permanently empty directory");
406 return NULL;
407 }
1da177e4 408
b4884f23 409 ent = kmem_cache_zalloc(proc_dir_entry_cache, GFP_KERNEL);
17baa2a2 410 if (!ent)
411 goto out;
1da177e4 412
b4884f23
AD
413 if (qstr.len + 1 <= sizeof(ent->inline_name)) {
414 ent->name = ent->inline_name;
415 } else {
416 ent->name = kmalloc(qstr.len + 1, GFP_KERNEL);
417 if (!ent->name) {
418 pde_free(ent);
419 return NULL;
420 }
421 }
422
dbcdb504
AD
423 memcpy(ent->name, fn, qstr.len + 1);
424 ent->namelen = qstr.len;
1da177e4
LT
425 ent->mode = mode;
426 ent->nlink = nlink;
4f113437 427 ent->subdir = RB_ROOT;
9cdd83e3 428 refcount_set(&ent->refcnt, 1);
786d7e16 429 spin_lock_init(&ent->pde_unload_lock);
881adb85 430 INIT_LIST_HEAD(&ent->pde_openers);
c110486f
DT
431 proc_set_user(ent, (*parent)->uid, (*parent)->gid);
432
17baa2a2 433out:
1da177e4
LT
434 return ent;
435}
436
437struct proc_dir_entry *proc_symlink(const char *name,
438 struct proc_dir_entry *parent, const char *dest)
439{
440 struct proc_dir_entry *ent;
441
2d3a4e36 442 ent = __proc_create(&parent, name,
1da177e4
LT
443 (S_IFLNK | S_IRUGO | S_IWUGO | S_IXUGO),1);
444
445 if (ent) {
446 ent->data = kmalloc((ent->size=strlen(dest))+1, GFP_KERNEL);
447 if (ent->data) {
448 strcpy((char*)ent->data,dest);
d443b9fd 449 ent->proc_iops = &proc_link_inode_operations;
61172eae 450 ent = proc_register(parent, ent);
1da177e4 451 } else {
b4884f23 452 pde_free(ent);
1da177e4
LT
453 ent = NULL;
454 }
455 }
456 return ent;
457}
587d4a17 458EXPORT_SYMBOL(proc_symlink);
1da177e4 459
270b5ac2
DH
460struct proc_dir_entry *proc_mkdir_data(const char *name, umode_t mode,
461 struct proc_dir_entry *parent, void *data)
1da177e4
LT
462{
463 struct proc_dir_entry *ent;
464
270b5ac2
DH
465 if (mode == 0)
466 mode = S_IRUGO | S_IXUGO;
467
2d3a4e36 468 ent = __proc_create(&parent, name, S_IFDIR | mode, 2);
1da177e4 469 if (ent) {
270b5ac2 470 ent->data = data;
d443b9fd
AV
471 ent->proc_fops = &proc_dir_operations;
472 ent->proc_iops = &proc_dir_inode_operations;
473 parent->nlink++;
61172eae
CH
474 ent = proc_register(parent, ent);
475 if (!ent)
d443b9fd 476 parent->nlink--;
1da177e4
LT
477 }
478 return ent;
479}
270b5ac2 480EXPORT_SYMBOL_GPL(proc_mkdir_data);
1da177e4 481
270b5ac2
DH
482struct proc_dir_entry *proc_mkdir_mode(const char *name, umode_t mode,
483 struct proc_dir_entry *parent)
78e92b99 484{
270b5ac2 485 return proc_mkdir_data(name, mode, parent, NULL);
78e92b99 486}
270b5ac2 487EXPORT_SYMBOL(proc_mkdir_mode);
78e92b99 488
1da177e4
LT
489struct proc_dir_entry *proc_mkdir(const char *name,
490 struct proc_dir_entry *parent)
491{
270b5ac2 492 return proc_mkdir_data(name, 0, parent, NULL);
1da177e4 493}
587d4a17 494EXPORT_SYMBOL(proc_mkdir);
1da177e4 495
eb6d38d5
EB
496struct proc_dir_entry *proc_create_mount_point(const char *name)
497{
498 umode_t mode = S_IFDIR | S_IRUGO | S_IXUGO;
499 struct proc_dir_entry *ent, *parent = NULL;
500
501 ent = __proc_create(&parent, name, mode, 2);
502 if (ent) {
503 ent->data = NULL;
504 ent->proc_fops = NULL;
505 ent->proc_iops = NULL;
d66bb160 506 parent->nlink++;
61172eae
CH
507 ent = proc_register(parent, ent);
508 if (!ent)
eb6d38d5 509 parent->nlink--;
eb6d38d5
EB
510 }
511 return ent;
512}
f97df70b 513EXPORT_SYMBOL(proc_create_mount_point);
eb6d38d5 514
7aed53d1
CH
515struct proc_dir_entry *proc_create_reg(const char *name, umode_t mode,
516 struct proc_dir_entry **parent, void *data)
2d3a4e36 517{
7aed53d1
CH
518 struct proc_dir_entry *p;
519
b6cdc731
AV
520 if ((mode & S_IFMT) == 0)
521 mode |= S_IFREG;
7aed53d1
CH
522 if ((mode & S_IALLUGO) == 0)
523 mode |= S_IRUGO;
524 if (WARN_ON_ONCE(!S_ISREG(mode)))
b6cdc731 525 return NULL;
7aed53d1
CH
526
527 p = __proc_create(parent, name, mode, 1);
528 if (p) {
529 p->proc_iops = &proc_file_inode_operations;
530 p->data = data;
2d3a4e36 531 }
7aed53d1
CH
532 return p;
533}
534
535struct proc_dir_entry *proc_create_data(const char *name, umode_t mode,
536 struct proc_dir_entry *parent,
537 const struct file_operations *proc_fops, void *data)
538{
539 struct proc_dir_entry *p;
2d3a4e36 540
d443b9fd
AV
541 BUG_ON(proc_fops == NULL);
542
7aed53d1
CH
543 p = proc_create_reg(name, mode, &parent, data);
544 if (!p)
545 return NULL;
546 p->proc_fops = proc_fops;
547 return proc_register(parent, p);
2d3a4e36 548}
587d4a17 549EXPORT_SYMBOL(proc_create_data);
271a15ea 550
855d9765
AD
551struct proc_dir_entry *proc_create(const char *name, umode_t mode,
552 struct proc_dir_entry *parent,
553 const struct file_operations *proc_fops)
554{
555 return proc_create_data(name, mode, parent, proc_fops, NULL);
556}
557EXPORT_SYMBOL(proc_create);
558
fddda2b7
CH
559static int proc_seq_open(struct inode *inode, struct file *file)
560{
561 struct proc_dir_entry *de = PDE(inode);
562
44414d82
CH
563 if (de->state_size)
564 return seq_open_private(file, de->seq_ops, de->state_size);
fddda2b7
CH
565 return seq_open(file, de->seq_ops);
566}
567
568static const struct file_operations proc_seq_fops = {
569 .open = proc_seq_open,
570 .read = seq_read,
571 .llseek = seq_lseek,
572 .release = seq_release,
573};
574
44414d82 575struct proc_dir_entry *proc_create_seq_private(const char *name, umode_t mode,
fddda2b7 576 struct proc_dir_entry *parent, const struct seq_operations *ops,
44414d82 577 unsigned int state_size, void *data)
fddda2b7
CH
578{
579 struct proc_dir_entry *p;
580
581 p = proc_create_reg(name, mode, &parent, data);
582 if (!p)
583 return NULL;
584 p->proc_fops = &proc_seq_fops;
585 p->seq_ops = ops;
44414d82 586 p->state_size = state_size;
fddda2b7
CH
587 return proc_register(parent, p);
588}
44414d82 589EXPORT_SYMBOL(proc_create_seq_private);
fddda2b7 590
3f3942ac
CH
591static int proc_single_open(struct inode *inode, struct file *file)
592{
593 struct proc_dir_entry *de = PDE(inode);
594
595 return single_open(file, de->single_show, de->data);
596}
597
598static const struct file_operations proc_single_fops = {
599 .open = proc_single_open,
600 .read = seq_read,
601 .llseek = seq_lseek,
602 .release = single_release,
603};
604
605struct proc_dir_entry *proc_create_single_data(const char *name, umode_t mode,
606 struct proc_dir_entry *parent,
607 int (*show)(struct seq_file *, void *), void *data)
608{
609 struct proc_dir_entry *p;
610
611 p = proc_create_reg(name, mode, &parent, data);
612 if (!p)
613 return NULL;
614 p->proc_fops = &proc_single_fops;
615 p->single_show = show;
616 return proc_register(parent, p);
617}
618EXPORT_SYMBOL(proc_create_single_data);
619
271a15ea
DH
620void proc_set_size(struct proc_dir_entry *de, loff_t size)
621{
622 de->size = size;
623}
624EXPORT_SYMBOL(proc_set_size);
625
626void proc_set_user(struct proc_dir_entry *de, kuid_t uid, kgid_t gid)
627{
628 de->uid = uid;
629 de->gid = gid;
630}
631EXPORT_SYMBOL(proc_set_user);
2d3a4e36 632
135d5655
AD
633void pde_put(struct proc_dir_entry *pde)
634{
9cdd83e3 635 if (refcount_dec_and_test(&pde->refcnt)) {
b4884f23
AD
636 proc_free_inum(pde->low_ino);
637 pde_free(pde);
638 }
135d5655
AD
639}
640
8ce584c7
AV
641/*
642 * Remove a /proc entry and free it if it's not currently in use.
643 */
644void remove_proc_entry(const char *name, struct proc_dir_entry *parent)
645{
8ce584c7
AV
646 struct proc_dir_entry *de = NULL;
647 const char *fn = name;
648 unsigned int len;
649
ecf1a3df 650 write_lock(&proc_subdir_lock);
8ce584c7 651 if (__xlate_proc_name(name, &parent, &fn) != 0) {
ecf1a3df 652 write_unlock(&proc_subdir_lock);
8ce584c7
AV
653 return;
654 }
655 len = strlen(fn);
656
710585d4
ND
657 de = pde_subdir_find(parent, fn, len);
658 if (de)
4f113437 659 rb_erase(&de->subdir_node, &parent->subdir);
ecf1a3df 660 write_unlock(&proc_subdir_lock);
8ce584c7
AV
661 if (!de) {
662 WARN(1, "name '%s'\n", name);
663 return;
664 }
665
866ad9a7 666 proc_entry_rundown(de);
881adb85 667
f649d6d3
AD
668 if (S_ISDIR(de->mode))
669 parent->nlink--;
670 de->nlink = 0;
710585d4
ND
671 WARN(pde_subdir_first(de),
672 "%s: removing non-empty directory '%s/%s', leaking at least '%s'\n",
673 __func__, de->parent->name, de->name, pde_subdir_first(de)->name);
135d5655 674 pde_put(de);
1da177e4 675}
587d4a17 676EXPORT_SYMBOL(remove_proc_entry);
8ce584c7
AV
677
678int remove_proc_subtree(const char *name, struct proc_dir_entry *parent)
679{
8ce584c7
AV
680 struct proc_dir_entry *root = NULL, *de, *next;
681 const char *fn = name;
682 unsigned int len;
683
ecf1a3df 684 write_lock(&proc_subdir_lock);
8ce584c7 685 if (__xlate_proc_name(name, &parent, &fn) != 0) {
ecf1a3df 686 write_unlock(&proc_subdir_lock);
8ce584c7
AV
687 return -ENOENT;
688 }
689 len = strlen(fn);
690
710585d4 691 root = pde_subdir_find(parent, fn, len);
8ce584c7 692 if (!root) {
ecf1a3df 693 write_unlock(&proc_subdir_lock);
8ce584c7
AV
694 return -ENOENT;
695 }
4f113437 696 rb_erase(&root->subdir_node, &parent->subdir);
710585d4 697
8ce584c7
AV
698 de = root;
699 while (1) {
710585d4 700 next = pde_subdir_first(de);
8ce584c7 701 if (next) {
4f113437 702 rb_erase(&next->subdir_node, &de->subdir);
8ce584c7
AV
703 de = next;
704 continue;
705 }
ecf1a3df 706 write_unlock(&proc_subdir_lock);
8ce584c7 707
866ad9a7 708 proc_entry_rundown(de);
8ce584c7
AV
709 next = de->parent;
710 if (S_ISDIR(de->mode))
711 next->nlink--;
712 de->nlink = 0;
713 if (de == root)
714 break;
715 pde_put(de);
716
ecf1a3df 717 write_lock(&proc_subdir_lock);
8ce584c7
AV
718 de = next;
719 }
720 pde_put(root);
721 return 0;
722}
723EXPORT_SYMBOL(remove_proc_subtree);
4a520d27
DH
724
725void *proc_get_parent_data(const struct inode *inode)
726{
727 struct proc_dir_entry *de = PDE(inode);
728 return de->parent->data;
729}
730EXPORT_SYMBOL_GPL(proc_get_parent_data);
a8ca16ea
DH
731
732void proc_remove(struct proc_dir_entry *de)
733{
734 if (de)
735 remove_proc_subtree(de->name, de->parent);
736}
737EXPORT_SYMBOL(proc_remove);
c30480b9
DH
738
739void *PDE_DATA(const struct inode *inode)
740{
741 return __PDE_DATA(inode);
742}
743EXPORT_SYMBOL(PDE_DATA);