]>
Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 LT |
2 | /* |
3 | * linux/mm/oom_kill.c | |
4 | * | |
5 | * Copyright (C) 1998,2000 Rik van Riel | |
6 | * Thanks go out to Claus Fischer for some serious inspiration and | |
7 | * for goading me into coding this file... | |
a63d83f4 DR |
8 | * Copyright (C) 2010 Google, Inc. |
9 | * Rewritten by David Rientjes | |
1da177e4 LT |
10 | * |
11 | * The routines in this file are used to kill a process when | |
a49335cc PJ |
12 | * we're seriously out of memory. This gets called from __alloc_pages() |
13 | * in mm/page_alloc.c when we really run out of memory. | |
1da177e4 LT |
14 | * |
15 | * Since we won't call these routines often (on a well-configured | |
16 | * machine) this file will double as a 'coding guide' and a signpost | |
17 | * for newbie kernel hackers. It features several pointers to major | |
18 | * kernel subsystems and hints as to where to find out what things do. | |
19 | */ | |
20 | ||
8ac773b4 | 21 | #include <linux/oom.h> |
1da177e4 | 22 | #include <linux/mm.h> |
4e950f6f | 23 | #include <linux/err.h> |
5a0e3ad6 | 24 | #include <linux/gfp.h> |
1da177e4 | 25 | #include <linux/sched.h> |
6e84f315 | 26 | #include <linux/sched/mm.h> |
f7ccbae4 | 27 | #include <linux/sched/coredump.h> |
29930025 | 28 | #include <linux/sched/task.h> |
8a7ff02a | 29 | #include <linux/sched/debug.h> |
1da177e4 | 30 | #include <linux/swap.h> |
884a7e59 | 31 | #include <linux/syscalls.h> |
1da177e4 LT |
32 | #include <linux/timex.h> |
33 | #include <linux/jiffies.h> | |
ef08e3b4 | 34 | #include <linux/cpuset.h> |
b95f1b31 | 35 | #include <linux/export.h> |
8bc719d3 | 36 | #include <linux/notifier.h> |
c7ba5c9e | 37 | #include <linux/memcontrol.h> |
6f48d0eb | 38 | #include <linux/mempolicy.h> |
5cd9c58f | 39 | #include <linux/security.h> |
edd45544 | 40 | #include <linux/ptrace.h> |
f660daac | 41 | #include <linux/freezer.h> |
43d2b113 | 42 | #include <linux/ftrace.h> |
dc3f21ea | 43 | #include <linux/ratelimit.h> |
aac45363 MH |
44 | #include <linux/kthread.h> |
45 | #include <linux/init.h> | |
4d4bbd85 | 46 | #include <linux/mmu_notifier.h> |
72ba14de | 47 | #include <linux/cred.h> |
aac45363 MH |
48 | |
49 | #include <asm/tlb.h> | |
50 | #include "internal.h" | |
852d8be0 | 51 | #include "slab.h" |
43d2b113 KH |
52 | |
53 | #define CREATE_TRACE_POINTS | |
54 | #include <trace/events/oom.h> | |
1da177e4 | 55 | |
43fe219a | 56 | static int sysctl_panic_on_oom; |
57 | static int sysctl_oom_kill_allocating_task; | |
58 | static int sysctl_oom_dump_tasks = 1; | |
59 | ||
a195d3f5 MH |
60 | /* |
61 | * Serializes oom killer invocations (out_of_memory()) from all contexts to | |
62 | * prevent from over eager oom killing (e.g. when the oom killer is invoked | |
63 | * from different domains). | |
64 | * | |
65 | * oom_killer_disable() relies on this lock to stabilize oom_killer_disabled | |
66 | * and mark_oom_victim | |
67 | */ | |
dc56401f | 68 | DEFINE_MUTEX(oom_lock); |
67197a4f SB |
69 | /* Serializes oom_score_adj and oom_score_adj_min updates */ |
70 | DEFINE_MUTEX(oom_adj_mutex); | |
1da177e4 | 71 | |
ac311a14 SB |
72 | static inline bool is_memcg_oom(struct oom_control *oc) |
73 | { | |
74 | return oc->memcg != NULL; | |
75 | } | |
76 | ||
6f48d0eb DR |
77 | #ifdef CONFIG_NUMA |
78 | /** | |
f0953a1b | 79 | * oom_cpuset_eligible() - check task eligibility for kill |
ad962441 | 80 | * @start: task struct of which task to consider |
f364f06b | 81 | * @oc: pointer to struct oom_control |
6f48d0eb DR |
82 | * |
83 | * Task eligibility is determined by whether or not a candidate task, @tsk, | |
84 | * shares the same mempolicy nodes as current if it is bound by such a policy | |
85 | * and whether or not it has the same set of allowed cpuset nodes. | |
ac311a14 SB |
86 | * |
87 | * This function is assuming oom-killer context and 'current' has triggered | |
88 | * the oom-killer. | |
495789a5 | 89 | */ |
ac311a14 SB |
90 | static bool oom_cpuset_eligible(struct task_struct *start, |
91 | struct oom_control *oc) | |
495789a5 | 92 | { |
ad962441 ON |
93 | struct task_struct *tsk; |
94 | bool ret = false; | |
ac311a14 SB |
95 | const nodemask_t *mask = oc->nodemask; |
96 | ||
ad962441 | 97 | rcu_read_lock(); |
1da4db0c | 98 | for_each_thread(start, tsk) { |
6f48d0eb DR |
99 | if (mask) { |
100 | /* | |
101 | * If this is a mempolicy constrained oom, tsk's | |
102 | * cpuset is irrelevant. Only return true if its | |
103 | * mempolicy intersects current, otherwise it may be | |
104 | * needlessly killed. | |
105 | */ | |
b26e517a | 106 | ret = mempolicy_in_oom_domain(tsk, mask); |
6f48d0eb DR |
107 | } else { |
108 | /* | |
109 | * This is not a mempolicy constrained oom, so only | |
110 | * check the mems of tsk's cpuset. | |
111 | */ | |
ad962441 | 112 | ret = cpuset_mems_allowed_intersects(current, tsk); |
6f48d0eb | 113 | } |
ad962441 ON |
114 | if (ret) |
115 | break; | |
1da4db0c | 116 | } |
ad962441 | 117 | rcu_read_unlock(); |
df1090a8 | 118 | |
ad962441 | 119 | return ret; |
6f48d0eb DR |
120 | } |
121 | #else | |
ac311a14 | 122 | static bool oom_cpuset_eligible(struct task_struct *tsk, struct oom_control *oc) |
6f48d0eb DR |
123 | { |
124 | return true; | |
495789a5 | 125 | } |
6f48d0eb | 126 | #endif /* CONFIG_NUMA */ |
495789a5 | 127 | |
6f48d0eb DR |
128 | /* |
129 | * The process p may have detached its own ->mm while exiting or through | |
f5678e7f | 130 | * kthread_use_mm(), but one or more of its subthreads may still have a valid |
6f48d0eb DR |
131 | * pointer. Return p, or any of its subthreads with a valid ->mm, with |
132 | * task_lock() held. | |
133 | */ | |
158e0a2d | 134 | struct task_struct *find_lock_task_mm(struct task_struct *p) |
dd8e8f40 | 135 | { |
1da4db0c | 136 | struct task_struct *t; |
dd8e8f40 | 137 | |
4d4048be ON |
138 | rcu_read_lock(); |
139 | ||
1da4db0c | 140 | for_each_thread(p, t) { |
dd8e8f40 ON |
141 | task_lock(t); |
142 | if (likely(t->mm)) | |
4d4048be | 143 | goto found; |
dd8e8f40 | 144 | task_unlock(t); |
1da4db0c | 145 | } |
4d4048be ON |
146 | t = NULL; |
147 | found: | |
148 | rcu_read_unlock(); | |
dd8e8f40 | 149 | |
4d4048be | 150 | return t; |
dd8e8f40 ON |
151 | } |
152 | ||
db2a0dd7 YB |
153 | /* |
154 | * order == -1 means the oom kill is required by sysrq, otherwise only | |
155 | * for display purposes. | |
156 | */ | |
157 | static inline bool is_sysrq_oom(struct oom_control *oc) | |
158 | { | |
159 | return oc->order == -1; | |
160 | } | |
161 | ||
ab290adb | 162 | /* return true if the task is not adequate as candidate victim task. */ |
ac311a14 | 163 | static bool oom_unkillable_task(struct task_struct *p) |
ab290adb KM |
164 | { |
165 | if (is_global_init(p)) | |
166 | return true; | |
167 | if (p->flags & PF_KTHREAD) | |
168 | return true; | |
ab290adb KM |
169 | return false; |
170 | } | |
171 | ||
845be1cd | 172 | /* |
259b3633 HS |
173 | * Check whether unreclaimable slab amount is greater than |
174 | * all user memory(LRU pages). | |
175 | * dump_unreclaimable_slab() could help in the case that | |
176 | * oom due to too much unreclaimable slab used by kernel. | |
177 | */ | |
178 | static bool should_dump_unreclaim_slab(void) | |
852d8be0 YS |
179 | { |
180 | unsigned long nr_lru; | |
181 | ||
182 | nr_lru = global_node_page_state(NR_ACTIVE_ANON) + | |
183 | global_node_page_state(NR_INACTIVE_ANON) + | |
184 | global_node_page_state(NR_ACTIVE_FILE) + | |
185 | global_node_page_state(NR_INACTIVE_FILE) + | |
186 | global_node_page_state(NR_ISOLATED_ANON) + | |
187 | global_node_page_state(NR_ISOLATED_FILE) + | |
188 | global_node_page_state(NR_UNEVICTABLE); | |
189 | ||
d42f3245 | 190 | return (global_node_page_state_pages(NR_SLAB_UNRECLAIMABLE_B) > nr_lru); |
852d8be0 YS |
191 | } |
192 | ||
1da177e4 | 193 | /** |
a63d83f4 | 194 | * oom_badness - heuristic function to determine which candidate task to kill |
1da177e4 | 195 | * @p: task struct of which task we should calculate |
a63d83f4 | 196 | * @totalpages: total present RAM allowed for page allocation |
1da177e4 | 197 | * |
a63d83f4 DR |
198 | * The heuristic for determining which task to kill is made to be as simple and |
199 | * predictable as possible. The goal is to return the highest value for the | |
200 | * task consuming the most memory to avoid subsequent oom failures. | |
1da177e4 | 201 | */ |
9066e5cf | 202 | long oom_badness(struct task_struct *p, unsigned long totalpages) |
1da177e4 | 203 | { |
1e11ad8d | 204 | long points; |
61eafb00 | 205 | long adj; |
28b83c51 | 206 | |
ac311a14 | 207 | if (oom_unkillable_task(p)) |
9066e5cf | 208 | return LONG_MIN; |
1da177e4 | 209 | |
dd8e8f40 ON |
210 | p = find_lock_task_mm(p); |
211 | if (!p) | |
9066e5cf | 212 | return LONG_MIN; |
1da177e4 | 213 | |
bb8a4b7f MH |
214 | /* |
215 | * Do not even consider tasks which are explicitly marked oom | |
b18dc5f2 MH |
216 | * unkillable or have been already oom reaped or the are in |
217 | * the middle of vfork | |
bb8a4b7f | 218 | */ |
a9c58b90 | 219 | adj = (long)p->signal->oom_score_adj; |
bb8a4b7f | 220 | if (adj == OOM_SCORE_ADJ_MIN || |
862e3073 | 221 | test_bit(MMF_OOM_SKIP, &p->mm->flags) || |
b18dc5f2 | 222 | in_vfork(p)) { |
5aecc85a | 223 | task_unlock(p); |
9066e5cf | 224 | return LONG_MIN; |
5aecc85a MH |
225 | } |
226 | ||
1da177e4 | 227 | /* |
a63d83f4 | 228 | * The baseline for the badness score is the proportion of RAM that each |
f755a042 | 229 | * task's rss, pagetable and swap space use. |
1da177e4 | 230 | */ |
dc6c9a35 | 231 | points = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) + |
af5b0f6a | 232 | mm_pgtables_bytes(p->mm) / PAGE_SIZE; |
a63d83f4 | 233 | task_unlock(p); |
1da177e4 | 234 | |
61eafb00 DR |
235 | /* Normalize to oom_score_adj units */ |
236 | adj *= totalpages / 1000; | |
237 | points += adj; | |
1da177e4 | 238 | |
9066e5cf | 239 | return points; |
1da177e4 LT |
240 | } |
241 | ||
ef8444ea | 242 | static const char * const oom_constraint_text[] = { |
243 | [CONSTRAINT_NONE] = "CONSTRAINT_NONE", | |
244 | [CONSTRAINT_CPUSET] = "CONSTRAINT_CPUSET", | |
245 | [CONSTRAINT_MEMORY_POLICY] = "CONSTRAINT_MEMORY_POLICY", | |
246 | [CONSTRAINT_MEMCG] = "CONSTRAINT_MEMCG", | |
7c5f64f8 VD |
247 | }; |
248 | ||
9b0f8b04 CL |
249 | /* |
250 | * Determine the type of allocation constraint. | |
251 | */ | |
7c5f64f8 | 252 | static enum oom_constraint constrained_alloc(struct oom_control *oc) |
4365a567 | 253 | { |
54a6eb5c | 254 | struct zone *zone; |
dd1a239f | 255 | struct zoneref *z; |
97a225e6 | 256 | enum zone_type highest_zoneidx = gfp_zone(oc->gfp_mask); |
a63d83f4 DR |
257 | bool cpuset_limited = false; |
258 | int nid; | |
9b0f8b04 | 259 | |
7c5f64f8 | 260 | if (is_memcg_oom(oc)) { |
bbec2e15 | 261 | oc->totalpages = mem_cgroup_get_max(oc->memcg) ?: 1; |
7c5f64f8 VD |
262 | return CONSTRAINT_MEMCG; |
263 | } | |
264 | ||
a63d83f4 | 265 | /* Default to all available memory */ |
ca79b0c2 | 266 | oc->totalpages = totalram_pages() + total_swap_pages; |
7c5f64f8 VD |
267 | |
268 | if (!IS_ENABLED(CONFIG_NUMA)) | |
269 | return CONSTRAINT_NONE; | |
a63d83f4 | 270 | |
6e0fc46d | 271 | if (!oc->zonelist) |
a63d83f4 | 272 | return CONSTRAINT_NONE; |
4365a567 KH |
273 | /* |
274 | * Reach here only when __GFP_NOFAIL is used. So, we should avoid | |
275 | * to kill current.We have to random task kill in this case. | |
276 | * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now. | |
277 | */ | |
6e0fc46d | 278 | if (oc->gfp_mask & __GFP_THISNODE) |
4365a567 | 279 | return CONSTRAINT_NONE; |
9b0f8b04 | 280 | |
4365a567 | 281 | /* |
a63d83f4 DR |
282 | * This is not a __GFP_THISNODE allocation, so a truncated nodemask in |
283 | * the page allocator means a mempolicy is in effect. Cpuset policy | |
284 | * is enforced in get_page_from_freelist(). | |
4365a567 | 285 | */ |
6e0fc46d DR |
286 | if (oc->nodemask && |
287 | !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) { | |
7c5f64f8 | 288 | oc->totalpages = total_swap_pages; |
6e0fc46d | 289 | for_each_node_mask(nid, *oc->nodemask) |
1eb41bb0 | 290 | oc->totalpages += node_present_pages(nid); |
9b0f8b04 | 291 | return CONSTRAINT_MEMORY_POLICY; |
a63d83f4 | 292 | } |
4365a567 KH |
293 | |
294 | /* Check this allocation failure is caused by cpuset's wall function */ | |
6e0fc46d | 295 | for_each_zone_zonelist_nodemask(zone, z, oc->zonelist, |
97a225e6 | 296 | highest_zoneidx, oc->nodemask) |
6e0fc46d | 297 | if (!cpuset_zone_allowed(zone, oc->gfp_mask)) |
a63d83f4 | 298 | cpuset_limited = true; |
9b0f8b04 | 299 | |
a63d83f4 | 300 | if (cpuset_limited) { |
7c5f64f8 | 301 | oc->totalpages = total_swap_pages; |
a63d83f4 | 302 | for_each_node_mask(nid, cpuset_current_mems_allowed) |
1eb41bb0 | 303 | oc->totalpages += node_present_pages(nid); |
a63d83f4 DR |
304 | return CONSTRAINT_CPUSET; |
305 | } | |
9b0f8b04 CL |
306 | return CONSTRAINT_NONE; |
307 | } | |
308 | ||
7c5f64f8 | 309 | static int oom_evaluate_task(struct task_struct *task, void *arg) |
462607ec | 310 | { |
7c5f64f8 | 311 | struct oom_control *oc = arg; |
9066e5cf | 312 | long points; |
7c5f64f8 | 313 | |
ac311a14 SB |
314 | if (oom_unkillable_task(task)) |
315 | goto next; | |
316 | ||
317 | /* p may not have freeable memory in nodemask */ | |
318 | if (!is_memcg_oom(oc) && !oom_cpuset_eligible(task, oc)) | |
7c5f64f8 | 319 | goto next; |
462607ec DR |
320 | |
321 | /* | |
322 | * This task already has access to memory reserves and is being killed. | |
a373966d | 323 | * Don't allow any other task to have access to the reserves unless |
862e3073 | 324 | * the task has MMF_OOM_SKIP because chances that it would release |
a373966d | 325 | * any memory is quite low. |
462607ec | 326 | */ |
862e3073 MH |
327 | if (!is_sysrq_oom(oc) && tsk_is_oom_victim(task)) { |
328 | if (test_bit(MMF_OOM_SKIP, &task->signal->oom_mm->flags)) | |
7c5f64f8 VD |
329 | goto next; |
330 | goto abort; | |
a373966d | 331 | } |
462607ec | 332 | |
e1e12d2f DR |
333 | /* |
334 | * If task is allocating a lot of memory and has been marked to be | |
335 | * killed first if it triggers an oom, then select it. | |
336 | */ | |
7c5f64f8 | 337 | if (oom_task_origin(task)) { |
9066e5cf | 338 | points = LONG_MAX; |
7c5f64f8 VD |
339 | goto select; |
340 | } | |
e1e12d2f | 341 | |
ac311a14 | 342 | points = oom_badness(task, oc->totalpages); |
9066e5cf | 343 | if (points == LONG_MIN || points < oc->chosen_points) |
7c5f64f8 VD |
344 | goto next; |
345 | ||
7c5f64f8 VD |
346 | select: |
347 | if (oc->chosen) | |
348 | put_task_struct(oc->chosen); | |
349 | get_task_struct(task); | |
350 | oc->chosen = task; | |
351 | oc->chosen_points = points; | |
352 | next: | |
353 | return 0; | |
354 | abort: | |
355 | if (oc->chosen) | |
356 | put_task_struct(oc->chosen); | |
357 | oc->chosen = (void *)-1UL; | |
358 | return 1; | |
462607ec DR |
359 | } |
360 | ||
1da177e4 | 361 | /* |
7c5f64f8 VD |
362 | * Simple selection loop. We choose the process with the highest number of |
363 | * 'points'. In case scan was aborted, oc->chosen is set to -1. | |
1da177e4 | 364 | */ |
7c5f64f8 | 365 | static void select_bad_process(struct oom_control *oc) |
1da177e4 | 366 | { |
9066e5cf YS |
367 | oc->chosen_points = LONG_MIN; |
368 | ||
7c5f64f8 VD |
369 | if (is_memcg_oom(oc)) |
370 | mem_cgroup_scan_tasks(oc->memcg, oom_evaluate_task, oc); | |
371 | else { | |
372 | struct task_struct *p; | |
d49ad935 | 373 | |
7c5f64f8 VD |
374 | rcu_read_lock(); |
375 | for_each_process(p) | |
376 | if (oom_evaluate_task(p, oc)) | |
377 | break; | |
378 | rcu_read_unlock(); | |
1da4db0c | 379 | } |
1da177e4 LT |
380 | } |
381 | ||
5eee7e1c SB |
382 | static int dump_task(struct task_struct *p, void *arg) |
383 | { | |
384 | struct oom_control *oc = arg; | |
385 | struct task_struct *task; | |
386 | ||
ac311a14 SB |
387 | if (oom_unkillable_task(p)) |
388 | return 0; | |
389 | ||
390 | /* p may not have freeable memory in nodemask */ | |
391 | if (!is_memcg_oom(oc) && !oom_cpuset_eligible(p, oc)) | |
5eee7e1c SB |
392 | return 0; |
393 | ||
394 | task = find_lock_task_mm(p); | |
395 | if (!task) { | |
396 | /* | |
f8159c13 TY |
397 | * All of p's threads have already detached their mm's. There's |
398 | * no need to report them; they can't be oom killed anyway. | |
5eee7e1c SB |
399 | */ |
400 | return 0; | |
401 | } | |
402 | ||
27873192 | 403 | pr_info("[%7d] %5d %5d %8lu %8lu %8lu %8lu %9lu %8ld %8lu %5hd %s\n", |
5eee7e1c SB |
404 | task->pid, from_kuid(&init_user_ns, task_uid(task)), |
405 | task->tgid, task->mm->total_vm, get_mm_rss(task->mm), | |
27873192 YW |
406 | get_mm_counter(task->mm, MM_ANONPAGES), get_mm_counter(task->mm, MM_FILEPAGES), |
407 | get_mm_counter(task->mm, MM_SHMEMPAGES), mm_pgtables_bytes(task->mm), | |
5eee7e1c SB |
408 | get_mm_counter(task->mm, MM_SWAPENTS), |
409 | task->signal->oom_score_adj, task->comm); | |
410 | task_unlock(task); | |
411 | ||
412 | return 0; | |
413 | } | |
414 | ||
fef1bdd6 | 415 | /** |
1b578df0 | 416 | * dump_tasks - dump current memory state of all system tasks |
5eee7e1c | 417 | * @oc: pointer to struct oom_control |
1b578df0 | 418 | * |
e85bfd3a DR |
419 | * Dumps the current memory state of all eligible tasks. Tasks not in the same |
420 | * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes | |
421 | * are not shown. | |
af5b0f6a KS |
422 | * State information includes task's pid, uid, tgid, vm size, rss, |
423 | * pgtables_bytes, swapents, oom_score_adj value, and name. | |
fef1bdd6 | 424 | */ |
5eee7e1c | 425 | static void dump_tasks(struct oom_control *oc) |
fef1bdd6 | 426 | { |
c3b78b11 | 427 | pr_info("Tasks state (memory values in pages):\n"); |
27873192 | 428 | pr_info("[ pid ] uid tgid total_vm rss rss_anon rss_file rss_shmem pgtables_bytes swapents oom_score_adj name\n"); |
fef1bdd6 | 429 | |
5eee7e1c SB |
430 | if (is_memcg_oom(oc)) |
431 | mem_cgroup_scan_tasks(oc->memcg, dump_task, oc); | |
432 | else { | |
433 | struct task_struct *p; | |
c55db957 | 434 | |
5eee7e1c SB |
435 | rcu_read_lock(); |
436 | for_each_process(p) | |
437 | dump_task(p, oc); | |
438 | rcu_read_unlock(); | |
c55db957 | 439 | } |
fef1bdd6 DR |
440 | } |
441 | ||
1f4f7f0f | 442 | static void dump_oom_victim(struct oom_control *oc, struct task_struct *victim) |
ef8444ea | 443 | { |
444 | /* one line summary of the oom killer context. */ | |
445 | pr_info("oom-kill:constraint=%s,nodemask=%*pbl", | |
446 | oom_constraint_text[oc->constraint], | |
447 | nodemask_pr_args(oc->nodemask)); | |
448 | cpuset_print_current_mems_allowed(); | |
f0c867d9 | 449 | mem_cgroup_print_oom_context(oc->memcg, victim); |
ef8444ea | 450 | pr_cont(",task=%s,pid=%d,uid=%d\n", victim->comm, victim->pid, |
451 | from_kuid(&init_user_ns, task_uid(victim))); | |
452 | } | |
453 | ||
1f4f7f0f | 454 | static void dump_header(struct oom_control *oc) |
1b604d75 | 455 | { |
ef8444ea | 456 | pr_warn("%s invoked oom-killer: gfp_mask=%#x(%pGg), order=%d, oom_score_adj=%hd\n", |
457 | current->comm, oc->gfp_mask, &oc->gfp_mask, oc->order, | |
0205f755 | 458 | current->signal->oom_score_adj); |
9254990f MH |
459 | if (!IS_ENABLED(CONFIG_COMPACTION) && oc->order) |
460 | pr_warn("COMPACTION is disabled!!!\n"); | |
a0795cd4 | 461 | |
1b604d75 | 462 | dump_stack(); |
852d8be0 | 463 | if (is_memcg_oom(oc)) |
f0c867d9 | 464 | mem_cgroup_print_oom_meminfo(oc->memcg); |
852d8be0 | 465 | else { |
974f4367 | 466 | __show_mem(SHOW_MEM_FILTER_NODES, oc->nodemask, gfp_zone(oc->gfp_mask)); |
259b3633 | 467 | if (should_dump_unreclaim_slab()) |
852d8be0 YS |
468 | dump_unreclaimable_slab(); |
469 | } | |
1b604d75 | 470 | if (sysctl_oom_dump_tasks) |
5eee7e1c | 471 | dump_tasks(oc); |
1b604d75 DR |
472 | } |
473 | ||
5695be14 | 474 | /* |
c32b3cbe | 475 | * Number of OOM victims in flight |
5695be14 | 476 | */ |
c32b3cbe MH |
477 | static atomic_t oom_victims = ATOMIC_INIT(0); |
478 | static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait); | |
5695be14 | 479 | |
7c5f64f8 | 480 | static bool oom_killer_disabled __read_mostly; |
5695be14 | 481 | |
3ef22dff MH |
482 | /* |
483 | * task->mm can be NULL if the task is the exited group leader. So to | |
484 | * determine whether the task is using a particular mm, we examine all the | |
485 | * task's threads: if one of those is using this mm then this task was also | |
486 | * using it. | |
487 | */ | |
44a70ade | 488 | bool process_shares_mm(struct task_struct *p, struct mm_struct *mm) |
3ef22dff MH |
489 | { |
490 | struct task_struct *t; | |
491 | ||
492 | for_each_thread(p, t) { | |
493 | struct mm_struct *t_mm = READ_ONCE(t->mm); | |
494 | if (t_mm) | |
495 | return t_mm == mm; | |
496 | } | |
497 | return false; | |
498 | } | |
499 | ||
aac45363 MH |
500 | #ifdef CONFIG_MMU |
501 | /* | |
502 | * OOM Reaper kernel thread which tries to reap the memory used by the OOM | |
503 | * victim (if that is possible) to help the OOM killer to move on. | |
504 | */ | |
505 | static struct task_struct *oom_reaper_th; | |
aac45363 | 506 | static DECLARE_WAIT_QUEUE_HEAD(oom_reaper_wait); |
29c696e1 | 507 | static struct task_struct *oom_reaper_list; |
03049269 MH |
508 | static DEFINE_SPINLOCK(oom_reaper_lock); |
509 | ||
bf3980c8 | 510 | static bool __oom_reap_task_mm(struct mm_struct *mm) |
aac45363 | 511 | { |
aac45363 | 512 | struct vm_area_struct *vma; |
93065ac7 | 513 | bool ret = true; |
e1c2c775 | 514 | VMA_ITERATOR(vmi, mm, 0); |
27ae357f DR |
515 | |
516 | /* | |
517 | * Tell all users of get_user/copy_from_user etc... that the content | |
518 | * is no longer stable. No barriers really needed because unmapping | |
519 | * should imply barriers already and the reader would hit a page fault | |
520 | * if it stumbled over a reaped memory. | |
521 | */ | |
522 | set_bit(MMF_UNSTABLE, &mm->flags); | |
523 | ||
e1c2c775 | 524 | for_each_vma(vmi, vma) { |
a213e5cf | 525 | if (vma->vm_flags & (VM_HUGETLB|VM_PFNMAP)) |
27ae357f DR |
526 | continue; |
527 | ||
528 | /* | |
529 | * Only anonymous pages have a good chance to be dropped | |
530 | * without additional steps which we cannot afford as we | |
531 | * are OOM already. | |
532 | * | |
533 | * We do not even care about fs backed pages because all | |
534 | * which are reclaimable have already been reclaimed and | |
535 | * we do not want to block exit_mmap by keeping mm ref | |
536 | * count elevated without a good reason. | |
537 | */ | |
538 | if (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED)) { | |
ac46d4f3 | 539 | struct mmu_notifier_range range; |
27ae357f DR |
540 | struct mmu_gather tlb; |
541 | ||
6f4f13e8 | 542 | mmu_notifier_range_init(&range, MMU_NOTIFY_UNMAP, 0, |
7d4a8be0 | 543 | mm, vma->vm_start, |
ac46d4f3 | 544 | vma->vm_end); |
a72afd87 | 545 | tlb_gather_mmu(&tlb, mm); |
ac46d4f3 | 546 | if (mmu_notifier_invalidate_range_start_nonblock(&range)) { |
ae8eba8b | 547 | tlb_finish_mmu(&tlb); |
93065ac7 MH |
548 | ret = false; |
549 | continue; | |
550 | } | |
ac46d4f3 JG |
551 | unmap_page_range(&tlb, vma, range.start, range.end, NULL); |
552 | mmu_notifier_invalidate_range_end(&range); | |
ae8eba8b | 553 | tlb_finish_mmu(&tlb); |
27ae357f DR |
554 | } |
555 | } | |
93065ac7 MH |
556 | |
557 | return ret; | |
27ae357f DR |
558 | } |
559 | ||
431f42fd MH |
560 | /* |
561 | * Reaps the address space of the give task. | |
562 | * | |
563 | * Returns true on success and false if none or part of the address space | |
564 | * has been reclaimed and the caller should retry later. | |
565 | */ | |
27ae357f DR |
566 | static bool oom_reap_task_mm(struct task_struct *tsk, struct mm_struct *mm) |
567 | { | |
aac45363 MH |
568 | bool ret = true; |
569 | ||
d8ed45c5 | 570 | if (!mmap_read_trylock(mm)) { |
422580c3 | 571 | trace_skip_task_reaping(tsk->pid); |
af5679fb | 572 | return false; |
4d4bbd85 MH |
573 | } |
574 | ||
e5e3f4c4 | 575 | /* |
21292580 AA |
576 | * MMF_OOM_SKIP is set by exit_mmap when the OOM reaper can't |
577 | * work on the mm anymore. The check for MMF_OOM_SKIP must run | |
3e4e28c5 ML |
578 | * under mmap_lock for reading because it serializes against the |
579 | * mmap_write_lock();mmap_write_unlock() cycle in exit_mmap(). | |
e5e3f4c4 | 580 | */ |
21292580 | 581 | if (test_bit(MMF_OOM_SKIP, &mm->flags)) { |
422580c3 | 582 | trace_skip_task_reaping(tsk->pid); |
431f42fd | 583 | goto out_unlock; |
aac45363 MH |
584 | } |
585 | ||
422580c3 RG |
586 | trace_start_task_reaping(tsk->pid); |
587 | ||
93065ac7 | 588 | /* failed to reap part of the address space. Try again later */ |
431f42fd MH |
589 | ret = __oom_reap_task_mm(mm); |
590 | if (!ret) | |
591 | goto out_finish; | |
aac45363 | 592 | |
bc448e89 MH |
593 | pr_info("oom_reaper: reaped process %d (%s), now anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n", |
594 | task_pid_nr(tsk), tsk->comm, | |
595 | K(get_mm_counter(mm, MM_ANONPAGES)), | |
596 | K(get_mm_counter(mm, MM_FILEPAGES)), | |
597 | K(get_mm_counter(mm, MM_SHMEMPAGES))); | |
431f42fd MH |
598 | out_finish: |
599 | trace_finish_task_reaping(tsk->pid); | |
600 | out_unlock: | |
d8ed45c5 | 601 | mmap_read_unlock(mm); |
36324a99 | 602 | |
aac45363 MH |
603 | return ret; |
604 | } | |
605 | ||
bc448e89 | 606 | #define MAX_OOM_REAP_RETRIES 10 |
36324a99 | 607 | static void oom_reap_task(struct task_struct *tsk) |
aac45363 MH |
608 | { |
609 | int attempts = 0; | |
26db62f1 | 610 | struct mm_struct *mm = tsk->signal->oom_mm; |
aac45363 | 611 | |
3e4e28c5 | 612 | /* Retry the mmap_read_trylock(mm) a few times */ |
27ae357f | 613 | while (attempts++ < MAX_OOM_REAP_RETRIES && !oom_reap_task_mm(tsk, mm)) |
aac45363 MH |
614 | schedule_timeout_idle(HZ/10); |
615 | ||
97b1255c TH |
616 | if (attempts <= MAX_OOM_REAP_RETRIES || |
617 | test_bit(MMF_OOM_SKIP, &mm->flags)) | |
7ebffa45 | 618 | goto done; |
11a410d5 | 619 | |
7ebffa45 TH |
620 | pr_info("oom_reaper: unable to reap pid:%d (%s)\n", |
621 | task_pid_nr(tsk), tsk->comm); | |
8a7ff02a | 622 | sched_show_task(tsk); |
7ebffa45 | 623 | debug_show_all_locks(); |
bc448e89 | 624 | |
7ebffa45 | 625 | done: |
449d777d | 626 | tsk->oom_reaper_list = NULL; |
449d777d | 627 | |
26db62f1 MH |
628 | /* |
629 | * Hide this mm from OOM killer because it has been either reaped or | |
3e4e28c5 | 630 | * somebody can't call mmap_write_unlock(mm). |
26db62f1 | 631 | */ |
862e3073 | 632 | set_bit(MMF_OOM_SKIP, &mm->flags); |
26db62f1 | 633 | |
e4a38402 | 634 | /* Drop a reference taken by queue_oom_reaper */ |
36324a99 | 635 | put_task_struct(tsk); |
aac45363 MH |
636 | } |
637 | ||
638 | static int oom_reaper(void *unused) | |
639 | { | |
3723929e SA |
640 | set_freezable(); |
641 | ||
aac45363 | 642 | while (true) { |
03049269 | 643 | struct task_struct *tsk = NULL; |
aac45363 | 644 | |
29c696e1 | 645 | wait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL); |
e4a38402 | 646 | spin_lock_irq(&oom_reaper_lock); |
29c696e1 VD |
647 | if (oom_reaper_list != NULL) { |
648 | tsk = oom_reaper_list; | |
649 | oom_reaper_list = tsk->oom_reaper_list; | |
03049269 | 650 | } |
e4a38402 | 651 | spin_unlock_irq(&oom_reaper_lock); |
03049269 MH |
652 | |
653 | if (tsk) | |
654 | oom_reap_task(tsk); | |
aac45363 MH |
655 | } |
656 | ||
657 | return 0; | |
658 | } | |
659 | ||
e4a38402 | 660 | static void wake_oom_reaper(struct timer_list *timer) |
aac45363 | 661 | { |
e4a38402 NP |
662 | struct task_struct *tsk = container_of(timer, struct task_struct, |
663 | oom_reaper_timer); | |
664 | struct mm_struct *mm = tsk->signal->oom_mm; | |
665 | unsigned long flags; | |
aac45363 | 666 | |
e4a38402 NP |
667 | /* The victim managed to terminate on its own - see exit_mmap */ |
668 | if (test_bit(MMF_OOM_SKIP, &mm->flags)) { | |
669 | put_task_struct(tsk); | |
670 | return; | |
671 | } | |
aac45363 | 672 | |
e4a38402 | 673 | spin_lock_irqsave(&oom_reaper_lock, flags); |
29c696e1 VD |
674 | tsk->oom_reaper_list = oom_reaper_list; |
675 | oom_reaper_list = tsk; | |
e4a38402 | 676 | spin_unlock_irqrestore(&oom_reaper_lock, flags); |
422580c3 | 677 | trace_wake_reaper(tsk->pid); |
03049269 | 678 | wake_up(&oom_reaper_wait); |
aac45363 MH |
679 | } |
680 | ||
e4a38402 NP |
681 | /* |
682 | * Give the OOM victim time to exit naturally before invoking the oom_reaping. | |
683 | * The timers timeout is arbitrary... the longer it is, the longer the worst | |
684 | * case scenario for the OOM can take. If it is too small, the oom_reaper can | |
685 | * get in the way and release resources needed by the process exit path. | |
686 | * e.g. The futex robust list can sit in Anon|Private memory that gets reaped | |
687 | * before the exit path is able to wake the futex waiters. | |
688 | */ | |
689 | #define OOM_REAPER_DELAY (2*HZ) | |
690 | static void queue_oom_reaper(struct task_struct *tsk) | |
691 | { | |
692 | /* mm is already queued? */ | |
693 | if (test_and_set_bit(MMF_OOM_REAP_QUEUED, &tsk->signal->oom_mm->flags)) | |
694 | return; | |
695 | ||
696 | get_task_struct(tsk); | |
697 | timer_setup(&tsk->oom_reaper_timer, wake_oom_reaper, 0); | |
698 | tsk->oom_reaper_timer.expires = jiffies + OOM_REAPER_DELAY; | |
699 | add_timer(&tsk->oom_reaper_timer); | |
700 | } | |
701 | ||
a19cad06 AM |
702 | #ifdef CONFIG_SYSCTL |
703 | static struct ctl_table vm_oom_kill_table[] = { | |
704 | { | |
705 | .procname = "panic_on_oom", | |
706 | .data = &sysctl_panic_on_oom, | |
707 | .maxlen = sizeof(sysctl_panic_on_oom), | |
708 | .mode = 0644, | |
709 | .proc_handler = proc_dointvec_minmax, | |
710 | .extra1 = SYSCTL_ZERO, | |
711 | .extra2 = SYSCTL_TWO, | |
712 | }, | |
713 | { | |
714 | .procname = "oom_kill_allocating_task", | |
715 | .data = &sysctl_oom_kill_allocating_task, | |
716 | .maxlen = sizeof(sysctl_oom_kill_allocating_task), | |
717 | .mode = 0644, | |
718 | .proc_handler = proc_dointvec, | |
719 | }, | |
720 | { | |
721 | .procname = "oom_dump_tasks", | |
722 | .data = &sysctl_oom_dump_tasks, | |
723 | .maxlen = sizeof(sysctl_oom_dump_tasks), | |
724 | .mode = 0644, | |
725 | .proc_handler = proc_dointvec, | |
726 | }, | |
a19cad06 AM |
727 | }; |
728 | #endif | |
729 | ||
aac45363 MH |
730 | static int __init oom_init(void) |
731 | { | |
732 | oom_reaper_th = kthread_run(oom_reaper, NULL, "oom_reaper"); | |
43fe219a | 733 | #ifdef CONFIG_SYSCTL |
734 | register_sysctl_init("vm", vm_oom_kill_table); | |
735 | #endif | |
aac45363 MH |
736 | return 0; |
737 | } | |
738 | subsys_initcall(oom_init) | |
7c5f64f8 | 739 | #else |
e4a38402 | 740 | static inline void queue_oom_reaper(struct task_struct *tsk) |
7c5f64f8 VD |
741 | { |
742 | } | |
743 | #endif /* CONFIG_MMU */ | |
aac45363 | 744 | |
49550b60 | 745 | /** |
16e95196 | 746 | * mark_oom_victim - mark the given task as OOM victim |
49550b60 | 747 | * @tsk: task to mark |
c32b3cbe | 748 | * |
dc56401f | 749 | * Has to be called with oom_lock held and never after |
c32b3cbe | 750 | * oom has been disabled already. |
26db62f1 MH |
751 | * |
752 | * tsk->mm has to be non NULL and caller has to guarantee it is stable (either | |
753 | * under task_lock or operate on the current). | |
49550b60 | 754 | */ |
7c5f64f8 | 755 | static void mark_oom_victim(struct task_struct *tsk) |
49550b60 | 756 | { |
72ba14de | 757 | const struct cred *cred; |
26db62f1 MH |
758 | struct mm_struct *mm = tsk->mm; |
759 | ||
c32b3cbe MH |
760 | WARN_ON(oom_killer_disabled); |
761 | /* OOM killer might race with memcg OOM */ | |
762 | if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE)) | |
763 | return; | |
26db62f1 | 764 | |
26db62f1 | 765 | /* oom_mm is bound to the signal struct life time. */ |
b3541d91 | 766 | if (!cmpxchg(&tsk->signal->oom_mm, NULL, mm)) |
f1f10076 | 767 | mmgrab(tsk->signal->oom_mm); |
26db62f1 | 768 | |
63a8ca9b MH |
769 | /* |
770 | * Make sure that the task is woken up from uninterruptible sleep | |
771 | * if it is frozen because OOM killer wouldn't be able to free | |
772 | * any memory and livelock. freezing_slow_path will tell the freezer | |
773 | * that TIF_MEMDIE tasks should be ignored. | |
774 | */ | |
775 | __thaw_task(tsk); | |
c32b3cbe | 776 | atomic_inc(&oom_victims); |
72ba14de CG |
777 | cred = get_task_cred(tsk); |
778 | trace_mark_victim(tsk, cred->uid.val); | |
779 | put_cred(cred); | |
49550b60 MH |
780 | } |
781 | ||
782 | /** | |
16e95196 | 783 | * exit_oom_victim - note the exit of an OOM victim |
49550b60 | 784 | */ |
38531201 | 785 | void exit_oom_victim(void) |
49550b60 | 786 | { |
38531201 | 787 | clear_thread_flag(TIF_MEMDIE); |
c32b3cbe | 788 | |
c38f1025 | 789 | if (!atomic_dec_return(&oom_victims)) |
c32b3cbe | 790 | wake_up_all(&oom_victims_wait); |
c32b3cbe MH |
791 | } |
792 | ||
7d2e7a22 MH |
793 | /** |
794 | * oom_killer_enable - enable OOM killer | |
795 | */ | |
796 | void oom_killer_enable(void) | |
797 | { | |
798 | oom_killer_disabled = false; | |
d75da004 | 799 | pr_info("OOM killer enabled.\n"); |
7d2e7a22 MH |
800 | } |
801 | ||
c32b3cbe MH |
802 | /** |
803 | * oom_killer_disable - disable OOM killer | |
7d2e7a22 | 804 | * @timeout: maximum timeout to wait for oom victims in jiffies |
c32b3cbe MH |
805 | * |
806 | * Forces all page allocations to fail rather than trigger OOM killer. | |
7d2e7a22 MH |
807 | * Will block and wait until all OOM victims are killed or the given |
808 | * timeout expires. | |
c32b3cbe MH |
809 | * |
810 | * The function cannot be called when there are runnable user tasks because | |
811 | * the userspace would see unexpected allocation failures as a result. Any | |
812 | * new usage of this function should be consulted with MM people. | |
813 | * | |
814 | * Returns true if successful and false if the OOM killer cannot be | |
815 | * disabled. | |
816 | */ | |
7d2e7a22 | 817 | bool oom_killer_disable(signed long timeout) |
c32b3cbe | 818 | { |
7d2e7a22 MH |
819 | signed long ret; |
820 | ||
c32b3cbe | 821 | /* |
6afcf289 TH |
822 | * Make sure to not race with an ongoing OOM killer. Check that the |
823 | * current is not killed (possibly due to sharing the victim's memory). | |
c32b3cbe | 824 | */ |
6afcf289 | 825 | if (mutex_lock_killable(&oom_lock)) |
c32b3cbe | 826 | return false; |
c32b3cbe | 827 | oom_killer_disabled = true; |
dc56401f | 828 | mutex_unlock(&oom_lock); |
c32b3cbe | 829 | |
7d2e7a22 MH |
830 | ret = wait_event_interruptible_timeout(oom_victims_wait, |
831 | !atomic_read(&oom_victims), timeout); | |
832 | if (ret <= 0) { | |
833 | oom_killer_enable(); | |
834 | return false; | |
835 | } | |
d75da004 | 836 | pr_info("OOM killer disabled.\n"); |
c32b3cbe MH |
837 | |
838 | return true; | |
839 | } | |
840 | ||
1af8bb43 MH |
841 | static inline bool __task_will_free_mem(struct task_struct *task) |
842 | { | |
843 | struct signal_struct *sig = task->signal; | |
844 | ||
845 | /* | |
d67e03e3 | 846 | * A coredumping process may sleep for an extended period in |
92307383 | 847 | * coredump_task_exit(), so the oom killer cannot assume that |
d67e03e3 | 848 | * the process will promptly exit and release memory. |
1af8bb43 | 849 | */ |
98b24b16 | 850 | if (sig->core_state) |
1af8bb43 MH |
851 | return false; |
852 | ||
853 | if (sig->flags & SIGNAL_GROUP_EXIT) | |
854 | return true; | |
855 | ||
856 | if (thread_group_empty(task) && (task->flags & PF_EXITING)) | |
857 | return true; | |
858 | ||
859 | return false; | |
860 | } | |
861 | ||
862 | /* | |
863 | * Checks whether the given task is dying or exiting and likely to | |
864 | * release its address space. This means that all threads and processes | |
865 | * sharing the same mm have to be killed or exiting. | |
091f362c MH |
866 | * Caller has to make sure that task->mm is stable (hold task_lock or |
867 | * it operates on the current). | |
1af8bb43 | 868 | */ |
7c5f64f8 | 869 | static bool task_will_free_mem(struct task_struct *task) |
1af8bb43 | 870 | { |
091f362c | 871 | struct mm_struct *mm = task->mm; |
1af8bb43 | 872 | struct task_struct *p; |
f33e6f06 | 873 | bool ret = true; |
1af8bb43 | 874 | |
1af8bb43 | 875 | /* |
091f362c MH |
876 | * Skip tasks without mm because it might have passed its exit_mm and |
877 | * exit_oom_victim. oom_reaper could have rescued that but do not rely | |
878 | * on that for now. We can consider find_lock_task_mm in future. | |
1af8bb43 | 879 | */ |
091f362c | 880 | if (!mm) |
1af8bb43 MH |
881 | return false; |
882 | ||
091f362c MH |
883 | if (!__task_will_free_mem(task)) |
884 | return false; | |
696453e6 MH |
885 | |
886 | /* | |
887 | * This task has already been drained by the oom reaper so there are | |
888 | * only small chances it will free some more | |
889 | */ | |
862e3073 | 890 | if (test_bit(MMF_OOM_SKIP, &mm->flags)) |
696453e6 | 891 | return false; |
696453e6 | 892 | |
091f362c | 893 | if (atomic_read(&mm->mm_users) <= 1) |
1af8bb43 | 894 | return true; |
1af8bb43 MH |
895 | |
896 | /* | |
5870c2e1 MH |
897 | * Make sure that all tasks which share the mm with the given tasks |
898 | * are dying as well to make sure that a) nobody pins its mm and | |
899 | * b) the task is also reapable by the oom reaper. | |
1af8bb43 MH |
900 | */ |
901 | rcu_read_lock(); | |
902 | for_each_process(p) { | |
903 | if (!process_shares_mm(p, mm)) | |
904 | continue; | |
905 | if (same_thread_group(task, p)) | |
906 | continue; | |
907 | ret = __task_will_free_mem(p); | |
908 | if (!ret) | |
909 | break; | |
910 | } | |
911 | rcu_read_unlock(); | |
1af8bb43 MH |
912 | |
913 | return ret; | |
914 | } | |
915 | ||
bbbe4802 | 916 | static void __oom_kill_process(struct task_struct *victim, const char *message) |
1da177e4 | 917 | { |
5989ad7b | 918 | struct task_struct *p; |
647f2bdf | 919 | struct mm_struct *mm; |
bb29902a | 920 | bool can_oom_reap = true; |
1da177e4 | 921 | |
6b0c81b3 DR |
922 | p = find_lock_task_mm(victim); |
923 | if (!p) { | |
619b5b46 YS |
924 | pr_info("%s: OOM victim %d (%s) is already exiting. Skip killing the task\n", |
925 | message, task_pid_nr(victim), victim->comm); | |
6b0c81b3 | 926 | put_task_struct(victim); |
647f2bdf | 927 | return; |
6b0c81b3 DR |
928 | } else if (victim != p) { |
929 | get_task_struct(p); | |
930 | put_task_struct(victim); | |
931 | victim = p; | |
932 | } | |
647f2bdf | 933 | |
880b7689 | 934 | /* Get a reference to safely compare mm after task_unlock(victim) */ |
647f2bdf | 935 | mm = victim->mm; |
f1f10076 | 936 | mmgrab(mm); |
8e675f7a KK |
937 | |
938 | /* Raise event before sending signal: task reaper must see this */ | |
939 | count_vm_event(OOM_KILL); | |
fe6bdfc8 | 940 | memcg_memory_event_mm(mm, MEMCG_OOM_KILL); |
8e675f7a | 941 | |
426fb5e7 | 942 | /* |
cd04ae1e MH |
943 | * We should send SIGKILL before granting access to memory reserves |
944 | * in order to prevent the OOM victim from depleting the memory | |
945 | * reserves from the user space under its control. | |
426fb5e7 | 946 | */ |
079b22dc | 947 | do_send_sig_info(SIGKILL, SEND_SIG_PRIV, victim, PIDTYPE_TGID); |
16e95196 | 948 | mark_oom_victim(victim); |
70cb6d26 EC |
949 | pr_err("%s: Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB, UID:%u pgtables:%lukB oom_score_adj:%hd\n", |
950 | message, task_pid_nr(victim), victim->comm, K(mm->total_vm), | |
951 | K(get_mm_counter(mm, MM_ANONPAGES)), | |
952 | K(get_mm_counter(mm, MM_FILEPAGES)), | |
953 | K(get_mm_counter(mm, MM_SHMEMPAGES)), | |
954 | from_kuid(&init_user_ns, task_uid(victim)), | |
941f762b | 955 | mm_pgtables_bytes(mm) >> 10, victim->signal->oom_score_adj); |
647f2bdf DR |
956 | task_unlock(victim); |
957 | ||
958 | /* | |
959 | * Kill all user processes sharing victim->mm in other thread groups, if | |
960 | * any. They don't get access to memory reserves, though, to avoid | |
c1e8d7c6 | 961 | * depletion of all memory. This prevents mm->mmap_lock livelock when an |
647f2bdf DR |
962 | * oom killed thread cannot exit because it requires the semaphore and |
963 | * its contended by another thread trying to allocate memory itself. | |
964 | * That thread will now get access to memory reserves since it has a | |
965 | * pending fatal signal. | |
966 | */ | |
4d4048be | 967 | rcu_read_lock(); |
c319025a | 968 | for_each_process(p) { |
4d7b3394 | 969 | if (!process_shares_mm(p, mm)) |
c319025a ON |
970 | continue; |
971 | if (same_thread_group(p, victim)) | |
972 | continue; | |
1b51e65e | 973 | if (is_global_init(p)) { |
aac45363 | 974 | can_oom_reap = false; |
862e3073 | 975 | set_bit(MMF_OOM_SKIP, &mm->flags); |
a373966d MH |
976 | pr_info("oom killer %d (%s) has mm pinned by %d (%s)\n", |
977 | task_pid_nr(victim), victim->comm, | |
978 | task_pid_nr(p), p->comm); | |
c319025a | 979 | continue; |
aac45363 | 980 | } |
1b51e65e | 981 | /* |
4c9c3809 | 982 | * No kthread_use_mm() user needs to read from the userspace so |
f5678e7f | 983 | * we are ok to reap it. |
1b51e65e MH |
984 | */ |
985 | if (unlikely(p->flags & PF_KTHREAD)) | |
986 | continue; | |
079b22dc | 987 | do_send_sig_info(SIGKILL, SEND_SIG_PRIV, p, PIDTYPE_TGID); |
c319025a | 988 | } |
6b0c81b3 | 989 | rcu_read_unlock(); |
647f2bdf | 990 | |
aac45363 | 991 | if (can_oom_reap) |
e4a38402 | 992 | queue_oom_reaper(victim); |
aac45363 | 993 | |
880b7689 | 994 | mmdrop(mm); |
6b0c81b3 | 995 | put_task_struct(victim); |
1da177e4 LT |
996 | } |
997 | ||
3d8b38eb RG |
998 | /* |
999 | * Kill provided task unless it's secured by setting | |
1000 | * oom_score_adj to OOM_SCORE_ADJ_MIN. | |
1001 | */ | |
bbbe4802 | 1002 | static int oom_kill_memcg_member(struct task_struct *task, void *message) |
3d8b38eb | 1003 | { |
d342a0b3 TH |
1004 | if (task->signal->oom_score_adj != OOM_SCORE_ADJ_MIN && |
1005 | !is_global_init(task)) { | |
3d8b38eb | 1006 | get_task_struct(task); |
bbbe4802 | 1007 | __oom_kill_process(task, message); |
3d8b38eb RG |
1008 | } |
1009 | return 0; | |
1010 | } | |
1011 | ||
5989ad7b RG |
1012 | static void oom_kill_process(struct oom_control *oc, const char *message) |
1013 | { | |
bbbe4802 | 1014 | struct task_struct *victim = oc->chosen; |
3d8b38eb | 1015 | struct mem_cgroup *oom_group; |
5989ad7b RG |
1016 | static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL, |
1017 | DEFAULT_RATELIMIT_BURST); | |
1018 | ||
1019 | /* | |
1020 | * If the task is already exiting, don't alarm the sysadmin or kill | |
1021 | * its children or threads, just give it access to memory reserves | |
1022 | * so it can die quickly | |
1023 | */ | |
bbbe4802 SB |
1024 | task_lock(victim); |
1025 | if (task_will_free_mem(victim)) { | |
1026 | mark_oom_victim(victim); | |
e4a38402 | 1027 | queue_oom_reaper(victim); |
bbbe4802 SB |
1028 | task_unlock(victim); |
1029 | put_task_struct(victim); | |
5989ad7b RG |
1030 | return; |
1031 | } | |
bbbe4802 | 1032 | task_unlock(victim); |
5989ad7b | 1033 | |
1f4f7f0f KS |
1034 | if (__ratelimit(&oom_rs)) { |
1035 | dump_header(oc); | |
1036 | dump_oom_victim(oc, victim); | |
1037 | } | |
5989ad7b | 1038 | |
3d8b38eb RG |
1039 | /* |
1040 | * Do we need to kill the entire memory cgroup? | |
1041 | * Or even one of the ancestor memory cgroups? | |
1042 | * Check this out before killing the victim task. | |
1043 | */ | |
1044 | oom_group = mem_cgroup_get_oom_group(victim, oc->memcg); | |
1045 | ||
bbbe4802 | 1046 | __oom_kill_process(victim, message); |
3d8b38eb RG |
1047 | |
1048 | /* | |
1049 | * If necessary, kill all tasks in the selected memory cgroup. | |
1050 | */ | |
1051 | if (oom_group) { | |
b6bf9abb | 1052 | memcg_memory_event(oom_group, MEMCG_OOM_GROUP_KILL); |
3d8b38eb | 1053 | mem_cgroup_print_oom_group(oom_group); |
bbbe4802 | 1054 | mem_cgroup_scan_tasks(oom_group, oom_kill_memcg_member, |
68d68ff6 | 1055 | (void *)message); |
3d8b38eb RG |
1056 | mem_cgroup_put(oom_group); |
1057 | } | |
5989ad7b RG |
1058 | } |
1059 | ||
309ed882 DR |
1060 | /* |
1061 | * Determines whether the kernel must panic because of the panic_on_oom sysctl. | |
1062 | */ | |
432b1de0 | 1063 | static void check_panic_on_oom(struct oom_control *oc) |
309ed882 DR |
1064 | { |
1065 | if (likely(!sysctl_panic_on_oom)) | |
1066 | return; | |
1067 | if (sysctl_panic_on_oom != 2) { | |
1068 | /* | |
1069 | * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel | |
1070 | * does not panic for cpuset, mempolicy, or memcg allocation | |
1071 | * failures. | |
1072 | */ | |
432b1de0 | 1073 | if (oc->constraint != CONSTRAINT_NONE) |
309ed882 DR |
1074 | return; |
1075 | } | |
071a4bef | 1076 | /* Do not panic for oom kills triggered by sysrq */ |
db2a0dd7 | 1077 | if (is_sysrq_oom(oc)) |
071a4bef | 1078 | return; |
1f4f7f0f | 1079 | dump_header(oc); |
309ed882 DR |
1080 | panic("Out of memory: %s panic_on_oom is enabled\n", |
1081 | sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide"); | |
1082 | } | |
1083 | ||
8bc719d3 MS |
1084 | static BLOCKING_NOTIFIER_HEAD(oom_notify_list); |
1085 | ||
1086 | int register_oom_notifier(struct notifier_block *nb) | |
1087 | { | |
1088 | return blocking_notifier_chain_register(&oom_notify_list, nb); | |
1089 | } | |
1090 | EXPORT_SYMBOL_GPL(register_oom_notifier); | |
1091 | ||
1092 | int unregister_oom_notifier(struct notifier_block *nb) | |
1093 | { | |
1094 | return blocking_notifier_chain_unregister(&oom_notify_list, nb); | |
1095 | } | |
1096 | EXPORT_SYMBOL_GPL(unregister_oom_notifier); | |
1097 | ||
1da177e4 | 1098 | /** |
6e0fc46d DR |
1099 | * out_of_memory - kill the "best" process when we run out of memory |
1100 | * @oc: pointer to struct oom_control | |
1da177e4 LT |
1101 | * |
1102 | * If we run out of memory, we have the choice between either | |
1103 | * killing a random task (bad), letting the system crash (worse) | |
1104 | * OR try to be smart about which process to kill. Note that we | |
1105 | * don't have to be perfect here, we just have to be good. | |
1106 | */ | |
6e0fc46d | 1107 | bool out_of_memory(struct oom_control *oc) |
1da177e4 | 1108 | { |
8bc719d3 MS |
1109 | unsigned long freed = 0; |
1110 | ||
dc56401f JW |
1111 | if (oom_killer_disabled) |
1112 | return false; | |
1113 | ||
7c5f64f8 VD |
1114 | if (!is_memcg_oom(oc)) { |
1115 | blocking_notifier_call_chain(&oom_notify_list, 0, &freed); | |
f530243a | 1116 | if (freed > 0 && !is_sysrq_oom(oc)) |
7c5f64f8 VD |
1117 | /* Got some memory back in the last second. */ |
1118 | return true; | |
1119 | } | |
1da177e4 | 1120 | |
7b98c2e4 | 1121 | /* |
9ff4868e DR |
1122 | * If current has a pending SIGKILL or is exiting, then automatically |
1123 | * select it. The goal is to allow it to allocate so that it may | |
1124 | * quickly exit and free its memory. | |
7b98c2e4 | 1125 | */ |
091f362c | 1126 | if (task_will_free_mem(current)) { |
16e95196 | 1127 | mark_oom_victim(current); |
e4a38402 | 1128 | queue_oom_reaper(current); |
75e8f8b2 | 1129 | return true; |
7b98c2e4 DR |
1130 | } |
1131 | ||
3da88fb3 MH |
1132 | /* |
1133 | * The OOM killer does not compensate for IO-less reclaim. | |
4822acb1 HX |
1134 | * But mem_cgroup_oom() has to invoke the OOM killer even |
1135 | * if it is a GFP_NOFS allocation. | |
3da88fb3 | 1136 | */ |
4822acb1 | 1137 | if (!(oc->gfp_mask & __GFP_FS) && !is_memcg_oom(oc)) |
3da88fb3 MH |
1138 | return true; |
1139 | ||
9b0f8b04 CL |
1140 | /* |
1141 | * Check if there were limitations on the allocation (only relevant for | |
7c5f64f8 | 1142 | * NUMA and memcg) that may require different handling. |
9b0f8b04 | 1143 | */ |
432b1de0 YS |
1144 | oc->constraint = constrained_alloc(oc); |
1145 | if (oc->constraint != CONSTRAINT_MEMORY_POLICY) | |
6e0fc46d | 1146 | oc->nodemask = NULL; |
432b1de0 | 1147 | check_panic_on_oom(oc); |
0aad4b31 | 1148 | |
7c5f64f8 | 1149 | if (!is_memcg_oom(oc) && sysctl_oom_kill_allocating_task && |
ac311a14 SB |
1150 | current->mm && !oom_unkillable_task(current) && |
1151 | oom_cpuset_eligible(current, oc) && | |
121d1ba0 | 1152 | current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) { |
6b0c81b3 | 1153 | get_task_struct(current); |
7c5f64f8 VD |
1154 | oc->chosen = current; |
1155 | oom_kill_process(oc, "Out of memory (oom_kill_allocating_task)"); | |
75e8f8b2 | 1156 | return true; |
0aad4b31 DR |
1157 | } |
1158 | ||
7c5f64f8 | 1159 | select_bad_process(oc); |
3100dab2 JW |
1160 | /* Found nothing?!?! */ |
1161 | if (!oc->chosen) { | |
1f4f7f0f | 1162 | dump_header(oc); |
3100dab2 JW |
1163 | pr_warn("Out of memory and no killable processes...\n"); |
1164 | /* | |
1165 | * If we got here due to an actual allocation at the | |
1166 | * system level, we cannot survive this and will enter | |
1167 | * an endless loop in the allocator. Bail out now. | |
1168 | */ | |
1169 | if (!is_sysrq_oom(oc) && !is_memcg_oom(oc)) | |
1170 | panic("System is deadlocked on memory\n"); | |
0aad4b31 | 1171 | } |
9bfe5ded | 1172 | if (oc->chosen && oc->chosen != (void *)-1UL) |
7c5f64f8 VD |
1173 | oom_kill_process(oc, !is_memcg_oom(oc) ? "Out of memory" : |
1174 | "Memory cgroup out of memory"); | |
7c5f64f8 | 1175 | return !!oc->chosen; |
c32b3cbe MH |
1176 | } |
1177 | ||
e3658932 | 1178 | /* |
60e2793d MH |
1179 | * The pagefault handler calls here because some allocation has failed. We have |
1180 | * to take care of the memcg OOM here because this is the only safe context without | |
1181 | * any locks held but let the oom killer triggered from the allocation context care | |
1182 | * about the global OOM. | |
e3658932 DR |
1183 | */ |
1184 | void pagefault_out_of_memory(void) | |
1185 | { | |
60e2793d MH |
1186 | static DEFINE_RATELIMIT_STATE(pfoom_rs, DEFAULT_RATELIMIT_INTERVAL, |
1187 | DEFAULT_RATELIMIT_BURST); | |
6e0fc46d | 1188 | |
49426420 | 1189 | if (mem_cgroup_oom_synchronize(true)) |
dc56401f | 1190 | return; |
3812c8c8 | 1191 | |
0b28179a | 1192 | if (fatal_signal_pending(current)) |
dc56401f | 1193 | return; |
0b28179a | 1194 | |
60e2793d MH |
1195 | if (__ratelimit(&pfoom_rs)) |
1196 | pr_warn("Huh VM_FAULT_OOM leaked out to the #PF handler. Retrying PF\n"); | |
e3658932 | 1197 | } |
884a7e59 SB |
1198 | |
1199 | SYSCALL_DEFINE2(process_mrelease, int, pidfd, unsigned int, flags) | |
1200 | { | |
1201 | #ifdef CONFIG_MMU | |
1202 | struct mm_struct *mm = NULL; | |
1203 | struct task_struct *task; | |
1204 | struct task_struct *p; | |
1205 | unsigned int f_flags; | |
337546e8 | 1206 | bool reap = false; |
884a7e59 SB |
1207 | long ret = 0; |
1208 | ||
1209 | if (flags) | |
1210 | return -EINVAL; | |
1211 | ||
ee9955d6 CB |
1212 | task = pidfd_get_task(pidfd, &f_flags); |
1213 | if (IS_ERR(task)) | |
1214 | return PTR_ERR(task); | |
884a7e59 SB |
1215 | |
1216 | /* | |
1217 | * Make sure to choose a thread which still has a reference to mm | |
1218 | * during the group exit | |
1219 | */ | |
1220 | p = find_lock_task_mm(task); | |
1221 | if (!p) { | |
1222 | ret = -ESRCH; | |
1223 | goto put_task; | |
1224 | } | |
1225 | ||
ba535c1c SB |
1226 | mm = p->mm; |
1227 | mmgrab(mm); | |
1228 | ||
1229 | if (task_will_free_mem(p)) | |
1230 | reap = true; | |
1231 | else { | |
1232 | /* Error only if the work has not been done already */ | |
1233 | if (!test_bit(MMF_OOM_SKIP, &mm->flags)) | |
1234 | ret = -EINVAL; | |
884a7e59 SB |
1235 | } |
1236 | task_unlock(p); | |
1237 | ||
1238 | if (!reap) | |
1239 | goto drop_mm; | |
1240 | ||
1241 | if (mmap_read_lock_killable(mm)) { | |
1242 | ret = -EINTR; | |
1243 | goto drop_mm; | |
1244 | } | |
ba535c1c SB |
1245 | /* |
1246 | * Check MMF_OOM_SKIP again under mmap_read_lock protection to ensure | |
1247 | * possible change in exit_mmap is seen | |
1248 | */ | |
1249 | if (!test_bit(MMF_OOM_SKIP, &mm->flags) && !__oom_reap_task_mm(mm)) | |
884a7e59 SB |
1250 | ret = -EAGAIN; |
1251 | mmap_read_unlock(mm); | |
1252 | ||
1253 | drop_mm: | |
ba535c1c | 1254 | mmdrop(mm); |
884a7e59 SB |
1255 | put_task: |
1256 | put_task_struct(task); | |
884a7e59 SB |
1257 | return ret; |
1258 | #else | |
1259 | return -ENOSYS; | |
1260 | #endif /* CONFIG_MMU */ | |
1261 | } |