Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | #ifndef _LINUX_PID_H |
| 2 | #define _LINUX_PID_H |
| 3 | |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 4 | #include <linux/rcupdate.h> |
| 5 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 6 | enum pid_type |
| 7 | { |
| 8 | PIDTYPE_PID, |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 9 | PIDTYPE_PGID, |
| 10 | PIDTYPE_SID, |
| 11 | PIDTYPE_MAX |
| 12 | }; |
| 13 | |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 14 | /* |
| 15 | * What is struct pid? |
| 16 | * |
| 17 | * A struct pid is the kernel's internal notion of a process identifier. |
| 18 | * It refers to individual tasks, process groups, and sessions. While |
| 19 | * there are processes attached to it the struct pid lives in a hash |
| 20 | * table, so it and then the processes that it refers to can be found |
| 21 | * quickly from the numeric pid value. The attached processes may be |
| 22 | * quickly accessed by following pointers from struct pid. |
| 23 | * |
| 24 | * Storing pid_t values in the kernel and refering to them later has a |
| 25 | * problem. The process originally with that pid may have exited and the |
| 26 | * pid allocator wrapped, and another process could have come along |
| 27 | * and been assigned that pid. |
| 28 | * |
| 29 | * Referring to user space processes by holding a reference to struct |
| 30 | * task_struct has a problem. When the user space process exits |
| 31 | * the now useless task_struct is still kept. A task_struct plus a |
| 32 | * stack consumes around 10K of low kernel memory. More precisely |
| 33 | * this is THREAD_SIZE + sizeof(struct task_struct). By comparison |
| 34 | * a struct pid is about 64 bytes. |
| 35 | * |
| 36 | * Holding a reference to struct pid solves both of these problems. |
| 37 | * It is small so holding a reference does not consume a lot of |
Sukadev Bhattiprolu | 84d7378 | 2006-12-08 02:38:01 -0800 | [diff] [blame] | 38 | * resources, and since a new struct pid is allocated when the numeric pid |
| 39 | * value is reused (when pids wrap around) we don't mistakenly refer to new |
| 40 | * processes. |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 41 | */ |
| 42 | |
Sukadev Bhattiprolu | 4c3f2ea | 2007-10-18 23:40:03 -0700 | [diff] [blame] | 43 | |
| 44 | /* |
| 45 | * struct upid is used to get the id of the struct pid, as it is |
| 46 | * seen in particular namespace. Later the struct pid is found with |
| 47 | * find_pid_ns() using the int nr and struct pid_namespace *ns. |
| 48 | */ |
| 49 | |
| 50 | struct upid { |
| 51 | /* Try to keep pid_chain in the same cacheline as nr for find_pid */ |
| 52 | int nr; |
| 53 | struct pid_namespace *ns; |
| 54 | struct hlist_node pid_chain; |
| 55 | }; |
| 56 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 57 | struct pid |
| 58 | { |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 59 | atomic_t count; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 60 | /* Try to keep pid_chain in the same cacheline as nr for find_pid */ |
| 61 | int nr; |
| 62 | struct hlist_node pid_chain; |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 63 | /* lists of tasks that use this pid */ |
| 64 | struct hlist_head tasks[PIDTYPE_MAX]; |
| 65 | struct rcu_head rcu; |
Sukadev Bhattiprolu | 4c3f2ea | 2007-10-18 23:40:03 -0700 | [diff] [blame] | 66 | int level; |
| 67 | struct upid numbers[1]; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 68 | }; |
| 69 | |
Sukadev Bhattiprolu | 820e45d | 2007-05-10 22:23:00 -0700 | [diff] [blame] | 70 | extern struct pid init_struct_pid; |
| 71 | |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 72 | struct pid_link |
| 73 | { |
| 74 | struct hlist_node node; |
| 75 | struct pid *pid; |
| 76 | }; |
| 77 | |
| 78 | static inline struct pid *get_pid(struct pid *pid) |
| 79 | { |
| 80 | if (pid) |
| 81 | atomic_inc(&pid->count); |
| 82 | return pid; |
| 83 | } |
| 84 | |
| 85 | extern void FASTCALL(put_pid(struct pid *pid)); |
| 86 | extern struct task_struct *FASTCALL(pid_task(struct pid *pid, enum pid_type)); |
| 87 | extern struct task_struct *FASTCALL(get_pid_task(struct pid *pid, |
| 88 | enum pid_type)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 89 | |
Oleg Nesterov | 1a657f78 | 2006-10-02 02:18:59 -0700 | [diff] [blame] | 90 | extern struct pid *get_task_pid(struct task_struct *task, enum pid_type type); |
| 91 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 92 | /* |
| 93 | * attach_pid() and detach_pid() must be called with the tasklist_lock |
| 94 | * write-held. |
| 95 | */ |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 96 | extern int FASTCALL(attach_pid(struct task_struct *task, |
Sukadev Bhattiprolu | e713d0d | 2007-05-10 22:22:58 -0700 | [diff] [blame] | 97 | enum pid_type type, struct pid *pid)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 98 | extern void FASTCALL(detach_pid(struct task_struct *task, enum pid_type)); |
Eric W. Biederman | c18258c | 2006-09-27 01:51:06 -0700 | [diff] [blame] | 99 | extern void FASTCALL(transfer_pid(struct task_struct *old, |
| 100 | struct task_struct *new, enum pid_type)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 101 | |
Pavel Emelyanov | 198fe21 | 2007-10-18 23:40:06 -0700 | [diff] [blame] | 102 | struct pid_namespace; |
| 103 | extern struct pid_namespace init_pid_ns; |
| 104 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 105 | /* |
| 106 | * look up a PID in the hash table. Must be called with the tasklist_lock |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 107 | * or rcu_read_lock() held. |
Pavel Emelyanov | 198fe21 | 2007-10-18 23:40:06 -0700 | [diff] [blame] | 108 | * |
| 109 | * find_pid_ns() finds the pid in the namespace specified |
| 110 | * find_pid() find the pid by its global id, i.e. in the init namespace |
| 111 | * find_vpid() finr the pid by its virtual id, i.e. in the current namespace |
| 112 | * |
| 113 | * see also find_task_by_pid() set in include/linux/sched.h |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 114 | */ |
Pavel Emelyanov | 198fe21 | 2007-10-18 23:40:06 -0700 | [diff] [blame] | 115 | extern struct pid *FASTCALL(find_pid_ns(int nr, struct pid_namespace *ns)); |
| 116 | |
| 117 | #define find_vpid(pid) find_pid_ns(pid, current->nsproxy->pid_ns) |
| 118 | #define find_pid(pid) find_pid_ns(pid, &init_pid_ns) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 119 | |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 120 | /* |
| 121 | * Lookup a PID in the hash table, and return with it's count elevated. |
| 122 | */ |
| 123 | extern struct pid *find_get_pid(int nr); |
Pavel Emelyanov | 198fe21 | 2007-10-18 23:40:06 -0700 | [diff] [blame] | 124 | extern struct pid *find_ge_pid(int nr, struct pid_namespace *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 125 | |
Pavel Emelyanov | 8ef047a | 2007-10-18 23:40:05 -0700 | [diff] [blame] | 126 | extern struct pid *alloc_pid(struct pid_namespace *ns); |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 127 | extern void FASTCALL(free_pid(struct pid *pid)); |
Sukadev Bhattiprolu | 3eb07c8 | 2007-10-18 23:40:13 -0700 | [diff] [blame^] | 128 | extern void zap_pid_ns_processes(struct pid_namespace *pid_ns); |
Eric W. Biederman | 92476d7 | 2006-03-31 02:31:42 -0800 | [diff] [blame] | 129 | |
Pavel Emelyanov | 7af5729 | 2007-10-18 23:40:06 -0700 | [diff] [blame] | 130 | /* |
| 131 | * the helpers to get the pid's id seen from different namespaces |
| 132 | * |
| 133 | * pid_nr() : global id, i.e. the id seen from the init namespace; |
| 134 | * pid_vnr() : virtual id, i.e. the id seen from the namespace this pid |
| 135 | * belongs to. this only makes sence when called in the |
| 136 | * context of the task that belongs to the same namespace; |
| 137 | * pid_nr_ns() : id seen from the ns specified. |
| 138 | * |
| 139 | * see also task_xid_nr() etc in include/linux/sched.h |
| 140 | */ |
| 141 | |
Eric W. Biederman | 5feb8f5 | 2006-10-02 02:17:12 -0700 | [diff] [blame] | 142 | static inline pid_t pid_nr(struct pid *pid) |
| 143 | { |
| 144 | pid_t nr = 0; |
| 145 | if (pid) |
Pavel Emelyanov | 7af5729 | 2007-10-18 23:40:06 -0700 | [diff] [blame] | 146 | nr = pid->numbers[0].nr; |
| 147 | return nr; |
| 148 | } |
| 149 | |
| 150 | pid_t pid_nr_ns(struct pid *pid, struct pid_namespace *ns); |
| 151 | |
| 152 | static inline pid_t pid_vnr(struct pid *pid) |
| 153 | { |
| 154 | pid_t nr = 0; |
| 155 | if (pid) |
| 156 | nr = pid->numbers[pid->level].nr; |
Eric W. Biederman | 5feb8f5 | 2006-10-02 02:17:12 -0700 | [diff] [blame] | 157 | return nr; |
| 158 | } |
| 159 | |
Andrew Morton | 1d32849 | 2006-10-03 01:13:45 -0700 | [diff] [blame] | 160 | #define do_each_pid_task(pid, type, task) \ |
| 161 | do { \ |
| 162 | struct hlist_node *pos___; \ |
| 163 | if (pid != NULL) \ |
| 164 | hlist_for_each_entry_rcu((task), pos___, \ |
Oleg Nesterov | d387cae | 2006-10-02 02:17:22 -0700 | [diff] [blame] | 165 | &pid->tasks[type], pids[type].node) { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 166 | |
Andrew Morton | 1d32849 | 2006-10-03 01:13:45 -0700 | [diff] [blame] | 167 | #define while_each_pid_task(pid, type, task) \ |
| 168 | } \ |
Oleg Nesterov | d387cae | 2006-10-02 02:17:22 -0700 | [diff] [blame] | 169 | } while (0) |
Eric W. Biederman | 558cb32 | 2006-10-02 02:17:09 -0700 | [diff] [blame] | 170 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 171 | #endif /* _LINUX_PID_H */ |