blob: 998ae7d2445092aefc4d88f20c4e37db8380c5b2 [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001/* SPDX-License-Identifier: GPL-2.0 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002#ifndef _LINUX_PID_H
3#define _LINUX_PID_H
4
Ingo Molnarb2d09102017-02-04 01:27:20 +01005#include <linux/rculist.h>
Joel Fernandes (Google)b53b0b92019-04-30 12:21:53 -04006#include <linux/wait.h>
Joel Fernandes (Google)f57e5152019-07-16 16:30:06 -07007#include <linux/refcount.h>
Eric W. Biederman92476d72006-03-31 02:31:42 -08008
Linus Torvalds1da177e2005-04-16 15:20:36 -07009enum pid_type
10{
11 PIDTYPE_PID,
Eric W. Biederman6883f812017-06-04 04:32:13 -050012 PIDTYPE_TGID,
Linus Torvalds1da177e2005-04-16 15:20:36 -070013 PIDTYPE_PGID,
14 PIDTYPE_SID,
Oleg Nesterovdd1c1f22017-08-21 17:35:02 +020015 PIDTYPE_MAX,
Linus Torvalds1da177e2005-04-16 15:20:36 -070016};
17
Eric W. Biederman92476d72006-03-31 02:31:42 -080018/*
19 * What is struct pid?
20 *
21 * A struct pid is the kernel's internal notion of a process identifier.
22 * It refers to individual tasks, process groups, and sessions. While
23 * there are processes attached to it the struct pid lives in a hash
24 * table, so it and then the processes that it refers to can be found
25 * quickly from the numeric pid value. The attached processes may be
26 * quickly accessed by following pointers from struct pid.
27 *
Lucas De Marchi25985ed2011-03-30 22:57:33 -030028 * Storing pid_t values in the kernel and referring to them later has a
Eric W. Biederman92476d72006-03-31 02:31:42 -080029 * problem. The process originally with that pid may have exited and the
30 * pid allocator wrapped, and another process could have come along
31 * and been assigned that pid.
32 *
33 * Referring to user space processes by holding a reference to struct
34 * task_struct has a problem. When the user space process exits
35 * the now useless task_struct is still kept. A task_struct plus a
36 * stack consumes around 10K of low kernel memory. More precisely
37 * this is THREAD_SIZE + sizeof(struct task_struct). By comparison
38 * a struct pid is about 64 bytes.
39 *
40 * Holding a reference to struct pid solves both of these problems.
41 * It is small so holding a reference does not consume a lot of
Sukadev Bhattiprolu84d73782006-12-08 02:38:01 -080042 * resources, and since a new struct pid is allocated when the numeric pid
43 * value is reused (when pids wrap around) we don't mistakenly refer to new
44 * processes.
Eric W. Biederman92476d72006-03-31 02:31:42 -080045 */
46
Sukadev Bhattiprolu4c3f2ea2007-10-18 23:40:03 -070047
48/*
49 * struct upid is used to get the id of the struct pid, as it is
50 * seen in particular namespace. Later the struct pid is found with
51 * find_pid_ns() using the int nr and struct pid_namespace *ns.
52 */
53
54struct upid {
Sukadev Bhattiprolu4c3f2ea2007-10-18 23:40:03 -070055 int nr;
56 struct pid_namespace *ns;
Sukadev Bhattiprolu4c3f2ea2007-10-18 23:40:03 -070057};
58
Linus Torvalds1da177e2005-04-16 15:20:36 -070059struct pid
60{
Joel Fernandes (Google)f57e5152019-07-16 16:30:06 -070061 refcount_t count;
Richard Kennedy33166b12008-07-25 01:48:35 -070062 unsigned int level;
Eric W. Biederman92476d72006-03-31 02:31:42 -080063 /* lists of tasks that use this pid */
64 struct hlist_head tasks[PIDTYPE_MAX];
Joel Fernandes (Google)b53b0b92019-04-30 12:21:53 -040065 /* wait queue for pidfd notifications */
66 wait_queue_head_t wait_pidfd;
Eric W. Biederman92476d72006-03-31 02:31:42 -080067 struct rcu_head rcu;
Sukadev Bhattiprolu4c3f2ea2007-10-18 23:40:03 -070068 struct upid numbers[1];
Linus Torvalds1da177e2005-04-16 15:20:36 -070069};
70
Sukadev Bhattiprolu820e45d2007-05-10 22:23:00 -070071extern struct pid init_struct_pid;
72
Christian Braunerb3e583822019-03-27 13:04:15 +010073extern const struct file_operations pidfd_fops;
74
Christian Brauner3695eae2019-07-28 00:22:29 +020075struct file;
76
77extern struct pid *pidfd_pid(const struct file *file);
78
Eric W. Biederman92476d72006-03-31 02:31:42 -080079static inline struct pid *get_pid(struct pid *pid)
80{
81 if (pid)
Joel Fernandes (Google)f57e5152019-07-16 16:30:06 -070082 refcount_inc(&pid->count);
Eric W. Biederman92476d72006-03-31 02:31:42 -080083 return pid;
84}
85
Harvey Harrisonb3c97522008-02-13 15:03:15 -080086extern void put_pid(struct pid *pid);
87extern struct task_struct *pid_task(struct pid *pid, enum pid_type);
Christian Brauner3d6d8da2019-10-17 12:18:28 +020088static inline bool pid_has_task(struct pid *pid, enum pid_type type)
89{
90 return !hlist_empty(&pid->tasks[type]);
91}
Harvey Harrisonb3c97522008-02-13 15:03:15 -080092extern struct task_struct *get_pid_task(struct pid *pid, enum pid_type);
Linus Torvalds1da177e2005-04-16 15:20:36 -070093
Oleg Nesterov1a657f782006-10-02 02:18:59 -070094extern struct pid *get_task_pid(struct task_struct *task, enum pid_type type);
95
Linus Torvalds1da177e2005-04-16 15:20:36 -070096/*
Oleg Nesterov81907732013-07-03 15:08:31 -070097 * these helpers must be called with the tasklist_lock write-held.
Linus Torvalds1da177e2005-04-16 15:20:36 -070098 */
Oleg Nesterov81907732013-07-03 15:08:31 -070099extern void attach_pid(struct task_struct *task, enum pid_type);
Harvey Harrisonb3c97522008-02-13 15:03:15 -0800100extern void detach_pid(struct task_struct *task, enum pid_type);
Oleg Nesterov24336ea2008-04-30 00:54:26 -0700101extern void change_pid(struct task_struct *task, enum pid_type,
102 struct pid *pid);
Harvey Harrisonb3c97522008-02-13 15:03:15 -0800103extern void transfer_pid(struct task_struct *old, struct task_struct *new,
104 enum pid_type);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105
Pavel Emelyanov198fe212007-10-18 23:40:06 -0700106struct pid_namespace;
107extern struct pid_namespace init_pid_ns;
108
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109/*
110 * look up a PID in the hash table. Must be called with the tasklist_lock
Eric W. Biederman92476d72006-03-31 02:31:42 -0800111 * or rcu_read_lock() held.
Pavel Emelyanov198fe212007-10-18 23:40:06 -0700112 *
113 * find_pid_ns() finds the pid in the namespace specified
Sisir Koppaka26498e82011-05-26 16:25:57 -0700114 * find_vpid() finds the pid by its virtual id, i.e. in the current namespace
Pavel Emelyanov198fe212007-10-18 23:40:06 -0700115 *
Pavel Emelyanovdbda0de2008-07-25 01:48:37 -0700116 * see also find_task_by_vpid() set in include/linux/sched.h
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117 */
Harvey Harrisonb3c97522008-02-13 15:03:15 -0800118extern struct pid *find_pid_ns(int nr, struct pid_namespace *ns);
Pavel Emelyanov89905712007-10-18 23:40:19 -0700119extern struct pid *find_vpid(int nr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120
Eric W. Biederman92476d72006-03-31 02:31:42 -0800121/*
122 * Lookup a PID in the hash table, and return with it's count elevated.
123 */
124extern struct pid *find_get_pid(int nr);
Pavel Emelyanov198fe212007-10-18 23:40:06 -0700125extern struct pid *find_ge_pid(int nr, struct pid_namespace *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126
Adrian Reber49cb2fc2019-11-15 13:36:20 +0100127extern struct pid *alloc_pid(struct pid_namespace *ns, pid_t *set_tid,
128 size_t set_tid_size);
Harvey Harrisonb3c97522008-02-13 15:03:15 -0800129extern void free_pid(struct pid *pid);
Eric W. Biedermanc876ad762012-12-21 20:27:12 -0800130extern void disable_pid_allocation(struct pid_namespace *ns);
Eric W. Biederman92476d72006-03-31 02:31:42 -0800131
Pavel Emelyanov7af57292007-10-18 23:40:06 -0700132/*
Eric W. Biedermanf9fb8602009-01-07 18:08:46 -0800133 * ns_of_pid() returns the pid namespace in which the specified pid was
134 * allocated.
135 *
136 * NOTE:
137 * ns_of_pid() is expected to be called for a process (task) that has
138 * an attached 'struct pid' (see attach_pid(), detach_pid()) i.e @pid
139 * is expected to be non-NULL. If @pid is NULL, caller should handle
140 * the resulting NULL pid-ns.
141 */
142static inline struct pid_namespace *ns_of_pid(struct pid *pid)
143{
144 struct pid_namespace *ns = NULL;
145 if (pid)
146 ns = pid->numbers[pid->level].ns;
147 return ns;
148}
149
150/*
Eric W. Biederman45a68622011-03-23 16:43:12 -0700151 * is_child_reaper returns true if the pid is the init process
152 * of the current namespace. As this one could be checked before
153 * pid_ns->child_reaper is assigned in copy_process, we check
154 * with the pid number.
155 */
156static inline bool is_child_reaper(struct pid *pid)
157{
158 return pid->numbers[pid->level].nr == 1;
159}
160
161/*
Pavel Emelyanov7af57292007-10-18 23:40:06 -0700162 * the helpers to get the pid's id seen from different namespaces
163 *
164 * pid_nr() : global id, i.e. the id seen from the init namespace;
Eric W. Biederman44c4e1b2008-02-08 04:19:15 -0800165 * pid_vnr() : virtual id, i.e. the id seen from the pid namespace of
166 * current.
Pavel Emelyanov7af57292007-10-18 23:40:06 -0700167 * pid_nr_ns() : id seen from the ns specified.
168 *
169 * see also task_xid_nr() etc in include/linux/sched.h
170 */
171
Eric W. Biederman5feb8f52006-10-02 02:17:12 -0700172static inline pid_t pid_nr(struct pid *pid)
173{
174 pid_t nr = 0;
175 if (pid)
Pavel Emelyanov7af57292007-10-18 23:40:06 -0700176 nr = pid->numbers[0].nr;
177 return nr;
178}
179
180pid_t pid_nr_ns(struct pid *pid, struct pid_namespace *ns);
Eric W. Biederman44c4e1b2008-02-08 04:19:15 -0800181pid_t pid_vnr(struct pid *pid);
Eric W. Biederman5feb8f52006-10-02 02:17:12 -0700182
Andrew Morton1d328492006-10-03 01:13:45 -0700183#define do_each_pid_task(pid, type, task) \
184 do { \
Steven Rostedt5ef64762008-12-04 00:26:39 -0500185 if ((pid) != NULL) \
Sasha Levinb67bfe02013-02-27 17:06:00 -0800186 hlist_for_each_entry_rcu((task), \
Eric W. Biederman2c470472017-09-26 13:06:43 -0500187 &(pid)->tasks[type], pid_links[type]) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188
Oleg Nesterov46f382d2008-02-08 04:19:19 -0800189 /*
190 * Both old and new leaders may be attached to
191 * the same pid in the middle of de_thread().
192 */
Andrew Morton1d328492006-10-03 01:13:45 -0700193#define while_each_pid_task(pid, type, task) \
Oleg Nesterov46f382d2008-02-08 04:19:19 -0800194 if (type == PIDTYPE_PID) \
195 break; \
Andrew Morton1d328492006-10-03 01:13:45 -0700196 } \
Oleg Nesterovd387cae2006-10-02 02:17:22 -0700197 } while (0)
Eric W. Biederman558cb322006-10-02 02:17:09 -0700198
Ken Chen2d70b682008-08-20 14:09:17 -0700199#define do_each_pid_thread(pid, type, task) \
200 do_each_pid_task(pid, type, task) { \
201 struct task_struct *tg___ = task; \
Tetsuo Handae3b5a342017-02-27 14:27:37 -0800202 for_each_thread(tg___, task) {
Ken Chen2d70b682008-08-20 14:09:17 -0700203
204#define while_each_pid_thread(pid, type, task) \
Tetsuo Handae3b5a342017-02-27 14:27:37 -0800205 } \
Ken Chen2d70b682008-08-20 14:09:17 -0700206 task = tg___; \
207 } while_each_pid_task(pid, type, task)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208#endif /* _LINUX_PID_H */