Loading...
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
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>
16#include <linux/mm.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
29#include "internal.h"
30
31static DEFINE_RWLOCK(proc_subdir_lock);
32
33struct kmem_cache *proc_dir_entry_cache __ro_after_init;
34
35void pde_free(struct proc_dir_entry *pde)
36{
37 if (S_ISLNK(pde->mode))
38 kfree(pde->data);
39 if (pde->name != pde->inline_name)
40 kfree(pde->name);
41 kmem_cache_free(proc_dir_entry_cache, pde);
42}
43
44static int proc_match(const char *name, struct proc_dir_entry *de, unsigned int len)
45{
46 if (len < de->namelen)
47 return -1;
48 if (len > de->namelen)
49 return 1;
50
51 return memcmp(name, de->name, len);
52}
53
54static struct proc_dir_entry *pde_subdir_first(struct proc_dir_entry *dir)
55{
56 return rb_entry_safe(rb_first(&dir->subdir), struct proc_dir_entry,
57 subdir_node);
58}
59
60static struct proc_dir_entry *pde_subdir_next(struct proc_dir_entry *dir)
61{
62 return rb_entry_safe(rb_next(&dir->subdir_node), struct proc_dir_entry,
63 subdir_node);
64}
65
66static struct proc_dir_entry *pde_subdir_find(struct proc_dir_entry *dir,
67 const char *name,
68 unsigned int len)
69{
70 struct rb_node *node = dir->subdir.rb_node;
71
72 while (node) {
73 struct proc_dir_entry *de = rb_entry(node,
74 struct proc_dir_entry,
75 subdir_node);
76 int result = proc_match(name, de, len);
77
78 if (result < 0)
79 node = node->rb_left;
80 else if (result > 0)
81 node = node->rb_right;
82 else
83 return de;
84 }
85 return NULL;
86}
87
88static bool pde_subdir_insert(struct proc_dir_entry *dir,
89 struct proc_dir_entry *de)
90{
91 struct rb_root *root = &dir->subdir;
92 struct rb_node **new = &root->rb_node, *parent = NULL;
93
94 /* Figure out where to put new node */
95 while (*new) {
96 struct proc_dir_entry *this = rb_entry(*new,
97 struct proc_dir_entry,
98 subdir_node);
99 int result = proc_match(de->name, this, de->namelen);
100
101 parent = *new;
102 if (result < 0)
103 new = &(*new)->rb_left;
104 else if (result > 0)
105 new = &(*new)->rb_right;
106 else
107 return false;
108 }
109
110 /* Add new node and rebalance tree. */
111 rb_link_node(&de->subdir_node, parent, new);
112 rb_insert_color(&de->subdir_node, root);
113 return true;
114}
115
116static int proc_notify_change(struct dentry *dentry, struct iattr *iattr)
117{
118 struct inode *inode = d_inode(dentry);
119 struct proc_dir_entry *de = PDE(inode);
120 int error;
121
122 error = setattr_prepare(dentry, iattr);
123 if (error)
124 return error;
125
126 setattr_copy(inode, iattr);
127 mark_inode_dirty(inode);
128
129 proc_set_user(de, inode->i_uid, inode->i_gid);
130 de->mode = inode->i_mode;
131 return 0;
132}
133
134static int proc_getattr(const struct path *path, struct kstat *stat,
135 u32 request_mask, unsigned int query_flags)
136{
137 struct inode *inode = d_inode(path->dentry);
138 struct proc_dir_entry *de = PDE(inode);
139 if (de && de->nlink)
140 set_nlink(inode, de->nlink);
141
142 generic_fillattr(inode, stat);
143 return 0;
144}
145
146static const struct inode_operations proc_file_inode_operations = {
147 .setattr = proc_notify_change,
148};
149
150/*
151 * This function parses a name such as "tty/driver/serial", and
152 * returns the struct proc_dir_entry for "/proc/tty/driver", and
153 * returns "serial" in residual.
154 */
155static int __xlate_proc_name(const char *name, struct proc_dir_entry **ret,
156 const char **residual)
157{
158 const char *cp = name, *next;
159 struct proc_dir_entry *de;
160 unsigned int len;
161
162 de = *ret;
163 if (!de)
164 de = &proc_root;
165
166 while (1) {
167 next = strchr(cp, '/');
168 if (!next)
169 break;
170
171 len = next - cp;
172 de = pde_subdir_find(de, cp, len);
173 if (!de) {
174 WARN(1, "name '%s'\n", name);
175 return -ENOENT;
176 }
177 cp += len + 1;
178 }
179 *residual = cp;
180 *ret = de;
181 return 0;
182}
183
184static int xlate_proc_name(const char *name, struct proc_dir_entry **ret,
185 const char **residual)
186{
187 int rv;
188
189 read_lock(&proc_subdir_lock);
190 rv = __xlate_proc_name(name, ret, residual);
191 read_unlock(&proc_subdir_lock);
192 return rv;
193}
194
195static DEFINE_IDA(proc_inum_ida);
196
197#define PROC_DYNAMIC_FIRST 0xF0000000U
198
199/*
200 * Return an inode number between PROC_DYNAMIC_FIRST and
201 * 0xffffffff, or zero on failure.
202 */
203int proc_alloc_inum(unsigned int *inum)
204{
205 int i;
206
207 i = ida_simple_get(&proc_inum_ida, 0, UINT_MAX - PROC_DYNAMIC_FIRST + 1,
208 GFP_KERNEL);
209 if (i < 0)
210 return i;
211
212 *inum = PROC_DYNAMIC_FIRST + (unsigned int)i;
213 return 0;
214}
215
216void proc_free_inum(unsigned int inum)
217{
218 ida_simple_remove(&proc_inum_ida, inum - PROC_DYNAMIC_FIRST);
219}
220
221static int proc_misc_d_revalidate(struct dentry *dentry, unsigned int flags)
222{
223 if (flags & LOOKUP_RCU)
224 return -ECHILD;
225
226 if (atomic_read(&PDE(d_inode(dentry))->in_use) < 0)
227 return 0; /* revalidate */
228 return 1;
229}
230
231static int proc_misc_d_delete(const struct dentry *dentry)
232{
233 return atomic_read(&PDE(d_inode(dentry))->in_use) < 0;
234}
235
236static const struct dentry_operations proc_misc_dentry_ops = {
237 .d_revalidate = proc_misc_d_revalidate,
238 .d_delete = proc_misc_d_delete,
239};
240
241/*
242 * Don't create negative dentries here, return -ENOENT by hand
243 * instead.
244 */
245struct dentry *proc_lookup_de(struct inode *dir, struct dentry *dentry,
246 struct proc_dir_entry *de)
247{
248 struct inode *inode;
249
250 read_lock(&proc_subdir_lock);
251 de = pde_subdir_find(de, dentry->d_name.name, dentry->d_name.len);
252 if (de) {
253 pde_get(de);
254 read_unlock(&proc_subdir_lock);
255 inode = proc_get_inode(dir->i_sb, de);
256 if (!inode)
257 return ERR_PTR(-ENOMEM);
258 d_set_d_op(dentry, &proc_misc_dentry_ops);
259 d_add(dentry, inode);
260 return NULL;
261 }
262 read_unlock(&proc_subdir_lock);
263 return ERR_PTR(-ENOENT);
264}
265
266struct dentry *proc_lookup(struct inode *dir, struct dentry *dentry,
267 unsigned int flags)
268{
269 return proc_lookup_de(dir, dentry, PDE(dir));
270}
271
272/*
273 * This returns non-zero if at EOF, so that the /proc
274 * root directory can use this and check if it should
275 * continue with the <pid> entries..
276 *
277 * Note that the VFS-layer doesn't care about the return
278 * value of the readdir() call, as long as it's non-negative
279 * for success..
280 */
281int proc_readdir_de(struct file *file, struct dir_context *ctx,
282 struct proc_dir_entry *de)
283{
284 int i;
285
286 if (!dir_emit_dots(file, ctx))
287 return 0;
288
289 read_lock(&proc_subdir_lock);
290 de = pde_subdir_first(de);
291 i = ctx->pos - 2;
292 for (;;) {
293 if (!de) {
294 read_unlock(&proc_subdir_lock);
295 return 0;
296 }
297 if (!i)
298 break;
299 de = pde_subdir_next(de);
300 i--;
301 }
302
303 do {
304 struct proc_dir_entry *next;
305 pde_get(de);
306 read_unlock(&proc_subdir_lock);
307 if (!dir_emit(ctx, de->name, de->namelen,
308 de->low_ino, de->mode >> 12)) {
309 pde_put(de);
310 return 0;
311 }
312 read_lock(&proc_subdir_lock);
313 ctx->pos++;
314 next = pde_subdir_next(de);
315 pde_put(de);
316 de = next;
317 } while (de);
318 read_unlock(&proc_subdir_lock);
319 return 1;
320}
321
322int proc_readdir(struct file *file, struct dir_context *ctx)
323{
324 struct inode *inode = file_inode(file);
325
326 return proc_readdir_de(file, ctx, PDE(inode));
327}
328
329/*
330 * These are the generic /proc directory operations. They
331 * use the in-memory "struct proc_dir_entry" tree to parse
332 * the /proc directory.
333 */
334static const struct file_operations proc_dir_operations = {
335 .llseek = generic_file_llseek,
336 .read = generic_read_dir,
337 .iterate_shared = proc_readdir,
338};
339
340/*
341 * proc directories can do almost nothing..
342 */
343static const struct inode_operations proc_dir_inode_operations = {
344 .lookup = proc_lookup,
345 .getattr = proc_getattr,
346 .setattr = proc_notify_change,
347};
348
349static int proc_register(struct proc_dir_entry * dir, struct proc_dir_entry * dp)
350{
351 int ret;
352
353 ret = proc_alloc_inum(&dp->low_ino);
354 if (ret)
355 return ret;
356
357 write_lock(&proc_subdir_lock);
358 dp->parent = dir;
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);
363 proc_free_inum(dp->low_ino);
364 return -EEXIST;
365 }
366 write_unlock(&proc_subdir_lock);
367
368 return 0;
369}
370
371static struct proc_dir_entry *__proc_create(struct proc_dir_entry **parent,
372 const char *name,
373 umode_t mode,
374 nlink_t nlink)
375{
376 struct proc_dir_entry *ent = NULL;
377 const char *fn;
378 struct qstr qstr;
379
380 if (xlate_proc_name(name, parent, &fn) != 0)
381 goto out;
382 qstr.name = fn;
383 qstr.len = strlen(fn);
384 if (qstr.len == 0 || qstr.len >= 256) {
385 WARN(1, "name len %u\n", qstr.len);
386 return NULL;
387 }
388 if (qstr.len == 1 && fn[0] == '.') {
389 WARN(1, "name '.'\n");
390 return NULL;
391 }
392 if (qstr.len == 2 && fn[0] == '.' && fn[1] == '.') {
393 WARN(1, "name '..'\n");
394 return NULL;
395 }
396 if (*parent == &proc_root && name_to_int(&qstr) != ~0U) {
397 WARN(1, "create '/proc/%s' by hand\n", qstr.name);
398 return NULL;
399 }
400 if (is_empty_pde(*parent)) {
401 WARN(1, "attempt to add to permanently empty directory");
402 return NULL;
403 }
404
405 ent = kmem_cache_zalloc(proc_dir_entry_cache, GFP_KERNEL);
406 if (!ent)
407 goto out;
408
409 if (qstr.len + 1 <= sizeof(ent->inline_name)) {
410 ent->name = ent->inline_name;
411 } else {
412 ent->name = kmalloc(qstr.len + 1, GFP_KERNEL);
413 if (!ent->name) {
414 pde_free(ent);
415 return NULL;
416 }
417 }
418
419 memcpy(ent->name, fn, qstr.len + 1);
420 ent->namelen = qstr.len;
421 ent->mode = mode;
422 ent->nlink = nlink;
423 ent->subdir = RB_ROOT;
424 refcount_set(&ent->refcnt, 1);
425 spin_lock_init(&ent->pde_unload_lock);
426 INIT_LIST_HEAD(&ent->pde_openers);
427 proc_set_user(ent, (*parent)->uid, (*parent)->gid);
428
429out:
430 return ent;
431}
432
433struct proc_dir_entry *proc_symlink(const char *name,
434 struct proc_dir_entry *parent, const char *dest)
435{
436 struct proc_dir_entry *ent;
437
438 ent = __proc_create(&parent, name,
439 (S_IFLNK | S_IRUGO | S_IWUGO | S_IXUGO),1);
440
441 if (ent) {
442 ent->data = kmalloc((ent->size=strlen(dest))+1, GFP_KERNEL);
443 if (ent->data) {
444 strcpy((char*)ent->data,dest);
445 ent->proc_iops = &proc_link_inode_operations;
446 if (proc_register(parent, ent) < 0) {
447 pde_free(ent);
448 ent = NULL;
449 }
450 } else {
451 pde_free(ent);
452 ent = NULL;
453 }
454 }
455 return ent;
456}
457EXPORT_SYMBOL(proc_symlink);
458
459struct proc_dir_entry *proc_mkdir_data(const char *name, umode_t mode,
460 struct proc_dir_entry *parent, void *data)
461{
462 struct proc_dir_entry *ent;
463
464 if (mode == 0)
465 mode = S_IRUGO | S_IXUGO;
466
467 ent = __proc_create(&parent, name, S_IFDIR | mode, 2);
468 if (ent) {
469 ent->data = data;
470 ent->proc_fops = &proc_dir_operations;
471 ent->proc_iops = &proc_dir_inode_operations;
472 parent->nlink++;
473 if (proc_register(parent, ent) < 0) {
474 pde_free(ent);
475 parent->nlink--;
476 ent = NULL;
477 }
478 }
479 return ent;
480}
481EXPORT_SYMBOL_GPL(proc_mkdir_data);
482
483struct proc_dir_entry *proc_mkdir_mode(const char *name, umode_t mode,
484 struct proc_dir_entry *parent)
485{
486 return proc_mkdir_data(name, mode, parent, NULL);
487}
488EXPORT_SYMBOL(proc_mkdir_mode);
489
490struct proc_dir_entry *proc_mkdir(const char *name,
491 struct proc_dir_entry *parent)
492{
493 return proc_mkdir_data(name, 0, parent, NULL);
494}
495EXPORT_SYMBOL(proc_mkdir);
496
497struct proc_dir_entry *proc_create_mount_point(const char *name)
498{
499 umode_t mode = S_IFDIR | S_IRUGO | S_IXUGO;
500 struct proc_dir_entry *ent, *parent = NULL;
501
502 ent = __proc_create(&parent, name, mode, 2);
503 if (ent) {
504 ent->data = NULL;
505 ent->proc_fops = NULL;
506 ent->proc_iops = NULL;
507 parent->nlink++;
508 if (proc_register(parent, ent) < 0) {
509 pde_free(ent);
510 parent->nlink--;
511 ent = NULL;
512 }
513 }
514 return ent;
515}
516EXPORT_SYMBOL(proc_create_mount_point);
517
518struct proc_dir_entry *proc_create_data(const char *name, umode_t mode,
519 struct proc_dir_entry *parent,
520 const struct file_operations *proc_fops,
521 void *data)
522{
523 struct proc_dir_entry *pde;
524 if ((mode & S_IFMT) == 0)
525 mode |= S_IFREG;
526
527 if (!S_ISREG(mode)) {
528 WARN_ON(1); /* use proc_mkdir() */
529 return NULL;
530 }
531
532 BUG_ON(proc_fops == NULL);
533
534 if ((mode & S_IALLUGO) == 0)
535 mode |= S_IRUGO;
536 pde = __proc_create(&parent, name, mode, 1);
537 if (!pde)
538 goto out;
539 pde->proc_fops = proc_fops;
540 pde->data = data;
541 pde->proc_iops = &proc_file_inode_operations;
542 if (proc_register(parent, pde) < 0)
543 goto out_free;
544 return pde;
545out_free:
546 pde_free(pde);
547out:
548 return NULL;
549}
550EXPORT_SYMBOL(proc_create_data);
551
552struct proc_dir_entry *proc_create(const char *name, umode_t mode,
553 struct proc_dir_entry *parent,
554 const struct file_operations *proc_fops)
555{
556 return proc_create_data(name, mode, parent, proc_fops, NULL);
557}
558EXPORT_SYMBOL(proc_create);
559
560void proc_set_size(struct proc_dir_entry *de, loff_t size)
561{
562 de->size = size;
563}
564EXPORT_SYMBOL(proc_set_size);
565
566void proc_set_user(struct proc_dir_entry *de, kuid_t uid, kgid_t gid)
567{
568 de->uid = uid;
569 de->gid = gid;
570}
571EXPORT_SYMBOL(proc_set_user);
572
573void pde_put(struct proc_dir_entry *pde)
574{
575 if (refcount_dec_and_test(&pde->refcnt)) {
576 proc_free_inum(pde->low_ino);
577 pde_free(pde);
578 }
579}
580
581/*
582 * Remove a /proc entry and free it if it's not currently in use.
583 */
584void remove_proc_entry(const char *name, struct proc_dir_entry *parent)
585{
586 struct proc_dir_entry *de = NULL;
587 const char *fn = name;
588 unsigned int len;
589
590 write_lock(&proc_subdir_lock);
591 if (__xlate_proc_name(name, &parent, &fn) != 0) {
592 write_unlock(&proc_subdir_lock);
593 return;
594 }
595 len = strlen(fn);
596
597 de = pde_subdir_find(parent, fn, len);
598 if (de)
599 rb_erase(&de->subdir_node, &parent->subdir);
600 write_unlock(&proc_subdir_lock);
601 if (!de) {
602 WARN(1, "name '%s'\n", name);
603 return;
604 }
605
606 proc_entry_rundown(de);
607
608 if (S_ISDIR(de->mode))
609 parent->nlink--;
610 de->nlink = 0;
611 WARN(pde_subdir_first(de),
612 "%s: removing non-empty directory '%s/%s', leaking at least '%s'\n",
613 __func__, de->parent->name, de->name, pde_subdir_first(de)->name);
614 pde_put(de);
615}
616EXPORT_SYMBOL(remove_proc_entry);
617
618int remove_proc_subtree(const char *name, struct proc_dir_entry *parent)
619{
620 struct proc_dir_entry *root = NULL, *de, *next;
621 const char *fn = name;
622 unsigned int len;
623
624 write_lock(&proc_subdir_lock);
625 if (__xlate_proc_name(name, &parent, &fn) != 0) {
626 write_unlock(&proc_subdir_lock);
627 return -ENOENT;
628 }
629 len = strlen(fn);
630
631 root = pde_subdir_find(parent, fn, len);
632 if (!root) {
633 write_unlock(&proc_subdir_lock);
634 return -ENOENT;
635 }
636 rb_erase(&root->subdir_node, &parent->subdir);
637
638 de = root;
639 while (1) {
640 next = pde_subdir_first(de);
641 if (next) {
642 rb_erase(&next->subdir_node, &de->subdir);
643 de = next;
644 continue;
645 }
646 write_unlock(&proc_subdir_lock);
647
648 proc_entry_rundown(de);
649 next = de->parent;
650 if (S_ISDIR(de->mode))
651 next->nlink--;
652 de->nlink = 0;
653 if (de == root)
654 break;
655 pde_put(de);
656
657 write_lock(&proc_subdir_lock);
658 de = next;
659 }
660 pde_put(root);
661 return 0;
662}
663EXPORT_SYMBOL(remove_proc_subtree);
664
665void *proc_get_parent_data(const struct inode *inode)
666{
667 struct proc_dir_entry *de = PDE(inode);
668 return de->parent->data;
669}
670EXPORT_SYMBOL_GPL(proc_get_parent_data);
671
672void proc_remove(struct proc_dir_entry *de)
673{
674 if (de)
675 remove_proc_subtree(de->name, de->parent);
676}
677EXPORT_SYMBOL(proc_remove);
678
679void *PDE_DATA(const struct inode *inode)
680{
681 return __PDE_DATA(inode);
682}
683EXPORT_SYMBOL(PDE_DATA);
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * proc/fs/generic.c --- generic routines for the proc-fs
4 *
5 * This file contains generic proc-fs routines for handling
6 * directories and files.
7 *
8 * Copyright (C) 1991, 1992 Linus Torvalds.
9 * Copyright (C) 1997 Theodore Ts'o
10 */
11
12#include <linux/cache.h>
13#include <linux/errno.h>
14#include <linux/time.h>
15#include <linux/proc_fs.h>
16#include <linux/stat.h>
17#include <linux/mm.h>
18#include <linux/module.h>
19#include <linux/namei.h>
20#include <linux/slab.h>
21#include <linux/printk.h>
22#include <linux/mount.h>
23#include <linux/init.h>
24#include <linux/idr.h>
25#include <linux/bitops.h>
26#include <linux/spinlock.h>
27#include <linux/completion.h>
28#include <linux/uaccess.h>
29#include <linux/seq_file.h>
30
31#include "internal.h"
32
33static DEFINE_RWLOCK(proc_subdir_lock);
34
35struct kmem_cache *proc_dir_entry_cache __ro_after_init;
36
37void pde_free(struct proc_dir_entry *pde)
38{
39 if (S_ISLNK(pde->mode))
40 kfree(pde->data);
41 if (pde->name != pde->inline_name)
42 kfree(pde->name);
43 kmem_cache_free(proc_dir_entry_cache, pde);
44}
45
46static int proc_match(const char *name, struct proc_dir_entry *de, unsigned int len)
47{
48 if (len < de->namelen)
49 return -1;
50 if (len > de->namelen)
51 return 1;
52
53 return memcmp(name, de->name, len);
54}
55
56static struct proc_dir_entry *pde_subdir_first(struct proc_dir_entry *dir)
57{
58 return rb_entry_safe(rb_first(&dir->subdir), struct proc_dir_entry,
59 subdir_node);
60}
61
62static struct proc_dir_entry *pde_subdir_next(struct proc_dir_entry *dir)
63{
64 return rb_entry_safe(rb_next(&dir->subdir_node), struct proc_dir_entry,
65 subdir_node);
66}
67
68static struct proc_dir_entry *pde_subdir_find(struct proc_dir_entry *dir,
69 const char *name,
70 unsigned int len)
71{
72 struct rb_node *node = dir->subdir.rb_node;
73
74 while (node) {
75 struct proc_dir_entry *de = rb_entry(node,
76 struct proc_dir_entry,
77 subdir_node);
78 int result = proc_match(name, de, len);
79
80 if (result < 0)
81 node = node->rb_left;
82 else if (result > 0)
83 node = node->rb_right;
84 else
85 return de;
86 }
87 return NULL;
88}
89
90static bool pde_subdir_insert(struct proc_dir_entry *dir,
91 struct proc_dir_entry *de)
92{
93 struct rb_root *root = &dir->subdir;
94 struct rb_node **new = &root->rb_node, *parent = NULL;
95
96 /* Figure out where to put new node */
97 while (*new) {
98 struct proc_dir_entry *this = rb_entry(*new,
99 struct proc_dir_entry,
100 subdir_node);
101 int result = proc_match(de->name, this, de->namelen);
102
103 parent = *new;
104 if (result < 0)
105 new = &(*new)->rb_left;
106 else if (result > 0)
107 new = &(*new)->rb_right;
108 else
109 return false;
110 }
111
112 /* Add new node and rebalance tree. */
113 rb_link_node(&de->subdir_node, parent, new);
114 rb_insert_color(&de->subdir_node, root);
115 return true;
116}
117
118static int proc_notify_change(struct user_namespace *mnt_userns,
119 struct dentry *dentry, struct iattr *iattr)
120{
121 struct inode *inode = d_inode(dentry);
122 struct proc_dir_entry *de = PDE(inode);
123 int error;
124
125 error = setattr_prepare(&init_user_ns, dentry, iattr);
126 if (error)
127 return error;
128
129 setattr_copy(&init_user_ns, inode, iattr);
130 mark_inode_dirty(inode);
131
132 proc_set_user(de, inode->i_uid, inode->i_gid);
133 de->mode = inode->i_mode;
134 return 0;
135}
136
137static int proc_getattr(struct user_namespace *mnt_userns,
138 const struct path *path, struct kstat *stat,
139 u32 request_mask, unsigned int query_flags)
140{
141 struct inode *inode = d_inode(path->dentry);
142 struct proc_dir_entry *de = PDE(inode);
143 if (de) {
144 nlink_t nlink = READ_ONCE(de->nlink);
145 if (nlink > 0) {
146 set_nlink(inode, nlink);
147 }
148 }
149
150 generic_fillattr(&init_user_ns, inode, stat);
151 return 0;
152}
153
154static const struct inode_operations proc_file_inode_operations = {
155 .setattr = proc_notify_change,
156};
157
158/*
159 * This function parses a name such as "tty/driver/serial", and
160 * returns the struct proc_dir_entry for "/proc/tty/driver", and
161 * returns "serial" in residual.
162 */
163static int __xlate_proc_name(const char *name, struct proc_dir_entry **ret,
164 const char **residual)
165{
166 const char *cp = name, *next;
167 struct proc_dir_entry *de;
168
169 de = *ret ?: &proc_root;
170 while ((next = strchr(cp, '/')) != NULL) {
171 de = pde_subdir_find(de, cp, next - cp);
172 if (!de) {
173 WARN(1, "name '%s'\n", name);
174 return -ENOENT;
175 }
176 cp = next + 1;
177 }
178 *residual = cp;
179 *ret = de;
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
188 read_lock(&proc_subdir_lock);
189 rv = __xlate_proc_name(name, ret, residual);
190 read_unlock(&proc_subdir_lock);
191 return rv;
192}
193
194static DEFINE_IDA(proc_inum_ida);
195
196#define PROC_DYNAMIC_FIRST 0xF0000000U
197
198/*
199 * Return an inode number between PROC_DYNAMIC_FIRST and
200 * 0xffffffff, or zero on failure.
201 */
202int proc_alloc_inum(unsigned int *inum)
203{
204 int i;
205
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;
210
211 *inum = PROC_DYNAMIC_FIRST + (unsigned int)i;
212 return 0;
213}
214
215void proc_free_inum(unsigned int inum)
216{
217 ida_simple_remove(&proc_inum_ida, inum - PROC_DYNAMIC_FIRST);
218}
219
220static int proc_misc_d_revalidate(struct dentry *dentry, unsigned int flags)
221{
222 if (flags & LOOKUP_RCU)
223 return -ECHILD;
224
225 if (atomic_read(&PDE(d_inode(dentry))->in_use) < 0)
226 return 0; /* revalidate */
227 return 1;
228}
229
230static int proc_misc_d_delete(const struct dentry *dentry)
231{
232 return atomic_read(&PDE(d_inode(dentry))->in_use) < 0;
233}
234
235static const struct dentry_operations proc_misc_dentry_ops = {
236 .d_revalidate = proc_misc_d_revalidate,
237 .d_delete = proc_misc_d_delete,
238};
239
240/*
241 * Don't create negative dentries here, return -ENOENT by hand
242 * instead.
243 */
244struct dentry *proc_lookup_de(struct inode *dir, struct dentry *dentry,
245 struct proc_dir_entry *de)
246{
247 struct inode *inode;
248
249 read_lock(&proc_subdir_lock);
250 de = pde_subdir_find(de, dentry->d_name.name, dentry->d_name.len);
251 if (de) {
252 pde_get(de);
253 read_unlock(&proc_subdir_lock);
254 inode = proc_get_inode(dir->i_sb, de);
255 if (!inode)
256 return ERR_PTR(-ENOMEM);
257 d_set_d_op(dentry, de->proc_dops);
258 return d_splice_alias(inode, dentry);
259 }
260 read_unlock(&proc_subdir_lock);
261 return ERR_PTR(-ENOENT);
262}
263
264struct dentry *proc_lookup(struct inode *dir, struct dentry *dentry,
265 unsigned int flags)
266{
267 struct proc_fs_info *fs_info = proc_sb_info(dir->i_sb);
268
269 if (fs_info->pidonly == PROC_PIDONLY_ON)
270 return ERR_PTR(-ENOENT);
271
272 return proc_lookup_de(dir, dentry, PDE(dir));
273}
274
275/*
276 * This returns non-zero if at EOF, so that the /proc
277 * root directory can use this and check if it should
278 * continue with the <pid> entries..
279 *
280 * Note that the VFS-layer doesn't care about the return
281 * value of the readdir() call, as long as it's non-negative
282 * for success..
283 */
284int proc_readdir_de(struct file *file, struct dir_context *ctx,
285 struct proc_dir_entry *de)
286{
287 int i;
288
289 if (!dir_emit_dots(file, ctx))
290 return 0;
291
292 i = ctx->pos - 2;
293 read_lock(&proc_subdir_lock);
294 de = pde_subdir_first(de);
295 for (;;) {
296 if (!de) {
297 read_unlock(&proc_subdir_lock);
298 return 0;
299 }
300 if (!i)
301 break;
302 de = pde_subdir_next(de);
303 i--;
304 }
305
306 do {
307 struct proc_dir_entry *next;
308 pde_get(de);
309 read_unlock(&proc_subdir_lock);
310 if (!dir_emit(ctx, de->name, de->namelen,
311 de->low_ino, de->mode >> 12)) {
312 pde_put(de);
313 return 0;
314 }
315 ctx->pos++;
316 read_lock(&proc_subdir_lock);
317 next = pde_subdir_next(de);
318 pde_put(de);
319 de = next;
320 } while (de);
321 read_unlock(&proc_subdir_lock);
322 return 1;
323}
324
325int proc_readdir(struct file *file, struct dir_context *ctx)
326{
327 struct inode *inode = file_inode(file);
328 struct proc_fs_info *fs_info = proc_sb_info(inode->i_sb);
329
330 if (fs_info->pidonly == PROC_PIDONLY_ON)
331 return 1;
332
333 return proc_readdir_de(file, ctx, PDE(inode));
334}
335
336/*
337 * These are the generic /proc directory operations. They
338 * use the in-memory "struct proc_dir_entry" tree to parse
339 * the /proc directory.
340 */
341static const struct file_operations proc_dir_operations = {
342 .llseek = generic_file_llseek,
343 .read = generic_read_dir,
344 .iterate_shared = proc_readdir,
345};
346
347static int proc_net_d_revalidate(struct dentry *dentry, unsigned int flags)
348{
349 return 0;
350}
351
352const struct dentry_operations proc_net_dentry_ops = {
353 .d_revalidate = proc_net_d_revalidate,
354 .d_delete = always_delete_dentry,
355};
356
357/*
358 * proc directories can do almost nothing..
359 */
360static const struct inode_operations proc_dir_inode_operations = {
361 .lookup = proc_lookup,
362 .getattr = proc_getattr,
363 .setattr = proc_notify_change,
364};
365
366/* returns the registered entry, or frees dp and returns NULL on failure */
367struct proc_dir_entry *proc_register(struct proc_dir_entry *dir,
368 struct proc_dir_entry *dp)
369{
370 if (proc_alloc_inum(&dp->low_ino))
371 goto out_free_entry;
372
373 write_lock(&proc_subdir_lock);
374 dp->parent = dir;
375 if (pde_subdir_insert(dir, dp) == false) {
376 WARN(1, "proc_dir_entry '%s/%s' already registered\n",
377 dir->name, dp->name);
378 write_unlock(&proc_subdir_lock);
379 goto out_free_inum;
380 }
381 dir->nlink++;
382 write_unlock(&proc_subdir_lock);
383
384 return dp;
385out_free_inum:
386 proc_free_inum(dp->low_ino);
387out_free_entry:
388 pde_free(dp);
389 return NULL;
390}
391
392static struct proc_dir_entry *__proc_create(struct proc_dir_entry **parent,
393 const char *name,
394 umode_t mode,
395 nlink_t nlink)
396{
397 struct proc_dir_entry *ent = NULL;
398 const char *fn;
399 struct qstr qstr;
400
401 if (xlate_proc_name(name, parent, &fn) != 0)
402 goto out;
403 qstr.name = fn;
404 qstr.len = strlen(fn);
405 if (qstr.len == 0 || qstr.len >= 256) {
406 WARN(1, "name len %u\n", qstr.len);
407 return NULL;
408 }
409 if (qstr.len == 1 && fn[0] == '.') {
410 WARN(1, "name '.'\n");
411 return NULL;
412 }
413 if (qstr.len == 2 && fn[0] == '.' && fn[1] == '.') {
414 WARN(1, "name '..'\n");
415 return NULL;
416 }
417 if (*parent == &proc_root && name_to_int(&qstr) != ~0U) {
418 WARN(1, "create '/proc/%s' by hand\n", qstr.name);
419 return NULL;
420 }
421 if (is_empty_pde(*parent)) {
422 WARN(1, "attempt to add to permanently empty directory");
423 return NULL;
424 }
425
426 ent = kmem_cache_zalloc(proc_dir_entry_cache, GFP_KERNEL);
427 if (!ent)
428 goto out;
429
430 if (qstr.len + 1 <= SIZEOF_PDE_INLINE_NAME) {
431 ent->name = ent->inline_name;
432 } else {
433 ent->name = kmalloc(qstr.len + 1, GFP_KERNEL);
434 if (!ent->name) {
435 pde_free(ent);
436 return NULL;
437 }
438 }
439
440 memcpy(ent->name, fn, qstr.len + 1);
441 ent->namelen = qstr.len;
442 ent->mode = mode;
443 ent->nlink = nlink;
444 ent->subdir = RB_ROOT;
445 refcount_set(&ent->refcnt, 1);
446 spin_lock_init(&ent->pde_unload_lock);
447 INIT_LIST_HEAD(&ent->pde_openers);
448 proc_set_user(ent, (*parent)->uid, (*parent)->gid);
449
450 ent->proc_dops = &proc_misc_dentry_ops;
451
452out:
453 return ent;
454}
455
456struct proc_dir_entry *proc_symlink(const char *name,
457 struct proc_dir_entry *parent, const char *dest)
458{
459 struct proc_dir_entry *ent;
460
461 ent = __proc_create(&parent, name,
462 (S_IFLNK | S_IRUGO | S_IWUGO | S_IXUGO),1);
463
464 if (ent) {
465 ent->data = kmalloc((ent->size=strlen(dest))+1, GFP_KERNEL);
466 if (ent->data) {
467 strcpy((char*)ent->data,dest);
468 ent->proc_iops = &proc_link_inode_operations;
469 ent = proc_register(parent, ent);
470 } else {
471 pde_free(ent);
472 ent = NULL;
473 }
474 }
475 return ent;
476}
477EXPORT_SYMBOL(proc_symlink);
478
479struct proc_dir_entry *_proc_mkdir(const char *name, umode_t mode,
480 struct proc_dir_entry *parent, void *data, bool force_lookup)
481{
482 struct proc_dir_entry *ent;
483
484 if (mode == 0)
485 mode = S_IRUGO | S_IXUGO;
486
487 ent = __proc_create(&parent, name, S_IFDIR | mode, 2);
488 if (ent) {
489 ent->data = data;
490 ent->proc_dir_ops = &proc_dir_operations;
491 ent->proc_iops = &proc_dir_inode_operations;
492 if (force_lookup) {
493 pde_force_lookup(ent);
494 }
495 ent = proc_register(parent, ent);
496 }
497 return ent;
498}
499EXPORT_SYMBOL_GPL(_proc_mkdir);
500
501struct proc_dir_entry *proc_mkdir_data(const char *name, umode_t mode,
502 struct proc_dir_entry *parent, void *data)
503{
504 return _proc_mkdir(name, mode, parent, data, false);
505}
506EXPORT_SYMBOL_GPL(proc_mkdir_data);
507
508struct proc_dir_entry *proc_mkdir_mode(const char *name, umode_t mode,
509 struct proc_dir_entry *parent)
510{
511 return proc_mkdir_data(name, mode, parent, NULL);
512}
513EXPORT_SYMBOL(proc_mkdir_mode);
514
515struct proc_dir_entry *proc_mkdir(const char *name,
516 struct proc_dir_entry *parent)
517{
518 return proc_mkdir_data(name, 0, parent, NULL);
519}
520EXPORT_SYMBOL(proc_mkdir);
521
522struct proc_dir_entry *proc_create_mount_point(const char *name)
523{
524 umode_t mode = S_IFDIR | S_IRUGO | S_IXUGO;
525 struct proc_dir_entry *ent, *parent = NULL;
526
527 ent = __proc_create(&parent, name, mode, 2);
528 if (ent) {
529 ent->data = NULL;
530 ent->proc_dir_ops = NULL;
531 ent->proc_iops = NULL;
532 ent = proc_register(parent, ent);
533 }
534 return ent;
535}
536EXPORT_SYMBOL(proc_create_mount_point);
537
538struct proc_dir_entry *proc_create_reg(const char *name, umode_t mode,
539 struct proc_dir_entry **parent, void *data)
540{
541 struct proc_dir_entry *p;
542
543 if ((mode & S_IFMT) == 0)
544 mode |= S_IFREG;
545 if ((mode & S_IALLUGO) == 0)
546 mode |= S_IRUGO;
547 if (WARN_ON_ONCE(!S_ISREG(mode)))
548 return NULL;
549
550 p = __proc_create(parent, name, mode, 1);
551 if (p) {
552 p->proc_iops = &proc_file_inode_operations;
553 p->data = data;
554 }
555 return p;
556}
557
558static inline void pde_set_flags(struct proc_dir_entry *pde)
559{
560 if (pde->proc_ops->proc_flags & PROC_ENTRY_PERMANENT)
561 pde->flags |= PROC_ENTRY_PERMANENT;
562}
563
564struct proc_dir_entry *proc_create_data(const char *name, umode_t mode,
565 struct proc_dir_entry *parent,
566 const struct proc_ops *proc_ops, void *data)
567{
568 struct proc_dir_entry *p;
569
570 p = proc_create_reg(name, mode, &parent, data);
571 if (!p)
572 return NULL;
573 p->proc_ops = proc_ops;
574 pde_set_flags(p);
575 return proc_register(parent, p);
576}
577EXPORT_SYMBOL(proc_create_data);
578
579struct proc_dir_entry *proc_create(const char *name, umode_t mode,
580 struct proc_dir_entry *parent,
581 const struct proc_ops *proc_ops)
582{
583 return proc_create_data(name, mode, parent, proc_ops, NULL);
584}
585EXPORT_SYMBOL(proc_create);
586
587static int proc_seq_open(struct inode *inode, struct file *file)
588{
589 struct proc_dir_entry *de = PDE(inode);
590
591 if (de->state_size)
592 return seq_open_private(file, de->seq_ops, de->state_size);
593 return seq_open(file, de->seq_ops);
594}
595
596static int proc_seq_release(struct inode *inode, struct file *file)
597{
598 struct proc_dir_entry *de = PDE(inode);
599
600 if (de->state_size)
601 return seq_release_private(inode, file);
602 return seq_release(inode, file);
603}
604
605static const struct proc_ops proc_seq_ops = {
606 /* not permanent -- can call into arbitrary seq_operations */
607 .proc_open = proc_seq_open,
608 .proc_read_iter = seq_read_iter,
609 .proc_lseek = seq_lseek,
610 .proc_release = proc_seq_release,
611};
612
613struct proc_dir_entry *proc_create_seq_private(const char *name, umode_t mode,
614 struct proc_dir_entry *parent, const struct seq_operations *ops,
615 unsigned int state_size, void *data)
616{
617 struct proc_dir_entry *p;
618
619 p = proc_create_reg(name, mode, &parent, data);
620 if (!p)
621 return NULL;
622 p->proc_ops = &proc_seq_ops;
623 p->seq_ops = ops;
624 p->state_size = state_size;
625 return proc_register(parent, p);
626}
627EXPORT_SYMBOL(proc_create_seq_private);
628
629static int proc_single_open(struct inode *inode, struct file *file)
630{
631 struct proc_dir_entry *de = PDE(inode);
632
633 return single_open(file, de->single_show, de->data);
634}
635
636static const struct proc_ops proc_single_ops = {
637 /* not permanent -- can call into arbitrary ->single_show */
638 .proc_open = proc_single_open,
639 .proc_read_iter = seq_read_iter,
640 .proc_lseek = seq_lseek,
641 .proc_release = single_release,
642};
643
644struct proc_dir_entry *proc_create_single_data(const char *name, umode_t mode,
645 struct proc_dir_entry *parent,
646 int (*show)(struct seq_file *, void *), void *data)
647{
648 struct proc_dir_entry *p;
649
650 p = proc_create_reg(name, mode, &parent, data);
651 if (!p)
652 return NULL;
653 p->proc_ops = &proc_single_ops;
654 p->single_show = show;
655 return proc_register(parent, p);
656}
657EXPORT_SYMBOL(proc_create_single_data);
658
659void proc_set_size(struct proc_dir_entry *de, loff_t size)
660{
661 de->size = size;
662}
663EXPORT_SYMBOL(proc_set_size);
664
665void proc_set_user(struct proc_dir_entry *de, kuid_t uid, kgid_t gid)
666{
667 de->uid = uid;
668 de->gid = gid;
669}
670EXPORT_SYMBOL(proc_set_user);
671
672void pde_put(struct proc_dir_entry *pde)
673{
674 if (refcount_dec_and_test(&pde->refcnt)) {
675 proc_free_inum(pde->low_ino);
676 pde_free(pde);
677 }
678}
679
680/*
681 * Remove a /proc entry and free it if it's not currently in use.
682 */
683void remove_proc_entry(const char *name, struct proc_dir_entry *parent)
684{
685 struct proc_dir_entry *de = NULL;
686 const char *fn = name;
687 unsigned int len;
688
689 write_lock(&proc_subdir_lock);
690 if (__xlate_proc_name(name, &parent, &fn) != 0) {
691 write_unlock(&proc_subdir_lock);
692 return;
693 }
694 len = strlen(fn);
695
696 de = pde_subdir_find(parent, fn, len);
697 if (de) {
698 if (unlikely(pde_is_permanent(de))) {
699 WARN(1, "removing permanent /proc entry '%s'", de->name);
700 de = NULL;
701 } else {
702 rb_erase(&de->subdir_node, &parent->subdir);
703 if (S_ISDIR(de->mode))
704 parent->nlink--;
705 }
706 }
707 write_unlock(&proc_subdir_lock);
708 if (!de) {
709 WARN(1, "name '%s'\n", name);
710 return;
711 }
712
713 proc_entry_rundown(de);
714
715 WARN(pde_subdir_first(de),
716 "%s: removing non-empty directory '%s/%s', leaking at least '%s'\n",
717 __func__, de->parent->name, de->name, pde_subdir_first(de)->name);
718 pde_put(de);
719}
720EXPORT_SYMBOL(remove_proc_entry);
721
722int remove_proc_subtree(const char *name, struct proc_dir_entry *parent)
723{
724 struct proc_dir_entry *root = NULL, *de, *next;
725 const char *fn = name;
726 unsigned int len;
727
728 write_lock(&proc_subdir_lock);
729 if (__xlate_proc_name(name, &parent, &fn) != 0) {
730 write_unlock(&proc_subdir_lock);
731 return -ENOENT;
732 }
733 len = strlen(fn);
734
735 root = pde_subdir_find(parent, fn, len);
736 if (!root) {
737 write_unlock(&proc_subdir_lock);
738 return -ENOENT;
739 }
740 if (unlikely(pde_is_permanent(root))) {
741 write_unlock(&proc_subdir_lock);
742 WARN(1, "removing permanent /proc entry '%s/%s'",
743 root->parent->name, root->name);
744 return -EINVAL;
745 }
746 rb_erase(&root->subdir_node, &parent->subdir);
747
748 de = root;
749 while (1) {
750 next = pde_subdir_first(de);
751 if (next) {
752 if (unlikely(pde_is_permanent(next))) {
753 write_unlock(&proc_subdir_lock);
754 WARN(1, "removing permanent /proc entry '%s/%s'",
755 next->parent->name, next->name);
756 return -EINVAL;
757 }
758 rb_erase(&next->subdir_node, &de->subdir);
759 de = next;
760 continue;
761 }
762 next = de->parent;
763 if (S_ISDIR(de->mode))
764 next->nlink--;
765 write_unlock(&proc_subdir_lock);
766
767 proc_entry_rundown(de);
768 if (de == root)
769 break;
770 pde_put(de);
771
772 write_lock(&proc_subdir_lock);
773 de = next;
774 }
775 pde_put(root);
776 return 0;
777}
778EXPORT_SYMBOL(remove_proc_subtree);
779
780void *proc_get_parent_data(const struct inode *inode)
781{
782 struct proc_dir_entry *de = PDE(inode);
783 return de->parent->data;
784}
785EXPORT_SYMBOL_GPL(proc_get_parent_data);
786
787void proc_remove(struct proc_dir_entry *de)
788{
789 if (de)
790 remove_proc_subtree(de->name, de->parent);
791}
792EXPORT_SYMBOL(proc_remove);
793
794void *PDE_DATA(const struct inode *inode)
795{
796 return __PDE_DATA(inode);
797}
798EXPORT_SYMBOL(PDE_DATA);
799
800/*
801 * Pull a user buffer into memory and pass it to the file's write handler if
802 * one is supplied. The ->write() method is permitted to modify the
803 * kernel-side buffer.
804 */
805ssize_t proc_simple_write(struct file *f, const char __user *ubuf, size_t size,
806 loff_t *_pos)
807{
808 struct proc_dir_entry *pde = PDE(file_inode(f));
809 char *buf;
810 int ret;
811
812 if (!pde->write)
813 return -EACCES;
814 if (size == 0 || size > PAGE_SIZE - 1)
815 return -EINVAL;
816 buf = memdup_user_nul(ubuf, size);
817 if (IS_ERR(buf))
818 return PTR_ERR(buf);
819 ret = pde->write(f, buf, size);
820 kfree(buf);
821 return ret == 0 ? size : ret;
822}