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