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