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