base.c 86.1 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>
D
David Rientjes 已提交
66
#include <linux/swap.h>
67
#include <linux/rcupdate.h>
L
Linus Torvalds 已提交
68
#include <linux/kallsyms.h>
K
Ken Chen 已提交
69
#include <linux/stacktrace.h>
70
#include <linux/resource.h>
K
Kees Cook 已提交
71
#include <linux/module.h>
L
Linus Torvalds 已提交
72 73 74
#include <linux/mount.h>
#include <linux/security.h>
#include <linux/ptrace.h>
75
#include <linux/tracehook.h>
76
#include <linux/cgroup.h>
L
Linus Torvalds 已提交
77 78
#include <linux/cpuset.h>
#include <linux/audit.h>
A
Al Viro 已提交
79
#include <linux/poll.h>
80
#include <linux/nsproxy.h>
81
#include <linux/oom.h>
82
#include <linux/elf.h>
83
#include <linux/pid_namespace.h>
84
#include <linux/fs_struct.h>
85
#include <linux/slab.h>
86
#include <linux/flex_array.h>
87 88 89
#ifdef CONFIG_HARDWALL
#include <asm/hardwall.h>
#endif
90
#include <trace/events/oom.h>
L
Linus Torvalds 已提交
91 92
#include "internal.h"

93 94 95 96 97 98 99 100 101 102
/* 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 已提交
103 104
struct pid_entry {
	char *name;
105
	int len;
A
Al Viro 已提交
106
	umode_t mode;
107
	const struct inode_operations *iop;
108
	const struct file_operations *fop;
109
	union proc_op op;
L
Linus Torvalds 已提交
110 111
};

112
#define NOD(NAME, MODE, IOP, FOP, OP) {			\
113
	.name = (NAME),					\
114
	.len  = sizeof(NAME) - 1,			\
115 116 117 118 119 120
	.mode = MODE,					\
	.iop  = IOP,					\
	.fop  = FOP,					\
	.op   = OP,					\
}

A
Alexey Dobriyan 已提交
121 122 123
#define DIR(NAME, MODE, iops, fops)	\
	NOD(NAME, (S_IFDIR|(MODE)), &iops, &fops, {} )
#define LNK(NAME, get_link)					\
124
	NOD(NAME, (S_IFLNK|S_IRWXUGO),				\
125
		&proc_pid_link_inode_operations, NULL,		\
A
Alexey Dobriyan 已提交
126 127 128 129
		{ .proc_get_link = get_link } )
#define REG(NAME, MODE, fops)				\
	NOD(NAME, (S_IFREG|(MODE)), NULL, &fops, {})
#define INF(NAME, MODE, read)				\
130
	NOD(NAME, (S_IFREG|(MODE)), 			\
131
		NULL, &proc_info_file_operations,	\
A
Alexey Dobriyan 已提交
132 133
		{ .proc_read = read } )
#define ONE(NAME, MODE, show)				\
134 135
	NOD(NAME, (S_IFREG|(MODE)), 			\
		NULL, &proc_single_file_operations,	\
A
Alexey Dobriyan 已提交
136
		{ .proc_show = show } )
L
Linus Torvalds 已提交
137

138 139
static int proc_fd_permission(struct inode *inode, int mask);

140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
/*
 * 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;
}

159
static int get_task_root(struct task_struct *task, struct path *root)
L
Linus Torvalds 已提交
160
{
H
Hugh Dickins 已提交
161 162
	int result = -ENOENT;

163
	task_lock(task);
164 165
	if (task->fs) {
		get_fs_root(task->fs, root);
H
Hugh Dickins 已提交
166 167
		result = 0;
	}
168
	task_unlock(task);
H
Hugh Dickins 已提交
169
	return result;
170 171
}

172
static int proc_cwd_link(struct dentry *dentry, struct path *path)
173
{
174
	struct task_struct *task = get_proc_task(dentry->d_inode);
175
	int result = -ENOENT;
176 177

	if (task) {
178 179 180 181 182 183
		task_lock(task);
		if (task->fs) {
			get_fs_pwd(task->fs, path);
			result = 0;
		}
		task_unlock(task);
184 185
		put_task_struct(task);
	}
L
Linus Torvalds 已提交
186 187 188
	return result;
}

189
static int proc_root_link(struct dentry *dentry, struct path *path)
L
Linus Torvalds 已提交
190
{
191
	struct task_struct *task = get_proc_task(dentry->d_inode);
L
Linus Torvalds 已提交
192
	int result = -ENOENT;
193 194

	if (task) {
195
		result = get_task_root(task, path);
196 197
		put_task_struct(task);
	}
L
Linus Torvalds 已提交
198 199 200
	return result;
}

201
static struct mm_struct *__check_mem_permission(struct task_struct *task)
R
Roland McGrath 已提交
202
{
203 204 205 206 207 208
	struct mm_struct *mm;

	mm = get_task_mm(task);
	if (!mm)
		return ERR_PTR(-EINVAL);

R
Roland McGrath 已提交
209 210 211 212 213
	/*
	 * A task can always look at itself, in case it chooses
	 * to use system calls instead of load instructions.
	 */
	if (task == current)
214
		return mm;
R
Roland McGrath 已提交
215 216 217 218 219

	/*
	 * If current is actively ptrace'ing, and would also be
	 * permitted to freshly attach with ptrace now, permit it.
	 */
220 221 222
	if (task_is_stopped_or_traced(task)) {
		int match;
		rcu_read_lock();
223
		match = (ptrace_parent(task) == current);
224 225
		rcu_read_unlock();
		if (match && ptrace_may_access(task, PTRACE_MODE_ATTACH))
226
			return mm;
227
	}
R
Roland McGrath 已提交
228 229

	/*
L
Lucas De Marchi 已提交
230
	 * No one else is allowed.
R
Roland McGrath 已提交
231
	 */
232 233
	mmput(mm);
	return ERR_PTR(-EPERM);
R
Roland McGrath 已提交
234
}
L
Linus Torvalds 已提交
235

236
/*
237 238
 * If current may access user memory in @task return a reference to the
 * corresponding mm, otherwise ERR_PTR.
239
 */
240
static struct mm_struct *check_mem_permission(struct task_struct *task)
241
{
242
	struct mm_struct *mm;
243 244 245 246 247 248 249 250
	int err;

	/*
	 * Avoid racing if task exec's as we might get a new mm but validate
	 * against old credentials.
	 */
	err = mutex_lock_killable(&task->signal->cred_guard_mutex);
	if (err)
251
		return ERR_PTR(err);
252

253
	mm = __check_mem_permission(task);
254 255
	mutex_unlock(&task->signal->cred_guard_mutex);

256
	return mm;
R
Roland McGrath 已提交
257
}
L
Linus Torvalds 已提交
258

259 260
struct mm_struct *mm_for_maps(struct task_struct *task)
{
261
	struct mm_struct *mm;
A
Al Viro 已提交
262
	int err;
263

A
Al Viro 已提交
264 265 266
	err =  mutex_lock_killable(&task->signal->cred_guard_mutex);
	if (err)
		return ERR_PTR(err);
267

268 269 270 271
	mm = get_task_mm(task);
	if (mm && mm != current->mm &&
			!ptrace_may_access(task, PTRACE_MODE_READ)) {
		mmput(mm);
A
Al Viro 已提交
272
		mm = ERR_PTR(-EACCES);
273
	}
274
	mutex_unlock(&task->signal->cred_guard_mutex);
275

276 277 278
	return mm;
}

L
Linus Torvalds 已提交
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
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)
{
318 319 320
	struct mm_struct *mm = mm_for_maps(task);
	int res = PTR_ERR(mm);
	if (mm && !IS_ERR(mm)) {
L
Linus Torvalds 已提交
321
		unsigned int nwords = 0;
H
Hannes Eder 已提交
322
		do {
L
Linus Torvalds 已提交
323
			nwords += 2;
H
Hannes Eder 已提交
324
		} while (mm->saved_auxv[nwords - 2] != 0); /* AT_NULL */
L
Linus Torvalds 已提交
325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341
		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 已提交
342
	unsigned long wchan;
343
	char symname[KSYM_NAME_LEN];
L
Linus Torvalds 已提交
344 345 346

	wchan = get_wchan(task);

347
	if (lookup_symbol_name(wchan, symname) < 0)
348 349 350 351
		if (!ptrace_may_access(task, PTRACE_MODE_READ))
			return 0;
		else
			return sprintf(buffer, "%lu", wchan);
352 353
	else
		return sprintf(buffer, "%s", symname);
L
Linus Torvalds 已提交
354 355 356
}
#endif /* CONFIG_KALLSYMS */

357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373
static int lock_trace(struct task_struct *task)
{
	int err = mutex_lock_killable(&task->signal->cred_guard_mutex);
	if (err)
		return err;
	if (!ptrace_may_access(task, PTRACE_MODE_ATTACH)) {
		mutex_unlock(&task->signal->cred_guard_mutex);
		return -EPERM;
	}
	return 0;
}

static void unlock_trace(struct task_struct *task)
{
	mutex_unlock(&task->signal->cred_guard_mutex);
}

K
Ken Chen 已提交
374 375 376 377 378 379 380 381 382
#ifdef CONFIG_STACKTRACE

#define MAX_STACK_TRACE_DEPTH	64

static int proc_pid_stack(struct seq_file *m, struct pid_namespace *ns,
			  struct pid *pid, struct task_struct *task)
{
	struct stack_trace trace;
	unsigned long *entries;
383
	int err;
K
Ken Chen 已提交
384 385 386 387 388 389 390 391 392 393 394
	int i;

	entries = kmalloc(MAX_STACK_TRACE_DEPTH * sizeof(*entries), GFP_KERNEL);
	if (!entries)
		return -ENOMEM;

	trace.nr_entries	= 0;
	trace.max_entries	= MAX_STACK_TRACE_DEPTH;
	trace.entries		= entries;
	trace.skip		= 0;

395 396 397 398 399
	err = lock_trace(task);
	if (!err) {
		save_stack_trace_tsk(task, &trace);

		for (i = 0; i < trace.nr_entries; i++) {
400
			seq_printf(m, "[<%pK>] %pS\n",
401 402 403
				   (void *)entries[i], (void *)entries[i]);
		}
		unlock_trace(task);
K
Ken Chen 已提交
404 405 406
	}
	kfree(entries);

407
	return err;
K
Ken Chen 已提交
408 409 410
}
#endif

L
Linus Torvalds 已提交
411 412 413 414 415 416
#ifdef CONFIG_SCHEDSTATS
/*
 * Provides /proc/PID/schedstat
 */
static int proc_pid_schedstat(struct task_struct *task, char *buffer)
{
417
	return sprintf(buffer, "%llu %llu %lu\n",
I
Ingo Molnar 已提交
418 419
			(unsigned long long)task->se.sum_exec_runtime,
			(unsigned long long)task->sched_info.run_delay,
420
			task->sched_info.pcount);
L
Linus Torvalds 已提交
421 422 423
}
#endif

A
Arjan van de Ven 已提交
424 425 426 427
#ifdef CONFIG_LATENCYTOP
static int lstats_show_proc(struct seq_file *m, void *v)
{
	int i;
428 429
	struct inode *inode = m->private;
	struct task_struct *task = get_proc_task(inode);
A
Arjan van de Ven 已提交
430

431 432 433
	if (!task)
		return -ESRCH;
	seq_puts(m, "Latency Top version : v0.1\n");
A
Arjan van de Ven 已提交
434
	for (i = 0; i < 32; i++) {
435 436
		struct latency_record *lr = &task->latency_record[i];
		if (lr->backtrace[0]) {
A
Arjan van de Ven 已提交
437
			int q;
438 439
			seq_printf(m, "%i %li %li",
				   lr->count, lr->time, lr->max);
A
Arjan van de Ven 已提交
440
			for (q = 0; q < LT_BACKTRACEDEPTH; q++) {
441 442
				unsigned long bt = lr->backtrace[q];
				if (!bt)
A
Arjan van de Ven 已提交
443
					break;
444
				if (bt == ULONG_MAX)
A
Arjan van de Ven 已提交
445
					break;
446
				seq_printf(m, " %ps", (void *)bt);
A
Arjan van de Ven 已提交
447
			}
448
			seq_putc(m, '\n');
A
Arjan van de Ven 已提交
449 450 451
		}

	}
452
	put_task_struct(task);
A
Arjan van de Ven 已提交
453 454 455 456 457
	return 0;
}

static int lstats_open(struct inode *inode, struct file *file)
{
458
	return single_open(file, lstats_show_proc, inode);
459 460
}

A
Arjan van de Ven 已提交
461 462 463
static ssize_t lstats_write(struct file *file, const char __user *buf,
			    size_t count, loff_t *offs)
{
464
	struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
A
Arjan van de Ven 已提交
465

466 467
	if (!task)
		return -ESRCH;
A
Arjan van de Ven 已提交
468
	clear_all_latency_tracing(task);
469
	put_task_struct(task);
A
Arjan van de Ven 已提交
470 471 472 473 474 475 476 477 478

	return count;
}

static const struct file_operations proc_lstats_operations = {
	.open		= lstats_open,
	.read		= seq_read,
	.write		= lstats_write,
	.llseek		= seq_lseek,
479
	.release	= single_release,
A
Arjan van de Ven 已提交
480 481 482 483
};

#endif

L
Linus Torvalds 已提交
484 485
static int proc_oom_score(struct task_struct *task, char *buffer)
{
486
	unsigned long points = 0;
L
Linus Torvalds 已提交
487

488
	read_lock(&tasklist_lock);
489
	if (pid_alive(task))
D
David Rientjes 已提交
490 491
		points = oom_badness(task, NULL, NULL,
					totalram_pages + total_swap_pages);
492
	read_unlock(&tasklist_lock);
L
Linus Torvalds 已提交
493 494 495
	return sprintf(buffer, "%lu\n", points);
}

496 497 498 499 500 501
struct limit_names {
	char *name;
	char *unit;
};

static const struct limit_names lnames[RLIM_NLIMITS] = {
502
	[RLIMIT_CPU] = {"Max cpu time", "seconds"},
503 504 505 506 507 508 509 510 511 512 513 514 515 516
	[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},
517
	[RLIMIT_RTTIME] = {"Max realtime timeout", "us"},
518 519 520 521 522 523 524 525 526 527 528 529
};

/* 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];

530
	if (!lock_task_sighand(task, &flags))
531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564
		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 已提交
565 566 567 568 569
#ifdef CONFIG_HAVE_ARCH_TRACEHOOK
static int proc_pid_syscall(struct task_struct *task, char *buffer)
{
	long nr;
	unsigned long args[6], sp, pc;
570 571 572
	int res = lock_trace(task);
	if (res)
		return res;
R
Roland McGrath 已提交
573 574

	if (task_current_syscall(task, &nr, args, 6, &sp, &pc))
575 576 577 578 579
		res = sprintf(buffer, "running\n");
	else if (nr < 0)
		res = sprintf(buffer, "%ld 0x%lx 0x%lx\n", nr, sp, pc);
	else
		res = sprintf(buffer,
R
Roland McGrath 已提交
580 581 582 583
		       "%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);
584 585
	unlock_trace(task);
	return res;
R
Roland McGrath 已提交
586 587 588
}
#endif /* CONFIG_HAVE_ARCH_TRACEHOOK */

L
Linus Torvalds 已提交
589 590 591 592 593
/************************************************************************/
/*                       Here the fs part begins                        */
/************************************************************************/

/* permission checks */
594
static int proc_fd_access_allowed(struct inode *inode)
L
Linus Torvalds 已提交
595
{
596 597
	struct task_struct *task;
	int allowed = 0;
598 599 600
	/* 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.
601 602
	 */
	task = get_proc_task(inode);
603
	if (task) {
604
		allowed = ptrace_may_access(task, PTRACE_MODE_READ);
605
		put_task_struct(task);
606
	}
607
	return allowed;
L
Linus Torvalds 已提交
608 609
}

610
int proc_setattr(struct dentry *dentry, struct iattr *attr)
611 612 613 614 615 616 617 618
{
	int error;
	struct inode *inode = dentry->d_inode;

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

	error = inode_change_ok(inode, attr);
C
Christoph Hellwig 已提交
619 620 621 622 623 624 625 626 627 628 629 630 631
	if (error)
		return error;

	if ((attr->ia_valid & ATTR_SIZE) &&
	    attr->ia_size != i_size_read(inode)) {
		error = vmtruncate(inode, attr->ia_size);
		if (error)
			return error;
	}

	setattr_copy(inode, attr);
	mark_inode_dirty(inode);
	return 0;
632 633
}

634
static const struct inode_operations proc_def_inode_operations = {
635 636 637
	.setattr	= proc_setattr,
};

L
Linus Torvalds 已提交
638 639 640 641 642
#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)
{
643
	struct inode * inode = file->f_path.dentry->d_inode;
L
Linus Torvalds 已提交
644 645
	unsigned long page;
	ssize_t length;
646 647 648 649 650
	struct task_struct *task = get_proc_task(inode);

	length = -ESRCH;
	if (!task)
		goto out_no_task;
L
Linus Torvalds 已提交
651 652 653

	if (count > PROC_BLOCK_SIZE)
		count = PROC_BLOCK_SIZE;
654 655

	length = -ENOMEM;
656
	if (!(page = __get_free_page(GFP_TEMPORARY)))
657
		goto out;
L
Linus Torvalds 已提交
658 659 660 661 662 663

	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);
664 665 666
out:
	put_task_struct(task);
out_no_task:
L
Linus Torvalds 已提交
667 668 669
	return length;
}

670
static const struct file_operations proc_info_file_operations = {
L
Linus Torvalds 已提交
671
	.read		= proc_info_read,
672
	.llseek		= generic_file_llseek,
L
Linus Torvalds 已提交
673 674
};

675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696
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)
{
J
Jovi Zhang 已提交
697
	return single_open(filp, proc_single_show, inode);
698 699 700 701 702 703 704 705 706
}

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 已提交
707 708 709
static int mem_open(struct inode* inode, struct file* file)
{
	file->private_data = (void*)((long)current->self_exec_id);
710 711
	/* OK to pass negative loff_t, we can catch out-of-range */
	file->f_mode |= FMODE_UNSIGNED_OFFSET;
L
Linus Torvalds 已提交
712 713 714 715 716 717
	return 0;
}

static ssize_t mem_read(struct file * file, char __user * buf,
			size_t count, loff_t *ppos)
{
718
	struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
L
Linus Torvalds 已提交
719 720 721 722 723
	char *page;
	unsigned long src = *ppos;
	int ret = -ESRCH;
	struct mm_struct *mm;

724 725 726
	if (!task)
		goto out_no_task;

L
Linus Torvalds 已提交
727
	ret = -ENOMEM;
728
	page = (char *)__get_free_page(GFP_TEMPORARY);
L
Linus Torvalds 已提交
729 730 731
	if (!page)
		goto out;

732 733 734
	mm = check_mem_permission(task);
	ret = PTR_ERR(mm);
	if (IS_ERR(mm))
L
Linus Torvalds 已提交
735 736 737 738 739 740 741 742 743 744 745 746 747
		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;
748 749
		retval = access_remote_vm(mm, src, page, this_len, 0);
		if (!retval) {
L
Linus Torvalds 已提交
750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771
			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:
772 773
	put_task_struct(task);
out_no_task:
L
Linus Torvalds 已提交
774 775 776
	return ret;
}

777
static ssize_t mem_write(struct file * file, const char __user *buf,
L
Linus Torvalds 已提交
778 779
			 size_t count, loff_t *ppos)
{
780
	int copied;
L
Linus Torvalds 已提交
781
	char *page;
782
	struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
L
Linus Torvalds 已提交
783
	unsigned long dst = *ppos;
784
	struct mm_struct *mm;
L
Linus Torvalds 已提交
785

786 787 788 789
	copied = -ESRCH;
	if (!task)
		goto out_no_task;

790 791 792 793 794
	copied = -ENOMEM;
	page = (char *)__get_free_page(GFP_TEMPORARY);
	if (!page)
		goto out_task;

795 796 797
	mm = check_mem_permission(task);
	copied = PTR_ERR(mm);
	if (IS_ERR(mm))
798
		goto out_free;
L
Linus Torvalds 已提交
799

800 801
	copied = -EIO;
	if (file->private_data != (void *)((long)current->self_exec_id))
802
		goto out_mm;
L
Linus Torvalds 已提交
803

804
	copied = 0;
L
Linus Torvalds 已提交
805 806 807 808 809 810 811 812
	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;
		}
813
		retval = access_remote_vm(mm, dst, page, this_len, 1);
L
Linus Torvalds 已提交
814 815 816 817 818 819 820 821 822 823 824
		if (!retval) {
			if (!copied)
				copied = -EIO;
			break;
		}
		copied += retval;
		buf += retval;
		dst += retval;
		count -= retval;			
	}
	*ppos = dst;
825

826 827
out_mm:
	mmput(mm);
828 829
out_free:
	free_page((unsigned long) page);
830
out_task:
831 832
	put_task_struct(task);
out_no_task:
L
Linus Torvalds 已提交
833 834 835
	return copied;
}

836
loff_t mem_lseek(struct file *file, loff_t offset, int orig)
L
Linus Torvalds 已提交
837 838 839 840 841 842 843 844 845 846 847 848 849 850 851
{
	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;
}

852
static const struct file_operations proc_mem_operations = {
L
Linus Torvalds 已提交
853 854 855 856 857 858
	.llseek		= mem_lseek,
	.read		= mem_read,
	.write		= mem_write,
	.open		= mem_open,
};

859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876
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;

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


A
Al Viro 已提交
877 878 879
	mm = mm_for_maps(task);
	ret = PTR_ERR(mm);
	if (!mm || IS_ERR(mm))
880 881
		goto out_free;

A
Al Viro 已提交
882
	ret = 0;
883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924
	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,
925
	.llseek		= generic_file_llseek,
926 927
};

L
Linus Torvalds 已提交
928 929 930
static ssize_t oom_adjust_read(struct file *file, char __user *buf,
				size_t count, loff_t *ppos)
{
931
	struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
932
	char buffer[PROC_NUMBUF];
L
Linus Torvalds 已提交
933
	size_t len;
934 935
	int oom_adjust = OOM_DISABLE;
	unsigned long flags;
L
Linus Torvalds 已提交
936

937 938
	if (!task)
		return -ESRCH;
939 940 941 942 943 944

	if (lock_task_sighand(task, &flags)) {
		oom_adjust = task->signal->oom_adj;
		unlock_task_sighand(task, &flags);
	}

945 946
	put_task_struct(task);

947
	len = snprintf(buffer, sizeof(buffer), "%i\n", oom_adjust);
948 949

	return simple_read_from_buffer(buf, count, ppos, buffer, len);
L
Linus Torvalds 已提交
950 951 952 953 954
}

static ssize_t oom_adjust_write(struct file *file, const char __user *buf,
				size_t count, loff_t *ppos)
{
955
	struct task_struct *task;
956
	char buffer[PROC_NUMBUF];
A
Alexey Dobriyan 已提交
957
	int oom_adjust;
958
	unsigned long flags;
959
	int err;
L
Linus Torvalds 已提交
960

961 962 963
	memset(buffer, 0, sizeof(buffer));
	if (count > sizeof(buffer) - 1)
		count = sizeof(buffer) - 1;
964 965 966 967
	if (copy_from_user(buffer, buf, count)) {
		err = -EFAULT;
		goto out;
	}
968

A
Alexey Dobriyan 已提交
969
	err = kstrtoint(strstrip(buffer), 0, &oom_adjust);
970
	if (err)
971
		goto out;
972
	if ((oom_adjust < OOM_ADJUST_MIN || oom_adjust > OOM_ADJUST_MAX) &&
973 974 975 976
	     oom_adjust != OOM_DISABLE) {
		err = -EINVAL;
		goto out;
	}
977

978
	task = get_proc_task(file->f_path.dentry->d_inode);
979 980 981 982
	if (!task) {
		err = -ESRCH;
		goto out;
	}
983 984 985 986 987 988 989

	task_lock(task);
	if (!task->mm) {
		err = -EINVAL;
		goto err_task_lock;
	}

990
	if (!lock_task_sighand(task, &flags)) {
991
		err = -ESRCH;
992
		goto err_task_lock;
993 994 995
	}

	if (oom_adjust < task->signal->oom_adj && !capable(CAP_SYS_RESOURCE)) {
996 997
		err = -EACCES;
		goto err_sighand;
998
	}
999

D
David Rientjes 已提交
1000 1001 1002 1003
	/*
	 * Warn that /proc/pid/oom_adj is deprecated, see
	 * Documentation/feature-removal-schedule.txt.
	 */
1004
	printk_once(KERN_WARNING "%s (%d): /proc/%d/oom_adj is deprecated, please use /proc/%d/oom_score_adj instead.\n",
1005 1006
		  current->comm, task_pid_nr(current), task_pid_nr(task),
		  task_pid_nr(task));
1007
	task->signal->oom_adj = oom_adjust;
D
David Rientjes 已提交
1008 1009 1010 1011 1012 1013 1014 1015 1016
	/*
	 * Scale /proc/pid/oom_score_adj appropriately ensuring that a maximum
	 * value is always attainable.
	 */
	if (task->signal->oom_adj == OOM_ADJUST_MAX)
		task->signal->oom_score_adj = OOM_SCORE_ADJ_MAX;
	else
		task->signal->oom_score_adj = (oom_adjust * OOM_SCORE_ADJ_MAX) /
								-OOM_DISABLE;
1017
	trace_oom_score_adj_update(task);
1018
err_sighand:
1019
	unlock_task_sighand(task, &flags);
1020 1021
err_task_lock:
	task_unlock(task);
1022
	put_task_struct(task);
1023 1024
out:
	return err < 0 ? err : count;
L
Linus Torvalds 已提交
1025 1026
}

1027
static const struct file_operations proc_oom_adjust_operations = {
L
Linus Torvalds 已提交
1028 1029
	.read		= oom_adjust_read,
	.write		= oom_adjust_write,
1030
	.llseek		= generic_file_llseek,
L
Linus Torvalds 已提交
1031 1032
};

D
David Rientjes 已提交
1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058
static ssize_t oom_score_adj_read(struct file *file, char __user *buf,
					size_t count, loff_t *ppos)
{
	struct task_struct *task = get_proc_task(file->f_path.dentry->d_inode);
	char buffer[PROC_NUMBUF];
	int oom_score_adj = OOM_SCORE_ADJ_MIN;
	unsigned long flags;
	size_t len;

	if (!task)
		return -ESRCH;
	if (lock_task_sighand(task, &flags)) {
		oom_score_adj = task->signal->oom_score_adj;
		unlock_task_sighand(task, &flags);
	}
	put_task_struct(task);
	len = snprintf(buffer, sizeof(buffer), "%d\n", oom_score_adj);
	return simple_read_from_buffer(buf, count, ppos, buffer, len);
}

static ssize_t oom_score_adj_write(struct file *file, const char __user *buf,
					size_t count, loff_t *ppos)
{
	struct task_struct *task;
	char buffer[PROC_NUMBUF];
	unsigned long flags;
A
Alexey Dobriyan 已提交
1059
	int oom_score_adj;
D
David Rientjes 已提交
1060 1061 1062 1063 1064
	int err;

	memset(buffer, 0, sizeof(buffer));
	if (count > sizeof(buffer) - 1)
		count = sizeof(buffer) - 1;
1065 1066 1067 1068
	if (copy_from_user(buffer, buf, count)) {
		err = -EFAULT;
		goto out;
	}
D
David Rientjes 已提交
1069

A
Alexey Dobriyan 已提交
1070
	err = kstrtoint(strstrip(buffer), 0, &oom_score_adj);
D
David Rientjes 已提交
1071
	if (err)
1072
		goto out;
D
David Rientjes 已提交
1073
	if (oom_score_adj < OOM_SCORE_ADJ_MIN ||
1074 1075 1076 1077
			oom_score_adj > OOM_SCORE_ADJ_MAX) {
		err = -EINVAL;
		goto out;
	}
D
David Rientjes 已提交
1078 1079

	task = get_proc_task(file->f_path.dentry->d_inode);
1080 1081 1082 1083
	if (!task) {
		err = -ESRCH;
		goto out;
	}
1084 1085 1086 1087 1088 1089 1090

	task_lock(task);
	if (!task->mm) {
		err = -EINVAL;
		goto err_task_lock;
	}

D
David Rientjes 已提交
1091
	if (!lock_task_sighand(task, &flags)) {
1092
		err = -ESRCH;
1093
		goto err_task_lock;
D
David Rientjes 已提交
1094
	}
1095

1096
	if (oom_score_adj < task->signal->oom_score_adj_min &&
D
David Rientjes 已提交
1097
			!capable(CAP_SYS_RESOURCE)) {
1098 1099
		err = -EACCES;
		goto err_sighand;
D
David Rientjes 已提交
1100 1101 1102
	}

	task->signal->oom_score_adj = oom_score_adj;
1103 1104
	if (has_capability_noaudit(current, CAP_SYS_RESOURCE))
		task->signal->oom_score_adj_min = oom_score_adj;
1105
	trace_oom_score_adj_update(task);
D
David Rientjes 已提交
1106 1107 1108 1109 1110 1111 1112 1113 1114
	/*
	 * Scale /proc/pid/oom_adj appropriately ensuring that OOM_DISABLE is
	 * always attainable.
	 */
	if (task->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
		task->signal->oom_adj = OOM_DISABLE;
	else
		task->signal->oom_adj = (oom_score_adj * OOM_ADJUST_MAX) /
							OOM_SCORE_ADJ_MAX;
1115
err_sighand:
D
David Rientjes 已提交
1116
	unlock_task_sighand(task, &flags);
1117 1118
err_task_lock:
	task_unlock(task);
D
David Rientjes 已提交
1119
	put_task_struct(task);
1120 1121
out:
	return err < 0 ? err : count;
D
David Rientjes 已提交
1122 1123 1124 1125 1126
}

static const struct file_operations proc_oom_score_adj_operations = {
	.read		= oom_score_adj_read,
	.write		= oom_score_adj_write,
1127
	.llseek		= default_llseek,
D
David Rientjes 已提交
1128 1129
};

L
Linus Torvalds 已提交
1130 1131 1132 1133 1134
#ifdef CONFIG_AUDITSYSCALL
#define TMPBUFLEN 21
static ssize_t proc_loginuid_read(struct file * file, char __user * buf,
				  size_t count, loff_t *ppos)
{
1135
	struct inode * inode = file->f_path.dentry->d_inode;
1136
	struct task_struct *task = get_proc_task(inode);
L
Linus Torvalds 已提交
1137 1138 1139
	ssize_t length;
	char tmpbuf[TMPBUFLEN];

1140 1141
	if (!task)
		return -ESRCH;
L
Linus Torvalds 已提交
1142
	length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
1143
				audit_get_loginuid(task));
1144
	put_task_struct(task);
L
Linus Torvalds 已提交
1145 1146 1147 1148 1149 1150
	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)
{
1151
	struct inode * inode = file->f_path.dentry->d_inode;
L
Linus Torvalds 已提交
1152 1153 1154 1155 1156 1157 1158
	char *page, *tmp;
	ssize_t length;
	uid_t loginuid;

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

1159 1160 1161
	rcu_read_lock();
	if (current != pid_task(proc_pid(inode), PIDTYPE_PID)) {
		rcu_read_unlock();
L
Linus Torvalds 已提交
1162
		return -EPERM;
1163 1164
	}
	rcu_read_unlock();
L
Linus Torvalds 已提交
1165

1166 1167
	if (count >= PAGE_SIZE)
		count = PAGE_SIZE - 1;
L
Linus Torvalds 已提交
1168 1169 1170 1171 1172

	if (*ppos != 0) {
		/* No partial writes. */
		return -EINVAL;
	}
1173
	page = (char*)__get_free_page(GFP_TEMPORARY);
L
Linus Torvalds 已提交
1174 1175 1176 1177 1178 1179
	if (!page)
		return -ENOMEM;
	length = -EFAULT;
	if (copy_from_user(page, buf, count))
		goto out_free_page;

1180
	page[count] = '\0';
L
Linus Torvalds 已提交
1181 1182 1183 1184 1185 1186
	loginuid = simple_strtoul(page, &tmp, 10);
	if (tmp == page) {
		length = -EINVAL;
		goto out_free_page;

	}
1187
	length = audit_set_loginuid(current, loginuid);
L
Linus Torvalds 已提交
1188 1189 1190 1191 1192 1193 1194 1195
	if (likely(length == 0))
		length = count;

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

1196
static const struct file_operations proc_loginuid_operations = {
L
Linus Torvalds 已提交
1197 1198
	.read		= proc_loginuid_read,
	.write		= proc_loginuid_write,
1199
	.llseek		= generic_file_llseek,
L
Linus Torvalds 已提交
1200
};
1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219

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,
1220
	.llseek		= generic_file_llseek,
1221
};
L
Linus Torvalds 已提交
1222 1223
#endif

1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238
#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);
1239 1240

	return simple_read_from_buffer(buf, count, ppos, buffer, len);
1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256
}

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;
1257 1258 1259
	make_it_fail = simple_strtol(strstrip(buffer), &end, 0);
	if (*end)
		return -EINVAL;
1260 1261 1262 1263 1264
	task = get_proc_task(file->f_dentry->d_inode);
	if (!task)
		return -ESRCH;
	task->make_it_fail = make_it_fail;
	put_task_struct(task);
1265 1266

	return count;
1267 1268
}

1269
static const struct file_operations proc_fault_inject_operations = {
1270 1271
	.read		= proc_fault_inject_read,
	.write		= proc_fault_inject_write,
1272
	.llseek		= generic_file_llseek,
1273 1274 1275
};
#endif

A
Arjan van de Ven 已提交
1276

I
Ingo Molnar 已提交
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
#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;

	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;

	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)
{
J
Jovi Zhang 已提交
1315
	return single_open(filp, sched_show, inode);
I
Ingo Molnar 已提交
1316 1317 1318 1319 1320 1321 1322
}

static const struct file_operations proc_pid_sched_operations = {
	.open		= sched_open,
	.read		= seq_read,
	.write		= sched_write,
	.llseek		= seq_lseek,
1323
	.release	= single_release,
I
Ingo Molnar 已提交
1324 1325 1326 1327
};

#endif

1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353
#ifdef CONFIG_SCHED_AUTOGROUP
/*
 * Print out autogroup related information:
 */
static int sched_autogroup_show(struct seq_file *m, void *v)
{
	struct inode *inode = m->private;
	struct task_struct *p;

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

	put_task_struct(p);

	return 0;
}

static ssize_t
sched_autogroup_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;
	char buffer[PROC_NUMBUF];
A
Alexey Dobriyan 已提交
1354
	int nice;
1355 1356 1357 1358 1359 1360 1361 1362
	int err;

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

A
Alexey Dobriyan 已提交
1363 1364 1365
	err = kstrtoint(strstrip(buffer), 0, &nice);
	if (err < 0)
		return err;
1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403

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

	err = nice;
	err = proc_sched_autogroup_set_nice(p, &err);
	if (err)
		count = err;

	put_task_struct(p);

	return count;
}

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

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

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

static const struct file_operations proc_pid_sched_autogroup_operations = {
	.open		= sched_autogroup_open,
	.read		= seq_read,
	.write		= sched_autogroup_write,
	.llseek		= seq_lseek,
	.release	= single_release,
};

#endif /* CONFIG_SCHED_AUTOGROUP */

1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450
static ssize_t comm_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;
	char buffer[TASK_COMM_LEN];

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

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

	if (same_thread_group(current, p))
		set_task_comm(p, buffer);
	else
		count = -EINVAL;

	put_task_struct(p);

	return count;
}

static int comm_show(struct seq_file *m, void *v)
{
	struct inode *inode = m->private;
	struct task_struct *p;

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

	task_lock(p);
	seq_printf(m, "%s\n", p->comm);
	task_unlock(p);

	put_task_struct(p);

	return 0;
}

static int comm_open(struct inode *inode, struct file *filp)
{
J
Jovi Zhang 已提交
1451
	return single_open(filp, comm_show, inode);
1452 1453 1454 1455 1456 1457 1458 1459 1460 1461
}

static const struct file_operations proc_pid_set_comm_operations = {
	.open		= comm_open,
	.read		= seq_read,
	.write		= comm_write,
	.llseek		= seq_lseek,
	.release	= single_release,
};

1462
static int proc_exe_link(struct dentry *dentry, struct path *exe_path)
M
Matt Helsley 已提交
1463 1464 1465 1466 1467
{
	struct task_struct *task;
	struct mm_struct *mm;
	struct file *exe_file;

1468
	task = get_proc_task(dentry->d_inode);
M
Matt Helsley 已提交
1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485
	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;
}

1486
static void *proc_pid_follow_link(struct dentry *dentry, struct nameidata *nd)
L
Linus Torvalds 已提交
1487 1488 1489 1490 1491
{
	struct inode *inode = dentry->d_inode;
	int error = -EACCES;

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

1494 1495
	/* Are we allowed to snoop on the tasks file descriptors? */
	if (!proc_fd_access_allowed(inode))
L
Linus Torvalds 已提交
1496 1497
		goto out;

1498
	error = PROC_I(inode)->op.proc_get_link(dentry, &nd->path);
L
Linus Torvalds 已提交
1499
out:
1500
	return ERR_PTR(error);
L
Linus Torvalds 已提交
1501 1502
}

1503
static int do_proc_readlink(struct path *path, char __user *buffer, int buflen)
L
Linus Torvalds 已提交
1504
{
1505
	char *tmp = (char*)__get_free_page(GFP_TEMPORARY);
1506
	char *pathname;
L
Linus Torvalds 已提交
1507 1508 1509 1510
	int len;

	if (!tmp)
		return -ENOMEM;
1511

1512
	pathname = d_path(path, tmp, PAGE_SIZE);
1513 1514
	len = PTR_ERR(pathname);
	if (IS_ERR(pathname))
L
Linus Torvalds 已提交
1515
		goto out;
1516
	len = tmp + PAGE_SIZE - 1 - pathname;
L
Linus Torvalds 已提交
1517 1518 1519

	if (len > buflen)
		len = buflen;
1520
	if (copy_to_user(buffer, pathname, len))
L
Linus Torvalds 已提交
1521 1522 1523 1524 1525 1526 1527 1528 1529 1530
		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;
1531
	struct path path;
L
Linus Torvalds 已提交
1532

1533 1534
	/* Are we allowed to snoop on the tasks file descriptors? */
	if (!proc_fd_access_allowed(inode))
L
Linus Torvalds 已提交
1535 1536
		goto out;

1537
	error = PROC_I(inode)->op.proc_get_link(dentry, &path);
L
Linus Torvalds 已提交
1538 1539 1540
	if (error)
		goto out;

1541 1542
	error = do_proc_readlink(&path, buffer, buflen);
	path_put(&path);
L
Linus Torvalds 已提交
1543 1544 1545 1546
out:
	return error;
}

1547
static const struct inode_operations proc_pid_link_inode_operations = {
L
Linus Torvalds 已提交
1548
	.readlink	= proc_pid_readlink,
1549 1550
	.follow_link	= proc_pid_follow_link,
	.setattr	= proc_setattr,
L
Linus Torvalds 已提交
1551 1552
};

1553 1554 1555 1556

/* building an inode */

static int task_dumpable(struct task_struct *task)
L
Linus Torvalds 已提交
1557
{
1558 1559
	int dumpable = 0;
	struct mm_struct *mm;
L
Linus Torvalds 已提交
1560

1561 1562 1563
	task_lock(task);
	mm = task->mm;
	if (mm)
1564
		dumpable = get_dumpable(mm);
1565 1566 1567 1568 1569
	task_unlock(task);
	if(dumpable == 1)
		return 1;
	return 0;
}
L
Linus Torvalds 已提交
1570

1571
struct inode *proc_pid_make_inode(struct super_block * sb, struct task_struct *task)
1572 1573 1574
{
	struct inode * inode;
	struct proc_inode *ei;
1575
	const struct cred *cred;
L
Linus Torvalds 已提交
1576

1577
	/* We need a new inode */
L
Linus Torvalds 已提交
1578

1579 1580 1581 1582 1583 1584
	inode = new_inode(sb);
	if (!inode)
		goto out;

	/* Common stuff */
	ei = PROC_I(inode);
1585
	inode->i_ino = get_next_ino();
1586 1587 1588 1589 1590 1591
	inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
	inode->i_op = &proc_def_inode_operations;

	/*
	 * grab the reference to task.
	 */
1592
	ei->pid = get_task_pid(task, PIDTYPE_PID);
1593 1594 1595 1596
	if (!ei->pid)
		goto out_unlock;

	if (task_dumpable(task)) {
1597 1598 1599 1600 1601
		rcu_read_lock();
		cred = __task_cred(task);
		inode->i_uid = cred->euid;
		inode->i_gid = cred->egid;
		rcu_read_unlock();
L
Linus Torvalds 已提交
1602
	}
1603 1604
	security_task_to_inode(task, inode);

L
Linus Torvalds 已提交
1605
out:
1606 1607 1608 1609 1610
	return inode;

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

1613
int pid_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
L
Linus Torvalds 已提交
1614 1615
{
	struct inode *inode = dentry->d_inode;
1616
	struct task_struct *task;
1617 1618
	const struct cred *cred;

1619
	generic_fillattr(inode, stat);
L
Linus Torvalds 已提交
1620

1621 1622 1623 1624 1625 1626 1627
	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)) {
1628 1629 1630
			cred = __task_cred(task);
			stat->uid = cred->euid;
			stat->gid = cred->egid;
L
Linus Torvalds 已提交
1631 1632
		}
	}
1633
	rcu_read_unlock();
A
Alan Cox 已提交
1634
	return 0;
L
Linus Torvalds 已提交
1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645
}

/* 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.
1646 1647 1648 1649 1650 1651 1652
 *
 * 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 已提交
1653
 */
1654
int pid_revalidate(struct dentry *dentry, struct nameidata *nd)
L
Linus Torvalds 已提交
1655
{
1656 1657
	struct inode *inode;
	struct task_struct *task;
1658 1659
	const struct cred *cred;

1660 1661 1662 1663 1664 1665
	if (nd && nd->flags & LOOKUP_RCU)
		return -ECHILD;

	inode = dentry->d_inode;
	task = get_proc_task(inode);

1666 1667 1668
	if (task) {
		if ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||
		    task_dumpable(task)) {
1669 1670 1671 1672 1673
			rcu_read_lock();
			cred = __task_cred(task);
			inode->i_uid = cred->euid;
			inode->i_gid = cred->egid;
			rcu_read_unlock();
L
Linus Torvalds 已提交
1674 1675 1676 1677
		} else {
			inode->i_uid = 0;
			inode->i_gid = 0;
		}
L
Linus Torvalds 已提交
1678
		inode->i_mode &= ~(S_ISUID | S_ISGID);
L
Linus Torvalds 已提交
1679
		security_task_to_inode(task, inode);
1680
		put_task_struct(task);
L
Linus Torvalds 已提交
1681 1682 1683 1684 1685 1686
		return 1;
	}
	d_drop(dentry);
	return 0;
}

N
Nick Piggin 已提交
1687
static int pid_delete_dentry(const struct dentry * dentry)
1688
{
1689 1690 1691 1692 1693 1694 1695
	/* 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;
}

1696
const struct dentry_operations pid_dentry_operations =
1697 1698 1699 1700 1701 1702 1703
{
	.d_revalidate	= pid_revalidate,
	.d_delete	= pid_delete_dentry,
};

/* Lookups */

1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715
/*
 * 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.
 */
1716 1717
int proc_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
	const char *name, int len,
1718
	instantiate_t instantiate, struct task_struct *task, const void *ptr)
1719
{
1720
	struct dentry *child, *dir = filp->f_path.dentry;
1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757
	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);
}

1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779
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 已提交
1780 1781
#define PROC_FDINFO_MAX 64

1782
static int proc_fd_info(struct inode *inode, struct path *path, char *info)
1783
{
1784 1785
	struct task_struct *task = get_proc_task(inode);
	struct files_struct *files = NULL;
1786 1787
	struct file *file;
	int fd = proc_fd(inode);
1788

1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821
	if (task) {
		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) {
			unsigned int f_flags;
			struct fdtable *fdt;

			fdt = files_fdtable(files);
			f_flags = file->f_flags & ~O_CLOEXEC;
			if (FD_ISSET(fd, fdt->close_on_exec))
				f_flags |= O_CLOEXEC;

			if (path) {
				*path = file->f_path;
				path_get(&file->f_path);
			}
			if (info)
				snprintf(info, PROC_FDINFO_MAX,
					 "pos:\t%lli\n"
					 "flags:\t0%o\n",
					 (long long) file->f_pos,
					 f_flags);
			spin_unlock(&files->file_lock);
			put_files_struct(files);
			return 0;
1822
		}
1823 1824 1825 1826
		spin_unlock(&files->file_lock);
		put_files_struct(files);
	}
	return -ENOENT;
1827 1828
}

1829
static int proc_fd_link(struct dentry *dentry, struct path *path)
M
Miklos Szeredi 已提交
1830
{
1831
	return proc_fd_info(dentry->d_inode, path, NULL);
M
Miklos Szeredi 已提交
1832 1833
}

L
Linus Torvalds 已提交
1834 1835
static int tid_fd_revalidate(struct dentry *dentry, struct nameidata *nd)
{
1836 1837 1838
	struct inode *inode;
	struct task_struct *task;
	int fd;
L
Linus Torvalds 已提交
1839
	struct files_struct *files;
1840
	const struct cred *cred;
L
Linus Torvalds 已提交
1841

1842 1843 1844 1845 1846 1847 1848
	if (nd && nd->flags & LOOKUP_RCU)
		return -ECHILD;

	inode = dentry->d_inode;
	task = get_proc_task(inode);
	fd = proc_fd(inode);

1849 1850 1851 1852 1853 1854 1855 1856
	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)) {
1857 1858 1859 1860 1861
					rcu_read_lock();
					cred = __task_cred(task);
					inode->i_uid = cred->euid;
					inode->i_gid = cred->egid;
					rcu_read_unlock();
1862 1863 1864 1865
				} else {
					inode->i_uid = 0;
					inode->i_gid = 0;
				}
L
Linus Torvalds 已提交
1866
				inode->i_mode &= ~(S_ISUID | S_ISGID);
1867 1868 1869 1870
				security_task_to_inode(task, inode);
				put_task_struct(task);
				return 1;
			}
1871
			rcu_read_unlock();
L
Linus Torvalds 已提交
1872 1873
			put_files_struct(files);
		}
1874
		put_task_struct(task);
L
Linus Torvalds 已提交
1875 1876 1877 1878 1879
	}
	d_drop(dentry);
	return 0;
}

A
Al Viro 已提交
1880
static const struct dentry_operations tid_fd_dentry_operations =
L
Linus Torvalds 已提交
1881 1882 1883 1884 1885
{
	.d_revalidate	= tid_fd_revalidate,
	.d_delete	= pid_delete_dentry,
};

1886
static struct dentry *proc_fd_instantiate(struct inode *dir,
1887
	struct dentry *dentry, struct task_struct *task, const void *ptr)
L
Linus Torvalds 已提交
1888
{
1889
	unsigned fd = *(const unsigned *)ptr;
1890 1891 1892 1893 1894
	struct file *file;
	struct files_struct *files;
 	struct inode *inode;
 	struct proc_inode *ei;
	struct dentry *error = ERR_PTR(-ENOENT);
L
Linus Torvalds 已提交
1895

1896
	inode = proc_pid_make_inode(dir->i_sb, task);
L
Linus Torvalds 已提交
1897 1898 1899
	if (!inode)
		goto out;
	ei = PROC_I(inode);
1900
	ei->fd = fd;
L
Linus Torvalds 已提交
1901 1902
	files = get_files_struct(task);
	if (!files)
1903
		goto out_iput;
L
Linus Torvalds 已提交
1904
	inode->i_mode = S_IFLNK;
1905 1906 1907 1908 1909 1910

	/*
	 * We are not taking a ref to the file structure, so we must
	 * hold ->file_lock.
	 */
	spin_lock(&files->file_lock);
L
Linus Torvalds 已提交
1911 1912
	file = fcheck_files(files, fd);
	if (!file)
1913
		goto out_unlock;
1914
	if (file->f_mode & FMODE_READ)
L
Linus Torvalds 已提交
1915
		inode->i_mode |= S_IRUSR | S_IXUSR;
1916
	if (file->f_mode & FMODE_WRITE)
L
Linus Torvalds 已提交
1917
		inode->i_mode |= S_IWUSR | S_IXUSR;
1918
	spin_unlock(&files->file_lock);
L
Linus Torvalds 已提交
1919
	put_files_struct(files);
1920

1921
	inode->i_op = &proc_pid_link_inode_operations;
L
Linus Torvalds 已提交
1922 1923
	inode->i_size = 64;
	ei->op.proc_get_link = proc_fd_link;
1924
	d_set_d_op(dentry, &tid_fd_dentry_operations);
L
Linus Torvalds 已提交
1925
	d_add(dentry, inode);
1926 1927
	/* Close the race of the process dying before we return the dentry */
	if (tid_fd_revalidate(dentry, NULL))
1928
		error = NULL;
L
Linus Torvalds 已提交
1929

1930 1931 1932
 out:
	return error;
out_unlock:
1933
	spin_unlock(&files->file_lock);
L
Linus Torvalds 已提交
1934
	put_files_struct(files);
1935
out_iput:
L
Linus Torvalds 已提交
1936
	iput(inode);
1937
	goto out;
L
Linus Torvalds 已提交
1938 1939
}

M
Miklos Szeredi 已提交
1940 1941 1942
static struct dentry *proc_lookupfd_common(struct inode *dir,
					   struct dentry *dentry,
					   instantiate_t instantiate)
1943 1944 1945 1946 1947 1948 1949 1950 1951 1952
{
	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 已提交
1953
	result = instantiate(dir, dentry, task, &fd);
1954 1955 1956 1957 1958 1959
out:
	put_task_struct(task);
out_no_task:
	return result;
}

M
Miklos Szeredi 已提交
1960 1961
static int proc_readfd_common(struct file * filp, void * dirent,
			      filldir_t filldir, instantiate_t instantiate)
1962
{
1963
	struct dentry *dentry = filp->f_path.dentry;
1964 1965
	struct inode *inode = dentry->d_inode;
	struct task_struct *p = get_proc_task(inode);
1966
	unsigned int fd, ino;
1967 1968
	int retval;
	struct files_struct * files;
L
Linus Torvalds 已提交
1969

1970 1971 1972 1973 1974 1975 1976 1977 1978
	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)
1979
				goto out;
1980 1981 1982 1983
			filp->f_pos++;
		case 1:
			ino = parent_ino(dentry);
			if (filldir(dirent, "..", 2, 1, ino, DT_DIR) < 0)
1984
				goto out;
1985 1986 1987 1988
			filp->f_pos++;
		default:
			files = get_files_struct(p);
			if (!files)
1989
				goto out;
1990 1991
			rcu_read_lock();
			for (fd = filp->f_pos-2;
A
Al Viro 已提交
1992
			     fd < files_fdtable(files)->max_fds;
1993
			     fd++, filp->f_pos++) {
M
Miklos Szeredi 已提交
1994 1995
				char name[PROC_NUMBUF];
				int len;
1996 1997 1998 1999 2000

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

M
Miklos Szeredi 已提交
2001 2002 2003 2004
				len = snprintf(name, sizeof(name), "%d", fd);
				if (proc_fill_cache(filp, dirent, filldir,
						    name, len, instantiate,
						    p, &fd) < 0) {
2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018
					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 已提交
2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033
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];
2034
	int err = proc_fd_info(file->f_path.dentry->d_inode, NULL, tmp);
M
Miklos Szeredi 已提交
2035 2036 2037 2038 2039 2040
	if (!err)
		err = simple_read_from_buffer(buf, len, ppos, tmp, strlen(tmp));
	return err;
}

static const struct file_operations proc_fdinfo_file_operations = {
2041
	.open           = nonseekable_open,
M
Miklos Szeredi 已提交
2042
	.read		= proc_fdinfo_read,
2043
	.llseek		= no_llseek,
M
Miklos Szeredi 已提交
2044 2045
};

2046
static const struct file_operations proc_fd_operations = {
2047 2048
	.read		= generic_read_dir,
	.readdir	= proc_readfd,
2049
	.llseek		= default_llseek,
L
Linus Torvalds 已提交
2050 2051
};

2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 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 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 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 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 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 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400
#ifdef CONFIG_CHECKPOINT_RESTORE

/*
 * dname_to_vma_addr - maps a dentry name into two unsigned longs
 * which represent vma start and end addresses.
 */
static int dname_to_vma_addr(struct dentry *dentry,
			     unsigned long *start, unsigned long *end)
{
	if (sscanf(dentry->d_name.name, "%lx-%lx", start, end) != 2)
		return -EINVAL;

	return 0;
}

static int map_files_d_revalidate(struct dentry *dentry, struct nameidata *nd)
{
	unsigned long vm_start, vm_end;
	bool exact_vma_exists = false;
	struct mm_struct *mm = NULL;
	struct task_struct *task;
	const struct cred *cred;
	struct inode *inode;
	int status = 0;

	if (nd && nd->flags & LOOKUP_RCU)
		return -ECHILD;

	if (!capable(CAP_SYS_ADMIN)) {
		status = -EACCES;
		goto out_notask;
	}

	inode = dentry->d_inode;
	task = get_proc_task(inode);
	if (!task)
		goto out_notask;

	if (!ptrace_may_access(task, PTRACE_MODE_READ))
		goto out;

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

	if (!dname_to_vma_addr(dentry, &vm_start, &vm_end)) {
		down_read(&mm->mmap_sem);
		exact_vma_exists = !!find_exact_vma(mm, vm_start, vm_end);
		up_read(&mm->mmap_sem);
	}

	mmput(mm);

	if (exact_vma_exists) {
		if (task_dumpable(task)) {
			rcu_read_lock();
			cred = __task_cred(task);
			inode->i_uid = cred->euid;
			inode->i_gid = cred->egid;
			rcu_read_unlock();
		} else {
			inode->i_uid = 0;
			inode->i_gid = 0;
		}
		security_task_to_inode(task, inode);
		status = 1;
	}

out:
	put_task_struct(task);

out_notask:
	if (status <= 0)
		d_drop(dentry);

	return status;
}

static const struct dentry_operations tid_map_files_dentry_operations = {
	.d_revalidate	= map_files_d_revalidate,
	.d_delete	= pid_delete_dentry,
};

static int proc_map_files_get_link(struct dentry *dentry, struct path *path)
{
	unsigned long vm_start, vm_end;
	struct vm_area_struct *vma;
	struct task_struct *task;
	struct mm_struct *mm;
	int rc;

	rc = -ENOENT;
	task = get_proc_task(dentry->d_inode);
	if (!task)
		goto out;

	mm = get_task_mm(task);
	put_task_struct(task);
	if (!mm)
		goto out;

	rc = dname_to_vma_addr(dentry, &vm_start, &vm_end);
	if (rc)
		goto out_mmput;

	down_read(&mm->mmap_sem);
	vma = find_exact_vma(mm, vm_start, vm_end);
	if (vma && vma->vm_file) {
		*path = vma->vm_file->f_path;
		path_get(path);
		rc = 0;
	}
	up_read(&mm->mmap_sem);

out_mmput:
	mmput(mm);
out:
	return rc;
}

struct map_files_info {
	struct file	*file;
	unsigned long	len;
	unsigned char	name[4*sizeof(long)+2]; /* max: %lx-%lx\0 */
};

static struct dentry *
proc_map_files_instantiate(struct inode *dir, struct dentry *dentry,
			   struct task_struct *task, const void *ptr)
{
	const struct file *file = ptr;
	struct proc_inode *ei;
	struct inode *inode;

	if (!file)
		return ERR_PTR(-ENOENT);

	inode = proc_pid_make_inode(dir->i_sb, task);
	if (!inode)
		return ERR_PTR(-ENOENT);

	ei = PROC_I(inode);
	ei->op.proc_get_link = proc_map_files_get_link;

	inode->i_op = &proc_pid_link_inode_operations;
	inode->i_size = 64;
	inode->i_mode = S_IFLNK;

	if (file->f_mode & FMODE_READ)
		inode->i_mode |= S_IRUSR;
	if (file->f_mode & FMODE_WRITE)
		inode->i_mode |= S_IWUSR;

	d_set_d_op(dentry, &tid_map_files_dentry_operations);
	d_add(dentry, inode);

	return NULL;
}

static struct dentry *proc_map_files_lookup(struct inode *dir,
		struct dentry *dentry, struct nameidata *nd)
{
	unsigned long vm_start, vm_end;
	struct vm_area_struct *vma;
	struct task_struct *task;
	struct dentry *result;
	struct mm_struct *mm;

	result = ERR_PTR(-EACCES);
	if (!capable(CAP_SYS_ADMIN))
		goto out;

	result = ERR_PTR(-ENOENT);
	task = get_proc_task(dir);
	if (!task)
		goto out;

	result = ERR_PTR(-EACCES);
	if (lock_trace(task))
		goto out_put_task;

	result = ERR_PTR(-ENOENT);
	if (dname_to_vma_addr(dentry, &vm_start, &vm_end))
		goto out_unlock;

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

	down_read(&mm->mmap_sem);
	vma = find_exact_vma(mm, vm_start, vm_end);
	if (!vma)
		goto out_no_vma;

	result = proc_map_files_instantiate(dir, dentry, task, vma->vm_file);

out_no_vma:
	up_read(&mm->mmap_sem);
	mmput(mm);
out_unlock:
	unlock_trace(task);
out_put_task:
	put_task_struct(task);
out:
	return result;
}

static const struct inode_operations proc_map_files_inode_operations = {
	.lookup		= proc_map_files_lookup,
	.permission	= proc_fd_permission,
	.setattr	= proc_setattr,
};

static int
proc_map_files_readdir(struct file *filp, void *dirent, filldir_t filldir)
{
	struct dentry *dentry = filp->f_path.dentry;
	struct inode *inode = dentry->d_inode;
	struct vm_area_struct *vma;
	struct task_struct *task;
	struct mm_struct *mm;
	ino_t ino;
	int ret;

	ret = -EACCES;
	if (!capable(CAP_SYS_ADMIN))
		goto out;

	ret = -ENOENT;
	task = get_proc_task(inode);
	if (!task)
		goto out;

	ret = -EACCES;
	if (lock_trace(task))
		goto out_put_task;

	ret = 0;
	switch (filp->f_pos) {
	case 0:
		ino = inode->i_ino;
		if (filldir(dirent, ".", 1, 0, ino, DT_DIR) < 0)
			goto out_unlock;
		filp->f_pos++;
	case 1:
		ino = parent_ino(dentry);
		if (filldir(dirent, "..", 2, 1, ino, DT_DIR) < 0)
			goto out_unlock;
		filp->f_pos++;
	default:
	{
		unsigned long nr_files, pos, i;
		struct flex_array *fa = NULL;
		struct map_files_info info;
		struct map_files_info *p;

		mm = get_task_mm(task);
		if (!mm)
			goto out_unlock;
		down_read(&mm->mmap_sem);

		nr_files = 0;

		/*
		 * We need two passes here:
		 *
		 *  1) Collect vmas of mapped files with mmap_sem taken
		 *  2) Release mmap_sem and instantiate entries
		 *
		 * otherwise we get lockdep complained, since filldir()
		 * routine might require mmap_sem taken in might_fault().
		 */

		for (vma = mm->mmap, pos = 2; vma; vma = vma->vm_next) {
			if (vma->vm_file && ++pos > filp->f_pos)
				nr_files++;
		}

		if (nr_files) {
			fa = flex_array_alloc(sizeof(info), nr_files,
						GFP_KERNEL);
			if (!fa || flex_array_prealloc(fa, 0, nr_files,
							GFP_KERNEL)) {
				ret = -ENOMEM;
				if (fa)
					flex_array_free(fa);
				up_read(&mm->mmap_sem);
				mmput(mm);
				goto out_unlock;
			}
			for (i = 0, vma = mm->mmap, pos = 2; vma;
					vma = vma->vm_next) {
				if (!vma->vm_file)
					continue;
				if (++pos <= filp->f_pos)
					continue;

				get_file(vma->vm_file);
				info.file = vma->vm_file;
				info.len = snprintf(info.name,
						sizeof(info.name), "%lx-%lx",
						vma->vm_start, vma->vm_end);
				if (flex_array_put(fa, i++, &info, GFP_KERNEL))
					BUG();
			}
		}
		up_read(&mm->mmap_sem);

		for (i = 0; i < nr_files; i++) {
			p = flex_array_get(fa, i);
			ret = proc_fill_cache(filp, dirent, filldir,
					      p->name, p->len,
					      proc_map_files_instantiate,
					      task, p->file);
			if (ret)
				break;
			filp->f_pos++;
			fput(p->file);
		}
		for (; i < nr_files; i++) {
			/*
			 * In case of error don't forget
			 * to put rest of file refs.
			 */
			p = flex_array_get(fa, i);
			fput(p->file);
		}
		if (fa)
			flex_array_free(fa);
		mmput(mm);
	}
	}

out_unlock:
	unlock_trace(task);
out_put_task:
	put_task_struct(task);
out:
	return ret;
}

static const struct file_operations proc_map_files_operations = {
	.read		= generic_read_dir,
	.readdir	= proc_map_files_readdir,
	.llseek		= default_llseek,
};

#endif /* CONFIG_CHECKPOINT_RESTORE */

2401 2402 2403 2404
/*
 * /proc/pid/fd needs a special permission handler so that a process can still
 * access /proc/self/fd after it has executed a setuid().
 */
2405
static int proc_fd_permission(struct inode *inode, int mask)
2406
{
2407
	int rv = generic_permission(inode, mask);
2408 2409 2410 2411 2412 2413 2414
	if (rv == 0)
		return 0;
	if (task_pid(current) == proc_pid(inode))
		rv = 0;
	return rv;
}

L
Linus Torvalds 已提交
2415 2416 2417
/*
 * proc directories can do almost nothing..
 */
2418
static const struct inode_operations proc_fd_inode_operations = {
L
Linus Torvalds 已提交
2419
	.lookup		= proc_lookupfd,
2420
	.permission	= proc_fd_permission,
2421
	.setattr	= proc_setattr,
L
Linus Torvalds 已提交
2422 2423
};

M
Miklos Szeredi 已提交
2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438
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;
2439
	d_set_d_op(dentry, &tid_fd_dentry_operations);
M
Miklos Szeredi 已提交
2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464
	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,
2465
	.llseek		= default_llseek,
M
Miklos Szeredi 已提交
2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476
};

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


2477
static struct dentry *proc_pident_instantiate(struct inode *dir,
2478
	struct dentry *dentry, struct task_struct *task, const void *ptr)
2479
{
2480
	const struct pid_entry *p = ptr;
2481 2482
	struct inode *inode;
	struct proc_inode *ei;
2483
	struct dentry *error = ERR_PTR(-ENOENT);
2484

2485
	inode = proc_pid_make_inode(dir->i_sb, task);
2486 2487 2488 2489 2490 2491
	if (!inode)
		goto out;

	ei = PROC_I(inode);
	inode->i_mode = p->mode;
	if (S_ISDIR(inode->i_mode))
M
Miklos Szeredi 已提交
2492
		set_nlink(inode, 2);	/* Use getattr to fix if necessary */
2493 2494 2495 2496 2497
	if (p->iop)
		inode->i_op = p->iop;
	if (p->fop)
		inode->i_fop = p->fop;
	ei->op = p->op;
2498
	d_set_d_op(dentry, &pid_dentry_operations);
2499 2500 2501 2502 2503 2504 2505 2506
	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 已提交
2507 2508
static struct dentry *proc_pident_lookup(struct inode *dir, 
					 struct dentry *dentry,
2509
					 const struct pid_entry *ents,
2510
					 unsigned int nents)
L
Linus Torvalds 已提交
2511
{
2512
	struct dentry *error;
2513
	struct task_struct *task = get_proc_task(dir);
2514
	const struct pid_entry *p, *last;
L
Linus Torvalds 已提交
2515

2516
	error = ERR_PTR(-ENOENT);
L
Linus Torvalds 已提交
2517

2518 2519
	if (!task)
		goto out_no_task;
L
Linus Torvalds 已提交
2520

2521 2522 2523 2524
	/*
	 * Yes, it does not scale. And it should not. Don't add
	 * new entries into /proc/<tgid>/ without very good reasons.
	 */
2525 2526
	last = &ents[nents - 1];
	for (p = ents; p <= last; p++) {
L
Linus Torvalds 已提交
2527 2528 2529 2530 2531
		if (p->len != dentry->d_name.len)
			continue;
		if (!memcmp(dentry->d_name.name, p->name, p->len))
			break;
	}
2532
	if (p > last)
L
Linus Torvalds 已提交
2533 2534
		goto out;

2535
	error = proc_pident_instantiate(dir, dentry, task, p);
L
Linus Torvalds 已提交
2536
out:
2537 2538
	put_task_struct(task);
out_no_task:
2539
	return error;
L
Linus Torvalds 已提交
2540 2541
}

2542 2543
static int proc_pident_fill_cache(struct file *filp, void *dirent,
	filldir_t filldir, struct task_struct *task, const struct pid_entry *p)
2544 2545 2546 2547 2548
{
	return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
				proc_pident_instantiate, task, p);
}

2549 2550
static int proc_pident_readdir(struct file *filp,
		void *dirent, filldir_t filldir,
2551
		const struct pid_entry *ents, unsigned int nents)
2552 2553
{
	int i;
2554
	struct dentry *dentry = filp->f_path.dentry;
2555 2556
	struct inode *inode = dentry->d_inode;
	struct task_struct *task = get_proc_task(inode);
2557
	const struct pid_entry *p, *last;
2558 2559 2560 2561 2562
	ino_t ino;
	int ret;

	ret = -ENOENT;
	if (!task)
2563
		goto out_no_task;
2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588

	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;
2589 2590
		last = &ents[nents - 1];
		while (p <= last) {
2591
			if (proc_pident_fill_cache(filp, dirent, filldir, task, p) < 0)
2592 2593 2594 2595 2596 2597 2598 2599
				goto out;
			filp->f_pos++;
			p++;
		}
	}

	ret = 1;
out:
2600 2601
	put_task_struct(task);
out_no_task:
2602
	return ret;
L
Linus Torvalds 已提交
2603 2604
}

2605 2606 2607 2608
#ifdef CONFIG_SECURITY
static ssize_t proc_pid_attr_read(struct file * file, char __user * buf,
				  size_t count, loff_t *ppos)
{
2609
	struct inode * inode = file->f_path.dentry->d_inode;
2610
	char *p = NULL;
2611 2612 2613 2614
	ssize_t length;
	struct task_struct *task = get_proc_task(inode);

	if (!task)
2615
		return -ESRCH;
2616 2617

	length = security_getprocattr(task,
2618
				      (char*)file->f_path.dentry->d_name.name,
2619
				      &p);
2620
	put_task_struct(task);
2621 2622 2623
	if (length > 0)
		length = simple_read_from_buffer(buf, count, ppos, p, length);
	kfree(p);
2624
	return length;
L
Linus Torvalds 已提交
2625 2626
}

2627 2628 2629
static ssize_t proc_pid_attr_write(struct file * file, const char __user * buf,
				   size_t count, loff_t *ppos)
{
2630
	struct inode * inode = file->f_path.dentry->d_inode;
2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646
	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;
2647
	page = (char*)__get_free_page(GFP_TEMPORARY);
2648 2649 2650 2651 2652 2653 2654
	if (!page)
		goto out;

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

2655
	/* Guard against adverse ptrace interaction */
2656
	length = mutex_lock_interruptible(&task->signal->cred_guard_mutex);
2657 2658 2659
	if (length < 0)
		goto out_free;

2660
	length = security_setprocattr(task,
2661
				      (char*)file->f_path.dentry->d_name.name,
2662
				      (void*)page, count);
2663
	mutex_unlock(&task->signal->cred_guard_mutex);
2664 2665 2666 2667 2668 2669 2670 2671
out_free:
	free_page((unsigned long) page);
out:
	put_task_struct(task);
out_no_task:
	return length;
}

2672
static const struct file_operations proc_pid_attr_operations = {
2673 2674
	.read		= proc_pid_attr_read,
	.write		= proc_pid_attr_write,
2675
	.llseek		= generic_file_llseek,
2676 2677
};

2678
static const struct pid_entry attr_dir_stuff[] = {
A
Alexey Dobriyan 已提交
2679 2680 2681 2682 2683 2684
	REG("current",    S_IRUGO|S_IWUGO, proc_pid_attr_operations),
	REG("prev",       S_IRUGO,	   proc_pid_attr_operations),
	REG("exec",       S_IRUGO|S_IWUGO, proc_pid_attr_operations),
	REG("fscreate",   S_IRUGO|S_IWUGO, proc_pid_attr_operations),
	REG("keycreate",  S_IRUGO|S_IWUGO, proc_pid_attr_operations),
	REG("sockcreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
2685 2686
};

2687
static int proc_attr_dir_readdir(struct file * filp,
2688 2689 2690
			     void * dirent, filldir_t filldir)
{
	return proc_pident_readdir(filp,dirent,filldir,
2691
				   attr_dir_stuff,ARRAY_SIZE(attr_dir_stuff));
2692 2693
}

2694
static const struct file_operations proc_attr_dir_operations = {
L
Linus Torvalds 已提交
2695
	.read		= generic_read_dir,
2696
	.readdir	= proc_attr_dir_readdir,
2697
	.llseek		= default_llseek,
L
Linus Torvalds 已提交
2698 2699
};

2700
static struct dentry *proc_attr_dir_lookup(struct inode *dir,
2701 2702
				struct dentry *dentry, struct nameidata *nd)
{
2703 2704
	return proc_pident_lookup(dir, dentry,
				  attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff));
2705 2706
}

2707
static const struct inode_operations proc_attr_dir_inode_operations = {
2708
	.lookup		= proc_attr_dir_lookup,
2709
	.getattr	= pid_getattr,
2710
	.setattr	= proc_setattr,
L
Linus Torvalds 已提交
2711 2712
};

2713 2714
#endif

C
Christoph Hellwig 已提交
2715
#ifdef CONFIG_ELF_CORE
2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796
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,
2797
	.llseek		= generic_file_llseek,
2798 2799 2800
};
#endif

2801 2802 2803 2804 2805 2806
/*
 * /proc/self:
 */
static int proc_self_readlink(struct dentry *dentry, char __user *buffer,
			      int buflen)
{
2807
	struct pid_namespace *ns = dentry->d_sb->s_fs_info;
2808
	pid_t tgid = task_tgid_nr_ns(current, ns);
2809
	char tmp[PROC_NUMBUF];
2810
	if (!tgid)
2811
		return -ENOENT;
2812
	sprintf(tmp, "%d", tgid);
2813 2814 2815 2816 2817
	return vfs_readlink(dentry,buffer,buflen,tmp);
}

static void *proc_self_follow_link(struct dentry *dentry, struct nameidata *nd)
{
2818
	struct pid_namespace *ns = dentry->d_sb->s_fs_info;
2819
	pid_t tgid = task_tgid_nr_ns(current, ns);
A
Al Viro 已提交
2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837
	char *name = ERR_PTR(-ENOENT);
	if (tgid) {
		name = __getname();
		if (!name)
			name = ERR_PTR(-ENOMEM);
		else
			sprintf(name, "%d", tgid);
	}
	nd_set_link(nd, name);
	return NULL;
}

static void proc_self_put_link(struct dentry *dentry, struct nameidata *nd,
				void *cookie)
{
	char *s = nd_get_link(nd);
	if (!IS_ERR(s))
		__putname(s);
2838 2839
}

2840
static const struct inode_operations proc_self_inode_operations = {
2841 2842
	.readlink	= proc_self_readlink,
	.follow_link	= proc_self_follow_link,
A
Al Viro 已提交
2843
	.put_link	= proc_self_put_link,
2844 2845
};

2846 2847 2848 2849 2850 2851 2852
/*
 * 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.
 */
2853
static const struct pid_entry proc_base_stuff[] = {
2854
	NOD("self", S_IFLNK|S_IRWXUGO,
2855 2856 2857
		&proc_self_inode_operations, NULL, {}),
};

2858
static struct dentry *proc_base_instantiate(struct inode *dir,
2859
	struct dentry *dentry, struct task_struct *task, const void *ptr)
2860
{
2861
	const struct pid_entry *p = ptr;
2862 2863
	struct inode *inode;
	struct proc_inode *ei;
2864
	struct dentry *error;
2865 2866 2867 2868 2869 2870 2871 2872 2873

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

	/* Initialize the inode */
	ei = PROC_I(inode);
2874
	inode->i_ino = get_next_ino();
2875 2876 2877 2878 2879
	inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;

	/*
	 * grab the reference to the task.
	 */
2880
	ei->pid = get_task_pid(task, PIDTYPE_PID);
2881 2882 2883 2884 2885
	if (!ei->pid)
		goto out_iput;

	inode->i_mode = p->mode;
	if (S_ISDIR(inode->i_mode))
M
Miklos Szeredi 已提交
2886
		set_nlink(inode, 2);
2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902
	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;
	d_add(dentry, inode);
	error = NULL;
out:
	return error;
out_iput:
	iput(inode);
	goto out;
}

2903 2904 2905 2906
static struct dentry *proc_base_lookup(struct inode *dir, struct dentry *dentry)
{
	struct dentry *error;
	struct task_struct *task = get_proc_task(dir);
2907
	const struct pid_entry *p, *last;
2908 2909 2910 2911 2912 2913 2914

	error = ERR_PTR(-ENOENT);

	if (!task)
		goto out_no_task;

	/* Lookup the directory entry */
2915 2916
	last = &proc_base_stuff[ARRAY_SIZE(proc_base_stuff) - 1];
	for (p = proc_base_stuff; p <= last; p++) {
2917 2918 2919 2920 2921
		if (p->len != dentry->d_name.len)
			continue;
		if (!memcmp(dentry->d_name.name, p->name, p->len))
			break;
	}
2922
	if (p > last)
2923 2924 2925 2926 2927 2928 2929 2930 2931 2932
		goto out;

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

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

2933 2934
static int proc_base_fill_cache(struct file *filp, void *dirent,
	filldir_t filldir, struct task_struct *task, const struct pid_entry *p)
2935 2936 2937 2938 2939
{
	return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
				proc_base_instantiate, task, p);
}

2940
#ifdef CONFIG_TASK_IO_ACCOUNTING
2941 2942
static int do_io_accounting(struct task_struct *task, char *buffer, int whole)
{
2943
	struct task_io_accounting acct = task->ioac;
2944
	unsigned long flags;
2945
	int result;
2946

2947 2948 2949 2950 2951 2952 2953 2954
	result = mutex_lock_killable(&task->signal->cred_guard_mutex);
	if (result)
		return result;

	if (!ptrace_may_access(task, PTRACE_MODE_READ)) {
		result = -EACCES;
		goto out_unlock;
	}
2955

2956 2957 2958 2959 2960 2961 2962 2963
	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);
2964
	}
2965
	result = sprintf(buffer,
2966 2967 2968 2969 2970 2971 2972
			"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 已提交
2973 2974 2975 2976 2977 2978 2979
			(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);
2980 2981 2982
out_unlock:
	mutex_unlock(&task->signal->cred_guard_mutex);
	return result;
2983 2984 2985 2986 2987
}

static int proc_tid_io_accounting(struct task_struct *task, char *buffer)
{
	return do_io_accounting(task, buffer, 0);
2988
}
2989 2990 2991 2992 2993 2994

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

2996 2997 2998
static int proc_pid_personality(struct seq_file *m, struct pid_namespace *ns,
				struct pid *pid, struct task_struct *task)
{
2999 3000 3001 3002 3003 3004
	int err = lock_trace(task);
	if (!err) {
		seq_printf(m, "%08x\n", task->personality);
		unlock_trace(task);
	}
	return err;
3005 3006
}

3007 3008 3009
/*
 * Thread groups
 */
3010
static const struct file_operations proc_task_operations;
3011
static const struct inode_operations proc_task_inode_operations;
3012

3013
static const struct pid_entry tgid_base_stuff[] = {
A
Alexey Dobriyan 已提交
3014 3015
	DIR("task",       S_IRUGO|S_IXUGO, proc_task_inode_operations, proc_task_operations),
	DIR("fd",         S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),
3016 3017 3018
#ifdef CONFIG_CHECKPOINT_RESTORE
	DIR("map_files",  S_IRUSR|S_IXUSR, proc_map_files_inode_operations, proc_map_files_operations),
#endif
A
Alexey Dobriyan 已提交
3019
	DIR("fdinfo",     S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),
3020
	DIR("ns",	  S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),
A
Andrew Morton 已提交
3021
#ifdef CONFIG_NET
A
Alexey Dobriyan 已提交
3022
	DIR("net",        S_IRUGO|S_IXUGO, proc_net_inode_operations, proc_net_operations),
A
Andrew Morton 已提交
3023
#endif
A
Alexey Dobriyan 已提交
3024 3025 3026
	REG("environ",    S_IRUSR, proc_environ_operations),
	INF("auxv",       S_IRUSR, proc_pid_auxv),
	ONE("status",     S_IRUGO, proc_pid_status),
3027
	ONE("personality", S_IRUGO, proc_pid_personality),
3028
	INF("limits",	  S_IRUGO, proc_pid_limits),
I
Ingo Molnar 已提交
3029
#ifdef CONFIG_SCHED_DEBUG
A
Alexey Dobriyan 已提交
3030
	REG("sched",      S_IRUGO|S_IWUSR, proc_pid_sched_operations),
3031 3032 3033
#endif
#ifdef CONFIG_SCHED_AUTOGROUP
	REG("autogroup",  S_IRUGO|S_IWUSR, proc_pid_sched_autogroup_operations),
R
Roland McGrath 已提交
3034
#endif
3035
	REG("comm",      S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),
R
Roland McGrath 已提交
3036
#ifdef CONFIG_HAVE_ARCH_TRACEHOOK
3037
	INF("syscall",    S_IRUGO, proc_pid_syscall),
I
Ingo Molnar 已提交
3038
#endif
A
Alexey Dobriyan 已提交
3039 3040 3041 3042
	INF("cmdline",    S_IRUGO, proc_pid_cmdline),
	ONE("stat",       S_IRUGO, proc_tgid_stat),
	ONE("statm",      S_IRUGO, proc_pid_statm),
	REG("maps",       S_IRUGO, proc_maps_operations),
3043
#ifdef CONFIG_NUMA
A
Alexey Dobriyan 已提交
3044
	REG("numa_maps",  S_IRUGO, proc_numa_maps_operations),
3045
#endif
A
Alexey Dobriyan 已提交
3046 3047 3048 3049 3050 3051 3052
	REG("mem",        S_IRUSR|S_IWUSR, proc_mem_operations),
	LNK("cwd",        proc_cwd_link),
	LNK("root",       proc_root_link),
	LNK("exe",        proc_exe_link),
	REG("mounts",     S_IRUGO, proc_mounts_operations),
	REG("mountinfo",  S_IRUGO, proc_mountinfo_operations),
	REG("mountstats", S_IRUSR, proc_mountstats_operations),
3053
#ifdef CONFIG_PROC_PAGE_MONITOR
A
Alexey Dobriyan 已提交
3054 3055
	REG("clear_refs", S_IWUSR, proc_clear_refs_operations),
	REG("smaps",      S_IRUGO, proc_smaps_operations),
A
Al Viro 已提交
3056
	REG("pagemap",    S_IRUGO, proc_pagemap_operations),
3057 3058
#endif
#ifdef CONFIG_SECURITY
A
Alexey Dobriyan 已提交
3059
	DIR("attr",       S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),
3060 3061
#endif
#ifdef CONFIG_KALLSYMS
A
Alexey Dobriyan 已提交
3062
	INF("wchan",      S_IRUGO, proc_pid_wchan),
3063
#endif
K
Ken Chen 已提交
3064
#ifdef CONFIG_STACKTRACE
3065
	ONE("stack",      S_IRUGO, proc_pid_stack),
3066 3067
#endif
#ifdef CONFIG_SCHEDSTATS
A
Alexey Dobriyan 已提交
3068
	INF("schedstat",  S_IRUGO, proc_pid_schedstat),
3069
#endif
A
Arjan van de Ven 已提交
3070
#ifdef CONFIG_LATENCYTOP
A
Alexey Dobriyan 已提交
3071
	REG("latency",  S_IRUGO, proc_lstats_operations),
A
Arjan van de Ven 已提交
3072
#endif
3073
#ifdef CONFIG_PROC_PID_CPUSET
A
Alexey Dobriyan 已提交
3074
	REG("cpuset",     S_IRUGO, proc_cpuset_operations),
3075 3076
#endif
#ifdef CONFIG_CGROUPS
A
Alexey Dobriyan 已提交
3077
	REG("cgroup",  S_IRUGO, proc_cgroup_operations),
3078
#endif
A
Alexey Dobriyan 已提交
3079 3080
	INF("oom_score",  S_IRUGO, proc_oom_score),
	REG("oom_adj",    S_IRUGO|S_IWUSR, proc_oom_adjust_operations),
D
David Rientjes 已提交
3081
	REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),
3082
#ifdef CONFIG_AUDITSYSCALL
A
Alexey Dobriyan 已提交
3083 3084
	REG("loginuid",   S_IWUSR|S_IRUGO, proc_loginuid_operations),
	REG("sessionid",  S_IRUGO, proc_sessionid_operations),
3085
#endif
3086
#ifdef CONFIG_FAULT_INJECTION
A
Alexey Dobriyan 已提交
3087
	REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations),
3088
#endif
C
Christoph Hellwig 已提交
3089
#ifdef CONFIG_ELF_CORE
A
Alexey Dobriyan 已提交
3090
	REG("coredump_filter", S_IRUGO|S_IWUSR, proc_coredump_filter_operations),
3091
#endif
3092
#ifdef CONFIG_TASK_IO_ACCOUNTING
3093
	INF("io",	S_IRUSR, proc_tgid_io_accounting),
3094
#endif
3095 3096 3097
#ifdef CONFIG_HARDWALL
	INF("hardwall",   S_IRUGO, proc_pid_hardwall),
#endif
3098
};
L
Linus Torvalds 已提交
3099

3100
static int proc_tgid_base_readdir(struct file * filp,
L
Linus Torvalds 已提交
3101 3102 3103
			     void * dirent, filldir_t filldir)
{
	return proc_pident_readdir(filp,dirent,filldir,
3104
				   tgid_base_stuff,ARRAY_SIZE(tgid_base_stuff));
L
Linus Torvalds 已提交
3105 3106
}

3107
static const struct file_operations proc_tgid_base_operations = {
L
Linus Torvalds 已提交
3108
	.read		= generic_read_dir,
3109
	.readdir	= proc_tgid_base_readdir,
3110
	.llseek		= default_llseek,
L
Linus Torvalds 已提交
3111 3112
};

3113
static struct dentry *proc_tgid_base_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd){
3114 3115
	return proc_pident_lookup(dir, dentry,
				  tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));
L
Linus Torvalds 已提交
3116 3117
}

3118
static const struct inode_operations proc_tgid_base_inode_operations = {
3119
	.lookup		= proc_tgid_base_lookup,
3120
	.getattr	= pid_getattr,
3121
	.setattr	= proc_setattr,
L
Linus Torvalds 已提交
3122 3123
};

3124
static void proc_flush_task_mnt(struct vfsmount *mnt, pid_t pid, pid_t tgid)
L
Linus Torvalds 已提交
3125
{
3126
	struct dentry *dentry, *leader, *dir;
3127
	char buf[PROC_NUMBUF];
3128 3129 3130
	struct qstr name;

	name.name = buf;
3131 3132
	name.len = snprintf(buf, sizeof(buf), "%d", pid);
	dentry = d_hash_and_lookup(mnt->mnt_root, &name);
3133
	if (dentry) {
3134
		shrink_dcache_parent(dentry);
3135 3136 3137
		d_drop(dentry);
		dput(dentry);
	}
L
Linus Torvalds 已提交
3138

3139
	name.name = buf;
3140 3141
	name.len = snprintf(buf, sizeof(buf), "%d", tgid);
	leader = d_hash_and_lookup(mnt->mnt_root, &name);
3142 3143
	if (!leader)
		goto out;
L
Linus Torvalds 已提交
3144

3145 3146 3147 3148 3149 3150 3151
	name.name = "task";
	name.len = strlen(name.name);
	dir = d_hash_and_lookup(leader, &name);
	if (!dir)
		goto out_put_leader;

	name.name = buf;
3152
	name.len = snprintf(buf, sizeof(buf), "%d", pid);
3153 3154 3155 3156 3157
	dentry = d_hash_and_lookup(dir, &name);
	if (dentry) {
		shrink_dcache_parent(dentry);
		d_drop(dentry);
		dput(dentry);
L
Linus Torvalds 已提交
3158
	}
3159 3160 3161 3162 3163 3164

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

3167 3168 3169 3170 3171
/**
 * 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
3172
 * proc (proc_mnt) and from all the namespaces' procs this task was seen
3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189
 * 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.
3190 3191 3192 3193
 */

void proc_flush_task(struct task_struct *task)
{
3194
	int i;
3195
	struct pid *pid, *tgid;
3196 3197 3198
	struct upid *upid;

	pid = task_pid(task);
3199
	tgid = task_tgid(task);
3200

3201
	for (i = 0; i <= pid->level; i++) {
3202 3203
		upid = &pid->numbers[i];
		proc_flush_task_mnt(upid->ns->proc_mnt, upid->nr,
3204
					tgid->numbers[i].nr);
3205
	}
3206 3207 3208 3209

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

3212 3213
static struct dentry *proc_pid_instantiate(struct inode *dir,
					   struct dentry * dentry,
3214
					   struct task_struct *task, const void *ptr)
3215 3216 3217 3218
{
	struct dentry *error = ERR_PTR(-ENOENT);
	struct inode *inode;

3219
	inode = proc_pid_make_inode(dir->i_sb, task);
3220 3221 3222 3223 3224 3225 3226
	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;
3227

M
Miklos Szeredi 已提交
3228 3229
	set_nlink(inode, 2 + pid_entry_count_dirs(tgid_base_stuff,
						  ARRAY_SIZE(tgid_base_stuff)));
3230

3231
	d_set_d_op(dentry, &pid_dentry_operations);
3232 3233 3234 3235 3236 3237 3238 3239 3240

	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 已提交
3241 3242
struct dentry *proc_pid_lookup(struct inode *dir, struct dentry * dentry, struct nameidata *nd)
{
3243
	struct dentry *result;
L
Linus Torvalds 已提交
3244 3245
	struct task_struct *task;
	unsigned tgid;
3246
	struct pid_namespace *ns;
L
Linus Torvalds 已提交
3247

3248 3249 3250 3251
	result = proc_base_lookup(dir, dentry);
	if (!IS_ERR(result) || PTR_ERR(result) != -ENOENT)
		goto out;

L
Linus Torvalds 已提交
3252 3253 3254 3255
	tgid = name_to_int(dentry);
	if (tgid == ~0U)
		goto out;

3256
	ns = dentry->d_sb->s_fs_info;
3257
	rcu_read_lock();
3258
	task = find_task_by_pid_ns(tgid, ns);
L
Linus Torvalds 已提交
3259 3260
	if (task)
		get_task_struct(task);
3261
	rcu_read_unlock();
L
Linus Torvalds 已提交
3262 3263 3264
	if (!task)
		goto out;

3265
	result = proc_pid_instantiate(dir, dentry, task, NULL);
L
Linus Torvalds 已提交
3266 3267
	put_task_struct(task);
out:
3268
	return result;
L
Linus Torvalds 已提交
3269 3270 3271
}

/*
3272
 * Find the first task with tgid >= tgid
3273
 *
L
Linus Torvalds 已提交
3274
 */
3275 3276
struct tgid_iter {
	unsigned int tgid;
3277
	struct task_struct *task;
3278 3279 3280
};
static struct tgid_iter next_tgid(struct pid_namespace *ns, struct tgid_iter iter)
{
3281
	struct pid *pid;
L
Linus Torvalds 已提交
3282

3283 3284
	if (iter.task)
		put_task_struct(iter.task);
3285
	rcu_read_lock();
3286
retry:
3287 3288
	iter.task = NULL;
	pid = find_ge_pid(iter.tgid, ns);
3289
	if (pid) {
3290 3291
		iter.tgid = pid_nr_ns(pid, ns);
		iter.task = pid_task(pid, PIDTYPE_PID);
3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303
		/* 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.
		 */
3304 3305
		if (!iter.task || !has_group_leader_pid(iter.task)) {
			iter.tgid += 1;
3306
			goto retry;
3307 3308
		}
		get_task_struct(iter.task);
3309
	}
3310
	rcu_read_unlock();
3311
	return iter;
L
Linus Torvalds 已提交
3312 3313
}

3314
#define TGID_OFFSET (FIRST_PROCESS_ENTRY + ARRAY_SIZE(proc_base_stuff))
3315

3316
static int proc_pid_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
3317
	struct tgid_iter iter)
3318 3319
{
	char name[PROC_NUMBUF];
3320
	int len = snprintf(name, sizeof(name), "%d", iter.tgid);
3321
	return proc_fill_cache(filp, dirent, filldir, name, len,
3322
				proc_pid_instantiate, iter.task, NULL);
3323 3324
}

L
Linus Torvalds 已提交
3325 3326 3327
/* for the /proc/ directory itself, after non-process stuff has been done */
int proc_pid_readdir(struct file * filp, void * dirent, filldir_t filldir)
{
3328 3329
	unsigned int nr;
	struct task_struct *reaper;
3330
	struct tgid_iter iter;
3331
	struct pid_namespace *ns;
L
Linus Torvalds 已提交
3332

3333 3334 3335 3336 3337
	if (filp->f_pos >= PID_MAX_LIMIT + TGID_OFFSET)
		goto out_no_task;
	nr = filp->f_pos - FIRST_PROCESS_ENTRY;

	reaper = get_proc_task(filp->f_path.dentry->d_inode);
3338 3339 3340
	if (!reaper)
		goto out_no_task;

3341
	for (; nr < ARRAY_SIZE(proc_base_stuff); filp->f_pos++, nr++) {
3342
		const struct pid_entry *p = &proc_base_stuff[nr];
3343
		if (proc_base_fill_cache(filp, dirent, filldir, reaper, p) < 0)
3344
			goto out;
L
Linus Torvalds 已提交
3345 3346
	}

3347
	ns = filp->f_dentry->d_sb->s_fs_info;
3348 3349 3350 3351 3352 3353 3354 3355
	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);
3356
			goto out;
L
Linus Torvalds 已提交
3357
		}
3358
	}
3359 3360
	filp->f_pos = PID_MAX_LIMIT + TGID_OFFSET;
out:
3361 3362
	put_task_struct(reaper);
out_no_task:
3363 3364
	return 0;
}
L
Linus Torvalds 已提交
3365

3366 3367 3368
/*
 * Tasks
 */
3369
static const struct pid_entry tid_base_stuff[] = {
A
Alexey Dobriyan 已提交
3370
	DIR("fd",        S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),
J
Jerome Marchand 已提交
3371
	DIR("fdinfo",    S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),
3372
	DIR("ns",	 S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),
A
Alexey Dobriyan 已提交
3373 3374 3375
	REG("environ",   S_IRUSR, proc_environ_operations),
	INF("auxv",      S_IRUSR, proc_pid_auxv),
	ONE("status",    S_IRUGO, proc_pid_status),
3376
	ONE("personality", S_IRUGO, proc_pid_personality),
3377
	INF("limits",	 S_IRUGO, proc_pid_limits),
I
Ingo Molnar 已提交
3378
#ifdef CONFIG_SCHED_DEBUG
A
Alexey Dobriyan 已提交
3379
	REG("sched",     S_IRUGO|S_IWUSR, proc_pid_sched_operations),
R
Roland McGrath 已提交
3380
#endif
3381
	REG("comm",      S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),
R
Roland McGrath 已提交
3382
#ifdef CONFIG_HAVE_ARCH_TRACEHOOK
3383
	INF("syscall",   S_IRUGO, proc_pid_syscall),
I
Ingo Molnar 已提交
3384
#endif
A
Alexey Dobriyan 已提交
3385 3386 3387 3388
	INF("cmdline",   S_IRUGO, proc_pid_cmdline),
	ONE("stat",      S_IRUGO, proc_tid_stat),
	ONE("statm",     S_IRUGO, proc_pid_statm),
	REG("maps",      S_IRUGO, proc_maps_operations),
3389
#ifdef CONFIG_NUMA
A
Alexey Dobriyan 已提交
3390
	REG("numa_maps", S_IRUGO, proc_numa_maps_operations),
3391
#endif
A
Alexey Dobriyan 已提交
3392 3393 3394 3395 3396 3397
	REG("mem",       S_IRUSR|S_IWUSR, proc_mem_operations),
	LNK("cwd",       proc_cwd_link),
	LNK("root",      proc_root_link),
	LNK("exe",       proc_exe_link),
	REG("mounts",    S_IRUGO, proc_mounts_operations),
	REG("mountinfo",  S_IRUGO, proc_mountinfo_operations),
3398
#ifdef CONFIG_PROC_PAGE_MONITOR
A
Alexey Dobriyan 已提交
3399 3400
	REG("clear_refs", S_IWUSR, proc_clear_refs_operations),
	REG("smaps",     S_IRUGO, proc_smaps_operations),
A
Al Viro 已提交
3401
	REG("pagemap",    S_IRUGO, proc_pagemap_operations),
3402 3403
#endif
#ifdef CONFIG_SECURITY
A
Alexey Dobriyan 已提交
3404
	DIR("attr",      S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),
3405 3406
#endif
#ifdef CONFIG_KALLSYMS
A
Alexey Dobriyan 已提交
3407
	INF("wchan",     S_IRUGO, proc_pid_wchan),
3408
#endif
K
Ken Chen 已提交
3409
#ifdef CONFIG_STACKTRACE
3410
	ONE("stack",      S_IRUGO, proc_pid_stack),
3411 3412
#endif
#ifdef CONFIG_SCHEDSTATS
A
Alexey Dobriyan 已提交
3413
	INF("schedstat", S_IRUGO, proc_pid_schedstat),
3414
#endif
A
Arjan van de Ven 已提交
3415
#ifdef CONFIG_LATENCYTOP
A
Alexey Dobriyan 已提交
3416
	REG("latency",  S_IRUGO, proc_lstats_operations),
A
Arjan van de Ven 已提交
3417
#endif
3418
#ifdef CONFIG_PROC_PID_CPUSET
A
Alexey Dobriyan 已提交
3419
	REG("cpuset",    S_IRUGO, proc_cpuset_operations),
3420 3421
#endif
#ifdef CONFIG_CGROUPS
A
Alexey Dobriyan 已提交
3422
	REG("cgroup",  S_IRUGO, proc_cgroup_operations),
3423
#endif
A
Alexey Dobriyan 已提交
3424 3425
	INF("oom_score", S_IRUGO, proc_oom_score),
	REG("oom_adj",   S_IRUGO|S_IWUSR, proc_oom_adjust_operations),
D
David Rientjes 已提交
3426
	REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),
3427
#ifdef CONFIG_AUDITSYSCALL
A
Alexey Dobriyan 已提交
3428
	REG("loginuid",  S_IWUSR|S_IRUGO, proc_loginuid_operations),
3429
	REG("sessionid",  S_IRUGO, proc_sessionid_operations),
3430
#endif
3431
#ifdef CONFIG_FAULT_INJECTION
A
Alexey Dobriyan 已提交
3432
	REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations),
3433
#endif
3434
#ifdef CONFIG_TASK_IO_ACCOUNTING
3435
	INF("io",	S_IRUSR, proc_tid_io_accounting),
3436
#endif
3437 3438 3439
#ifdef CONFIG_HARDWALL
	INF("hardwall",   S_IRUGO, proc_pid_hardwall),
#endif
3440 3441 3442 3443 3444 3445 3446 3447 3448 3449
};

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){
3450 3451
	return proc_pident_lookup(dir, dentry,
				  tid_base_stuff, ARRAY_SIZE(tid_base_stuff));
3452 3453
}

3454
static const struct file_operations proc_tid_base_operations = {
3455 3456
	.read		= generic_read_dir,
	.readdir	= proc_tid_base_readdir,
3457
	.llseek		= default_llseek,
3458 3459
};

3460
static const struct inode_operations proc_tid_base_inode_operations = {
3461 3462 3463 3464 3465
	.lookup		= proc_tid_base_lookup,
	.getattr	= pid_getattr,
	.setattr	= proc_setattr,
};

3466
static struct dentry *proc_task_instantiate(struct inode *dir,
3467
	struct dentry *dentry, struct task_struct *task, const void *ptr)
3468 3469 3470
{
	struct dentry *error = ERR_PTR(-ENOENT);
	struct inode *inode;
3471
	inode = proc_pid_make_inode(dir->i_sb, task);
3472 3473 3474 3475 3476 3477 3478

	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;
3479

M
Miklos Szeredi 已提交
3480 3481
	set_nlink(inode, 2 + pid_entry_count_dirs(tid_base_stuff,
						  ARRAY_SIZE(tid_base_stuff)));
3482

3483
	d_set_d_op(dentry, &pid_dentry_operations);
3484 3485 3486 3487 3488 3489 3490 3491 3492

	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;
}

3493 3494 3495 3496 3497 3498
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;
3499
	struct pid_namespace *ns;
3500 3501 3502 3503 3504 3505 3506 3507

	if (!leader)
		goto out_no_task;

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

3508
	ns = dentry->d_sb->s_fs_info;
3509
	rcu_read_lock();
3510
	task = find_task_by_pid_ns(tid, ns);
3511 3512 3513 3514 3515
	if (task)
		get_task_struct(task);
	rcu_read_unlock();
	if (!task)
		goto out;
3516
	if (!same_thread_group(leader, task))
3517 3518
		goto out_drop_task;

3519
	result = proc_task_instantiate(dir, dentry, task, NULL);
3520 3521 3522 3523 3524 3525 3526 3527
out_drop_task:
	put_task_struct(task);
out:
	put_task_struct(leader);
out_no_task:
	return result;
}

3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539
/*
 * 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.
 */
3540
static struct task_struct *first_tid(struct task_struct *leader,
3541
		int tid, int nr, struct pid_namespace *ns)
3542
{
O
Oleg Nesterov 已提交
3543
	struct task_struct *pos;
L
Linus Torvalds 已提交
3544

3545
	rcu_read_lock();
3546 3547
	/* Attempt to start with the pid of a thread */
	if (tid && (nr > 0)) {
3548
		pos = find_task_by_pid_ns(tid, ns);
O
Oleg Nesterov 已提交
3549 3550
		if (pos && (pos->group_leader == leader))
			goto found;
3551
	}
L
Linus Torvalds 已提交
3552

3553
	/* If nr exceeds the number of threads there is nothing todo */
O
Oleg Nesterov 已提交
3554 3555 3556
	pos = NULL;
	if (nr && nr >= get_nr_threads(leader))
		goto out;
L
Linus Torvalds 已提交
3557

O
Oleg Nesterov 已提交
3558 3559
	/* If we haven't found our starting place yet start
	 * with the leader and walk nr threads forward.
3560
	 */
O
Oleg Nesterov 已提交
3561 3562 3563 3564 3565 3566
	for (pos = leader; nr > 0; --nr) {
		pos = next_thread(pos);
		if (pos == leader) {
			pos = NULL;
			goto out;
		}
L
Linus Torvalds 已提交
3567
	}
O
Oleg Nesterov 已提交
3568 3569 3570
found:
	get_task_struct(pos);
out:
3571
	rcu_read_unlock();
3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582
	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 已提交
3583
	struct task_struct *pos = NULL;
3584
	rcu_read_lock();
O
Oleg Nesterov 已提交
3585
	if (pid_alive(start)) {
3586
		pos = next_thread(start);
O
Oleg Nesterov 已提交
3587 3588 3589 3590 3591
		if (thread_group_leader(pos))
			pos = NULL;
		else
			get_task_struct(pos);
	}
3592
	rcu_read_unlock();
3593 3594
	put_task_struct(start);
	return pos;
L
Linus Torvalds 已提交
3595 3596
}

3597 3598 3599 3600 3601 3602 3603 3604 3605
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 已提交
3606 3607 3608
/* for the /proc/TGID/task/ directories */
static int proc_task_readdir(struct file * filp, void * dirent, filldir_t filldir)
{
3609
	struct dentry *dentry = filp->f_path.dentry;
L
Linus Torvalds 已提交
3610
	struct inode *inode = dentry->d_inode;
3611
	struct task_struct *leader = NULL;
3612
	struct task_struct *task;
L
Linus Torvalds 已提交
3613 3614
	int retval = -ENOENT;
	ino_t ino;
3615
	int tid;
3616
	struct pid_namespace *ns;
L
Linus Torvalds 已提交
3617

3618 3619 3620 3621 3622 3623 3624 3625 3626 3627
	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);
3628 3629
	if (!leader)
		goto out_no_task;
L
Linus Torvalds 已提交
3630 3631
	retval = 0;

3632
	switch ((unsigned long)filp->f_pos) {
L
Linus Torvalds 已提交
3633 3634
	case 0:
		ino = inode->i_ino;
3635
		if (filldir(dirent, ".", 1, filp->f_pos, ino, DT_DIR) < 0)
L
Linus Torvalds 已提交
3636
			goto out;
3637
		filp->f_pos++;
L
Linus Torvalds 已提交
3638 3639 3640
		/* fall through */
	case 1:
		ino = parent_ino(dentry);
3641
		if (filldir(dirent, "..", 2, filp->f_pos, ino, DT_DIR) < 0)
L
Linus Torvalds 已提交
3642
			goto out;
3643
		filp->f_pos++;
L
Linus Torvalds 已提交
3644 3645 3646
		/* fall through */
	}

3647 3648 3649
	/* f_version caches the tgid value that the last readdir call couldn't
	 * return. lseek aka telldir automagically resets f_version to 0.
	 */
3650
	ns = filp->f_dentry->d_sb->s_fs_info;
3651
	tid = (int)filp->f_version;
3652
	filp->f_version = 0;
3653
	for (task = first_tid(leader, tid, filp->f_pos - 2, ns);
3654
	     task;
3655
	     task = next_tid(task), filp->f_pos++) {
3656
		tid = task_pid_nr_ns(task, ns);
3657
		if (proc_task_fill_cache(filp, dirent, filldir, task, tid) < 0) {
3658 3659
			/* returning this tgid failed, save it as the first
			 * pid for the next readir call */
3660
			filp->f_version = (u64)tid;
3661
			put_task_struct(task);
L
Linus Torvalds 已提交
3662
			break;
3663
		}
L
Linus Torvalds 已提交
3664 3665
	}
out:
3666 3667
	put_task_struct(leader);
out_no_task:
L
Linus Torvalds 已提交
3668 3669
	return retval;
}
3670 3671 3672 3673

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

3677 3678 3679
	if (p) {
		stat->nlink += get_nr_threads(p);
		put_task_struct(p);
3680 3681 3682 3683
	}

	return 0;
}
3684

3685
static const struct inode_operations proc_task_inode_operations = {
3686 3687 3688 3689 3690
	.lookup		= proc_task_lookup,
	.getattr	= proc_task_getattr,
	.setattr	= proc_setattr,
};

3691
static const struct file_operations proc_task_operations = {
3692 3693
	.read		= generic_read_dir,
	.readdir	= proc_task_readdir,
3694
	.llseek		= default_llseek,
3695
};