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