base.c 72.3 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13
/*
 *  linux/fs/proc/base.c
 *
 *  Copyright (C) 1991, 1992 Linus Torvalds
 *
 *  proc base directory handling functions
 *
 *  1999, Al Viro. Rewritten. Now it covers the whole per-process part.
 *  Instead of using magical inumbers to determine the kind of object
 *  we allocate and fill in-core inodes upon lookup. They don't even
 *  go into icache. We cache the reference to task_struct upon lookup too.
 *  Eventually it should become a filesystem in its own. We don't use the
 *  rest of procfs anymore.
M
Mauricio Lin 已提交
14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47
 *
 *
 *  Changelog:
 *  17-Jan-2005
 *  Allan Bezerra
 *  Bruna Moreira <bruna.moreira@indt.org.br>
 *  Edjard Mota <edjard.mota@indt.org.br>
 *  Ilias Biris <ilias.biris@indt.org.br>
 *  Mauricio Lin <mauricio.lin@indt.org.br>
 *
 *  Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT
 *
 *  A new process specific entry (smaps) included in /proc. It shows the
 *  size of rss for each memory area. The maps entry lacks information
 *  about physical memory size (rss) for each mapped file, i.e.,
 *  rss information for executables and library files.
 *  This additional information is useful for any tools that need to know
 *  about physical memory consumption for a process specific library.
 *
 *  Changelog:
 *  21-Feb-2005
 *  Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT
 *  Pud inclusion in the page table walking.
 *
 *  ChangeLog:
 *  10-Mar-2005
 *  10LE Instituto Nokia de Tecnologia - INdT:
 *  A better way to walks through the page table as suggested by Hugh Dickins.
 *
 *  Simo Piiroinen <simo.piiroinen@nokia.com>:
 *  Smaps information related to shared, private, clean and dirty pages.
 *
 *  Paul Mundt <paul.mundt@nokia.com>:
 *  Overall revision about smaps.
L
Linus Torvalds 已提交
48 49 50 51 52 53 54 55
 */

#include <asm/uaccess.h>

#include <linux/errno.h>
#include <linux/time.h>
#include <linux/proc_fs.h>
#include <linux/stat.h>
56
#include <linux/task_io_accounting_ops.h>
L
Linus Torvalds 已提交
57
#include <linux/init.h>
58
#include <linux/capability.h>
L
Linus Torvalds 已提交
59
#include <linux/file.h>
A
Al Viro 已提交
60
#include <linux/fdtable.h>
L
Linus Torvalds 已提交
61 62 63
#include <linux/string.h>
#include <linux/seq_file.h>
#include <linux/namei.h>
64
#include <linux/mnt_namespace.h>
L
Linus Torvalds 已提交
65
#include <linux/mm.h>
66
#include <linux/rcupdate.h>
L
Linus Torvalds 已提交
67
#include <linux/kallsyms.h>
68
#include <linux/resource.h>
K
Kees Cook 已提交
69
#include <linux/module.h>
L
Linus Torvalds 已提交
70 71 72
#include <linux/mount.h>
#include <linux/security.h>
#include <linux/ptrace.h>
73
#include <linux/tracehook.h>
74
#include <linux/cgroup.h>
L
Linus Torvalds 已提交
75 76
#include <linux/cpuset.h>
#include <linux/audit.h>
A
Al Viro 已提交
77
#include <linux/poll.h>
78
#include <linux/nsproxy.h>
79
#include <linux/oom.h>
80
#include <linux/elf.h>
81
#include <linux/pid_namespace.h>
L
Linus Torvalds 已提交
82 83
#include "internal.h"

84 85 86 87 88 89 90 91 92 93
/* NOTE:
 *	Implementing inode permission operations in /proc is almost
 *	certainly an error.  Permission checks need to happen during
 *	each system call not at open time.  The reason is that most of
 *	what we wish to check for permissions in /proc varies at runtime.
 *
 *	The classic example of a problem is opening file descriptors
 *	in /proc for a task before it execs a suid executable.
 */

L
Linus Torvalds 已提交
94 95
struct pid_entry {
	char *name;
96
	int len;
L
Linus Torvalds 已提交
97
	mode_t mode;
98
	const struct inode_operations *iop;
99
	const struct file_operations *fop;
100
	union proc_op op;
L
Linus Torvalds 已提交
101 102
};

103
#define NOD(NAME, MODE, IOP, FOP, OP) {			\
104
	.name = (NAME),					\
105
	.len  = sizeof(NAME) - 1,			\
106 107 108 109 110 111
	.mode = MODE,					\
	.iop  = IOP,					\
	.fop  = FOP,					\
	.op   = OP,					\
}

112 113
#define DIR(NAME, MODE, OTYPE)							\
	NOD(NAME, (S_IFDIR|(MODE)),						\
114 115
		&proc_##OTYPE##_inode_operations, &proc_##OTYPE##_operations,	\
		{} )
116 117
#define LNK(NAME, OTYPE)					\
	NOD(NAME, (S_IFLNK|S_IRWXUGO),				\
118 119
		&proc_pid_link_inode_operations, NULL,		\
		{ .proc_get_link = &proc_##OTYPE##_link } )
120 121
#define REG(NAME, MODE, OTYPE)				\
	NOD(NAME, (S_IFREG|(MODE)), NULL,		\
122
		&proc_##OTYPE##_operations, {})
123 124
#define INF(NAME, MODE, OTYPE)				\
	NOD(NAME, (S_IFREG|(MODE)), 			\
125 126
		NULL, &proc_info_file_operations,	\
		{ .proc_read = &proc_##OTYPE } )
127 128 129 130
#define ONE(NAME, MODE, OTYPE)				\
	NOD(NAME, (S_IFREG|(MODE)), 			\
		NULL, &proc_single_file_operations,	\
		{ .proc_show = &proc_##OTYPE } )
L
Linus Torvalds 已提交
131

132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150
/*
 * Count the number of hardlinks for the pid_entry table, excluding the .
 * and .. links.
 */
static unsigned int pid_entry_count_dirs(const struct pid_entry *entries,
	unsigned int n)
{
	unsigned int i;
	unsigned int count;

	count = 0;
	for (i = 0; i < n; ++i) {
		if (S_ISDIR(entries[i].mode))
			++count;
	}

	return count;
}

151
static struct fs_struct *get_fs_struct(struct task_struct *task)
L
Linus Torvalds 已提交
152 153
{
	struct fs_struct *fs;
154 155
	task_lock(task);
	fs = task->fs;
L
Linus Torvalds 已提交
156 157
	if(fs)
		atomic_inc(&fs->count);
158 159 160 161
	task_unlock(task);
	return fs;
}

162 163 164 165 166 167 168 169 170 171 172 173
static int get_nr_threads(struct task_struct *tsk)
{
	unsigned long flags;
	int count = 0;

	if (lock_task_sighand(tsk, &flags)) {
		count = atomic_read(&tsk->signal->count);
		unlock_task_sighand(tsk, &flags);
	}
	return count;
}

174
static int proc_cwd_link(struct inode *inode, struct path *path)
175
{
176 177
	struct task_struct *task = get_proc_task(inode);
	struct fs_struct *fs = NULL;
178
	int result = -ENOENT;
179 180 181 182 183

	if (task) {
		fs = get_fs_struct(task);
		put_task_struct(task);
	}
L
Linus Torvalds 已提交
184 185
	if (fs) {
		read_lock(&fs->lock);
186 187
		*path = fs->pwd;
		path_get(&fs->pwd);
L
Linus Torvalds 已提交
188 189 190 191 192 193 194
		read_unlock(&fs->lock);
		result = 0;
		put_fs_struct(fs);
	}
	return result;
}

195
static int proc_root_link(struct inode *inode, struct path *path)
L
Linus Torvalds 已提交
196
{
197 198
	struct task_struct *task = get_proc_task(inode);
	struct fs_struct *fs = NULL;
L
Linus Torvalds 已提交
199
	int result = -ENOENT;
200 201 202 203 204

	if (task) {
		fs = get_fs_struct(task);
		put_task_struct(task);
	}
L
Linus Torvalds 已提交
205 206
	if (fs) {
		read_lock(&fs->lock);
207 208
		*path = fs->root;
		path_get(&fs->root);
L
Linus Torvalds 已提交
209 210 211 212 213 214 215
		read_unlock(&fs->lock);
		result = 0;
		put_fs_struct(fs);
	}
	return result;
}

R
Roland McGrath 已提交
216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231
/*
 * Return zero if current may access user memory in @task, -error if not.
 */
static int check_mem_permission(struct task_struct *task)
{
	/*
	 * A task can always look at itself, in case it chooses
	 * to use system calls instead of load instructions.
	 */
	if (task == current)
		return 0;

	/*
	 * If current is actively ptrace'ing, and would also be
	 * permitted to freshly attach with ptrace now, permit it.
	 */
232 233 234 235 236 237 238 239
	if (task_is_stopped_or_traced(task)) {
		int match;
		rcu_read_lock();
		match = (tracehook_tracer_task(task) == current);
		rcu_read_unlock();
		if (match && ptrace_may_access(task, PTRACE_MODE_ATTACH))
			return 0;
	}
R
Roland McGrath 已提交
240 241 242 243 244 245

	/*
	 * Noone else is allowed.
	 */
	return -EPERM;
}
L
Linus Torvalds 已提交
246

247 248 249 250 251 252 253 254 255
struct mm_struct *mm_for_maps(struct task_struct *task)
{
	struct mm_struct *mm = get_task_mm(task);
	if (!mm)
		return NULL;
	down_read(&mm->mmap_sem);
	task_lock(task);
	if (task->mm != mm)
		goto out;
256 257
	if (task->mm != current->mm &&
	    __ptrace_may_access(task, PTRACE_MODE_READ) < 0)
258 259 260 261 262 263 264 265 266 267
		goto out;
	task_unlock(task);
	return mm;
out:
	task_unlock(task);
	up_read(&mm->mmap_sem);
	mmput(mm);
	return NULL;
}

L
Linus Torvalds 已提交
268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330
static int proc_pid_cmdline(struct task_struct *task, char * buffer)
{
	int res = 0;
	unsigned int len;
	struct mm_struct *mm = get_task_mm(task);
	if (!mm)
		goto out;
	if (!mm->arg_end)
		goto out_mm;	/* Shh! No looking before we're done */

 	len = mm->arg_end - mm->arg_start;
 
	if (len > PAGE_SIZE)
		len = PAGE_SIZE;
 
	res = access_process_vm(task, mm->arg_start, buffer, len, 0);

	// If the nul at the end of args has been overwritten, then
	// assume application is using setproctitle(3).
	if (res > 0 && buffer[res-1] != '\0' && len < PAGE_SIZE) {
		len = strnlen(buffer, res);
		if (len < res) {
		    res = len;
		} else {
			len = mm->env_end - mm->env_start;
			if (len > PAGE_SIZE - res)
				len = PAGE_SIZE - res;
			res += access_process_vm(task, mm->env_start, buffer+res, len, 0);
			res = strnlen(buffer, res);
		}
	}
out_mm:
	mmput(mm);
out:
	return res;
}

static int proc_pid_auxv(struct task_struct *task, char *buffer)
{
	int res = 0;
	struct mm_struct *mm = get_task_mm(task);
	if (mm) {
		unsigned int nwords = 0;
		do
			nwords += 2;
		while (mm->saved_auxv[nwords - 2] != 0); /* AT_NULL */
		res = nwords * sizeof(mm->saved_auxv[0]);
		if (res > PAGE_SIZE)
			res = PAGE_SIZE;
		memcpy(buffer, mm->saved_auxv, res);
		mmput(mm);
	}
	return res;
}


#ifdef CONFIG_KALLSYMS
/*
 * Provides a wchan file via kallsyms in a proper one-value-per-file format.
 * Returns the resolved symbol.  If that fails, simply return the address.
 */
static int proc_pid_wchan(struct task_struct *task, char *buffer)
{
A
Alexey Dobriyan 已提交
331
	unsigned long wchan;
332
	char symname[KSYM_NAME_LEN];
L
Linus Torvalds 已提交
333 334 335

	wchan = get_wchan(task);

336 337 338 339
	if (lookup_symbol_name(wchan, symname) < 0)
		return sprintf(buffer, "%lu", wchan);
	else
		return sprintf(buffer, "%s", symname);
L
Linus Torvalds 已提交
340 341 342 343 344 345 346 347 348
}
#endif /* CONFIG_KALLSYMS */

#ifdef CONFIG_SCHEDSTATS
/*
 * Provides /proc/PID/schedstat
 */
static int proc_pid_schedstat(struct task_struct *task, char *buffer)
{
349
	return sprintf(buffer, "%llu %llu %lu\n",
L
Linus Torvalds 已提交
350 351
			task->sched_info.cpu_time,
			task->sched_info.run_delay,
352
			task->sched_info.pcount);
L
Linus Torvalds 已提交
353 354 355
}
#endif

A
Arjan van de Ven 已提交
356 357 358 359
#ifdef CONFIG_LATENCYTOP
static int lstats_show_proc(struct seq_file *m, void *v)
{
	int i;
360 361
	struct inode *inode = m->private;
	struct task_struct *task = get_proc_task(inode);
A
Arjan van de Ven 已提交
362

363 364 365
	if (!task)
		return -ESRCH;
	seq_puts(m, "Latency Top version : v0.1\n");
A
Arjan van de Ven 已提交
366 367 368 369 370 371 372 373
	for (i = 0; i < 32; i++) {
		if (task->latency_record[i].backtrace[0]) {
			int q;
			seq_printf(m, "%i %li %li ",
				task->latency_record[i].count,
				task->latency_record[i].time,
				task->latency_record[i].max);
			for (q = 0; q < LT_BACKTRACEDEPTH; q++) {
H
Hugh Dickins 已提交
374
				char sym[KSYM_SYMBOL_LEN];
A
Arjan van de Ven 已提交
375 376 377 378 379 380 381 382 383 384 385 386 387 388 389
				char *c;
				if (!task->latency_record[i].backtrace[q])
					break;
				if (task->latency_record[i].backtrace[q] == ULONG_MAX)
					break;
				sprint_symbol(sym, task->latency_record[i].backtrace[q]);
				c = strchr(sym, '+');
				if (c)
					*c = 0;
				seq_printf(m, "%s ", sym);
			}
			seq_printf(m, "\n");
		}

	}
390
	put_task_struct(task);
A
Arjan van de Ven 已提交
391 392 393 394 395
	return 0;
}

static int lstats_open(struct inode *inode, struct file *file)
{
396
	return single_open(file, lstats_show_proc, inode);
397 398
}

A
Arjan van de Ven 已提交
399 400 401
static ssize_t lstats_write(struct file *file, const char __user *buf,
			    size_t count, loff_t *offs)
{
402
	struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
A
Arjan van de Ven 已提交
403

404 405
	if (!task)
		return -ESRCH;
A
Arjan van de Ven 已提交
406
	clear_all_latency_tracing(task);
407
	put_task_struct(task);
A
Arjan van de Ven 已提交
408 409 410 411 412 413 414 415 416

	return count;
}

static const struct file_operations proc_lstats_operations = {
	.open		= lstats_open,
	.read		= seq_read,
	.write		= lstats_write,
	.llseek		= seq_lseek,
417
	.release	= single_release,
A
Arjan van de Ven 已提交
418 419 420 421
};

#endif

L
Linus Torvalds 已提交
422 423 424 425 426 427 428 429
/* The badness from the OOM killer */
unsigned long badness(struct task_struct *p, unsigned long uptime);
static int proc_oom_score(struct task_struct *task, char *buffer)
{
	unsigned long points;
	struct timespec uptime;

	do_posix_clock_monotonic_gettime(&uptime);
430
	read_lock(&tasklist_lock);
L
Linus Torvalds 已提交
431
	points = badness(task, uptime.tv_sec);
432
	read_unlock(&tasklist_lock);
L
Linus Torvalds 已提交
433 434 435
	return sprintf(buffer, "%lu\n", points);
}

436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456
struct limit_names {
	char *name;
	char *unit;
};

static const struct limit_names lnames[RLIM_NLIMITS] = {
	[RLIMIT_CPU] = {"Max cpu time", "ms"},
	[RLIMIT_FSIZE] = {"Max file size", "bytes"},
	[RLIMIT_DATA] = {"Max data size", "bytes"},
	[RLIMIT_STACK] = {"Max stack size", "bytes"},
	[RLIMIT_CORE] = {"Max core file size", "bytes"},
	[RLIMIT_RSS] = {"Max resident set", "bytes"},
	[RLIMIT_NPROC] = {"Max processes", "processes"},
	[RLIMIT_NOFILE] = {"Max open files", "files"},
	[RLIMIT_MEMLOCK] = {"Max locked memory", "bytes"},
	[RLIMIT_AS] = {"Max address space", "bytes"},
	[RLIMIT_LOCKS] = {"Max file locks", "locks"},
	[RLIMIT_SIGPENDING] = {"Max pending signals", "signals"},
	[RLIMIT_MSGQUEUE] = {"Max msgqueue size", "bytes"},
	[RLIMIT_NICE] = {"Max nice priority", NULL},
	[RLIMIT_RTPRIO] = {"Max realtime priority", NULL},
457
	[RLIMIT_RTTIME] = {"Max realtime timeout", "us"},
458 459 460 461 462 463 464 465 466 467 468 469
};

/* Display limits for a process */
static int proc_pid_limits(struct task_struct *task, char *buffer)
{
	unsigned int i;
	int count = 0;
	unsigned long flags;
	char *bufptr = buffer;

	struct rlimit rlim[RLIM_NLIMITS];

470
	if (!lock_task_sighand(task, &flags))
471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504
		return 0;
	memcpy(rlim, task->signal->rlim, sizeof(struct rlimit) * RLIM_NLIMITS);
	unlock_task_sighand(task, &flags);

	/*
	 * print the file header
	 */
	count += sprintf(&bufptr[count], "%-25s %-20s %-20s %-10s\n",
			"Limit", "Soft Limit", "Hard Limit", "Units");

	for (i = 0; i < RLIM_NLIMITS; i++) {
		if (rlim[i].rlim_cur == RLIM_INFINITY)
			count += sprintf(&bufptr[count], "%-25s %-20s ",
					 lnames[i].name, "unlimited");
		else
			count += sprintf(&bufptr[count], "%-25s %-20lu ",
					 lnames[i].name, rlim[i].rlim_cur);

		if (rlim[i].rlim_max == RLIM_INFINITY)
			count += sprintf(&bufptr[count], "%-20s ", "unlimited");
		else
			count += sprintf(&bufptr[count], "%-20lu ",
					 rlim[i].rlim_max);

		if (lnames[i].unit)
			count += sprintf(&bufptr[count], "%-10s\n",
					 lnames[i].unit);
		else
			count += sprintf(&bufptr[count], "\n");
	}

	return count;
}

R
Roland McGrath 已提交
505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524
#ifdef CONFIG_HAVE_ARCH_TRACEHOOK
static int proc_pid_syscall(struct task_struct *task, char *buffer)
{
	long nr;
	unsigned long args[6], sp, pc;

	if (task_current_syscall(task, &nr, args, 6, &sp, &pc))
		return sprintf(buffer, "running\n");

	if (nr < 0)
		return sprintf(buffer, "%ld 0x%lx 0x%lx\n", nr, sp, pc);

	return sprintf(buffer,
		       "%ld 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx\n",
		       nr,
		       args[0], args[1], args[2], args[3], args[4], args[5],
		       sp, pc);
}
#endif /* CONFIG_HAVE_ARCH_TRACEHOOK */

L
Linus Torvalds 已提交
525 526 527 528 529
/************************************************************************/
/*                       Here the fs part begins                        */
/************************************************************************/

/* permission checks */
530
static int proc_fd_access_allowed(struct inode *inode)
L
Linus Torvalds 已提交
531
{
532 533
	struct task_struct *task;
	int allowed = 0;
534 535 536
	/* Allow access to a task's file descriptors if it is us or we
	 * may use ptrace attach to the process and find out that
	 * information.
537 538
	 */
	task = get_proc_task(inode);
539
	if (task) {
540
		allowed = ptrace_may_access(task, PTRACE_MODE_READ);
541
		put_task_struct(task);
542
	}
543
	return allowed;
L
Linus Torvalds 已提交
544 545
}

546 547 548 549 550 551 552 553 554
static int proc_setattr(struct dentry *dentry, struct iattr *attr)
{
	int error;
	struct inode *inode = dentry->d_inode;

	if (attr->ia_valid & ATTR_MODE)
		return -EPERM;

	error = inode_change_ok(inode, attr);
555 556
	if (!error)
		error = inode_setattr(inode, attr);
557 558 559
	return error;
}

560
static const struct inode_operations proc_def_inode_operations = {
561 562 563
	.setattr	= proc_setattr,
};

564 565
static int mounts_open_common(struct inode *inode, struct file *file,
			      const struct seq_operations *op)
L
Linus Torvalds 已提交
566
{
567
	struct task_struct *task = get_proc_task(inode);
568
	struct nsproxy *nsp;
569
	struct mnt_namespace *ns = NULL;
570 571
	struct fs_struct *fs = NULL;
	struct path root;
A
Al Viro 已提交
572 573
	struct proc_mounts *p;
	int ret = -EINVAL;
L
Linus Torvalds 已提交
574

575
	if (task) {
576 577 578 579
		rcu_read_lock();
		nsp = task_nsproxy(task);
		if (nsp) {
			ns = nsp->mnt_ns;
580 581 582
			if (ns)
				get_mnt_ns(ns);
		}
583
		rcu_read_unlock();
584 585
		if (ns)
			fs = get_fs_struct(task);
586 587
		put_task_struct(task);
	}
A
Al Viro 已提交
588

589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623
	if (!ns)
		goto err;
	if (!fs)
		goto err_put_ns;

	read_lock(&fs->lock);
	root = fs->root;
	path_get(&root);
	read_unlock(&fs->lock);
	put_fs_struct(fs);

	ret = -ENOMEM;
	p = kmalloc(sizeof(struct proc_mounts), GFP_KERNEL);
	if (!p)
		goto err_put_path;

	file->private_data = &p->m;
	ret = seq_open(file, op);
	if (ret)
		goto err_free;

	p->m.private = p;
	p->ns = ns;
	p->root = root;
	p->event = ns->event;

	return 0;

 err_free:
	kfree(p);
 err_put_path:
	path_put(&root);
 err_put_ns:
	put_mnt_ns(ns);
 err:
L
Linus Torvalds 已提交
624 625 626 627 628
	return ret;
}

static int mounts_release(struct inode *inode, struct file *file)
{
629 630 631
	struct proc_mounts *p = file->private_data;
	path_put(&p->root);
	put_mnt_ns(p->ns);
L
Linus Torvalds 已提交
632 633 634
	return seq_release(inode, file);
}

A
Al Viro 已提交
635 636 637
static unsigned mounts_poll(struct file *file, poll_table *wait)
{
	struct proc_mounts *p = file->private_data;
638
	struct mnt_namespace *ns = p->ns;
A
Al Viro 已提交
639 640 641 642 643 644 645 646 647 648 649 650 651 652
	unsigned res = 0;

	poll_wait(file, &ns->poll, wait);

	spin_lock(&vfsmount_lock);
	if (p->event != ns->event) {
		p->event = ns->event;
		res = POLLERR;
	}
	spin_unlock(&vfsmount_lock);

	return res;
}

653 654 655 656 657
static int mounts_open(struct inode *inode, struct file *file)
{
	return mounts_open_common(inode, file, &mounts_op);
}

658
static const struct file_operations proc_mounts_operations = {
L
Linus Torvalds 已提交
659 660 661 662
	.open		= mounts_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= mounts_release,
A
Al Viro 已提交
663
	.poll		= mounts_poll,
L
Linus Torvalds 已提交
664 665
};

666 667 668 669 670 671 672 673 674 675 676 677 678
static int mountinfo_open(struct inode *inode, struct file *file)
{
	return mounts_open_common(inode, file, &mountinfo_op);
}

static const struct file_operations proc_mountinfo_operations = {
	.open		= mountinfo_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= mounts_release,
	.poll		= mounts_poll,
};

679 680
static int mountstats_open(struct inode *inode, struct file *file)
{
681
	return mounts_open_common(inode, file, &mountstats_op);
682 683
}

684
static const struct file_operations proc_mountstats_operations = {
685 686 687 688 689 690
	.open		= mountstats_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= mounts_release,
};

L
Linus Torvalds 已提交
691 692 693 694 695
#define PROC_BLOCK_SIZE	(3*1024)		/* 4K page size but our output routines use some slack for overruns */

static ssize_t proc_info_read(struct file * file, char __user * buf,
			  size_t count, loff_t *ppos)
{
696
	struct inode * inode = file->f_path.dentry->d_inode;
L
Linus Torvalds 已提交
697 698
	unsigned long page;
	ssize_t length;
699 700 701 702 703
	struct task_struct *task = get_proc_task(inode);

	length = -ESRCH;
	if (!task)
		goto out_no_task;
L
Linus Torvalds 已提交
704 705 706

	if (count > PROC_BLOCK_SIZE)
		count = PROC_BLOCK_SIZE;
707 708

	length = -ENOMEM;
709
	if (!(page = __get_free_page(GFP_TEMPORARY)))
710
		goto out;
L
Linus Torvalds 已提交
711 712 713 714 715 716

	length = PROC_I(inode)->op.proc_read(task, (char*)page);

	if (length >= 0)
		length = simple_read_from_buffer(buf, count, ppos, (char *)page, length);
	free_page(page);
717 718 719
out:
	put_task_struct(task);
out_no_task:
L
Linus Torvalds 已提交
720 721 722
	return length;
}

723
static const struct file_operations proc_info_file_operations = {
L
Linus Torvalds 已提交
724 725 726
	.read		= proc_info_read,
};

727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765
static int proc_single_show(struct seq_file *m, void *v)
{
	struct inode *inode = m->private;
	struct pid_namespace *ns;
	struct pid *pid;
	struct task_struct *task;
	int ret;

	ns = inode->i_sb->s_fs_info;
	pid = proc_pid(inode);
	task = get_pid_task(pid, PIDTYPE_PID);
	if (!task)
		return -ESRCH;

	ret = PROC_I(inode)->op.proc_show(m, ns, pid, task);

	put_task_struct(task);
	return ret;
}

static int proc_single_open(struct inode *inode, struct file *filp)
{
	int ret;
	ret = single_open(filp, proc_single_show, NULL);
	if (!ret) {
		struct seq_file *m = filp->private_data;

		m->private = inode;
	}
	return ret;
}

static const struct file_operations proc_single_file_operations = {
	.open		= proc_single_open,
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= single_release,
};

L
Linus Torvalds 已提交
766 767 768 769 770 771 772 773 774
static int mem_open(struct inode* inode, struct file* file)
{
	file->private_data = (void*)((long)current->self_exec_id);
	return 0;
}

static ssize_t mem_read(struct file * file, char __user * buf,
			size_t count, loff_t *ppos)
{
775
	struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
L
Linus Torvalds 已提交
776 777 778 779 780
	char *page;
	unsigned long src = *ppos;
	int ret = -ESRCH;
	struct mm_struct *mm;

781 782 783
	if (!task)
		goto out_no_task;

R
Roland McGrath 已提交
784
	if (check_mem_permission(task))
L
Linus Torvalds 已提交
785 786 787
		goto out;

	ret = -ENOMEM;
788
	page = (char *)__get_free_page(GFP_TEMPORARY);
L
Linus Torvalds 已提交
789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809
	if (!page)
		goto out;

	ret = 0;
 
	mm = get_task_mm(task);
	if (!mm)
		goto out_free;

	ret = -EIO;
 
	if (file->private_data != (void*)((long)current->self_exec_id))
		goto out_put;

	ret = 0;
 
	while (count > 0) {
		int this_len, retval;

		this_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;
		retval = access_process_vm(task, src, page, this_len, 0);
R
Roland McGrath 已提交
810
		if (!retval || check_mem_permission(task)) {
L
Linus Torvalds 已提交
811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832
			if (!ret)
				ret = -EIO;
			break;
		}

		if (copy_to_user(buf, page, retval)) {
			ret = -EFAULT;
			break;
		}
 
		ret += retval;
		src += retval;
		buf += retval;
		count -= retval;
	}
	*ppos = src;

out_put:
	mmput(mm);
out_free:
	free_page((unsigned long) page);
out:
833 834
	put_task_struct(task);
out_no_task:
L
Linus Torvalds 已提交
835 836 837 838 839 840 841
	return ret;
}

#define mem_write NULL

#ifndef mem_write
/* This is a security hazard */
842
static ssize_t mem_write(struct file * file, const char __user *buf,
L
Linus Torvalds 已提交
843 844
			 size_t count, loff_t *ppos)
{
845
	int copied;
L
Linus Torvalds 已提交
846
	char *page;
847
	struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
L
Linus Torvalds 已提交
848 849
	unsigned long dst = *ppos;

850 851 852 853
	copied = -ESRCH;
	if (!task)
		goto out_no_task;

R
Roland McGrath 已提交
854
	if (check_mem_permission(task))
855
		goto out;
L
Linus Torvalds 已提交
856

857
	copied = -ENOMEM;
858
	page = (char *)__get_free_page(GFP_TEMPORARY);
L
Linus Torvalds 已提交
859
	if (!page)
860
		goto out;
L
Linus Torvalds 已提交
861

862
	copied = 0;
L
Linus Torvalds 已提交
863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883
	while (count > 0) {
		int this_len, retval;

		this_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;
		if (copy_from_user(page, buf, this_len)) {
			copied = -EFAULT;
			break;
		}
		retval = access_process_vm(task, dst, page, this_len, 1);
		if (!retval) {
			if (!copied)
				copied = -EIO;
			break;
		}
		copied += retval;
		buf += retval;
		dst += retval;
		count -= retval;			
	}
	*ppos = dst;
	free_page((unsigned long) page);
884 885 886
out:
	put_task_struct(task);
out_no_task:
L
Linus Torvalds 已提交
887 888 889 890
	return copied;
}
#endif

891
loff_t mem_lseek(struct file *file, loff_t offset, int orig)
L
Linus Torvalds 已提交
892 893 894 895 896 897 898 899 900 901 902 903 904 905 906
{
	switch (orig) {
	case 0:
		file->f_pos = offset;
		break;
	case 1:
		file->f_pos += offset;
		break;
	default:
		return -EINVAL;
	}
	force_successful_syscall_return();
	return file->f_pos;
}

907
static const struct file_operations proc_mem_operations = {
L
Linus Torvalds 已提交
908 909 910 911 912 913
	.llseek		= mem_lseek,
	.read		= mem_read,
	.write		= mem_write,
	.open		= mem_open,
};

914 915 916 917 918 919 920 921 922 923 924 925
static ssize_t environ_read(struct file *file, char __user *buf,
			size_t count, loff_t *ppos)
{
	struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
	char *page;
	unsigned long src = *ppos;
	int ret = -ESRCH;
	struct mm_struct *mm;

	if (!task)
		goto out_no_task;

926
	if (!ptrace_may_access(task, PTRACE_MODE_READ))
927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983
		goto out;

	ret = -ENOMEM;
	page = (char *)__get_free_page(GFP_TEMPORARY);
	if (!page)
		goto out;

	ret = 0;

	mm = get_task_mm(task);
	if (!mm)
		goto out_free;

	while (count > 0) {
		int this_len, retval, max_len;

		this_len = mm->env_end - (mm->env_start + src);

		if (this_len <= 0)
			break;

		max_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;
		this_len = (this_len > max_len) ? max_len : this_len;

		retval = access_process_vm(task, (mm->env_start + src),
			page, this_len, 0);

		if (retval <= 0) {
			ret = retval;
			break;
		}

		if (copy_to_user(buf, page, retval)) {
			ret = -EFAULT;
			break;
		}

		ret += retval;
		src += retval;
		buf += retval;
		count -= retval;
	}
	*ppos = src;

	mmput(mm);
out_free:
	free_page((unsigned long) page);
out:
	put_task_struct(task);
out_no_task:
	return ret;
}

static const struct file_operations proc_environ_operations = {
	.read		= environ_read,
};

L
Linus Torvalds 已提交
984 985 986
static ssize_t oom_adjust_read(struct file *file, char __user *buf,
				size_t count, loff_t *ppos)
{
987
	struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
988
	char buffer[PROC_NUMBUF];
L
Linus Torvalds 已提交
989
	size_t len;
990
	int oom_adjust;
L
Linus Torvalds 已提交
991

992 993 994 995 996
	if (!task)
		return -ESRCH;
	oom_adjust = task->oomkilladj;
	put_task_struct(task);

997
	len = snprintf(buffer, sizeof(buffer), "%i\n", oom_adjust);
998 999

	return simple_read_from_buffer(buf, count, ppos, buffer, len);
L
Linus Torvalds 已提交
1000 1001 1002 1003 1004
}

static ssize_t oom_adjust_write(struct file *file, const char __user *buf,
				size_t count, loff_t *ppos)
{
1005
	struct task_struct *task;
1006
	char buffer[PROC_NUMBUF], *end;
L
Linus Torvalds 已提交
1007 1008
	int oom_adjust;

1009 1010 1011
	memset(buffer, 0, sizeof(buffer));
	if (count > sizeof(buffer) - 1)
		count = sizeof(buffer) - 1;
L
Linus Torvalds 已提交
1012 1013 1014
	if (copy_from_user(buffer, buf, count))
		return -EFAULT;
	oom_adjust = simple_strtol(buffer, &end, 0);
1015 1016
	if ((oom_adjust < OOM_ADJUST_MIN || oom_adjust > OOM_ADJUST_MAX) &&
	     oom_adjust != OOM_DISABLE)
L
Linus Torvalds 已提交
1017 1018 1019
		return -EINVAL;
	if (*end == '\n')
		end++;
1020
	task = get_proc_task(file->f_path.dentry->d_inode);
1021 1022
	if (!task)
		return -ESRCH;
1023 1024 1025 1026
	if (oom_adjust < task->oomkilladj && !capable(CAP_SYS_RESOURCE)) {
		put_task_struct(task);
		return -EACCES;
	}
L
Linus Torvalds 已提交
1027
	task->oomkilladj = oom_adjust;
1028
	put_task_struct(task);
L
Linus Torvalds 已提交
1029 1030 1031 1032 1033
	if (end - buffer == 0)
		return -EIO;
	return end - buffer;
}

1034
static const struct file_operations proc_oom_adjust_operations = {
L
Linus Torvalds 已提交
1035 1036 1037 1038 1039 1040 1041 1042 1043
	.read		= oom_adjust_read,
	.write		= oom_adjust_write,
};

#ifdef CONFIG_AUDITSYSCALL
#define TMPBUFLEN 21
static ssize_t proc_loginuid_read(struct file * file, char __user * buf,
				  size_t count, loff_t *ppos)
{
1044
	struct inode * inode = file->f_path.dentry->d_inode;
1045
	struct task_struct *task = get_proc_task(inode);
L
Linus Torvalds 已提交
1046 1047 1048
	ssize_t length;
	char tmpbuf[TMPBUFLEN];

1049 1050
	if (!task)
		return -ESRCH;
L
Linus Torvalds 已提交
1051
	length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
1052
				audit_get_loginuid(task));
1053
	put_task_struct(task);
L
Linus Torvalds 已提交
1054 1055 1056 1057 1058 1059
	return simple_read_from_buffer(buf, count, ppos, tmpbuf, length);
}

static ssize_t proc_loginuid_write(struct file * file, const char __user * buf,
				   size_t count, loff_t *ppos)
{
1060
	struct inode * inode = file->f_path.dentry->d_inode;
L
Linus Torvalds 已提交
1061 1062 1063 1064 1065 1066 1067
	char *page, *tmp;
	ssize_t length;
	uid_t loginuid;

	if (!capable(CAP_AUDIT_CONTROL))
		return -EPERM;

1068
	if (current != pid_task(proc_pid(inode), PIDTYPE_PID))
L
Linus Torvalds 已提交
1069 1070
		return -EPERM;

1071 1072
	if (count >= PAGE_SIZE)
		count = PAGE_SIZE - 1;
L
Linus Torvalds 已提交
1073 1074 1075 1076 1077

	if (*ppos != 0) {
		/* No partial writes. */
		return -EINVAL;
	}
1078
	page = (char*)__get_free_page(GFP_TEMPORARY);
L
Linus Torvalds 已提交
1079 1080 1081 1082 1083 1084
	if (!page)
		return -ENOMEM;
	length = -EFAULT;
	if (copy_from_user(page, buf, count))
		goto out_free_page;

1085
	page[count] = '\0';
L
Linus Torvalds 已提交
1086 1087 1088 1089 1090 1091
	loginuid = simple_strtoul(page, &tmp, 10);
	if (tmp == page) {
		length = -EINVAL;
		goto out_free_page;

	}
1092
	length = audit_set_loginuid(current, loginuid);
L
Linus Torvalds 已提交
1093 1094 1095 1096 1097 1098 1099 1100
	if (likely(length == 0))
		length = count;

out_free_page:
	free_page((unsigned long) page);
	return length;
}

1101
static const struct file_operations proc_loginuid_operations = {
L
Linus Torvalds 已提交
1102 1103 1104
	.read		= proc_loginuid_read,
	.write		= proc_loginuid_write,
};
1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124

static ssize_t proc_sessionid_read(struct file * file, char __user * buf,
				  size_t count, loff_t *ppos)
{
	struct inode * inode = file->f_path.dentry->d_inode;
	struct task_struct *task = get_proc_task(inode);
	ssize_t length;
	char tmpbuf[TMPBUFLEN];

	if (!task)
		return -ESRCH;
	length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
				audit_get_sessionid(task));
	put_task_struct(task);
	return simple_read_from_buffer(buf, count, ppos, tmpbuf, length);
}

static const struct file_operations proc_sessionid_operations = {
	.read		= proc_sessionid_read,
};
L
Linus Torvalds 已提交
1125 1126
#endif

1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141
#ifdef CONFIG_FAULT_INJECTION
static ssize_t proc_fault_inject_read(struct file * file, char __user * buf,
				      size_t count, loff_t *ppos)
{
	struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
	char buffer[PROC_NUMBUF];
	size_t len;
	int make_it_fail;

	if (!task)
		return -ESRCH;
	make_it_fail = task->make_it_fail;
	put_task_struct(task);

	len = snprintf(buffer, sizeof(buffer), "%i\n", make_it_fail);
1142 1143

	return simple_read_from_buffer(buf, count, ppos, buffer, len);
1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172
}

static ssize_t proc_fault_inject_write(struct file * file,
			const char __user * buf, size_t count, loff_t *ppos)
{
	struct task_struct *task;
	char buffer[PROC_NUMBUF], *end;
	int make_it_fail;

	if (!capable(CAP_SYS_RESOURCE))
		return -EPERM;
	memset(buffer, 0, sizeof(buffer));
	if (count > sizeof(buffer) - 1)
		count = sizeof(buffer) - 1;
	if (copy_from_user(buffer, buf, count))
		return -EFAULT;
	make_it_fail = simple_strtol(buffer, &end, 0);
	if (*end == '\n')
		end++;
	task = get_proc_task(file->f_dentry->d_inode);
	if (!task)
		return -ESRCH;
	task->make_it_fail = make_it_fail;
	put_task_struct(task);
	if (end - buffer == 0)
		return -EIO;
	return end - buffer;
}

1173
static const struct file_operations proc_fault_inject_operations = {
1174 1175 1176 1177 1178
	.read		= proc_fault_inject_read,
	.write		= proc_fault_inject_write,
};
#endif

A
Arjan van de Ven 已提交
1179

I
Ingo Molnar 已提交
1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237
#ifdef CONFIG_SCHED_DEBUG
/*
 * Print out various scheduling related per-task fields:
 */
static int sched_show(struct seq_file *m, void *v)
{
	struct inode *inode = m->private;
	struct task_struct *p;

	WARN_ON(!inode);

	p = get_proc_task(inode);
	if (!p)
		return -ESRCH;
	proc_sched_show_task(p, m);

	put_task_struct(p);

	return 0;
}

static ssize_t
sched_write(struct file *file, const char __user *buf,
	    size_t count, loff_t *offset)
{
	struct inode *inode = file->f_path.dentry->d_inode;
	struct task_struct *p;

	WARN_ON(!inode);

	p = get_proc_task(inode);
	if (!p)
		return -ESRCH;
	proc_sched_set_task(p);

	put_task_struct(p);

	return count;
}

static int sched_open(struct inode *inode, struct file *filp)
{
	int ret;

	ret = single_open(filp, sched_show, NULL);
	if (!ret) {
		struct seq_file *m = filp->private_data;

		m->private = inode;
	}
	return ret;
}

static const struct file_operations proc_pid_sched_operations = {
	.open		= sched_open,
	.read		= seq_read,
	.write		= sched_write,
	.llseek		= seq_lseek,
1238
	.release	= single_release,
I
Ingo Molnar 已提交
1239 1240 1241 1242
};

#endif

M
Matt Helsley 已提交
1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317
/*
 * We added or removed a vma mapping the executable. The vmas are only mapped
 * during exec and are not mapped with the mmap system call.
 * Callers must hold down_write() on the mm's mmap_sem for these
 */
void added_exe_file_vma(struct mm_struct *mm)
{
	mm->num_exe_file_vmas++;
}

void removed_exe_file_vma(struct mm_struct *mm)
{
	mm->num_exe_file_vmas--;
	if ((mm->num_exe_file_vmas == 0) && mm->exe_file){
		fput(mm->exe_file);
		mm->exe_file = NULL;
	}

}

void set_mm_exe_file(struct mm_struct *mm, struct file *new_exe_file)
{
	if (new_exe_file)
		get_file(new_exe_file);
	if (mm->exe_file)
		fput(mm->exe_file);
	mm->exe_file = new_exe_file;
	mm->num_exe_file_vmas = 0;
}

struct file *get_mm_exe_file(struct mm_struct *mm)
{
	struct file *exe_file;

	/* We need mmap_sem to protect against races with removal of
	 * VM_EXECUTABLE vmas */
	down_read(&mm->mmap_sem);
	exe_file = mm->exe_file;
	if (exe_file)
		get_file(exe_file);
	up_read(&mm->mmap_sem);
	return exe_file;
}

void dup_mm_exe_file(struct mm_struct *oldmm, struct mm_struct *newmm)
{
	/* It's safe to write the exe_file pointer without exe_file_lock because
	 * this is called during fork when the task is not yet in /proc */
	newmm->exe_file = get_mm_exe_file(oldmm);
}

static int proc_exe_link(struct inode *inode, struct path *exe_path)
{
	struct task_struct *task;
	struct mm_struct *mm;
	struct file *exe_file;

	task = get_proc_task(inode);
	if (!task)
		return -ENOENT;
	mm = get_task_mm(task);
	put_task_struct(task);
	if (!mm)
		return -ENOENT;
	exe_file = get_mm_exe_file(mm);
	mmput(mm);
	if (exe_file) {
		*exe_path = exe_file->f_path;
		path_get(&exe_file->f_path);
		fput(exe_file);
		return 0;
	} else
		return -ENOENT;
}

1318
static void *proc_pid_follow_link(struct dentry *dentry, struct nameidata *nd)
L
Linus Torvalds 已提交
1319 1320 1321 1322 1323
{
	struct inode *inode = dentry->d_inode;
	int error = -EACCES;

	/* We don't need a base pointer in the /proc filesystem */
J
Jan Blunck 已提交
1324
	path_put(&nd->path);
L
Linus Torvalds 已提交
1325

1326 1327
	/* Are we allowed to snoop on the tasks file descriptors? */
	if (!proc_fd_access_allowed(inode))
L
Linus Torvalds 已提交
1328 1329
		goto out;

1330
	error = PROC_I(inode)->op.proc_get_link(inode, &nd->path);
L
Linus Torvalds 已提交
1331 1332
	nd->last_type = LAST_BIND;
out:
1333
	return ERR_PTR(error);
L
Linus Torvalds 已提交
1334 1335
}

1336
static int do_proc_readlink(struct path *path, char __user *buffer, int buflen)
L
Linus Torvalds 已提交
1337
{
1338
	char *tmp = (char*)__get_free_page(GFP_TEMPORARY);
1339
	char *pathname;
L
Linus Torvalds 已提交
1340 1341 1342 1343
	int len;

	if (!tmp)
		return -ENOMEM;
1344

1345
	pathname = d_path(path, tmp, PAGE_SIZE);
1346 1347
	len = PTR_ERR(pathname);
	if (IS_ERR(pathname))
L
Linus Torvalds 已提交
1348
		goto out;
1349
	len = tmp + PAGE_SIZE - 1 - pathname;
L
Linus Torvalds 已提交
1350 1351 1352

	if (len > buflen)
		len = buflen;
1353
	if (copy_to_user(buffer, pathname, len))
L
Linus Torvalds 已提交
1354 1355 1356 1357 1358 1359 1360 1361 1362 1363
		len = -EFAULT;
 out:
	free_page((unsigned long)tmp);
	return len;
}

static int proc_pid_readlink(struct dentry * dentry, char __user * buffer, int buflen)
{
	int error = -EACCES;
	struct inode *inode = dentry->d_inode;
1364
	struct path path;
L
Linus Torvalds 已提交
1365

1366 1367
	/* Are we allowed to snoop on the tasks file descriptors? */
	if (!proc_fd_access_allowed(inode))
L
Linus Torvalds 已提交
1368 1369
		goto out;

1370
	error = PROC_I(inode)->op.proc_get_link(inode, &path);
L
Linus Torvalds 已提交
1371 1372 1373
	if (error)
		goto out;

1374 1375
	error = do_proc_readlink(&path, buffer, buflen);
	path_put(&path);
L
Linus Torvalds 已提交
1376 1377 1378 1379
out:
	return error;
}

1380
static const struct inode_operations proc_pid_link_inode_operations = {
L
Linus Torvalds 已提交
1381
	.readlink	= proc_pid_readlink,
1382 1383
	.follow_link	= proc_pid_follow_link,
	.setattr	= proc_setattr,
L
Linus Torvalds 已提交
1384 1385
};

1386 1387 1388 1389

/* building an inode */

static int task_dumpable(struct task_struct *task)
L
Linus Torvalds 已提交
1390
{
1391 1392
	int dumpable = 0;
	struct mm_struct *mm;
L
Linus Torvalds 已提交
1393

1394 1395 1396
	task_lock(task);
	mm = task->mm;
	if (mm)
1397
		dumpable = get_dumpable(mm);
1398 1399 1400 1401 1402
	task_unlock(task);
	if(dumpable == 1)
		return 1;
	return 0;
}
L
Linus Torvalds 已提交
1403 1404


1405
static struct inode *proc_pid_make_inode(struct super_block * sb, struct task_struct *task)
1406 1407 1408
{
	struct inode * inode;
	struct proc_inode *ei;
L
Linus Torvalds 已提交
1409

1410
	/* We need a new inode */
L
Linus Torvalds 已提交
1411

1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423
	inode = new_inode(sb);
	if (!inode)
		goto out;

	/* Common stuff */
	ei = PROC_I(inode);
	inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
	inode->i_op = &proc_def_inode_operations;

	/*
	 * grab the reference to task.
	 */
1424
	ei->pid = get_task_pid(task, PIDTYPE_PID);
1425 1426 1427 1428 1429 1430 1431 1432
	if (!ei->pid)
		goto out_unlock;

	inode->i_uid = 0;
	inode->i_gid = 0;
	if (task_dumpable(task)) {
		inode->i_uid = task->euid;
		inode->i_gid = task->egid;
L
Linus Torvalds 已提交
1433
	}
1434 1435
	security_task_to_inode(task, inode);

L
Linus Torvalds 已提交
1436
out:
1437 1438 1439 1440 1441
	return inode;

out_unlock:
	iput(inode);
	return NULL;
L
Linus Torvalds 已提交
1442 1443
}

1444
static int pid_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
L
Linus Torvalds 已提交
1445 1446
{
	struct inode *inode = dentry->d_inode;
1447 1448
	struct task_struct *task;
	generic_fillattr(inode, stat);
L
Linus Torvalds 已提交
1449

1450 1451 1452 1453 1454 1455 1456 1457 1458
	rcu_read_lock();
	stat->uid = 0;
	stat->gid = 0;
	task = pid_task(proc_pid(inode), PIDTYPE_PID);
	if (task) {
		if ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||
		    task_dumpable(task)) {
			stat->uid = task->euid;
			stat->gid = task->egid;
L
Linus Torvalds 已提交
1459 1460
		}
	}
1461
	rcu_read_unlock();
A
Alan Cox 已提交
1462
	return 0;
L
Linus Torvalds 已提交
1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473
}

/* dentry stuff */

/*
 *	Exceptional case: normally we are not allowed to unhash a busy
 * directory. In this case, however, we can do it - no aliasing problems
 * due to the way we treat inodes.
 *
 * Rewrite the inode's ownerships here because the owning task may have
 * performed a setuid(), etc.
1474 1475 1476 1477 1478 1479 1480
 *
 * Before the /proc/pid/status file was created the only way to read
 * the effective uid of a /process was to stat /proc/pid.  Reading
 * /proc/pid/status is slow enough that procps and other packages
 * kept stating /proc/pid.  To keep the rules in /proc simple I have
 * made this apply to all per process world readable and executable
 * directories.
L
Linus Torvalds 已提交
1481 1482 1483 1484
 */
static int pid_revalidate(struct dentry *dentry, struct nameidata *nd)
{
	struct inode *inode = dentry->d_inode;
1485 1486 1487 1488
	struct task_struct *task = get_proc_task(inode);
	if (task) {
		if ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||
		    task_dumpable(task)) {
L
Linus Torvalds 已提交
1489 1490 1491 1492 1493 1494
			inode->i_uid = task->euid;
			inode->i_gid = task->egid;
		} else {
			inode->i_uid = 0;
			inode->i_gid = 0;
		}
L
Linus Torvalds 已提交
1495
		inode->i_mode &= ~(S_ISUID | S_ISGID);
L
Linus Torvalds 已提交
1496
		security_task_to_inode(task, inode);
1497
		put_task_struct(task);
L
Linus Torvalds 已提交
1498 1499 1500 1501 1502 1503
		return 1;
	}
	d_drop(dentry);
	return 0;
}

1504
static int pid_delete_dentry(struct dentry * dentry)
1505
{
1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520
	/* Is the task we represent dead?
	 * If so, then don't put the dentry on the lru list,
	 * kill it immediately.
	 */
	return !proc_pid(dentry->d_inode)->tasks[PIDTYPE_PID].first;
}

static struct dentry_operations pid_dentry_operations =
{
	.d_revalidate	= pid_revalidate,
	.d_delete	= pid_delete_dentry,
};

/* Lookups */

1521 1522
typedef struct dentry *instantiate_t(struct inode *, struct dentry *,
				struct task_struct *, const void *);
1523

1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535
/*
 * Fill a directory entry.
 *
 * If possible create the dcache entry and derive our inode number and
 * file type from dcache entry.
 *
 * Since all of the proc inode numbers are dynamically generated, the inode
 * numbers do not exist until the inode is cache.  This means creating the
 * the dcache entry in readdir is necessary to keep the inode numbers
 * reported by readdir in sync with the inode numbers reported
 * by stat.
 */
1536 1537
static int proc_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
	char *name, int len,
1538
	instantiate_t instantiate, struct task_struct *task, const void *ptr)
1539
{
1540
	struct dentry *child, *dir = filp->f_path.dentry;
1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577
	struct inode *inode;
	struct qstr qname;
	ino_t ino = 0;
	unsigned type = DT_UNKNOWN;

	qname.name = name;
	qname.len  = len;
	qname.hash = full_name_hash(name, len);

	child = d_lookup(dir, &qname);
	if (!child) {
		struct dentry *new;
		new = d_alloc(dir, &qname);
		if (new) {
			child = instantiate(dir->d_inode, new, task, ptr);
			if (child)
				dput(new);
			else
				child = new;
		}
	}
	if (!child || IS_ERR(child) || !child->d_inode)
		goto end_instantiate;
	inode = child->d_inode;
	if (inode) {
		ino = inode->i_ino;
		type = inode->i_mode >> 12;
	}
	dput(child);
end_instantiate:
	if (!ino)
		ino = find_inode_number(dir, &qname);
	if (!ino)
		ino = 1;
	return filldir(dirent, name, len, filp->f_pos, ino, type);
}

1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599
static unsigned name_to_int(struct dentry *dentry)
{
	const char *name = dentry->d_name.name;
	int len = dentry->d_name.len;
	unsigned n = 0;

	if (len > 1 && *name == '0')
		goto out;
	while (len-- > 0) {
		unsigned c = *name++ - '0';
		if (c > 9)
			goto out;
		if (n >= (~0U-9)/10)
			goto out;
		n *= 10;
		n += c;
	}
	return n;
out:
	return ~0U;
}

M
Miklos Szeredi 已提交
1600 1601
#define PROC_FDINFO_MAX 64

1602
static int proc_fd_info(struct inode *inode, struct path *path, char *info)
1603 1604 1605 1606 1607
{
	struct task_struct *task = get_proc_task(inode);
	struct files_struct *files = NULL;
	struct file *file;
	int fd = proc_fd(inode);
1608 1609

	if (task) {
1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620
		files = get_files_struct(task);
		put_task_struct(task);
	}
	if (files) {
		/*
		 * We are not taking a ref to the file structure, so we must
		 * hold ->file_lock.
		 */
		spin_lock(&files->file_lock);
		file = fcheck_files(files, fd);
		if (file) {
1621 1622 1623 1624
			if (path) {
				*path = file->f_path;
				path_get(&file->f_path);
			}
M
Miklos Szeredi 已提交
1625 1626 1627 1628 1629 1630
			if (info)
				snprintf(info, PROC_FDINFO_MAX,
					 "pos:\t%lli\n"
					 "flags:\t0%o\n",
					 (long long) file->f_pos,
					 file->f_flags);
1631 1632 1633
			spin_unlock(&files->file_lock);
			put_files_struct(files);
			return 0;
1634
		}
1635 1636
		spin_unlock(&files->file_lock);
		put_files_struct(files);
1637
	}
1638
	return -ENOENT;
1639 1640
}

1641
static int proc_fd_link(struct inode *inode, struct path *path)
M
Miklos Szeredi 已提交
1642
{
1643
	return proc_fd_info(inode, path, NULL);
M
Miklos Szeredi 已提交
1644 1645
}

L
Linus Torvalds 已提交
1646 1647 1648
static int tid_fd_revalidate(struct dentry *dentry, struct nameidata *nd)
{
	struct inode *inode = dentry->d_inode;
1649
	struct task_struct *task = get_proc_task(inode);
1650
	int fd = proc_fd(inode);
L
Linus Torvalds 已提交
1651 1652
	struct files_struct *files;

1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666
	if (task) {
		files = get_files_struct(task);
		if (files) {
			rcu_read_lock();
			if (fcheck_files(files, fd)) {
				rcu_read_unlock();
				put_files_struct(files);
				if (task_dumpable(task)) {
					inode->i_uid = task->euid;
					inode->i_gid = task->egid;
				} else {
					inode->i_uid = 0;
					inode->i_gid = 0;
				}
L
Linus Torvalds 已提交
1667
				inode->i_mode &= ~(S_ISUID | S_ISGID);
1668 1669 1670 1671
				security_task_to_inode(task, inode);
				put_task_struct(task);
				return 1;
			}
1672
			rcu_read_unlock();
L
Linus Torvalds 已提交
1673 1674
			put_files_struct(files);
		}
1675
		put_task_struct(task);
L
Linus Torvalds 已提交
1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686
	}
	d_drop(dentry);
	return 0;
}

static struct dentry_operations tid_fd_dentry_operations =
{
	.d_revalidate	= tid_fd_revalidate,
	.d_delete	= pid_delete_dentry,
};

1687
static struct dentry *proc_fd_instantiate(struct inode *dir,
1688
	struct dentry *dentry, struct task_struct *task, const void *ptr)
L
Linus Torvalds 已提交
1689
{
1690
	unsigned fd = *(const unsigned *)ptr;
1691 1692 1693 1694 1695
	struct file *file;
	struct files_struct *files;
 	struct inode *inode;
 	struct proc_inode *ei;
	struct dentry *error = ERR_PTR(-ENOENT);
L
Linus Torvalds 已提交
1696

1697
	inode = proc_pid_make_inode(dir->i_sb, task);
L
Linus Torvalds 已提交
1698 1699 1700
	if (!inode)
		goto out;
	ei = PROC_I(inode);
1701
	ei->fd = fd;
L
Linus Torvalds 已提交
1702 1703
	files = get_files_struct(task);
	if (!files)
1704
		goto out_iput;
L
Linus Torvalds 已提交
1705
	inode->i_mode = S_IFLNK;
1706 1707 1708 1709 1710 1711

	/*
	 * We are not taking a ref to the file structure, so we must
	 * hold ->file_lock.
	 */
	spin_lock(&files->file_lock);
L
Linus Torvalds 已提交
1712 1713
	file = fcheck_files(files, fd);
	if (!file)
1714
		goto out_unlock;
1715
	if (file->f_mode & FMODE_READ)
L
Linus Torvalds 已提交
1716
		inode->i_mode |= S_IRUSR | S_IXUSR;
1717
	if (file->f_mode & FMODE_WRITE)
L
Linus Torvalds 已提交
1718
		inode->i_mode |= S_IWUSR | S_IXUSR;
1719
	spin_unlock(&files->file_lock);
L
Linus Torvalds 已提交
1720
	put_files_struct(files);
1721

L
Linus Torvalds 已提交
1722 1723 1724 1725 1726
	inode->i_op = &proc_pid_link_inode_operations;
	inode->i_size = 64;
	ei->op.proc_get_link = proc_fd_link;
	dentry->d_op = &tid_fd_dentry_operations;
	d_add(dentry, inode);
1727 1728
	/* Close the race of the process dying before we return the dentry */
	if (tid_fd_revalidate(dentry, NULL))
1729
		error = NULL;
L
Linus Torvalds 已提交
1730

1731 1732 1733
 out:
	return error;
out_unlock:
1734
	spin_unlock(&files->file_lock);
L
Linus Torvalds 已提交
1735
	put_files_struct(files);
1736
out_iput:
L
Linus Torvalds 已提交
1737
	iput(inode);
1738
	goto out;
L
Linus Torvalds 已提交
1739 1740
}

M
Miklos Szeredi 已提交
1741 1742 1743
static struct dentry *proc_lookupfd_common(struct inode *dir,
					   struct dentry *dentry,
					   instantiate_t instantiate)
1744 1745 1746 1747 1748 1749 1750 1751 1752 1753
{
	struct task_struct *task = get_proc_task(dir);
	unsigned fd = name_to_int(dentry);
	struct dentry *result = ERR_PTR(-ENOENT);

	if (!task)
		goto out_no_task;
	if (fd == ~0U)
		goto out;

M
Miklos Szeredi 已提交
1754
	result = instantiate(dir, dentry, task, &fd);
1755 1756 1757 1758 1759 1760
out:
	put_task_struct(task);
out_no_task:
	return result;
}

M
Miklos Szeredi 已提交
1761 1762
static int proc_readfd_common(struct file * filp, void * dirent,
			      filldir_t filldir, instantiate_t instantiate)
1763
{
1764
	struct dentry *dentry = filp->f_path.dentry;
1765 1766
	struct inode *inode = dentry->d_inode;
	struct task_struct *p = get_proc_task(inode);
1767
	unsigned int fd, ino;
1768 1769
	int retval;
	struct files_struct * files;
L
Linus Torvalds 已提交
1770

1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792
	retval = -ENOENT;
	if (!p)
		goto out_no_task;
	retval = 0;

	fd = filp->f_pos;
	switch (fd) {
		case 0:
			if (filldir(dirent, ".", 1, 0, inode->i_ino, DT_DIR) < 0)
				goto out;
			filp->f_pos++;
		case 1:
			ino = parent_ino(dentry);
			if (filldir(dirent, "..", 2, 1, ino, DT_DIR) < 0)
				goto out;
			filp->f_pos++;
		default:
			files = get_files_struct(p);
			if (!files)
				goto out;
			rcu_read_lock();
			for (fd = filp->f_pos-2;
A
Al Viro 已提交
1793
			     fd < files_fdtable(files)->max_fds;
1794
			     fd++, filp->f_pos++) {
M
Miklos Szeredi 已提交
1795 1796
				char name[PROC_NUMBUF];
				int len;
1797 1798 1799 1800 1801

				if (!fcheck_files(files, fd))
					continue;
				rcu_read_unlock();

M
Miklos Szeredi 已提交
1802 1803 1804 1805
				len = snprintf(name, sizeof(name), "%d", fd);
				if (proc_fill_cache(filp, dirent, filldir,
						    name, len, instantiate,
						    p, &fd) < 0) {
1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819
					rcu_read_lock();
					break;
				}
				rcu_read_lock();
			}
			rcu_read_unlock();
			put_files_struct(files);
	}
out:
	put_task_struct(p);
out_no_task:
	return retval;
}

M
Miklos Szeredi 已提交
1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834
static struct dentry *proc_lookupfd(struct inode *dir, struct dentry *dentry,
				    struct nameidata *nd)
{
	return proc_lookupfd_common(dir, dentry, proc_fd_instantiate);
}

static int proc_readfd(struct file *filp, void *dirent, filldir_t filldir)
{
	return proc_readfd_common(filp, dirent, filldir, proc_fd_instantiate);
}

static ssize_t proc_fdinfo_read(struct file *file, char __user *buf,
				      size_t len, loff_t *ppos)
{
	char tmp[PROC_FDINFO_MAX];
1835
	int err = proc_fd_info(file->f_path.dentry->d_inode, NULL, tmp);
M
Miklos Szeredi 已提交
1836 1837 1838 1839 1840 1841 1842 1843 1844 1845
	if (!err)
		err = simple_read_from_buffer(buf, len, ppos, tmp, strlen(tmp));
	return err;
}

static const struct file_operations proc_fdinfo_file_operations = {
	.open		= nonseekable_open,
	.read		= proc_fdinfo_read,
};

1846
static const struct file_operations proc_fd_operations = {
1847 1848
	.read		= generic_read_dir,
	.readdir	= proc_readfd,
L
Linus Torvalds 已提交
1849 1850
};

1851 1852 1853 1854
/*
 * /proc/pid/fd needs a special permission handler so that a process can still
 * access /proc/self/fd after it has executed a setuid().
 */
1855
static int proc_fd_permission(struct inode *inode, int mask)
1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866
{
	int rv;

	rv = generic_permission(inode, mask, NULL);
	if (rv == 0)
		return 0;
	if (task_pid(current) == proc_pid(inode))
		rv = 0;
	return rv;
}

L
Linus Torvalds 已提交
1867 1868 1869
/*
 * proc directories can do almost nothing..
 */
1870
static const struct inode_operations proc_fd_inode_operations = {
L
Linus Torvalds 已提交
1871
	.lookup		= proc_lookupfd,
1872
	.permission	= proc_fd_permission,
1873
	.setattr	= proc_setattr,
L
Linus Torvalds 已提交
1874 1875
};

M
Miklos Szeredi 已提交
1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927
static struct dentry *proc_fdinfo_instantiate(struct inode *dir,
	struct dentry *dentry, struct task_struct *task, const void *ptr)
{
	unsigned fd = *(unsigned *)ptr;
 	struct inode *inode;
 	struct proc_inode *ei;
	struct dentry *error = ERR_PTR(-ENOENT);

	inode = proc_pid_make_inode(dir->i_sb, task);
	if (!inode)
		goto out;
	ei = PROC_I(inode);
	ei->fd = fd;
	inode->i_mode = S_IFREG | S_IRUSR;
	inode->i_fop = &proc_fdinfo_file_operations;
	dentry->d_op = &tid_fd_dentry_operations;
	d_add(dentry, inode);
	/* Close the race of the process dying before we return the dentry */
	if (tid_fd_revalidate(dentry, NULL))
		error = NULL;

 out:
	return error;
}

static struct dentry *proc_lookupfdinfo(struct inode *dir,
					struct dentry *dentry,
					struct nameidata *nd)
{
	return proc_lookupfd_common(dir, dentry, proc_fdinfo_instantiate);
}

static int proc_readfdinfo(struct file *filp, void *dirent, filldir_t filldir)
{
	return proc_readfd_common(filp, dirent, filldir,
				  proc_fdinfo_instantiate);
}

static const struct file_operations proc_fdinfo_operations = {
	.read		= generic_read_dir,
	.readdir	= proc_readfdinfo,
};

/*
 * proc directories can do almost nothing..
 */
static const struct inode_operations proc_fdinfo_inode_operations = {
	.lookup		= proc_lookupfdinfo,
	.setattr	= proc_setattr,
};


1928
static struct dentry *proc_pident_instantiate(struct inode *dir,
1929
	struct dentry *dentry, struct task_struct *task, const void *ptr)
1930
{
1931
	const struct pid_entry *p = ptr;
1932 1933 1934 1935
	struct inode *inode;
	struct proc_inode *ei;
	struct dentry *error = ERR_PTR(-EINVAL);

1936
	inode = proc_pid_make_inode(dir->i_sb, task);
1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957
	if (!inode)
		goto out;

	ei = PROC_I(inode);
	inode->i_mode = p->mode;
	if (S_ISDIR(inode->i_mode))
		inode->i_nlink = 2;	/* Use getattr to fix if necessary */
	if (p->iop)
		inode->i_op = p->iop;
	if (p->fop)
		inode->i_fop = p->fop;
	ei->op = p->op;
	dentry->d_op = &pid_dentry_operations;
	d_add(dentry, inode);
	/* Close the race of the process dying before we return the dentry */
	if (pid_revalidate(dentry, NULL))
		error = NULL;
out:
	return error;
}

L
Linus Torvalds 已提交
1958 1959
static struct dentry *proc_pident_lookup(struct inode *dir, 
					 struct dentry *dentry,
1960
					 const struct pid_entry *ents,
1961
					 unsigned int nents)
L
Linus Torvalds 已提交
1962 1963
{
	struct inode *inode;
1964
	struct dentry *error;
1965
	struct task_struct *task = get_proc_task(dir);
1966
	const struct pid_entry *p, *last;
L
Linus Torvalds 已提交
1967

1968
	error = ERR_PTR(-ENOENT);
L
Linus Torvalds 已提交
1969 1970
	inode = NULL;

1971 1972
	if (!task)
		goto out_no_task;
L
Linus Torvalds 已提交
1973

1974 1975 1976 1977
	/*
	 * Yes, it does not scale. And it should not. Don't add
	 * new entries into /proc/<tgid>/ without very good reasons.
	 */
1978 1979
	last = &ents[nents - 1];
	for (p = ents; p <= last; p++) {
L
Linus Torvalds 已提交
1980 1981 1982 1983 1984
		if (p->len != dentry->d_name.len)
			continue;
		if (!memcmp(dentry->d_name.name, p->name, p->len))
			break;
	}
1985
	if (p > last)
L
Linus Torvalds 已提交
1986 1987
		goto out;

1988
	error = proc_pident_instantiate(dir, dentry, task, p);
L
Linus Torvalds 已提交
1989
out:
1990 1991
	put_task_struct(task);
out_no_task:
1992
	return error;
L
Linus Torvalds 已提交
1993 1994
}

1995 1996
static int proc_pident_fill_cache(struct file *filp, void *dirent,
	filldir_t filldir, struct task_struct *task, const struct pid_entry *p)
1997 1998 1999 2000 2001
{
	return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
				proc_pident_instantiate, task, p);
}

2002 2003
static int proc_pident_readdir(struct file *filp,
		void *dirent, filldir_t filldir,
2004
		const struct pid_entry *ents, unsigned int nents)
2005 2006
{
	int i;
2007
	struct dentry *dentry = filp->f_path.dentry;
2008 2009
	struct inode *inode = dentry->d_inode;
	struct task_struct *task = get_proc_task(inode);
2010
	const struct pid_entry *p, *last;
2011 2012 2013 2014 2015
	ino_t ino;
	int ret;

	ret = -ENOENT;
	if (!task)
2016
		goto out_no_task;
2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041

	ret = 0;
	i = filp->f_pos;
	switch (i) {
	case 0:
		ino = inode->i_ino;
		if (filldir(dirent, ".", 1, i, ino, DT_DIR) < 0)
			goto out;
		i++;
		filp->f_pos++;
		/* fall through */
	case 1:
		ino = parent_ino(dentry);
		if (filldir(dirent, "..", 2, i, ino, DT_DIR) < 0)
			goto out;
		i++;
		filp->f_pos++;
		/* fall through */
	default:
		i -= 2;
		if (i >= nents) {
			ret = 1;
			goto out;
		}
		p = ents + i;
2042 2043
		last = &ents[nents - 1];
		while (p <= last) {
2044
			if (proc_pident_fill_cache(filp, dirent, filldir, task, p) < 0)
2045 2046 2047 2048 2049 2050 2051 2052
				goto out;
			filp->f_pos++;
			p++;
		}
	}

	ret = 1;
out:
2053 2054
	put_task_struct(task);
out_no_task:
2055
	return ret;
L
Linus Torvalds 已提交
2056 2057
}

2058 2059 2060 2061
#ifdef CONFIG_SECURITY
static ssize_t proc_pid_attr_read(struct file * file, char __user * buf,
				  size_t count, loff_t *ppos)
{
2062
	struct inode * inode = file->f_path.dentry->d_inode;
2063
	char *p = NULL;
2064 2065 2066 2067
	ssize_t length;
	struct task_struct *task = get_proc_task(inode);

	if (!task)
2068
		return -ESRCH;
2069 2070

	length = security_getprocattr(task,
2071
				      (char*)file->f_path.dentry->d_name.name,
2072
				      &p);
2073
	put_task_struct(task);
2074 2075 2076
	if (length > 0)
		length = simple_read_from_buffer(buf, count, ppos, p, length);
	kfree(p);
2077
	return length;
L
Linus Torvalds 已提交
2078 2079
}

2080 2081 2082
static ssize_t proc_pid_attr_write(struct file * file, const char __user * buf,
				   size_t count, loff_t *ppos)
{
2083
	struct inode * inode = file->f_path.dentry->d_inode;
2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099
	char *page;
	ssize_t length;
	struct task_struct *task = get_proc_task(inode);

	length = -ESRCH;
	if (!task)
		goto out_no_task;
	if (count > PAGE_SIZE)
		count = PAGE_SIZE;

	/* No partial writes. */
	length = -EINVAL;
	if (*ppos != 0)
		goto out;

	length = -ENOMEM;
2100
	page = (char*)__get_free_page(GFP_TEMPORARY);
2101 2102 2103 2104 2105 2106 2107 2108
	if (!page)
		goto out;

	length = -EFAULT;
	if (copy_from_user(page, buf, count))
		goto out_free;

	length = security_setprocattr(task,
2109
				      (char*)file->f_path.dentry->d_name.name,
2110 2111 2112 2113 2114 2115 2116 2117 2118
				      (void*)page, count);
out_free:
	free_page((unsigned long) page);
out:
	put_task_struct(task);
out_no_task:
	return length;
}

2119
static const struct file_operations proc_pid_attr_operations = {
2120 2121 2122 2123
	.read		= proc_pid_attr_read,
	.write		= proc_pid_attr_write,
};

2124
static const struct pid_entry attr_dir_stuff[] = {
2125 2126 2127 2128 2129 2130
	REG("current",    S_IRUGO|S_IWUGO, pid_attr),
	REG("prev",       S_IRUGO,	   pid_attr),
	REG("exec",       S_IRUGO|S_IWUGO, pid_attr),
	REG("fscreate",   S_IRUGO|S_IWUGO, pid_attr),
	REG("keycreate",  S_IRUGO|S_IWUGO, pid_attr),
	REG("sockcreate", S_IRUGO|S_IWUGO, pid_attr),
2131 2132
};

2133
static int proc_attr_dir_readdir(struct file * filp,
2134 2135 2136
			     void * dirent, filldir_t filldir)
{
	return proc_pident_readdir(filp,dirent,filldir,
2137
				   attr_dir_stuff,ARRAY_SIZE(attr_dir_stuff));
2138 2139
}

2140
static const struct file_operations proc_attr_dir_operations = {
L
Linus Torvalds 已提交
2141
	.read		= generic_read_dir,
2142
	.readdir	= proc_attr_dir_readdir,
L
Linus Torvalds 已提交
2143 2144
};

2145
static struct dentry *proc_attr_dir_lookup(struct inode *dir,
2146 2147
				struct dentry *dentry, struct nameidata *nd)
{
2148 2149
	return proc_pident_lookup(dir, dentry,
				  attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff));
2150 2151
}

2152
static const struct inode_operations proc_attr_dir_inode_operations = {
2153
	.lookup		= proc_attr_dir_lookup,
2154
	.getattr	= pid_getattr,
2155
	.setattr	= proc_setattr,
L
Linus Torvalds 已提交
2156 2157
};

2158 2159
#endif

2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244
#if defined(USE_ELF_CORE_DUMP) && defined(CONFIG_ELF_CORE)
static ssize_t proc_coredump_filter_read(struct file *file, char __user *buf,
					 size_t count, loff_t *ppos)
{
	struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
	struct mm_struct *mm;
	char buffer[PROC_NUMBUF];
	size_t len;
	int ret;

	if (!task)
		return -ESRCH;

	ret = 0;
	mm = get_task_mm(task);
	if (mm) {
		len = snprintf(buffer, sizeof(buffer), "%08lx\n",
			       ((mm->flags & MMF_DUMP_FILTER_MASK) >>
				MMF_DUMP_FILTER_SHIFT));
		mmput(mm);
		ret = simple_read_from_buffer(buf, count, ppos, buffer, len);
	}

	put_task_struct(task);

	return ret;
}

static ssize_t proc_coredump_filter_write(struct file *file,
					  const char __user *buf,
					  size_t count,
					  loff_t *ppos)
{
	struct task_struct *task;
	struct mm_struct *mm;
	char buffer[PROC_NUMBUF], *end;
	unsigned int val;
	int ret;
	int i;
	unsigned long mask;

	ret = -EFAULT;
	memset(buffer, 0, sizeof(buffer));
	if (count > sizeof(buffer) - 1)
		count = sizeof(buffer) - 1;
	if (copy_from_user(buffer, buf, count))
		goto out_no_task;

	ret = -EINVAL;
	val = (unsigned int)simple_strtoul(buffer, &end, 0);
	if (*end == '\n')
		end++;
	if (end - buffer == 0)
		goto out_no_task;

	ret = -ESRCH;
	task = get_proc_task(file->f_dentry->d_inode);
	if (!task)
		goto out_no_task;

	ret = end - buffer;
	mm = get_task_mm(task);
	if (!mm)
		goto out_no_mm;

	for (i = 0, mask = 1; i < MMF_DUMP_FILTER_BITS; i++, mask <<= 1) {
		if (val & mask)
			set_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);
		else
			clear_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);
	}

	mmput(mm);
 out_no_mm:
	put_task_struct(task);
 out_no_task:
	return ret;
}

static const struct file_operations proc_coredump_filter_operations = {
	.read		= proc_coredump_filter_read,
	.write		= proc_coredump_filter_write,
};
#endif

2245 2246 2247 2248 2249 2250
/*
 * /proc/self:
 */
static int proc_self_readlink(struct dentry *dentry, char __user *buffer,
			      int buflen)
{
2251
	struct pid_namespace *ns = dentry->d_sb->s_fs_info;
2252
	pid_t tgid = task_tgid_nr_ns(current, ns);
2253
	char tmp[PROC_NUMBUF];
2254
	if (!tgid)
2255
		return -ENOENT;
2256
	sprintf(tmp, "%d", tgid);
2257 2258 2259 2260 2261
	return vfs_readlink(dentry,buffer,buflen,tmp);
}

static void *proc_self_follow_link(struct dentry *dentry, struct nameidata *nd)
{
2262
	struct pid_namespace *ns = dentry->d_sb->s_fs_info;
2263
	pid_t tgid = task_tgid_nr_ns(current, ns);
2264
	char tmp[PROC_NUMBUF];
2265
	if (!tgid)
2266
		return ERR_PTR(-ENOENT);
2267
	sprintf(tmp, "%d", task_tgid_nr_ns(current, ns));
2268 2269 2270
	return ERR_PTR(vfs_follow_link(nd,tmp));
}

2271
static const struct inode_operations proc_self_inode_operations = {
2272 2273 2274 2275
	.readlink	= proc_self_readlink,
	.follow_link	= proc_self_follow_link,
};

2276 2277 2278 2279 2280 2281 2282
/*
 * proc base
 *
 * These are the directory entries in the root directory of /proc
 * that properly belong to the /proc filesystem, as they describe
 * describe something that is process related.
 */
2283
static const struct pid_entry proc_base_stuff[] = {
2284
	NOD("self", S_IFLNK|S_IRWXUGO,
2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310
		&proc_self_inode_operations, NULL, {}),
};

/*
 *	Exceptional case: normally we are not allowed to unhash a busy
 * directory. In this case, however, we can do it - no aliasing problems
 * due to the way we treat inodes.
 */
static int proc_base_revalidate(struct dentry *dentry, struct nameidata *nd)
{
	struct inode *inode = dentry->d_inode;
	struct task_struct *task = get_proc_task(inode);
	if (task) {
		put_task_struct(task);
		return 1;
	}
	d_drop(dentry);
	return 0;
}

static struct dentry_operations proc_base_dentry_operations =
{
	.d_revalidate	= proc_base_revalidate,
	.d_delete	= pid_delete_dentry,
};

2311
static struct dentry *proc_base_instantiate(struct inode *dir,
2312
	struct dentry *dentry, struct task_struct *task, const void *ptr)
2313
{
2314
	const struct pid_entry *p = ptr;
2315 2316
	struct inode *inode;
	struct proc_inode *ei;
2317
	struct dentry *error = ERR_PTR(-EINVAL);
2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331

	/* Allocate the inode */
	error = ERR_PTR(-ENOMEM);
	inode = new_inode(dir->i_sb);
	if (!inode)
		goto out;

	/* Initialize the inode */
	ei = PROC_I(inode);
	inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;

	/*
	 * grab the reference to the task.
	 */
2332
	ei->pid = get_task_pid(task, PIDTYPE_PID);
2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357
	if (!ei->pid)
		goto out_iput;

	inode->i_uid = 0;
	inode->i_gid = 0;
	inode->i_mode = p->mode;
	if (S_ISDIR(inode->i_mode))
		inode->i_nlink = 2;
	if (S_ISLNK(inode->i_mode))
		inode->i_size = 64;
	if (p->iop)
		inode->i_op = p->iop;
	if (p->fop)
		inode->i_fop = p->fop;
	ei->op = p->op;
	dentry->d_op = &proc_base_dentry_operations;
	d_add(dentry, inode);
	error = NULL;
out:
	return error;
out_iput:
	iput(inode);
	goto out;
}

2358 2359 2360 2361
static struct dentry *proc_base_lookup(struct inode *dir, struct dentry *dentry)
{
	struct dentry *error;
	struct task_struct *task = get_proc_task(dir);
2362
	const struct pid_entry *p, *last;
2363 2364 2365 2366 2367 2368 2369

	error = ERR_PTR(-ENOENT);

	if (!task)
		goto out_no_task;

	/* Lookup the directory entry */
2370 2371
	last = &proc_base_stuff[ARRAY_SIZE(proc_base_stuff) - 1];
	for (p = proc_base_stuff; p <= last; p++) {
2372 2373 2374 2375 2376
		if (p->len != dentry->d_name.len)
			continue;
		if (!memcmp(dentry->d_name.name, p->name, p->len))
			break;
	}
2377
	if (p > last)
2378 2379 2380 2381 2382 2383 2384 2385 2386 2387
		goto out;

	error = proc_base_instantiate(dir, dentry, task, p);

out:
	put_task_struct(task);
out_no_task:
	return error;
}

2388 2389
static int proc_base_fill_cache(struct file *filp, void *dirent,
	filldir_t filldir, struct task_struct *task, const struct pid_entry *p)
2390 2391 2392 2393 2394
{
	return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
				proc_base_instantiate, task, p);
}

2395
#ifdef CONFIG_TASK_IO_ACCOUNTING
2396 2397
static int do_io_accounting(struct task_struct *task, char *buffer, int whole)
{
2398
	struct task_io_accounting acct = task->ioac;
2399 2400 2401 2402 2403 2404 2405 2406 2407 2408
	unsigned long flags;

	if (whole && lock_task_sighand(task, &flags)) {
		struct task_struct *t = task;

		task_io_accounting_add(&acct, &task->signal->ioac);
		while_each_thread(task, t)
			task_io_accounting_add(&acct, &t->ioac);

		unlock_task_sighand(task, &flags);
2409
	}
2410 2411 2412 2413 2414 2415 2416 2417
	return sprintf(buffer,
			"rchar: %llu\n"
			"wchar: %llu\n"
			"syscr: %llu\n"
			"syscw: %llu\n"
			"read_bytes: %llu\n"
			"write_bytes: %llu\n"
			"cancelled_write_bytes: %llu\n",
A
Alexander Beregalov 已提交
2418 2419 2420 2421 2422 2423 2424
			(unsigned long long)acct.rchar,
			(unsigned long long)acct.wchar,
			(unsigned long long)acct.syscr,
			(unsigned long long)acct.syscw,
			(unsigned long long)acct.read_bytes,
			(unsigned long long)acct.write_bytes,
			(unsigned long long)acct.cancelled_write_bytes);
2425 2426 2427 2428 2429
}

static int proc_tid_io_accounting(struct task_struct *task, char *buffer)
{
	return do_io_accounting(task, buffer, 0);
2430
}
2431 2432 2433 2434 2435 2436

static int proc_tgid_io_accounting(struct task_struct *task, char *buffer)
{
	return do_io_accounting(task, buffer, 1);
}
#endif /* CONFIG_TASK_IO_ACCOUNTING */
2437

2438 2439 2440 2441 2442 2443 2444
static int proc_pid_personality(struct seq_file *m, struct pid_namespace *ns,
				struct pid *pid, struct task_struct *task)
{
	seq_printf(m, "%08x\n", task->personality);
	return 0;
}

2445 2446 2447
/*
 * Thread groups
 */
2448
static const struct file_operations proc_task_operations;
2449
static const struct inode_operations proc_task_inode_operations;
2450

2451
static const struct pid_entry tgid_base_stuff[] = {
2452 2453
	DIR("task",       S_IRUGO|S_IXUGO, task),
	DIR("fd",         S_IRUSR|S_IXUSR, fd),
M
Miklos Szeredi 已提交
2454
	DIR("fdinfo",     S_IRUSR|S_IXUSR, fdinfo),
A
Andrew Morton 已提交
2455
#ifdef CONFIG_NET
A
Andre Noll 已提交
2456
	DIR("net",        S_IRUGO|S_IXUGO, net),
A
Andrew Morton 已提交
2457
#endif
2458
	REG("environ",    S_IRUSR, environ),
2459
	INF("auxv",       S_IRUSR, pid_auxv),
2460
	ONE("status",     S_IRUGO, pid_status),
2461
	ONE("personality", S_IRUSR, pid_personality),
2462
	INF("limits",	  S_IRUSR, pid_limits),
I
Ingo Molnar 已提交
2463 2464
#ifdef CONFIG_SCHED_DEBUG
	REG("sched",      S_IRUGO|S_IWUSR, pid_sched),
R
Roland McGrath 已提交
2465 2466 2467
#endif
#ifdef CONFIG_HAVE_ARCH_TRACEHOOK
	INF("syscall",    S_IRUSR, pid_syscall),
I
Ingo Molnar 已提交
2468
#endif
2469
	INF("cmdline",    S_IRUGO, pid_cmdline),
2470
	ONE("stat",       S_IRUGO, tgid_stat),
2471
	ONE("statm",      S_IRUGO, pid_statm),
2472
	REG("maps",       S_IRUGO, maps),
2473
#ifdef CONFIG_NUMA
2474
	REG("numa_maps",  S_IRUGO, numa_maps),
2475
#endif
2476 2477 2478 2479 2480
	REG("mem",        S_IRUSR|S_IWUSR, mem),
	LNK("cwd",        cwd),
	LNK("root",       root),
	LNK("exe",        exe),
	REG("mounts",     S_IRUGO, mounts),
2481
	REG("mountinfo",  S_IRUGO, mountinfo),
2482
	REG("mountstats", S_IRUSR, mountstats),
2483
#ifdef CONFIG_PROC_PAGE_MONITOR
2484
	REG("clear_refs", S_IWUSR, clear_refs),
2485
	REG("smaps",      S_IRUGO, smaps),
2486
	REG("pagemap",    S_IRUSR, pagemap),
2487 2488
#endif
#ifdef CONFIG_SECURITY
2489
	DIR("attr",       S_IRUGO|S_IXUGO, attr_dir),
2490 2491
#endif
#ifdef CONFIG_KALLSYMS
2492
	INF("wchan",      S_IRUGO, pid_wchan),
2493 2494
#endif
#ifdef CONFIG_SCHEDSTATS
2495
	INF("schedstat",  S_IRUGO, pid_schedstat),
2496
#endif
A
Arjan van de Ven 已提交
2497 2498 2499
#ifdef CONFIG_LATENCYTOP
	REG("latency",  S_IRUGO, lstats),
#endif
2500
#ifdef CONFIG_PROC_PID_CPUSET
2501
	REG("cpuset",     S_IRUGO, cpuset),
2502 2503 2504
#endif
#ifdef CONFIG_CGROUPS
	REG("cgroup",  S_IRUGO, cgroup),
2505
#endif
2506 2507
	INF("oom_score",  S_IRUGO, oom_score),
	REG("oom_adj",    S_IRUGO|S_IWUSR, oom_adjust),
2508
#ifdef CONFIG_AUDITSYSCALL
2509
	REG("loginuid",   S_IWUSR|S_IRUGO, loginuid),
S
Steve Grubb 已提交
2510
	REG("sessionid",  S_IRUGO, sessionid),
2511
#endif
2512 2513 2514
#ifdef CONFIG_FAULT_INJECTION
	REG("make-it-fail", S_IRUGO|S_IWUSR, fault_inject),
#endif
2515 2516 2517
#if defined(USE_ELF_CORE_DUMP) && defined(CONFIG_ELF_CORE)
	REG("coredump_filter", S_IRUGO|S_IWUSR, coredump_filter),
#endif
2518
#ifdef CONFIG_TASK_IO_ACCOUNTING
2519
	INF("io",	S_IRUGO, tgid_io_accounting),
2520
#endif
2521
};
L
Linus Torvalds 已提交
2522

2523
static int proc_tgid_base_readdir(struct file * filp,
L
Linus Torvalds 已提交
2524 2525 2526
			     void * dirent, filldir_t filldir)
{
	return proc_pident_readdir(filp,dirent,filldir,
2527
				   tgid_base_stuff,ARRAY_SIZE(tgid_base_stuff));
L
Linus Torvalds 已提交
2528 2529
}

2530
static const struct file_operations proc_tgid_base_operations = {
L
Linus Torvalds 已提交
2531
	.read		= generic_read_dir,
2532
	.readdir	= proc_tgid_base_readdir,
L
Linus Torvalds 已提交
2533 2534
};

2535
static struct dentry *proc_tgid_base_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd){
2536 2537
	return proc_pident_lookup(dir, dentry,
				  tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));
L
Linus Torvalds 已提交
2538 2539
}

2540
static const struct inode_operations proc_tgid_base_inode_operations = {
2541
	.lookup		= proc_tgid_base_lookup,
2542
	.getattr	= pid_getattr,
2543
	.setattr	= proc_setattr,
L
Linus Torvalds 已提交
2544 2545
};

2546
static void proc_flush_task_mnt(struct vfsmount *mnt, pid_t pid, pid_t tgid)
L
Linus Torvalds 已提交
2547
{
2548
	struct dentry *dentry, *leader, *dir;
2549
	char buf[PROC_NUMBUF];
2550 2551 2552
	struct qstr name;

	name.name = buf;
2553 2554
	name.len = snprintf(buf, sizeof(buf), "%d", pid);
	dentry = d_hash_and_lookup(mnt->mnt_root, &name);
2555
	if (dentry) {
2556 2557
		if (!(current->flags & PF_EXITING))
			shrink_dcache_parent(dentry);
2558 2559 2560
		d_drop(dentry);
		dput(dentry);
	}
L
Linus Torvalds 已提交
2561

2562
	if (tgid == 0)
2563
		goto out;
L
Linus Torvalds 已提交
2564

2565
	name.name = buf;
2566 2567
	name.len = snprintf(buf, sizeof(buf), "%d", tgid);
	leader = d_hash_and_lookup(mnt->mnt_root, &name);
2568 2569
	if (!leader)
		goto out;
L
Linus Torvalds 已提交
2570

2571 2572 2573 2574 2575 2576 2577
	name.name = "task";
	name.len = strlen(name.name);
	dir = d_hash_and_lookup(leader, &name);
	if (!dir)
		goto out_put_leader;

	name.name = buf;
2578
	name.len = snprintf(buf, sizeof(buf), "%d", pid);
2579 2580 2581 2582 2583
	dentry = d_hash_and_lookup(dir, &name);
	if (dentry) {
		shrink_dcache_parent(dentry);
		d_drop(dentry);
		dput(dentry);
L
Linus Torvalds 已提交
2584
	}
2585 2586 2587 2588 2589 2590

	dput(dir);
out_put_leader:
	dput(leader);
out:
	return;
L
Linus Torvalds 已提交
2591 2592
}

2593 2594 2595 2596 2597
/**
 * proc_flush_task -  Remove dcache entries for @task from the /proc dcache.
 * @task: task that should be flushed.
 *
 * When flushing dentries from proc, one needs to flush them from global
2598
 * proc (proc_mnt) and from all the namespaces' procs this task was seen
2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615
 * in. This call is supposed to do all of this job.
 *
 * Looks in the dcache for
 * /proc/@pid
 * /proc/@tgid/task/@pid
 * if either directory is present flushes it and all of it'ts children
 * from the dcache.
 *
 * It is safe and reasonable to cache /proc entries for a task until
 * that task exits.  After that they just clog up the dcache with
 * useless entries, possibly causing useful dcache entries to be
 * flushed instead.  This routine is proved to flush those useless
 * dcache entries at process exit time.
 *
 * NOTE: This routine is just an optimization so it does not guarantee
 *       that no dcache entries will exist at process exit time it
 *       just makes it very unlikely that any will persist.
2616 2617 2618 2619
 */

void proc_flush_task(struct task_struct *task)
{
2620 2621
	int i;
	struct pid *pid, *tgid = NULL;
2622 2623 2624
	struct upid *upid;

	pid = task_pid(task);
2625 2626
	if (thread_group_leader(task))
		tgid = task_tgid(task);
2627

2628
	for (i = 0; i <= pid->level; i++) {
2629 2630
		upid = &pid->numbers[i];
		proc_flush_task_mnt(upid->ns->proc_mnt, upid->nr,
2631
			tgid ? tgid->numbers[i].nr : 0);
2632
	}
2633 2634 2635 2636

	upid = &pid->numbers[pid->level];
	if (upid->nr == 1)
		pid_ns_release_proc(upid->ns);
2637 2638
}

2639 2640
static struct dentry *proc_pid_instantiate(struct inode *dir,
					   struct dentry * dentry,
2641
					   struct task_struct *task, const void *ptr)
2642 2643 2644 2645
{
	struct dentry *error = ERR_PTR(-ENOENT);
	struct inode *inode;

2646
	inode = proc_pid_make_inode(dir->i_sb, task);
2647 2648 2649 2650 2651 2652 2653
	if (!inode)
		goto out;

	inode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;
	inode->i_op = &proc_tgid_base_inode_operations;
	inode->i_fop = &proc_tgid_base_operations;
	inode->i_flags|=S_IMMUTABLE;
2654 2655 2656

	inode->i_nlink = 2 + pid_entry_count_dirs(tgid_base_stuff,
		ARRAY_SIZE(tgid_base_stuff));
2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667

	dentry->d_op = &pid_dentry_operations;

	d_add(dentry, inode);
	/* Close the race of the process dying before we return the dentry */
	if (pid_revalidate(dentry, NULL))
		error = NULL;
out:
	return error;
}

L
Linus Torvalds 已提交
2668 2669
struct dentry *proc_pid_lookup(struct inode *dir, struct dentry * dentry, struct nameidata *nd)
{
2670
	struct dentry *result = ERR_PTR(-ENOENT);
L
Linus Torvalds 已提交
2671 2672
	struct task_struct *task;
	unsigned tgid;
2673
	struct pid_namespace *ns;
L
Linus Torvalds 已提交
2674

2675 2676 2677 2678
	result = proc_base_lookup(dir, dentry);
	if (!IS_ERR(result) || PTR_ERR(result) != -ENOENT)
		goto out;

L
Linus Torvalds 已提交
2679 2680 2681 2682
	tgid = name_to_int(dentry);
	if (tgid == ~0U)
		goto out;

2683
	ns = dentry->d_sb->s_fs_info;
2684
	rcu_read_lock();
2685
	task = find_task_by_pid_ns(tgid, ns);
L
Linus Torvalds 已提交
2686 2687
	if (task)
		get_task_struct(task);
2688
	rcu_read_unlock();
L
Linus Torvalds 已提交
2689 2690 2691
	if (!task)
		goto out;

2692
	result = proc_pid_instantiate(dir, dentry, task, NULL);
L
Linus Torvalds 已提交
2693 2694
	put_task_struct(task);
out:
2695
	return result;
L
Linus Torvalds 已提交
2696 2697 2698
}

/*
2699
 * Find the first task with tgid >= tgid
2700
 *
L
Linus Torvalds 已提交
2701
 */
2702 2703
struct tgid_iter {
	unsigned int tgid;
2704
	struct task_struct *task;
2705 2706 2707
};
static struct tgid_iter next_tgid(struct pid_namespace *ns, struct tgid_iter iter)
{
2708
	struct pid *pid;
L
Linus Torvalds 已提交
2709

2710 2711
	if (iter.task)
		put_task_struct(iter.task);
2712
	rcu_read_lock();
2713
retry:
2714 2715
	iter.task = NULL;
	pid = find_ge_pid(iter.tgid, ns);
2716
	if (pid) {
2717 2718
		iter.tgid = pid_nr_ns(pid, ns);
		iter.task = pid_task(pid, PIDTYPE_PID);
2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730
		/* What we to know is if the pid we have find is the
		 * pid of a thread_group_leader.  Testing for task
		 * being a thread_group_leader is the obvious thing
		 * todo but there is a window when it fails, due to
		 * the pid transfer logic in de_thread.
		 *
		 * So we perform the straight forward test of seeing
		 * if the pid we have found is the pid of a thread
		 * group leader, and don't worry if the task we have
		 * found doesn't happen to be a thread group leader.
		 * As we don't care in the case of readdir.
		 */
2731 2732
		if (!iter.task || !has_group_leader_pid(iter.task)) {
			iter.tgid += 1;
2733
			goto retry;
2734 2735
		}
		get_task_struct(iter.task);
2736
	}
2737
	rcu_read_unlock();
2738
	return iter;
L
Linus Torvalds 已提交
2739 2740
}

2741
#define TGID_OFFSET (FIRST_PROCESS_ENTRY + ARRAY_SIZE(proc_base_stuff))
2742

2743
static int proc_pid_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
2744
	struct tgid_iter iter)
2745 2746
{
	char name[PROC_NUMBUF];
2747
	int len = snprintf(name, sizeof(name), "%d", iter.tgid);
2748
	return proc_fill_cache(filp, dirent, filldir, name, len,
2749
				proc_pid_instantiate, iter.task, NULL);
2750 2751
}

L
Linus Torvalds 已提交
2752 2753 2754 2755
/* for the /proc/ directory itself, after non-process stuff has been done */
int proc_pid_readdir(struct file * filp, void * dirent, filldir_t filldir)
{
	unsigned int nr = filp->f_pos - FIRST_PROCESS_ENTRY;
2756
	struct task_struct *reaper = get_proc_task(filp->f_path.dentry->d_inode);
2757
	struct tgid_iter iter;
2758
	struct pid_namespace *ns;
L
Linus Torvalds 已提交
2759

2760 2761 2762
	if (!reaper)
		goto out_no_task;

2763
	for (; nr < ARRAY_SIZE(proc_base_stuff); filp->f_pos++, nr++) {
2764
		const struct pid_entry *p = &proc_base_stuff[nr];
2765
		if (proc_base_fill_cache(filp, dirent, filldir, reaper, p) < 0)
2766
			goto out;
L
Linus Torvalds 已提交
2767 2768
	}

2769
	ns = filp->f_dentry->d_sb->s_fs_info;
2770 2771 2772 2773 2774 2775 2776 2777
	iter.task = NULL;
	iter.tgid = filp->f_pos - TGID_OFFSET;
	for (iter = next_tgid(ns, iter);
	     iter.task;
	     iter.tgid += 1, iter = next_tgid(ns, iter)) {
		filp->f_pos = iter.tgid + TGID_OFFSET;
		if (proc_pid_fill_cache(filp, dirent, filldir, iter) < 0) {
			put_task_struct(iter.task);
2778
			goto out;
L
Linus Torvalds 已提交
2779
		}
2780
	}
2781 2782
	filp->f_pos = PID_MAX_LIMIT + TGID_OFFSET;
out:
2783 2784
	put_task_struct(reaper);
out_no_task:
2785 2786
	return 0;
}
L
Linus Torvalds 已提交
2787

2788 2789 2790
/*
 * Tasks
 */
2791
static const struct pid_entry tid_base_stuff[] = {
2792
	DIR("fd",        S_IRUSR|S_IXUSR, fd),
M
Miklos Szeredi 已提交
2793
	DIR("fdinfo",    S_IRUSR|S_IXUSR, fdinfo),
2794
	REG("environ",   S_IRUSR, environ),
2795
	INF("auxv",      S_IRUSR, pid_auxv),
2796
	ONE("status",    S_IRUGO, pid_status),
2797
	ONE("personality", S_IRUSR, pid_personality),
2798
	INF("limits",	 S_IRUSR, pid_limits),
I
Ingo Molnar 已提交
2799 2800
#ifdef CONFIG_SCHED_DEBUG
	REG("sched",     S_IRUGO|S_IWUSR, pid_sched),
R
Roland McGrath 已提交
2801 2802 2803
#endif
#ifdef CONFIG_HAVE_ARCH_TRACEHOOK
	INF("syscall",   S_IRUSR, pid_syscall),
I
Ingo Molnar 已提交
2804
#endif
2805
	INF("cmdline",   S_IRUGO, pid_cmdline),
2806
	ONE("stat",      S_IRUGO, tid_stat),
2807
	ONE("statm",     S_IRUGO, pid_statm),
2808
	REG("maps",      S_IRUGO, maps),
2809
#ifdef CONFIG_NUMA
2810
	REG("numa_maps", S_IRUGO, numa_maps),
2811
#endif
2812 2813 2814 2815 2816
	REG("mem",       S_IRUSR|S_IWUSR, mem),
	LNK("cwd",       cwd),
	LNK("root",      root),
	LNK("exe",       exe),
	REG("mounts",    S_IRUGO, mounts),
2817
	REG("mountinfo",  S_IRUGO, mountinfo),
2818
#ifdef CONFIG_PROC_PAGE_MONITOR
2819
	REG("clear_refs", S_IWUSR, clear_refs),
2820
	REG("smaps",     S_IRUGO, smaps),
2821
	REG("pagemap",    S_IRUSR, pagemap),
2822 2823
#endif
#ifdef CONFIG_SECURITY
2824
	DIR("attr",      S_IRUGO|S_IXUGO, attr_dir),
2825 2826
#endif
#ifdef CONFIG_KALLSYMS
2827
	INF("wchan",     S_IRUGO, pid_wchan),
2828 2829
#endif
#ifdef CONFIG_SCHEDSTATS
2830
	INF("schedstat", S_IRUGO, pid_schedstat),
2831
#endif
A
Arjan van de Ven 已提交
2832 2833 2834
#ifdef CONFIG_LATENCYTOP
	REG("latency",  S_IRUGO, lstats),
#endif
2835
#ifdef CONFIG_PROC_PID_CPUSET
2836
	REG("cpuset",    S_IRUGO, cpuset),
2837 2838 2839
#endif
#ifdef CONFIG_CGROUPS
	REG("cgroup",  S_IRUGO, cgroup),
2840
#endif
2841 2842
	INF("oom_score", S_IRUGO, oom_score),
	REG("oom_adj",   S_IRUGO|S_IWUSR, oom_adjust),
2843
#ifdef CONFIG_AUDITSYSCALL
2844
	REG("loginuid",  S_IWUSR|S_IRUGO, loginuid),
2845
	REG("sessionid",  S_IRUSR, sessionid),
2846
#endif
2847 2848 2849
#ifdef CONFIG_FAULT_INJECTION
	REG("make-it-fail", S_IRUGO|S_IWUSR, fault_inject),
#endif
2850 2851 2852
#ifdef CONFIG_TASK_IO_ACCOUNTING
	INF("io",	S_IRUGO, tid_io_accounting),
#endif
2853 2854 2855 2856 2857 2858 2859 2860 2861 2862
};

static int proc_tid_base_readdir(struct file * filp,
			     void * dirent, filldir_t filldir)
{
	return proc_pident_readdir(filp,dirent,filldir,
				   tid_base_stuff,ARRAY_SIZE(tid_base_stuff));
}

static struct dentry *proc_tid_base_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd){
2863 2864
	return proc_pident_lookup(dir, dentry,
				  tid_base_stuff, ARRAY_SIZE(tid_base_stuff));
2865 2866
}

2867
static const struct file_operations proc_tid_base_operations = {
2868 2869 2870 2871
	.read		= generic_read_dir,
	.readdir	= proc_tid_base_readdir,
};

2872
static const struct inode_operations proc_tid_base_inode_operations = {
2873 2874 2875 2876 2877
	.lookup		= proc_tid_base_lookup,
	.getattr	= pid_getattr,
	.setattr	= proc_setattr,
};

2878
static struct dentry *proc_task_instantiate(struct inode *dir,
2879
	struct dentry *dentry, struct task_struct *task, const void *ptr)
2880 2881 2882
{
	struct dentry *error = ERR_PTR(-ENOENT);
	struct inode *inode;
2883
	inode = proc_pid_make_inode(dir->i_sb, task);
2884 2885 2886 2887 2888 2889 2890

	if (!inode)
		goto out;
	inode->i_mode = S_IFDIR|S_IRUGO|S_IXUGO;
	inode->i_op = &proc_tid_base_inode_operations;
	inode->i_fop = &proc_tid_base_operations;
	inode->i_flags|=S_IMMUTABLE;
2891 2892 2893

	inode->i_nlink = 2 + pid_entry_count_dirs(tid_base_stuff,
		ARRAY_SIZE(tid_base_stuff));
2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904

	dentry->d_op = &pid_dentry_operations;

	d_add(dentry, inode);
	/* Close the race of the process dying before we return the dentry */
	if (pid_revalidate(dentry, NULL))
		error = NULL;
out:
	return error;
}

2905 2906 2907 2908 2909 2910
static struct dentry *proc_task_lookup(struct inode *dir, struct dentry * dentry, struct nameidata *nd)
{
	struct dentry *result = ERR_PTR(-ENOENT);
	struct task_struct *task;
	struct task_struct *leader = get_proc_task(dir);
	unsigned tid;
2911
	struct pid_namespace *ns;
2912 2913 2914 2915 2916 2917 2918 2919

	if (!leader)
		goto out_no_task;

	tid = name_to_int(dentry);
	if (tid == ~0U)
		goto out;

2920
	ns = dentry->d_sb->s_fs_info;
2921
	rcu_read_lock();
2922
	task = find_task_by_pid_ns(tid, ns);
2923 2924 2925 2926 2927
	if (task)
		get_task_struct(task);
	rcu_read_unlock();
	if (!task)
		goto out;
2928
	if (!same_thread_group(leader, task))
2929 2930
		goto out_drop_task;

2931
	result = proc_task_instantiate(dir, dentry, task, NULL);
2932 2933 2934 2935 2936 2937 2938 2939
out_drop_task:
	put_task_struct(task);
out:
	put_task_struct(leader);
out_no_task:
	return result;
}

2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951
/*
 * Find the first tid of a thread group to return to user space.
 *
 * Usually this is just the thread group leader, but if the users
 * buffer was too small or there was a seek into the middle of the
 * directory we have more work todo.
 *
 * In the case of a short read we start with find_task_by_pid.
 *
 * In the case of a seek we start with the leader and walk nr
 * threads past it.
 */
2952
static struct task_struct *first_tid(struct task_struct *leader,
2953
		int tid, int nr, struct pid_namespace *ns)
2954
{
O
Oleg Nesterov 已提交
2955
	struct task_struct *pos;
L
Linus Torvalds 已提交
2956

2957
	rcu_read_lock();
2958 2959
	/* Attempt to start with the pid of a thread */
	if (tid && (nr > 0)) {
2960
		pos = find_task_by_pid_ns(tid, ns);
O
Oleg Nesterov 已提交
2961 2962
		if (pos && (pos->group_leader == leader))
			goto found;
2963
	}
L
Linus Torvalds 已提交
2964

2965
	/* If nr exceeds the number of threads there is nothing todo */
O
Oleg Nesterov 已提交
2966 2967 2968
	pos = NULL;
	if (nr && nr >= get_nr_threads(leader))
		goto out;
L
Linus Torvalds 已提交
2969

O
Oleg Nesterov 已提交
2970 2971
	/* If we haven't found our starting place yet start
	 * with the leader and walk nr threads forward.
2972
	 */
O
Oleg Nesterov 已提交
2973 2974 2975 2976 2977 2978
	for (pos = leader; nr > 0; --nr) {
		pos = next_thread(pos);
		if (pos == leader) {
			pos = NULL;
			goto out;
		}
L
Linus Torvalds 已提交
2979
	}
O
Oleg Nesterov 已提交
2980 2981 2982
found:
	get_task_struct(pos);
out:
2983
	rcu_read_unlock();
2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994
	return pos;
}

/*
 * Find the next thread in the thread list.
 * Return NULL if there is an error or no next thread.
 *
 * The reference to the input task_struct is released.
 */
static struct task_struct *next_tid(struct task_struct *start)
{
O
Oleg Nesterov 已提交
2995
	struct task_struct *pos = NULL;
2996
	rcu_read_lock();
O
Oleg Nesterov 已提交
2997
	if (pid_alive(start)) {
2998
		pos = next_thread(start);
O
Oleg Nesterov 已提交
2999 3000 3001 3002 3003
		if (thread_group_leader(pos))
			pos = NULL;
		else
			get_task_struct(pos);
	}
3004
	rcu_read_unlock();
3005 3006
	put_task_struct(start);
	return pos;
L
Linus Torvalds 已提交
3007 3008
}

3009 3010 3011 3012 3013 3014 3015 3016 3017
static int proc_task_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
	struct task_struct *task, int tid)
{
	char name[PROC_NUMBUF];
	int len = snprintf(name, sizeof(name), "%d", tid);
	return proc_fill_cache(filp, dirent, filldir, name, len,
				proc_task_instantiate, task, NULL);
}

L
Linus Torvalds 已提交
3018 3019 3020
/* for the /proc/TGID/task/ directories */
static int proc_task_readdir(struct file * filp, void * dirent, filldir_t filldir)
{
3021
	struct dentry *dentry = filp->f_path.dentry;
L
Linus Torvalds 已提交
3022
	struct inode *inode = dentry->d_inode;
3023
	struct task_struct *leader = NULL;
3024
	struct task_struct *task;
L
Linus Torvalds 已提交
3025 3026
	int retval = -ENOENT;
	ino_t ino;
3027
	int tid;
L
Linus Torvalds 已提交
3028
	unsigned long pos = filp->f_pos;  /* avoiding "long long" filp->f_pos */
3029
	struct pid_namespace *ns;
L
Linus Torvalds 已提交
3030

3031 3032 3033 3034 3035 3036 3037 3038 3039 3040
	task = get_proc_task(inode);
	if (!task)
		goto out_no_task;
	rcu_read_lock();
	if (pid_alive(task)) {
		leader = task->group_leader;
		get_task_struct(leader);
	}
	rcu_read_unlock();
	put_task_struct(task);
3041 3042
	if (!leader)
		goto out_no_task;
L
Linus Torvalds 已提交
3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059
	retval = 0;

	switch (pos) {
	case 0:
		ino = inode->i_ino;
		if (filldir(dirent, ".", 1, pos, ino, DT_DIR) < 0)
			goto out;
		pos++;
		/* fall through */
	case 1:
		ino = parent_ino(dentry);
		if (filldir(dirent, "..", 2, pos, ino, DT_DIR) < 0)
			goto out;
		pos++;
		/* fall through */
	}

3060 3061 3062
	/* f_version caches the tgid value that the last readdir call couldn't
	 * return. lseek aka telldir automagically resets f_version to 0.
	 */
3063
	ns = filp->f_dentry->d_sb->s_fs_info;
3064
	tid = (int)filp->f_version;
3065
	filp->f_version = 0;
3066
	for (task = first_tid(leader, tid, pos - 2, ns);
3067 3068
	     task;
	     task = next_tid(task), pos++) {
3069
		tid = task_pid_nr_ns(task, ns);
3070
		if (proc_task_fill_cache(filp, dirent, filldir, task, tid) < 0) {
3071 3072
			/* returning this tgid failed, save it as the first
			 * pid for the next readir call */
3073
			filp->f_version = (u64)tid;
3074
			put_task_struct(task);
L
Linus Torvalds 已提交
3075
			break;
3076
		}
L
Linus Torvalds 已提交
3077 3078 3079
	}
out:
	filp->f_pos = pos;
3080 3081
	put_task_struct(leader);
out_no_task:
L
Linus Torvalds 已提交
3082 3083
	return retval;
}
3084 3085 3086 3087

static int proc_task_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
{
	struct inode *inode = dentry->d_inode;
3088
	struct task_struct *p = get_proc_task(inode);
3089 3090
	generic_fillattr(inode, stat);

3091 3092 3093
	if (p) {
		stat->nlink += get_nr_threads(p);
		put_task_struct(p);
3094 3095 3096 3097
	}

	return 0;
}
3098

3099
static const struct inode_operations proc_task_inode_operations = {
3100 3101 3102 3103 3104
	.lookup		= proc_task_lookup,
	.getattr	= proc_task_getattr,
	.setattr	= proc_setattr,
};

3105
static const struct file_operations proc_task_operations = {
3106 3107 3108
	.read		= generic_read_dir,
	.readdir	= proc_task_readdir,
};