2005-04-16 18:20:36 -04:00
|
|
|
/*
|
|
|
|
* 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.
|
2005-09-03 18:55:10 -04:00
|
|
|
*
|
|
|
|
*
|
|
|
|
* 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.
|
2005-04-16 18:20:36 -04:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/time.h>
|
|
|
|
#include <linux/proc_fs.h>
|
|
|
|
#include <linux/stat.h>
|
|
|
|
#include <linux/init.h>
|
2006-01-11 15:17:46 -05:00
|
|
|
#include <linux/capability.h>
|
2005-04-16 18:20:36 -04:00
|
|
|
#include <linux/file.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/seq_file.h>
|
|
|
|
#include <linux/namei.h>
|
|
|
|
#include <linux/namespace.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/smp_lock.h>
|
2005-09-09 16:04:14 -04:00
|
|
|
#include <linux/rcupdate.h>
|
2005-04-16 18:20:36 -04:00
|
|
|
#include <linux/kallsyms.h>
|
|
|
|
#include <linux/mount.h>
|
|
|
|
#include <linux/security.h>
|
|
|
|
#include <linux/ptrace.h>
|
|
|
|
#include <linux/seccomp.h>
|
|
|
|
#include <linux/cpuset.h>
|
|
|
|
#include <linux/audit.h>
|
2005-11-07 17:15:49 -05:00
|
|
|
#include <linux/poll.h>
|
2006-10-02 05:18:08 -04:00
|
|
|
#include <linux/nsproxy.h>
|
2006-10-20 02:28:32 -04:00
|
|
|
#include <linux/oom.h>
|
2005-04-16 18:20:36 -04:00
|
|
|
#include "internal.h"
|
|
|
|
|
2006-06-26 03:25:46 -04:00
|
|
|
/* 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.
|
|
|
|
*/
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:54 -04:00
|
|
|
/* Worst case buffer size needed for holding an integer. */
|
2006-10-17 03:09:41 -04:00
|
|
|
#define PROC_NUMBUF 13
|
2006-06-26 03:25:54 -04:00
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
struct pid_entry {
|
|
|
|
int len;
|
|
|
|
char *name;
|
|
|
|
mode_t mode;
|
2006-10-02 05:17:07 -04:00
|
|
|
struct inode_operations *iop;
|
|
|
|
struct file_operations *fop;
|
|
|
|
union proc_op op;
|
2005-04-16 18:20:36 -04:00
|
|
|
};
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
#define NOD(NAME, MODE, IOP, FOP, OP) { \
|
2006-10-02 05:17:07 -04:00
|
|
|
.len = sizeof(NAME) - 1, \
|
|
|
|
.name = (NAME), \
|
|
|
|
.mode = MODE, \
|
|
|
|
.iop = IOP, \
|
|
|
|
.fop = FOP, \
|
|
|
|
.op = OP, \
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
#define DIR(NAME, MODE, OTYPE) \
|
|
|
|
NOD(NAME, (S_IFDIR|(MODE)), \
|
2006-10-02 05:17:07 -04:00
|
|
|
&proc_##OTYPE##_inode_operations, &proc_##OTYPE##_operations, \
|
|
|
|
{} )
|
2006-10-02 05:18:49 -04:00
|
|
|
#define LNK(NAME, OTYPE) \
|
|
|
|
NOD(NAME, (S_IFLNK|S_IRWXUGO), \
|
2006-10-02 05:17:07 -04:00
|
|
|
&proc_pid_link_inode_operations, NULL, \
|
|
|
|
{ .proc_get_link = &proc_##OTYPE##_link } )
|
2006-10-02 05:18:49 -04:00
|
|
|
#define REG(NAME, MODE, OTYPE) \
|
|
|
|
NOD(NAME, (S_IFREG|(MODE)), NULL, \
|
2006-10-02 05:17:07 -04:00
|
|
|
&proc_##OTYPE##_operations, {})
|
2006-10-02 05:18:49 -04:00
|
|
|
#define INF(NAME, MODE, OTYPE) \
|
|
|
|
NOD(NAME, (S_IFREG|(MODE)), \
|
2006-10-02 05:17:07 -04:00
|
|
|
NULL, &proc_info_file_operations, \
|
|
|
|
{ .proc_read = &proc_##OTYPE } )
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2005-09-06 18:18:22 -04:00
|
|
|
static struct fs_struct *get_fs_struct(struct task_struct *task)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
|
|
|
struct fs_struct *fs;
|
2005-09-06 18:18:22 -04:00
|
|
|
task_lock(task);
|
|
|
|
fs = task->fs;
|
2005-04-16 18:20:36 -04:00
|
|
|
if(fs)
|
|
|
|
atomic_inc(&fs->count);
|
2005-09-06 18:18:22 -04:00
|
|
|
task_unlock(task);
|
|
|
|
return fs;
|
|
|
|
}
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
static int get_nr_threads(struct task_struct *tsk)
|
|
|
|
{
|
|
|
|
/* Must be called with the rcu_read_lock held */
|
|
|
|
unsigned long flags;
|
|
|
|
int count = 0;
|
|
|
|
|
|
|
|
if (lock_task_sighand(tsk, &flags)) {
|
|
|
|
count = atomic_read(&tsk->signal->count);
|
|
|
|
unlock_task_sighand(tsk, &flags);
|
|
|
|
}
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
2005-09-06 18:18:22 -04:00
|
|
|
static int proc_cwd_link(struct inode *inode, struct dentry **dentry, struct vfsmount **mnt)
|
|
|
|
{
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(inode);
|
|
|
|
struct fs_struct *fs = NULL;
|
2005-09-06 18:18:22 -04:00
|
|
|
int result = -ENOENT;
|
2006-06-26 03:25:55 -04:00
|
|
|
|
|
|
|
if (task) {
|
|
|
|
fs = get_fs_struct(task);
|
|
|
|
put_task_struct(task);
|
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
if (fs) {
|
|
|
|
read_lock(&fs->lock);
|
|
|
|
*mnt = mntget(fs->pwdmnt);
|
|
|
|
*dentry = dget(fs->pwd);
|
|
|
|
read_unlock(&fs->lock);
|
|
|
|
result = 0;
|
|
|
|
put_fs_struct(fs);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int proc_root_link(struct inode *inode, struct dentry **dentry, struct vfsmount **mnt)
|
|
|
|
{
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(inode);
|
|
|
|
struct fs_struct *fs = NULL;
|
2005-04-16 18:20:36 -04:00
|
|
|
int result = -ENOENT;
|
2006-06-26 03:25:55 -04:00
|
|
|
|
|
|
|
if (task) {
|
|
|
|
fs = get_fs_struct(task);
|
|
|
|
put_task_struct(task);
|
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
if (fs) {
|
|
|
|
read_lock(&fs->lock);
|
|
|
|
*mnt = mntget(fs->rootmnt);
|
|
|
|
*dentry = dget(fs->root);
|
|
|
|
read_unlock(&fs->lock);
|
|
|
|
result = 0;
|
|
|
|
put_fs_struct(fs);
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define MAY_PTRACE(task) \
|
|
|
|
(task == current || \
|
|
|
|
(task->parent == current && \
|
|
|
|
(task->ptrace & PT_PTRACED) && \
|
|
|
|
(task->state == TASK_STOPPED || task->state == TASK_TRACED) && \
|
|
|
|
security_ptrace(current,task) == 0))
|
|
|
|
|
|
|
|
static int proc_pid_environ(struct task_struct *task, char * buffer)
|
|
|
|
{
|
|
|
|
int res = 0;
|
|
|
|
struct mm_struct *mm = get_task_mm(task);
|
|
|
|
if (mm) {
|
|
|
|
unsigned int len = mm->env_end - mm->env_start;
|
|
|
|
if (len > PAGE_SIZE)
|
|
|
|
len = PAGE_SIZE;
|
|
|
|
res = access_process_vm(task, mm->env_start, buffer, len, 0);
|
2005-09-06 18:18:24 -04:00
|
|
|
if (!ptrace_may_attach(task))
|
2005-04-16 18:20:36 -04:00
|
|
|
res = -ESRCH;
|
|
|
|
mmput(mm);
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int proc_pid_cmdline(struct task_struct *task, char * buffer)
|
|
|
|
{
|
|
|
|
int res = 0;
|
|
|
|
unsigned int len;
|
|
|
|
struct mm_struct *mm = get_task_mm(task);
|
|
|
|
if (!mm)
|
|
|
|
goto out;
|
|
|
|
if (!mm->arg_end)
|
|
|
|
goto out_mm; /* Shh! No looking before we're done */
|
|
|
|
|
|
|
|
len = mm->arg_end - mm->arg_start;
|
|
|
|
|
|
|
|
if (len > PAGE_SIZE)
|
|
|
|
len = PAGE_SIZE;
|
|
|
|
|
|
|
|
res = access_process_vm(task, mm->arg_start, buffer, len, 0);
|
|
|
|
|
|
|
|
// If the nul at the end of args has been overwritten, then
|
|
|
|
// assume application is using setproctitle(3).
|
|
|
|
if (res > 0 && buffer[res-1] != '\0' && len < PAGE_SIZE) {
|
|
|
|
len = strnlen(buffer, res);
|
|
|
|
if (len < res) {
|
|
|
|
res = len;
|
|
|
|
} else {
|
|
|
|
len = mm->env_end - mm->env_start;
|
|
|
|
if (len > PAGE_SIZE - res)
|
|
|
|
len = PAGE_SIZE - res;
|
|
|
|
res += access_process_vm(task, mm->env_start, buffer+res, len, 0);
|
|
|
|
res = strnlen(buffer, res);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
out_mm:
|
|
|
|
mmput(mm);
|
|
|
|
out:
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int proc_pid_auxv(struct task_struct *task, char *buffer)
|
|
|
|
{
|
|
|
|
int res = 0;
|
|
|
|
struct mm_struct *mm = get_task_mm(task);
|
|
|
|
if (mm) {
|
|
|
|
unsigned int nwords = 0;
|
|
|
|
do
|
|
|
|
nwords += 2;
|
|
|
|
while (mm->saved_auxv[nwords - 2] != 0); /* AT_NULL */
|
|
|
|
res = nwords * sizeof(mm->saved_auxv[0]);
|
|
|
|
if (res > PAGE_SIZE)
|
|
|
|
res = PAGE_SIZE;
|
|
|
|
memcpy(buffer, mm->saved_auxv, res);
|
|
|
|
mmput(mm);
|
|
|
|
}
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#ifdef CONFIG_KALLSYMS
|
|
|
|
/*
|
|
|
|
* Provides a wchan file via kallsyms in a proper one-value-per-file format.
|
|
|
|
* Returns the resolved symbol. If that fails, simply return the address.
|
|
|
|
*/
|
|
|
|
static int proc_pid_wchan(struct task_struct *task, char *buffer)
|
|
|
|
{
|
|
|
|
char *modname;
|
|
|
|
const char *sym_name;
|
|
|
|
unsigned long wchan, size, offset;
|
|
|
|
char namebuf[KSYM_NAME_LEN+1];
|
|
|
|
|
|
|
|
wchan = get_wchan(task);
|
|
|
|
|
|
|
|
sym_name = kallsyms_lookup(wchan, &size, &offset, &modname, namebuf);
|
|
|
|
if (sym_name)
|
|
|
|
return sprintf(buffer, "%s", sym_name);
|
|
|
|
return sprintf(buffer, "%lu", wchan);
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_KALLSYMS */
|
|
|
|
|
|
|
|
#ifdef CONFIG_SCHEDSTATS
|
|
|
|
/*
|
|
|
|
* Provides /proc/PID/schedstat
|
|
|
|
*/
|
|
|
|
static int proc_pid_schedstat(struct task_struct *task, char *buffer)
|
|
|
|
{
|
|
|
|
return sprintf(buffer, "%lu %lu %lu\n",
|
|
|
|
task->sched_info.cpu_time,
|
|
|
|
task->sched_info.run_delay,
|
|
|
|
task->sched_info.pcnt);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* The badness from the OOM killer */
|
|
|
|
unsigned long badness(struct task_struct *p, unsigned long uptime);
|
|
|
|
static int proc_oom_score(struct task_struct *task, char *buffer)
|
|
|
|
{
|
|
|
|
unsigned long points;
|
|
|
|
struct timespec uptime;
|
|
|
|
|
|
|
|
do_posix_clock_monotonic_gettime(&uptime);
|
|
|
|
points = badness(task, uptime.tv_sec);
|
|
|
|
return sprintf(buffer, "%lu\n", points);
|
|
|
|
}
|
|
|
|
|
|
|
|
/************************************************************************/
|
|
|
|
/* Here the fs part begins */
|
|
|
|
/************************************************************************/
|
|
|
|
|
|
|
|
/* permission checks */
|
2006-06-26 03:25:58 -04:00
|
|
|
static int proc_fd_access_allowed(struct inode *inode)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2006-06-26 03:25:58 -04:00
|
|
|
struct task_struct *task;
|
|
|
|
int allowed = 0;
|
2006-06-26 03:25:59 -04:00
|
|
|
/* 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.
|
2006-06-26 03:25:58 -04:00
|
|
|
*/
|
|
|
|
task = get_proc_task(inode);
|
2006-06-26 03:25:59 -04:00
|
|
|
if (task) {
|
|
|
|
allowed = ptrace_may_attach(task);
|
2006-06-26 03:25:58 -04:00
|
|
|
put_task_struct(task);
|
2006-06-26 03:25:59 -04:00
|
|
|
}
|
2006-06-26 03:25:58 -04:00
|
|
|
return allowed;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-07-15 15:26:45 -04:00
|
|
|
static int proc_setattr(struct dentry *dentry, struct iattr *attr)
|
|
|
|
{
|
|
|
|
int error;
|
|
|
|
struct inode *inode = dentry->d_inode;
|
|
|
|
|
|
|
|
if (attr->ia_valid & ATTR_MODE)
|
|
|
|
return -EPERM;
|
|
|
|
|
|
|
|
error = inode_change_ok(inode, attr);
|
|
|
|
if (!error) {
|
|
|
|
error = security_inode_setattr(dentry, attr);
|
|
|
|
if (!error)
|
|
|
|
error = inode_setattr(inode, attr);
|
|
|
|
}
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct inode_operations proc_def_inode_operations = {
|
|
|
|
.setattr = proc_setattr,
|
|
|
|
};
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
extern struct seq_operations mounts_op;
|
2005-11-07 17:15:49 -05:00
|
|
|
struct proc_mounts {
|
|
|
|
struct seq_file m;
|
|
|
|
int event;
|
|
|
|
};
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
static int mounts_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(inode);
|
|
|
|
struct namespace *namespace = NULL;
|
2005-11-07 17:15:49 -05:00
|
|
|
struct proc_mounts *p;
|
|
|
|
int ret = -EINVAL;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
if (task) {
|
|
|
|
task_lock(task);
|
2006-10-02 05:18:08 -04:00
|
|
|
namespace = task->nsproxy->namespace;
|
2006-06-26 03:25:55 -04:00
|
|
|
if (namespace)
|
|
|
|
get_namespace(namespace);
|
|
|
|
task_unlock(task);
|
|
|
|
put_task_struct(task);
|
|
|
|
}
|
2005-11-07 17:15:49 -05:00
|
|
|
|
|
|
|
if (namespace) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
p = kmalloc(sizeof(struct proc_mounts), GFP_KERNEL);
|
|
|
|
if (p) {
|
|
|
|
file->private_data = &p->m;
|
|
|
|
ret = seq_open(file, &mounts_op);
|
|
|
|
if (!ret) {
|
|
|
|
p->m.private = namespace;
|
|
|
|
p->event = namespace->event;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
kfree(p);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
2005-11-07 17:15:49 -05:00
|
|
|
put_namespace(namespace);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int mounts_release(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
struct seq_file *m = file->private_data;
|
|
|
|
struct namespace *namespace = m->private;
|
|
|
|
put_namespace(namespace);
|
|
|
|
return seq_release(inode, file);
|
|
|
|
}
|
|
|
|
|
2005-11-07 17:15:49 -05:00
|
|
|
static unsigned mounts_poll(struct file *file, poll_table *wait)
|
|
|
|
{
|
|
|
|
struct proc_mounts *p = file->private_data;
|
|
|
|
struct namespace *ns = p->m.private;
|
|
|
|
unsigned res = 0;
|
|
|
|
|
|
|
|
poll_wait(file, &ns->poll, wait);
|
|
|
|
|
|
|
|
spin_lock(&vfsmount_lock);
|
|
|
|
if (p->event != ns->event) {
|
|
|
|
p->event = ns->event;
|
|
|
|
res = POLLERR;
|
|
|
|
}
|
|
|
|
spin_unlock(&vfsmount_lock);
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
static struct file_operations proc_mounts_operations = {
|
|
|
|
.open = mounts_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = mounts_release,
|
2005-11-07 17:15:49 -05:00
|
|
|
.poll = mounts_poll,
|
2005-04-16 18:20:36 -04:00
|
|
|
};
|
|
|
|
|
2006-03-20 13:44:12 -05:00
|
|
|
extern struct seq_operations mountstats_op;
|
|
|
|
static int mountstats_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
int ret = seq_open(file, &mountstats_op);
|
|
|
|
|
|
|
|
if (!ret) {
|
|
|
|
struct seq_file *m = file->private_data;
|
2006-06-26 03:25:55 -04:00
|
|
|
struct namespace *namespace = NULL;
|
|
|
|
struct task_struct *task = get_proc_task(inode);
|
|
|
|
|
|
|
|
if (task) {
|
|
|
|
task_lock(task);
|
2006-11-25 14:09:22 -05:00
|
|
|
if (task->nsproxy)
|
|
|
|
namespace = task->nsproxy->namespace;
|
2006-06-26 03:25:55 -04:00
|
|
|
if (namespace)
|
|
|
|
get_namespace(namespace);
|
|
|
|
task_unlock(task);
|
|
|
|
put_task_struct(task);
|
|
|
|
}
|
2006-03-20 13:44:12 -05:00
|
|
|
|
|
|
|
if (namespace)
|
|
|
|
m->private = namespace;
|
|
|
|
else {
|
|
|
|
seq_release(inode, file);
|
|
|
|
ret = -EINVAL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_operations proc_mountstats_operations = {
|
|
|
|
.open = mountstats_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = mounts_release,
|
|
|
|
};
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
#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)
|
|
|
|
{
|
|
|
|
struct inode * inode = file->f_dentry->d_inode;
|
|
|
|
unsigned long page;
|
|
|
|
ssize_t length;
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(inode);
|
|
|
|
|
|
|
|
length = -ESRCH;
|
|
|
|
if (!task)
|
|
|
|
goto out_no_task;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
if (count > PROC_BLOCK_SIZE)
|
|
|
|
count = PROC_BLOCK_SIZE;
|
2006-06-26 03:25:55 -04:00
|
|
|
|
|
|
|
length = -ENOMEM;
|
2005-04-16 18:20:36 -04:00
|
|
|
if (!(page = __get_free_page(GFP_KERNEL)))
|
2006-06-26 03:25:55 -04:00
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
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);
|
2006-06-26 03:25:55 -04:00
|
|
|
out:
|
|
|
|
put_task_struct(task);
|
|
|
|
out_no_task:
|
2005-04-16 18:20:36 -04:00
|
|
|
return length;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_operations proc_info_file_operations = {
|
|
|
|
.read = proc_info_read,
|
|
|
|
};
|
|
|
|
|
|
|
|
static int mem_open(struct inode* inode, struct file* file)
|
|
|
|
{
|
|
|
|
file->private_data = (void*)((long)current->self_exec_id);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t mem_read(struct file * file, char __user * buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
|
2005-04-16 18:20:36 -04:00
|
|
|
char *page;
|
|
|
|
unsigned long src = *ppos;
|
|
|
|
int ret = -ESRCH;
|
|
|
|
struct mm_struct *mm;
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
if (!task)
|
|
|
|
goto out_no_task;
|
|
|
|
|
2005-09-06 18:18:24 -04:00
|
|
|
if (!MAY_PTRACE(task) || !ptrace_may_attach(task))
|
2005-04-16 18:20:36 -04:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
ret = -ENOMEM;
|
|
|
|
page = (char *)__get_free_page(GFP_USER);
|
|
|
|
if (!page)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
|
|
|
|
mm = get_task_mm(task);
|
|
|
|
if (!mm)
|
|
|
|
goto out_free;
|
|
|
|
|
|
|
|
ret = -EIO;
|
|
|
|
|
|
|
|
if (file->private_data != (void*)((long)current->self_exec_id))
|
|
|
|
goto out_put;
|
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
|
|
|
|
while (count > 0) {
|
|
|
|
int this_len, retval;
|
|
|
|
|
|
|
|
this_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;
|
|
|
|
retval = access_process_vm(task, src, page, this_len, 0);
|
2005-09-06 18:18:24 -04:00
|
|
|
if (!retval || !MAY_PTRACE(task) || !ptrace_may_attach(task)) {
|
2005-04-16 18:20:36 -04:00
|
|
|
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:
|
2006-06-26 03:25:55 -04:00
|
|
|
put_task_struct(task);
|
|
|
|
out_no_task:
|
2005-04-16 18:20:36 -04:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define mem_write NULL
|
|
|
|
|
|
|
|
#ifndef mem_write
|
|
|
|
/* This is a security hazard */
|
|
|
|
static ssize_t mem_write(struct file * file, const char * buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
2006-09-29 05:01:02 -04:00
|
|
|
int copied;
|
2005-04-16 18:20:36 -04:00
|
|
|
char *page;
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
|
2005-04-16 18:20:36 -04:00
|
|
|
unsigned long dst = *ppos;
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
copied = -ESRCH;
|
|
|
|
if (!task)
|
|
|
|
goto out_no_task;
|
|
|
|
|
2005-09-06 18:18:24 -04:00
|
|
|
if (!MAY_PTRACE(task) || !ptrace_may_attach(task))
|
2006-06-26 03:25:55 -04:00
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
copied = -ENOMEM;
|
2005-04-16 18:20:36 -04:00
|
|
|
page = (char *)__get_free_page(GFP_USER);
|
|
|
|
if (!page)
|
2006-06-26 03:25:55 -04:00
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-09-29 05:01:02 -04:00
|
|
|
copied = 0;
|
2005-04-16 18:20:36 -04:00
|
|
|
while (count > 0) {
|
|
|
|
int this_len, retval;
|
|
|
|
|
|
|
|
this_len = (count > PAGE_SIZE) ? PAGE_SIZE : count;
|
|
|
|
if (copy_from_user(page, buf, this_len)) {
|
|
|
|
copied = -EFAULT;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
retval = access_process_vm(task, dst, page, this_len, 1);
|
|
|
|
if (!retval) {
|
|
|
|
if (!copied)
|
|
|
|
copied = -EIO;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
copied += retval;
|
|
|
|
buf += retval;
|
|
|
|
dst += retval;
|
|
|
|
count -= retval;
|
|
|
|
}
|
|
|
|
*ppos = dst;
|
|
|
|
free_page((unsigned long) page);
|
2006-06-26 03:25:55 -04:00
|
|
|
out:
|
|
|
|
put_task_struct(task);
|
|
|
|
out_no_task:
|
2005-04-16 18:20:36 -04:00
|
|
|
return copied;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static loff_t mem_lseek(struct file * file, loff_t offset, int orig)
|
|
|
|
{
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_operations proc_mem_operations = {
|
|
|
|
.llseek = mem_lseek,
|
|
|
|
.read = mem_read,
|
|
|
|
.write = mem_write,
|
|
|
|
.open = mem_open,
|
|
|
|
};
|
|
|
|
|
|
|
|
static ssize_t oom_adjust_read(struct file *file, char __user *buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(file->f_dentry->d_inode);
|
2006-06-26 03:25:54 -04:00
|
|
|
char buffer[PROC_NUMBUF];
|
2005-04-16 18:20:36 -04:00
|
|
|
size_t len;
|
2006-06-26 03:25:55 -04:00
|
|
|
int oom_adjust;
|
2005-04-16 18:20:36 -04:00
|
|
|
loff_t __ppos = *ppos;
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
if (!task)
|
|
|
|
return -ESRCH;
|
|
|
|
oom_adjust = task->oomkilladj;
|
|
|
|
put_task_struct(task);
|
|
|
|
|
2006-06-26 03:25:54 -04:00
|
|
|
len = snprintf(buffer, sizeof(buffer), "%i\n", oom_adjust);
|
2005-04-16 18:20:36 -04:00
|
|
|
if (__ppos >= len)
|
|
|
|
return 0;
|
|
|
|
if (count > len-__ppos)
|
|
|
|
count = len-__ppos;
|
|
|
|
if (copy_to_user(buf, buffer + __ppos, count))
|
|
|
|
return -EFAULT;
|
|
|
|
*ppos = __ppos + count;
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t oom_adjust_write(struct file *file, const char __user *buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task;
|
2006-06-26 03:25:54 -04:00
|
|
|
char buffer[PROC_NUMBUF], *end;
|
2005-04-16 18:20:36 -04:00
|
|
|
int oom_adjust;
|
|
|
|
|
|
|
|
if (!capable(CAP_SYS_RESOURCE))
|
|
|
|
return -EPERM;
|
2006-06-26 03:25:54 -04:00
|
|
|
memset(buffer, 0, sizeof(buffer));
|
|
|
|
if (count > sizeof(buffer) - 1)
|
|
|
|
count = sizeof(buffer) - 1;
|
2005-04-16 18:20:36 -04:00
|
|
|
if (copy_from_user(buffer, buf, count))
|
|
|
|
return -EFAULT;
|
|
|
|
oom_adjust = simple_strtol(buffer, &end, 0);
|
2006-10-20 02:28:32 -04:00
|
|
|
if ((oom_adjust < OOM_ADJUST_MIN || oom_adjust > OOM_ADJUST_MAX) &&
|
|
|
|
oom_adjust != OOM_DISABLE)
|
2005-04-16 18:20:36 -04:00
|
|
|
return -EINVAL;
|
|
|
|
if (*end == '\n')
|
|
|
|
end++;
|
2006-06-26 03:25:55 -04:00
|
|
|
task = get_proc_task(file->f_dentry->d_inode);
|
|
|
|
if (!task)
|
|
|
|
return -ESRCH;
|
2005-04-16 18:20:36 -04:00
|
|
|
task->oomkilladj = oom_adjust;
|
2006-06-26 03:25:55 -04:00
|
|
|
put_task_struct(task);
|
2005-04-16 18:20:36 -04:00
|
|
|
if (end - buffer == 0)
|
|
|
|
return -EIO;
|
|
|
|
return end - buffer;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_operations proc_oom_adjust_operations = {
|
|
|
|
.read = oom_adjust_read,
|
|
|
|
.write = oom_adjust_write,
|
|
|
|
};
|
|
|
|
|
|
|
|
#ifdef CONFIG_AUDITSYSCALL
|
|
|
|
#define TMPBUFLEN 21
|
|
|
|
static ssize_t proc_loginuid_read(struct file * file, char __user * buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
|
|
|
struct inode * inode = file->f_dentry->d_inode;
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(inode);
|
2005-04-16 18:20:36 -04:00
|
|
|
ssize_t length;
|
|
|
|
char tmpbuf[TMPBUFLEN];
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
if (!task)
|
|
|
|
return -ESRCH;
|
2005-04-16 18:20:36 -04:00
|
|
|
length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
|
|
|
|
audit_get_loginuid(task->audit_context));
|
2006-06-26 03:25:55 -04:00
|
|
|
put_task_struct(task);
|
2005-04-16 18:20:36 -04:00
|
|
|
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)
|
|
|
|
{
|
|
|
|
struct inode * inode = file->f_dentry->d_inode;
|
|
|
|
char *page, *tmp;
|
|
|
|
ssize_t length;
|
|
|
|
uid_t loginuid;
|
|
|
|
|
|
|
|
if (!capable(CAP_AUDIT_CONTROL))
|
|
|
|
return -EPERM;
|
|
|
|
|
2006-06-26 03:25:56 -04:00
|
|
|
if (current != pid_task(proc_pid(inode), PIDTYPE_PID))
|
2005-04-16 18:20:36 -04:00
|
|
|
return -EPERM;
|
|
|
|
|
2006-05-18 08:28:02 -04:00
|
|
|
if (count >= PAGE_SIZE)
|
|
|
|
count = PAGE_SIZE - 1;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
if (*ppos != 0) {
|
|
|
|
/* No partial writes. */
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
page = (char*)__get_free_page(GFP_USER);
|
|
|
|
if (!page)
|
|
|
|
return -ENOMEM;
|
|
|
|
length = -EFAULT;
|
|
|
|
if (copy_from_user(page, buf, count))
|
|
|
|
goto out_free_page;
|
|
|
|
|
2006-05-18 08:28:02 -04:00
|
|
|
page[count] = '\0';
|
2005-04-16 18:20:36 -04:00
|
|
|
loginuid = simple_strtoul(page, &tmp, 10);
|
|
|
|
if (tmp == page) {
|
|
|
|
length = -EINVAL;
|
|
|
|
goto out_free_page;
|
|
|
|
|
|
|
|
}
|
2006-06-26 03:25:55 -04:00
|
|
|
length = audit_set_loginuid(current, loginuid);
|
2005-04-16 18:20:36 -04:00
|
|
|
if (likely(length == 0))
|
|
|
|
length = count;
|
|
|
|
|
|
|
|
out_free_page:
|
|
|
|
free_page((unsigned long) page);
|
|
|
|
return length;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_operations proc_loginuid_operations = {
|
|
|
|
.read = proc_loginuid_read,
|
|
|
|
.write = proc_loginuid_write,
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef CONFIG_SECCOMP
|
|
|
|
static ssize_t seccomp_read(struct file *file, char __user *buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *tsk = get_proc_task(file->f_dentry->d_inode);
|
2005-04-16 18:20:36 -04:00
|
|
|
char __buf[20];
|
|
|
|
loff_t __ppos = *ppos;
|
|
|
|
size_t len;
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
if (!tsk)
|
|
|
|
return -ESRCH;
|
2005-04-16 18:20:36 -04:00
|
|
|
/* no need to print the trailing zero, so use only len */
|
|
|
|
len = sprintf(__buf, "%u\n", tsk->seccomp.mode);
|
2006-06-26 03:25:55 -04:00
|
|
|
put_task_struct(tsk);
|
2005-04-16 18:20:36 -04:00
|
|
|
if (__ppos >= len)
|
|
|
|
return 0;
|
|
|
|
if (count > len - __ppos)
|
|
|
|
count = len - __ppos;
|
|
|
|
if (copy_to_user(buf, __buf + __ppos, count))
|
|
|
|
return -EFAULT;
|
|
|
|
*ppos = __ppos + count;
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t seccomp_write(struct file *file, const char __user *buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *tsk = get_proc_task(file->f_dentry->d_inode);
|
2005-04-16 18:20:36 -04:00
|
|
|
char __buf[20], *end;
|
|
|
|
unsigned int seccomp_mode;
|
2006-06-26 03:25:55 -04:00
|
|
|
ssize_t result;
|
|
|
|
|
|
|
|
result = -ESRCH;
|
|
|
|
if (!tsk)
|
|
|
|
goto out_no_task;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
/* can set it only once to be even more secure */
|
2006-06-26 03:25:55 -04:00
|
|
|
result = -EPERM;
|
2005-04-16 18:20:36 -04:00
|
|
|
if (unlikely(tsk->seccomp.mode))
|
2006-06-26 03:25:55 -04:00
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
result = -EFAULT;
|
2005-04-16 18:20:36 -04:00
|
|
|
memset(__buf, 0, sizeof(__buf));
|
|
|
|
count = min(count, sizeof(__buf) - 1);
|
|
|
|
if (copy_from_user(__buf, buf, count))
|
2006-06-26 03:25:55 -04:00
|
|
|
goto out;
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
seccomp_mode = simple_strtoul(__buf, &end, 0);
|
|
|
|
if (*end == '\n')
|
|
|
|
end++;
|
2006-06-26 03:25:55 -04:00
|
|
|
result = -EINVAL;
|
2005-04-16 18:20:36 -04:00
|
|
|
if (seccomp_mode && seccomp_mode <= NR_SECCOMP_MODES) {
|
|
|
|
tsk->seccomp.mode = seccomp_mode;
|
|
|
|
set_tsk_thread_flag(tsk, TIF_SECCOMP);
|
|
|
|
} else
|
2006-06-26 03:25:55 -04:00
|
|
|
goto out;
|
|
|
|
result = -EIO;
|
2005-04-16 18:20:36 -04:00
|
|
|
if (unlikely(!(end - __buf)))
|
2006-06-26 03:25:55 -04:00
|
|
|
goto out;
|
|
|
|
result = end - __buf;
|
|
|
|
out:
|
|
|
|
put_task_struct(tsk);
|
|
|
|
out_no_task:
|
|
|
|
return result;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_operations proc_seccomp_operations = {
|
|
|
|
.read = seccomp_read,
|
|
|
|
.write = seccomp_write,
|
|
|
|
};
|
|
|
|
#endif /* CONFIG_SECCOMP */
|
|
|
|
|
[PATCH] Fix up symlink function pointers
This fixes up the symlink functions for the calling convention change:
* afs, autofs4, befs, devfs, freevxfs, jffs2, jfs, ncpfs, procfs,
smbfs, sysvfs, ufs, xfs - prototype change for ->follow_link()
* befs, smbfs, xfs - same for ->put_link()
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-08-19 19:17:39 -04:00
|
|
|
static void *proc_pid_follow_link(struct dentry *dentry, struct nameidata *nd)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
|
|
|
struct inode *inode = dentry->d_inode;
|
|
|
|
int error = -EACCES;
|
|
|
|
|
|
|
|
/* We don't need a base pointer in the /proc filesystem */
|
|
|
|
path_release(nd);
|
|
|
|
|
2006-06-26 03:25:58 -04:00
|
|
|
/* Are we allowed to snoop on the tasks file descriptors? */
|
|
|
|
if (!proc_fd_access_allowed(inode))
|
2005-04-16 18:20:36 -04:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
error = PROC_I(inode)->op.proc_get_link(inode, &nd->dentry, &nd->mnt);
|
|
|
|
nd->last_type = LAST_BIND;
|
|
|
|
out:
|
[PATCH] Fix up symlink function pointers
This fixes up the symlink functions for the calling convention change:
* afs, autofs4, befs, devfs, freevxfs, jffs2, jfs, ncpfs, procfs,
smbfs, sysvfs, ufs, xfs - prototype change for ->follow_link()
* befs, smbfs, xfs - same for ->put_link()
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-08-19 19:17:39 -04:00
|
|
|
return ERR_PTR(error);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static int do_proc_readlink(struct dentry *dentry, struct vfsmount *mnt,
|
|
|
|
char __user *buffer, int buflen)
|
|
|
|
{
|
|
|
|
struct inode * inode;
|
|
|
|
char *tmp = (char*)__get_free_page(GFP_KERNEL), *path;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
if (!tmp)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
inode = dentry->d_inode;
|
|
|
|
path = d_path(dentry, mnt, tmp, PAGE_SIZE);
|
|
|
|
len = PTR_ERR(path);
|
|
|
|
if (IS_ERR(path))
|
|
|
|
goto out;
|
|
|
|
len = tmp + PAGE_SIZE - 1 - path;
|
|
|
|
|
|
|
|
if (len > buflen)
|
|
|
|
len = buflen;
|
|
|
|
if (copy_to_user(buffer, path, len))
|
|
|
|
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;
|
|
|
|
struct dentry *de;
|
|
|
|
struct vfsmount *mnt = NULL;
|
|
|
|
|
2006-06-26 03:25:58 -04:00
|
|
|
/* Are we allowed to snoop on the tasks file descriptors? */
|
|
|
|
if (!proc_fd_access_allowed(inode))
|
2005-04-16 18:20:36 -04:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
error = PROC_I(inode)->op.proc_get_link(inode, &de, &mnt);
|
|
|
|
if (error)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
error = do_proc_readlink(de, mnt, buffer, buflen);
|
|
|
|
dput(de);
|
|
|
|
mntput(mnt);
|
|
|
|
out:
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct inode_operations proc_pid_link_inode_operations = {
|
|
|
|
.readlink = proc_pid_readlink,
|
2006-07-15 15:26:45 -04:00
|
|
|
.follow_link = proc_pid_follow_link,
|
|
|
|
.setattr = proc_setattr,
|
2005-04-16 18:20:36 -04:00
|
|
|
};
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
|
|
|
|
/* building an inode */
|
|
|
|
|
|
|
|
static int task_dumpable(struct task_struct *task)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2006-10-02 05:17:05 -04:00
|
|
|
int dumpable = 0;
|
|
|
|
struct mm_struct *mm;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
task_lock(task);
|
|
|
|
mm = task->mm;
|
|
|
|
if (mm)
|
|
|
|
dumpable = mm->dumpable;
|
|
|
|
task_unlock(task);
|
|
|
|
if(dumpable == 1)
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static struct inode *proc_pid_make_inode(struct super_block * sb, struct task_struct *task)
|
2006-10-02 05:17:05 -04:00
|
|
|
{
|
|
|
|
struct inode * inode;
|
|
|
|
struct proc_inode *ei;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
/* We need a new inode */
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
inode = new_inode(sb);
|
|
|
|
if (!inode)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* Common stuff */
|
|
|
|
ei = PROC_I(inode);
|
|
|
|
inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
|
|
|
|
inode->i_op = &proc_def_inode_operations;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* grab the reference to task.
|
|
|
|
*/
|
2006-10-02 05:18:59 -04:00
|
|
|
ei->pid = get_task_pid(task, PIDTYPE_PID);
|
2006-10-02 05:17:05 -04:00
|
|
|
if (!ei->pid)
|
|
|
|
goto out_unlock;
|
|
|
|
|
|
|
|
inode->i_uid = 0;
|
|
|
|
inode->i_gid = 0;
|
|
|
|
if (task_dumpable(task)) {
|
|
|
|
inode->i_uid = task->euid;
|
|
|
|
inode->i_gid = task->egid;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
2006-10-02 05:17:05 -04:00
|
|
|
security_task_to_inode(task, inode);
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
out:
|
2006-10-02 05:17:05 -04:00
|
|
|
return inode;
|
|
|
|
|
|
|
|
out_unlock:
|
|
|
|
iput(inode);
|
|
|
|
return NULL;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static int pid_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
|
|
|
struct inode *inode = dentry->d_inode;
|
2006-10-02 05:17:05 -04:00
|
|
|
struct task_struct *task;
|
|
|
|
generic_fillattr(inode, stat);
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
rcu_read_lock();
|
|
|
|
stat->uid = 0;
|
|
|
|
stat->gid = 0;
|
|
|
|
task = pid_task(proc_pid(inode), PIDTYPE_PID);
|
|
|
|
if (task) {
|
|
|
|
if ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||
|
|
|
|
task_dumpable(task)) {
|
|
|
|
stat->uid = task->euid;
|
|
|
|
stat->gid = task->egid;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
}
|
2006-10-02 05:17:05 -04:00
|
|
|
rcu_read_unlock();
|
2005-06-23 03:09:43 -04:00
|
|
|
return 0;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* 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.
|
2006-06-26 03:25:55 -04:00
|
|
|
*
|
|
|
|
* 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.
|
2005-04-16 18:20:36 -04:00
|
|
|
*/
|
|
|
|
static int pid_revalidate(struct dentry *dentry, struct nameidata *nd)
|
|
|
|
{
|
|
|
|
struct inode *inode = dentry->d_inode;
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(inode);
|
|
|
|
if (task) {
|
|
|
|
if ((inode->i_mode == (S_IFDIR|S_IRUGO|S_IXUGO)) ||
|
|
|
|
task_dumpable(task)) {
|
2005-04-16 18:20:36 -04:00
|
|
|
inode->i_uid = task->euid;
|
|
|
|
inode->i_gid = task->egid;
|
|
|
|
} else {
|
|
|
|
inode->i_uid = 0;
|
|
|
|
inode->i_gid = 0;
|
|
|
|
}
|
2006-07-15 00:48:03 -04:00
|
|
|
inode->i_mode &= ~(S_ISUID | S_ISGID);
|
2005-04-16 18:20:36 -04:00
|
|
|
security_task_to_inode(task, inode);
|
2006-06-26 03:25:55 -04:00
|
|
|
put_task_struct(task);
|
2005-04-16 18:20:36 -04:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
d_drop(dentry);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static int pid_delete_dentry(struct dentry * dentry)
|
2006-06-26 03:25:55 -04:00
|
|
|
{
|
2006-10-02 05:17:05 -04:00
|
|
|
/* Is the task we represent dead?
|
|
|
|
* If so, then don't put the dentry on the lru list,
|
|
|
|
* kill it immediately.
|
|
|
|
*/
|
|
|
|
return !proc_pid(dentry->d_inode)->tasks[PIDTYPE_PID].first;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct dentry_operations pid_dentry_operations =
|
|
|
|
{
|
|
|
|
.d_revalidate = pid_revalidate,
|
|
|
|
.d_delete = pid_delete_dentry,
|
|
|
|
};
|
|
|
|
|
|
|
|
/* Lookups */
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
typedef struct dentry *instantiate_t(struct inode *, struct dentry *, struct task_struct *, void *);
|
|
|
|
|
2006-10-02 05:18:57 -04:00
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
2006-10-02 05:18:49 -04:00
|
|
|
static int proc_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
|
|
|
|
char *name, int len,
|
|
|
|
instantiate_t instantiate, struct task_struct *task, void *ptr)
|
|
|
|
{
|
|
|
|
struct dentry *child, *dir = filp->f_dentry;
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int proc_fd_link(struct inode *inode, struct dentry **dentry, struct vfsmount **mnt)
|
|
|
|
{
|
|
|
|
struct task_struct *task = get_proc_task(inode);
|
|
|
|
struct files_struct *files = NULL;
|
|
|
|
struct file *file;
|
|
|
|
int fd = proc_fd(inode);
|
2006-06-26 03:25:55 -04:00
|
|
|
|
|
|
|
if (task) {
|
2006-10-02 05:17:05 -04:00
|
|
|
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) {
|
|
|
|
*mnt = mntget(file->f_vfsmnt);
|
|
|
|
*dentry = dget(file->f_dentry);
|
|
|
|
spin_unlock(&files->file_lock);
|
|
|
|
put_files_struct(files);
|
|
|
|
return 0;
|
2006-06-26 03:25:55 -04:00
|
|
|
}
|
2006-10-02 05:17:05 -04:00
|
|
|
spin_unlock(&files->file_lock);
|
|
|
|
put_files_struct(files);
|
2006-06-26 03:25:55 -04:00
|
|
|
}
|
2006-10-02 05:17:05 -04:00
|
|
|
return -ENOENT;
|
2006-06-26 03:25:55 -04:00
|
|
|
}
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
static int tid_fd_revalidate(struct dentry *dentry, struct nameidata *nd)
|
|
|
|
{
|
|
|
|
struct inode *inode = dentry->d_inode;
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(inode);
|
2006-06-26 03:25:44 -04:00
|
|
|
int fd = proc_fd(inode);
|
2005-04-16 18:20:36 -04:00
|
|
|
struct files_struct *files;
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
if (task) {
|
|
|
|
files = get_files_struct(task);
|
|
|
|
if (files) {
|
|
|
|
rcu_read_lock();
|
|
|
|
if (fcheck_files(files, fd)) {
|
|
|
|
rcu_read_unlock();
|
|
|
|
put_files_struct(files);
|
|
|
|
if (task_dumpable(task)) {
|
|
|
|
inode->i_uid = task->euid;
|
|
|
|
inode->i_gid = task->egid;
|
|
|
|
} else {
|
|
|
|
inode->i_uid = 0;
|
|
|
|
inode->i_gid = 0;
|
|
|
|
}
|
2006-07-15 00:48:03 -04:00
|
|
|
inode->i_mode &= ~(S_ISUID | S_ISGID);
|
2006-06-26 03:25:55 -04:00
|
|
|
security_task_to_inode(task, inode);
|
|
|
|
put_task_struct(task);
|
|
|
|
return 1;
|
|
|
|
}
|
2005-09-09 16:04:14 -04:00
|
|
|
rcu_read_unlock();
|
2005-04-16 18:20:36 -04:00
|
|
|
put_files_struct(files);
|
|
|
|
}
|
2006-06-26 03:25:55 -04:00
|
|
|
put_task_struct(task);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
d_drop(dentry);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct dentry_operations tid_fd_dentry_operations =
|
|
|
|
{
|
|
|
|
.d_revalidate = tid_fd_revalidate,
|
|
|
|
.d_delete = pid_delete_dentry,
|
|
|
|
};
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static struct dentry *proc_fd_instantiate(struct inode *dir,
|
|
|
|
struct dentry *dentry, struct task_struct *task, void *ptr)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2006-10-02 05:18:49 -04:00
|
|
|
unsigned fd = *(unsigned *)ptr;
|
|
|
|
struct file *file;
|
|
|
|
struct files_struct *files;
|
|
|
|
struct inode *inode;
|
|
|
|
struct proc_inode *ei;
|
|
|
|
struct dentry *error = ERR_PTR(-ENOENT);
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
inode = proc_pid_make_inode(dir->i_sb, task);
|
2005-04-16 18:20:36 -04:00
|
|
|
if (!inode)
|
|
|
|
goto out;
|
|
|
|
ei = PROC_I(inode);
|
2006-06-26 03:25:44 -04:00
|
|
|
ei->fd = fd;
|
2005-04-16 18:20:36 -04:00
|
|
|
files = get_files_struct(task);
|
|
|
|
if (!files)
|
2006-10-02 05:18:49 -04:00
|
|
|
goto out_iput;
|
2005-04-16 18:20:36 -04:00
|
|
|
inode->i_mode = S_IFLNK;
|
2006-04-19 01:21:46 -04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* We are not taking a ref to the file structure, so we must
|
|
|
|
* hold ->file_lock.
|
|
|
|
*/
|
|
|
|
spin_lock(&files->file_lock);
|
2005-04-16 18:20:36 -04:00
|
|
|
file = fcheck_files(files, fd);
|
|
|
|
if (!file)
|
2006-10-02 05:18:49 -04:00
|
|
|
goto out_unlock;
|
2005-04-16 18:20:36 -04:00
|
|
|
if (file->f_mode & 1)
|
|
|
|
inode->i_mode |= S_IRUSR | S_IXUSR;
|
|
|
|
if (file->f_mode & 2)
|
|
|
|
inode->i_mode |= S_IWUSR | S_IXUSR;
|
2006-04-19 01:21:46 -04:00
|
|
|
spin_unlock(&files->file_lock);
|
2005-04-16 18:20:36 -04:00
|
|
|
put_files_struct(files);
|
2006-10-02 05:18:49 -04:00
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
inode->i_op = &proc_pid_link_inode_operations;
|
|
|
|
inode->i_size = 64;
|
|
|
|
ei->op.proc_get_link = proc_fd_link;
|
|
|
|
dentry->d_op = &tid_fd_dentry_operations;
|
|
|
|
d_add(dentry, inode);
|
2006-06-26 03:25:49 -04:00
|
|
|
/* Close the race of the process dying before we return the dentry */
|
|
|
|
if (tid_fd_revalidate(dentry, NULL))
|
2006-10-02 05:18:49 -04:00
|
|
|
error = NULL;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
out:
|
|
|
|
return error;
|
|
|
|
out_unlock:
|
2006-04-19 01:21:46 -04:00
|
|
|
spin_unlock(&files->file_lock);
|
2005-04-16 18:20:36 -04:00
|
|
|
put_files_struct(files);
|
2006-10-02 05:18:49 -04:00
|
|
|
out_iput:
|
2005-04-16 18:20:36 -04:00
|
|
|
iput(inode);
|
2006-06-26 03:25:49 -04:00
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static struct dentry *proc_lookupfd(struct inode * dir, struct dentry * dentry, struct nameidata *nd)
|
|
|
|
{
|
|
|
|
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;
|
|
|
|
|
|
|
|
result = proc_fd_instantiate(dir, dentry, task, &fd);
|
|
|
|
out:
|
|
|
|
put_task_struct(task);
|
|
|
|
out_no_task:
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static int proc_fd_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
|
|
|
|
struct task_struct *task, int fd)
|
|
|
|
{
|
|
|
|
char name[PROC_NUMBUF];
|
|
|
|
int len = snprintf(name, sizeof(name), "%d", fd);
|
|
|
|
return proc_fill_cache(filp, dirent, filldir, name, len,
|
|
|
|
proc_fd_instantiate, task, &fd);
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static int proc_readfd(struct file * filp, void * dirent, filldir_t filldir)
|
|
|
|
{
|
|
|
|
struct dentry *dentry = filp->f_dentry;
|
|
|
|
struct inode *inode = dentry->d_inode;
|
|
|
|
struct task_struct *p = get_proc_task(inode);
|
|
|
|
unsigned int fd, tid, ino;
|
|
|
|
int retval;
|
|
|
|
struct files_struct * files;
|
|
|
|
struct fdtable *fdt;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
retval = -ENOENT;
|
|
|
|
if (!p)
|
|
|
|
goto out_no_task;
|
|
|
|
retval = 0;
|
|
|
|
tid = p->pid;
|
|
|
|
|
|
|
|
fd = filp->f_pos;
|
|
|
|
switch (fd) {
|
|
|
|
case 0:
|
|
|
|
if (filldir(dirent, ".", 1, 0, inode->i_ino, DT_DIR) < 0)
|
|
|
|
goto out;
|
|
|
|
filp->f_pos++;
|
|
|
|
case 1:
|
|
|
|
ino = parent_ino(dentry);
|
|
|
|
if (filldir(dirent, "..", 2, 1, ino, DT_DIR) < 0)
|
|
|
|
goto out;
|
|
|
|
filp->f_pos++;
|
|
|
|
default:
|
|
|
|
files = get_files_struct(p);
|
|
|
|
if (!files)
|
|
|
|
goto out;
|
|
|
|
rcu_read_lock();
|
|
|
|
fdt = files_fdtable(files);
|
|
|
|
for (fd = filp->f_pos-2;
|
|
|
|
fd < fdt->max_fds;
|
|
|
|
fd++, filp->f_pos++) {
|
|
|
|
|
|
|
|
if (!fcheck_files(files, fd))
|
|
|
|
continue;
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
if (proc_fd_fill_cache(filp, dirent, filldir, p, fd) < 0) {
|
2006-10-02 05:17:05 -04:00
|
|
|
rcu_read_lock();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
rcu_read_lock();
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
put_files_struct(files);
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
put_task_struct(p);
|
|
|
|
out_no_task:
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_operations proc_fd_operations = {
|
|
|
|
.read = generic_read_dir,
|
|
|
|
.readdir = proc_readfd,
|
2005-04-16 18:20:36 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* proc directories can do almost nothing..
|
|
|
|
*/
|
|
|
|
static struct inode_operations proc_fd_inode_operations = {
|
|
|
|
.lookup = proc_lookupfd,
|
2006-07-15 15:26:45 -04:00
|
|
|
.setattr = proc_setattr,
|
2005-04-16 18:20:36 -04:00
|
|
|
};
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static struct dentry *proc_pident_instantiate(struct inode *dir,
|
|
|
|
struct dentry *dentry, struct task_struct *task, void *ptr)
|
|
|
|
{
|
|
|
|
struct pid_entry *p = ptr;
|
|
|
|
struct inode *inode;
|
|
|
|
struct proc_inode *ei;
|
|
|
|
struct dentry *error = ERR_PTR(-EINVAL);
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
inode = proc_pid_make_inode(dir->i_sb, task);
|
2006-10-02 05:18:49 -04:00
|
|
|
if (!inode)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
ei = PROC_I(inode);
|
|
|
|
inode->i_mode = p->mode;
|
|
|
|
if (S_ISDIR(inode->i_mode))
|
|
|
|
inode->i_nlink = 2; /* Use getattr to fix if necessary */
|
|
|
|
if (p->iop)
|
|
|
|
inode->i_op = p->iop;
|
|
|
|
if (p->fop)
|
|
|
|
inode->i_fop = p->fop;
|
|
|
|
ei->op = p->op;
|
|
|
|
dentry->d_op = &pid_dentry_operations;
|
|
|
|
d_add(dentry, inode);
|
|
|
|
/* Close the race of the process dying before we return the dentry */
|
|
|
|
if (pid_revalidate(dentry, NULL))
|
|
|
|
error = NULL;
|
|
|
|
out:
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
static struct dentry *proc_pident_lookup(struct inode *dir,
|
|
|
|
struct dentry *dentry,
|
2006-10-02 05:18:56 -04:00
|
|
|
struct pid_entry *ents,
|
|
|
|
unsigned int nents)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
|
|
|
struct inode *inode;
|
2006-06-26 03:25:49 -04:00
|
|
|
struct dentry *error;
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *task = get_proc_task(dir);
|
2006-10-02 05:18:56 -04:00
|
|
|
struct pid_entry *p, *last;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:49 -04:00
|
|
|
error = ERR_PTR(-ENOENT);
|
2005-04-16 18:20:36 -04:00
|
|
|
inode = NULL;
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
if (!task)
|
|
|
|
goto out_no_task;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:17:07 -04:00
|
|
|
/*
|
|
|
|
* Yes, it does not scale. And it should not. Don't add
|
|
|
|
* new entries into /proc/<tgid>/ without very good reasons.
|
|
|
|
*/
|
2006-10-02 05:18:56 -04:00
|
|
|
last = &ents[nents - 1];
|
|
|
|
for (p = ents; p <= last; p++) {
|
2005-04-16 18:20:36 -04:00
|
|
|
if (p->len != dentry->d_name.len)
|
|
|
|
continue;
|
|
|
|
if (!memcmp(dentry->d_name.name, p->name, p->len))
|
|
|
|
break;
|
|
|
|
}
|
2006-10-02 05:18:56 -04:00
|
|
|
if (p > last)
|
2005-04-16 18:20:36 -04:00
|
|
|
goto out;
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
error = proc_pident_instantiate(dir, dentry, task, p);
|
2005-04-16 18:20:36 -04:00
|
|
|
out:
|
2006-06-26 03:25:55 -04:00
|
|
|
put_task_struct(task);
|
|
|
|
out_no_task:
|
2006-06-26 03:25:49 -04:00
|
|
|
return error;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static int proc_pident_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
|
|
|
|
struct task_struct *task, struct pid_entry *p)
|
|
|
|
{
|
|
|
|
return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
|
|
|
|
proc_pident_instantiate, task, p);
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static int proc_pident_readdir(struct file *filp,
|
|
|
|
void *dirent, filldir_t filldir,
|
|
|
|
struct pid_entry *ents, unsigned int nents)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
int pid;
|
|
|
|
struct dentry *dentry = filp->f_dentry;
|
|
|
|
struct inode *inode = dentry->d_inode;
|
|
|
|
struct task_struct *task = get_proc_task(inode);
|
2006-10-02 05:18:56 -04:00
|
|
|
struct pid_entry *p, *last;
|
2006-10-02 05:17:05 -04:00
|
|
|
ino_t ino;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
ret = -ENOENT;
|
|
|
|
if (!task)
|
2006-10-02 05:18:49 -04:00
|
|
|
goto out_no_task;
|
2006-10-02 05:17:05 -04:00
|
|
|
|
|
|
|
ret = 0;
|
|
|
|
pid = task->pid;
|
|
|
|
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;
|
2006-10-02 05:18:56 -04:00
|
|
|
last = &ents[nents - 1];
|
|
|
|
while (p <= last) {
|
2006-10-02 05:18:49 -04:00
|
|
|
if (proc_pident_fill_cache(filp, dirent, filldir, task, p) < 0)
|
2006-10-02 05:17:05 -04:00
|
|
|
goto out;
|
|
|
|
filp->f_pos++;
|
|
|
|
p++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ret = 1;
|
|
|
|
out:
|
2006-10-02 05:18:49 -04:00
|
|
|
put_task_struct(task);
|
|
|
|
out_no_task:
|
2006-10-02 05:17:05 -04:00
|
|
|
return ret;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
#ifdef CONFIG_SECURITY
|
|
|
|
static ssize_t proc_pid_attr_read(struct file * file, char __user * buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
|
|
|
struct inode * inode = file->f_dentry->d_inode;
|
|
|
|
unsigned long 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;
|
|
|
|
length = -ENOMEM;
|
|
|
|
if (!(page = __get_free_page(GFP_KERNEL)))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
length = security_getprocattr(task,
|
|
|
|
(char*)file->f_dentry->d_name.name,
|
|
|
|
(void*)page, count);
|
|
|
|
if (length >= 0)
|
|
|
|
length = simple_read_from_buffer(buf, count, ppos, (char *)page, length);
|
|
|
|
free_page(page);
|
|
|
|
out:
|
|
|
|
put_task_struct(task);
|
|
|
|
out_no_task:
|
|
|
|
return length;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static ssize_t proc_pid_attr_write(struct file * file, const char __user * buf,
|
|
|
|
size_t count, loff_t *ppos)
|
|
|
|
{
|
|
|
|
struct inode * inode = file->f_dentry->d_inode;
|
|
|
|
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;
|
|
|
|
page = (char*)__get_free_page(GFP_USER);
|
|
|
|
if (!page)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
length = -EFAULT;
|
|
|
|
if (copy_from_user(page, buf, count))
|
|
|
|
goto out_free;
|
|
|
|
|
|
|
|
length = security_setprocattr(task,
|
|
|
|
(char*)file->f_dentry->d_name.name,
|
|
|
|
(void*)page, count);
|
|
|
|
out_free:
|
|
|
|
free_page((unsigned long) page);
|
|
|
|
out:
|
|
|
|
put_task_struct(task);
|
|
|
|
out_no_task:
|
|
|
|
return length;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_operations proc_pid_attr_operations = {
|
|
|
|
.read = proc_pid_attr_read,
|
|
|
|
.write = proc_pid_attr_write,
|
|
|
|
};
|
|
|
|
|
2006-10-02 05:18:50 -04:00
|
|
|
static struct pid_entry attr_dir_stuff[] = {
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("current", S_IRUGO|S_IWUGO, pid_attr),
|
|
|
|
REG("prev", S_IRUGO, pid_attr),
|
|
|
|
REG("exec", S_IRUGO|S_IWUGO, pid_attr),
|
|
|
|
REG("fscreate", S_IRUGO|S_IWUGO, pid_attr),
|
|
|
|
REG("keycreate", S_IRUGO|S_IWUGO, pid_attr),
|
|
|
|
REG("sockcreate", S_IRUGO|S_IWUGO, pid_attr),
|
2006-10-02 05:17:05 -04:00
|
|
|
};
|
|
|
|
|
2006-10-02 05:18:50 -04:00
|
|
|
static int proc_attr_dir_readdir(struct file * filp,
|
2006-10-02 05:17:05 -04:00
|
|
|
void * dirent, filldir_t filldir)
|
|
|
|
{
|
|
|
|
return proc_pident_readdir(filp,dirent,filldir,
|
2006-10-02 05:18:50 -04:00
|
|
|
attr_dir_stuff,ARRAY_SIZE(attr_dir_stuff));
|
2006-10-02 05:17:05 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:50 -04:00
|
|
|
static struct file_operations proc_attr_dir_operations = {
|
2005-04-16 18:20:36 -04:00
|
|
|
.read = generic_read_dir,
|
2006-10-02 05:18:50 -04:00
|
|
|
.readdir = proc_attr_dir_readdir,
|
2005-04-16 18:20:36 -04:00
|
|
|
};
|
|
|
|
|
2006-10-02 05:18:50 -04:00
|
|
|
static struct dentry *proc_attr_dir_lookup(struct inode *dir,
|
2006-10-02 05:17:05 -04:00
|
|
|
struct dentry *dentry, struct nameidata *nd)
|
|
|
|
{
|
2006-10-02 05:18:56 -04:00
|
|
|
return proc_pident_lookup(dir, dentry,
|
|
|
|
attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff));
|
2006-10-02 05:17:05 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:50 -04:00
|
|
|
static struct inode_operations proc_attr_dir_inode_operations = {
|
|
|
|
.lookup = proc_attr_dir_lookup,
|
2006-06-26 03:25:55 -04:00
|
|
|
.getattr = pid_getattr,
|
2006-07-15 15:26:45 -04:00
|
|
|
.setattr = proc_setattr,
|
2005-04-16 18:20:36 -04:00
|
|
|
};
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* /proc/self:
|
|
|
|
*/
|
|
|
|
static int proc_self_readlink(struct dentry *dentry, char __user *buffer,
|
|
|
|
int buflen)
|
|
|
|
{
|
|
|
|
char tmp[PROC_NUMBUF];
|
|
|
|
sprintf(tmp, "%d", current->tgid);
|
|
|
|
return vfs_readlink(dentry,buffer,buflen,tmp);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *proc_self_follow_link(struct dentry *dentry, struct nameidata *nd)
|
|
|
|
{
|
|
|
|
char tmp[PROC_NUMBUF];
|
|
|
|
sprintf(tmp, "%d", current->tgid);
|
|
|
|
return ERR_PTR(vfs_follow_link(nd,tmp));
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct inode_operations proc_self_inode_operations = {
|
|
|
|
.readlink = proc_self_readlink,
|
|
|
|
.follow_link = proc_self_follow_link,
|
|
|
|
};
|
|
|
|
|
2006-10-02 05:18:48 -04:00
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
static struct pid_entry proc_base_stuff[] = {
|
2006-10-02 05:18:49 -04:00
|
|
|
NOD("self", S_IFLNK|S_IRWXUGO,
|
2006-10-02 05:18:48 -04:00
|
|
|
&proc_self_inode_operations, NULL, {}),
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Exceptional case: normally we are not allowed to unhash a busy
|
|
|
|
* directory. In this case, however, we can do it - no aliasing problems
|
|
|
|
* due to the way we treat inodes.
|
|
|
|
*/
|
|
|
|
static int proc_base_revalidate(struct dentry *dentry, struct nameidata *nd)
|
|
|
|
{
|
|
|
|
struct inode *inode = dentry->d_inode;
|
|
|
|
struct task_struct *task = get_proc_task(inode);
|
|
|
|
if (task) {
|
|
|
|
put_task_struct(task);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
d_drop(dentry);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct dentry_operations proc_base_dentry_operations =
|
|
|
|
{
|
|
|
|
.d_revalidate = proc_base_revalidate,
|
|
|
|
.d_delete = pid_delete_dentry,
|
|
|
|
};
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static struct dentry *proc_base_instantiate(struct inode *dir,
|
|
|
|
struct dentry *dentry, struct task_struct *task, void *ptr)
|
2006-10-02 05:18:48 -04:00
|
|
|
{
|
2006-10-02 05:18:49 -04:00
|
|
|
struct pid_entry *p = ptr;
|
2006-10-02 05:18:48 -04:00
|
|
|
struct inode *inode;
|
|
|
|
struct proc_inode *ei;
|
2006-10-02 05:18:49 -04:00
|
|
|
struct dentry *error = ERR_PTR(-EINVAL);
|
2006-10-02 05:18:48 -04:00
|
|
|
|
|
|
|
/* Allocate the inode */
|
|
|
|
error = ERR_PTR(-ENOMEM);
|
|
|
|
inode = new_inode(dir->i_sb);
|
|
|
|
if (!inode)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
/* Initialize the inode */
|
|
|
|
ei = PROC_I(inode);
|
|
|
|
inode->i_mtime = inode->i_atime = inode->i_ctime = CURRENT_TIME;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* grab the reference to the task.
|
|
|
|
*/
|
2006-10-02 05:18:59 -04:00
|
|
|
ei->pid = get_task_pid(task, PIDTYPE_PID);
|
2006-10-02 05:18:48 -04:00
|
|
|
if (!ei->pid)
|
|
|
|
goto out_iput;
|
|
|
|
|
|
|
|
inode->i_uid = 0;
|
|
|
|
inode->i_gid = 0;
|
|
|
|
inode->i_mode = p->mode;
|
|
|
|
if (S_ISDIR(inode->i_mode))
|
|
|
|
inode->i_nlink = 2;
|
|
|
|
if (S_ISLNK(inode->i_mode))
|
|
|
|
inode->i_size = 64;
|
|
|
|
if (p->iop)
|
|
|
|
inode->i_op = p->iop;
|
|
|
|
if (p->fop)
|
|
|
|
inode->i_fop = p->fop;
|
|
|
|
ei->op = p->op;
|
|
|
|
dentry->d_op = &proc_base_dentry_operations;
|
|
|
|
d_add(dentry, inode);
|
|
|
|
error = NULL;
|
|
|
|
out:
|
|
|
|
return error;
|
|
|
|
out_iput:
|
|
|
|
iput(inode);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static struct dentry *proc_base_lookup(struct inode *dir, struct dentry *dentry)
|
|
|
|
{
|
|
|
|
struct dentry *error;
|
|
|
|
struct task_struct *task = get_proc_task(dir);
|
2006-10-02 05:18:56 -04:00
|
|
|
struct pid_entry *p, *last;
|
2006-10-02 05:18:49 -04:00
|
|
|
|
|
|
|
error = ERR_PTR(-ENOENT);
|
|
|
|
|
|
|
|
if (!task)
|
|
|
|
goto out_no_task;
|
|
|
|
|
|
|
|
/* Lookup the directory entry */
|
2006-10-02 05:18:56 -04:00
|
|
|
last = &proc_base_stuff[ARRAY_SIZE(proc_base_stuff) - 1];
|
|
|
|
for (p = proc_base_stuff; p <= last; p++) {
|
2006-10-02 05:18:49 -04:00
|
|
|
if (p->len != dentry->d_name.len)
|
|
|
|
continue;
|
|
|
|
if (!memcmp(dentry->d_name.name, p->name, p->len))
|
|
|
|
break;
|
|
|
|
}
|
2006-10-02 05:18:56 -04:00
|
|
|
if (p > last)
|
2006-10-02 05:18:49 -04:00
|
|
|
goto out;
|
|
|
|
|
|
|
|
error = proc_base_instantiate(dir, dentry, task, p);
|
|
|
|
|
|
|
|
out:
|
|
|
|
put_task_struct(task);
|
|
|
|
out_no_task:
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static int proc_base_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
|
|
|
|
struct task_struct *task, struct pid_entry *p)
|
|
|
|
{
|
|
|
|
return proc_fill_cache(filp, dirent, filldir, p->name, p->len,
|
|
|
|
proc_base_instantiate, task, p);
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
/*
|
|
|
|
* Thread groups
|
|
|
|
*/
|
2006-10-02 05:17:07 -04:00
|
|
|
static struct file_operations proc_task_operations;
|
|
|
|
static struct inode_operations proc_task_inode_operations;
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static struct pid_entry tgid_base_stuff[] = {
|
2006-10-02 05:18:49 -04:00
|
|
|
DIR("task", S_IRUGO|S_IXUGO, task),
|
|
|
|
DIR("fd", S_IRUSR|S_IXUSR, fd),
|
|
|
|
INF("environ", S_IRUSR, pid_environ),
|
|
|
|
INF("auxv", S_IRUSR, pid_auxv),
|
|
|
|
INF("status", S_IRUGO, pid_status),
|
|
|
|
INF("cmdline", S_IRUGO, pid_cmdline),
|
|
|
|
INF("stat", S_IRUGO, tgid_stat),
|
|
|
|
INF("statm", S_IRUGO, pid_statm),
|
|
|
|
REG("maps", S_IRUGO, maps),
|
2006-10-02 05:17:05 -04:00
|
|
|
#ifdef CONFIG_NUMA
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("numa_maps", S_IRUGO, numa_maps),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("mem", S_IRUSR|S_IWUSR, mem),
|
2006-10-02 05:17:05 -04:00
|
|
|
#ifdef CONFIG_SECCOMP
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("seccomp", S_IRUSR|S_IWUSR, seccomp),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
2006-10-02 05:18:49 -04:00
|
|
|
LNK("cwd", cwd),
|
|
|
|
LNK("root", root),
|
|
|
|
LNK("exe", exe),
|
|
|
|
REG("mounts", S_IRUGO, mounts),
|
|
|
|
REG("mountstats", S_IRUSR, mountstats),
|
2006-10-02 05:17:05 -04:00
|
|
|
#ifdef CONFIG_MMU
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("smaps", S_IRUGO, smaps),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_SECURITY
|
2006-10-02 05:18:50 -04:00
|
|
|
DIR("attr", S_IRUGO|S_IXUGO, attr_dir),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_KALLSYMS
|
2006-10-02 05:18:49 -04:00
|
|
|
INF("wchan", S_IRUGO, pid_wchan),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_SCHEDSTATS
|
2006-10-02 05:18:49 -04:00
|
|
|
INF("schedstat", S_IRUGO, pid_schedstat),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_CPUSETS
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("cpuset", S_IRUGO, cpuset),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
2006-10-02 05:18:49 -04:00
|
|
|
INF("oom_score", S_IRUGO, oom_score),
|
|
|
|
REG("oom_adj", S_IRUGO|S_IWUSR, oom_adjust),
|
2006-10-02 05:17:05 -04:00
|
|
|
#ifdef CONFIG_AUDITSYSCALL
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("loginuid", S_IWUSR|S_IRUGO, loginuid),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
};
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static int proc_tgid_base_readdir(struct file * filp,
|
2005-04-16 18:20:36 -04:00
|
|
|
void * dirent, filldir_t filldir)
|
|
|
|
{
|
|
|
|
return proc_pident_readdir(filp,dirent,filldir,
|
2006-10-02 05:17:05 -04:00
|
|
|
tgid_base_stuff,ARRAY_SIZE(tgid_base_stuff));
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static struct file_operations proc_tgid_base_operations = {
|
2005-04-16 18:20:36 -04:00
|
|
|
.read = generic_read_dir,
|
2006-10-02 05:17:05 -04:00
|
|
|
.readdir = proc_tgid_base_readdir,
|
2005-04-16 18:20:36 -04:00
|
|
|
};
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static struct dentry *proc_tgid_base_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd){
|
2006-10-02 05:18:56 -04:00
|
|
|
return proc_pident_lookup(dir, dentry,
|
|
|
|
tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
static struct inode_operations proc_tgid_base_inode_operations = {
|
|
|
|
.lookup = proc_tgid_base_lookup,
|
2006-06-26 03:25:55 -04:00
|
|
|
.getattr = pid_getattr,
|
2006-07-15 15:26:45 -04:00
|
|
|
.setattr = proc_setattr,
|
2005-04-16 18:20:36 -04:00
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
2006-06-26 03:25:48 -04:00
|
|
|
* proc_flush_task - Remove dcache entries for @task from the /proc dcache.
|
|
|
|
*
|
|
|
|
* @task: task that should be flushed.
|
|
|
|
*
|
|
|
|
* 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.
|
2005-04-16 18:20:36 -04:00
|
|
|
*
|
2006-06-26 03:25:48 -04:00
|
|
|
* 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.
|
2005-04-16 18:20:36 -04:00
|
|
|
*
|
2006-06-26 03:25:48 -04:00
|
|
|
* 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.
|
2005-04-16 18:20:36 -04:00
|
|
|
*/
|
2006-06-26 03:25:48 -04:00
|
|
|
void proc_flush_task(struct task_struct *task)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
2006-06-26 03:25:48 -04:00
|
|
|
struct dentry *dentry, *leader, *dir;
|
2006-06-26 03:25:54 -04:00
|
|
|
char buf[PROC_NUMBUF];
|
2006-06-26 03:25:48 -04:00
|
|
|
struct qstr name;
|
|
|
|
|
|
|
|
name.name = buf;
|
|
|
|
name.len = snprintf(buf, sizeof(buf), "%d", task->pid);
|
|
|
|
dentry = d_hash_and_lookup(proc_mnt->mnt_root, &name);
|
|
|
|
if (dentry) {
|
|
|
|
shrink_dcache_parent(dentry);
|
|
|
|
d_drop(dentry);
|
|
|
|
dput(dentry);
|
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:48 -04:00
|
|
|
if (thread_group_leader(task))
|
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:48 -04:00
|
|
|
name.name = buf;
|
|
|
|
name.len = snprintf(buf, sizeof(buf), "%d", task->tgid);
|
|
|
|
leader = d_hash_and_lookup(proc_mnt->mnt_root, &name);
|
|
|
|
if (!leader)
|
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:48 -04:00
|
|
|
name.name = "task";
|
|
|
|
name.len = strlen(name.name);
|
|
|
|
dir = d_hash_and_lookup(leader, &name);
|
|
|
|
if (!dir)
|
|
|
|
goto out_put_leader;
|
|
|
|
|
|
|
|
name.name = buf;
|
|
|
|
name.len = snprintf(buf, sizeof(buf), "%d", task->pid);
|
|
|
|
dentry = d_hash_and_lookup(dir, &name);
|
|
|
|
if (dentry) {
|
|
|
|
shrink_dcache_parent(dentry);
|
|
|
|
d_drop(dentry);
|
|
|
|
dput(dentry);
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
2006-06-26 03:25:48 -04:00
|
|
|
|
|
|
|
dput(dir);
|
|
|
|
out_put_leader:
|
|
|
|
dput(leader);
|
|
|
|
out:
|
|
|
|
return;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
struct dentry *proc_pid_instantiate(struct inode *dir,
|
|
|
|
struct dentry * dentry, struct task_struct *task, void *ptr)
|
|
|
|
{
|
|
|
|
struct dentry *error = ERR_PTR(-ENOENT);
|
|
|
|
struct inode *inode;
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
inode = proc_pid_make_inode(dir->i_sb, task);
|
2006-10-02 05:18:49 -04:00
|
|
|
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;
|
|
|
|
inode->i_nlink = 4;
|
|
|
|
#ifdef CONFIG_SECURITY
|
|
|
|
inode->i_nlink += 1;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
dentry->d_op = &pid_dentry_operations;
|
|
|
|
|
|
|
|
d_add(dentry, inode);
|
|
|
|
/* Close the race of the process dying before we return the dentry */
|
|
|
|
if (pid_revalidate(dentry, NULL))
|
|
|
|
error = NULL;
|
|
|
|
out:
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
struct dentry *proc_pid_lookup(struct inode *dir, struct dentry * dentry, struct nameidata *nd)
|
|
|
|
{
|
2006-06-26 03:25:49 -04:00
|
|
|
struct dentry *result = ERR_PTR(-ENOENT);
|
2005-04-16 18:20:36 -04:00
|
|
|
struct task_struct *task;
|
|
|
|
unsigned tgid;
|
|
|
|
|
2006-10-02 05:18:48 -04:00
|
|
|
result = proc_base_lookup(dir, dentry);
|
|
|
|
if (!IS_ERR(result) || PTR_ERR(result) != -ENOENT)
|
|
|
|
goto out;
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
tgid = name_to_int(dentry);
|
|
|
|
if (tgid == ~0U)
|
|
|
|
goto out;
|
|
|
|
|
2006-06-26 03:25:51 -04:00
|
|
|
rcu_read_lock();
|
2005-04-16 18:20:36 -04:00
|
|
|
task = find_task_by_pid(tgid);
|
|
|
|
if (task)
|
|
|
|
get_task_struct(task);
|
2006-06-26 03:25:51 -04:00
|
|
|
rcu_read_unlock();
|
2005-04-16 18:20:36 -04:00
|
|
|
if (!task)
|
|
|
|
goto out;
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
result = proc_pid_instantiate(dir, dentry, task, NULL);
|
2005-04-16 18:20:36 -04:00
|
|
|
put_task_struct(task);
|
|
|
|
out:
|
2006-06-26 03:25:49 -04:00
|
|
|
return result;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
* Find the first task with tgid >= tgid
|
2006-06-26 03:25:50 -04:00
|
|
|
*
|
2005-04-16 18:20:36 -04:00
|
|
|
*/
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
static struct task_struct *next_tgid(unsigned int tgid)
|
2005-04-16 18:20:36 -04:00
|
|
|
{
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
struct task_struct *task;
|
|
|
|
struct pid *pid;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:51 -04:00
|
|
|
rcu_read_lock();
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
retry:
|
|
|
|
task = NULL;
|
|
|
|
pid = find_ge_pid(tgid);
|
|
|
|
if (pid) {
|
|
|
|
tgid = pid->nr + 1;
|
|
|
|
task = pid_task(pid, PIDTYPE_PID);
|
|
|
|
/* 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.
|
|
|
|
*/
|
|
|
|
if (!task || !has_group_leader_pid(task))
|
|
|
|
goto retry;
|
|
|
|
get_task_struct(task);
|
2006-06-26 03:25:50 -04:00
|
|
|
}
|
2006-06-26 03:25:51 -04:00
|
|
|
rcu_read_unlock();
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
return task;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:56 -04:00
|
|
|
#define TGID_OFFSET (FIRST_PROCESS_ENTRY + ARRAY_SIZE(proc_base_stuff))
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static int proc_pid_fill_cache(struct file *filp, void *dirent, filldir_t filldir,
|
|
|
|
struct task_struct *task, int tgid)
|
|
|
|
{
|
|
|
|
char name[PROC_NUMBUF];
|
|
|
|
int len = snprintf(name, sizeof(name), "%d", tgid);
|
|
|
|
return proc_fill_cache(filp, dirent, filldir, name, len,
|
|
|
|
proc_pid_instantiate, task, NULL);
|
|
|
|
}
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
/* for the /proc/ directory itself, after non-process stuff has been done */
|
|
|
|
int proc_pid_readdir(struct file * filp, void * dirent, filldir_t filldir)
|
|
|
|
{
|
|
|
|
unsigned int nr = filp->f_pos - FIRST_PROCESS_ENTRY;
|
2006-10-02 05:18:49 -04:00
|
|
|
struct task_struct *reaper = get_proc_task(filp->f_dentry->d_inode);
|
2006-06-26 03:25:50 -04:00
|
|
|
struct task_struct *task;
|
|
|
|
int tgid;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
if (!reaper)
|
|
|
|
goto out_no_task;
|
|
|
|
|
2006-10-02 05:18:56 -04:00
|
|
|
for (; nr < ARRAY_SIZE(proc_base_stuff); filp->f_pos++, nr++) {
|
2006-10-02 05:18:48 -04:00
|
|
|
struct pid_entry *p = &proc_base_stuff[nr];
|
2006-10-02 05:18:49 -04:00
|
|
|
if (proc_base_fill_cache(filp, dirent, filldir, reaper, p) < 0)
|
2006-10-02 05:18:48 -04:00
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
tgid = filp->f_pos - TGID_OFFSET;
|
|
|
|
for (task = next_tgid(tgid);
|
2006-06-26 03:25:50 -04:00
|
|
|
task;
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
put_task_struct(task), task = next_tgid(tgid + 1)) {
|
2006-06-26 03:25:50 -04:00
|
|
|
tgid = task->pid;
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
filp->f_pos = tgid + TGID_OFFSET;
|
2006-10-02 05:18:49 -04:00
|
|
|
if (proc_pid_fill_cache(filp, dirent, filldir, task, tgid) < 0) {
|
2006-06-26 03:25:50 -04:00
|
|
|
put_task_struct(task);
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
2006-06-26 03:25:50 -04:00
|
|
|
}
|
[PATCH] proc: readdir race fix (take 3)
The problem: An opendir, readdir, closedir sequence can fail to report
process ids that are continually in use throughout the sequence of system
calls. For this race to trigger the process that proc_pid_readdir stops at
must exit before readdir is called again.
This can cause ps to fail to report processes, and it is in violation of
posix guarantees and normal application expectations with respect to
readdir.
Currently there is no way to work around this problem in user space short
of providing a gargantuan buffer to user space so the directory read all
happens in on system call.
This patch implements the normal directory semantics for proc, that
guarantee that a directory entry that is neither created nor destroyed
while reading the directory entry will be returned. For directory that are
either created or destroyed during the readdir you may or may not see them.
Furthermore you may seek to a directory offset you have previously seen.
These are the guarantee that ext[23] provides and that posix requires, and
more importantly that user space expects. Plus it is a simple semantic to
implement reliable service. It is just a matter of calling readdir a
second time if you are wondering if something new has show up.
These better semantics are implemented by scanning through the pids in
numerical order and by making the file offset a pid plus a fixed offset.
The pid scan happens on the pid bitmap, which when you look at it is
remarkably efficient for a brute force algorithm. Given that a typical
cache line is 64 bytes and thus covers space for 64*8 == 200 pids. There
are only 40 cache lines for the entire 32K pid space. A typical system
will have 100 pids or more so this is actually fewer cache lines we have to
look at to scan a linked list, and the worst case of having to scan the
entire pid bitmap is pretty reasonable.
If we need something more efficient we can go to a more efficient data
structure for indexing the pids, but for now what we have should be
sufficient.
In addition this takes no additional locks and is actually less code than
what we are doing now.
Also another very subtle bug in this area has been fixed. It is possible
to catch a task in the middle of de_thread where a thread is assuming the
thread of it's thread group leader. This patch carefully handles that case
so if we hit it we don't fail to return the pid, that is undergoing the
de_thread dance.
Thanks to KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com> for
providing the first fix, pointing this out and working on it.
[oleg@tv-sign.ru: fix it]
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Acked-by: KAMEZAWA Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru>
Cc: Jean Delvare <jdelvare@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-10-02 05:17:04 -04:00
|
|
|
filp->f_pos = PID_MAX_LIMIT + TGID_OFFSET;
|
|
|
|
out:
|
2006-10-02 05:18:49 -04:00
|
|
|
put_task_struct(reaper);
|
|
|
|
out_no_task:
|
2006-06-26 03:25:50 -04:00
|
|
|
return 0;
|
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
/*
|
|
|
|
* Tasks
|
|
|
|
*/
|
|
|
|
static struct pid_entry tid_base_stuff[] = {
|
2006-10-02 05:18:49 -04:00
|
|
|
DIR("fd", S_IRUSR|S_IXUSR, fd),
|
|
|
|
INF("environ", S_IRUSR, pid_environ),
|
|
|
|
INF("auxv", S_IRUSR, pid_auxv),
|
|
|
|
INF("status", S_IRUGO, pid_status),
|
|
|
|
INF("cmdline", S_IRUGO, pid_cmdline),
|
|
|
|
INF("stat", S_IRUGO, tid_stat),
|
|
|
|
INF("statm", S_IRUGO, pid_statm),
|
|
|
|
REG("maps", S_IRUGO, maps),
|
2006-10-02 05:17:05 -04:00
|
|
|
#ifdef CONFIG_NUMA
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("numa_maps", S_IRUGO, numa_maps),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("mem", S_IRUSR|S_IWUSR, mem),
|
2006-10-02 05:17:05 -04:00
|
|
|
#ifdef CONFIG_SECCOMP
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("seccomp", S_IRUSR|S_IWUSR, seccomp),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
2006-10-02 05:18:49 -04:00
|
|
|
LNK("cwd", cwd),
|
|
|
|
LNK("root", root),
|
|
|
|
LNK("exe", exe),
|
|
|
|
REG("mounts", S_IRUGO, mounts),
|
2006-10-02 05:17:05 -04:00
|
|
|
#ifdef CONFIG_MMU
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("smaps", S_IRUGO, smaps),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_SECURITY
|
2006-10-02 05:18:50 -04:00
|
|
|
DIR("attr", S_IRUGO|S_IXUGO, attr_dir),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_KALLSYMS
|
2006-10-02 05:18:49 -04:00
|
|
|
INF("wchan", S_IRUGO, pid_wchan),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_SCHEDSTATS
|
2006-10-02 05:18:49 -04:00
|
|
|
INF("schedstat", S_IRUGO, pid_schedstat),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
#ifdef CONFIG_CPUSETS
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("cpuset", S_IRUGO, cpuset),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
2006-10-02 05:18:49 -04:00
|
|
|
INF("oom_score", S_IRUGO, oom_score),
|
|
|
|
REG("oom_adj", S_IRUGO|S_IWUSR, oom_adjust),
|
2006-10-02 05:17:05 -04:00
|
|
|
#ifdef CONFIG_AUDITSYSCALL
|
2006-10-02 05:18:49 -04:00
|
|
|
REG("loginuid", S_IWUSR|S_IRUGO, loginuid),
|
2006-10-02 05:17:05 -04:00
|
|
|
#endif
|
|
|
|
};
|
|
|
|
|
|
|
|
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){
|
2006-10-02 05:18:56 -04:00
|
|
|
return proc_pident_lookup(dir, dentry,
|
|
|
|
tid_base_stuff, ARRAY_SIZE(tid_base_stuff));
|
2006-10-02 05:17:05 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct file_operations proc_tid_base_operations = {
|
|
|
|
.read = generic_read_dir,
|
|
|
|
.readdir = proc_tid_base_readdir,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct inode_operations proc_tid_base_inode_operations = {
|
|
|
|
.lookup = proc_tid_base_lookup,
|
|
|
|
.getattr = pid_getattr,
|
|
|
|
.setattr = proc_setattr,
|
|
|
|
};
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
static struct dentry *proc_task_instantiate(struct inode *dir,
|
|
|
|
struct dentry *dentry, struct task_struct *task, void *ptr)
|
|
|
|
{
|
|
|
|
struct dentry *error = ERR_PTR(-ENOENT);
|
|
|
|
struct inode *inode;
|
2006-10-02 05:18:49 -04:00
|
|
|
inode = proc_pid_make_inode(dir->i_sb, task);
|
2006-10-02 05:18:49 -04:00
|
|
|
|
|
|
|
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;
|
|
|
|
inode->i_nlink = 3;
|
|
|
|
#ifdef CONFIG_SECURITY
|
|
|
|
inode->i_nlink += 1;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
dentry->d_op = &pid_dentry_operations;
|
|
|
|
|
|
|
|
d_add(dentry, inode);
|
|
|
|
/* Close the race of the process dying before we return the dentry */
|
|
|
|
if (pid_revalidate(dentry, NULL))
|
|
|
|
error = NULL;
|
|
|
|
out:
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2006-10-02 05:17:05 -04:00
|
|
|
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;
|
|
|
|
|
|
|
|
if (!leader)
|
|
|
|
goto out_no_task;
|
|
|
|
|
|
|
|
tid = name_to_int(dentry);
|
|
|
|
if (tid == ~0U)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
task = find_task_by_pid(tid);
|
|
|
|
if (task)
|
|
|
|
get_task_struct(task);
|
|
|
|
rcu_read_unlock();
|
|
|
|
if (!task)
|
|
|
|
goto out;
|
|
|
|
if (leader->tgid != task->tgid)
|
|
|
|
goto out_drop_task;
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
result = proc_task_instantiate(dir, dentry, task, NULL);
|
2006-10-02 05:17:05 -04:00
|
|
|
out_drop_task:
|
|
|
|
put_task_struct(task);
|
|
|
|
out:
|
|
|
|
put_task_struct(leader);
|
|
|
|
out_no_task:
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2006-06-26 03:25:50 -04:00
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
2006-06-26 03:26:01 -04:00
|
|
|
static struct task_struct *first_tid(struct task_struct *leader,
|
|
|
|
int tid, int nr)
|
2006-06-26 03:25:50 -04:00
|
|
|
{
|
2006-06-26 03:26:01 -04:00
|
|
|
struct task_struct *pos;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:26:01 -04:00
|
|
|
rcu_read_lock();
|
2006-06-26 03:25:50 -04:00
|
|
|
/* Attempt to start with the pid of a thread */
|
|
|
|
if (tid && (nr > 0)) {
|
|
|
|
pos = find_task_by_pid(tid);
|
2006-06-26 03:26:01 -04:00
|
|
|
if (pos && (pos->group_leader == leader))
|
|
|
|
goto found;
|
2006-06-26 03:25:50 -04:00
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:25:50 -04:00
|
|
|
/* If nr exceeds the number of threads there is nothing todo */
|
2006-06-26 03:26:01 -04:00
|
|
|
pos = NULL;
|
|
|
|
if (nr && nr >= get_nr_threads(leader))
|
|
|
|
goto out;
|
2005-04-16 18:20:36 -04:00
|
|
|
|
2006-06-26 03:26:01 -04:00
|
|
|
/* If we haven't found our starting place yet start
|
|
|
|
* with the leader and walk nr threads forward.
|
2006-06-26 03:25:50 -04:00
|
|
|
*/
|
2006-06-26 03:26:01 -04:00
|
|
|
for (pos = leader; nr > 0; --nr) {
|
|
|
|
pos = next_thread(pos);
|
|
|
|
if (pos == leader) {
|
|
|
|
pos = NULL;
|
|
|
|
goto out;
|
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
2006-06-26 03:26:01 -04:00
|
|
|
found:
|
|
|
|
get_task_struct(pos);
|
|
|
|
out:
|
2006-06-26 03:26:01 -04:00
|
|
|
rcu_read_unlock();
|
2006-06-26 03:25:50 -04:00
|
|
|
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)
|
|
|
|
{
|
2006-06-26 03:26:02 -04:00
|
|
|
struct task_struct *pos = NULL;
|
2006-06-26 03:26:01 -04:00
|
|
|
rcu_read_lock();
|
2006-06-26 03:26:02 -04:00
|
|
|
if (pid_alive(start)) {
|
2006-06-26 03:25:50 -04:00
|
|
|
pos = next_thread(start);
|
2006-06-26 03:26:02 -04:00
|
|
|
if (thread_group_leader(pos))
|
|
|
|
pos = NULL;
|
|
|
|
else
|
|
|
|
get_task_struct(pos);
|
|
|
|
}
|
2006-06-26 03:26:01 -04:00
|
|
|
rcu_read_unlock();
|
2006-06-26 03:25:50 -04:00
|
|
|
put_task_struct(start);
|
|
|
|
return pos;
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
|
2006-10-02 05:18:49 -04:00
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
2005-04-16 18:20:36 -04:00
|
|
|
/* for the /proc/TGID/task/ directories */
|
|
|
|
static int proc_task_readdir(struct file * filp, void * dirent, filldir_t filldir)
|
|
|
|
{
|
|
|
|
struct dentry *dentry = filp->f_dentry;
|
|
|
|
struct inode *inode = dentry->d_inode;
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *leader = get_proc_task(inode);
|
2006-06-26 03:25:50 -04:00
|
|
|
struct task_struct *task;
|
2005-04-16 18:20:36 -04:00
|
|
|
int retval = -ENOENT;
|
|
|
|
ino_t ino;
|
2006-06-26 03:25:50 -04:00
|
|
|
int tid;
|
2005-04-16 18:20:36 -04:00
|
|
|
unsigned long pos = filp->f_pos; /* avoiding "long long" filp->f_pos */
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
if (!leader)
|
|
|
|
goto out_no_task;
|
2005-04-16 18:20:36 -04:00
|
|
|
retval = 0;
|
|
|
|
|
|
|
|
switch (pos) {
|
|
|
|
case 0:
|
|
|
|
ino = inode->i_ino;
|
|
|
|
if (filldir(dirent, ".", 1, pos, ino, DT_DIR) < 0)
|
|
|
|
goto out;
|
|
|
|
pos++;
|
|
|
|
/* fall through */
|
|
|
|
case 1:
|
|
|
|
ino = parent_ino(dentry);
|
|
|
|
if (filldir(dirent, "..", 2, pos, ino, DT_DIR) < 0)
|
|
|
|
goto out;
|
|
|
|
pos++;
|
|
|
|
/* fall through */
|
|
|
|
}
|
|
|
|
|
2006-06-26 03:25:50 -04:00
|
|
|
/* f_version caches the tgid value that the last readdir call couldn't
|
|
|
|
* return. lseek aka telldir automagically resets f_version to 0.
|
|
|
|
*/
|
|
|
|
tid = filp->f_version;
|
|
|
|
filp->f_version = 0;
|
|
|
|
for (task = first_tid(leader, tid, pos - 2);
|
|
|
|
task;
|
|
|
|
task = next_tid(task), pos++) {
|
|
|
|
tid = task->pid;
|
2006-10-02 05:18:49 -04:00
|
|
|
if (proc_task_fill_cache(filp, dirent, filldir, task, tid) < 0) {
|
2006-06-26 03:25:50 -04:00
|
|
|
/* returning this tgid failed, save it as the first
|
|
|
|
* pid for the next readir call */
|
|
|
|
filp->f_version = tid;
|
|
|
|
put_task_struct(task);
|
2005-04-16 18:20:36 -04:00
|
|
|
break;
|
2006-06-26 03:25:50 -04:00
|
|
|
}
|
2005-04-16 18:20:36 -04:00
|
|
|
}
|
|
|
|
out:
|
|
|
|
filp->f_pos = pos;
|
2006-06-26 03:25:55 -04:00
|
|
|
put_task_struct(leader);
|
|
|
|
out_no_task:
|
2005-04-16 18:20:36 -04:00
|
|
|
return retval;
|
|
|
|
}
|
2006-06-26 03:25:47 -04:00
|
|
|
|
|
|
|
static int proc_task_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat)
|
|
|
|
{
|
|
|
|
struct inode *inode = dentry->d_inode;
|
2006-06-26 03:25:55 -04:00
|
|
|
struct task_struct *p = get_proc_task(inode);
|
2006-06-26 03:25:47 -04:00
|
|
|
generic_fillattr(inode, stat);
|
|
|
|
|
2006-06-26 03:25:55 -04:00
|
|
|
if (p) {
|
|
|
|
rcu_read_lock();
|
|
|
|
stat->nlink += get_nr_threads(p);
|
|
|
|
rcu_read_unlock();
|
|
|
|
put_task_struct(p);
|
2006-06-26 03:25:47 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2006-10-02 05:17:05 -04:00
|
|
|
|
|
|
|
static struct inode_operations proc_task_inode_operations = {
|
|
|
|
.lookup = proc_task_lookup,
|
|
|
|
.getattr = proc_task_getattr,
|
|
|
|
.setattr = proc_setattr,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct file_operations proc_task_operations = {
|
|
|
|
.read = generic_read_dir,
|
|
|
|
.readdir = proc_task_readdir,
|
|
|
|
};
|