2005-04-16 16:20:36 -06:00
|
|
|
#ifndef _LINUX_PID_H
|
|
|
|
|
#define _LINUX_PID_H
|
|
|
|
|
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
#include <linux/rcupdate.h>
|
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
enum pid_type
|
|
|
|
|
{
|
|
|
|
|
PIDTYPE_PID,
|
|
|
|
|
PIDTYPE_PGID,
|
|
|
|
|
PIDTYPE_SID,
|
|
|
|
|
PIDTYPE_MAX
|
|
|
|
|
};
|
|
|
|
|
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
/*
|
|
|
|
|
* What is struct pid?
|
|
|
|
|
*
|
|
|
|
|
* A struct pid is the kernel's internal notion of a process identifier.
|
|
|
|
|
* It refers to individual tasks, process groups, and sessions. While
|
|
|
|
|
* there are processes attached to it the struct pid lives in a hash
|
|
|
|
|
* table, so it and then the processes that it refers to can be found
|
|
|
|
|
* quickly from the numeric pid value. The attached processes may be
|
|
|
|
|
* quickly accessed by following pointers from struct pid.
|
|
|
|
|
*
|
2011-03-30 19:57:33 -06:00
|
|
|
* Storing pid_t values in the kernel and referring to them later has a
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
* problem. The process originally with that pid may have exited and the
|
|
|
|
|
* pid allocator wrapped, and another process could have come along
|
|
|
|
|
* and been assigned that pid.
|
|
|
|
|
*
|
|
|
|
|
* Referring to user space processes by holding a reference to struct
|
|
|
|
|
* task_struct has a problem. When the user space process exits
|
|
|
|
|
* the now useless task_struct is still kept. A task_struct plus a
|
|
|
|
|
* stack consumes around 10K of low kernel memory. More precisely
|
|
|
|
|
* this is THREAD_SIZE + sizeof(struct task_struct). By comparison
|
|
|
|
|
* a struct pid is about 64 bytes.
|
|
|
|
|
*
|
|
|
|
|
* Holding a reference to struct pid solves both of these problems.
|
|
|
|
|
* It is small so holding a reference does not consume a lot of
|
2006-12-08 03:38:01 -07:00
|
|
|
* resources, and since a new struct pid is allocated when the numeric pid
|
|
|
|
|
* value is reused (when pids wrap around) we don't mistakenly refer to new
|
|
|
|
|
* processes.
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
*/
|
|
|
|
|
|
2007-10-19 00:40:03 -06:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* struct upid is used to get the id of the struct pid, as it is
|
|
|
|
|
* seen in particular namespace. Later the struct pid is found with
|
|
|
|
|
* find_pid_ns() using the int nr and struct pid_namespace *ns.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
struct upid {
|
2008-07-25 02:48:36 -06:00
|
|
|
/* Try to keep pid_chain in the same cacheline as nr for find_vpid */
|
2007-10-19 00:40:03 -06:00
|
|
|
int nr;
|
|
|
|
|
struct pid_namespace *ns;
|
|
|
|
|
struct hlist_node pid_chain;
|
|
|
|
|
};
|
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
struct pid
|
|
|
|
|
{
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
atomic_t count;
|
2008-07-25 02:48:35 -06:00
|
|
|
unsigned int level;
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
/* lists of tasks that use this pid */
|
|
|
|
|
struct hlist_head tasks[PIDTYPE_MAX];
|
|
|
|
|
struct rcu_head rcu;
|
2007-10-19 00:40:03 -06:00
|
|
|
struct upid numbers[1];
|
2005-04-16 16:20:36 -06:00
|
|
|
};
|
|
|
|
|
|
2007-05-10 23:23:00 -06:00
|
|
|
extern struct pid init_struct_pid;
|
|
|
|
|
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
struct pid_link
|
|
|
|
|
{
|
|
|
|
|
struct hlist_node node;
|
|
|
|
|
struct pid *pid;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static inline struct pid *get_pid(struct pid *pid)
|
|
|
|
|
{
|
|
|
|
|
if (pid)
|
|
|
|
|
atomic_inc(&pid->count);
|
|
|
|
|
return pid;
|
|
|
|
|
}
|
|
|
|
|
|
2008-02-13 16:03:15 -07:00
|
|
|
extern void put_pid(struct pid *pid);
|
|
|
|
|
extern struct task_struct *pid_task(struct pid *pid, enum pid_type);
|
|
|
|
|
extern struct task_struct *get_pid_task(struct pid *pid, enum pid_type);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2006-10-02 03:18:59 -06:00
|
|
|
extern struct pid *get_task_pid(struct task_struct *task, enum pid_type type);
|
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
2013-07-03 16:08:31 -06:00
|
|
|
* these helpers must be called with the tasklist_lock write-held.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
2013-07-03 16:08:31 -06:00
|
|
|
extern void attach_pid(struct task_struct *task, enum pid_type);
|
2008-02-13 16:03:15 -07:00
|
|
|
extern void detach_pid(struct task_struct *task, enum pid_type);
|
2008-04-30 01:54:26 -06:00
|
|
|
extern void change_pid(struct task_struct *task, enum pid_type,
|
|
|
|
|
struct pid *pid);
|
2008-02-13 16:03:15 -07:00
|
|
|
extern void transfer_pid(struct task_struct *old, struct task_struct *new,
|
|
|
|
|
enum pid_type);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-10-19 00:40:06 -06:00
|
|
|
struct pid_namespace;
|
|
|
|
|
extern struct pid_namespace init_pid_ns;
|
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
|
* look up a PID in the hash table. Must be called with the tasklist_lock
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
* or rcu_read_lock() held.
|
2007-10-19 00:40:06 -06:00
|
|
|
*
|
|
|
|
|
* find_pid_ns() finds the pid in the namespace specified
|
2011-05-26 17:25:57 -06:00
|
|
|
* find_vpid() finds the pid by its virtual id, i.e. in the current namespace
|
2007-10-19 00:40:06 -06:00
|
|
|
*
|
2008-07-25 02:48:37 -06:00
|
|
|
* see also find_task_by_vpid() set in include/linux/sched.h
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
*/
|
2008-02-13 16:03:15 -07:00
|
|
|
extern struct pid *find_pid_ns(int nr, struct pid_namespace *ns);
|
2007-10-19 00:40:19 -06:00
|
|
|
extern struct pid *find_vpid(int nr);
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Lookup a PID in the hash table, and return with it's count elevated.
|
2005-04-16 16:20:36 -06:00
|
|
|
*/
|
[PATCH] pidhash: Refactor the pid hash table
Simplifies the code, reduces the need for 4 pid hash tables, and makes the
code more capable.
In the discussions I had with Oleg it was felt that to a large extent the
cleanup itself justified the work. With struct pid being dynamically
allocated meant we could create the hash table entry when the pid was
allocated and free the hash table entry when the pid was freed. Instead of
playing with the hash lists when ever a process would attach or detach to a
process.
For myself the fact that it gave what my previous task_ref patch gave for free
with simpler code was a big win. The problem is that if you hold a reference
to struct task_struct you lock in 10K of low memory. If you do that in a user
controllable way like /proc does, with an unprivileged but hostile user space
application with typical resource limits of 1000 fds and 100 processes I can
trigger the OOM killer by consuming all of low memory with task structs, on a
machine wight 1GB of low memory.
If I instead hold a reference to struct pid which holds a pointer to my
task_struct, I don't suffer from that problem because struct pid is 2 orders
of magnitude smaller. In fact struct pid is small enough that most other
kernel data structures dwarf it, so simply limiting the number of referring
data structures is enough to prevent exhaustion of low memory.
This splits the current struct pid into two structures, struct pid and struct
pid_link, and reduces our number of hash tables from PIDTYPE_MAX to just one.
struct pid_link is the per process linkage into the hash tables and lives in
struct task_struct. struct pid is given an indepedent lifetime, and holds
pointers to each of the pid types.
The independent life of struct pid simplifies attach_pid, and detach_pid,
because we are always manipulating the list of pids and not the hash table.
In addition in giving struct pid an indpendent life it makes the concept much
more powerful.
Kernel data structures can now embed a struct pid * instead of a pid_t and
not suffer from pid wrap around problems or from keeping unnecessarily
large amounts of memory allocated.
Signed-off-by: Eric W. Biederman <ebiederm@xmission.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-03-31 03:31:42 -07:00
|
|
|
extern struct pid *find_get_pid(int nr);
|
2007-10-19 00:40:06 -06:00
|
|
|
extern struct pid *find_ge_pid(int nr, struct pid_namespace *);
|
2011-04-18 11:35:30 -06:00
|
|
|
int next_pidmap(struct pid_namespace *pid_ns, unsigned int last);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-10-19 00:40:05 -06:00
|
|
|
extern struct pid *alloc_pid(struct pid_namespace *ns);
|
2008-02-13 16:03:15 -07:00
|
|
|
extern void free_pid(struct pid *pid);
|
2012-12-21 21:27:12 -07:00
|
|
|
extern void disable_pid_allocation(struct pid_namespace *ns);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2009-01-07 19:08:46 -07:00
|
|
|
/*
|
|
|
|
|
* ns_of_pid() returns the pid namespace in which the specified pid was
|
|
|
|
|
* allocated.
|
|
|
|
|
*
|
|
|
|
|
* NOTE:
|
|
|
|
|
* ns_of_pid() is expected to be called for a process (task) that has
|
|
|
|
|
* an attached 'struct pid' (see attach_pid(), detach_pid()) i.e @pid
|
|
|
|
|
* is expected to be non-NULL. If @pid is NULL, caller should handle
|
|
|
|
|
* the resulting NULL pid-ns.
|
|
|
|
|
*/
|
|
|
|
|
static inline struct pid_namespace *ns_of_pid(struct pid *pid)
|
|
|
|
|
{
|
|
|
|
|
struct pid_namespace *ns = NULL;
|
|
|
|
|
if (pid)
|
|
|
|
|
ns = pid->numbers[pid->level].ns;
|
|
|
|
|
return ns;
|
|
|
|
|
}
|
|
|
|
|
|
2011-03-23 17:43:12 -06:00
|
|
|
/*
|
|
|
|
|
* is_child_reaper returns true if the pid is the init process
|
|
|
|
|
* of the current namespace. As this one could be checked before
|
|
|
|
|
* pid_ns->child_reaper is assigned in copy_process, we check
|
|
|
|
|
* with the pid number.
|
|
|
|
|
*/
|
|
|
|
|
static inline bool is_child_reaper(struct pid *pid)
|
|
|
|
|
{
|
|
|
|
|
return pid->numbers[pid->level].nr == 1;
|
|
|
|
|
}
|
|
|
|
|
|
2007-10-19 00:40:06 -06:00
|
|
|
/*
|
|
|
|
|
* the helpers to get the pid's id seen from different namespaces
|
|
|
|
|
*
|
|
|
|
|
* pid_nr() : global id, i.e. the id seen from the init namespace;
|
2008-02-08 05:19:15 -07:00
|
|
|
* pid_vnr() : virtual id, i.e. the id seen from the pid namespace of
|
|
|
|
|
* current.
|
2007-10-19 00:40:06 -06:00
|
|
|
* pid_nr_ns() : id seen from the ns specified.
|
|
|
|
|
*
|
|
|
|
|
* see also task_xid_nr() etc in include/linux/sched.h
|
|
|
|
|
*/
|
|
|
|
|
|
2006-10-02 03:17:12 -06:00
|
|
|
static inline pid_t pid_nr(struct pid *pid)
|
|
|
|
|
{
|
|
|
|
|
pid_t nr = 0;
|
|
|
|
|
if (pid)
|
2007-10-19 00:40:06 -06:00
|
|
|
nr = pid->numbers[0].nr;
|
|
|
|
|
return nr;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pid_t pid_nr_ns(struct pid *pid, struct pid_namespace *ns);
|
2008-02-08 05:19:15 -07:00
|
|
|
pid_t pid_vnr(struct pid *pid);
|
2006-10-02 03:17:12 -06:00
|
|
|
|
2006-10-03 02:13:45 -06:00
|
|
|
#define do_each_pid_task(pid, type, task) \
|
|
|
|
|
do { \
|
2008-12-03 22:26:39 -07:00
|
|
|
if ((pid) != NULL) \
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-27 18:06:00 -07:00
|
|
|
hlist_for_each_entry_rcu((task), \
|
2008-12-03 22:26:39 -07:00
|
|
|
&(pid)->tasks[type], pids[type].node) {
|
2006-10-02 03:17:22 -06:00
|
|
|
|
2008-02-08 05:19:19 -07:00
|
|
|
/*
|
|
|
|
|
* Both old and new leaders may be attached to
|
|
|
|
|
* the same pid in the middle of de_thread().
|
|
|
|
|
*/
|
2006-10-03 02:13:45 -06:00
|
|
|
#define while_each_pid_task(pid, type, task) \
|
2008-02-08 05:19:19 -07:00
|
|
|
if (type == PIDTYPE_PID) \
|
|
|
|
|
break; \
|
2006-10-03 02:13:45 -06:00
|
|
|
} \
|
2006-10-02 03:17:22 -06:00
|
|
|
} while (0)
|
2006-10-02 03:17:09 -06:00
|
|
|
|
2008-08-20 15:09:17 -06:00
|
|
|
#define do_each_pid_thread(pid, type, task) \
|
|
|
|
|
do_each_pid_task(pid, type, task) { \
|
|
|
|
|
struct task_struct *tg___ = task; \
|
|
|
|
|
do {
|
|
|
|
|
|
|
|
|
|
#define while_each_pid_thread(pid, type, task) \
|
|
|
|
|
} while_each_thread(tg___, task); \
|
|
|
|
|
task = tg___; \
|
|
|
|
|
} while_each_pid_task(pid, type, task)
|
2005-04-16 16:20:36 -06:00
|
|
|
#endif /* _LINUX_PID_H */
|