1
2#ifndef _LINUX_PID_H
3#define _LINUX_PID_H
4
5#include <linux/rculist.h>
6#include <linux/wait.h>
7#include <linux/refcount.h>
8
9enum pid_type
10{
11 PIDTYPE_PID,
12 PIDTYPE_TGID,
13 PIDTYPE_PGID,
14 PIDTYPE_SID,
15 PIDTYPE_MAX,
16};
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54struct upid {
55 int nr;
56 struct pid_namespace *ns;
57};
58
59struct pid
60{
61 refcount_t count;
62 unsigned int level;
63 spinlock_t lock;
64
65 struct hlist_head tasks[PIDTYPE_MAX];
66 struct hlist_head inodes;
67
68 wait_queue_head_t wait_pidfd;
69 struct rcu_head rcu;
70 struct upid numbers[1];
71};
72
73extern struct pid init_struct_pid;
74
75extern const struct file_operations pidfd_fops;
76
77struct file;
78
79extern struct pid *pidfd_pid(const struct file *file);
80struct pid *pidfd_get_pid(unsigned int fd, unsigned int *flags);
81
82static inline struct pid *get_pid(struct pid *pid)
83{
84 if (pid)
85 refcount_inc(&pid->count);
86 return pid;
87}
88
89extern void put_pid(struct pid *pid);
90extern struct task_struct *pid_task(struct pid *pid, enum pid_type);
91static inline bool pid_has_task(struct pid *pid, enum pid_type type)
92{
93 return !hlist_empty(&pid->tasks[type]);
94}
95extern struct task_struct *get_pid_task(struct pid *pid, enum pid_type);
96
97extern struct pid *get_task_pid(struct task_struct *task, enum pid_type type);
98
99
100
101
102extern void attach_pid(struct task_struct *task, enum pid_type);
103extern void detach_pid(struct task_struct *task, enum pid_type);
104extern void change_pid(struct task_struct *task, enum pid_type,
105 struct pid *pid);
106extern void exchange_tids(struct task_struct *task, struct task_struct *old);
107extern void transfer_pid(struct task_struct *old, struct task_struct *new,
108 enum pid_type);
109
110struct pid_namespace;
111extern struct pid_namespace init_pid_ns;
112
113extern int pid_max;
114extern int pid_max_min, pid_max_max;
115
116
117
118
119
120
121
122
123
124
125extern struct pid *find_pid_ns(int nr, struct pid_namespace *ns);
126extern struct pid *find_vpid(int nr);
127
128
129
130
131extern struct pid *find_get_pid(int nr);
132extern struct pid *find_ge_pid(int nr, struct pid_namespace *);
133
134extern struct pid *alloc_pid(struct pid_namespace *ns, pid_t *set_tid,
135 size_t set_tid_size);
136extern void free_pid(struct pid *pid);
137extern void disable_pid_allocation(struct pid_namespace *ns);
138
139
140
141
142
143
144
145
146
147
148
149static inline struct pid_namespace *ns_of_pid(struct pid *pid)
150{
151 struct pid_namespace *ns = NULL;
152 if (pid)
153 ns = pid->numbers[pid->level].ns;
154 return ns;
155}
156
157
158
159
160
161
162
163static inline bool is_child_reaper(struct pid *pid)
164{
165 return pid->numbers[pid->level].nr == 1;
166}
167
168
169
170
171
172
173
174
175
176
177
178
179static inline pid_t pid_nr(struct pid *pid)
180{
181 pid_t nr = 0;
182 if (pid)
183 nr = pid->numbers[0].nr;
184 return nr;
185}
186
187pid_t pid_nr_ns(struct pid *pid, struct pid_namespace *ns);
188pid_t pid_vnr(struct pid *pid);
189
190#define do_each_pid_task(pid, type, task) \
191 do { \
192 if ((pid) != NULL) \
193 hlist_for_each_entry_rcu((task), \
194 &(pid)->tasks[type], pid_links[type]) {
195
196
197
198
199
200#define while_each_pid_task(pid, type, task) \
201 if (type == PIDTYPE_PID) \
202 break; \
203 } \
204 } while (0)
205
206#define do_each_pid_thread(pid, type, task) \
207 do_each_pid_task(pid, type, task) { \
208 struct task_struct *tg___ = task; \
209 for_each_thread(tg___, task) {
210
211#define while_each_pid_thread(pid, type, task) \
212 } \
213 task = tg___; \
214 } while_each_pid_task(pid, type, task)
215#endif
216