19  * What is struct pid?
21  * A struct pid is the kernel's internal notion of a process identifier.
23  * there are processes attached to it the struct pid lives in a hash
25  * quickly from the numeric pid value.  The attached processes may be
26  * quickly accessed by following pointers from struct pid.
29  * 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.
38  * a struct pid is about 64 bytes.
40  * Holding a reference to struct pid solves both of these problems.
42  * resources, and since a new struct pid is allocated when the numeric pid
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
59 struct pid  struct
64 	/* lists of tasks that use this pid */  argument
73 extern struct pid init_struct_pid;  argument
79 extern struct pid *pidfd_pid(const struct file *file);
80 struct pid *pidfd_get_pid(unsigned int fd, unsigned int *flags);
82 static inline struct pid *get_pid(struct pid *pid)  in get_pid()  argument
84 	if (pid)  in get_pid()
85 		refcount_inc(&pid->count);  in get_pid()
86 	return pid;  in get_pid()
89 extern void put_pid(struct pid *pid);
90 extern struct task_struct *pid_task(struct pid *pid, enum pid_type);
91 static inline bool pid_has_task(struct pid *pid, enum pid_type type)  in pid_has_task()  argument
93 	return !hlist_empty(&pid->tasks[type]);  in pid_has_task()
95 extern struct task_struct *get_pid_task(struct pid *pid, enum pid_type);
97 extern struct pid *get_task_pid(struct task_struct *task, enum pid_type type);
105 			struct pid *pid);
117  * look up a PID in the hash table. Must be called with the tasklist_lock
120  * find_pid_ns() finds the pid in the namespace specified
121  * find_vpid() finds the pid by its virtual id, i.e. in the current namespace
125 extern struct pid *find_pid_ns(int nr, struct pid_namespace *ns);
126 extern struct pid *find_vpid(int nr);
129  * Lookup a PID in the hash table, and return with it's count elevated.
131 extern struct pid *find_get_pid(int nr);
132 extern struct pid *find_ge_pid(int nr, struct pid_namespace *);
134 extern struct pid *alloc_pid(struct pid_namespace *ns, pid_t *set_tid,
136 extern void free_pid(struct pid *pid);
140  * ns_of_pid() returns the pid namespace in which the specified pid was
145  * 	an attached 'struct pid' (see attach_pid(), detach_pid()) i.e @pid
146  * 	is expected to be non-NULL. If @pid is NULL, caller should handle
147  * 	the resulting NULL pid-ns.
149 static inline struct pid_namespace *ns_of_pid(struct pid *pid)  in ns_of_pid()  argument
152 	if (pid)  in ns_of_pid()
153 		ns = pid->numbers[pid->level].ns;  in ns_of_pid()
158  * is_child_reaper returns true if the pid is the init process
161  * with the pid number.
163 static inline bool is_child_reaper(struct pid *pid)  in is_child_reaper()  argument
165 	return pid->numbers[pid->level].nr == 1;  in is_child_reaper()
169  * the helpers to get the pid's id seen from different namespaces
172  * pid_vnr()   : virtual id, i.e. the id seen from the pid namespace of
179 static inline pid_t pid_nr(struct pid *pid)  in pid_nr()  argument
182 	if (pid)  in pid_nr()
183 		nr = pid->numbers[0].nr;  in pid_nr()
187 pid_t pid_nr_ns(struct pid *pid, struct pid_namespace *ns);
188 pid_t pid_vnr(struct pid *pid);
190 #define do_each_pid_task(pid, type, task)				\  argument
192 		if ((pid) != NULL)					\
194 				&(pid)->tasks[type], pid_links[type]) {
198 			 * the same pid in the middle of de_thread().
200 #define while_each_pid_task(pid, type, task)				\  argument
206 #define do_each_pid_thread(pid, type, task)				\  argument
207 	do_each_pid_task(pid, type, task) {				\
211 #define while_each_pid_thread(pid, type, task)				\  argument
214 	} while_each_pid_task(pid, type, task)