Linux Audio

Check our new training course

Loading...
v3.1
 
  1/*
  2 *  linux/fs/proc/inode.c
  3 *
  4 *  Copyright (C) 1991, 1992  Linus Torvalds
  5 */
  6
 
  7#include <linux/time.h>
  8#include <linux/proc_fs.h>
  9#include <linux/kernel.h>
 
 10#include <linux/mm.h>
 11#include <linux/string.h>
 12#include <linux/stat.h>
 13#include <linux/completion.h>
 14#include <linux/poll.h>
 
 15#include <linux/file.h>
 16#include <linux/limits.h>
 17#include <linux/init.h>
 18#include <linux/module.h>
 19#include <linux/sysctl.h>
 
 20#include <linux/slab.h>
 21
 22#include <asm/system.h>
 23#include <asm/uaccess.h>
 24
 25#include "internal.h"
 26
 27static void proc_evict_inode(struct inode *inode)
 28{
 29	struct proc_dir_entry *de;
 30	struct ctl_table_header *head;
 31	const struct proc_ns_operations *ns_ops;
 32
 33	truncate_inode_pages(&inode->i_data, 0);
 34	end_writeback(inode);
 35
 36	/* Stop tracking associated processes */
 37	put_pid(PROC_I(inode)->pid);
 
 38
 39	/* Let go of any associated proc directory entry */
 40	de = PROC_I(inode)->pde;
 41	if (de)
 42		pde_put(de);
 43	head = PROC_I(inode)->sysctl;
 44	if (head) {
 45		rcu_assign_pointer(PROC_I(inode)->sysctl, NULL);
 46		sysctl_head_put(head);
 47	}
 48	/* Release any associated namespace */
 49	ns_ops = PROC_I(inode)->ns_ops;
 50	if (ns_ops && ns_ops->put)
 51		ns_ops->put(PROC_I(inode)->ns);
 52}
 53
 54static struct kmem_cache * proc_inode_cachep;
 
 55
 56static struct inode *proc_alloc_inode(struct super_block *sb)
 57{
 58	struct proc_inode *ei;
 59	struct inode *inode;
 60
 61	ei = (struct proc_inode *)kmem_cache_alloc(proc_inode_cachep, GFP_KERNEL);
 62	if (!ei)
 63		return NULL;
 64	ei->pid = NULL;
 65	ei->fd = 0;
 66	ei->op.proc_get_link = NULL;
 67	ei->pde = NULL;
 68	ei->sysctl = NULL;
 69	ei->sysctl_entry = NULL;
 70	ei->ns = NULL;
 71	ei->ns_ops = NULL;
 72	inode = &ei->vfs_inode;
 73	inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
 74	return inode;
 75}
 76
 77static void proc_i_callback(struct rcu_head *head)
 78{
 79	struct inode *inode = container_of(head, struct inode, i_rcu);
 80	INIT_LIST_HEAD(&inode->i_dentry);
 81	kmem_cache_free(proc_inode_cachep, PROC_I(inode));
 82}
 83
 84static void proc_destroy_inode(struct inode *inode)
 85{
 86	call_rcu(&inode->i_rcu, proc_i_callback);
 
 
 
 87}
 88
 89static void init_once(void *foo)
 90{
 91	struct proc_inode *ei = (struct proc_inode *) foo;
 92
 93	inode_init_once(&ei->vfs_inode);
 94}
 95
 96void __init proc_init_inodecache(void)
 97{
 98	proc_inode_cachep = kmem_cache_create("proc_inode_cache",
 99					     sizeof(struct proc_inode),
100					     0, (SLAB_RECLAIM_ACCOUNT|
101						SLAB_MEM_SPREAD|SLAB_PANIC),
 
102					     init_once);
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
103}
104
105static const struct super_operations proc_sops = {
106	.alloc_inode	= proc_alloc_inode,
107	.destroy_inode	= proc_destroy_inode,
108	.drop_inode	= generic_delete_inode,
109	.evict_inode	= proc_evict_inode,
110	.statfs		= simple_statfs,
 
111};
112
113static void __pde_users_dec(struct proc_dir_entry *pde)
 
 
114{
115	pde->pde_users--;
116	if (pde->pde_unload_completion && pde->pde_users == 0)
117		complete(pde->pde_unload_completion);
118}
119
120void pde_users_dec(struct proc_dir_entry *pde)
121{
122	spin_lock(&pde->pde_unload_lock);
123	__pde_users_dec(pde);
124	spin_unlock(&pde->pde_unload_lock);
125}
126
127static loff_t proc_reg_llseek(struct file *file, loff_t offset, int whence)
 
 
 
 
 
 
 
 
 
 
128{
129	struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
130	loff_t rv = -EINVAL;
131	loff_t (*llseek)(struct file *, loff_t, int);
132
133	spin_lock(&pde->pde_unload_lock);
134	/*
135	 * remove_proc_entry() is going to delete PDE (as part of module
136	 * cleanup sequence). No new callers into module allowed.
 
 
 
137	 */
138	if (!pde->proc_fops) {
 
 
 
139		spin_unlock(&pde->pde_unload_lock);
140		return rv;
141	}
142	/*
143	 * Bump refcount so that remove_proc_entry will wail for ->llseek to
144	 * complete.
145	 */
146	pde->pde_users++;
147	/*
148	 * Save function pointer under lock, to protect against ->proc_fops
149	 * NULL'ifying right after ->pde_unload_lock is dropped.
150	 */
151	llseek = pde->proc_fops->llseek;
152	spin_unlock(&pde->pde_unload_lock);
153
154	if (!llseek)
155		llseek = default_llseek;
156	rv = llseek(file, offset, whence);
157
158	pde_users_dec(pde);
159	return rv;
 
 
 
 
 
 
 
 
 
 
160}
161
162static ssize_t proc_reg_read(struct file *file, char __user *buf, size_t count, loff_t *ppos)
163{
164	struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
165	ssize_t rv = -EIO;
166	ssize_t (*read)(struct file *, char __user *, size_t, loff_t *);
 
 
167
168	spin_lock(&pde->pde_unload_lock);
169	if (!pde->proc_fops) {
170		spin_unlock(&pde->pde_unload_lock);
171		return rv;
 
 
 
 
172	}
173	pde->pde_users++;
174	read = pde->proc_fops->read;
175	spin_unlock(&pde->pde_unload_lock);
176
177	if (read)
178		rv = read(file, buf, count, ppos);
 
 
179
180	pde_users_dec(pde);
 
 
 
 
 
181	return rv;
182}
183
184static ssize_t proc_reg_write(struct file *file, const char __user *buf, size_t count, loff_t *ppos)
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
185{
186	struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
187	ssize_t rv = -EIO;
188	ssize_t (*write)(struct file *, const char __user *, size_t, loff_t *);
189
190	spin_lock(&pde->pde_unload_lock);
191	if (!pde->proc_fops) {
192		spin_unlock(&pde->pde_unload_lock);
193		return rv;
 
194	}
195	pde->pde_users++;
196	write = pde->proc_fops->write;
197	spin_unlock(&pde->pde_unload_lock);
198
 
 
 
199	if (write)
200		rv = write(file, buf, count, ppos);
201
202	pde_users_dec(pde);
203	return rv;
204}
205
206static unsigned int proc_reg_poll(struct file *file, struct poll_table_struct *pts)
207{
208	struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
209	unsigned int rv = DEFAULT_POLLMASK;
210	unsigned int (*poll)(struct file *, struct poll_table_struct *);
211
212	spin_lock(&pde->pde_unload_lock);
213	if (!pde->proc_fops) {
214		spin_unlock(&pde->pde_unload_lock);
215		return rv;
 
216	}
217	pde->pde_users++;
218	poll = pde->proc_fops->poll;
219	spin_unlock(&pde->pde_unload_lock);
220
 
 
 
221	if (poll)
222		rv = poll(file, pts);
 
 
 
 
 
 
 
223
224	pde_users_dec(pde);
 
 
 
 
 
225	return rv;
226}
227
 
 
 
 
 
 
 
 
228static long proc_reg_unlocked_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
229{
230	struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
231	long rv = -ENOTTY;
232	long (*ioctl)(struct file *, unsigned int, unsigned long);
233
234	spin_lock(&pde->pde_unload_lock);
235	if (!pde->proc_fops) {
236		spin_unlock(&pde->pde_unload_lock);
237		return rv;
 
238	}
239	pde->pde_users++;
240	ioctl = pde->proc_fops->unlocked_ioctl;
241	spin_unlock(&pde->pde_unload_lock);
242
243	if (ioctl)
244		rv = ioctl(file, cmd, arg);
245
246	pde_users_dec(pde);
247	return rv;
248}
249
250#ifdef CONFIG_COMPAT
 
 
 
 
 
 
 
 
251static long proc_reg_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
252{
253	struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
254	long rv = -ENOTTY;
255	long (*compat_ioctl)(struct file *, unsigned int, unsigned long);
256
257	spin_lock(&pde->pde_unload_lock);
258	if (!pde->proc_fops) {
259		spin_unlock(&pde->pde_unload_lock);
260		return rv;
261	}
262	pde->pde_users++;
263	compat_ioctl = pde->proc_fops->compat_ioctl;
264	spin_unlock(&pde->pde_unload_lock);
265
266	if (compat_ioctl)
267		rv = compat_ioctl(file, cmd, arg);
268
269	pde_users_dec(pde);
270	return rv;
271}
272#endif
273
 
 
 
 
 
 
 
 
274static int proc_reg_mmap(struct file *file, struct vm_area_struct *vma)
275{
276	struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
277	int rv = -EIO;
278	int (*mmap)(struct file *, struct vm_area_struct *);
279
280	spin_lock(&pde->pde_unload_lock);
281	if (!pde->proc_fops) {
282		spin_unlock(&pde->pde_unload_lock);
283		return rv;
 
284	}
285	pde->pde_users++;
286	mmap = pde->proc_fops->mmap;
287	spin_unlock(&pde->pde_unload_lock);
288
289	if (mmap)
290		rv = mmap(file, vma);
 
 
 
 
 
 
 
 
 
291
292	pde_users_dec(pde);
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
293	return rv;
294}
295
296static int proc_reg_open(struct inode *inode, struct file *file)
297{
298	struct proc_dir_entry *pde = PDE(inode);
299	int rv = 0;
300	int (*open)(struct inode *, struct file *);
301	int (*release)(struct inode *, struct file *);
302	struct pde_opener *pdeo;
303
 
 
 
 
 
 
 
 
 
 
304	/*
305	 * What for, you ask? Well, we can have open, rmmod, remove_proc_entry
306	 * sequence. ->release won't be called because ->proc_fops will be
307	 * cleared. Depending on complexity of ->release, consequences vary.
 
 
 
 
308	 *
309	 * We can't wait for mercy when close will be done for real, it's
310	 * deadlockable: rmmod foo </proc/foo . So, we're going to do ->release
311	 * by hand in remove_proc_entry(). For this, save opener's credentials
312	 * for later.
313	 */
314	pdeo = kmalloc(sizeof(struct pde_opener), GFP_KERNEL);
315	if (!pdeo)
316		return -ENOMEM;
317
318	spin_lock(&pde->pde_unload_lock);
319	if (!pde->proc_fops) {
320		spin_unlock(&pde->pde_unload_lock);
321		kfree(pdeo);
322		return -ENOENT;
 
 
 
 
 
 
 
 
323	}
324	pde->pde_users++;
325	open = pde->proc_fops->open;
326	release = pde->proc_fops->release;
327	spin_unlock(&pde->pde_unload_lock);
328
 
329	if (open)
330		rv = open(inode, file);
331
332	spin_lock(&pde->pde_unload_lock);
333	if (rv == 0 && release) {
334		/* To know what to release. */
335		pdeo->inode = inode;
336		pdeo->file = file;
337		/* Strictly for "too late" ->release in proc_reg_release(). */
338		pdeo->release = release;
339		list_add(&pdeo->lh, &pde->pde_openers);
340	} else
341		kfree(pdeo);
342	__pde_users_dec(pde);
343	spin_unlock(&pde->pde_unload_lock);
344	return rv;
345}
346
347static struct pde_opener *find_pde_opener(struct proc_dir_entry *pde,
348					struct inode *inode, struct file *file)
349{
350	struct pde_opener *pdeo;
351
352	list_for_each_entry(pdeo, &pde->pde_openers, lh) {
353		if (pdeo->inode == inode && pdeo->file == file)
354			return pdeo;
355	}
356	return NULL;
 
 
 
357}
358
359static int proc_reg_release(struct inode *inode, struct file *file)
360{
361	struct proc_dir_entry *pde = PDE(inode);
362	int rv = 0;
363	int (*release)(struct inode *, struct file *);
364	struct pde_opener *pdeo;
365
366	spin_lock(&pde->pde_unload_lock);
367	pdeo = find_pde_opener(pde, inode, file);
368	if (!pde->proc_fops) {
369		/*
370		 * Can't simply exit, __fput() will think that everything is OK,
371		 * and move on to freeing struct file. remove_proc_entry() will
372		 * find slacker in opener's list and will try to do non-trivial
373		 * things with struct file. Therefore, remove opener from list.
374		 *
375		 * But if opener is removed from list, who will ->release it?
376		 */
377		if (pdeo) {
378			list_del(&pdeo->lh);
379			spin_unlock(&pde->pde_unload_lock);
380			rv = pdeo->release(inode, file);
381			kfree(pdeo);
382		} else
383			spin_unlock(&pde->pde_unload_lock);
384		return rv;
385	}
386	pde->pde_users++;
387	release = pde->proc_fops->release;
388	if (pdeo) {
389		list_del(&pdeo->lh);
390		kfree(pdeo);
 
 
391	}
392	spin_unlock(&pde->pde_unload_lock);
393
394	if (release)
395		rv = release(inode, file);
396
397	pde_users_dec(pde);
398	return rv;
399}
400
401static const struct file_operations proc_reg_file_ops = {
402	.llseek		= proc_reg_llseek,
403	.read		= proc_reg_read,
404	.write		= proc_reg_write,
405	.poll		= proc_reg_poll,
406	.unlocked_ioctl	= proc_reg_unlocked_ioctl,
407#ifdef CONFIG_COMPAT
408	.compat_ioctl	= proc_reg_compat_ioctl,
409#endif
410	.mmap		= proc_reg_mmap,
 
 
 
 
 
 
 
 
 
 
 
 
 
 
411	.open		= proc_reg_open,
412	.release	= proc_reg_release,
413};
414
415#ifdef CONFIG_COMPAT
416static const struct file_operations proc_reg_file_ops_no_compat = {
417	.llseek		= proc_reg_llseek,
418	.read		= proc_reg_read,
419	.write		= proc_reg_write,
420	.poll		= proc_reg_poll,
421	.unlocked_ioctl	= proc_reg_unlocked_ioctl,
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
422	.mmap		= proc_reg_mmap,
 
423	.open		= proc_reg_open,
424	.release	= proc_reg_release,
425};
426#endif
427
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
428struct inode *proc_get_inode(struct super_block *sb, struct proc_dir_entry *de)
429{
430	struct inode * inode;
431
432	inode = iget_locked(sb, de->low_ino);
433	if (!inode)
434		return NULL;
435	if (inode->i_state & I_NEW) {
436		inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
437		PROC_I(inode)->fd = 0;
438		PROC_I(inode)->pde = de;
439
440		if (de->mode) {
441			inode->i_mode = de->mode;
442			inode->i_uid = de->uid;
443			inode->i_gid = de->gid;
444		}
445		if (de->size)
446			inode->i_size = de->size;
447		if (de->nlink)
448			inode->i_nlink = de->nlink;
449		if (de->proc_iops)
450			inode->i_op = de->proc_iops;
451		if (de->proc_fops) {
452			if (S_ISREG(inode->i_mode)) {
 
 
 
 
 
 
 
 
 
453#ifdef CONFIG_COMPAT
454				if (!de->proc_fops->compat_ioctl)
455					inode->i_fop =
456						&proc_reg_file_ops_no_compat;
457				else
458#endif
459					inode->i_fop = &proc_reg_file_ops;
460			} else {
461				inode->i_fop = de->proc_fops;
462			}
463		}
464		unlock_new_inode(inode);
465	} else
466	       pde_put(de);
 
 
 
 
 
 
 
467	return inode;
468}			
469
470int proc_fill_super(struct super_block *s)
471{
472	struct inode * root_inode;
473
474	s->s_flags |= MS_NODIRATIME | MS_NOSUID | MS_NOEXEC;
475	s->s_blocksize = 1024;
476	s->s_blocksize_bits = 10;
477	s->s_magic = PROC_SUPER_MAGIC;
478	s->s_op = &proc_sops;
479	s->s_time_gran = 1;
480	
481	pde_get(&proc_root);
482	root_inode = proc_get_inode(s, &proc_root);
483	if (!root_inode)
484		goto out_no_root;
485	root_inode->i_uid = 0;
486	root_inode->i_gid = 0;
487	s->s_root = d_alloc_root(root_inode);
488	if (!s->s_root)
489		goto out_no_root;
490	return 0;
491
492out_no_root:
493	printk("proc_read_super: get root inode failed\n");
494	iput(root_inode);
495	pde_put(&proc_root);
496	return -ENOMEM;
497}
v6.13.7
  1// SPDX-License-Identifier: GPL-2.0
  2/*
  3 *  linux/fs/proc/inode.c
  4 *
  5 *  Copyright (C) 1991, 1992  Linus Torvalds
  6 */
  7
  8#include <linux/cache.h>
  9#include <linux/time.h>
 10#include <linux/proc_fs.h>
 11#include <linux/kernel.h>
 12#include <linux/pid_namespace.h>
 13#include <linux/mm.h>
 14#include <linux/string.h>
 15#include <linux/stat.h>
 16#include <linux/completion.h>
 17#include <linux/poll.h>
 18#include <linux/printk.h>
 19#include <linux/file.h>
 20#include <linux/limits.h>
 21#include <linux/init.h>
 22#include <linux/module.h>
 23#include <linux/sysctl.h>
 24#include <linux/seq_file.h>
 25#include <linux/slab.h>
 26#include <linux/mount.h>
 27#include <linux/bug.h>
 
 28
 29#include "internal.h"
 30
 31static void proc_evict_inode(struct inode *inode)
 32{
 
 33	struct ctl_table_header *head;
 34	struct proc_inode *ei = PROC_I(inode);
 35
 36	truncate_inode_pages_final(&inode->i_data);
 37	clear_inode(inode);
 38
 39	/* Stop tracking associated processes */
 40	if (ei->pid)
 41		proc_pid_evict_inode(ei);
 42
 43	head = ei->sysctl;
 
 
 
 
 44	if (head) {
 45		RCU_INIT_POINTER(ei->sysctl, NULL);
 46		proc_sys_evict_inode(inode, head);
 47	}
 
 
 
 
 48}
 49
 50static struct kmem_cache *proc_inode_cachep __ro_after_init;
 51static struct kmem_cache *pde_opener_cache __ro_after_init;
 52
 53static struct inode *proc_alloc_inode(struct super_block *sb)
 54{
 55	struct proc_inode *ei;
 
 56
 57	ei = alloc_inode_sb(sb, proc_inode_cachep, GFP_KERNEL);
 58	if (!ei)
 59		return NULL;
 60	ei->pid = NULL;
 61	ei->fd = 0;
 62	ei->op.proc_get_link = NULL;
 63	ei->pde = NULL;
 64	ei->sysctl = NULL;
 65	ei->sysctl_entry = NULL;
 66	INIT_HLIST_NODE(&ei->sibling_inodes);
 67	ei->ns_ops = NULL;
 68	return &ei->vfs_inode;
 
 
 69}
 70
 71static void proc_free_inode(struct inode *inode)
 72{
 73	struct proc_inode *ei = PROC_I(inode);
 
 
 
 74
 75	if (ei->pid)
 76		put_pid(ei->pid);
 77	/* Let go of any associated proc directory entry */
 78	if (ei->pde)
 79		pde_put(ei->pde);
 80	kmem_cache_free(proc_inode_cachep, PROC_I(inode));
 81}
 82
 83static void init_once(void *foo)
 84{
 85	struct proc_inode *ei = (struct proc_inode *) foo;
 86
 87	inode_init_once(&ei->vfs_inode);
 88}
 89
 90void __init proc_init_kmemcache(void)
 91{
 92	proc_inode_cachep = kmem_cache_create("proc_inode_cache",
 93					     sizeof(struct proc_inode),
 94					     0, (SLAB_RECLAIM_ACCOUNT|
 95						SLAB_ACCOUNT|
 96						SLAB_PANIC),
 97					     init_once);
 98	pde_opener_cache =
 99		kmem_cache_create("pde_opener", sizeof(struct pde_opener), 0,
100				  SLAB_ACCOUNT|SLAB_PANIC, NULL);
101	proc_dir_entry_cache = kmem_cache_create_usercopy(
102		"proc_dir_entry", SIZEOF_PDE, 0, SLAB_PANIC,
103		offsetof(struct proc_dir_entry, inline_name),
104		SIZEOF_PDE_INLINE_NAME, NULL);
105	BUILD_BUG_ON(sizeof(struct proc_dir_entry) >= SIZEOF_PDE);
106}
107
108void proc_invalidate_siblings_dcache(struct hlist_head *inodes, spinlock_t *lock)
109{
110	struct hlist_node *node;
111	struct super_block *old_sb = NULL;
112
113	rcu_read_lock();
114	while ((node = hlist_first_rcu(inodes))) {
115		struct proc_inode *ei = hlist_entry(node, struct proc_inode, sibling_inodes);
116		struct super_block *sb;
117		struct inode *inode;
118
119		spin_lock(lock);
120		hlist_del_init_rcu(&ei->sibling_inodes);
121		spin_unlock(lock);
122
123		inode = &ei->vfs_inode;
124		sb = inode->i_sb;
125		if ((sb != old_sb) && !atomic_inc_not_zero(&sb->s_active))
126			continue;
127		inode = igrab(inode);
128		rcu_read_unlock();
129		if (sb != old_sb) {
130			if (old_sb)
131				deactivate_super(old_sb);
132			old_sb = sb;
133		}
134		if (unlikely(!inode)) {
135			rcu_read_lock();
136			continue;
137		}
138
139		if (S_ISDIR(inode->i_mode)) {
140			struct dentry *dir = d_find_any_alias(inode);
141			if (dir) {
142				d_invalidate(dir);
143				dput(dir);
144			}
145		} else {
146			struct dentry *dentry;
147			while ((dentry = d_find_alias(inode))) {
148				d_invalidate(dentry);
149				dput(dentry);
150			}
151		}
152		iput(inode);
153
154		rcu_read_lock();
155	}
156	rcu_read_unlock();
157	if (old_sb)
158		deactivate_super(old_sb);
159}
160
161static inline const char *hidepid2str(enum proc_hidepid v)
162{
163	switch (v) {
164		case HIDEPID_OFF: return "off";
165		case HIDEPID_NO_ACCESS: return "noaccess";
166		case HIDEPID_INVISIBLE: return "invisible";
167		case HIDEPID_NOT_PTRACEABLE: return "ptraceable";
168	}
169	WARN_ONCE(1, "bad hide_pid value: %d\n", v);
170	return "unknown";
171}
172
173static int proc_show_options(struct seq_file *seq, struct dentry *root)
174{
175	struct proc_fs_info *fs_info = proc_sb_info(root->d_sb);
176
177	if (!gid_eq(fs_info->pid_gid, GLOBAL_ROOT_GID))
178		seq_printf(seq, ",gid=%u", from_kgid_munged(&init_user_ns, fs_info->pid_gid));
179	if (fs_info->hide_pid != HIDEPID_OFF)
180		seq_printf(seq, ",hidepid=%s", hidepid2str(fs_info->hide_pid));
181	if (fs_info->pidonly != PROC_PIDONLY_OFF)
182		seq_printf(seq, ",subset=pid");
183
184	return 0;
185}
186
187const struct super_operations proc_sops = {
188	.alloc_inode	= proc_alloc_inode,
189	.free_inode	= proc_free_inode,
190	.drop_inode	= generic_delete_inode,
191	.evict_inode	= proc_evict_inode,
192	.statfs		= simple_statfs,
193	.show_options	= proc_show_options,
194};
195
196enum {BIAS = -1U<<31};
197
198static inline int use_pde(struct proc_dir_entry *pde)
199{
200	return likely(atomic_inc_unless_negative(&pde->in_use));
 
 
201}
202
203static void unuse_pde(struct proc_dir_entry *pde)
204{
205	if (unlikely(atomic_dec_return(&pde->in_use) == BIAS))
206		complete(pde->pde_unload_completion);
 
207}
208
209/*
210 * At most 2 contexts can enter this function: the one doing the last
211 * close on the descriptor and whoever is deleting PDE itself.
212 *
213 * First to enter calls ->proc_release hook and signals its completion
214 * to the second one which waits and then does nothing.
215 *
216 * PDE is locked on entry, unlocked on exit.
217 */
218static void close_pdeo(struct proc_dir_entry *pde, struct pde_opener *pdeo)
219	__releases(&pde->pde_unload_lock)
220{
 
 
 
 
 
221	/*
222	 * close() (proc_reg_release()) can't delete an entry and proceed:
223	 * ->release hook needs to be available at the right moment.
224	 *
225	 * rmmod (remove_proc_entry() et al) can't delete an entry and proceed:
226	 * "struct file" needs to be available at the right moment.
227	 */
228	if (pdeo->closing) {
229		/* somebody else is doing that, just wait */
230		DECLARE_COMPLETION_ONSTACK(c);
231		pdeo->c = &c;
232		spin_unlock(&pde->pde_unload_lock);
233		wait_for_completion(&c);
234	} else {
235		struct file *file;
236		struct completion *c;
 
 
 
 
 
 
 
 
 
237
238		pdeo->closing = true;
239		spin_unlock(&pde->pde_unload_lock);
 
240
241		file = pdeo->file;
242		pde->proc_ops->proc_release(file_inode(file), file);
243
244		spin_lock(&pde->pde_unload_lock);
245		/* Strictly after ->proc_release, see above. */
246		list_del(&pdeo->lh);
247		c = pdeo->c;
248		spin_unlock(&pde->pde_unload_lock);
249		if (unlikely(c))
250			complete(c);
251		kmem_cache_free(pde_opener_cache, pdeo);
252	}
253}
254
255void proc_entry_rundown(struct proc_dir_entry *de)
256{
257	DECLARE_COMPLETION_ONSTACK(c);
258	/* Wait until all existing callers into module are done. */
259	de->pde_unload_completion = &c;
260	if (atomic_add_return(BIAS, &de->in_use) != BIAS)
261		wait_for_completion(&c);
262
263	/* ->pde_openers list can't grow from now on. */
264
265	spin_lock(&de->pde_unload_lock);
266	while (!list_empty(&de->pde_openers)) {
267		struct pde_opener *pdeo;
268		pdeo = list_first_entry(&de->pde_openers, struct pde_opener, lh);
269		close_pdeo(de, pdeo);
270		spin_lock(&de->pde_unload_lock);
271	}
272	spin_unlock(&de->pde_unload_lock);
273}
 
274
275static loff_t proc_reg_llseek(struct file *file, loff_t offset, int whence)
276{
277	struct proc_dir_entry *pde = PDE(file_inode(file));
278	loff_t rv = -EINVAL;
279
280	if (pde_is_permanent(pde)) {
281		return pde->proc_ops->proc_lseek(file, offset, whence);
282	} else if (use_pde(pde)) {
283		rv = pde->proc_ops->proc_lseek(file, offset, whence);
284		unuse_pde(pde);
285	}
286	return rv;
287}
288
289static ssize_t proc_reg_read_iter(struct kiocb *iocb, struct iov_iter *iter)
290{
291	struct proc_dir_entry *pde = PDE(file_inode(iocb->ki_filp));
292	ssize_t ret;
293
294	if (pde_is_permanent(pde))
295		return pde->proc_ops->proc_read_iter(iocb, iter);
296
297	if (!use_pde(pde))
298		return -EIO;
299	ret = pde->proc_ops->proc_read_iter(iocb, iter);
300	unuse_pde(pde);
301	return ret;
302}
303
304static ssize_t pde_read(struct proc_dir_entry *pde, struct file *file, char __user *buf, size_t count, loff_t *ppos)
305{
306	__auto_type read = pde->proc_ops->proc_read;
307	if (read)
308		return read(file, buf, count, ppos);
309	return -EIO;
310}
311
312static ssize_t proc_reg_read(struct file *file, char __user *buf, size_t count, loff_t *ppos)
313{
314	struct proc_dir_entry *pde = PDE(file_inode(file));
315	ssize_t rv = -EIO;
 
316
317	if (pde_is_permanent(pde)) {
318		return pde_read(pde, file, buf, count, ppos);
319	} else if (use_pde(pde)) {
320		rv = pde_read(pde, file, buf, count, ppos);
321		unuse_pde(pde);
322	}
323	return rv;
324}
 
325
326static ssize_t pde_write(struct proc_dir_entry *pde, struct file *file, const char __user *buf, size_t count, loff_t *ppos)
327{
328	__auto_type write = pde->proc_ops->proc_write;
329	if (write)
330		return write(file, buf, count, ppos);
331	return -EIO;
 
 
332}
333
334static ssize_t proc_reg_write(struct file *file, const char __user *buf, size_t count, loff_t *ppos)
335{
336	struct proc_dir_entry *pde = PDE(file_inode(file));
337	ssize_t rv = -EIO;
 
338
339	if (pde_is_permanent(pde)) {
340		return pde_write(pde, file, buf, count, ppos);
341	} else if (use_pde(pde)) {
342		rv = pde_write(pde, file, buf, count, ppos);
343		unuse_pde(pde);
344	}
345	return rv;
346}
 
347
348static __poll_t pde_poll(struct proc_dir_entry *pde, struct file *file, struct poll_table_struct *pts)
349{
350	__auto_type poll = pde->proc_ops->proc_poll;
351	if (poll)
352		return poll(file, pts);
353	return DEFAULT_POLLMASK;
354}
355
356static __poll_t proc_reg_poll(struct file *file, struct poll_table_struct *pts)
357{
358	struct proc_dir_entry *pde = PDE(file_inode(file));
359	__poll_t rv = DEFAULT_POLLMASK;
360
361	if (pde_is_permanent(pde)) {
362		return pde_poll(pde, file, pts);
363	} else if (use_pde(pde)) {
364		rv = pde_poll(pde, file, pts);
365		unuse_pde(pde);
366	}
367	return rv;
368}
369
370static long pde_ioctl(struct proc_dir_entry *pde, struct file *file, unsigned int cmd, unsigned long arg)
371{
372	__auto_type ioctl = pde->proc_ops->proc_ioctl;
373	if (ioctl)
374		return ioctl(file, cmd, arg);
375	return -ENOTTY;
376}
377
378static long proc_reg_unlocked_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
379{
380	struct proc_dir_entry *pde = PDE(file_inode(file));
381	long rv = -ENOTTY;
 
382
383	if (pde_is_permanent(pde)) {
384		return pde_ioctl(pde, file, cmd, arg);
385	} else if (use_pde(pde)) {
386		rv = pde_ioctl(pde, file, cmd, arg);
387		unuse_pde(pde);
388	}
 
 
 
 
 
 
 
 
389	return rv;
390}
391
392#ifdef CONFIG_COMPAT
393static long pde_compat_ioctl(struct proc_dir_entry *pde, struct file *file, unsigned int cmd, unsigned long arg)
394{
395	__auto_type compat_ioctl = pde->proc_ops->proc_compat_ioctl;
396	if (compat_ioctl)
397		return compat_ioctl(file, cmd, arg);
398	return -ENOTTY;
399}
400
401static long proc_reg_compat_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
402{
403	struct proc_dir_entry *pde = PDE(file_inode(file));
404	long rv = -ENOTTY;
405	if (pde_is_permanent(pde)) {
406		return pde_compat_ioctl(pde, file, cmd, arg);
407	} else if (use_pde(pde)) {
408		rv = pde_compat_ioctl(pde, file, cmd, arg);
409		unuse_pde(pde);
 
410	}
 
 
 
 
 
 
 
 
411	return rv;
412}
413#endif
414
415static int pde_mmap(struct proc_dir_entry *pde, struct file *file, struct vm_area_struct *vma)
416{
417	__auto_type mmap = pde->proc_ops->proc_mmap;
418	if (mmap)
419		return mmap(file, vma);
420	return -EIO;
421}
422
423static int proc_reg_mmap(struct file *file, struct vm_area_struct *vma)
424{
425	struct proc_dir_entry *pde = PDE(file_inode(file));
426	int rv = -EIO;
 
427
428	if (pde_is_permanent(pde)) {
429		return pde_mmap(pde, file, vma);
430	} else if (use_pde(pde)) {
431		rv = pde_mmap(pde, file, vma);
432		unuse_pde(pde);
433	}
434	return rv;
435}
 
436
437static unsigned long
438pde_get_unmapped_area(struct proc_dir_entry *pde, struct file *file, unsigned long orig_addr,
439			   unsigned long len, unsigned long pgoff,
440			   unsigned long flags)
441{
442	if (pde->proc_ops->proc_get_unmapped_area)
443		return pde->proc_ops->proc_get_unmapped_area(file, orig_addr, len, pgoff, flags);
444
445#ifdef CONFIG_MMU
446	return mm_get_unmapped_area(current->mm, file, orig_addr, len, pgoff, flags);
447#endif
448
449	return orig_addr;
450}
451
452static unsigned long
453proc_reg_get_unmapped_area(struct file *file, unsigned long orig_addr,
454			   unsigned long len, unsigned long pgoff,
455			   unsigned long flags)
456{
457	struct proc_dir_entry *pde = PDE(file_inode(file));
458	unsigned long rv = -EIO;
459
460	if (pde_is_permanent(pde)) {
461		return pde_get_unmapped_area(pde, file, orig_addr, len, pgoff, flags);
462	} else if (use_pde(pde)) {
463		rv = pde_get_unmapped_area(pde, file, orig_addr, len, pgoff, flags);
464		unuse_pde(pde);
465	}
466	return rv;
467}
468
469static int proc_reg_open(struct inode *inode, struct file *file)
470{
471	struct proc_dir_entry *pde = PDE(inode);
472	int rv = 0;
473	typeof_member(struct proc_ops, proc_open) open;
 
474	struct pde_opener *pdeo;
475
476	if (!pde->proc_ops->proc_lseek)
477		file->f_mode &= ~FMODE_LSEEK;
478
479	if (pde_is_permanent(pde)) {
480		open = pde->proc_ops->proc_open;
481		if (open)
482			rv = open(inode, file);
483		return rv;
484	}
485
486	/*
487	 * Ensure that
488	 * 1) PDE's ->release hook will be called no matter what
489	 *    either normally by close()/->release, or forcefully by
490	 *    rmmod/remove_proc_entry.
491	 *
492	 * 2) rmmod isn't blocked by opening file in /proc and sitting on
493	 *    the descriptor (including "rmmod foo </proc/foo" scenario).
494	 *
495	 * Save every "struct file" with custom ->release hook.
 
 
 
496	 */
497	if (!use_pde(pde))
 
 
 
 
 
 
 
498		return -ENOENT;
499
500	__auto_type release = pde->proc_ops->proc_release;
501	if (release) {
502		pdeo = kmem_cache_alloc(pde_opener_cache, GFP_KERNEL);
503		if (!pdeo) {
504			rv = -ENOMEM;
505			goto out_unuse;
506		}
507	}
 
 
 
 
508
509	open = pde->proc_ops->proc_open;
510	if (open)
511		rv = open(inode, file);
512
513	if (release) {
514		if (rv == 0) {
515			/* To know what to release. */
516			pdeo->file = file;
517			pdeo->closing = false;
518			pdeo->c = NULL;
519			spin_lock(&pde->pde_unload_lock);
520			list_add(&pdeo->lh, &pde->pde_openers);
521			spin_unlock(&pde->pde_unload_lock);
522		} else
523			kmem_cache_free(pde_opener_cache, pdeo);
 
 
 
 
 
 
 
 
 
 
 
 
524	}
525
526out_unuse:
527	unuse_pde(pde);
528	return rv;
529}
530
531static int proc_reg_release(struct inode *inode, struct file *file)
532{
533	struct proc_dir_entry *pde = PDE(inode);
 
 
534	struct pde_opener *pdeo;
535
536	if (pde_is_permanent(pde)) {
537		__auto_type release = pde->proc_ops->proc_release;
538		if (release) {
539			return release(inode, file);
540		}
541		return 0;
 
 
 
 
 
 
 
 
 
 
 
 
 
542	}
543
544	spin_lock(&pde->pde_unload_lock);
545	list_for_each_entry(pdeo, &pde->pde_openers, lh) {
546		if (pdeo->file == file) {
547			close_pdeo(pde, pdeo);
548			return 0;
549		}
550	}
551	spin_unlock(&pde->pde_unload_lock);
552	return 0;
 
 
 
 
 
553}
554
555static const struct file_operations proc_reg_file_ops = {
556	.llseek		= proc_reg_llseek,
557	.read		= proc_reg_read,
558	.write		= proc_reg_write,
559	.poll		= proc_reg_poll,
560	.unlocked_ioctl	= proc_reg_unlocked_ioctl,
 
 
 
561	.mmap		= proc_reg_mmap,
562	.get_unmapped_area = proc_reg_get_unmapped_area,
563	.open		= proc_reg_open,
564	.release	= proc_reg_release,
565};
566
567static const struct file_operations proc_iter_file_ops = {
568	.llseek		= proc_reg_llseek,
569	.read_iter	= proc_reg_read_iter,
570	.write		= proc_reg_write,
571	.splice_read	= copy_splice_read,
572	.poll		= proc_reg_poll,
573	.unlocked_ioctl	= proc_reg_unlocked_ioctl,
574	.mmap		= proc_reg_mmap,
575	.get_unmapped_area = proc_reg_get_unmapped_area,
576	.open		= proc_reg_open,
577	.release	= proc_reg_release,
578};
579
580#ifdef CONFIG_COMPAT
581static const struct file_operations proc_reg_file_ops_compat = {
582	.llseek		= proc_reg_llseek,
583	.read		= proc_reg_read,
584	.write		= proc_reg_write,
585	.poll		= proc_reg_poll,
586	.unlocked_ioctl	= proc_reg_unlocked_ioctl,
587	.compat_ioctl	= proc_reg_compat_ioctl,
588	.mmap		= proc_reg_mmap,
589	.get_unmapped_area = proc_reg_get_unmapped_area,
590	.open		= proc_reg_open,
591	.release	= proc_reg_release,
592};
593
594static const struct file_operations proc_iter_file_ops_compat = {
595	.llseek		= proc_reg_llseek,
596	.read_iter	= proc_reg_read_iter,
597	.splice_read	= copy_splice_read,
598	.write		= proc_reg_write,
599	.poll		= proc_reg_poll,
600	.unlocked_ioctl	= proc_reg_unlocked_ioctl,
601	.compat_ioctl	= proc_reg_compat_ioctl,
602	.mmap		= proc_reg_mmap,
603	.get_unmapped_area = proc_reg_get_unmapped_area,
604	.open		= proc_reg_open,
605	.release	= proc_reg_release,
606};
607#endif
608
609static void proc_put_link(void *p)
610{
611	unuse_pde(p);
612}
613
614static const char *proc_get_link(struct dentry *dentry,
615				 struct inode *inode,
616				 struct delayed_call *done)
617{
618	struct proc_dir_entry *pde = PDE(inode);
619	if (!use_pde(pde))
620		return ERR_PTR(-EINVAL);
621	set_delayed_call(done, proc_put_link, pde);
622	return pde->data;
623}
624
625const struct inode_operations proc_link_inode_operations = {
626	.get_link	= proc_get_link,
627};
628
629struct inode *proc_get_inode(struct super_block *sb, struct proc_dir_entry *de)
630{
631	struct inode *inode = new_inode(sb);
632
633	if (!inode) {
634		pde_put(de);
635		return NULL;
636	}
637
638	inode->i_private = de->data;
639	inode->i_ino = de->low_ino;
640	simple_inode_init_ts(inode);
641	PROC_I(inode)->pde = de;
642	if (is_empty_pde(de)) {
643		make_empty_dir_inode(inode);
644		return inode;
645	}
646
647	if (de->mode) {
648		inode->i_mode = de->mode;
649		inode->i_uid = de->uid;
650		inode->i_gid = de->gid;
651	}
652	if (de->size)
653		inode->i_size = de->size;
654	if (de->nlink)
655		set_nlink(inode, de->nlink);
656
657	if (S_ISREG(inode->i_mode)) {
658		inode->i_op = de->proc_iops;
659		if (de->proc_ops->proc_read_iter)
660			inode->i_fop = &proc_iter_file_ops;
661		else
662			inode->i_fop = &proc_reg_file_ops;
663#ifdef CONFIG_COMPAT
664		if (de->proc_ops->proc_compat_ioctl) {
665			if (de->proc_ops->proc_read_iter)
666				inode->i_fop = &proc_iter_file_ops_compat;
667			else
668				inode->i_fop = &proc_reg_file_ops_compat;
 
 
 
 
669		}
670#endif
671	} else if (S_ISDIR(inode->i_mode)) {
672		inode->i_op = de->proc_iops;
673		inode->i_fop = de->proc_dir_ops;
674	} else if (S_ISLNK(inode->i_mode)) {
675		inode->i_op = de->proc_iops;
676		inode->i_fop = NULL;
677	} else {
678		BUG();
679	}
680	return inode;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
681}