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