2 * proc/fs/generic.c --- generic routines for the proc-fs
4 * This file contains generic proc-fs routines for handling
5 * directories and files.
7 * Copyright (C) 1991, 1992 Linus Torvalds.
8 * Copyright (C) 1997 Theodore Ts'o
11 #include <linux/cache.h>
12 #include <linux/errno.h>
13 #include <linux/time.h>
14 #include <linux/proc_fs.h>
15 #include <linux/stat.h>
17 #include <linux/module.h>
18 #include <linux/namei.h>
19 #include <linux/slab.h>
20 #include <linux/printk.h>
21 #include <linux/mount.h>
22 #include <linux/init.h>
23 #include <linux/idr.h>
24 #include <linux/bitops.h>
25 #include <linux/spinlock.h>
26 #include <linux/completion.h>
27 #include <linux/uaccess.h>
28 #include <linux/seq_file.h>
32 static DEFINE_RWLOCK(proc_subdir_lock);
34 struct kmem_cache *proc_dir_entry_cache __ro_after_init;
36 void pde_free(struct proc_dir_entry *pde)
38 if (S_ISLNK(pde->mode))
40 if (pde->name != pde->inline_name)
42 kmem_cache_free(proc_dir_entry_cache, pde);
45 static int proc_match(const char *name, struct proc_dir_entry *de, unsigned int len)
47 if (len < de->namelen)
49 if (len > de->namelen)
52 return memcmp(name, de->name, len);
55 static struct proc_dir_entry *pde_subdir_first(struct proc_dir_entry *dir)
57 return rb_entry_safe(rb_first(&dir->subdir), struct proc_dir_entry,
61 static struct proc_dir_entry *pde_subdir_next(struct proc_dir_entry *dir)
63 return rb_entry_safe(rb_next(&dir->subdir_node), struct proc_dir_entry,
67 static struct proc_dir_entry *pde_subdir_find(struct proc_dir_entry *dir,
71 struct rb_node *node = dir->subdir.rb_node;
74 struct proc_dir_entry *de = rb_entry(node,
75 struct proc_dir_entry,
77 int result = proc_match(name, de, len);
82 node = node->rb_right;
89 static bool pde_subdir_insert(struct proc_dir_entry *dir,
90 struct proc_dir_entry *de)
92 struct rb_root *root = &dir->subdir;
93 struct rb_node **new = &root->rb_node, *parent = NULL;
95 /* Figure out where to put new node */
97 struct proc_dir_entry *this = rb_entry(*new,
98 struct proc_dir_entry,
100 int result = proc_match(de->name, this, de->namelen);
104 new = &(*new)->rb_left;
106 new = &(*new)->rb_right;
111 /* Add new node and rebalance tree. */
112 rb_link_node(&de->subdir_node, parent, new);
113 rb_insert_color(&de->subdir_node, root);
117 static int proc_notify_change(struct dentry *dentry, struct iattr *iattr)
119 struct inode *inode = d_inode(dentry);
120 struct proc_dir_entry *de = PDE(inode);
123 error = setattr_prepare(dentry, iattr);
127 setattr_copy(inode, iattr);
128 mark_inode_dirty(inode);
130 proc_set_user(de, inode->i_uid, inode->i_gid);
131 de->mode = inode->i_mode;
135 static int proc_getattr(const struct path *path, struct kstat *stat,
136 u32 request_mask, unsigned int query_flags)
138 struct inode *inode = d_inode(path->dentry);
139 struct proc_dir_entry *de = PDE(inode);
141 set_nlink(inode, de->nlink);
143 generic_fillattr(inode, stat);
147 static const struct inode_operations proc_file_inode_operations = {
148 .setattr = proc_notify_change,
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.
156 static int __xlate_proc_name(const char *name, struct proc_dir_entry **ret,
157 const char **residual)
159 const char *cp = name, *next;
160 struct proc_dir_entry *de;
168 next = strchr(cp, '/');
173 de = pde_subdir_find(de, cp, len);
175 WARN(1, "name '%s'\n", name);
185 static int xlate_proc_name(const char *name, struct proc_dir_entry **ret,
186 const char **residual)
190 read_lock(&proc_subdir_lock);
191 rv = __xlate_proc_name(name, ret, residual);
192 read_unlock(&proc_subdir_lock);
196 static DEFINE_IDA(proc_inum_ida);
198 #define PROC_DYNAMIC_FIRST 0xF0000000U
201 * Return an inode number between PROC_DYNAMIC_FIRST and
202 * 0xffffffff, or zero on failure.
204 int proc_alloc_inum(unsigned int *inum)
208 i = ida_simple_get(&proc_inum_ida, 0, UINT_MAX - PROC_DYNAMIC_FIRST + 1,
213 *inum = PROC_DYNAMIC_FIRST + (unsigned int)i;
217 void proc_free_inum(unsigned int inum)
219 ida_simple_remove(&proc_inum_ida, inum - PROC_DYNAMIC_FIRST);
222 static int proc_misc_d_revalidate(struct dentry *dentry, unsigned int flags)
224 if (flags & LOOKUP_RCU)
227 if (atomic_read(&PDE(d_inode(dentry))->in_use) < 0)
228 return 0; /* revalidate */
232 static int proc_misc_d_delete(const struct dentry *dentry)
234 return atomic_read(&PDE(d_inode(dentry))->in_use) < 0;
237 static const struct dentry_operations proc_misc_dentry_ops = {
238 .d_revalidate = proc_misc_d_revalidate,
239 .d_delete = proc_misc_d_delete,
243 * Don't create negative dentries here, return -ENOENT by hand
246 struct dentry *proc_lookup_de(struct inode *dir, struct dentry *dentry,
247 struct proc_dir_entry *de)
251 read_lock(&proc_subdir_lock);
252 de = pde_subdir_find(de, dentry->d_name.name, dentry->d_name.len);
255 read_unlock(&proc_subdir_lock);
256 inode = proc_get_inode(dir->i_sb, de);
258 return ERR_PTR(-ENOMEM);
259 d_set_d_op(dentry, &proc_misc_dentry_ops);
260 d_add(dentry, inode);
263 read_unlock(&proc_subdir_lock);
264 return ERR_PTR(-ENOENT);
267 struct dentry *proc_lookup(struct inode *dir, struct dentry *dentry,
270 return proc_lookup_de(dir, dentry, PDE(dir));
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..
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
282 int proc_readdir_de(struct file *file, struct dir_context *ctx,
283 struct proc_dir_entry *de)
287 if (!dir_emit_dots(file, ctx))
290 read_lock(&proc_subdir_lock);
291 de = pde_subdir_first(de);
295 read_unlock(&proc_subdir_lock);
300 de = pde_subdir_next(de);
305 struct proc_dir_entry *next;
307 read_unlock(&proc_subdir_lock);
308 if (!dir_emit(ctx, de->name, de->namelen,
309 de->low_ino, de->mode >> 12)) {
313 read_lock(&proc_subdir_lock);
315 next = pde_subdir_next(de);
319 read_unlock(&proc_subdir_lock);
323 int proc_readdir(struct file *file, struct dir_context *ctx)
325 struct inode *inode = file_inode(file);
327 return proc_readdir_de(file, ctx, PDE(inode));
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.
335 static const struct file_operations proc_dir_operations = {
336 .llseek = generic_file_llseek,
337 .read = generic_read_dir,
338 .iterate_shared = proc_readdir,
342 * proc directories can do almost nothing..
344 static const struct inode_operations proc_dir_inode_operations = {
345 .lookup = proc_lookup,
346 .getattr = proc_getattr,
347 .setattr = proc_notify_change,
350 /* returns the registered entry, or frees dp and returns NULL on failure */
351 struct proc_dir_entry *proc_register(struct proc_dir_entry *dir,
352 struct proc_dir_entry *dp)
354 if (proc_alloc_inum(&dp->low_ino))
357 write_lock(&proc_subdir_lock);
359 if (pde_subdir_insert(dir, dp) == false) {
360 WARN(1, "proc_dir_entry '%s/%s' already registered\n",
361 dir->name, dp->name);
362 write_unlock(&proc_subdir_lock);
365 write_unlock(&proc_subdir_lock);
369 proc_free_inum(dp->low_ino);
375 static struct proc_dir_entry *__proc_create(struct proc_dir_entry **parent,
380 struct proc_dir_entry *ent = NULL;
384 if (xlate_proc_name(name, parent, &fn) != 0)
387 qstr.len = strlen(fn);
388 if (qstr.len == 0 || qstr.len >= 256) {
389 WARN(1, "name len %u\n", qstr.len);
392 if (qstr.len == 1 && fn[0] == '.') {
393 WARN(1, "name '.'\n");
396 if (qstr.len == 2 && fn[0] == '.' && fn[1] == '.') {
397 WARN(1, "name '..'\n");
400 if (*parent == &proc_root && name_to_int(&qstr) != ~0U) {
401 WARN(1, "create '/proc/%s' by hand\n", qstr.name);
404 if (is_empty_pde(*parent)) {
405 WARN(1, "attempt to add to permanently empty directory");
409 ent = kmem_cache_zalloc(proc_dir_entry_cache, GFP_KERNEL);
413 if (qstr.len + 1 <= sizeof(ent->inline_name)) {
414 ent->name = ent->inline_name;
416 ent->name = kmalloc(qstr.len + 1, GFP_KERNEL);
423 memcpy(ent->name, fn, qstr.len + 1);
424 ent->namelen = qstr.len;
427 ent->subdir = RB_ROOT;
428 refcount_set(&ent->refcnt, 1);
429 spin_lock_init(&ent->pde_unload_lock);
430 INIT_LIST_HEAD(&ent->pde_openers);
431 proc_set_user(ent, (*parent)->uid, (*parent)->gid);
437 struct proc_dir_entry *proc_symlink(const char *name,
438 struct proc_dir_entry *parent, const char *dest)
440 struct proc_dir_entry *ent;
442 ent = __proc_create(&parent, name,
443 (S_IFLNK | S_IRUGO | S_IWUGO | S_IXUGO),1);
446 ent->data = kmalloc((ent->size=strlen(dest))+1, GFP_KERNEL);
448 strcpy((char*)ent->data,dest);
449 ent->proc_iops = &proc_link_inode_operations;
450 ent = proc_register(parent, ent);
458 EXPORT_SYMBOL(proc_symlink);
460 struct proc_dir_entry *proc_mkdir_data(const char *name, umode_t mode,
461 struct proc_dir_entry *parent, void *data)
463 struct proc_dir_entry *ent;
466 mode = S_IRUGO | S_IXUGO;
468 ent = __proc_create(&parent, name, S_IFDIR | mode, 2);
471 ent->proc_fops = &proc_dir_operations;
472 ent->proc_iops = &proc_dir_inode_operations;
474 ent = proc_register(parent, ent);
480 EXPORT_SYMBOL_GPL(proc_mkdir_data);
482 struct proc_dir_entry *proc_mkdir_mode(const char *name, umode_t mode,
483 struct proc_dir_entry *parent)
485 return proc_mkdir_data(name, mode, parent, NULL);
487 EXPORT_SYMBOL(proc_mkdir_mode);
489 struct proc_dir_entry *proc_mkdir(const char *name,
490 struct proc_dir_entry *parent)
492 return proc_mkdir_data(name, 0, parent, NULL);
494 EXPORT_SYMBOL(proc_mkdir);
496 struct proc_dir_entry *proc_create_mount_point(const char *name)
498 umode_t mode = S_IFDIR | S_IRUGO | S_IXUGO;
499 struct proc_dir_entry *ent, *parent = NULL;
501 ent = __proc_create(&parent, name, mode, 2);
504 ent->proc_fops = NULL;
505 ent->proc_iops = NULL;
507 ent = proc_register(parent, ent);
513 EXPORT_SYMBOL(proc_create_mount_point);
515 struct proc_dir_entry *proc_create_reg(const char *name, umode_t mode,
516 struct proc_dir_entry **parent, void *data)
518 struct proc_dir_entry *p;
520 if ((mode & S_IFMT) == 0)
522 if ((mode & S_IALLUGO) == 0)
524 if (WARN_ON_ONCE(!S_ISREG(mode)))
527 p = __proc_create(parent, name, mode, 1);
529 p->proc_iops = &proc_file_inode_operations;
535 struct 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)
539 struct proc_dir_entry *p;
541 BUG_ON(proc_fops == NULL);
543 p = proc_create_reg(name, mode, &parent, data);
546 p->proc_fops = proc_fops;
547 return proc_register(parent, p);
549 EXPORT_SYMBOL(proc_create_data);
551 struct proc_dir_entry *proc_create(const char *name, umode_t mode,
552 struct proc_dir_entry *parent,
553 const struct file_operations *proc_fops)
555 return proc_create_data(name, mode, parent, proc_fops, NULL);
557 EXPORT_SYMBOL(proc_create);
559 static int proc_seq_open(struct inode *inode, struct file *file)
561 struct proc_dir_entry *de = PDE(inode);
563 return seq_open(file, de->seq_ops);
566 static const struct file_operations proc_seq_fops = {
567 .open = proc_seq_open,
570 .release = seq_release,
573 struct proc_dir_entry *proc_create_seq_data(const char *name, umode_t mode,
574 struct proc_dir_entry *parent, const struct seq_operations *ops,
577 struct proc_dir_entry *p;
579 p = proc_create_reg(name, mode, &parent, data);
582 p->proc_fops = &proc_seq_fops;
584 return proc_register(parent, p);
586 EXPORT_SYMBOL(proc_create_seq_data);
588 void proc_set_size(struct proc_dir_entry *de, loff_t size)
592 EXPORT_SYMBOL(proc_set_size);
594 void proc_set_user(struct proc_dir_entry *de, kuid_t uid, kgid_t gid)
599 EXPORT_SYMBOL(proc_set_user);
601 void pde_put(struct proc_dir_entry *pde)
603 if (refcount_dec_and_test(&pde->refcnt)) {
604 proc_free_inum(pde->low_ino);
610 * Remove a /proc entry and free it if it's not currently in use.
612 void remove_proc_entry(const char *name, struct proc_dir_entry *parent)
614 struct proc_dir_entry *de = NULL;
615 const char *fn = name;
618 write_lock(&proc_subdir_lock);
619 if (__xlate_proc_name(name, &parent, &fn) != 0) {
620 write_unlock(&proc_subdir_lock);
625 de = pde_subdir_find(parent, fn, len);
627 rb_erase(&de->subdir_node, &parent->subdir);
628 write_unlock(&proc_subdir_lock);
630 WARN(1, "name '%s'\n", name);
634 proc_entry_rundown(de);
636 if (S_ISDIR(de->mode))
639 WARN(pde_subdir_first(de),
640 "%s: removing non-empty directory '%s/%s', leaking at least '%s'\n",
641 __func__, de->parent->name, de->name, pde_subdir_first(de)->name);
644 EXPORT_SYMBOL(remove_proc_entry);
646 int remove_proc_subtree(const char *name, struct proc_dir_entry *parent)
648 struct proc_dir_entry *root = NULL, *de, *next;
649 const char *fn = name;
652 write_lock(&proc_subdir_lock);
653 if (__xlate_proc_name(name, &parent, &fn) != 0) {
654 write_unlock(&proc_subdir_lock);
659 root = pde_subdir_find(parent, fn, len);
661 write_unlock(&proc_subdir_lock);
664 rb_erase(&root->subdir_node, &parent->subdir);
668 next = pde_subdir_first(de);
670 rb_erase(&next->subdir_node, &de->subdir);
674 write_unlock(&proc_subdir_lock);
676 proc_entry_rundown(de);
678 if (S_ISDIR(de->mode))
685 write_lock(&proc_subdir_lock);
691 EXPORT_SYMBOL(remove_proc_subtree);
693 void *proc_get_parent_data(const struct inode *inode)
695 struct proc_dir_entry *de = PDE(inode);
696 return de->parent->data;
698 EXPORT_SYMBOL_GPL(proc_get_parent_data);
700 void proc_remove(struct proc_dir_entry *de)
703 remove_proc_subtree(de->name, de->parent);
705 EXPORT_SYMBOL(proc_remove);
707 void *PDE_DATA(const struct inode *inode)
709 return __PDE_DATA(inode);
711 EXPORT_SYMBOL(PDE_DATA);