]>
Commit | Line | Data |
---|---|---|
b2441318 | 1 | /* SPDX-License-Identifier: GPL-2.0 */ |
1da177e4 LT |
2 | #ifndef _LINUX_SCHED_H |
3 | #define _LINUX_SCHED_H | |
4 | ||
5eca1c10 IM |
5 | /* |
6 | * Define 'struct task_struct' and provide the main scheduler | |
7 | * APIs (schedule(), wakeup variants, etc.) | |
8 | */ | |
b7b3c76a | 9 | |
5eca1c10 | 10 | #include <uapi/linux/sched.h> |
5c228079 | 11 | |
5eca1c10 | 12 | #include <asm/current.h> |
1da177e4 | 13 | |
5eca1c10 | 14 | #include <linux/pid.h> |
1da177e4 | 15 | #include <linux/sem.h> |
ab602f79 | 16 | #include <linux/shm.h> |
5eca1c10 IM |
17 | #include <linux/kcov.h> |
18 | #include <linux/mutex.h> | |
19 | #include <linux/plist.h> | |
20 | #include <linux/hrtimer.h> | |
1da177e4 | 21 | #include <linux/seccomp.h> |
5eca1c10 | 22 | #include <linux/nodemask.h> |
b68070e1 | 23 | #include <linux/rcupdate.h> |
a3b6714e | 24 | #include <linux/resource.h> |
9745512c | 25 | #include <linux/latencytop.h> |
5eca1c10 IM |
26 | #include <linux/sched/prio.h> |
27 | #include <linux/signal_types.h> | |
eb414681 | 28 | #include <linux/psi_types.h> |
5eca1c10 IM |
29 | #include <linux/mm_types_task.h> |
30 | #include <linux/task_io_accounting.h> | |
d7822b1e | 31 | #include <linux/rseq.h> |
a3b6714e | 32 | |
5eca1c10 | 33 | /* task_struct member predeclarations (sorted alphabetically): */ |
c7af7877 | 34 | struct audit_context; |
c7af7877 | 35 | struct backing_dev_info; |
bddd87c7 | 36 | struct bio_list; |
73c10101 | 37 | struct blk_plug; |
c7af7877 | 38 | struct cfs_rq; |
c7af7877 IM |
39 | struct fs_struct; |
40 | struct futex_pi_state; | |
41 | struct io_context; | |
42 | struct mempolicy; | |
89076bc3 | 43 | struct nameidata; |
c7af7877 IM |
44 | struct nsproxy; |
45 | struct perf_event_context; | |
46 | struct pid_namespace; | |
47 | struct pipe_inode_info; | |
48 | struct rcu_node; | |
49 | struct reclaim_state; | |
50 | struct robust_list_head; | |
51 | struct sched_attr; | |
52 | struct sched_param; | |
43ae34cb | 53 | struct seq_file; |
c7af7877 IM |
54 | struct sighand_struct; |
55 | struct signal_struct; | |
56 | struct task_delay_info; | |
4cf86d77 | 57 | struct task_group; |
1da177e4 | 58 | |
4a8342d2 LT |
59 | /* |
60 | * Task state bitmask. NOTE! These bits are also | |
61 | * encoded in fs/proc/array.c: get_task_state(). | |
62 | * | |
63 | * We have two separate sets of flags: task->state | |
64 | * is about runnability, while task->exit_state are | |
65 | * about the task exiting. Confusing, but this way | |
66 | * modifying one set can't modify the other one by | |
67 | * mistake. | |
68 | */ | |
5eca1c10 IM |
69 | |
70 | /* Used in tsk->state: */ | |
92c4bc9f PZ |
71 | #define TASK_RUNNING 0x0000 |
72 | #define TASK_INTERRUPTIBLE 0x0001 | |
73 | #define TASK_UNINTERRUPTIBLE 0x0002 | |
74 | #define __TASK_STOPPED 0x0004 | |
75 | #define __TASK_TRACED 0x0008 | |
5eca1c10 | 76 | /* Used in tsk->exit_state: */ |
92c4bc9f PZ |
77 | #define EXIT_DEAD 0x0010 |
78 | #define EXIT_ZOMBIE 0x0020 | |
5eca1c10 IM |
79 | #define EXIT_TRACE (EXIT_ZOMBIE | EXIT_DEAD) |
80 | /* Used in tsk->state again: */ | |
8ef9925b PZ |
81 | #define TASK_PARKED 0x0040 |
82 | #define TASK_DEAD 0x0080 | |
83 | #define TASK_WAKEKILL 0x0100 | |
84 | #define TASK_WAKING 0x0200 | |
92c4bc9f PZ |
85 | #define TASK_NOLOAD 0x0400 |
86 | #define TASK_NEW 0x0800 | |
87 | #define TASK_STATE_MAX 0x1000 | |
5eca1c10 | 88 | |
5eca1c10 IM |
89 | /* Convenience macros for the sake of set_current_state: */ |
90 | #define TASK_KILLABLE (TASK_WAKEKILL | TASK_UNINTERRUPTIBLE) | |
91 | #define TASK_STOPPED (TASK_WAKEKILL | __TASK_STOPPED) | |
92 | #define TASK_TRACED (TASK_WAKEKILL | __TASK_TRACED) | |
93 | ||
94 | #define TASK_IDLE (TASK_UNINTERRUPTIBLE | TASK_NOLOAD) | |
95 | ||
96 | /* Convenience macros for the sake of wake_up(): */ | |
97 | #define TASK_NORMAL (TASK_INTERRUPTIBLE | TASK_UNINTERRUPTIBLE) | |
5eca1c10 IM |
98 | |
99 | /* get_task_state(): */ | |
100 | #define TASK_REPORT (TASK_RUNNING | TASK_INTERRUPTIBLE | \ | |
101 | TASK_UNINTERRUPTIBLE | __TASK_STOPPED | \ | |
8ef9925b PZ |
102 | __TASK_TRACED | EXIT_DEAD | EXIT_ZOMBIE | \ |
103 | TASK_PARKED) | |
5eca1c10 IM |
104 | |
105 | #define task_is_traced(task) ((task->state & __TASK_TRACED) != 0) | |
106 | ||
107 | #define task_is_stopped(task) ((task->state & __TASK_STOPPED) != 0) | |
108 | ||
109 | #define task_is_stopped_or_traced(task) ((task->state & (__TASK_STOPPED | __TASK_TRACED)) != 0) | |
110 | ||
111 | #define task_contributes_to_load(task) ((task->state & TASK_UNINTERRUPTIBLE) != 0 && \ | |
112 | (task->flags & PF_FROZEN) == 0 && \ | |
113 | (task->state & TASK_NOLOAD) == 0) | |
1da177e4 | 114 | |
8eb23b9f PZ |
115 | #ifdef CONFIG_DEBUG_ATOMIC_SLEEP |
116 | ||
b5bf9a90 PZ |
117 | /* |
118 | * Special states are those that do not use the normal wait-loop pattern. See | |
119 | * the comment with set_special_state(). | |
120 | */ | |
121 | #define is_special_task_state(state) \ | |
1cef1150 | 122 | ((state) & (__TASK_STOPPED | __TASK_TRACED | TASK_PARKED | TASK_DEAD)) |
b5bf9a90 | 123 | |
8eb23b9f PZ |
124 | #define __set_current_state(state_value) \ |
125 | do { \ | |
b5bf9a90 | 126 | WARN_ON_ONCE(is_special_task_state(state_value));\ |
8eb23b9f PZ |
127 | current->task_state_change = _THIS_IP_; \ |
128 | current->state = (state_value); \ | |
129 | } while (0) | |
b5bf9a90 | 130 | |
8eb23b9f PZ |
131 | #define set_current_state(state_value) \ |
132 | do { \ | |
b5bf9a90 | 133 | WARN_ON_ONCE(is_special_task_state(state_value));\ |
8eb23b9f | 134 | current->task_state_change = _THIS_IP_; \ |
a2250238 | 135 | smp_store_mb(current->state, (state_value)); \ |
8eb23b9f PZ |
136 | } while (0) |
137 | ||
b5bf9a90 PZ |
138 | #define set_special_state(state_value) \ |
139 | do { \ | |
140 | unsigned long flags; /* may shadow */ \ | |
141 | WARN_ON_ONCE(!is_special_task_state(state_value)); \ | |
142 | raw_spin_lock_irqsave(¤t->pi_lock, flags); \ | |
143 | current->task_state_change = _THIS_IP_; \ | |
144 | current->state = (state_value); \ | |
145 | raw_spin_unlock_irqrestore(¤t->pi_lock, flags); \ | |
146 | } while (0) | |
8eb23b9f | 147 | #else |
498d0c57 AM |
148 | /* |
149 | * set_current_state() includes a barrier so that the write of current->state | |
150 | * is correctly serialised wrt the caller's subsequent test of whether to | |
151 | * actually sleep: | |
152 | * | |
a2250238 | 153 | * for (;;) { |
498d0c57 | 154 | * set_current_state(TASK_UNINTERRUPTIBLE); |
a2250238 PZ |
155 | * if (!need_sleep) |
156 | * break; | |
157 | * | |
158 | * schedule(); | |
159 | * } | |
160 | * __set_current_state(TASK_RUNNING); | |
161 | * | |
162 | * If the caller does not need such serialisation (because, for instance, the | |
163 | * condition test and condition change and wakeup are under the same lock) then | |
164 | * use __set_current_state(). | |
165 | * | |
166 | * The above is typically ordered against the wakeup, which does: | |
167 | * | |
b5bf9a90 PZ |
168 | * need_sleep = false; |
169 | * wake_up_state(p, TASK_UNINTERRUPTIBLE); | |
a2250238 | 170 | * |
7696f991 AP |
171 | * where wake_up_state() executes a full memory barrier before accessing the |
172 | * task state. | |
a2250238 PZ |
173 | * |
174 | * Wakeup will do: if (@state & p->state) p->state = TASK_RUNNING, that is, | |
175 | * once it observes the TASK_UNINTERRUPTIBLE store the waking CPU can issue a | |
176 | * TASK_RUNNING store which can collide with __set_current_state(TASK_RUNNING). | |
498d0c57 | 177 | * |
b5bf9a90 | 178 | * However, with slightly different timing the wakeup TASK_RUNNING store can |
dfcb245e | 179 | * also collide with the TASK_UNINTERRUPTIBLE store. Losing that store is not |
b5bf9a90 PZ |
180 | * a problem either because that will result in one extra go around the loop |
181 | * and our @cond test will save the day. | |
498d0c57 | 182 | * |
a2250238 | 183 | * Also see the comments of try_to_wake_up(). |
498d0c57 | 184 | */ |
b5bf9a90 PZ |
185 | #define __set_current_state(state_value) \ |
186 | current->state = (state_value) | |
187 | ||
188 | #define set_current_state(state_value) \ | |
189 | smp_store_mb(current->state, (state_value)) | |
190 | ||
191 | /* | |
192 | * set_special_state() should be used for those states when the blocking task | |
193 | * can not use the regular condition based wait-loop. In that case we must | |
194 | * serialize against wakeups such that any possible in-flight TASK_RUNNING stores | |
195 | * will not collide with our state change. | |
196 | */ | |
197 | #define set_special_state(state_value) \ | |
198 | do { \ | |
199 | unsigned long flags; /* may shadow */ \ | |
200 | raw_spin_lock_irqsave(¤t->pi_lock, flags); \ | |
201 | current->state = (state_value); \ | |
202 | raw_spin_unlock_irqrestore(¤t->pi_lock, flags); \ | |
203 | } while (0) | |
204 | ||
8eb23b9f PZ |
205 | #endif |
206 | ||
5eca1c10 IM |
207 | /* Task command name length: */ |
208 | #define TASK_COMM_LEN 16 | |
1da177e4 | 209 | |
1da177e4 LT |
210 | extern void scheduler_tick(void); |
211 | ||
5eca1c10 IM |
212 | #define MAX_SCHEDULE_TIMEOUT LONG_MAX |
213 | ||
214 | extern long schedule_timeout(long timeout); | |
215 | extern long schedule_timeout_interruptible(long timeout); | |
216 | extern long schedule_timeout_killable(long timeout); | |
217 | extern long schedule_timeout_uninterruptible(long timeout); | |
218 | extern long schedule_timeout_idle(long timeout); | |
1da177e4 | 219 | asmlinkage void schedule(void); |
c5491ea7 | 220 | extern void schedule_preempt_disabled(void); |
1da177e4 | 221 | |
10ab5643 TH |
222 | extern int __must_check io_schedule_prepare(void); |
223 | extern void io_schedule_finish(int token); | |
9cff8ade | 224 | extern long io_schedule_timeout(long timeout); |
10ab5643 | 225 | extern void io_schedule(void); |
9cff8ade | 226 | |
d37f761d | 227 | /** |
0ba42a59 | 228 | * struct prev_cputime - snapshot of system and user cputime |
d37f761d FW |
229 | * @utime: time spent in user mode |
230 | * @stime: time spent in system mode | |
9d7fb042 | 231 | * @lock: protects the above two fields |
d37f761d | 232 | * |
9d7fb042 PZ |
233 | * Stores previous user/system time values such that we can guarantee |
234 | * monotonicity. | |
d37f761d | 235 | */ |
9d7fb042 PZ |
236 | struct prev_cputime { |
237 | #ifndef CONFIG_VIRT_CPU_ACCOUNTING_NATIVE | |
5eca1c10 IM |
238 | u64 utime; |
239 | u64 stime; | |
240 | raw_spinlock_t lock; | |
9d7fb042 | 241 | #endif |
d37f761d FW |
242 | }; |
243 | ||
f06febc9 FM |
244 | /** |
245 | * struct task_cputime - collected CPU time counts | |
5613fda9 FW |
246 | * @utime: time spent in user mode, in nanoseconds |
247 | * @stime: time spent in kernel mode, in nanoseconds | |
f06febc9 | 248 | * @sum_exec_runtime: total time spent on the CPU, in nanoseconds |
5ce73a4a | 249 | * |
9d7fb042 PZ |
250 | * This structure groups together three kinds of CPU time that are tracked for |
251 | * threads and thread groups. Most things considering CPU time want to group | |
252 | * these counts together and treat all three of them in parallel. | |
f06febc9 FM |
253 | */ |
254 | struct task_cputime { | |
5eca1c10 IM |
255 | u64 utime; |
256 | u64 stime; | |
257 | unsigned long long sum_exec_runtime; | |
f06febc9 | 258 | }; |
9d7fb042 | 259 | |
5eca1c10 IM |
260 | /* Alternate field names when used on cache expirations: */ |
261 | #define virt_exp utime | |
262 | #define prof_exp stime | |
263 | #define sched_exp sum_exec_runtime | |
f06febc9 | 264 | |
bac5b6b6 FW |
265 | enum vtime_state { |
266 | /* Task is sleeping or running in a CPU with VTIME inactive: */ | |
267 | VTIME_INACTIVE = 0, | |
268 | /* Task runs in userspace in a CPU with VTIME active: */ | |
269 | VTIME_USER, | |
270 | /* Task runs in kernelspace in a CPU with VTIME active: */ | |
271 | VTIME_SYS, | |
272 | }; | |
273 | ||
274 | struct vtime { | |
275 | seqcount_t seqcount; | |
276 | unsigned long long starttime; | |
277 | enum vtime_state state; | |
2a42eb95 WL |
278 | u64 utime; |
279 | u64 stime; | |
280 | u64 gtime; | |
bac5b6b6 FW |
281 | }; |
282 | ||
1da177e4 | 283 | struct sched_info { |
7f5f8e8d | 284 | #ifdef CONFIG_SCHED_INFO |
5eca1c10 IM |
285 | /* Cumulative counters: */ |
286 | ||
287 | /* # of times we have run on this CPU: */ | |
288 | unsigned long pcount; | |
289 | ||
290 | /* Time spent waiting on a runqueue: */ | |
291 | unsigned long long run_delay; | |
292 | ||
293 | /* Timestamps: */ | |
294 | ||
295 | /* When did we last run on a CPU? */ | |
296 | unsigned long long last_arrival; | |
297 | ||
298 | /* When were we last queued to run? */ | |
299 | unsigned long long last_queued; | |
1da177e4 | 300 | |
f6db8347 | 301 | #endif /* CONFIG_SCHED_INFO */ |
7f5f8e8d | 302 | }; |
1da177e4 | 303 | |
6ecdd749 YD |
304 | /* |
305 | * Integer metrics need fixed point arithmetic, e.g., sched/fair | |
306 | * has a few: load, load_avg, util_avg, freq, and capacity. | |
307 | * | |
308 | * We define a basic fixed point arithmetic range, and then formalize | |
309 | * all these metrics based on that basic range. | |
310 | */ | |
5eca1c10 IM |
311 | # define SCHED_FIXEDPOINT_SHIFT 10 |
312 | # define SCHED_FIXEDPOINT_SCALE (1L << SCHED_FIXEDPOINT_SHIFT) | |
6ecdd749 | 313 | |
20b8a59f | 314 | struct load_weight { |
5eca1c10 IM |
315 | unsigned long weight; |
316 | u32 inv_weight; | |
20b8a59f IM |
317 | }; |
318 | ||
7f65ea42 PB |
319 | /** |
320 | * struct util_est - Estimation utilization of FAIR tasks | |
321 | * @enqueued: instantaneous estimated utilization of a task/cpu | |
322 | * @ewma: the Exponential Weighted Moving Average (EWMA) | |
323 | * utilization of a task | |
324 | * | |
325 | * Support data structure to track an Exponential Weighted Moving Average | |
326 | * (EWMA) of a FAIR task's utilization. New samples are added to the moving | |
327 | * average each time a task completes an activation. Sample's weight is chosen | |
328 | * so that the EWMA will be relatively insensitive to transient changes to the | |
329 | * task's workload. | |
330 | * | |
331 | * The enqueued attribute has a slightly different meaning for tasks and cpus: | |
332 | * - task: the task's util_avg at last task dequeue time | |
333 | * - cfs_rq: the sum of util_est.enqueued for each RUNNABLE task on that CPU | |
334 | * Thus, the util_est.enqueued of a task represents the contribution on the | |
335 | * estimated utilization of the CPU where that task is currently enqueued. | |
336 | * | |
337 | * Only for tasks we track a moving average of the past instantaneous | |
338 | * estimated utilization. This allows to absorb sporadic drops in utilization | |
339 | * of an otherwise almost periodic task. | |
340 | */ | |
341 | struct util_est { | |
342 | unsigned int enqueued; | |
343 | unsigned int ewma; | |
344 | #define UTIL_EST_WEIGHT_SHIFT 2 | |
317d359d | 345 | } __attribute__((__aligned__(sizeof(u64)))); |
7f65ea42 | 346 | |
9d89c257 | 347 | /* |
7b595334 YD |
348 | * The load_avg/util_avg accumulates an infinite geometric series |
349 | * (see __update_load_avg() in kernel/sched/fair.c). | |
350 | * | |
351 | * [load_avg definition] | |
352 | * | |
353 | * load_avg = runnable% * scale_load_down(load) | |
354 | * | |
355 | * where runnable% is the time ratio that a sched_entity is runnable. | |
356 | * For cfs_rq, it is the aggregated load_avg of all runnable and | |
9d89c257 | 357 | * blocked sched_entities. |
7b595334 YD |
358 | * |
359 | * load_avg may also take frequency scaling into account: | |
360 | * | |
361 | * load_avg = runnable% * scale_load_down(load) * freq% | |
362 | * | |
363 | * where freq% is the CPU frequency normalized to the highest frequency. | |
364 | * | |
365 | * [util_avg definition] | |
366 | * | |
367 | * util_avg = running% * SCHED_CAPACITY_SCALE | |
368 | * | |
369 | * where running% is the time ratio that a sched_entity is running on | |
370 | * a CPU. For cfs_rq, it is the aggregated util_avg of all runnable | |
371 | * and blocked sched_entities. | |
372 | * | |
373 | * util_avg may also factor frequency scaling and CPU capacity scaling: | |
374 | * | |
375 | * util_avg = running% * SCHED_CAPACITY_SCALE * freq% * capacity% | |
376 | * | |
377 | * where freq% is the same as above, and capacity% is the CPU capacity | |
378 | * normalized to the greatest capacity (due to uarch differences, etc). | |
379 | * | |
380 | * N.B., the above ratios (runnable%, running%, freq%, and capacity%) | |
381 | * themselves are in the range of [0, 1]. To do fixed point arithmetics, | |
382 | * we therefore scale them to as large a range as necessary. This is for | |
383 | * example reflected by util_avg's SCHED_CAPACITY_SCALE. | |
384 | * | |
385 | * [Overflow issue] | |
386 | * | |
387 | * The 64-bit load_sum can have 4353082796 (=2^64/47742/88761) entities | |
388 | * with the highest load (=88761), always runnable on a single cfs_rq, | |
389 | * and should not overflow as the number already hits PID_MAX_LIMIT. | |
390 | * | |
391 | * For all other cases (including 32-bit kernels), struct load_weight's | |
392 | * weight will overflow first before we do, because: | |
393 | * | |
394 | * Max(load_avg) <= Max(load.weight) | |
395 | * | |
396 | * Then it is the load_weight's responsibility to consider overflow | |
397 | * issues. | |
9d89c257 | 398 | */ |
9d85f21c | 399 | struct sched_avg { |
5eca1c10 IM |
400 | u64 last_update_time; |
401 | u64 load_sum; | |
1ea6c46a | 402 | u64 runnable_load_sum; |
5eca1c10 IM |
403 | u32 util_sum; |
404 | u32 period_contrib; | |
405 | unsigned long load_avg; | |
1ea6c46a | 406 | unsigned long runnable_load_avg; |
5eca1c10 | 407 | unsigned long util_avg; |
7f65ea42 | 408 | struct util_est util_est; |
317d359d | 409 | } ____cacheline_aligned; |
9d85f21c | 410 | |
41acab88 | 411 | struct sched_statistics { |
7f5f8e8d | 412 | #ifdef CONFIG_SCHEDSTATS |
5eca1c10 IM |
413 | u64 wait_start; |
414 | u64 wait_max; | |
415 | u64 wait_count; | |
416 | u64 wait_sum; | |
417 | u64 iowait_count; | |
418 | u64 iowait_sum; | |
419 | ||
420 | u64 sleep_start; | |
421 | u64 sleep_max; | |
422 | s64 sum_sleep_runtime; | |
423 | ||
424 | u64 block_start; | |
425 | u64 block_max; | |
426 | u64 exec_max; | |
427 | u64 slice_max; | |
428 | ||
429 | u64 nr_migrations_cold; | |
430 | u64 nr_failed_migrations_affine; | |
431 | u64 nr_failed_migrations_running; | |
432 | u64 nr_failed_migrations_hot; | |
433 | u64 nr_forced_migrations; | |
434 | ||
435 | u64 nr_wakeups; | |
436 | u64 nr_wakeups_sync; | |
437 | u64 nr_wakeups_migrate; | |
438 | u64 nr_wakeups_local; | |
439 | u64 nr_wakeups_remote; | |
440 | u64 nr_wakeups_affine; | |
441 | u64 nr_wakeups_affine_attempts; | |
442 | u64 nr_wakeups_passive; | |
443 | u64 nr_wakeups_idle; | |
41acab88 | 444 | #endif |
7f5f8e8d | 445 | }; |
41acab88 LDM |
446 | |
447 | struct sched_entity { | |
5eca1c10 IM |
448 | /* For load-balancing: */ |
449 | struct load_weight load; | |
1ea6c46a | 450 | unsigned long runnable_weight; |
5eca1c10 IM |
451 | struct rb_node run_node; |
452 | struct list_head group_node; | |
453 | unsigned int on_rq; | |
41acab88 | 454 | |
5eca1c10 IM |
455 | u64 exec_start; |
456 | u64 sum_exec_runtime; | |
457 | u64 vruntime; | |
458 | u64 prev_sum_exec_runtime; | |
41acab88 | 459 | |
5eca1c10 | 460 | u64 nr_migrations; |
41acab88 | 461 | |
5eca1c10 | 462 | struct sched_statistics statistics; |
94c18227 | 463 | |
20b8a59f | 464 | #ifdef CONFIG_FAIR_GROUP_SCHED |
5eca1c10 IM |
465 | int depth; |
466 | struct sched_entity *parent; | |
20b8a59f | 467 | /* rq on which this entity is (to be) queued: */ |
5eca1c10 | 468 | struct cfs_rq *cfs_rq; |
20b8a59f | 469 | /* rq "owned" by this entity/group: */ |
5eca1c10 | 470 | struct cfs_rq *my_q; |
20b8a59f | 471 | #endif |
8bd75c77 | 472 | |
141965c7 | 473 | #ifdef CONFIG_SMP |
5a107804 JO |
474 | /* |
475 | * Per entity load average tracking. | |
476 | * | |
477 | * Put into separate cache line so it does not | |
478 | * collide with read-mostly values above. | |
479 | */ | |
317d359d | 480 | struct sched_avg avg; |
9d85f21c | 481 | #endif |
20b8a59f | 482 | }; |
70b97a7f | 483 | |
fa717060 | 484 | struct sched_rt_entity { |
5eca1c10 IM |
485 | struct list_head run_list; |
486 | unsigned long timeout; | |
487 | unsigned long watchdog_stamp; | |
488 | unsigned int time_slice; | |
489 | unsigned short on_rq; | |
490 | unsigned short on_list; | |
491 | ||
492 | struct sched_rt_entity *back; | |
052f1dc7 | 493 | #ifdef CONFIG_RT_GROUP_SCHED |
5eca1c10 | 494 | struct sched_rt_entity *parent; |
6f505b16 | 495 | /* rq on which this entity is (to be) queued: */ |
5eca1c10 | 496 | struct rt_rq *rt_rq; |
6f505b16 | 497 | /* rq "owned" by this entity/group: */ |
5eca1c10 | 498 | struct rt_rq *my_q; |
6f505b16 | 499 | #endif |
3859a271 | 500 | } __randomize_layout; |
fa717060 | 501 | |
aab03e05 | 502 | struct sched_dl_entity { |
5eca1c10 | 503 | struct rb_node rb_node; |
aab03e05 DF |
504 | |
505 | /* | |
506 | * Original scheduling parameters. Copied here from sched_attr | |
4027d080 | 507 | * during sched_setattr(), they will remain the same until |
508 | * the next sched_setattr(). | |
aab03e05 | 509 | */ |
5eca1c10 IM |
510 | u64 dl_runtime; /* Maximum runtime for each instance */ |
511 | u64 dl_deadline; /* Relative deadline of each instance */ | |
512 | u64 dl_period; /* Separation of two instances (period) */ | |
54d6d303 | 513 | u64 dl_bw; /* dl_runtime / dl_period */ |
3effcb42 | 514 | u64 dl_density; /* dl_runtime / dl_deadline */ |
aab03e05 DF |
515 | |
516 | /* | |
517 | * Actual scheduling parameters. Initialized with the values above, | |
dfcb245e | 518 | * they are continuously updated during task execution. Note that |
aab03e05 DF |
519 | * the remaining runtime could be < 0 in case we are in overrun. |
520 | */ | |
5eca1c10 IM |
521 | s64 runtime; /* Remaining runtime for this instance */ |
522 | u64 deadline; /* Absolute deadline for this instance */ | |
523 | unsigned int flags; /* Specifying the scheduler behaviour */ | |
aab03e05 DF |
524 | |
525 | /* | |
526 | * Some bool flags: | |
527 | * | |
528 | * @dl_throttled tells if we exhausted the runtime. If so, the | |
529 | * task has to wait for a replenishment to be performed at the | |
530 | * next firing of dl_timer. | |
531 | * | |
2d3d891d DF |
532 | * @dl_boosted tells if we are boosted due to DI. If so we are |
533 | * outside bandwidth enforcement mechanism (but only until we | |
5bfd126e JL |
534 | * exit the critical section); |
535 | * | |
5eca1c10 | 536 | * @dl_yielded tells if task gave up the CPU before consuming |
5bfd126e | 537 | * all its available runtime during the last job. |
209a0cbd LA |
538 | * |
539 | * @dl_non_contending tells if the task is inactive while still | |
540 | * contributing to the active utilization. In other words, it | |
541 | * indicates if the inactive timer has been armed and its handler | |
542 | * has not been executed yet. This flag is useful to avoid race | |
543 | * conditions between the inactive timer handler and the wakeup | |
544 | * code. | |
34be3930 JL |
545 | * |
546 | * @dl_overrun tells if the task asked to be informed about runtime | |
547 | * overruns. | |
aab03e05 | 548 | */ |
aa5222e9 DC |
549 | unsigned int dl_throttled : 1; |
550 | unsigned int dl_boosted : 1; | |
551 | unsigned int dl_yielded : 1; | |
552 | unsigned int dl_non_contending : 1; | |
34be3930 | 553 | unsigned int dl_overrun : 1; |
aab03e05 DF |
554 | |
555 | /* | |
556 | * Bandwidth enforcement timer. Each -deadline task has its | |
557 | * own bandwidth to be enforced, thus we need one timer per task. | |
558 | */ | |
5eca1c10 | 559 | struct hrtimer dl_timer; |
209a0cbd LA |
560 | |
561 | /* | |
562 | * Inactive timer, responsible for decreasing the active utilization | |
563 | * at the "0-lag time". When a -deadline task blocks, it contributes | |
564 | * to GRUB's active utilization until the "0-lag time", hence a | |
565 | * timer is needed to decrease the active utilization at the correct | |
566 | * time. | |
567 | */ | |
568 | struct hrtimer inactive_timer; | |
aab03e05 | 569 | }; |
8bd75c77 | 570 | |
1d082fd0 PM |
571 | union rcu_special { |
572 | struct { | |
5eca1c10 IM |
573 | u8 blocked; |
574 | u8 need_qs; | |
05f41571 PM |
575 | u8 exp_hint; /* Hint for performance. */ |
576 | u8 pad; /* No garbage from compiler! */ | |
8203d6d0 | 577 | } b; /* Bits. */ |
05f41571 | 578 | u32 s; /* Set of bits. */ |
1d082fd0 | 579 | }; |
86848966 | 580 | |
8dc85d54 PZ |
581 | enum perf_event_task_context { |
582 | perf_invalid_context = -1, | |
583 | perf_hw_context = 0, | |
89a1e187 | 584 | perf_sw_context, |
8dc85d54 PZ |
585 | perf_nr_task_contexts, |
586 | }; | |
587 | ||
eb61baf6 IM |
588 | struct wake_q_node { |
589 | struct wake_q_node *next; | |
590 | }; | |
591 | ||
1da177e4 | 592 | struct task_struct { |
c65eacbe AL |
593 | #ifdef CONFIG_THREAD_INFO_IN_TASK |
594 | /* | |
595 | * For reasons of header soup (see current_thread_info()), this | |
596 | * must be the first element of task_struct. | |
597 | */ | |
5eca1c10 | 598 | struct thread_info thread_info; |
c65eacbe | 599 | #endif |
5eca1c10 IM |
600 | /* -1 unrunnable, 0 runnable, >0 stopped: */ |
601 | volatile long state; | |
29e48ce8 KC |
602 | |
603 | /* | |
604 | * This begins the randomizable portion of task_struct. Only | |
605 | * scheduling-critical items should be added above here. | |
606 | */ | |
607 | randomized_struct_fields_start | |
608 | ||
5eca1c10 IM |
609 | void *stack; |
610 | atomic_t usage; | |
611 | /* Per task flags (PF_*), defined further below: */ | |
612 | unsigned int flags; | |
613 | unsigned int ptrace; | |
1da177e4 | 614 | |
2dd73a4f | 615 | #ifdef CONFIG_SMP |
5eca1c10 IM |
616 | struct llist_node wake_entry; |
617 | int on_cpu; | |
c65eacbe | 618 | #ifdef CONFIG_THREAD_INFO_IN_TASK |
5eca1c10 IM |
619 | /* Current CPU: */ |
620 | unsigned int cpu; | |
c65eacbe | 621 | #endif |
5eca1c10 IM |
622 | unsigned int wakee_flips; |
623 | unsigned long wakee_flip_decay_ts; | |
624 | struct task_struct *last_wakee; | |
ac66f547 | 625 | |
32e839dd MG |
626 | /* |
627 | * recent_used_cpu is initially set as the last CPU used by a task | |
628 | * that wakes affine another task. Waker/wakee relationships can | |
629 | * push tasks around a CPU where each wakeup moves to the next one. | |
630 | * Tracking a recently used CPU allows a quick search for a recently | |
631 | * used CPU that may be idle. | |
632 | */ | |
633 | int recent_used_cpu; | |
5eca1c10 | 634 | int wake_cpu; |
2dd73a4f | 635 | #endif |
5eca1c10 IM |
636 | int on_rq; |
637 | ||
638 | int prio; | |
639 | int static_prio; | |
640 | int normal_prio; | |
641 | unsigned int rt_priority; | |
50e645a8 | 642 | |
5eca1c10 IM |
643 | const struct sched_class *sched_class; |
644 | struct sched_entity se; | |
645 | struct sched_rt_entity rt; | |
8323f26c | 646 | #ifdef CONFIG_CGROUP_SCHED |
5eca1c10 | 647 | struct task_group *sched_task_group; |
8323f26c | 648 | #endif |
5eca1c10 | 649 | struct sched_dl_entity dl; |
1da177e4 | 650 | |
e107be36 | 651 | #ifdef CONFIG_PREEMPT_NOTIFIERS |
5eca1c10 IM |
652 | /* List of struct preempt_notifier: */ |
653 | struct hlist_head preempt_notifiers; | |
e107be36 AK |
654 | #endif |
655 | ||
6c5c9341 | 656 | #ifdef CONFIG_BLK_DEV_IO_TRACE |
5eca1c10 | 657 | unsigned int btrace_seq; |
6c5c9341 | 658 | #endif |
1da177e4 | 659 | |
5eca1c10 IM |
660 | unsigned int policy; |
661 | int nr_cpus_allowed; | |
662 | cpumask_t cpus_allowed; | |
1da177e4 | 663 | |
a57eb940 | 664 | #ifdef CONFIG_PREEMPT_RCU |
5eca1c10 IM |
665 | int rcu_read_lock_nesting; |
666 | union rcu_special rcu_read_unlock_special; | |
667 | struct list_head rcu_node_entry; | |
668 | struct rcu_node *rcu_blocked_node; | |
28f6569a | 669 | #endif /* #ifdef CONFIG_PREEMPT_RCU */ |
5eca1c10 | 670 | |
8315f422 | 671 | #ifdef CONFIG_TASKS_RCU |
5eca1c10 | 672 | unsigned long rcu_tasks_nvcsw; |
ccdd29ff PM |
673 | u8 rcu_tasks_holdout; |
674 | u8 rcu_tasks_idx; | |
5eca1c10 | 675 | int rcu_tasks_idle_cpu; |
ccdd29ff | 676 | struct list_head rcu_tasks_holdout_list; |
8315f422 | 677 | #endif /* #ifdef CONFIG_TASKS_RCU */ |
e260be67 | 678 | |
5eca1c10 | 679 | struct sched_info sched_info; |
1da177e4 | 680 | |
5eca1c10 | 681 | struct list_head tasks; |
806c09a7 | 682 | #ifdef CONFIG_SMP |
5eca1c10 IM |
683 | struct plist_node pushable_tasks; |
684 | struct rb_node pushable_dl_tasks; | |
806c09a7 | 685 | #endif |
1da177e4 | 686 | |
5eca1c10 IM |
687 | struct mm_struct *mm; |
688 | struct mm_struct *active_mm; | |
314ff785 IM |
689 | |
690 | /* Per-thread vma caching: */ | |
5eca1c10 | 691 | struct vmacache vmacache; |
314ff785 | 692 | |
5eca1c10 IM |
693 | #ifdef SPLIT_RSS_COUNTING |
694 | struct task_rss_stat rss_stat; | |
34e55232 | 695 | #endif |
5eca1c10 IM |
696 | int exit_state; |
697 | int exit_code; | |
698 | int exit_signal; | |
699 | /* The signal sent when the parent dies: */ | |
700 | int pdeath_signal; | |
701 | /* JOBCTL_*, siglock protected: */ | |
702 | unsigned long jobctl; | |
703 | ||
704 | /* Used for emulating ABI behavior of previous Linux versions: */ | |
705 | unsigned int personality; | |
706 | ||
707 | /* Scheduler bits, serialized by scheduler locks: */ | |
708 | unsigned sched_reset_on_fork:1; | |
709 | unsigned sched_contributes_to_load:1; | |
710 | unsigned sched_migrated:1; | |
711 | unsigned sched_remote_wakeup:1; | |
eb414681 JW |
712 | #ifdef CONFIG_PSI |
713 | unsigned sched_psi_wake_requeue:1; | |
714 | #endif | |
715 | ||
5eca1c10 IM |
716 | /* Force alignment to the next boundary: */ |
717 | unsigned :0; | |
718 | ||
719 | /* Unserialized, strictly 'current' */ | |
720 | ||
721 | /* Bit to tell LSMs we're in execve(): */ | |
722 | unsigned in_execve:1; | |
723 | unsigned in_iowait:1; | |
724 | #ifndef TIF_RESTORE_SIGMASK | |
725 | unsigned restore_sigmask:1; | |
7e781418 | 726 | #endif |
626ebc41 | 727 | #ifdef CONFIG_MEMCG |
29ef680a | 728 | unsigned in_user_fault:1; |
127424c8 | 729 | #endif |
ff303e66 | 730 | #ifdef CONFIG_COMPAT_BRK |
5eca1c10 | 731 | unsigned brk_randomized:1; |
ff303e66 | 732 | #endif |
77f88796 TH |
733 | #ifdef CONFIG_CGROUPS |
734 | /* disallow userland-initiated cgroup migration */ | |
735 | unsigned no_cgroup_migration:1; | |
736 | #endif | |
d09d8df3 JB |
737 | #ifdef CONFIG_BLK_CGROUP |
738 | /* to be used once the psi infrastructure lands upstream. */ | |
739 | unsigned use_memdelay:1; | |
740 | #endif | |
6f185c29 | 741 | |
9da3f2b7 JH |
742 | /* |
743 | * May usercopy functions fault on kernel addresses? | |
744 | * This is not just a single bit because this can potentially nest. | |
745 | */ | |
746 | unsigned int kernel_uaccess_faults_ok; | |
747 | ||
5eca1c10 | 748 | unsigned long atomic_flags; /* Flags requiring atomic access. */ |
1d4457f9 | 749 | |
5eca1c10 | 750 | struct restart_block restart_block; |
f56141e3 | 751 | |
5eca1c10 IM |
752 | pid_t pid; |
753 | pid_t tgid; | |
0a425405 | 754 | |
050e9baa | 755 | #ifdef CONFIG_STACKPROTECTOR |
5eca1c10 IM |
756 | /* Canary value for the -fstack-protector GCC feature: */ |
757 | unsigned long stack_canary; | |
1314562a | 758 | #endif |
4d1d61a6 | 759 | /* |
5eca1c10 | 760 | * Pointers to the (original) parent process, youngest child, younger sibling, |
4d1d61a6 | 761 | * older sibling, respectively. (p->father can be replaced with |
f470021a | 762 | * p->real_parent->pid) |
1da177e4 | 763 | */ |
5eca1c10 IM |
764 | |
765 | /* Real parent process: */ | |
766 | struct task_struct __rcu *real_parent; | |
767 | ||
768 | /* Recipient of SIGCHLD, wait4() reports: */ | |
769 | struct task_struct __rcu *parent; | |
770 | ||
1da177e4 | 771 | /* |
5eca1c10 | 772 | * Children/sibling form the list of natural children: |
1da177e4 | 773 | */ |
5eca1c10 IM |
774 | struct list_head children; |
775 | struct list_head sibling; | |
776 | struct task_struct *group_leader; | |
1da177e4 | 777 | |
f470021a | 778 | /* |
5eca1c10 IM |
779 | * 'ptraced' is the list of tasks this task is using ptrace() on. |
780 | * | |
f470021a | 781 | * This includes both natural children and PTRACE_ATTACH targets. |
5eca1c10 | 782 | * 'ptrace_entry' is this task's link on the p->parent->ptraced list. |
f470021a | 783 | */ |
5eca1c10 IM |
784 | struct list_head ptraced; |
785 | struct list_head ptrace_entry; | |
f470021a | 786 | |
1da177e4 | 787 | /* PID/PID hash table linkage. */ |
2c470475 EB |
788 | struct pid *thread_pid; |
789 | struct hlist_node pid_links[PIDTYPE_MAX]; | |
5eca1c10 IM |
790 | struct list_head thread_group; |
791 | struct list_head thread_node; | |
792 | ||
793 | struct completion *vfork_done; | |
1da177e4 | 794 | |
5eca1c10 IM |
795 | /* CLONE_CHILD_SETTID: */ |
796 | int __user *set_child_tid; | |
1da177e4 | 797 | |
5eca1c10 IM |
798 | /* CLONE_CHILD_CLEARTID: */ |
799 | int __user *clear_child_tid; | |
800 | ||
801 | u64 utime; | |
802 | u64 stime; | |
40565b5a | 803 | #ifdef CONFIG_ARCH_HAS_SCALED_CPUTIME |
5eca1c10 IM |
804 | u64 utimescaled; |
805 | u64 stimescaled; | |
40565b5a | 806 | #endif |
5eca1c10 IM |
807 | u64 gtime; |
808 | struct prev_cputime prev_cputime; | |
6a61671b | 809 | #ifdef CONFIG_VIRT_CPU_ACCOUNTING_GEN |
bac5b6b6 | 810 | struct vtime vtime; |
d99ca3b9 | 811 | #endif |
d027d45d FW |
812 | |
813 | #ifdef CONFIG_NO_HZ_FULL | |
5eca1c10 | 814 | atomic_t tick_dep_mask; |
d027d45d | 815 | #endif |
5eca1c10 IM |
816 | /* Context switch counts: */ |
817 | unsigned long nvcsw; | |
818 | unsigned long nivcsw; | |
819 | ||
820 | /* Monotonic time in nsecs: */ | |
821 | u64 start_time; | |
822 | ||
823 | /* Boot based time in nsecs: */ | |
824 | u64 real_start_time; | |
825 | ||
826 | /* MM fault and swap info: this can arguably be seen as either mm-specific or thread-specific: */ | |
827 | unsigned long min_flt; | |
828 | unsigned long maj_flt; | |
1da177e4 | 829 | |
b18b6a9c | 830 | #ifdef CONFIG_POSIX_TIMERS |
5eca1c10 IM |
831 | struct task_cputime cputime_expires; |
832 | struct list_head cpu_timers[3]; | |
b18b6a9c | 833 | #endif |
1da177e4 | 834 | |
5eca1c10 IM |
835 | /* Process credentials: */ |
836 | ||
837 | /* Tracer's credentials at attach: */ | |
838 | const struct cred __rcu *ptracer_cred; | |
839 | ||
840 | /* Objective and real subjective task credentials (COW): */ | |
841 | const struct cred __rcu *real_cred; | |
842 | ||
843 | /* Effective (overridable) subjective task credentials (COW): */ | |
844 | const struct cred __rcu *cred; | |
845 | ||
846 | /* | |
847 | * executable name, excluding path. | |
848 | * | |
849 | * - normally initialized setup_new_exec() | |
850 | * - access it with [gs]et_task_comm() | |
851 | * - lock it with task_lock() | |
852 | */ | |
853 | char comm[TASK_COMM_LEN]; | |
854 | ||
855 | struct nameidata *nameidata; | |
856 | ||
3d5b6fcc | 857 | #ifdef CONFIG_SYSVIPC |
5eca1c10 IM |
858 | struct sysv_sem sysvsem; |
859 | struct sysv_shm sysvshm; | |
3d5b6fcc | 860 | #endif |
e162b39a | 861 | #ifdef CONFIG_DETECT_HUNG_TASK |
5eca1c10 | 862 | unsigned long last_switch_count; |
a2e51445 | 863 | unsigned long last_switch_time; |
82a1fcb9 | 864 | #endif |
5eca1c10 IM |
865 | /* Filesystem information: */ |
866 | struct fs_struct *fs; | |
867 | ||
868 | /* Open file information: */ | |
869 | struct files_struct *files; | |
870 | ||
871 | /* Namespaces: */ | |
872 | struct nsproxy *nsproxy; | |
873 | ||
874 | /* Signal handlers: */ | |
875 | struct signal_struct *signal; | |
876 | struct sighand_struct *sighand; | |
877 | sigset_t blocked; | |
878 | sigset_t real_blocked; | |
879 | /* Restored if set_restore_sigmask() was used: */ | |
880 | sigset_t saved_sigmask; | |
881 | struct sigpending pending; | |
882 | unsigned long sas_ss_sp; | |
883 | size_t sas_ss_size; | |
884 | unsigned int sas_ss_flags; | |
885 | ||
886 | struct callback_head *task_works; | |
887 | ||
888 | struct audit_context *audit_context; | |
bfef93a5 | 889 | #ifdef CONFIG_AUDITSYSCALL |
5eca1c10 IM |
890 | kuid_t loginuid; |
891 | unsigned int sessionid; | |
bfef93a5 | 892 | #endif |
5eca1c10 IM |
893 | struct seccomp seccomp; |
894 | ||
895 | /* Thread group tracking: */ | |
896 | u32 parent_exec_id; | |
897 | u32 self_exec_id; | |
1da177e4 | 898 | |
5eca1c10 IM |
899 | /* Protection against (de-)allocation: mm, files, fs, tty, keyrings, mems_allowed, mempolicy: */ |
900 | spinlock_t alloc_lock; | |
1da177e4 | 901 | |
b29739f9 | 902 | /* Protection of the PI data structures: */ |
5eca1c10 | 903 | raw_spinlock_t pi_lock; |
b29739f9 | 904 | |
5eca1c10 | 905 | struct wake_q_node wake_q; |
76751049 | 906 | |
23f78d4a | 907 | #ifdef CONFIG_RT_MUTEXES |
5eca1c10 | 908 | /* PI waiters blocked on a rt_mutex held by this task: */ |
a23ba907 | 909 | struct rb_root_cached pi_waiters; |
e96a7705 XP |
910 | /* Updated under owner's pi_lock and rq lock */ |
911 | struct task_struct *pi_top_task; | |
5eca1c10 IM |
912 | /* Deadlock detection and priority inheritance handling: */ |
913 | struct rt_mutex_waiter *pi_blocked_on; | |
23f78d4a IM |
914 | #endif |
915 | ||
408894ee | 916 | #ifdef CONFIG_DEBUG_MUTEXES |
5eca1c10 IM |
917 | /* Mutex deadlock detection: */ |
918 | struct mutex_waiter *blocked_on; | |
408894ee | 919 | #endif |
5eca1c10 | 920 | |
de30a2b3 | 921 | #ifdef CONFIG_TRACE_IRQFLAGS |
5eca1c10 IM |
922 | unsigned int irq_events; |
923 | unsigned long hardirq_enable_ip; | |
924 | unsigned long hardirq_disable_ip; | |
925 | unsigned int hardirq_enable_event; | |
926 | unsigned int hardirq_disable_event; | |
927 | int hardirqs_enabled; | |
928 | int hardirq_context; | |
929 | unsigned long softirq_disable_ip; | |
930 | unsigned long softirq_enable_ip; | |
931 | unsigned int softirq_disable_event; | |
932 | unsigned int softirq_enable_event; | |
933 | int softirqs_enabled; | |
934 | int softirq_context; | |
de30a2b3 | 935 | #endif |
5eca1c10 | 936 | |
fbb9ce95 | 937 | #ifdef CONFIG_LOCKDEP |
5eca1c10 IM |
938 | # define MAX_LOCK_DEPTH 48UL |
939 | u64 curr_chain_key; | |
940 | int lockdep_depth; | |
941 | unsigned int lockdep_recursion; | |
942 | struct held_lock held_locks[MAX_LOCK_DEPTH]; | |
fbb9ce95 | 943 | #endif |
5eca1c10 | 944 | |
c6d30853 | 945 | #ifdef CONFIG_UBSAN |
5eca1c10 | 946 | unsigned int in_ubsan; |
c6d30853 | 947 | #endif |
408894ee | 948 | |
5eca1c10 IM |
949 | /* Journalling filesystem info: */ |
950 | void *journal_info; | |
1da177e4 | 951 | |
5eca1c10 IM |
952 | /* Stacked block device info: */ |
953 | struct bio_list *bio_list; | |
d89d8796 | 954 | |
73c10101 | 955 | #ifdef CONFIG_BLOCK |
5eca1c10 IM |
956 | /* Stack plugging: */ |
957 | struct blk_plug *plug; | |
73c10101 JA |
958 | #endif |
959 | ||
5eca1c10 IM |
960 | /* VM state: */ |
961 | struct reclaim_state *reclaim_state; | |
962 | ||
963 | struct backing_dev_info *backing_dev_info; | |
1da177e4 | 964 | |
5eca1c10 | 965 | struct io_context *io_context; |
1da177e4 | 966 | |
5eca1c10 IM |
967 | /* Ptrace state: */ |
968 | unsigned long ptrace_message; | |
ae7795bc | 969 | kernel_siginfo_t *last_siginfo; |
1da177e4 | 970 | |
5eca1c10 | 971 | struct task_io_accounting ioac; |
eb414681 JW |
972 | #ifdef CONFIG_PSI |
973 | /* Pressure stall state */ | |
974 | unsigned int psi_flags; | |
975 | #endif | |
5eca1c10 IM |
976 | #ifdef CONFIG_TASK_XACCT |
977 | /* Accumulated RSS usage: */ | |
978 | u64 acct_rss_mem1; | |
979 | /* Accumulated virtual memory usage: */ | |
980 | u64 acct_vm_mem1; | |
981 | /* stime + utime since last update: */ | |
982 | u64 acct_timexpd; | |
1da177e4 LT |
983 | #endif |
984 | #ifdef CONFIG_CPUSETS | |
5eca1c10 IM |
985 | /* Protected by ->alloc_lock: */ |
986 | nodemask_t mems_allowed; | |
987 | /* Seqence number to catch updates: */ | |
988 | seqcount_t mems_allowed_seq; | |
989 | int cpuset_mem_spread_rotor; | |
990 | int cpuset_slab_spread_rotor; | |
1da177e4 | 991 | #endif |
ddbcc7e8 | 992 | #ifdef CONFIG_CGROUPS |
5eca1c10 IM |
993 | /* Control Group info protected by css_set_lock: */ |
994 | struct css_set __rcu *cgroups; | |
995 | /* cg_list protected by css_set_lock and tsk->alloc_lock: */ | |
996 | struct list_head cg_list; | |
ddbcc7e8 | 997 | #endif |
90802938 | 998 | #ifdef CONFIG_X86_RESCTRL |
0734ded1 | 999 | u32 closid; |
d6aaba61 | 1000 | u32 rmid; |
e02737d5 | 1001 | #endif |
42b2dd0a | 1002 | #ifdef CONFIG_FUTEX |
5eca1c10 | 1003 | struct robust_list_head __user *robust_list; |
34f192c6 IM |
1004 | #ifdef CONFIG_COMPAT |
1005 | struct compat_robust_list_head __user *compat_robust_list; | |
1006 | #endif | |
5eca1c10 IM |
1007 | struct list_head pi_state_list; |
1008 | struct futex_pi_state *pi_state_cache; | |
c7aceaba | 1009 | #endif |
cdd6c482 | 1010 | #ifdef CONFIG_PERF_EVENTS |
5eca1c10 IM |
1011 | struct perf_event_context *perf_event_ctxp[perf_nr_task_contexts]; |
1012 | struct mutex perf_event_mutex; | |
1013 | struct list_head perf_event_list; | |
a63eaf34 | 1014 | #endif |
8f47b187 | 1015 | #ifdef CONFIG_DEBUG_PREEMPT |
5eca1c10 | 1016 | unsigned long preempt_disable_ip; |
8f47b187 | 1017 | #endif |
c7aceaba | 1018 | #ifdef CONFIG_NUMA |
5eca1c10 IM |
1019 | /* Protected by alloc_lock: */ |
1020 | struct mempolicy *mempolicy; | |
45816682 | 1021 | short il_prev; |
5eca1c10 | 1022 | short pref_node_fork; |
42b2dd0a | 1023 | #endif |
cbee9f88 | 1024 | #ifdef CONFIG_NUMA_BALANCING |
5eca1c10 IM |
1025 | int numa_scan_seq; |
1026 | unsigned int numa_scan_period; | |
1027 | unsigned int numa_scan_period_max; | |
1028 | int numa_preferred_nid; | |
1029 | unsigned long numa_migrate_retry; | |
1030 | /* Migration stamp: */ | |
1031 | u64 node_stamp; | |
1032 | u64 last_task_numa_placement; | |
1033 | u64 last_sum_exec_runtime; | |
1034 | struct callback_head numa_work; | |
1035 | ||
5eca1c10 | 1036 | struct numa_group *numa_group; |
8c8a743c | 1037 | |
745d6147 | 1038 | /* |
44dba3d5 IM |
1039 | * numa_faults is an array split into four regions: |
1040 | * faults_memory, faults_cpu, faults_memory_buffer, faults_cpu_buffer | |
1041 | * in this precise order. | |
1042 | * | |
1043 | * faults_memory: Exponential decaying average of faults on a per-node | |
1044 | * basis. Scheduling placement decisions are made based on these | |
1045 | * counts. The values remain static for the duration of a PTE scan. | |
1046 | * faults_cpu: Track the nodes the process was running on when a NUMA | |
1047 | * hinting fault was incurred. | |
1048 | * faults_memory_buffer and faults_cpu_buffer: Record faults per node | |
1049 | * during the current scan window. When the scan completes, the counts | |
1050 | * in faults_memory and faults_cpu decay and these values are copied. | |
745d6147 | 1051 | */ |
5eca1c10 IM |
1052 | unsigned long *numa_faults; |
1053 | unsigned long total_numa_faults; | |
745d6147 | 1054 | |
04bb2f94 RR |
1055 | /* |
1056 | * numa_faults_locality tracks if faults recorded during the last | |
074c2381 MG |
1057 | * scan window were remote/local or failed to migrate. The task scan |
1058 | * period is adapted based on the locality of the faults with different | |
1059 | * weights depending on whether they were shared or private faults | |
04bb2f94 | 1060 | */ |
5eca1c10 | 1061 | unsigned long numa_faults_locality[3]; |
04bb2f94 | 1062 | |
5eca1c10 | 1063 | unsigned long numa_pages_migrated; |
cbee9f88 PZ |
1064 | #endif /* CONFIG_NUMA_BALANCING */ |
1065 | ||
d7822b1e MD |
1066 | #ifdef CONFIG_RSEQ |
1067 | struct rseq __user *rseq; | |
1068 | u32 rseq_len; | |
1069 | u32 rseq_sig; | |
1070 | /* | |
1071 | * RmW on rseq_event_mask must be performed atomically | |
1072 | * with respect to preemption. | |
1073 | */ | |
1074 | unsigned long rseq_event_mask; | |
1075 | #endif | |
1076 | ||
5eca1c10 | 1077 | struct tlbflush_unmap_batch tlb_ubc; |
72b252ae | 1078 | |
5eca1c10 | 1079 | struct rcu_head rcu; |
b92ce558 | 1080 | |
5eca1c10 IM |
1081 | /* Cache last used pipe for splice(): */ |
1082 | struct pipe_inode_info *splice_pipe; | |
5640f768 | 1083 | |
5eca1c10 | 1084 | struct page_frag task_frag; |
5640f768 | 1085 | |
47913d4e IM |
1086 | #ifdef CONFIG_TASK_DELAY_ACCT |
1087 | struct task_delay_info *delays; | |
f4f154fd | 1088 | #endif |
47913d4e | 1089 | |
f4f154fd | 1090 | #ifdef CONFIG_FAULT_INJECTION |
5eca1c10 | 1091 | int make_it_fail; |
9049f2f6 | 1092 | unsigned int fail_nth; |
ca74e92b | 1093 | #endif |
9d823e8f | 1094 | /* |
5eca1c10 IM |
1095 | * When (nr_dirtied >= nr_dirtied_pause), it's time to call |
1096 | * balance_dirty_pages() for a dirty throttling pause: | |
9d823e8f | 1097 | */ |
5eca1c10 IM |
1098 | int nr_dirtied; |
1099 | int nr_dirtied_pause; | |
1100 | /* Start of a write-and-pause period: */ | |
1101 | unsigned long dirty_paused_when; | |
9d823e8f | 1102 | |
9745512c | 1103 | #ifdef CONFIG_LATENCYTOP |
5eca1c10 IM |
1104 | int latency_record_count; |
1105 | struct latency_record latency_record[LT_SAVECOUNT]; | |
9745512c | 1106 | #endif |
6976675d | 1107 | /* |
5eca1c10 | 1108 | * Time slack values; these are used to round up poll() and |
6976675d AV |
1109 | * select() etc timeout values. These are in nanoseconds. |
1110 | */ | |
5eca1c10 IM |
1111 | u64 timer_slack_ns; |
1112 | u64 default_timer_slack_ns; | |
f8d570a4 | 1113 | |
0b24becc | 1114 | #ifdef CONFIG_KASAN |
5eca1c10 | 1115 | unsigned int kasan_depth; |
0b24becc | 1116 | #endif |
5eca1c10 | 1117 | |
fb52607a | 1118 | #ifdef CONFIG_FUNCTION_GRAPH_TRACER |
5eca1c10 IM |
1119 | /* Index of current stored address in ret_stack: */ |
1120 | int curr_ret_stack; | |
39eb456d | 1121 | int curr_ret_depth; |
5eca1c10 IM |
1122 | |
1123 | /* Stack of return addresses for return function tracing: */ | |
1124 | struct ftrace_ret_stack *ret_stack; | |
1125 | ||
1126 | /* Timestamp for last schedule: */ | |
1127 | unsigned long long ftrace_timestamp; | |
1128 | ||
f201ae23 FW |
1129 | /* |
1130 | * Number of functions that haven't been traced | |
5eca1c10 | 1131 | * because of depth overrun: |
f201ae23 | 1132 | */ |
5eca1c10 IM |
1133 | atomic_t trace_overrun; |
1134 | ||
1135 | /* Pause tracing: */ | |
1136 | atomic_t tracing_graph_pause; | |
f201ae23 | 1137 | #endif |
5eca1c10 | 1138 | |
ea4e2bc4 | 1139 | #ifdef CONFIG_TRACING |
5eca1c10 IM |
1140 | /* State flags for use by tracers: */ |
1141 | unsigned long trace; | |
1142 | ||
1143 | /* Bitmask and counter of trace recursion: */ | |
1144 | unsigned long trace_recursion; | |
261842b7 | 1145 | #endif /* CONFIG_TRACING */ |
5eca1c10 | 1146 | |
5c9a8750 | 1147 | #ifdef CONFIG_KCOV |
5eca1c10 | 1148 | /* Coverage collection mode enabled for this task (0 if disabled): */ |
0ed557aa | 1149 | unsigned int kcov_mode; |
5eca1c10 IM |
1150 | |
1151 | /* Size of the kcov_area: */ | |
1152 | unsigned int kcov_size; | |
1153 | ||
1154 | /* Buffer for coverage collection: */ | |
1155 | void *kcov_area; | |
1156 | ||
1157 | /* KCOV descriptor wired with this task or NULL: */ | |
1158 | struct kcov *kcov; | |
5c9a8750 | 1159 | #endif |
5eca1c10 | 1160 | |
6f185c29 | 1161 | #ifdef CONFIG_MEMCG |
5eca1c10 IM |
1162 | struct mem_cgroup *memcg_in_oom; |
1163 | gfp_t memcg_oom_gfp_mask; | |
1164 | int memcg_oom_order; | |
b23afb93 | 1165 | |
5eca1c10 IM |
1166 | /* Number of pages to reclaim on returning to userland: */ |
1167 | unsigned int memcg_nr_pages_over_high; | |
d46eb14b SB |
1168 | |
1169 | /* Used by memcontrol for targeted memcg charge: */ | |
1170 | struct mem_cgroup *active_memcg; | |
569b846d | 1171 | #endif |
5eca1c10 | 1172 | |
d09d8df3 JB |
1173 | #ifdef CONFIG_BLK_CGROUP |
1174 | struct request_queue *throttle_queue; | |
1175 | #endif | |
1176 | ||
0326f5a9 | 1177 | #ifdef CONFIG_UPROBES |
5eca1c10 | 1178 | struct uprobe_task *utask; |
0326f5a9 | 1179 | #endif |
cafe5635 | 1180 | #if defined(CONFIG_BCACHE) || defined(CONFIG_BCACHE_MODULE) |
5eca1c10 IM |
1181 | unsigned int sequential_io; |
1182 | unsigned int sequential_io_avg; | |
cafe5635 | 1183 | #endif |
8eb23b9f | 1184 | #ifdef CONFIG_DEBUG_ATOMIC_SLEEP |
5eca1c10 | 1185 | unsigned long task_state_change; |
8eb23b9f | 1186 | #endif |
5eca1c10 | 1187 | int pagefault_disabled; |
03049269 | 1188 | #ifdef CONFIG_MMU |
5eca1c10 | 1189 | struct task_struct *oom_reaper_list; |
03049269 | 1190 | #endif |
ba14a194 | 1191 | #ifdef CONFIG_VMAP_STACK |
5eca1c10 | 1192 | struct vm_struct *stack_vm_area; |
ba14a194 | 1193 | #endif |
68f24b08 | 1194 | #ifdef CONFIG_THREAD_INFO_IN_TASK |
5eca1c10 IM |
1195 | /* A live task holds one reference: */ |
1196 | atomic_t stack_refcount; | |
d83a7cb3 JP |
1197 | #endif |
1198 | #ifdef CONFIG_LIVEPATCH | |
1199 | int patch_state; | |
0302e28d | 1200 | #endif |
e4e55b47 TH |
1201 | #ifdef CONFIG_SECURITY |
1202 | /* Used by LSM modules for access restriction: */ | |
1203 | void *security; | |
68f24b08 | 1204 | #endif |
29e48ce8 | 1205 | |
afaef01c AP |
1206 | #ifdef CONFIG_GCC_PLUGIN_STACKLEAK |
1207 | unsigned long lowest_stack; | |
c8d12627 | 1208 | unsigned long prev_lowest_stack; |
afaef01c AP |
1209 | #endif |
1210 | ||
29e48ce8 KC |
1211 | /* |
1212 | * New fields for task_struct should be added above here, so that | |
1213 | * they are included in the randomized portion of task_struct. | |
1214 | */ | |
1215 | randomized_struct_fields_end | |
1216 | ||
5eca1c10 IM |
1217 | /* CPU-specific state of this task: */ |
1218 | struct thread_struct thread; | |
1219 | ||
1220 | /* | |
1221 | * WARNING: on x86, 'thread_struct' contains a variable-sized | |
1222 | * structure. It *MUST* be at the end of 'task_struct'. | |
1223 | * | |
1224 | * Do not put anything below here! | |
1225 | */ | |
1da177e4 LT |
1226 | }; |
1227 | ||
e868171a | 1228 | static inline struct pid *task_pid(struct task_struct *task) |
22c935f4 | 1229 | { |
2c470475 | 1230 | return task->thread_pid; |
22c935f4 EB |
1231 | } |
1232 | ||
7af57294 PE |
1233 | /* |
1234 | * the helpers to get the task's different pids as they are seen | |
1235 | * from various namespaces | |
1236 | * | |
1237 | * task_xid_nr() : global id, i.e. the id seen from the init namespace; | |
44c4e1b2 EB |
1238 | * task_xid_vnr() : virtual id, i.e. the id seen from the pid namespace of |
1239 | * current. | |
7af57294 PE |
1240 | * task_xid_nr_ns() : id seen from the ns specified; |
1241 | * | |
7af57294 PE |
1242 | * see also pid_nr() etc in include/linux/pid.h |
1243 | */ | |
5eca1c10 | 1244 | pid_t __task_pid_nr_ns(struct task_struct *task, enum pid_type type, struct pid_namespace *ns); |
7af57294 | 1245 | |
e868171a | 1246 | static inline pid_t task_pid_nr(struct task_struct *tsk) |
7af57294 PE |
1247 | { |
1248 | return tsk->pid; | |
1249 | } | |
1250 | ||
5eca1c10 | 1251 | static inline pid_t task_pid_nr_ns(struct task_struct *tsk, struct pid_namespace *ns) |
52ee2dfd ON |
1252 | { |
1253 | return __task_pid_nr_ns(tsk, PIDTYPE_PID, ns); | |
1254 | } | |
7af57294 PE |
1255 | |
1256 | static inline pid_t task_pid_vnr(struct task_struct *tsk) | |
1257 | { | |
52ee2dfd | 1258 | return __task_pid_nr_ns(tsk, PIDTYPE_PID, NULL); |
7af57294 PE |
1259 | } |
1260 | ||
1261 | ||
e868171a | 1262 | static inline pid_t task_tgid_nr(struct task_struct *tsk) |
7af57294 PE |
1263 | { |
1264 | return tsk->tgid; | |
1265 | } | |
1266 | ||
5eca1c10 IM |
1267 | /** |
1268 | * pid_alive - check that a task structure is not stale | |
1269 | * @p: Task structure to be checked. | |
1270 | * | |
1271 | * Test if a process is not yet dead (at most zombie state) | |
1272 | * If pid_alive fails, then pointers within the task structure | |
1273 | * can be stale and must not be dereferenced. | |
1274 | * | |
1275 | * Return: 1 if the process is alive. 0 otherwise. | |
1276 | */ | |
1277 | static inline int pid_alive(const struct task_struct *p) | |
1278 | { | |
2c470475 | 1279 | return p->thread_pid != NULL; |
5eca1c10 | 1280 | } |
7af57294 | 1281 | |
5eca1c10 | 1282 | static inline pid_t task_pgrp_nr_ns(struct task_struct *tsk, struct pid_namespace *ns) |
7af57294 | 1283 | { |
52ee2dfd | 1284 | return __task_pid_nr_ns(tsk, PIDTYPE_PGID, ns); |
7af57294 PE |
1285 | } |
1286 | ||
7af57294 PE |
1287 | static inline pid_t task_pgrp_vnr(struct task_struct *tsk) |
1288 | { | |
52ee2dfd | 1289 | return __task_pid_nr_ns(tsk, PIDTYPE_PGID, NULL); |
7af57294 PE |
1290 | } |
1291 | ||
1292 | ||
5eca1c10 | 1293 | static inline pid_t task_session_nr_ns(struct task_struct *tsk, struct pid_namespace *ns) |
7af57294 | 1294 | { |
52ee2dfd | 1295 | return __task_pid_nr_ns(tsk, PIDTYPE_SID, ns); |
7af57294 PE |
1296 | } |
1297 | ||
7af57294 PE |
1298 | static inline pid_t task_session_vnr(struct task_struct *tsk) |
1299 | { | |
52ee2dfd | 1300 | return __task_pid_nr_ns(tsk, PIDTYPE_SID, NULL); |
7af57294 PE |
1301 | } |
1302 | ||
dd1c1f2f ON |
1303 | static inline pid_t task_tgid_nr_ns(struct task_struct *tsk, struct pid_namespace *ns) |
1304 | { | |
6883f81a | 1305 | return __task_pid_nr_ns(tsk, PIDTYPE_TGID, ns); |
dd1c1f2f ON |
1306 | } |
1307 | ||
1308 | static inline pid_t task_tgid_vnr(struct task_struct *tsk) | |
1309 | { | |
6883f81a | 1310 | return __task_pid_nr_ns(tsk, PIDTYPE_TGID, NULL); |
dd1c1f2f ON |
1311 | } |
1312 | ||
1313 | static inline pid_t task_ppid_nr_ns(const struct task_struct *tsk, struct pid_namespace *ns) | |
1314 | { | |
1315 | pid_t pid = 0; | |
1316 | ||
1317 | rcu_read_lock(); | |
1318 | if (pid_alive(tsk)) | |
1319 | pid = task_tgid_nr_ns(rcu_dereference(tsk->real_parent), ns); | |
1320 | rcu_read_unlock(); | |
1321 | ||
1322 | return pid; | |
1323 | } | |
1324 | ||
1325 | static inline pid_t task_ppid_nr(const struct task_struct *tsk) | |
1326 | { | |
1327 | return task_ppid_nr_ns(tsk, &init_pid_ns); | |
1328 | } | |
1329 | ||
5eca1c10 | 1330 | /* Obsolete, do not use: */ |
1b0f7ffd ON |
1331 | static inline pid_t task_pgrp_nr(struct task_struct *tsk) |
1332 | { | |
1333 | return task_pgrp_nr_ns(tsk, &init_pid_ns); | |
1334 | } | |
7af57294 | 1335 | |
06eb6184 PZ |
1336 | #define TASK_REPORT_IDLE (TASK_REPORT + 1) |
1337 | #define TASK_REPORT_MAX (TASK_REPORT_IDLE << 1) | |
1338 | ||
1d48b080 | 1339 | static inline unsigned int task_state_index(struct task_struct *tsk) |
20435d84 | 1340 | { |
1593baab PZ |
1341 | unsigned int tsk_state = READ_ONCE(tsk->state); |
1342 | unsigned int state = (tsk_state | tsk->exit_state) & TASK_REPORT; | |
20435d84 | 1343 | |
06eb6184 PZ |
1344 | BUILD_BUG_ON_NOT_POWER_OF_2(TASK_REPORT_MAX); |
1345 | ||
06eb6184 PZ |
1346 | if (tsk_state == TASK_IDLE) |
1347 | state = TASK_REPORT_IDLE; | |
1348 | ||
1593baab PZ |
1349 | return fls(state); |
1350 | } | |
1351 | ||
1d48b080 | 1352 | static inline char task_index_to_char(unsigned int state) |
1593baab | 1353 | { |
8ef9925b | 1354 | static const char state_char[] = "RSDTtXZPI"; |
1593baab | 1355 | |
06eb6184 | 1356 | BUILD_BUG_ON(1 + ilog2(TASK_REPORT_MAX) != sizeof(state_char) - 1); |
20435d84 | 1357 | |
1593baab PZ |
1358 | return state_char[state]; |
1359 | } | |
1360 | ||
1361 | static inline char task_state_to_char(struct task_struct *tsk) | |
1362 | { | |
1d48b080 | 1363 | return task_index_to_char(task_state_index(tsk)); |
20435d84 XX |
1364 | } |
1365 | ||
f400e198 | 1366 | /** |
570f5241 SS |
1367 | * is_global_init - check if a task structure is init. Since init |
1368 | * is free to have sub-threads we need to check tgid. | |
3260259f HK |
1369 | * @tsk: Task structure to be checked. |
1370 | * | |
1371 | * Check if a task structure is the first user space task the kernel created. | |
e69f6186 YB |
1372 | * |
1373 | * Return: 1 if the task structure is init. 0 otherwise. | |
b460cbc5 | 1374 | */ |
e868171a | 1375 | static inline int is_global_init(struct task_struct *tsk) |
b461cc03 | 1376 | { |
570f5241 | 1377 | return task_tgid_nr(tsk) == 1; |
b461cc03 | 1378 | } |
b460cbc5 | 1379 | |
9ec52099 CLG |
1380 | extern struct pid *cad_pid; |
1381 | ||
1da177e4 LT |
1382 | /* |
1383 | * Per process flags | |
1384 | */ | |
5eca1c10 IM |
1385 | #define PF_IDLE 0x00000002 /* I am an IDLE thread */ |
1386 | #define PF_EXITING 0x00000004 /* Getting shut down */ | |
1387 | #define PF_EXITPIDONE 0x00000008 /* PI exit done on shut down */ | |
1388 | #define PF_VCPU 0x00000010 /* I'm a virtual CPU */ | |
1389 | #define PF_WQ_WORKER 0x00000020 /* I'm a workqueue worker */ | |
1390 | #define PF_FORKNOEXEC 0x00000040 /* Forked but didn't exec */ | |
1391 | #define PF_MCE_PROCESS 0x00000080 /* Process policy on mce errors */ | |
1392 | #define PF_SUPERPRIV 0x00000100 /* Used super-user privileges */ | |
1393 | #define PF_DUMPCORE 0x00000200 /* Dumped core */ | |
1394 | #define PF_SIGNALED 0x00000400 /* Killed by a signal */ | |
1395 | #define PF_MEMALLOC 0x00000800 /* Allocating memory */ | |
1396 | #define PF_NPROC_EXCEEDED 0x00001000 /* set_user() noticed that RLIMIT_NPROC was exceeded */ | |
1397 | #define PF_USED_MATH 0x00002000 /* If unset the fpu must be initialized before use */ | |
1398 | #define PF_USED_ASYNC 0x00004000 /* Used async_schedule*(), used by module init */ | |
1399 | #define PF_NOFREEZE 0x00008000 /* This thread should not be frozen */ | |
1400 | #define PF_FROZEN 0x00010000 /* Frozen for system suspend */ | |
7dea19f9 MH |
1401 | #define PF_KSWAPD 0x00020000 /* I am kswapd */ |
1402 | #define PF_MEMALLOC_NOFS 0x00040000 /* All allocation requests will inherit GFP_NOFS */ | |
1403 | #define PF_MEMALLOC_NOIO 0x00080000 /* All allocation requests will inherit GFP_NOIO */ | |
5eca1c10 IM |
1404 | #define PF_LESS_THROTTLE 0x00100000 /* Throttle me less: I clean memory */ |
1405 | #define PF_KTHREAD 0x00200000 /* I am a kernel thread */ | |
1406 | #define PF_RANDOMIZE 0x00400000 /* Randomize virtual address space */ | |
1407 | #define PF_SWAPWRITE 0x00800000 /* Allowed to write to swap */ | |
eb414681 | 1408 | #define PF_MEMSTALL 0x01000000 /* Stalled due to lack of memory */ |
73ab1cb2 | 1409 | #define PF_UMH 0x02000000 /* I'm an Usermodehelper process */ |
5eca1c10 IM |
1410 | #define PF_NO_SETAFFINITY 0x04000000 /* Userland is not allowed to meddle with cpus_allowed */ |
1411 | #define PF_MCE_EARLY 0x08000000 /* Early kill for mce process policy */ | |
5eca1c10 IM |
1412 | #define PF_FREEZER_SKIP 0x40000000 /* Freezer should not count it as freezable */ |
1413 | #define PF_SUSPEND_TASK 0x80000000 /* This thread called freeze_processes() and should not be frozen */ | |
1da177e4 LT |
1414 | |
1415 | /* | |
1416 | * Only the _current_ task can read/write to tsk->flags, but other | |
1417 | * tasks can access tsk->flags in readonly mode for example | |
1418 | * with tsk_used_math (like during threaded core dumping). | |
1419 | * There is however an exception to this rule during ptrace | |
1420 | * or during fork: the ptracer task is allowed to write to the | |
1421 | * child->flags of its traced child (same goes for fork, the parent | |
1422 | * can write to the child->flags), because we're guaranteed the | |
1423 | * child is not running and in turn not changing child->flags | |
1424 | * at the same time the parent does it. | |
1425 | */ | |
5eca1c10 IM |
1426 | #define clear_stopped_child_used_math(child) do { (child)->flags &= ~PF_USED_MATH; } while (0) |
1427 | #define set_stopped_child_used_math(child) do { (child)->flags |= PF_USED_MATH; } while (0) | |
1428 | #define clear_used_math() clear_stopped_child_used_math(current) | |
1429 | #define set_used_math() set_stopped_child_used_math(current) | |
1430 | ||
1da177e4 LT |
1431 | #define conditional_stopped_child_used_math(condition, child) \ |
1432 | do { (child)->flags &= ~PF_USED_MATH, (child)->flags |= (condition) ? PF_USED_MATH : 0; } while (0) | |
5eca1c10 IM |
1433 | |
1434 | #define conditional_used_math(condition) conditional_stopped_child_used_math(condition, current) | |
1435 | ||
1da177e4 LT |
1436 | #define copy_to_stopped_child_used_math(child) \ |
1437 | do { (child)->flags &= ~PF_USED_MATH, (child)->flags |= current->flags & PF_USED_MATH; } while (0) | |
5eca1c10 | 1438 | |
1da177e4 | 1439 | /* NOTE: this will return 0 or PF_USED_MATH, it will never return 1 */ |
5eca1c10 IM |
1440 | #define tsk_used_math(p) ((p)->flags & PF_USED_MATH) |
1441 | #define used_math() tsk_used_math(current) | |
1da177e4 | 1442 | |
62ec05dd TG |
1443 | static inline bool is_percpu_thread(void) |
1444 | { | |
1445 | #ifdef CONFIG_SMP | |
1446 | return (current->flags & PF_NO_SETAFFINITY) && | |
1447 | (current->nr_cpus_allowed == 1); | |
1448 | #else | |
1449 | return true; | |
1450 | #endif | |
1451 | } | |
1452 | ||
1d4457f9 | 1453 | /* Per-process atomic flags. */ |
5eca1c10 IM |
1454 | #define PFA_NO_NEW_PRIVS 0 /* May not gain new privileges. */ |
1455 | #define PFA_SPREAD_PAGE 1 /* Spread page cache over cpuset */ | |
1456 | #define PFA_SPREAD_SLAB 2 /* Spread some slab caches over cpuset */ | |
356e4bff TG |
1457 | #define PFA_SPEC_SSB_DISABLE 3 /* Speculative Store Bypass disabled */ |
1458 | #define PFA_SPEC_SSB_FORCE_DISABLE 4 /* Speculative Store Bypass force disabled*/ | |
9137bb27 TG |
1459 | #define PFA_SPEC_IB_DISABLE 5 /* Indirect branch speculation restricted */ |
1460 | #define PFA_SPEC_IB_FORCE_DISABLE 6 /* Indirect branch speculation permanently restricted */ | |
1d4457f9 | 1461 | |
e0e5070b ZL |
1462 | #define TASK_PFA_TEST(name, func) \ |
1463 | static inline bool task_##func(struct task_struct *p) \ | |
1464 | { return test_bit(PFA_##name, &p->atomic_flags); } | |
5eca1c10 | 1465 | |
e0e5070b ZL |
1466 | #define TASK_PFA_SET(name, func) \ |
1467 | static inline void task_set_##func(struct task_struct *p) \ | |
1468 | { set_bit(PFA_##name, &p->atomic_flags); } | |
5eca1c10 | 1469 | |
e0e5070b ZL |
1470 | #define TASK_PFA_CLEAR(name, func) \ |
1471 | static inline void task_clear_##func(struct task_struct *p) \ | |
1472 | { clear_bit(PFA_##name, &p->atomic_flags); } | |
1473 | ||
1474 | TASK_PFA_TEST(NO_NEW_PRIVS, no_new_privs) | |
1475 | TASK_PFA_SET(NO_NEW_PRIVS, no_new_privs) | |
1d4457f9 | 1476 | |
2ad654bc ZL |
1477 | TASK_PFA_TEST(SPREAD_PAGE, spread_page) |
1478 | TASK_PFA_SET(SPREAD_PAGE, spread_page) | |
1479 | TASK_PFA_CLEAR(SPREAD_PAGE, spread_page) | |
1480 | ||
1481 | TASK_PFA_TEST(SPREAD_SLAB, spread_slab) | |
1482 | TASK_PFA_SET(SPREAD_SLAB, spread_slab) | |
1483 | TASK_PFA_CLEAR(SPREAD_SLAB, spread_slab) | |
1d4457f9 | 1484 | |
356e4bff TG |
1485 | TASK_PFA_TEST(SPEC_SSB_DISABLE, spec_ssb_disable) |
1486 | TASK_PFA_SET(SPEC_SSB_DISABLE, spec_ssb_disable) | |
1487 | TASK_PFA_CLEAR(SPEC_SSB_DISABLE, spec_ssb_disable) | |
1488 | ||
1489 | TASK_PFA_TEST(SPEC_SSB_FORCE_DISABLE, spec_ssb_force_disable) | |
1490 | TASK_PFA_SET(SPEC_SSB_FORCE_DISABLE, spec_ssb_force_disable) | |
1491 | ||
9137bb27 TG |
1492 | TASK_PFA_TEST(SPEC_IB_DISABLE, spec_ib_disable) |
1493 | TASK_PFA_SET(SPEC_IB_DISABLE, spec_ib_disable) | |
1494 | TASK_PFA_CLEAR(SPEC_IB_DISABLE, spec_ib_disable) | |
1495 | ||
1496 | TASK_PFA_TEST(SPEC_IB_FORCE_DISABLE, spec_ib_force_disable) | |
1497 | TASK_PFA_SET(SPEC_IB_FORCE_DISABLE, spec_ib_force_disable) | |
1498 | ||
5eca1c10 | 1499 | static inline void |
717a94b5 | 1500 | current_restore_flags(unsigned long orig_flags, unsigned long flags) |
907aed48 | 1501 | { |
717a94b5 N |
1502 | current->flags &= ~flags; |
1503 | current->flags |= orig_flags & flags; | |
907aed48 MG |
1504 | } |
1505 | ||
5eca1c10 IM |
1506 | extern int cpuset_cpumask_can_shrink(const struct cpumask *cur, const struct cpumask *trial); |
1507 | extern int task_can_attach(struct task_struct *p, const struct cpumask *cs_cpus_allowed); | |
1da177e4 | 1508 | #ifdef CONFIG_SMP |
5eca1c10 IM |
1509 | extern void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask); |
1510 | extern int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask); | |
1da177e4 | 1511 | #else |
5eca1c10 | 1512 | static inline void do_set_cpus_allowed(struct task_struct *p, const struct cpumask *new_mask) |
1e1b6c51 KM |
1513 | { |
1514 | } | |
5eca1c10 | 1515 | static inline int set_cpus_allowed_ptr(struct task_struct *p, const struct cpumask *new_mask) |
1da177e4 | 1516 | { |
96f874e2 | 1517 | if (!cpumask_test_cpu(0, new_mask)) |
1da177e4 LT |
1518 | return -EINVAL; |
1519 | return 0; | |
1520 | } | |
1521 | #endif | |
e0ad9556 | 1522 | |
6d0d2878 CB |
1523 | #ifndef cpu_relax_yield |
1524 | #define cpu_relax_yield() cpu_relax() | |
1525 | #endif | |
1526 | ||
fa93384f | 1527 | extern int yield_to(struct task_struct *p, bool preempt); |
36c8b586 IM |
1528 | extern void set_user_nice(struct task_struct *p, long nice); |
1529 | extern int task_prio(const struct task_struct *p); | |
5eca1c10 | 1530 | |
d0ea0268 DY |
1531 | /** |
1532 | * task_nice - return the nice value of a given task. | |
1533 | * @p: the task in question. | |
1534 | * | |
1535 | * Return: The nice value [ -20 ... 0 ... 19 ]. | |
1536 | */ | |
1537 | static inline int task_nice(const struct task_struct *p) | |
1538 | { | |
1539 | return PRIO_TO_NICE((p)->static_prio); | |
1540 | } | |
5eca1c10 | 1541 | |
36c8b586 IM |
1542 | extern int can_nice(const struct task_struct *p, const int nice); |
1543 | extern int task_curr(const struct task_struct *p); | |
1da177e4 | 1544 | extern int idle_cpu(int cpu); |
943d355d | 1545 | extern int available_idle_cpu(int cpu); |
5eca1c10 IM |
1546 | extern int sched_setscheduler(struct task_struct *, int, const struct sched_param *); |
1547 | extern int sched_setscheduler_nocheck(struct task_struct *, int, const struct sched_param *); | |
1548 | extern int sched_setattr(struct task_struct *, const struct sched_attr *); | |
794a56eb | 1549 | extern int sched_setattr_nocheck(struct task_struct *, const struct sched_attr *); |
36c8b586 | 1550 | extern struct task_struct *idle_task(int cpu); |
5eca1c10 | 1551 | |
c4f30608 PM |
1552 | /** |
1553 | * is_idle_task - is the specified task an idle task? | |
fa757281 | 1554 | * @p: the task in question. |
e69f6186 YB |
1555 | * |
1556 | * Return: 1 if @p is an idle task. 0 otherwise. | |
c4f30608 | 1557 | */ |
7061ca3b | 1558 | static inline bool is_idle_task(const struct task_struct *p) |
c4f30608 | 1559 | { |
c1de45ca | 1560 | return !!(p->flags & PF_IDLE); |
c4f30608 | 1561 | } |
5eca1c10 | 1562 | |
36c8b586 | 1563 | extern struct task_struct *curr_task(int cpu); |
a458ae2e | 1564 | extern void ia64_set_curr_task(int cpu, struct task_struct *p); |
1da177e4 LT |
1565 | |
1566 | void yield(void); | |
1567 | ||
1da177e4 | 1568 | union thread_union { |
0500871f DH |
1569 | #ifndef CONFIG_ARCH_TASK_STRUCT_ON_STACK |
1570 | struct task_struct task; | |
1571 | #endif | |
c65eacbe | 1572 | #ifndef CONFIG_THREAD_INFO_IN_TASK |
1da177e4 | 1573 | struct thread_info thread_info; |
c65eacbe | 1574 | #endif |
1da177e4 LT |
1575 | unsigned long stack[THREAD_SIZE/sizeof(long)]; |
1576 | }; | |
1577 | ||
0500871f DH |
1578 | #ifndef CONFIG_THREAD_INFO_IN_TASK |
1579 | extern struct thread_info init_thread_info; | |
1580 | #endif | |
1581 | ||
1582 | extern unsigned long init_stack[THREAD_SIZE / sizeof(unsigned long)]; | |
1583 | ||
f3ac6067 IM |
1584 | #ifdef CONFIG_THREAD_INFO_IN_TASK |
1585 | static inline struct thread_info *task_thread_info(struct task_struct *task) | |
1586 | { | |
1587 | return &task->thread_info; | |
1588 | } | |
1589 | #elif !defined(__HAVE_THREAD_FUNCTIONS) | |
1590 | # define task_thread_info(task) ((struct thread_info *)(task)->stack) | |
1591 | #endif | |
1592 | ||
198fe21b PE |
1593 | /* |
1594 | * find a task by one of its numerical ids | |
1595 | * | |
198fe21b PE |
1596 | * find_task_by_pid_ns(): |
1597 | * finds a task by its pid in the specified namespace | |
228ebcbe PE |
1598 | * find_task_by_vpid(): |
1599 | * finds a task by its virtual pid | |
198fe21b | 1600 | * |
e49859e7 | 1601 | * see also find_vpid() etc in include/linux/pid.h |
198fe21b PE |
1602 | */ |
1603 | ||
228ebcbe | 1604 | extern struct task_struct *find_task_by_vpid(pid_t nr); |
5eca1c10 | 1605 | extern struct task_struct *find_task_by_pid_ns(pid_t nr, struct pid_namespace *ns); |
198fe21b | 1606 | |
2ee08260 MR |
1607 | /* |
1608 | * find a task by its virtual pid and get the task struct | |
1609 | */ | |
1610 | extern struct task_struct *find_get_task_by_vpid(pid_t nr); | |
1611 | ||
b3c97528 HH |
1612 | extern int wake_up_state(struct task_struct *tsk, unsigned int state); |
1613 | extern int wake_up_process(struct task_struct *tsk); | |
3e51e3ed | 1614 | extern void wake_up_new_task(struct task_struct *tsk); |
5eca1c10 | 1615 | |
1da177e4 | 1616 | #ifdef CONFIG_SMP |
5eca1c10 | 1617 | extern void kick_process(struct task_struct *tsk); |
1da177e4 | 1618 | #else |
5eca1c10 | 1619 | static inline void kick_process(struct task_struct *tsk) { } |
1da177e4 | 1620 | #endif |
1da177e4 | 1621 | |
82b89778 | 1622 | extern void __set_task_comm(struct task_struct *tsk, const char *from, bool exec); |
5eca1c10 | 1623 | |
82b89778 AH |
1624 | static inline void set_task_comm(struct task_struct *tsk, const char *from) |
1625 | { | |
1626 | __set_task_comm(tsk, from, false); | |
1627 | } | |
5eca1c10 | 1628 | |
3756f640 AB |
1629 | extern char *__get_task_comm(char *to, size_t len, struct task_struct *tsk); |
1630 | #define get_task_comm(buf, tsk) ({ \ | |
1631 | BUILD_BUG_ON(sizeof(buf) != TASK_COMM_LEN); \ | |
1632 | __get_task_comm(buf, sizeof(buf), tsk); \ | |
1633 | }) | |
1da177e4 LT |
1634 | |
1635 | #ifdef CONFIG_SMP | |
317f3941 | 1636 | void scheduler_ipi(void); |
85ba2d86 | 1637 | extern unsigned long wait_task_inactive(struct task_struct *, long match_state); |
1da177e4 | 1638 | #else |
184748cc | 1639 | static inline void scheduler_ipi(void) { } |
5eca1c10 | 1640 | static inline unsigned long wait_task_inactive(struct task_struct *p, long match_state) |
85ba2d86 RM |
1641 | { |
1642 | return 1; | |
1643 | } | |
1da177e4 LT |
1644 | #endif |
1645 | ||
5eca1c10 IM |
1646 | /* |
1647 | * Set thread flags in other task's structures. | |
1648 | * See asm/thread_info.h for TIF_xxxx flags available: | |
1da177e4 LT |
1649 | */ |
1650 | static inline void set_tsk_thread_flag(struct task_struct *tsk, int flag) | |
1651 | { | |
a1261f54 | 1652 | set_ti_thread_flag(task_thread_info(tsk), flag); |
1da177e4 LT |
1653 | } |
1654 | ||
1655 | static inline void clear_tsk_thread_flag(struct task_struct *tsk, int flag) | |
1656 | { | |
a1261f54 | 1657 | clear_ti_thread_flag(task_thread_info(tsk), flag); |
1da177e4 LT |
1658 | } |
1659 | ||
93ee37c2 DM |
1660 | static inline void update_tsk_thread_flag(struct task_struct *tsk, int flag, |
1661 | bool value) | |
1662 | { | |
1663 | update_ti_thread_flag(task_thread_info(tsk), flag, value); | |
1664 | } | |
1665 | ||
1da177e4 LT |
1666 | static inline int test_and_set_tsk_thread_flag(struct task_struct *tsk, int flag) |
1667 | { | |
a1261f54 | 1668 | return test_and_set_ti_thread_flag(task_thread_info(tsk), flag); |
1da177e4 LT |
1669 | } |
1670 | ||
1671 | static inline int test_and_clear_tsk_thread_flag(struct task_struct *tsk, int flag) | |
1672 | { | |
a1261f54 | 1673 | return test_and_clear_ti_thread_flag(task_thread_info(tsk), flag); |
1da177e4 LT |
1674 | } |
1675 | ||
1676 | static inline int test_tsk_thread_flag(struct task_struct *tsk, int flag) | |
1677 | { | |
a1261f54 | 1678 | return test_ti_thread_flag(task_thread_info(tsk), flag); |
1da177e4 LT |
1679 | } |
1680 | ||
1681 | static inline void set_tsk_need_resched(struct task_struct *tsk) | |
1682 | { | |
1683 | set_tsk_thread_flag(tsk,TIF_NEED_RESCHED); | |
1684 | } | |
1685 | ||
1686 | static inline void clear_tsk_need_resched(struct task_struct *tsk) | |
1687 | { | |
1688 | clear_tsk_thread_flag(tsk,TIF_NEED_RESCHED); | |
1689 | } | |
1690 | ||
8ae121ac GH |
1691 | static inline int test_tsk_need_resched(struct task_struct *tsk) |
1692 | { | |
1693 | return unlikely(test_tsk_thread_flag(tsk,TIF_NEED_RESCHED)); | |
1694 | } | |
1695 | ||
1da177e4 LT |
1696 | /* |
1697 | * cond_resched() and cond_resched_lock(): latency reduction via | |
1698 | * explicit rescheduling in places that are safe. The return | |
1699 | * value indicates whether a reschedule was done in fact. | |
1700 | * cond_resched_lock() will drop the spinlock before scheduling, | |
1da177e4 | 1701 | */ |
35a773a0 | 1702 | #ifndef CONFIG_PREEMPT |
c3921ab7 | 1703 | extern int _cond_resched(void); |
35a773a0 PZ |
1704 | #else |
1705 | static inline int _cond_resched(void) { return 0; } | |
1706 | #endif | |
6f80bd98 | 1707 | |
613afbf8 | 1708 | #define cond_resched() ({ \ |
3427445a | 1709 | ___might_sleep(__FILE__, __LINE__, 0); \ |
613afbf8 FW |
1710 | _cond_resched(); \ |
1711 | }) | |
6f80bd98 | 1712 | |
613afbf8 FW |
1713 | extern int __cond_resched_lock(spinlock_t *lock); |
1714 | ||
1715 | #define cond_resched_lock(lock) ({ \ | |
3427445a | 1716 | ___might_sleep(__FILE__, __LINE__, PREEMPT_LOCK_OFFSET);\ |
613afbf8 FW |
1717 | __cond_resched_lock(lock); \ |
1718 | }) | |
1719 | ||
f6f3c437 SH |
1720 | static inline void cond_resched_rcu(void) |
1721 | { | |
1722 | #if defined(CONFIG_DEBUG_ATOMIC_SLEEP) || !defined(CONFIG_PREEMPT_RCU) | |
1723 | rcu_read_unlock(); | |
1724 | cond_resched(); | |
1725 | rcu_read_lock(); | |
1726 | #endif | |
1727 | } | |
1728 | ||
1da177e4 LT |
1729 | /* |
1730 | * Does a critical section need to be broken due to another | |
95c354fe NP |
1731 | * task waiting?: (technically does not depend on CONFIG_PREEMPT, |
1732 | * but a general need for low latency) | |
1da177e4 | 1733 | */ |
95c354fe | 1734 | static inline int spin_needbreak(spinlock_t *lock) |
1da177e4 | 1735 | { |
95c354fe NP |
1736 | #ifdef CONFIG_PREEMPT |
1737 | return spin_is_contended(lock); | |
1738 | #else | |
1da177e4 | 1739 | return 0; |
95c354fe | 1740 | #endif |
1da177e4 LT |
1741 | } |
1742 | ||
75f93fed PZ |
1743 | static __always_inline bool need_resched(void) |
1744 | { | |
1745 | return unlikely(tif_need_resched()); | |
1746 | } | |
1747 | ||
1da177e4 LT |
1748 | /* |
1749 | * Wrappers for p->thread_info->cpu access. No-op on UP. | |
1750 | */ | |
1751 | #ifdef CONFIG_SMP | |
1752 | ||
1753 | static inline unsigned int task_cpu(const struct task_struct *p) | |
1754 | { | |
c65eacbe AL |
1755 | #ifdef CONFIG_THREAD_INFO_IN_TASK |
1756 | return p->cpu; | |
1757 | #else | |
a1261f54 | 1758 | return task_thread_info(p)->cpu; |
c65eacbe | 1759 | #endif |
1da177e4 LT |
1760 | } |
1761 | ||
c65cc870 | 1762 | extern void set_task_cpu(struct task_struct *p, unsigned int cpu); |
1da177e4 LT |
1763 | |
1764 | #else | |
1765 | ||
1766 | static inline unsigned int task_cpu(const struct task_struct *p) | |
1767 | { | |
1768 | return 0; | |
1769 | } | |
1770 | ||
1771 | static inline void set_task_cpu(struct task_struct *p, unsigned int cpu) | |
1772 | { | |
1773 | } | |
1774 | ||
1775 | #endif /* CONFIG_SMP */ | |
1776 | ||
d9345c65 PX |
1777 | /* |
1778 | * In order to reduce various lock holder preemption latencies provide an | |
1779 | * interface to see if a vCPU is currently running or not. | |
1780 | * | |
1781 | * This allows us to terminate optimistic spin loops and block, analogous to | |
1782 | * the native optimistic spin heuristic of testing if the lock owner task is | |
1783 | * running or not. | |
1784 | */ | |
1785 | #ifndef vcpu_is_preempted | |
1786 | # define vcpu_is_preempted(cpu) false | |
1787 | #endif | |
1788 | ||
96f874e2 RR |
1789 | extern long sched_setaffinity(pid_t pid, const struct cpumask *new_mask); |
1790 | extern long sched_getaffinity(pid_t pid, struct cpumask *mask); | |
5c45bf27 | 1791 | |
82455257 DH |
1792 | #ifndef TASK_SIZE_OF |
1793 | #define TASK_SIZE_OF(tsk) TASK_SIZE | |
1794 | #endif | |
1795 | ||
d7822b1e MD |
1796 | #ifdef CONFIG_RSEQ |
1797 | ||
1798 | /* | |
1799 | * Map the event mask on the user-space ABI enum rseq_cs_flags | |
1800 | * for direct mask checks. | |
1801 | */ | |
1802 | enum rseq_event_mask_bits { | |
1803 | RSEQ_EVENT_PREEMPT_BIT = RSEQ_CS_FLAG_NO_RESTART_ON_PREEMPT_BIT, | |
1804 | RSEQ_EVENT_SIGNAL_BIT = RSEQ_CS_FLAG_NO_RESTART_ON_SIGNAL_BIT, | |
1805 | RSEQ_EVENT_MIGRATE_BIT = RSEQ_CS_FLAG_NO_RESTART_ON_MIGRATE_BIT, | |
1806 | }; | |
1807 | ||
1808 | enum rseq_event_mask { | |
1809 | RSEQ_EVENT_PREEMPT = (1U << RSEQ_EVENT_PREEMPT_BIT), | |
1810 | RSEQ_EVENT_SIGNAL = (1U << RSEQ_EVENT_SIGNAL_BIT), | |
1811 | RSEQ_EVENT_MIGRATE = (1U << RSEQ_EVENT_MIGRATE_BIT), | |
1812 | }; | |
1813 | ||
1814 | static inline void rseq_set_notify_resume(struct task_struct *t) | |
1815 | { | |
1816 | if (t->rseq) | |
1817 | set_tsk_thread_flag(t, TIF_NOTIFY_RESUME); | |
1818 | } | |
1819 | ||
784e0300 | 1820 | void __rseq_handle_notify_resume(struct ksignal *sig, struct pt_regs *regs); |
d7822b1e | 1821 | |
784e0300 WD |
1822 | static inline void rseq_handle_notify_resume(struct ksignal *ksig, |
1823 | struct pt_regs *regs) | |
d7822b1e MD |
1824 | { |
1825 | if (current->rseq) | |
784e0300 | 1826 | __rseq_handle_notify_resume(ksig, regs); |
d7822b1e MD |
1827 | } |
1828 | ||
784e0300 WD |
1829 | static inline void rseq_signal_deliver(struct ksignal *ksig, |
1830 | struct pt_regs *regs) | |
d7822b1e MD |
1831 | { |
1832 | preempt_disable(); | |
1833 | __set_bit(RSEQ_EVENT_SIGNAL_BIT, ¤t->rseq_event_mask); | |
1834 | preempt_enable(); | |
784e0300 | 1835 | rseq_handle_notify_resume(ksig, regs); |
d7822b1e MD |
1836 | } |
1837 | ||
1838 | /* rseq_preempt() requires preemption to be disabled. */ | |
1839 | static inline void rseq_preempt(struct task_struct *t) | |
1840 | { | |
1841 | __set_bit(RSEQ_EVENT_PREEMPT_BIT, &t->rseq_event_mask); | |
1842 | rseq_set_notify_resume(t); | |
1843 | } | |
1844 | ||
1845 | /* rseq_migrate() requires preemption to be disabled. */ | |
1846 | static inline void rseq_migrate(struct task_struct *t) | |
1847 | { | |
1848 | __set_bit(RSEQ_EVENT_MIGRATE_BIT, &t->rseq_event_mask); | |
1849 | rseq_set_notify_resume(t); | |
1850 | } | |
1851 | ||
1852 | /* | |
1853 | * If parent process has a registered restartable sequences area, the | |
9a789fcf | 1854 | * child inherits. Only applies when forking a process, not a thread. |
d7822b1e MD |
1855 | */ |
1856 | static inline void rseq_fork(struct task_struct *t, unsigned long clone_flags) | |
1857 | { | |
1858 | if (clone_flags & CLONE_THREAD) { | |
1859 | t->rseq = NULL; | |
1860 | t->rseq_len = 0; | |
1861 | t->rseq_sig = 0; | |
1862 | t->rseq_event_mask = 0; | |
1863 | } else { | |
1864 | t->rseq = current->rseq; | |
1865 | t->rseq_len = current->rseq_len; | |
1866 | t->rseq_sig = current->rseq_sig; | |
1867 | t->rseq_event_mask = current->rseq_event_mask; | |
d7822b1e MD |
1868 | } |
1869 | } | |
1870 | ||
1871 | static inline void rseq_execve(struct task_struct *t) | |
1872 | { | |
1873 | t->rseq = NULL; | |
1874 | t->rseq_len = 0; | |
1875 | t->rseq_sig = 0; | |
1876 | t->rseq_event_mask = 0; | |
1877 | } | |
1878 | ||
1879 | #else | |
1880 | ||
1881 | static inline void rseq_set_notify_resume(struct task_struct *t) | |
1882 | { | |
1883 | } | |
784e0300 WD |
1884 | static inline void rseq_handle_notify_resume(struct ksignal *ksig, |
1885 | struct pt_regs *regs) | |
d7822b1e MD |
1886 | { |
1887 | } | |
784e0300 WD |
1888 | static inline void rseq_signal_deliver(struct ksignal *ksig, |
1889 | struct pt_regs *regs) | |
d7822b1e MD |
1890 | { |
1891 | } | |
1892 | static inline void rseq_preempt(struct task_struct *t) | |
1893 | { | |
1894 | } | |
1895 | static inline void rseq_migrate(struct task_struct *t) | |
1896 | { | |
1897 | } | |
1898 | static inline void rseq_fork(struct task_struct *t, unsigned long clone_flags) | |
1899 | { | |
1900 | } | |
1901 | static inline void rseq_execve(struct task_struct *t) | |
1902 | { | |
1903 | } | |
1904 | ||
1905 | #endif | |
1906 | ||
73ab1cb2 TY |
1907 | void __exit_umh(struct task_struct *tsk); |
1908 | ||
1909 | static inline void exit_umh(struct task_struct *tsk) | |
1910 | { | |
1911 | if (unlikely(tsk->flags & PF_UMH)) | |
1912 | __exit_umh(tsk); | |
1913 | } | |
1914 | ||
d7822b1e MD |
1915 | #ifdef CONFIG_DEBUG_RSEQ |
1916 | ||
1917 | void rseq_syscall(struct pt_regs *regs); | |
1918 | ||
1919 | #else | |
1920 | ||
1921 | static inline void rseq_syscall(struct pt_regs *regs) | |
1922 | { | |
1923 | } | |
1924 | ||
1925 | #endif | |
1926 | ||
1da177e4 | 1927 | #endif |