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/errno.h>
12 #include <linux/time.h>
13 #include <linux/proc_fs.h>
14 #include <linux/stat.h>
16 #include <linux/module.h>
17 #include <linux/slab.h>
18 #include <linux/printk.h>
19 #include <linux/mount.h>
20 #include <linux/init.h>
21 #include <linux/idr.h>
22 #include <linux/namei.h>
23 #include <linux/bitops.h>
24 #include <linux/spinlock.h>
25 #include <linux/completion.h>
26 #include <asm/uaccess.h>
30 DEFINE_SPINLOCK(proc_subdir_lock);
32 static int proc_match(unsigned int len, const char *name, struct proc_dir_entry *de)
34 if (de->namelen != len)
36 return !memcmp(name, de->name, len);
39 static int proc_notify_change(struct dentry *dentry, struct iattr *iattr)
41 struct inode *inode = dentry->d_inode;
42 struct proc_dir_entry *de = PDE(inode);
45 error = inode_change_ok(inode, iattr);
49 setattr_copy(inode, iattr);
50 mark_inode_dirty(inode);
52 de->uid = inode->i_uid;
53 de->gid = inode->i_gid;
54 de->mode = inode->i_mode;
58 static int proc_getattr(struct vfsmount *mnt, struct dentry *dentry,
61 struct inode *inode = dentry->d_inode;
62 struct proc_dir_entry *de = PROC_I(inode)->pde;
64 set_nlink(inode, de->nlink);
66 generic_fillattr(inode, stat);
70 static const struct inode_operations proc_file_inode_operations = {
71 .setattr = proc_notify_change,
75 * This function parses a name such as "tty/driver/serial", and
76 * returns the struct proc_dir_entry for "/proc/tty/driver", and
77 * returns "serial" in residual.
79 static int __xlate_proc_name(const char *name, struct proc_dir_entry **ret,
80 const char **residual)
82 const char *cp = name, *next;
83 struct proc_dir_entry *de;
91 next = strchr(cp, '/');
96 for (de = de->subdir; de ; de = de->next) {
97 if (proc_match(len, cp, de))
101 WARN(1, "name '%s'\n", name);
111 static int xlate_proc_name(const char *name, struct proc_dir_entry **ret,
112 const char **residual)
116 spin_lock(&proc_subdir_lock);
117 rv = __xlate_proc_name(name, ret, residual);
118 spin_unlock(&proc_subdir_lock);
122 static DEFINE_IDA(proc_inum_ida);
123 static DEFINE_SPINLOCK(proc_inum_lock); /* protects the above */
125 #define PROC_DYNAMIC_FIRST 0xF0000000U
128 * Return an inode number between PROC_DYNAMIC_FIRST and
129 * 0xffffffff, or zero on failure.
131 int proc_alloc_inum(unsigned int *inum)
137 if (!ida_pre_get(&proc_inum_ida, GFP_KERNEL))
140 spin_lock_irq(&proc_inum_lock);
141 error = ida_get_new(&proc_inum_ida, &i);
142 spin_unlock_irq(&proc_inum_lock);
143 if (error == -EAGAIN)
148 if (i > UINT_MAX - PROC_DYNAMIC_FIRST) {
149 spin_lock_irq(&proc_inum_lock);
150 ida_remove(&proc_inum_ida, i);
151 spin_unlock_irq(&proc_inum_lock);
154 *inum = PROC_DYNAMIC_FIRST + i;
158 void proc_free_inum(unsigned int inum)
161 spin_lock_irqsave(&proc_inum_lock, flags);
162 ida_remove(&proc_inum_ida, inum - PROC_DYNAMIC_FIRST);
163 spin_unlock_irqrestore(&proc_inum_lock, flags);
166 static void *proc_follow_link(struct dentry *dentry, struct nameidata *nd)
168 nd_set_link(nd, __PDE_DATA(dentry->d_inode));
172 static const struct inode_operations proc_link_inode_operations = {
173 .readlink = generic_readlink,
174 .follow_link = proc_follow_link,
178 * As some entries in /proc are volatile, we want to
179 * get rid of unused dentries. This could be made
180 * smarter: we could keep a "volatile" flag in the
181 * inode to indicate which ones to keep.
183 static int proc_delete_dentry(const struct dentry * dentry)
188 static const struct dentry_operations proc_dentry_operations =
190 .d_delete = proc_delete_dentry,
194 * Don't create negative dentries here, return -ENOENT by hand
197 struct dentry *proc_lookup_de(struct proc_dir_entry *de, struct inode *dir,
198 struct dentry *dentry)
202 spin_lock(&proc_subdir_lock);
203 for (de = de->subdir; de ; de = de->next) {
204 if (de->namelen != dentry->d_name.len)
206 if (!memcmp(dentry->d_name.name, de->name, de->namelen)) {
208 spin_unlock(&proc_subdir_lock);
209 inode = proc_get_inode(dir->i_sb, de);
211 return ERR_PTR(-ENOMEM);
212 d_set_d_op(dentry, &proc_dentry_operations);
213 d_add(dentry, inode);
217 spin_unlock(&proc_subdir_lock);
218 return ERR_PTR(-ENOENT);
221 struct dentry *proc_lookup(struct inode *dir, struct dentry *dentry,
224 return proc_lookup_de(PDE(dir), dir, dentry);
228 * This returns non-zero if at EOF, so that the /proc
229 * root directory can use this and check if it should
230 * continue with the <pid> entries..
232 * Note that the VFS-layer doesn't care about the return
233 * value of the readdir() call, as long as it's non-negative
236 int proc_readdir_de(struct proc_dir_entry *de, struct file *filp, void *dirent,
241 struct inode *inode = file_inode(filp);
248 if (filldir(dirent, ".", 1, i, ino, DT_DIR) < 0)
254 if (filldir(dirent, "..", 2, i,
255 parent_ino(filp->f_path.dentry),
262 spin_lock(&proc_subdir_lock);
268 spin_unlock(&proc_subdir_lock);
278 struct proc_dir_entry *next;
280 /* filldir passes info to user space */
282 spin_unlock(&proc_subdir_lock);
283 if (filldir(dirent, de->name, de->namelen, filp->f_pos,
284 de->low_ino, de->mode >> 12) < 0) {
288 spin_lock(&proc_subdir_lock);
294 spin_unlock(&proc_subdir_lock);
301 int proc_readdir(struct file *filp, void *dirent, filldir_t filldir)
303 struct inode *inode = file_inode(filp);
305 return proc_readdir_de(PDE(inode), filp, dirent, filldir);
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.
313 static const struct file_operations proc_dir_operations = {
314 .llseek = generic_file_llseek,
315 .read = generic_read_dir,
316 .readdir = proc_readdir,
320 * proc directories can do almost nothing..
322 static const struct inode_operations proc_dir_inode_operations = {
323 .lookup = proc_lookup,
324 .getattr = proc_getattr,
325 .setattr = proc_notify_change,
328 static int proc_register(struct proc_dir_entry * dir, struct proc_dir_entry * dp)
330 struct proc_dir_entry *tmp;
333 ret = proc_alloc_inum(&dp->low_ino);
337 if (S_ISDIR(dp->mode)) {
338 dp->proc_fops = &proc_dir_operations;
339 dp->proc_iops = &proc_dir_inode_operations;
341 } else if (S_ISLNK(dp->mode)) {
342 dp->proc_iops = &proc_link_inode_operations;
343 } else if (S_ISREG(dp->mode)) {
344 BUG_ON(dp->proc_fops == NULL);
345 dp->proc_iops = &proc_file_inode_operations;
351 spin_lock(&proc_subdir_lock);
353 for (tmp = dir->subdir; tmp; tmp = tmp->next)
354 if (strcmp(tmp->name, dp->name) == 0) {
355 WARN(1, "proc_dir_entry '%s/%s' already registered\n",
356 dir->name, dp->name);
360 dp->next = dir->subdir;
363 spin_unlock(&proc_subdir_lock);
368 static struct proc_dir_entry *__proc_create(struct proc_dir_entry **parent,
373 struct proc_dir_entry *ent = NULL;
374 const char *fn = name;
377 /* make sure name is valid */
378 if (!name || !strlen(name))
381 if (xlate_proc_name(name, parent, &fn) != 0)
384 /* At this point there must not be any '/' characters beyond *fn */
390 ent = kzalloc(sizeof(struct proc_dir_entry) + len + 1, GFP_KERNEL);
394 memcpy(ent->name, fn, len + 1);
398 atomic_set(&ent->count, 1);
399 spin_lock_init(&ent->pde_unload_lock);
400 INIT_LIST_HEAD(&ent->pde_openers);
405 struct proc_dir_entry *proc_symlink(const char *name,
406 struct proc_dir_entry *parent, const char *dest)
408 struct proc_dir_entry *ent;
410 ent = __proc_create(&parent, name,
411 (S_IFLNK | S_IRUGO | S_IWUGO | S_IXUGO),1);
414 ent->data = kmalloc((ent->size=strlen(dest))+1, GFP_KERNEL);
416 strcpy((char*)ent->data,dest);
417 if (proc_register(parent, ent) < 0) {
429 EXPORT_SYMBOL(proc_symlink);
431 struct proc_dir_entry *proc_mkdir_data(const char *name, umode_t mode,
432 struct proc_dir_entry *parent, void *data)
434 struct proc_dir_entry *ent;
437 mode = S_IRUGO | S_IXUGO;
439 ent = __proc_create(&parent, name, S_IFDIR | mode, 2);
442 if (proc_register(parent, ent) < 0) {
449 EXPORT_SYMBOL_GPL(proc_mkdir_data);
451 struct proc_dir_entry *proc_mkdir_mode(const char *name, umode_t mode,
452 struct proc_dir_entry *parent)
454 return proc_mkdir_data(name, mode, parent, NULL);
456 EXPORT_SYMBOL(proc_mkdir_mode);
458 struct proc_dir_entry *proc_mkdir(const char *name,
459 struct proc_dir_entry *parent)
461 return proc_mkdir_data(name, 0, parent, NULL);
463 EXPORT_SYMBOL(proc_mkdir);
465 struct proc_dir_entry *proc_create_data(const char *name, umode_t mode,
466 struct proc_dir_entry *parent,
467 const struct file_operations *proc_fops,
470 struct proc_dir_entry *pde;
471 if ((mode & S_IFMT) == 0)
474 if (!S_ISREG(mode)) {
475 WARN_ON(1); /* use proc_mkdir() */
479 if ((mode & S_IALLUGO) == 0)
481 pde = __proc_create(&parent, name, mode, 1);
484 pde->proc_fops = proc_fops;
486 if (proc_register(parent, pde) < 0)
494 EXPORT_SYMBOL(proc_create_data);
496 void proc_set_size(struct proc_dir_entry *de, loff_t size)
500 EXPORT_SYMBOL(proc_set_size);
502 void proc_set_user(struct proc_dir_entry *de, kuid_t uid, kgid_t gid)
507 EXPORT_SYMBOL(proc_set_user);
509 static void free_proc_entry(struct proc_dir_entry *de)
511 proc_free_inum(de->low_ino);
513 if (S_ISLNK(de->mode))
518 void pde_put(struct proc_dir_entry *pde)
520 if (atomic_dec_and_test(&pde->count))
521 free_proc_entry(pde);
525 * Remove a /proc entry and free it if it's not currently in use.
527 void remove_proc_entry(const char *name, struct proc_dir_entry *parent)
529 struct proc_dir_entry **p;
530 struct proc_dir_entry *de = NULL;
531 const char *fn = name;
534 spin_lock(&proc_subdir_lock);
535 if (__xlate_proc_name(name, &parent, &fn) != 0) {
536 spin_unlock(&proc_subdir_lock);
541 for (p = &parent->subdir; *p; p=&(*p)->next ) {
542 if (proc_match(len, fn, *p)) {
549 spin_unlock(&proc_subdir_lock);
551 WARN(1, "name '%s'\n", name);
555 proc_entry_rundown(de);
557 if (S_ISDIR(de->mode))
560 WARN(de->subdir, "%s: removing non-empty directory "
561 "'%s/%s', leaking at least '%s'\n", __func__,
562 de->parent->name, de->name, de->subdir->name);
565 EXPORT_SYMBOL(remove_proc_entry);
567 int remove_proc_subtree(const char *name, struct proc_dir_entry *parent)
569 struct proc_dir_entry **p;
570 struct proc_dir_entry *root = NULL, *de, *next;
571 const char *fn = name;
574 spin_lock(&proc_subdir_lock);
575 if (__xlate_proc_name(name, &parent, &fn) != 0) {
576 spin_unlock(&proc_subdir_lock);
581 for (p = &parent->subdir; *p; p=&(*p)->next ) {
582 if (proc_match(len, fn, *p)) {
590 spin_unlock(&proc_subdir_lock);
597 de->subdir = next->next;
602 spin_unlock(&proc_subdir_lock);
604 proc_entry_rundown(de);
606 if (S_ISDIR(de->mode))
613 spin_lock(&proc_subdir_lock);
619 EXPORT_SYMBOL(remove_proc_subtree);
621 void *proc_get_parent_data(const struct inode *inode)
623 struct proc_dir_entry *de = PDE(inode);
624 return de->parent->data;
626 EXPORT_SYMBOL_GPL(proc_get_parent_data);
628 void proc_remove(struct proc_dir_entry *de)
631 remove_proc_subtree(de->name, de->parent);
633 EXPORT_SYMBOL(proc_remove);
635 void *PDE_DATA(const struct inode *inode)
637 return __PDE_DATA(inode);
639 EXPORT_SYMBOL(PDE_DATA);