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>
15 #include <linux/module.h>
16 #include <linux/mount.h>
17 #include <linux/init.h>
18 #include <linux/idr.h>
19 #include <linux/namei.h>
20 #include <linux/bitops.h>
21 #include <linux/spinlock.h>
22 #include <linux/completion.h>
23 #include <asm/uaccess.h>
27 DEFINE_SPINLOCK(proc_subdir_lock);
29 static int proc_match(int len, const char *name, struct proc_dir_entry *de)
31 if (de->namelen != len)
33 return !memcmp(name, de->name, len);
36 /* buffer size is one page but our output routines use some slack for overruns */
37 #define PROC_BLOCK_SIZE (PAGE_SIZE - 1024)
40 __proc_file_read(struct file *file, char __user *buf, size_t nbytes,
43 struct inode * inode = file->f_path.dentry->d_inode;
49 struct proc_dir_entry * dp;
50 unsigned long long pos;
53 * Gaah, please just use "seq_file" instead. The legacy /proc
54 * interfaces cut loff_t down to off_t for reads, and ignore
55 * the offset entirely for writes..
58 if (pos > MAX_NON_LFS)
60 if (nbytes > MAX_NON_LFS - pos)
61 nbytes = MAX_NON_LFS - pos;
64 if (!(page = (char*) __get_free_page(GFP_TEMPORARY)))
67 while ((nbytes > 0) && !eof) {
68 count = min_t(size_t, PROC_BLOCK_SIZE, nbytes);
73 * How to be a proc read function
74 * ------------------------------
76 * int f(char *buffer, char **start, off_t offset,
77 * int count, int *peof, void *dat)
79 * Assume that the buffer is "count" bytes in size.
81 * If you know you have supplied all the data you
84 * You have three ways to return data:
85 * 0) Leave *start = NULL. (This is the default.)
86 * Put the data of the requested offset at that
87 * offset within the buffer. Return the number (n)
88 * of bytes there are from the beginning of the
89 * buffer up to the last byte of data. If the
90 * number of supplied bytes (= n - offset) is
91 * greater than zero and you didn't signal eof
92 * and the reader is prepared to take more data
93 * you will be called again with the requested
94 * offset advanced by the number of bytes
95 * absorbed. This interface is useful for files
96 * no larger than the buffer.
97 * 1) Set *start = an unsigned long value less than
98 * the buffer address but greater than zero.
99 * Put the data of the requested offset at the
100 * beginning of the buffer. Return the number of
101 * bytes of data placed there. If this number is
102 * greater than zero and you didn't signal eof
103 * and the reader is prepared to take more data
104 * you will be called again with the requested
105 * offset advanced by *start. This interface is
106 * useful when you have a large file consisting
107 * of a series of blocks which you want to count
108 * and return as wholes.
109 * (Hack by Paul.Russell@rustcorp.com.au)
110 * 2) Set *start = an address within the buffer.
111 * Put the data of the requested offset at *start.
112 * Return the number of bytes of data placed there.
113 * If this number is greater than zero and you
114 * didn't signal eof and the reader is prepared to
115 * take more data you will be called again with the
116 * requested offset advanced by the number of bytes
119 n = dp->read_proc(page, &start, *ppos,
120 count, &eof, dp->data);
124 if (n == 0) /* end of file */
126 if (n < 0) { /* error */
135 "proc_file_read: Apparent buffer overflow!\n");
143 start = page + *ppos;
144 } else if (start < page) {
147 "proc_file_read: Apparent buffer overflow!\n");
152 * Don't reduce n because doing so might
153 * cut off part of a data block.
156 "proc_file_read: Read count exceeded\n");
158 } else /* start >= page */ {
159 unsigned long startoff = (unsigned long)(start - page);
160 if (n > (PAGE_SIZE - startoff)) {
162 "proc_file_read: Apparent buffer overflow!\n");
163 n = PAGE_SIZE - startoff;
169 n -= copy_to_user(buf, start < page ? page : start, n);
176 *ppos += start < page ? (unsigned long)start : n;
181 free_page((unsigned long) page);
186 proc_file_read(struct file *file, char __user *buf, size_t nbytes,
189 struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
192 spin_lock(&pde->pde_unload_lock);
193 if (!pde->proc_fops) {
194 spin_unlock(&pde->pde_unload_lock);
198 spin_unlock(&pde->pde_unload_lock);
200 rv = __proc_file_read(file, buf, nbytes, ppos);
207 proc_file_write(struct file *file, const char __user *buffer,
208 size_t count, loff_t *ppos)
210 struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
213 if (pde->write_proc) {
214 spin_lock(&pde->pde_unload_lock);
215 if (!pde->proc_fops) {
216 spin_unlock(&pde->pde_unload_lock);
220 spin_unlock(&pde->pde_unload_lock);
222 /* FIXME: does this routine need ppos? probably... */
223 rv = pde->write_proc(file, buffer, count, pde->data);
231 proc_file_lseek(struct file *file, loff_t offset, int orig)
233 loff_t retval = -EINVAL;
236 offset += file->f_pos;
239 if (offset < 0 || offset > MAX_NON_LFS)
241 file->f_pos = retval = offset;
246 static const struct file_operations proc_file_operations = {
247 .llseek = proc_file_lseek,
248 .read = proc_file_read,
249 .write = proc_file_write,
252 static int proc_notify_change(struct dentry *dentry, struct iattr *iattr)
254 struct inode *inode = dentry->d_inode;
255 struct proc_dir_entry *de = PDE(inode);
258 error = inode_change_ok(inode, iattr);
262 error = inode_setattr(inode, iattr);
266 de->uid = inode->i_uid;
267 de->gid = inode->i_gid;
268 de->mode = inode->i_mode;
273 static int proc_getattr(struct vfsmount *mnt, struct dentry *dentry,
276 struct inode *inode = dentry->d_inode;
277 struct proc_dir_entry *de = PROC_I(inode)->pde;
279 inode->i_nlink = de->nlink;
281 generic_fillattr(inode, stat);
285 static const struct inode_operations proc_file_inode_operations = {
286 .setattr = proc_notify_change,
290 * This function parses a name such as "tty/driver/serial", and
291 * returns the struct proc_dir_entry for "/proc/tty/driver", and
292 * returns "serial" in residual.
294 static int xlate_proc_name(const char *name,
295 struct proc_dir_entry **ret, const char **residual)
297 const char *cp = name, *next;
298 struct proc_dir_entry *de;
306 spin_lock(&proc_subdir_lock);
308 next = strchr(cp, '/');
313 for (de = de->subdir; de ; de = de->next) {
314 if (proc_match(len, cp, de))
326 spin_unlock(&proc_subdir_lock);
330 static DEFINE_IDA(proc_inum_ida);
331 static DEFINE_SPINLOCK(proc_inum_lock); /* protects the above */
333 #define PROC_DYNAMIC_FIRST 0xF0000000U
336 * Return an inode number between PROC_DYNAMIC_FIRST and
337 * 0xffffffff, or zero on failure.
339 * Current inode allocations in the proc-fs (hex-numbers):
342 * 00000001-00000fff static entries (goners)
345 * 00001000-00001fff unused
346 * 0001xxxx-7fffxxxx pid-dir entries for pid 1-7fff
347 * 80000000-efffffff unused
348 * f0000000-ffffffff dynamic entries
351 * Once we split the thing into several virtual filesystems,
352 * we will get rid of magical ranges (and this comment, BTW).
354 static unsigned int get_inode_number(void)
360 if (ida_pre_get(&proc_inum_ida, GFP_KERNEL) == 0)
363 spin_lock(&proc_inum_lock);
364 error = ida_get_new(&proc_inum_ida, &i);
365 spin_unlock(&proc_inum_lock);
366 if (error == -EAGAIN)
371 if (i > UINT_MAX - PROC_DYNAMIC_FIRST) {
372 spin_lock(&proc_inum_lock);
373 ida_remove(&proc_inum_ida, i);
374 spin_unlock(&proc_inum_lock);
377 return PROC_DYNAMIC_FIRST + i;
380 static void release_inode_number(unsigned int inum)
382 spin_lock(&proc_inum_lock);
383 ida_remove(&proc_inum_ida, inum - PROC_DYNAMIC_FIRST);
384 spin_unlock(&proc_inum_lock);
387 static void *proc_follow_link(struct dentry *dentry, struct nameidata *nd)
389 nd_set_link(nd, PDE(dentry->d_inode)->data);
393 static const struct inode_operations proc_link_inode_operations = {
394 .readlink = generic_readlink,
395 .follow_link = proc_follow_link,
399 * As some entries in /proc are volatile, we want to
400 * get rid of unused dentries. This could be made
401 * smarter: we could keep a "volatile" flag in the
402 * inode to indicate which ones to keep.
404 static int proc_delete_dentry(struct dentry * dentry)
409 static const struct dentry_operations proc_dentry_operations =
411 .d_delete = proc_delete_dentry,
415 * Don't create negative dentries here, return -ENOENT by hand
418 struct dentry *proc_lookup_de(struct proc_dir_entry *de, struct inode *dir,
419 struct dentry *dentry)
421 struct inode *inode = NULL;
424 spin_lock(&proc_subdir_lock);
425 for (de = de->subdir; de ; de = de->next) {
426 if (de->namelen != dentry->d_name.len)
428 if (!memcmp(dentry->d_name.name, de->name, de->namelen)) {
433 spin_unlock(&proc_subdir_lock);
435 inode = proc_get_inode(dir->i_sb, ino, de);
439 spin_unlock(&proc_subdir_lock);
443 dentry->d_op = &proc_dentry_operations;
444 d_add(dentry, inode);
449 return ERR_PTR(error);
452 struct dentry *proc_lookup(struct inode *dir, struct dentry *dentry,
453 struct nameidata *nd)
455 return proc_lookup_de(PDE(dir), dir, dentry);
459 * This returns non-zero if at EOF, so that the /proc
460 * root directory can use this and check if it should
461 * continue with the <pid> entries..
463 * Note that the VFS-layer doesn't care about the return
464 * value of the readdir() call, as long as it's non-negative
467 int proc_readdir_de(struct proc_dir_entry *de, struct file *filp, void *dirent,
472 struct inode *inode = filp->f_path.dentry->d_inode;
479 if (filldir(dirent, ".", 1, i, ino, DT_DIR) < 0)
485 if (filldir(dirent, "..", 2, i,
486 parent_ino(filp->f_path.dentry),
493 spin_lock(&proc_subdir_lock);
499 spin_unlock(&proc_subdir_lock);
509 struct proc_dir_entry *next;
511 /* filldir passes info to user space */
513 spin_unlock(&proc_subdir_lock);
514 if (filldir(dirent, de->name, de->namelen, filp->f_pos,
515 de->low_ino, de->mode >> 12) < 0) {
519 spin_lock(&proc_subdir_lock);
525 spin_unlock(&proc_subdir_lock);
532 int proc_readdir(struct file *filp, void *dirent, filldir_t filldir)
534 struct inode *inode = filp->f_path.dentry->d_inode;
536 return proc_readdir_de(PDE(inode), filp, dirent, filldir);
540 * These are the generic /proc directory operations. They
541 * use the in-memory "struct proc_dir_entry" tree to parse
542 * the /proc directory.
544 static const struct file_operations proc_dir_operations = {
545 .llseek = generic_file_llseek,
546 .read = generic_read_dir,
547 .readdir = proc_readdir,
551 * proc directories can do almost nothing..
553 static const struct inode_operations proc_dir_inode_operations = {
554 .lookup = proc_lookup,
555 .getattr = proc_getattr,
556 .setattr = proc_notify_change,
559 static int proc_register(struct proc_dir_entry * dir, struct proc_dir_entry * dp)
562 struct proc_dir_entry *tmp;
564 i = get_inode_number();
569 if (S_ISDIR(dp->mode)) {
570 if (dp->proc_iops == NULL) {
571 dp->proc_fops = &proc_dir_operations;
572 dp->proc_iops = &proc_dir_inode_operations;
575 } else if (S_ISLNK(dp->mode)) {
576 if (dp->proc_iops == NULL)
577 dp->proc_iops = &proc_link_inode_operations;
578 } else if (S_ISREG(dp->mode)) {
579 if (dp->proc_fops == NULL)
580 dp->proc_fops = &proc_file_operations;
581 if (dp->proc_iops == NULL)
582 dp->proc_iops = &proc_file_inode_operations;
585 spin_lock(&proc_subdir_lock);
587 for (tmp = dir->subdir; tmp; tmp = tmp->next)
588 if (strcmp(tmp->name, dp->name) == 0) {
589 WARN(1, KERN_WARNING "proc_dir_entry '%s/%s' already registered\n",
590 dir->name, dp->name);
594 dp->next = dir->subdir;
597 spin_unlock(&proc_subdir_lock);
602 static struct proc_dir_entry *__proc_create(struct proc_dir_entry **parent,
607 struct proc_dir_entry *ent = NULL;
608 const char *fn = name;
611 /* make sure name is valid */
612 if (!name || !strlen(name)) goto out;
614 if (xlate_proc_name(name, parent, &fn) != 0)
617 /* At this point there must not be any '/' characters beyond *fn */
623 ent = kmalloc(sizeof(struct proc_dir_entry) + len + 1, GFP_KERNEL);
626 memset(ent, 0, sizeof(struct proc_dir_entry));
627 memcpy(((char *) ent) + sizeof(struct proc_dir_entry), fn, len + 1);
628 ent->name = ((char *) ent) + sizeof(*ent);
632 atomic_set(&ent->count, 1);
634 spin_lock_init(&ent->pde_unload_lock);
635 ent->pde_unload_completion = NULL;
636 INIT_LIST_HEAD(&ent->pde_openers);
641 struct proc_dir_entry *proc_symlink(const char *name,
642 struct proc_dir_entry *parent, const char *dest)
644 struct proc_dir_entry *ent;
646 ent = __proc_create(&parent, name,
647 (S_IFLNK | S_IRUGO | S_IWUGO | S_IXUGO),1);
650 ent->data = kmalloc((ent->size=strlen(dest))+1, GFP_KERNEL);
652 strcpy((char*)ent->data,dest);
653 if (proc_register(parent, ent) < 0) {
666 struct proc_dir_entry *proc_mkdir_mode(const char *name, mode_t mode,
667 struct proc_dir_entry *parent)
669 struct proc_dir_entry *ent;
671 ent = __proc_create(&parent, name, S_IFDIR | mode, 2);
673 if (proc_register(parent, ent) < 0) {
681 struct proc_dir_entry *proc_net_mkdir(struct net *net, const char *name,
682 struct proc_dir_entry *parent)
684 struct proc_dir_entry *ent;
686 ent = __proc_create(&parent, name, S_IFDIR | S_IRUGO | S_IXUGO, 2);
689 if (proc_register(parent, ent) < 0) {
696 EXPORT_SYMBOL_GPL(proc_net_mkdir);
698 struct proc_dir_entry *proc_mkdir(const char *name,
699 struct proc_dir_entry *parent)
701 return proc_mkdir_mode(name, S_IRUGO | S_IXUGO, parent);
704 struct proc_dir_entry *create_proc_entry(const char *name, mode_t mode,
705 struct proc_dir_entry *parent)
707 struct proc_dir_entry *ent;
711 if ((mode & S_IALLUGO) == 0)
712 mode |= S_IRUGO | S_IXUGO;
715 if ((mode & S_IFMT) == 0)
717 if ((mode & S_IALLUGO) == 0)
722 ent = __proc_create(&parent, name, mode, nlink);
724 if (proc_register(parent, ent) < 0) {
732 struct proc_dir_entry *proc_create_data(const char *name, mode_t mode,
733 struct proc_dir_entry *parent,
734 const struct file_operations *proc_fops,
737 struct proc_dir_entry *pde;
741 if ((mode & S_IALLUGO) == 0)
742 mode |= S_IRUGO | S_IXUGO;
745 if ((mode & S_IFMT) == 0)
747 if ((mode & S_IALLUGO) == 0)
752 pde = __proc_create(&parent, name, mode, nlink);
755 pde->proc_fops = proc_fops;
757 if (proc_register(parent, pde) < 0)
766 static void free_proc_entry(struct proc_dir_entry *de)
768 unsigned int ino = de->low_ino;
770 if (ino < PROC_DYNAMIC_FIRST)
773 release_inode_number(ino);
775 if (S_ISLNK(de->mode))
780 void pde_put(struct proc_dir_entry *pde)
782 if (atomic_dec_and_test(&pde->count))
783 free_proc_entry(pde);
787 * Remove a /proc entry and free it if it's not currently in use.
789 void remove_proc_entry(const char *name, struct proc_dir_entry *parent)
791 struct proc_dir_entry **p;
792 struct proc_dir_entry *de = NULL;
793 const char *fn = name;
796 if (xlate_proc_name(name, &parent, &fn) != 0)
800 spin_lock(&proc_subdir_lock);
801 for (p = &parent->subdir; *p; p=&(*p)->next ) {
802 if (proc_match(len, fn, *p)) {
809 spin_unlock(&proc_subdir_lock);
813 spin_lock(&de->pde_unload_lock);
815 * Stop accepting new callers into module. If you're
816 * dynamically allocating ->proc_fops, save a pointer somewhere.
818 de->proc_fops = NULL;
819 /* Wait until all existing callers into module are done. */
820 if (de->pde_users > 0) {
821 DECLARE_COMPLETION_ONSTACK(c);
823 if (!de->pde_unload_completion)
824 de->pde_unload_completion = &c;
826 spin_unlock(&de->pde_unload_lock);
828 wait_for_completion(de->pde_unload_completion);
830 goto continue_removing;
832 spin_unlock(&de->pde_unload_lock);
835 spin_lock(&de->pde_unload_lock);
836 while (!list_empty(&de->pde_openers)) {
837 struct pde_opener *pdeo;
839 pdeo = list_first_entry(&de->pde_openers, struct pde_opener, lh);
841 spin_unlock(&de->pde_unload_lock);
842 pdeo->release(pdeo->inode, pdeo->file);
844 spin_lock(&de->pde_unload_lock);
846 spin_unlock(&de->pde_unload_lock);
848 if (S_ISDIR(de->mode))
851 WARN(de->subdir, KERN_WARNING "%s: removing non-empty directory "
852 "'%s/%s', leaking at least '%s'\n", __func__,
853 de->parent->name, de->name, de->subdir->name);