]> git.proxmox.com Git - mirror_ubuntu-jammy-kernel.git/blame - mm/oom_kill.c
sched/headers: Prepare for new header dependencies before moving code to <linux/sched...
[mirror_ubuntu-jammy-kernel.git] / mm / oom_kill.c
CommitLineData
1da177e4
LT
1/*
2 * linux/mm/oom_kill.c
3 *
4 * Copyright (C) 1998,2000 Rik van Riel
5 * Thanks go out to Claus Fischer for some serious inspiration and
6 * for goading me into coding this file...
a63d83f4
DR
7 * Copyright (C) 2010 Google, Inc.
8 * Rewritten by David Rientjes
1da177e4
LT
9 *
10 * The routines in this file are used to kill a process when
a49335cc
PJ
11 * we're seriously out of memory. This gets called from __alloc_pages()
12 * in mm/page_alloc.c when we really run out of memory.
1da177e4
LT
13 *
14 * Since we won't call these routines often (on a well-configured
15 * machine) this file will double as a 'coding guide' and a signpost
16 * for newbie kernel hackers. It features several pointers to major
17 * kernel subsystems and hints as to where to find out what things do.
18 */
19
8ac773b4 20#include <linux/oom.h>
1da177e4 21#include <linux/mm.h>
4e950f6f 22#include <linux/err.h>
5a0e3ad6 23#include <linux/gfp.h>
1da177e4 24#include <linux/sched.h>
6e84f315 25#include <linux/sched/mm.h>
1da177e4
LT
26#include <linux/swap.h>
27#include <linux/timex.h>
28#include <linux/jiffies.h>
ef08e3b4 29#include <linux/cpuset.h>
b95f1b31 30#include <linux/export.h>
8bc719d3 31#include <linux/notifier.h>
c7ba5c9e 32#include <linux/memcontrol.h>
6f48d0eb 33#include <linux/mempolicy.h>
5cd9c58f 34#include <linux/security.h>
edd45544 35#include <linux/ptrace.h>
f660daac 36#include <linux/freezer.h>
43d2b113 37#include <linux/ftrace.h>
dc3f21ea 38#include <linux/ratelimit.h>
aac45363
MH
39#include <linux/kthread.h>
40#include <linux/init.h>
41
42#include <asm/tlb.h>
43#include "internal.h"
43d2b113
KH
44
45#define CREATE_TRACE_POINTS
46#include <trace/events/oom.h>
1da177e4 47
fadd8fbd 48int sysctl_panic_on_oom;
fe071d7e 49int sysctl_oom_kill_allocating_task;
ad915c43 50int sysctl_oom_dump_tasks = 1;
dc56401f
JW
51
52DEFINE_MUTEX(oom_lock);
1da177e4 53
6f48d0eb
DR
54#ifdef CONFIG_NUMA
55/**
56 * has_intersects_mems_allowed() - check task eligiblity for kill
ad962441 57 * @start: task struct of which task to consider
6f48d0eb
DR
58 * @mask: nodemask passed to page allocator for mempolicy ooms
59 *
60 * Task eligibility is determined by whether or not a candidate task, @tsk,
61 * shares the same mempolicy nodes as current if it is bound by such a policy
62 * and whether or not it has the same set of allowed cpuset nodes.
495789a5 63 */
ad962441 64static bool has_intersects_mems_allowed(struct task_struct *start,
6f48d0eb 65 const nodemask_t *mask)
495789a5 66{
ad962441
ON
67 struct task_struct *tsk;
68 bool ret = false;
495789a5 69
ad962441 70 rcu_read_lock();
1da4db0c 71 for_each_thread(start, tsk) {
6f48d0eb
DR
72 if (mask) {
73 /*
74 * If this is a mempolicy constrained oom, tsk's
75 * cpuset is irrelevant. Only return true if its
76 * mempolicy intersects current, otherwise it may be
77 * needlessly killed.
78 */
ad962441 79 ret = mempolicy_nodemask_intersects(tsk, mask);
6f48d0eb
DR
80 } else {
81 /*
82 * This is not a mempolicy constrained oom, so only
83 * check the mems of tsk's cpuset.
84 */
ad962441 85 ret = cpuset_mems_allowed_intersects(current, tsk);
6f48d0eb 86 }
ad962441
ON
87 if (ret)
88 break;
1da4db0c 89 }
ad962441 90 rcu_read_unlock();
df1090a8 91
ad962441 92 return ret;
6f48d0eb
DR
93}
94#else
95static bool has_intersects_mems_allowed(struct task_struct *tsk,
96 const nodemask_t *mask)
97{
98 return true;
495789a5 99}
6f48d0eb 100#endif /* CONFIG_NUMA */
495789a5 101
6f48d0eb
DR
102/*
103 * The process p may have detached its own ->mm while exiting or through
104 * use_mm(), but one or more of its subthreads may still have a valid
105 * pointer. Return p, or any of its subthreads with a valid ->mm, with
106 * task_lock() held.
107 */
158e0a2d 108struct task_struct *find_lock_task_mm(struct task_struct *p)
dd8e8f40 109{
1da4db0c 110 struct task_struct *t;
dd8e8f40 111
4d4048be
ON
112 rcu_read_lock();
113
1da4db0c 114 for_each_thread(p, t) {
dd8e8f40
ON
115 task_lock(t);
116 if (likely(t->mm))
4d4048be 117 goto found;
dd8e8f40 118 task_unlock(t);
1da4db0c 119 }
4d4048be
ON
120 t = NULL;
121found:
122 rcu_read_unlock();
dd8e8f40 123
4d4048be 124 return t;
dd8e8f40
ON
125}
126
db2a0dd7
YB
127/*
128 * order == -1 means the oom kill is required by sysrq, otherwise only
129 * for display purposes.
130 */
131static inline bool is_sysrq_oom(struct oom_control *oc)
132{
133 return oc->order == -1;
134}
135
7c5f64f8
VD
136static inline bool is_memcg_oom(struct oom_control *oc)
137{
138 return oc->memcg != NULL;
139}
140
ab290adb 141/* return true if the task is not adequate as candidate victim task. */
e85bfd3a 142static bool oom_unkillable_task(struct task_struct *p,
2314b42d 143 struct mem_cgroup *memcg, const nodemask_t *nodemask)
ab290adb
KM
144{
145 if (is_global_init(p))
146 return true;
147 if (p->flags & PF_KTHREAD)
148 return true;
149
150 /* When mem_cgroup_out_of_memory() and p is not member of the group */
72835c86 151 if (memcg && !task_in_mem_cgroup(p, memcg))
ab290adb
KM
152 return true;
153
154 /* p may not have freeable memory in nodemask */
155 if (!has_intersects_mems_allowed(p, nodemask))
156 return true;
157
158 return false;
159}
160
1da177e4 161/**
a63d83f4 162 * oom_badness - heuristic function to determine which candidate task to kill
1da177e4 163 * @p: task struct of which task we should calculate
a63d83f4 164 * @totalpages: total present RAM allowed for page allocation
1da177e4 165 *
a63d83f4
DR
166 * The heuristic for determining which task to kill is made to be as simple and
167 * predictable as possible. The goal is to return the highest value for the
168 * task consuming the most memory to avoid subsequent oom failures.
1da177e4 169 */
a7f638f9
DR
170unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
171 const nodemask_t *nodemask, unsigned long totalpages)
1da177e4 172{
1e11ad8d 173 long points;
61eafb00 174 long adj;
28b83c51 175
72835c86 176 if (oom_unkillable_task(p, memcg, nodemask))
26ebc984 177 return 0;
1da177e4 178
dd8e8f40
ON
179 p = find_lock_task_mm(p);
180 if (!p)
1da177e4
LT
181 return 0;
182
bb8a4b7f
MH
183 /*
184 * Do not even consider tasks which are explicitly marked oom
b18dc5f2
MH
185 * unkillable or have been already oom reaped or the are in
186 * the middle of vfork
bb8a4b7f 187 */
a9c58b90 188 adj = (long)p->signal->oom_score_adj;
bb8a4b7f 189 if (adj == OOM_SCORE_ADJ_MIN ||
862e3073 190 test_bit(MMF_OOM_SKIP, &p->mm->flags) ||
b18dc5f2 191 in_vfork(p)) {
5aecc85a
MH
192 task_unlock(p);
193 return 0;
194 }
195
1da177e4 196 /*
a63d83f4 197 * The baseline for the badness score is the proportion of RAM that each
f755a042 198 * task's rss, pagetable and swap space use.
1da177e4 199 */
dc6c9a35
KS
200 points = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) +
201 atomic_long_read(&p->mm->nr_ptes) + mm_nr_pmds(p->mm);
a63d83f4 202 task_unlock(p);
1da177e4
LT
203
204 /*
a63d83f4
DR
205 * Root processes get 3% bonus, just like the __vm_enough_memory()
206 * implementation used by LSMs.
1da177e4 207 */
a63d83f4 208 if (has_capability_noaudit(p, CAP_SYS_ADMIN))
778c14af 209 points -= (points * 3) / 100;
1da177e4 210
61eafb00
DR
211 /* Normalize to oom_score_adj units */
212 adj *= totalpages / 1000;
213 points += adj;
1da177e4 214
f19e8aa1 215 /*
a7f638f9
DR
216 * Never return 0 for an eligible task regardless of the root bonus and
217 * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).
f19e8aa1 218 */
1e11ad8d 219 return points > 0 ? points : 1;
1da177e4
LT
220}
221
7c5f64f8
VD
222enum oom_constraint {
223 CONSTRAINT_NONE,
224 CONSTRAINT_CPUSET,
225 CONSTRAINT_MEMORY_POLICY,
226 CONSTRAINT_MEMCG,
227};
228
9b0f8b04
CL
229/*
230 * Determine the type of allocation constraint.
231 */
7c5f64f8 232static enum oom_constraint constrained_alloc(struct oom_control *oc)
4365a567 233{
54a6eb5c 234 struct zone *zone;
dd1a239f 235 struct zoneref *z;
6e0fc46d 236 enum zone_type high_zoneidx = gfp_zone(oc->gfp_mask);
a63d83f4
DR
237 bool cpuset_limited = false;
238 int nid;
9b0f8b04 239
7c5f64f8
VD
240 if (is_memcg_oom(oc)) {
241 oc->totalpages = mem_cgroup_get_limit(oc->memcg) ?: 1;
242 return CONSTRAINT_MEMCG;
243 }
244
a63d83f4 245 /* Default to all available memory */
7c5f64f8
VD
246 oc->totalpages = totalram_pages + total_swap_pages;
247
248 if (!IS_ENABLED(CONFIG_NUMA))
249 return CONSTRAINT_NONE;
a63d83f4 250
6e0fc46d 251 if (!oc->zonelist)
a63d83f4 252 return CONSTRAINT_NONE;
4365a567
KH
253 /*
254 * Reach here only when __GFP_NOFAIL is used. So, we should avoid
255 * to kill current.We have to random task kill in this case.
256 * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
257 */
6e0fc46d 258 if (oc->gfp_mask & __GFP_THISNODE)
4365a567 259 return CONSTRAINT_NONE;
9b0f8b04 260
4365a567 261 /*
a63d83f4
DR
262 * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
263 * the page allocator means a mempolicy is in effect. Cpuset policy
264 * is enforced in get_page_from_freelist().
4365a567 265 */
6e0fc46d
DR
266 if (oc->nodemask &&
267 !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {
7c5f64f8 268 oc->totalpages = total_swap_pages;
6e0fc46d 269 for_each_node_mask(nid, *oc->nodemask)
7c5f64f8 270 oc->totalpages += node_spanned_pages(nid);
9b0f8b04 271 return CONSTRAINT_MEMORY_POLICY;
a63d83f4 272 }
4365a567
KH
273
274 /* Check this allocation failure is caused by cpuset's wall function */
6e0fc46d
DR
275 for_each_zone_zonelist_nodemask(zone, z, oc->zonelist,
276 high_zoneidx, oc->nodemask)
277 if (!cpuset_zone_allowed(zone, oc->gfp_mask))
a63d83f4 278 cpuset_limited = true;
9b0f8b04 279
a63d83f4 280 if (cpuset_limited) {
7c5f64f8 281 oc->totalpages = total_swap_pages;
a63d83f4 282 for_each_node_mask(nid, cpuset_current_mems_allowed)
7c5f64f8 283 oc->totalpages += node_spanned_pages(nid);
a63d83f4
DR
284 return CONSTRAINT_CPUSET;
285 }
9b0f8b04
CL
286 return CONSTRAINT_NONE;
287}
288
7c5f64f8 289static int oom_evaluate_task(struct task_struct *task, void *arg)
462607ec 290{
7c5f64f8
VD
291 struct oom_control *oc = arg;
292 unsigned long points;
293
6e0fc46d 294 if (oom_unkillable_task(task, NULL, oc->nodemask))
7c5f64f8 295 goto next;
462607ec
DR
296
297 /*
298 * This task already has access to memory reserves and is being killed.
a373966d 299 * Don't allow any other task to have access to the reserves unless
862e3073 300 * the task has MMF_OOM_SKIP because chances that it would release
a373966d 301 * any memory is quite low.
462607ec 302 */
862e3073
MH
303 if (!is_sysrq_oom(oc) && tsk_is_oom_victim(task)) {
304 if (test_bit(MMF_OOM_SKIP, &task->signal->oom_mm->flags))
7c5f64f8
VD
305 goto next;
306 goto abort;
a373966d 307 }
462607ec 308
e1e12d2f
DR
309 /*
310 * If task is allocating a lot of memory and has been marked to be
311 * killed first if it triggers an oom, then select it.
312 */
7c5f64f8
VD
313 if (oom_task_origin(task)) {
314 points = ULONG_MAX;
315 goto select;
316 }
e1e12d2f 317
7c5f64f8
VD
318 points = oom_badness(task, NULL, oc->nodemask, oc->totalpages);
319 if (!points || points < oc->chosen_points)
320 goto next;
321
322 /* Prefer thread group leaders for display purposes */
323 if (points == oc->chosen_points && thread_group_leader(oc->chosen))
324 goto next;
325select:
326 if (oc->chosen)
327 put_task_struct(oc->chosen);
328 get_task_struct(task);
329 oc->chosen = task;
330 oc->chosen_points = points;
331next:
332 return 0;
333abort:
334 if (oc->chosen)
335 put_task_struct(oc->chosen);
336 oc->chosen = (void *)-1UL;
337 return 1;
462607ec
DR
338}
339
1da177e4 340/*
7c5f64f8
VD
341 * Simple selection loop. We choose the process with the highest number of
342 * 'points'. In case scan was aborted, oc->chosen is set to -1.
1da177e4 343 */
7c5f64f8 344static void select_bad_process(struct oom_control *oc)
1da177e4 345{
7c5f64f8
VD
346 if (is_memcg_oom(oc))
347 mem_cgroup_scan_tasks(oc->memcg, oom_evaluate_task, oc);
348 else {
349 struct task_struct *p;
d49ad935 350
7c5f64f8
VD
351 rcu_read_lock();
352 for_each_process(p)
353 if (oom_evaluate_task(p, oc))
354 break;
355 rcu_read_unlock();
1da4db0c 356 }
972c4ea5 357
7c5f64f8 358 oc->chosen_points = oc->chosen_points * 1000 / oc->totalpages;
1da177e4
LT
359}
360
fef1bdd6 361/**
1b578df0 362 * dump_tasks - dump current memory state of all system tasks
dad7557e 363 * @memcg: current's memory controller, if constrained
e85bfd3a 364 * @nodemask: nodemask passed to page allocator for mempolicy ooms
1b578df0 365 *
e85bfd3a
DR
366 * Dumps the current memory state of all eligible tasks. Tasks not in the same
367 * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
368 * are not shown.
de34d965
DR
369 * State information includes task's pid, uid, tgid, vm size, rss, nr_ptes,
370 * swapents, oom_score_adj value, and name.
fef1bdd6 371 */
2314b42d 372static void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask)
fef1bdd6 373{
c55db957
KM
374 struct task_struct *p;
375 struct task_struct *task;
fef1bdd6 376
dc6c9a35 377 pr_info("[ pid ] uid tgid total_vm rss nr_ptes nr_pmds swapents oom_score_adj name\n");
6b0c81b3 378 rcu_read_lock();
c55db957 379 for_each_process(p) {
72835c86 380 if (oom_unkillable_task(p, memcg, nodemask))
b4416d2b 381 continue;
fef1bdd6 382
c55db957
KM
383 task = find_lock_task_mm(p);
384 if (!task) {
6d2661ed 385 /*
74ab7f1d
DR
386 * This is a kthread or all of p's threads have already
387 * detached their mm's. There's no need to report
c55db957 388 * them; they can't be oom killed anyway.
6d2661ed 389 */
6d2661ed
DR
390 continue;
391 }
c55db957 392
dc6c9a35 393 pr_info("[%5d] %5d %5d %8lu %8lu %7ld %7ld %8lu %5hd %s\n",
078de5f7
EB
394 task->pid, from_kuid(&init_user_ns, task_uid(task)),
395 task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
e1f56c89 396 atomic_long_read(&task->mm->nr_ptes),
dc6c9a35 397 mm_nr_pmds(task->mm),
de34d965 398 get_mm_counter(task->mm, MM_SWAPENTS),
a63d83f4 399 task->signal->oom_score_adj, task->comm);
c55db957
KM
400 task_unlock(task);
401 }
6b0c81b3 402 rcu_read_unlock();
fef1bdd6
DR
403}
404
2a966b77 405static void dump_header(struct oom_control *oc, struct task_struct *p)
1b604d75 406{
299c517a
DR
407 pr_warn("%s invoked oom-killer: gfp_mask=%#x(%pGg), nodemask=",
408 current->comm, oc->gfp_mask, &oc->gfp_mask);
409 if (oc->nodemask)
410 pr_cont("%*pbl", nodemask_pr_args(oc->nodemask));
411 else
412 pr_cont("(null)");
413 pr_cont(", order=%d, oom_score_adj=%hd\n",
414 oc->order, current->signal->oom_score_adj);
9254990f
MH
415 if (!IS_ENABLED(CONFIG_COMPACTION) && oc->order)
416 pr_warn("COMPACTION is disabled!!!\n");
a0795cd4 417
da39da3a 418 cpuset_print_current_mems_allowed();
1b604d75 419 dump_stack();
2a966b77
VD
420 if (oc->memcg)
421 mem_cgroup_print_oom_info(oc->memcg, p);
58cf188e 422 else
299c517a 423 show_mem(SHOW_MEM_FILTER_NODES, oc->nodemask);
1b604d75 424 if (sysctl_oom_dump_tasks)
2a966b77 425 dump_tasks(oc->memcg, oc->nodemask);
1b604d75
DR
426}
427
5695be14 428/*
c32b3cbe 429 * Number of OOM victims in flight
5695be14 430 */
c32b3cbe
MH
431static atomic_t oom_victims = ATOMIC_INIT(0);
432static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);
5695be14 433
7c5f64f8 434static bool oom_killer_disabled __read_mostly;
5695be14 435
bc448e89
MH
436#define K(x) ((x) << (PAGE_SHIFT-10))
437
3ef22dff
MH
438/*
439 * task->mm can be NULL if the task is the exited group leader. So to
440 * determine whether the task is using a particular mm, we examine all the
441 * task's threads: if one of those is using this mm then this task was also
442 * using it.
443 */
44a70ade 444bool process_shares_mm(struct task_struct *p, struct mm_struct *mm)
3ef22dff
MH
445{
446 struct task_struct *t;
447
448 for_each_thread(p, t) {
449 struct mm_struct *t_mm = READ_ONCE(t->mm);
450 if (t_mm)
451 return t_mm == mm;
452 }
453 return false;
454}
455
456
aac45363
MH
457#ifdef CONFIG_MMU
458/*
459 * OOM Reaper kernel thread which tries to reap the memory used by the OOM
460 * victim (if that is possible) to help the OOM killer to move on.
461 */
462static struct task_struct *oom_reaper_th;
aac45363 463static DECLARE_WAIT_QUEUE_HEAD(oom_reaper_wait);
29c696e1 464static struct task_struct *oom_reaper_list;
03049269
MH
465static DEFINE_SPINLOCK(oom_reaper_lock);
466
7ebffa45 467static bool __oom_reap_task_mm(struct task_struct *tsk, struct mm_struct *mm)
aac45363
MH
468{
469 struct mmu_gather tlb;
470 struct vm_area_struct *vma;
aac45363
MH
471 bool ret = true;
472
e2fe1456
MH
473 /*
474 * We have to make sure to not race with the victim exit path
475 * and cause premature new oom victim selection:
7ebffa45 476 * __oom_reap_task_mm exit_mm
e5e3f4c4 477 * mmget_not_zero
e2fe1456
MH
478 * mmput
479 * atomic_dec_and_test
480 * exit_oom_victim
481 * [...]
482 * out_of_memory
483 * select_bad_process
484 * # no TIF_MEMDIE task selects new victim
485 * unmap_page_range # frees some memory
486 */
487 mutex_lock(&oom_lock);
488
aac45363
MH
489 if (!down_read_trylock(&mm->mmap_sem)) {
490 ret = false;
7ebffa45 491 goto unlock_oom;
e5e3f4c4
MH
492 }
493
494 /*
495 * increase mm_users only after we know we will reap something so
496 * that the mmput_async is called only when we have reaped something
497 * and delayed __mmput doesn't matter that much
498 */
499 if (!mmget_not_zero(mm)) {
500 up_read(&mm->mmap_sem);
7ebffa45 501 goto unlock_oom;
aac45363
MH
502 }
503
3f70dc38
MH
504 /*
505 * Tell all users of get_user/copy_from_user etc... that the content
506 * is no longer stable. No barriers really needed because unmapping
507 * should imply barriers already and the reader would hit a page fault
508 * if it stumbled over a reaped memory.
509 */
510 set_bit(MMF_UNSTABLE, &mm->flags);
511
aac45363
MH
512 tlb_gather_mmu(&tlb, mm, 0, -1);
513 for (vma = mm->mmap ; vma; vma = vma->vm_next) {
23519073 514 if (!can_madv_dontneed_vma(vma))
aac45363
MH
515 continue;
516
517 /*
518 * Only anonymous pages have a good chance to be dropped
519 * without additional steps which we cannot afford as we
520 * are OOM already.
521 *
522 * We do not even care about fs backed pages because all
523 * which are reclaimable have already been reclaimed and
524 * we do not want to block exit_mmap by keeping mm ref
525 * count elevated without a good reason.
526 */
527 if (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED))
528 unmap_page_range(&tlb, vma, vma->vm_start, vma->vm_end,
3e8715fd 529 NULL);
aac45363
MH
530 }
531 tlb_finish_mmu(&tlb, 0, -1);
bc448e89
MH
532 pr_info("oom_reaper: reaped process %d (%s), now anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
533 task_pid_nr(tsk), tsk->comm,
534 K(get_mm_counter(mm, MM_ANONPAGES)),
535 K(get_mm_counter(mm, MM_FILEPAGES)),
536 K(get_mm_counter(mm, MM_SHMEMPAGES)));
aac45363 537 up_read(&mm->mmap_sem);
36324a99 538
ec8d7c14
MH
539 /*
540 * Drop our reference but make sure the mmput slow path is called from a
541 * different context because we shouldn't risk we get stuck there and
542 * put the oom_reaper out of the way.
543 */
e5e3f4c4 544 mmput_async(mm);
e5e3f4c4
MH
545unlock_oom:
546 mutex_unlock(&oom_lock);
aac45363
MH
547 return ret;
548}
549
bc448e89 550#define MAX_OOM_REAP_RETRIES 10
36324a99 551static void oom_reap_task(struct task_struct *tsk)
aac45363
MH
552{
553 int attempts = 0;
26db62f1 554 struct mm_struct *mm = tsk->signal->oom_mm;
aac45363
MH
555
556 /* Retry the down_read_trylock(mmap_sem) a few times */
7ebffa45 557 while (attempts++ < MAX_OOM_REAP_RETRIES && !__oom_reap_task_mm(tsk, mm))
aac45363
MH
558 schedule_timeout_idle(HZ/10);
559
7ebffa45
TH
560 if (attempts <= MAX_OOM_REAP_RETRIES)
561 goto done;
11a410d5 562
8496afab 563
7ebffa45
TH
564 pr_info("oom_reaper: unable to reap pid:%d (%s)\n",
565 task_pid_nr(tsk), tsk->comm);
7ebffa45 566 debug_show_all_locks();
bc448e89 567
7ebffa45 568done:
449d777d 569 tsk->oom_reaper_list = NULL;
449d777d 570
26db62f1
MH
571 /*
572 * Hide this mm from OOM killer because it has been either reaped or
573 * somebody can't call up_write(mmap_sem).
574 */
862e3073 575 set_bit(MMF_OOM_SKIP, &mm->flags);
26db62f1 576
aac45363 577 /* Drop a reference taken by wake_oom_reaper */
36324a99 578 put_task_struct(tsk);
aac45363
MH
579}
580
581static int oom_reaper(void *unused)
582{
583 while (true) {
03049269 584 struct task_struct *tsk = NULL;
aac45363 585
29c696e1 586 wait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL);
03049269 587 spin_lock(&oom_reaper_lock);
29c696e1
VD
588 if (oom_reaper_list != NULL) {
589 tsk = oom_reaper_list;
590 oom_reaper_list = tsk->oom_reaper_list;
03049269
MH
591 }
592 spin_unlock(&oom_reaper_lock);
593
594 if (tsk)
595 oom_reap_task(tsk);
aac45363
MH
596 }
597
598 return 0;
599}
600
7c5f64f8 601static void wake_oom_reaper(struct task_struct *tsk)
aac45363 602{
af8e15cc
MH
603 if (!oom_reaper_th)
604 return;
605
606 /* tsk is already queued? */
607 if (tsk == oom_reaper_list || tsk->oom_reaper_list)
aac45363
MH
608 return;
609
36324a99 610 get_task_struct(tsk);
aac45363 611
03049269 612 spin_lock(&oom_reaper_lock);
29c696e1
VD
613 tsk->oom_reaper_list = oom_reaper_list;
614 oom_reaper_list = tsk;
03049269
MH
615 spin_unlock(&oom_reaper_lock);
616 wake_up(&oom_reaper_wait);
aac45363
MH
617}
618
619static int __init oom_init(void)
620{
621 oom_reaper_th = kthread_run(oom_reaper, NULL, "oom_reaper");
622 if (IS_ERR(oom_reaper_th)) {
623 pr_err("Unable to start OOM reaper %ld. Continuing regardless\n",
624 PTR_ERR(oom_reaper_th));
625 oom_reaper_th = NULL;
626 }
627 return 0;
628}
629subsys_initcall(oom_init)
7c5f64f8
VD
630#else
631static inline void wake_oom_reaper(struct task_struct *tsk)
632{
633}
634#endif /* CONFIG_MMU */
aac45363 635
49550b60 636/**
16e95196 637 * mark_oom_victim - mark the given task as OOM victim
49550b60 638 * @tsk: task to mark
c32b3cbe 639 *
dc56401f 640 * Has to be called with oom_lock held and never after
c32b3cbe 641 * oom has been disabled already.
26db62f1
MH
642 *
643 * tsk->mm has to be non NULL and caller has to guarantee it is stable (either
644 * under task_lock or operate on the current).
49550b60 645 */
7c5f64f8 646static void mark_oom_victim(struct task_struct *tsk)
49550b60 647{
26db62f1
MH
648 struct mm_struct *mm = tsk->mm;
649
c32b3cbe
MH
650 WARN_ON(oom_killer_disabled);
651 /* OOM killer might race with memcg OOM */
652 if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))
653 return;
26db62f1 654
26db62f1
MH
655 /* oom_mm is bound to the signal struct life time. */
656 if (!cmpxchg(&tsk->signal->oom_mm, NULL, mm))
f1f10076 657 mmgrab(tsk->signal->oom_mm);
26db62f1 658
63a8ca9b
MH
659 /*
660 * Make sure that the task is woken up from uninterruptible sleep
661 * if it is frozen because OOM killer wouldn't be able to free
662 * any memory and livelock. freezing_slow_path will tell the freezer
663 * that TIF_MEMDIE tasks should be ignored.
664 */
665 __thaw_task(tsk);
c32b3cbe 666 atomic_inc(&oom_victims);
49550b60
MH
667}
668
669/**
16e95196 670 * exit_oom_victim - note the exit of an OOM victim
49550b60 671 */
38531201 672void exit_oom_victim(void)
49550b60 673{
38531201 674 clear_thread_flag(TIF_MEMDIE);
c32b3cbe 675
c38f1025 676 if (!atomic_dec_return(&oom_victims))
c32b3cbe 677 wake_up_all(&oom_victims_wait);
c32b3cbe
MH
678}
679
7d2e7a22
MH
680/**
681 * oom_killer_enable - enable OOM killer
682 */
683void oom_killer_enable(void)
684{
685 oom_killer_disabled = false;
686}
687
c32b3cbe
MH
688/**
689 * oom_killer_disable - disable OOM killer
7d2e7a22 690 * @timeout: maximum timeout to wait for oom victims in jiffies
c32b3cbe
MH
691 *
692 * Forces all page allocations to fail rather than trigger OOM killer.
7d2e7a22
MH
693 * Will block and wait until all OOM victims are killed or the given
694 * timeout expires.
c32b3cbe
MH
695 *
696 * The function cannot be called when there are runnable user tasks because
697 * the userspace would see unexpected allocation failures as a result. Any
698 * new usage of this function should be consulted with MM people.
699 *
700 * Returns true if successful and false if the OOM killer cannot be
701 * disabled.
702 */
7d2e7a22 703bool oom_killer_disable(signed long timeout)
c32b3cbe 704{
7d2e7a22
MH
705 signed long ret;
706
c32b3cbe 707 /*
6afcf289
TH
708 * Make sure to not race with an ongoing OOM killer. Check that the
709 * current is not killed (possibly due to sharing the victim's memory).
c32b3cbe 710 */
6afcf289 711 if (mutex_lock_killable(&oom_lock))
c32b3cbe 712 return false;
c32b3cbe 713 oom_killer_disabled = true;
dc56401f 714 mutex_unlock(&oom_lock);
c32b3cbe 715
7d2e7a22
MH
716 ret = wait_event_interruptible_timeout(oom_victims_wait,
717 !atomic_read(&oom_victims), timeout);
718 if (ret <= 0) {
719 oom_killer_enable();
720 return false;
721 }
c32b3cbe
MH
722
723 return true;
724}
725
1af8bb43
MH
726static inline bool __task_will_free_mem(struct task_struct *task)
727{
728 struct signal_struct *sig = task->signal;
729
730 /*
731 * A coredumping process may sleep for an extended period in exit_mm(),
732 * so the oom killer cannot assume that the process will promptly exit
733 * and release memory.
734 */
735 if (sig->flags & SIGNAL_GROUP_COREDUMP)
736 return false;
737
738 if (sig->flags & SIGNAL_GROUP_EXIT)
739 return true;
740
741 if (thread_group_empty(task) && (task->flags & PF_EXITING))
742 return true;
743
744 return false;
745}
746
747/*
748 * Checks whether the given task is dying or exiting and likely to
749 * release its address space. This means that all threads and processes
750 * sharing the same mm have to be killed or exiting.
091f362c
MH
751 * Caller has to make sure that task->mm is stable (hold task_lock or
752 * it operates on the current).
1af8bb43 753 */
7c5f64f8 754static bool task_will_free_mem(struct task_struct *task)
1af8bb43 755{
091f362c 756 struct mm_struct *mm = task->mm;
1af8bb43 757 struct task_struct *p;
f33e6f06 758 bool ret = true;
1af8bb43 759
1af8bb43 760 /*
091f362c
MH
761 * Skip tasks without mm because it might have passed its exit_mm and
762 * exit_oom_victim. oom_reaper could have rescued that but do not rely
763 * on that for now. We can consider find_lock_task_mm in future.
1af8bb43 764 */
091f362c 765 if (!mm)
1af8bb43
MH
766 return false;
767
091f362c
MH
768 if (!__task_will_free_mem(task))
769 return false;
696453e6
MH
770
771 /*
772 * This task has already been drained by the oom reaper so there are
773 * only small chances it will free some more
774 */
862e3073 775 if (test_bit(MMF_OOM_SKIP, &mm->flags))
696453e6 776 return false;
696453e6 777
091f362c 778 if (atomic_read(&mm->mm_users) <= 1)
1af8bb43 779 return true;
1af8bb43
MH
780
781 /*
5870c2e1
MH
782 * Make sure that all tasks which share the mm with the given tasks
783 * are dying as well to make sure that a) nobody pins its mm and
784 * b) the task is also reapable by the oom reaper.
1af8bb43
MH
785 */
786 rcu_read_lock();
787 for_each_process(p) {
788 if (!process_shares_mm(p, mm))
789 continue;
790 if (same_thread_group(task, p))
791 continue;
792 ret = __task_will_free_mem(p);
793 if (!ret)
794 break;
795 }
796 rcu_read_unlock();
1af8bb43
MH
797
798 return ret;
799}
800
7c5f64f8 801static void oom_kill_process(struct oom_control *oc, const char *message)
1da177e4 802{
7c5f64f8
VD
803 struct task_struct *p = oc->chosen;
804 unsigned int points = oc->chosen_points;
52d3c036 805 struct task_struct *victim = p;
5e9d834a 806 struct task_struct *child;
1da4db0c 807 struct task_struct *t;
647f2bdf 808 struct mm_struct *mm;
52d3c036 809 unsigned int victim_points = 0;
dc3f21ea
DR
810 static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
811 DEFAULT_RATELIMIT_BURST);
bb29902a 812 bool can_oom_reap = true;
1da177e4 813
50ec3bbf
NP
814 /*
815 * If the task is already exiting, don't alarm the sysadmin or kill
816 * its children or threads, just set TIF_MEMDIE so it can die quickly
817 */
091f362c 818 task_lock(p);
1af8bb43 819 if (task_will_free_mem(p)) {
16e95196 820 mark_oom_victim(p);
1af8bb43 821 wake_oom_reaper(p);
091f362c 822 task_unlock(p);
6b0c81b3 823 put_task_struct(p);
2a1c9b1f 824 return;
50ec3bbf 825 }
091f362c 826 task_unlock(p);
50ec3bbf 827
dc3f21ea 828 if (__ratelimit(&oom_rs))
2a966b77 829 dump_header(oc, p);
8447d950 830
f0d6647e 831 pr_err("%s: Kill process %d (%s) score %u or sacrifice child\n",
5e9d834a 832 message, task_pid_nr(p), p->comm, points);
f3af38d3 833
5e9d834a
DR
834 /*
835 * If any of p's children has a different mm and is eligible for kill,
11239836 836 * the one with the highest oom_badness() score is sacrificed for its
5e9d834a
DR
837 * parent. This attempts to lose the minimal amount of work done while
838 * still freeing memory.
839 */
6b0c81b3 840 read_lock(&tasklist_lock);
1da4db0c 841 for_each_thread(p, t) {
5e9d834a 842 list_for_each_entry(child, &t->children, sibling) {
a63d83f4 843 unsigned int child_points;
5e9d834a 844
4d7b3394 845 if (process_shares_mm(child, p->mm))
edd45544 846 continue;
a63d83f4
DR
847 /*
848 * oom_badness() returns 0 if the thread is unkillable
849 */
2a966b77 850 child_points = oom_badness(child,
7c5f64f8 851 oc->memcg, oc->nodemask, oc->totalpages);
5e9d834a 852 if (child_points > victim_points) {
6b0c81b3 853 put_task_struct(victim);
5e9d834a
DR
854 victim = child;
855 victim_points = child_points;
6b0c81b3 856 get_task_struct(victim);
5e9d834a 857 }
dd8e8f40 858 }
1da4db0c 859 }
6b0c81b3 860 read_unlock(&tasklist_lock);
dd8e8f40 861
6b0c81b3
DR
862 p = find_lock_task_mm(victim);
863 if (!p) {
6b0c81b3 864 put_task_struct(victim);
647f2bdf 865 return;
6b0c81b3
DR
866 } else if (victim != p) {
867 get_task_struct(p);
868 put_task_struct(victim);
869 victim = p;
870 }
647f2bdf 871
880b7689 872 /* Get a reference to safely compare mm after task_unlock(victim) */
647f2bdf 873 mm = victim->mm;
f1f10076 874 mmgrab(mm);
426fb5e7
TH
875 /*
876 * We should send SIGKILL before setting TIF_MEMDIE in order to prevent
877 * the OOM victim from depleting the memory reserves from the user
878 * space under its control.
879 */
880 do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
16e95196 881 mark_oom_victim(victim);
eca56ff9 882 pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
647f2bdf
DR
883 task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
884 K(get_mm_counter(victim->mm, MM_ANONPAGES)),
eca56ff9
JM
885 K(get_mm_counter(victim->mm, MM_FILEPAGES)),
886 K(get_mm_counter(victim->mm, MM_SHMEMPAGES)));
647f2bdf
DR
887 task_unlock(victim);
888
889 /*
890 * Kill all user processes sharing victim->mm in other thread groups, if
891 * any. They don't get access to memory reserves, though, to avoid
892 * depletion of all memory. This prevents mm->mmap_sem livelock when an
893 * oom killed thread cannot exit because it requires the semaphore and
894 * its contended by another thread trying to allocate memory itself.
895 * That thread will now get access to memory reserves since it has a
896 * pending fatal signal.
897 */
4d4048be 898 rcu_read_lock();
c319025a 899 for_each_process(p) {
4d7b3394 900 if (!process_shares_mm(p, mm))
c319025a
ON
901 continue;
902 if (same_thread_group(p, victim))
903 continue;
1b51e65e 904 if (is_global_init(p)) {
aac45363 905 can_oom_reap = false;
862e3073 906 set_bit(MMF_OOM_SKIP, &mm->flags);
a373966d
MH
907 pr_info("oom killer %d (%s) has mm pinned by %d (%s)\n",
908 task_pid_nr(victim), victim->comm,
909 task_pid_nr(p), p->comm);
c319025a 910 continue;
aac45363 911 }
1b51e65e
MH
912 /*
913 * No use_mm() user needs to read from the userspace so we are
914 * ok to reap it.
915 */
916 if (unlikely(p->flags & PF_KTHREAD))
917 continue;
c319025a
ON
918 do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
919 }
6b0c81b3 920 rcu_read_unlock();
647f2bdf 921
aac45363 922 if (can_oom_reap)
36324a99 923 wake_oom_reaper(victim);
aac45363 924
880b7689 925 mmdrop(mm);
6b0c81b3 926 put_task_struct(victim);
1da177e4 927}
647f2bdf 928#undef K
1da177e4 929
309ed882
DR
930/*
931 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
932 */
7c5f64f8
VD
933static void check_panic_on_oom(struct oom_control *oc,
934 enum oom_constraint constraint)
309ed882
DR
935{
936 if (likely(!sysctl_panic_on_oom))
937 return;
938 if (sysctl_panic_on_oom != 2) {
939 /*
940 * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
941 * does not panic for cpuset, mempolicy, or memcg allocation
942 * failures.
943 */
944 if (constraint != CONSTRAINT_NONE)
945 return;
946 }
071a4bef 947 /* Do not panic for oom kills triggered by sysrq */
db2a0dd7 948 if (is_sysrq_oom(oc))
071a4bef 949 return;
2a966b77 950 dump_header(oc, NULL);
309ed882
DR
951 panic("Out of memory: %s panic_on_oom is enabled\n",
952 sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
953}
954
8bc719d3
MS
955static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
956
957int register_oom_notifier(struct notifier_block *nb)
958{
959 return blocking_notifier_chain_register(&oom_notify_list, nb);
960}
961EXPORT_SYMBOL_GPL(register_oom_notifier);
962
963int unregister_oom_notifier(struct notifier_block *nb)
964{
965 return blocking_notifier_chain_unregister(&oom_notify_list, nb);
966}
967EXPORT_SYMBOL_GPL(unregister_oom_notifier);
968
1da177e4 969/**
6e0fc46d
DR
970 * out_of_memory - kill the "best" process when we run out of memory
971 * @oc: pointer to struct oom_control
1da177e4
LT
972 *
973 * If we run out of memory, we have the choice between either
974 * killing a random task (bad), letting the system crash (worse)
975 * OR try to be smart about which process to kill. Note that we
976 * don't have to be perfect here, we just have to be good.
977 */
6e0fc46d 978bool out_of_memory(struct oom_control *oc)
1da177e4 979{
8bc719d3 980 unsigned long freed = 0;
e3658932 981 enum oom_constraint constraint = CONSTRAINT_NONE;
8bc719d3 982
dc56401f
JW
983 if (oom_killer_disabled)
984 return false;
985
7c5f64f8
VD
986 if (!is_memcg_oom(oc)) {
987 blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
988 if (freed > 0)
989 /* Got some memory back in the last second. */
990 return true;
991 }
1da177e4 992
7b98c2e4 993 /*
9ff4868e
DR
994 * If current has a pending SIGKILL or is exiting, then automatically
995 * select it. The goal is to allow it to allocate so that it may
996 * quickly exit and free its memory.
7b98c2e4 997 */
091f362c 998 if (task_will_free_mem(current)) {
16e95196 999 mark_oom_victim(current);
1af8bb43 1000 wake_oom_reaper(current);
75e8f8b2 1001 return true;
7b98c2e4
DR
1002 }
1003
3da88fb3
MH
1004 /*
1005 * The OOM killer does not compensate for IO-less reclaim.
1006 * pagefault_out_of_memory lost its gfp context so we have to
1007 * make sure exclude 0 mask - all other users should have at least
1008 * ___GFP_DIRECT_RECLAIM to get here.
1009 */
06ad276a 1010 if (oc->gfp_mask && !(oc->gfp_mask & __GFP_FS))
3da88fb3
MH
1011 return true;
1012
9b0f8b04
CL
1013 /*
1014 * Check if there were limitations on the allocation (only relevant for
7c5f64f8 1015 * NUMA and memcg) that may require different handling.
9b0f8b04 1016 */
7c5f64f8 1017 constraint = constrained_alloc(oc);
6e0fc46d
DR
1018 if (constraint != CONSTRAINT_MEMORY_POLICY)
1019 oc->nodemask = NULL;
2a966b77 1020 check_panic_on_oom(oc, constraint);
0aad4b31 1021
7c5f64f8
VD
1022 if (!is_memcg_oom(oc) && sysctl_oom_kill_allocating_task &&
1023 current->mm && !oom_unkillable_task(current, NULL, oc->nodemask) &&
121d1ba0 1024 current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
6b0c81b3 1025 get_task_struct(current);
7c5f64f8
VD
1026 oc->chosen = current;
1027 oom_kill_process(oc, "Out of memory (oom_kill_allocating_task)");
75e8f8b2 1028 return true;
0aad4b31
DR
1029 }
1030
7c5f64f8 1031 select_bad_process(oc);
0aad4b31 1032 /* Found nothing?!?! Either we hang forever, or we panic. */
7c5f64f8 1033 if (!oc->chosen && !is_sysrq_oom(oc) && !is_memcg_oom(oc)) {
2a966b77 1034 dump_header(oc, NULL);
0aad4b31
DR
1035 panic("Out of memory and no killable processes...\n");
1036 }
7c5f64f8
VD
1037 if (oc->chosen && oc->chosen != (void *)-1UL) {
1038 oom_kill_process(oc, !is_memcg_oom(oc) ? "Out of memory" :
1039 "Memory cgroup out of memory");
75e8f8b2
DR
1040 /*
1041 * Give the killed process a good chance to exit before trying
1042 * to allocate memory again.
1043 */
4f774b91 1044 schedule_timeout_killable(1);
75e8f8b2 1045 }
7c5f64f8 1046 return !!oc->chosen;
c32b3cbe
MH
1047}
1048
e3658932
DR
1049/*
1050 * The pagefault handler calls here because it is out of memory, so kill a
798fd756
VD
1051 * memory-hogging task. If oom_lock is held by somebody else, a parallel oom
1052 * killing is already in progress so do nothing.
e3658932
DR
1053 */
1054void pagefault_out_of_memory(void)
1055{
6e0fc46d
DR
1056 struct oom_control oc = {
1057 .zonelist = NULL,
1058 .nodemask = NULL,
2a966b77 1059 .memcg = NULL,
6e0fc46d
DR
1060 .gfp_mask = 0,
1061 .order = 0,
6e0fc46d
DR
1062 };
1063
49426420 1064 if (mem_cgroup_oom_synchronize(true))
dc56401f 1065 return;
3812c8c8 1066
dc56401f
JW
1067 if (!mutex_trylock(&oom_lock))
1068 return;
a104808e 1069 out_of_memory(&oc);
dc56401f 1070 mutex_unlock(&oom_lock);
e3658932 1071}