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