Linux 3.12.39
[linux/fpc-iii.git] / fs / proc / generic.c
blob9638eec2769154bfa15b0df5895f8b34f1322de5
1 /*
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.
6 *
7 * Copyright (C) 1991, 1992 Linus Torvalds.
8 * Copyright (C) 1997 Theodore Ts'o
9 */
11 #include <linux/errno.h>
12 #include <linux/time.h>
13 #include <linux/proc_fs.h>
14 #include <linux/stat.h>
15 #include <linux/mm.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/bitops.h>
23 #include <linux/spinlock.h>
24 #include <linux/completion.h>
25 #include <asm/uaccess.h>
27 #include "internal.h"
29 DEFINE_SPINLOCK(proc_subdir_lock);
31 static int proc_match(unsigned int len, const char *name, struct proc_dir_entry *de)
33 if (de->namelen != len)
34 return 0;
35 return !memcmp(name, de->name, len);
38 static int proc_notify_change(struct dentry *dentry, struct iattr *iattr)
40 struct inode *inode = dentry->d_inode;
41 struct proc_dir_entry *de = PDE(inode);
42 int error;
44 error = inode_change_ok(inode, iattr);
45 if (error)
46 return error;
48 setattr_copy(inode, iattr);
49 mark_inode_dirty(inode);
51 de->uid = inode->i_uid;
52 de->gid = inode->i_gid;
53 de->mode = inode->i_mode;
54 return 0;
57 static int proc_getattr(struct vfsmount *mnt, struct dentry *dentry,
58 struct kstat *stat)
60 struct inode *inode = dentry->d_inode;
61 struct proc_dir_entry *de = PROC_I(inode)->pde;
62 if (de && de->nlink)
63 set_nlink(inode, de->nlink);
65 generic_fillattr(inode, stat);
66 return 0;
69 static const struct inode_operations proc_file_inode_operations = {
70 .setattr = proc_notify_change,
74 * This function parses a name such as "tty/driver/serial", and
75 * returns the struct proc_dir_entry for "/proc/tty/driver", and
76 * returns "serial" in residual.
78 static int __xlate_proc_name(const char *name, struct proc_dir_entry **ret,
79 const char **residual)
81 const char *cp = name, *next;
82 struct proc_dir_entry *de;
83 unsigned int len;
85 de = *ret;
86 if (!de)
87 de = &proc_root;
89 while (1) {
90 next = strchr(cp, '/');
91 if (!next)
92 break;
94 len = next - cp;
95 for (de = de->subdir; de ; de = de->next) {
96 if (proc_match(len, cp, de))
97 break;
99 if (!de) {
100 WARN(1, "name '%s'\n", name);
101 return -ENOENT;
103 cp += len + 1;
105 *residual = cp;
106 *ret = de;
107 return 0;
110 static int xlate_proc_name(const char *name, struct proc_dir_entry **ret,
111 const char **residual)
113 int rv;
115 spin_lock(&proc_subdir_lock);
116 rv = __xlate_proc_name(name, ret, residual);
117 spin_unlock(&proc_subdir_lock);
118 return rv;
121 static DEFINE_IDA(proc_inum_ida);
122 static DEFINE_SPINLOCK(proc_inum_lock); /* protects the above */
124 #define PROC_DYNAMIC_FIRST 0xF0000000U
127 * Return an inode number between PROC_DYNAMIC_FIRST and
128 * 0xffffffff, or zero on failure.
130 int proc_alloc_inum(unsigned int *inum)
132 unsigned int i;
133 int error;
135 retry:
136 if (!ida_pre_get(&proc_inum_ida, GFP_KERNEL))
137 return -ENOMEM;
139 spin_lock_irq(&proc_inum_lock);
140 error = ida_get_new(&proc_inum_ida, &i);
141 spin_unlock_irq(&proc_inum_lock);
142 if (error == -EAGAIN)
143 goto retry;
144 else if (error)
145 return error;
147 if (i > UINT_MAX - PROC_DYNAMIC_FIRST) {
148 spin_lock_irq(&proc_inum_lock);
149 ida_remove(&proc_inum_ida, i);
150 spin_unlock_irq(&proc_inum_lock);
151 return -ENOSPC;
153 *inum = PROC_DYNAMIC_FIRST + i;
154 return 0;
157 void proc_free_inum(unsigned int inum)
159 unsigned long flags;
160 spin_lock_irqsave(&proc_inum_lock, flags);
161 ida_remove(&proc_inum_ida, inum - PROC_DYNAMIC_FIRST);
162 spin_unlock_irqrestore(&proc_inum_lock, flags);
166 * As some entries in /proc are volatile, we want to
167 * get rid of unused dentries. This could be made
168 * smarter: we could keep a "volatile" flag in the
169 * inode to indicate which ones to keep.
171 static int proc_delete_dentry(const struct dentry * dentry)
173 return 1;
176 static const struct dentry_operations proc_dentry_operations =
178 .d_delete = proc_delete_dentry,
182 * Don't create negative dentries here, return -ENOENT by hand
183 * instead.
185 struct dentry *proc_lookup_de(struct proc_dir_entry *de, struct inode *dir,
186 struct dentry *dentry)
188 struct inode *inode;
190 spin_lock(&proc_subdir_lock);
191 for (de = de->subdir; de ; de = de->next) {
192 if (de->namelen != dentry->d_name.len)
193 continue;
194 if (!memcmp(dentry->d_name.name, de->name, de->namelen)) {
195 pde_get(de);
196 spin_unlock(&proc_subdir_lock);
197 inode = proc_get_inode(dir->i_sb, de);
198 if (!inode)
199 return ERR_PTR(-ENOMEM);
200 d_set_d_op(dentry, &proc_dentry_operations);
201 d_add(dentry, inode);
202 return NULL;
205 spin_unlock(&proc_subdir_lock);
206 return ERR_PTR(-ENOENT);
209 struct dentry *proc_lookup(struct inode *dir, struct dentry *dentry,
210 unsigned int flags)
212 return proc_lookup_de(PDE(dir), dir, dentry);
216 * This returns non-zero if at EOF, so that the /proc
217 * root directory can use this and check if it should
218 * continue with the <pid> entries..
220 * Note that the VFS-layer doesn't care about the return
221 * value of the readdir() call, as long as it's non-negative
222 * for success..
224 int proc_readdir_de(struct proc_dir_entry *de, struct file *file,
225 struct dir_context *ctx)
227 int i;
229 if (!dir_emit_dots(file, ctx))
230 return 0;
232 spin_lock(&proc_subdir_lock);
233 de = de->subdir;
234 i = ctx->pos - 2;
235 for (;;) {
236 if (!de) {
237 spin_unlock(&proc_subdir_lock);
238 return 0;
240 if (!i)
241 break;
242 de = de->next;
243 i--;
246 do {
247 struct proc_dir_entry *next;
248 pde_get(de);
249 spin_unlock(&proc_subdir_lock);
250 if (!dir_emit(ctx, de->name, de->namelen,
251 de->low_ino, de->mode >> 12)) {
252 pde_put(de);
253 return 0;
255 spin_lock(&proc_subdir_lock);
256 ctx->pos++;
257 next = de->next;
258 pde_put(de);
259 de = next;
260 } while (de);
261 spin_unlock(&proc_subdir_lock);
262 return 1;
265 int proc_readdir(struct file *file, struct dir_context *ctx)
267 struct inode *inode = file_inode(file);
269 return proc_readdir_de(PDE(inode), file, ctx);
273 * These are the generic /proc directory operations. They
274 * use the in-memory "struct proc_dir_entry" tree to parse
275 * the /proc directory.
277 static const struct file_operations proc_dir_operations = {
278 .llseek = generic_file_llseek,
279 .read = generic_read_dir,
280 .iterate = proc_readdir,
284 * proc directories can do almost nothing..
286 static const struct inode_operations proc_dir_inode_operations = {
287 .lookup = proc_lookup,
288 .getattr = proc_getattr,
289 .setattr = proc_notify_change,
292 static int proc_register(struct proc_dir_entry * dir, struct proc_dir_entry * dp)
294 struct proc_dir_entry *tmp;
295 int ret;
297 ret = proc_alloc_inum(&dp->low_ino);
298 if (ret)
299 return ret;
301 if (S_ISDIR(dp->mode)) {
302 dp->proc_fops = &proc_dir_operations;
303 dp->proc_iops = &proc_dir_inode_operations;
304 dir->nlink++;
305 } else if (S_ISLNK(dp->mode)) {
306 dp->proc_iops = &proc_link_inode_operations;
307 } else if (S_ISREG(dp->mode)) {
308 BUG_ON(dp->proc_fops == NULL);
309 dp->proc_iops = &proc_file_inode_operations;
310 } else {
311 WARN_ON(1);
312 return -EINVAL;
315 spin_lock(&proc_subdir_lock);
317 for (tmp = dir->subdir; tmp; tmp = tmp->next)
318 if (strcmp(tmp->name, dp->name) == 0) {
319 WARN(1, "proc_dir_entry '%s/%s' already registered\n",
320 dir->name, dp->name);
321 break;
324 dp->next = dir->subdir;
325 dp->parent = dir;
326 dir->subdir = dp;
327 spin_unlock(&proc_subdir_lock);
329 return 0;
332 static struct proc_dir_entry *__proc_create(struct proc_dir_entry **parent,
333 const char *name,
334 umode_t mode,
335 nlink_t nlink)
337 struct proc_dir_entry *ent = NULL;
338 const char *fn = name;
339 unsigned int len;
341 /* make sure name is valid */
342 if (!name || !strlen(name))
343 goto out;
345 if (xlate_proc_name(name, parent, &fn) != 0)
346 goto out;
348 /* At this point there must not be any '/' characters beyond *fn */
349 if (strchr(fn, '/'))
350 goto out;
352 len = strlen(fn);
354 ent = kzalloc(sizeof(struct proc_dir_entry) + len + 1, GFP_KERNEL);
355 if (!ent)
356 goto out;
358 memcpy(ent->name, fn, len + 1);
359 ent->namelen = len;
360 ent->mode = mode;
361 ent->nlink = nlink;
362 atomic_set(&ent->count, 1);
363 spin_lock_init(&ent->pde_unload_lock);
364 INIT_LIST_HEAD(&ent->pde_openers);
365 out:
366 return ent;
369 struct proc_dir_entry *proc_symlink(const char *name,
370 struct proc_dir_entry *parent, const char *dest)
372 struct proc_dir_entry *ent;
374 ent = __proc_create(&parent, name,
375 (S_IFLNK | S_IRUGO | S_IWUGO | S_IXUGO),1);
377 if (ent) {
378 ent->data = kmalloc((ent->size=strlen(dest))+1, GFP_KERNEL);
379 if (ent->data) {
380 strcpy((char*)ent->data,dest);
381 if (proc_register(parent, ent) < 0) {
382 kfree(ent->data);
383 kfree(ent);
384 ent = NULL;
386 } else {
387 kfree(ent);
388 ent = NULL;
391 return ent;
393 EXPORT_SYMBOL(proc_symlink);
395 struct proc_dir_entry *proc_mkdir_data(const char *name, umode_t mode,
396 struct proc_dir_entry *parent, void *data)
398 struct proc_dir_entry *ent;
400 if (mode == 0)
401 mode = S_IRUGO | S_IXUGO;
403 ent = __proc_create(&parent, name, S_IFDIR | mode, 2);
404 if (ent) {
405 ent->data = data;
406 if (proc_register(parent, ent) < 0) {
407 kfree(ent);
408 ent = NULL;
411 return ent;
413 EXPORT_SYMBOL_GPL(proc_mkdir_data);
415 struct proc_dir_entry *proc_mkdir_mode(const char *name, umode_t mode,
416 struct proc_dir_entry *parent)
418 return proc_mkdir_data(name, mode, parent, NULL);
420 EXPORT_SYMBOL(proc_mkdir_mode);
422 struct proc_dir_entry *proc_mkdir(const char *name,
423 struct proc_dir_entry *parent)
425 return proc_mkdir_data(name, 0, parent, NULL);
427 EXPORT_SYMBOL(proc_mkdir);
429 struct proc_dir_entry *proc_create_data(const char *name, umode_t mode,
430 struct proc_dir_entry *parent,
431 const struct file_operations *proc_fops,
432 void *data)
434 struct proc_dir_entry *pde;
435 if ((mode & S_IFMT) == 0)
436 mode |= S_IFREG;
438 if (!S_ISREG(mode)) {
439 WARN_ON(1); /* use proc_mkdir() */
440 return NULL;
443 if ((mode & S_IALLUGO) == 0)
444 mode |= S_IRUGO;
445 pde = __proc_create(&parent, name, mode, 1);
446 if (!pde)
447 goto out;
448 pde->proc_fops = proc_fops;
449 pde->data = data;
450 if (proc_register(parent, pde) < 0)
451 goto out_free;
452 return pde;
453 out_free:
454 kfree(pde);
455 out:
456 return NULL;
458 EXPORT_SYMBOL(proc_create_data);
460 void proc_set_size(struct proc_dir_entry *de, loff_t size)
462 de->size = size;
464 EXPORT_SYMBOL(proc_set_size);
466 void proc_set_user(struct proc_dir_entry *de, kuid_t uid, kgid_t gid)
468 de->uid = uid;
469 de->gid = gid;
471 EXPORT_SYMBOL(proc_set_user);
473 static void free_proc_entry(struct proc_dir_entry *de)
475 proc_free_inum(de->low_ino);
477 if (S_ISLNK(de->mode))
478 kfree(de->data);
479 kfree(de);
482 void pde_put(struct proc_dir_entry *pde)
484 if (atomic_dec_and_test(&pde->count))
485 free_proc_entry(pde);
489 * Remove a /proc entry and free it if it's not currently in use.
491 void remove_proc_entry(const char *name, struct proc_dir_entry *parent)
493 struct proc_dir_entry **p;
494 struct proc_dir_entry *de = NULL;
495 const char *fn = name;
496 unsigned int len;
498 spin_lock(&proc_subdir_lock);
499 if (__xlate_proc_name(name, &parent, &fn) != 0) {
500 spin_unlock(&proc_subdir_lock);
501 return;
503 len = strlen(fn);
505 for (p = &parent->subdir; *p; p=&(*p)->next ) {
506 if (proc_match(len, fn, *p)) {
507 de = *p;
508 *p = de->next;
509 de->next = NULL;
510 break;
513 spin_unlock(&proc_subdir_lock);
514 if (!de) {
515 WARN(1, "name '%s'\n", name);
516 return;
519 proc_entry_rundown(de);
521 if (S_ISDIR(de->mode))
522 parent->nlink--;
523 de->nlink = 0;
524 WARN(de->subdir, "%s: removing non-empty directory "
525 "'%s/%s', leaking at least '%s'\n", __func__,
526 de->parent->name, de->name, de->subdir->name);
527 pde_put(de);
529 EXPORT_SYMBOL(remove_proc_entry);
531 int remove_proc_subtree(const char *name, struct proc_dir_entry *parent)
533 struct proc_dir_entry **p;
534 struct proc_dir_entry *root = NULL, *de, *next;
535 const char *fn = name;
536 unsigned int len;
538 spin_lock(&proc_subdir_lock);
539 if (__xlate_proc_name(name, &parent, &fn) != 0) {
540 spin_unlock(&proc_subdir_lock);
541 return -ENOENT;
543 len = strlen(fn);
545 for (p = &parent->subdir; *p; p=&(*p)->next ) {
546 if (proc_match(len, fn, *p)) {
547 root = *p;
548 *p = root->next;
549 root->next = NULL;
550 break;
553 if (!root) {
554 spin_unlock(&proc_subdir_lock);
555 return -ENOENT;
557 de = root;
558 while (1) {
559 next = de->subdir;
560 if (next) {
561 de->subdir = next->next;
562 next->next = NULL;
563 de = next;
564 continue;
566 spin_unlock(&proc_subdir_lock);
568 proc_entry_rundown(de);
569 next = de->parent;
570 if (S_ISDIR(de->mode))
571 next->nlink--;
572 de->nlink = 0;
573 if (de == root)
574 break;
575 pde_put(de);
577 spin_lock(&proc_subdir_lock);
578 de = next;
580 pde_put(root);
581 return 0;
583 EXPORT_SYMBOL(remove_proc_subtree);
585 void *proc_get_parent_data(const struct inode *inode)
587 struct proc_dir_entry *de = PDE(inode);
588 return de->parent->data;
590 EXPORT_SYMBOL_GPL(proc_get_parent_data);
592 void proc_remove(struct proc_dir_entry *de)
594 if (de)
595 remove_proc_subtree(de->name, de->parent);
597 EXPORT_SYMBOL(proc_remove);
599 void *PDE_DATA(const struct inode *inode)
601 return __PDE_DATA(inode);
603 EXPORT_SYMBOL(PDE_DATA);