]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - mm/oom_kill.c
goldfish: goldfish_tty_probe() is not using 'i' any more
[mirror_ubuntu-artful-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>
43d2b113
KH
38
39#define CREATE_TRACE_POINTS
40#include <trace/events/oom.h>
1da177e4 41
fadd8fbd 42int sysctl_panic_on_oom;
fe071d7e 43int sysctl_oom_kill_allocating_task;
ad915c43 44int sysctl_oom_dump_tasks = 1;
c7d4caeb 45static DEFINE_SPINLOCK(zone_scan_lock);
1da177e4 46
6f48d0eb
DR
47#ifdef CONFIG_NUMA
48/**
49 * has_intersects_mems_allowed() - check task eligiblity for kill
ad962441 50 * @start: task struct of which task to consider
6f48d0eb
DR
51 * @mask: nodemask passed to page allocator for mempolicy ooms
52 *
53 * Task eligibility is determined by whether or not a candidate task, @tsk,
54 * shares the same mempolicy nodes as current if it is bound by such a policy
55 * and whether or not it has the same set of allowed cpuset nodes.
495789a5 56 */
ad962441 57static bool has_intersects_mems_allowed(struct task_struct *start,
6f48d0eb 58 const nodemask_t *mask)
495789a5 59{
ad962441
ON
60 struct task_struct *tsk;
61 bool ret = false;
495789a5 62
ad962441 63 rcu_read_lock();
1da4db0c 64 for_each_thread(start, tsk) {
6f48d0eb
DR
65 if (mask) {
66 /*
67 * If this is a mempolicy constrained oom, tsk's
68 * cpuset is irrelevant. Only return true if its
69 * mempolicy intersects current, otherwise it may be
70 * needlessly killed.
71 */
ad962441 72 ret = mempolicy_nodemask_intersects(tsk, mask);
6f48d0eb
DR
73 } else {
74 /*
75 * This is not a mempolicy constrained oom, so only
76 * check the mems of tsk's cpuset.
77 */
ad962441 78 ret = cpuset_mems_allowed_intersects(current, tsk);
6f48d0eb 79 }
ad962441
ON
80 if (ret)
81 break;
1da4db0c 82 }
ad962441 83 rcu_read_unlock();
df1090a8 84
ad962441 85 return ret;
6f48d0eb
DR
86}
87#else
88static bool has_intersects_mems_allowed(struct task_struct *tsk,
89 const nodemask_t *mask)
90{
91 return true;
495789a5 92}
6f48d0eb 93#endif /* CONFIG_NUMA */
495789a5 94
6f48d0eb
DR
95/*
96 * The process p may have detached its own ->mm while exiting or through
97 * use_mm(), but one or more of its subthreads may still have a valid
98 * pointer. Return p, or any of its subthreads with a valid ->mm, with
99 * task_lock() held.
100 */
158e0a2d 101struct task_struct *find_lock_task_mm(struct task_struct *p)
dd8e8f40 102{
1da4db0c 103 struct task_struct *t;
dd8e8f40 104
4d4048be
ON
105 rcu_read_lock();
106
1da4db0c 107 for_each_thread(p, t) {
dd8e8f40
ON
108 task_lock(t);
109 if (likely(t->mm))
4d4048be 110 goto found;
dd8e8f40 111 task_unlock(t);
1da4db0c 112 }
4d4048be
ON
113 t = NULL;
114found:
115 rcu_read_unlock();
dd8e8f40 116
4d4048be 117 return t;
dd8e8f40
ON
118}
119
ab290adb 120/* return true if the task is not adequate as candidate victim task. */
e85bfd3a 121static bool oom_unkillable_task(struct task_struct *p,
72835c86 122 const struct mem_cgroup *memcg, const nodemask_t *nodemask)
ab290adb
KM
123{
124 if (is_global_init(p))
125 return true;
126 if (p->flags & PF_KTHREAD)
127 return true;
128
129 /* When mem_cgroup_out_of_memory() and p is not member of the group */
72835c86 130 if (memcg && !task_in_mem_cgroup(p, memcg))
ab290adb
KM
131 return true;
132
133 /* p may not have freeable memory in nodemask */
134 if (!has_intersects_mems_allowed(p, nodemask))
135 return true;
136
137 return false;
138}
139
1da177e4 140/**
a63d83f4 141 * oom_badness - heuristic function to determine which candidate task to kill
1da177e4 142 * @p: task struct of which task we should calculate
a63d83f4 143 * @totalpages: total present RAM allowed for page allocation
1da177e4 144 *
a63d83f4
DR
145 * The heuristic for determining which task to kill is made to be as simple and
146 * predictable as possible. The goal is to return the highest value for the
147 * task consuming the most memory to avoid subsequent oom failures.
1da177e4 148 */
a7f638f9
DR
149unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
150 const nodemask_t *nodemask, unsigned long totalpages)
1da177e4 151{
1e11ad8d 152 long points;
61eafb00 153 long adj;
28b83c51 154
72835c86 155 if (oom_unkillable_task(p, memcg, nodemask))
26ebc984 156 return 0;
1da177e4 157
dd8e8f40
ON
158 p = find_lock_task_mm(p);
159 if (!p)
1da177e4
LT
160 return 0;
161
a9c58b90 162 adj = (long)p->signal->oom_score_adj;
61eafb00 163 if (adj == OOM_SCORE_ADJ_MIN) {
5aecc85a
MH
164 task_unlock(p);
165 return 0;
166 }
167
1da177e4 168 /*
a63d83f4 169 * The baseline for the badness score is the proportion of RAM that each
f755a042 170 * task's rss, pagetable and swap space use.
1da177e4 171 */
e1f56c89 172 points = get_mm_rss(p->mm) + atomic_long_read(&p->mm->nr_ptes) +
a7f638f9 173 get_mm_counter(p->mm, MM_SWAPENTS);
a63d83f4 174 task_unlock(p);
1da177e4
LT
175
176 /*
a63d83f4
DR
177 * Root processes get 3% bonus, just like the __vm_enough_memory()
178 * implementation used by LSMs.
1da177e4 179 */
a63d83f4 180 if (has_capability_noaudit(p, CAP_SYS_ADMIN))
778c14af 181 points -= (points * 3) / 100;
1da177e4 182
61eafb00
DR
183 /* Normalize to oom_score_adj units */
184 adj *= totalpages / 1000;
185 points += adj;
1da177e4 186
f19e8aa1 187 /*
a7f638f9
DR
188 * Never return 0 for an eligible task regardless of the root bonus and
189 * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).
f19e8aa1 190 */
1e11ad8d 191 return points > 0 ? points : 1;
1da177e4
LT
192}
193
9b0f8b04
CL
194/*
195 * Determine the type of allocation constraint.
196 */
9b0f8b04 197#ifdef CONFIG_NUMA
4365a567 198static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
a63d83f4
DR
199 gfp_t gfp_mask, nodemask_t *nodemask,
200 unsigned long *totalpages)
4365a567 201{
54a6eb5c 202 struct zone *zone;
dd1a239f 203 struct zoneref *z;
54a6eb5c 204 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
a63d83f4
DR
205 bool cpuset_limited = false;
206 int nid;
9b0f8b04 207
a63d83f4
DR
208 /* Default to all available memory */
209 *totalpages = totalram_pages + total_swap_pages;
210
211 if (!zonelist)
212 return CONSTRAINT_NONE;
4365a567
KH
213 /*
214 * Reach here only when __GFP_NOFAIL is used. So, we should avoid
215 * to kill current.We have to random task kill in this case.
216 * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
217 */
218 if (gfp_mask & __GFP_THISNODE)
219 return CONSTRAINT_NONE;
9b0f8b04 220
4365a567 221 /*
a63d83f4
DR
222 * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
223 * the page allocator means a mempolicy is in effect. Cpuset policy
224 * is enforced in get_page_from_freelist().
4365a567 225 */
bd3a66c1 226 if (nodemask && !nodes_subset(node_states[N_MEMORY], *nodemask)) {
a63d83f4
DR
227 *totalpages = total_swap_pages;
228 for_each_node_mask(nid, *nodemask)
229 *totalpages += node_spanned_pages(nid);
9b0f8b04 230 return CONSTRAINT_MEMORY_POLICY;
a63d83f4 231 }
4365a567
KH
232
233 /* Check this allocation failure is caused by cpuset's wall function */
234 for_each_zone_zonelist_nodemask(zone, z, zonelist,
235 high_zoneidx, nodemask)
236 if (!cpuset_zone_allowed_softwall(zone, gfp_mask))
a63d83f4 237 cpuset_limited = true;
9b0f8b04 238
a63d83f4
DR
239 if (cpuset_limited) {
240 *totalpages = total_swap_pages;
241 for_each_node_mask(nid, cpuset_current_mems_allowed)
242 *totalpages += node_spanned_pages(nid);
243 return CONSTRAINT_CPUSET;
244 }
9b0f8b04
CL
245 return CONSTRAINT_NONE;
246}
4365a567
KH
247#else
248static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
a63d83f4
DR
249 gfp_t gfp_mask, nodemask_t *nodemask,
250 unsigned long *totalpages)
4365a567 251{
a63d83f4 252 *totalpages = totalram_pages + total_swap_pages;
4365a567
KH
253 return CONSTRAINT_NONE;
254}
255#endif
9b0f8b04 256
9cbb78bb
DR
257enum oom_scan_t oom_scan_process_thread(struct task_struct *task,
258 unsigned long totalpages, const nodemask_t *nodemask,
259 bool force_kill)
462607ec 260{
9cbb78bb 261 if (oom_unkillable_task(task, NULL, nodemask))
462607ec
DR
262 return OOM_SCAN_CONTINUE;
263
264 /*
265 * This task already has access to memory reserves and is being killed.
266 * Don't allow any other task to have access to the reserves.
267 */
268 if (test_tsk_thread_flag(task, TIF_MEMDIE)) {
269 if (unlikely(frozen(task)))
270 __thaw_task(task);
271 if (!force_kill)
272 return OOM_SCAN_ABORT;
273 }
274 if (!task->mm)
275 return OOM_SCAN_CONTINUE;
276
e1e12d2f
DR
277 /*
278 * If task is allocating a lot of memory and has been marked to be
279 * killed first if it triggers an oom, then select it.
280 */
281 if (oom_task_origin(task))
282 return OOM_SCAN_SELECT;
283
9ff4868e 284 if (task->flags & PF_EXITING && !force_kill) {
462607ec 285 /*
9ff4868e
DR
286 * If this task is not being ptraced on exit, then wait for it
287 * to finish before killing some other task unnecessarily.
462607ec 288 */
9ff4868e
DR
289 if (!(task->group_leader->ptrace & PT_TRACE_EXIT))
290 return OOM_SCAN_ABORT;
462607ec
DR
291 }
292 return OOM_SCAN_OK;
293}
294
1da177e4
LT
295/*
296 * Simple selection loop. We chose the process with the highest
6b4f2b56 297 * number of 'points'. Returns -1 on scan abort.
1da177e4
LT
298 *
299 * (not docbooked, we don't want this one cluttering up the manual)
300 */
a63d83f4 301static struct task_struct *select_bad_process(unsigned int *ppoints,
9cbb78bb
DR
302 unsigned long totalpages, const nodemask_t *nodemask,
303 bool force_kill)
1da177e4 304{
3a5dda7a 305 struct task_struct *g, *p;
1da177e4 306 struct task_struct *chosen = NULL;
a7f638f9 307 unsigned long chosen_points = 0;
1da177e4 308
6b0c81b3 309 rcu_read_lock();
1da4db0c 310 for_each_process_thread(g, p) {
a63d83f4 311 unsigned int points;
a49335cc 312
9cbb78bb 313 switch (oom_scan_process_thread(p, totalpages, nodemask,
462607ec
DR
314 force_kill)) {
315 case OOM_SCAN_SELECT:
316 chosen = p;
317 chosen_points = ULONG_MAX;
318 /* fall through */
319 case OOM_SCAN_CONTINUE:
c027a474 320 continue;
462607ec 321 case OOM_SCAN_ABORT:
6b0c81b3 322 rcu_read_unlock();
6b4f2b56 323 return (struct task_struct *)(-1UL);
462607ec
DR
324 case OOM_SCAN_OK:
325 break;
326 };
9cbb78bb 327 points = oom_badness(p, NULL, nodemask, totalpages);
d49ad935
DR
328 if (!points || points < chosen_points)
329 continue;
330 /* Prefer thread group leaders for display purposes */
331 if (points == chosen_points && thread_group_leader(chosen))
332 continue;
333
334 chosen = p;
335 chosen_points = points;
1da4db0c 336 }
6b0c81b3
DR
337 if (chosen)
338 get_task_struct(chosen);
339 rcu_read_unlock();
972c4ea5 340
a7f638f9 341 *ppoints = chosen_points * 1000 / totalpages;
1da177e4
LT
342 return chosen;
343}
344
fef1bdd6 345/**
1b578df0 346 * dump_tasks - dump current memory state of all system tasks
dad7557e 347 * @memcg: current's memory controller, if constrained
e85bfd3a 348 * @nodemask: nodemask passed to page allocator for mempolicy ooms
1b578df0 349 *
e85bfd3a
DR
350 * Dumps the current memory state of all eligible tasks. Tasks not in the same
351 * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
352 * are not shown.
de34d965
DR
353 * State information includes task's pid, uid, tgid, vm size, rss, nr_ptes,
354 * swapents, oom_score_adj value, and name.
fef1bdd6 355 */
72835c86 356static void dump_tasks(const struct mem_cgroup *memcg, const nodemask_t *nodemask)
fef1bdd6 357{
c55db957
KM
358 struct task_struct *p;
359 struct task_struct *task;
fef1bdd6 360
de34d965 361 pr_info("[ pid ] uid tgid total_vm rss nr_ptes swapents oom_score_adj name\n");
6b0c81b3 362 rcu_read_lock();
c55db957 363 for_each_process(p) {
72835c86 364 if (oom_unkillable_task(p, memcg, nodemask))
b4416d2b 365 continue;
fef1bdd6 366
c55db957
KM
367 task = find_lock_task_mm(p);
368 if (!task) {
6d2661ed 369 /*
74ab7f1d
DR
370 * This is a kthread or all of p's threads have already
371 * detached their mm's. There's no need to report
c55db957 372 * them; they can't be oom killed anyway.
6d2661ed 373 */
6d2661ed
DR
374 continue;
375 }
c55db957 376
e1f56c89 377 pr_info("[%5d] %5d %5d %8lu %8lu %7ld %8lu %5hd %s\n",
078de5f7
EB
378 task->pid, from_kuid(&init_user_ns, task_uid(task)),
379 task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
e1f56c89 380 atomic_long_read(&task->mm->nr_ptes),
de34d965 381 get_mm_counter(task->mm, MM_SWAPENTS),
a63d83f4 382 task->signal->oom_score_adj, task->comm);
c55db957
KM
383 task_unlock(task);
384 }
6b0c81b3 385 rcu_read_unlock();
fef1bdd6
DR
386}
387
d31f56db 388static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order,
72835c86 389 struct mem_cgroup *memcg, const nodemask_t *nodemask)
1b604d75 390{
5e9d834a 391 task_lock(current);
1b604d75 392 pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
a9c58b90 393 "oom_score_adj=%hd\n",
01dc52eb 394 current->comm, gfp_mask, order,
a63d83f4 395 current->signal->oom_score_adj);
1b604d75
DR
396 cpuset_print_task_mems_allowed(current);
397 task_unlock(current);
398 dump_stack();
58cf188e
SZ
399 if (memcg)
400 mem_cgroup_print_oom_info(memcg, p);
401 else
402 show_mem(SHOW_MEM_FILTER_NODES);
1b604d75 403 if (sysctl_oom_dump_tasks)
72835c86 404 dump_tasks(memcg, nodemask);
1b604d75
DR
405}
406
5695be14
MH
407/*
408 * Number of OOM killer invocations (including memcg OOM killer).
409 * Primarily used by PM freezer to check for potential races with
410 * OOM killed frozen task.
411 */
412static atomic_t oom_kills = ATOMIC_INIT(0);
413
414int oom_kills_count(void)
415{
416 return atomic_read(&oom_kills);
417}
418
419void note_oom_kill(void)
420{
421 atomic_inc(&oom_kills);
422}
423
3b4798cb 424#define K(x) ((x) << (PAGE_SHIFT-10))
6b0c81b3
DR
425/*
426 * Must be called while holding a reference to p, which will be released upon
427 * returning.
428 */
9cbb78bb
DR
429void oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order,
430 unsigned int points, unsigned long totalpages,
431 struct mem_cgroup *memcg, nodemask_t *nodemask,
432 const char *message)
1da177e4 433{
52d3c036 434 struct task_struct *victim = p;
5e9d834a 435 struct task_struct *child;
1da4db0c 436 struct task_struct *t;
647f2bdf 437 struct mm_struct *mm;
52d3c036 438 unsigned int victim_points = 0;
dc3f21ea
DR
439 static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
440 DEFAULT_RATELIMIT_BURST);
1da177e4 441
50ec3bbf
NP
442 /*
443 * If the task is already exiting, don't alarm the sysadmin or kill
444 * its children or threads, just set TIF_MEMDIE so it can die quickly
445 */
0753ba01 446 if (p->flags & PF_EXITING) {
4358997a 447 set_tsk_thread_flag(p, TIF_MEMDIE);
6b0c81b3 448 put_task_struct(p);
2a1c9b1f 449 return;
50ec3bbf
NP
450 }
451
dc3f21ea 452 if (__ratelimit(&oom_rs))
8447d950
DR
453 dump_header(p, gfp_mask, order, memcg, nodemask);
454
5e9d834a 455 task_lock(p);
a63d83f4 456 pr_err("%s: Kill process %d (%s) score %d or sacrifice child\n",
5e9d834a
DR
457 message, task_pid_nr(p), p->comm, points);
458 task_unlock(p);
f3af38d3 459
5e9d834a
DR
460 /*
461 * If any of p's children has a different mm and is eligible for kill,
11239836 462 * the one with the highest oom_badness() score is sacrificed for its
5e9d834a
DR
463 * parent. This attempts to lose the minimal amount of work done while
464 * still freeing memory.
465 */
6b0c81b3 466 read_lock(&tasklist_lock);
1da4db0c 467 for_each_thread(p, t) {
5e9d834a 468 list_for_each_entry(child, &t->children, sibling) {
a63d83f4 469 unsigned int child_points;
5e9d834a 470
edd45544
DR
471 if (child->mm == p->mm)
472 continue;
a63d83f4
DR
473 /*
474 * oom_badness() returns 0 if the thread is unkillable
475 */
72835c86 476 child_points = oom_badness(child, memcg, nodemask,
a63d83f4 477 totalpages);
5e9d834a 478 if (child_points > victim_points) {
6b0c81b3 479 put_task_struct(victim);
5e9d834a
DR
480 victim = child;
481 victim_points = child_points;
6b0c81b3 482 get_task_struct(victim);
5e9d834a 483 }
dd8e8f40 484 }
1da4db0c 485 }
6b0c81b3 486 read_unlock(&tasklist_lock);
dd8e8f40 487
6b0c81b3
DR
488 p = find_lock_task_mm(victim);
489 if (!p) {
6b0c81b3 490 put_task_struct(victim);
647f2bdf 491 return;
6b0c81b3
DR
492 } else if (victim != p) {
493 get_task_struct(p);
494 put_task_struct(victim);
495 victim = p;
496 }
647f2bdf
DR
497
498 /* mm cannot safely be dereferenced after task_unlock(victim) */
499 mm = victim->mm;
500 pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
501 task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
502 K(get_mm_counter(victim->mm, MM_ANONPAGES)),
503 K(get_mm_counter(victim->mm, MM_FILEPAGES)));
504 task_unlock(victim);
505
506 /*
507 * Kill all user processes sharing victim->mm in other thread groups, if
508 * any. They don't get access to memory reserves, though, to avoid
509 * depletion of all memory. This prevents mm->mmap_sem livelock when an
510 * oom killed thread cannot exit because it requires the semaphore and
511 * its contended by another thread trying to allocate memory itself.
512 * That thread will now get access to memory reserves since it has a
513 * pending fatal signal.
514 */
4d4048be 515 rcu_read_lock();
647f2bdf
DR
516 for_each_process(p)
517 if (p->mm == mm && !same_thread_group(p, victim) &&
518 !(p->flags & PF_KTHREAD)) {
519 if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
520 continue;
521
522 task_lock(p); /* Protect ->comm from prctl() */
523 pr_err("Kill process %d (%s) sharing same memory\n",
524 task_pid_nr(p), p->comm);
525 task_unlock(p);
d2d39309 526 do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
647f2bdf 527 }
6b0c81b3 528 rcu_read_unlock();
647f2bdf
DR
529
530 set_tsk_thread_flag(victim, TIF_MEMDIE);
d2d39309 531 do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
6b0c81b3 532 put_task_struct(victim);
1da177e4 533}
647f2bdf 534#undef K
1da177e4 535
309ed882
DR
536/*
537 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
538 */
876aafbf
DR
539void check_panic_on_oom(enum oom_constraint constraint, gfp_t gfp_mask,
540 int order, const nodemask_t *nodemask)
309ed882
DR
541{
542 if (likely(!sysctl_panic_on_oom))
543 return;
544 if (sysctl_panic_on_oom != 2) {
545 /*
546 * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
547 * does not panic for cpuset, mempolicy, or memcg allocation
548 * failures.
549 */
550 if (constraint != CONSTRAINT_NONE)
551 return;
552 }
e85bfd3a 553 dump_header(NULL, gfp_mask, order, NULL, nodemask);
309ed882
DR
554 panic("Out of memory: %s panic_on_oom is enabled\n",
555 sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
556}
557
8bc719d3
MS
558static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
559
560int register_oom_notifier(struct notifier_block *nb)
561{
562 return blocking_notifier_chain_register(&oom_notify_list, nb);
563}
564EXPORT_SYMBOL_GPL(register_oom_notifier);
565
566int unregister_oom_notifier(struct notifier_block *nb)
567{
568 return blocking_notifier_chain_unregister(&oom_notify_list, nb);
569}
570EXPORT_SYMBOL_GPL(unregister_oom_notifier);
571
098d7f12
DR
572/*
573 * Try to acquire the OOM killer lock for the zones in zonelist. Returns zero
574 * if a parallel OOM killing is already taking place that includes a zone in
575 * the zonelist. Otherwise, locks all zones in the zonelist and returns 1.
576 */
e972a070 577bool oom_zonelist_trylock(struct zonelist *zonelist, gfp_t gfp_mask)
098d7f12 578{
dd1a239f
MG
579 struct zoneref *z;
580 struct zone *zone;
e972a070 581 bool ret = true;
098d7f12 582
c7d4caeb 583 spin_lock(&zone_scan_lock);
e972a070 584 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask))
57054651 585 if (test_bit(ZONE_OOM_LOCKED, &zone->flags)) {
e972a070 586 ret = false;
098d7f12
DR
587 goto out;
588 }
dd1a239f 589
e972a070
DR
590 /*
591 * Lock each zone in the zonelist under zone_scan_lock so a parallel
592 * call to oom_zonelist_trylock() doesn't succeed when it shouldn't.
593 */
594 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask))
57054651 595 set_bit(ZONE_OOM_LOCKED, &zone->flags);
098d7f12 596
098d7f12 597out:
c7d4caeb 598 spin_unlock(&zone_scan_lock);
098d7f12
DR
599 return ret;
600}
601
602/*
603 * Clears the ZONE_OOM_LOCKED flag for all zones in the zonelist so that failed
604 * allocation attempts with zonelists containing them may now recall the OOM
605 * killer, if necessary.
606 */
e972a070 607void oom_zonelist_unlock(struct zonelist *zonelist, gfp_t gfp_mask)
098d7f12 608{
dd1a239f
MG
609 struct zoneref *z;
610 struct zone *zone;
098d7f12 611
c7d4caeb 612 spin_lock(&zone_scan_lock);
e972a070 613 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask))
57054651 614 clear_bit(ZONE_OOM_LOCKED, &zone->flags);
c7d4caeb 615 spin_unlock(&zone_scan_lock);
098d7f12
DR
616}
617
1da177e4 618/**
6937a25c 619 * out_of_memory - kill the "best" process when we run out of memory
1b578df0
RD
620 * @zonelist: zonelist pointer
621 * @gfp_mask: memory allocation flags
622 * @order: amount of memory being requested as a power of 2
6f48d0eb 623 * @nodemask: nodemask passed to page allocator
08ab9b10 624 * @force_kill: true if a task must be killed, even if others are exiting
1da177e4
LT
625 *
626 * If we run out of memory, we have the choice between either
627 * killing a random task (bad), letting the system crash (worse)
628 * OR try to be smart about which process to kill. Note that we
629 * don't have to be perfect here, we just have to be good.
630 */
4365a567 631void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask,
08ab9b10 632 int order, nodemask_t *nodemask, bool force_kill)
1da177e4 633{
e85bfd3a 634 const nodemask_t *mpol_mask;
0aad4b31 635 struct task_struct *p;
a63d83f4 636 unsigned long totalpages;
8bc719d3 637 unsigned long freed = 0;
9cbb78bb 638 unsigned int uninitialized_var(points);
e3658932 639 enum oom_constraint constraint = CONSTRAINT_NONE;
b52723c5 640 int killed = 0;
8bc719d3
MS
641
642 blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
643 if (freed > 0)
644 /* Got some memory back in the last second. */
645 return;
1da177e4 646
7b98c2e4 647 /*
9ff4868e
DR
648 * If current has a pending SIGKILL or is exiting, then automatically
649 * select it. The goal is to allow it to allocate so that it may
650 * quickly exit and free its memory.
7b98c2e4 651 */
9ff4868e 652 if (fatal_signal_pending(current) || current->flags & PF_EXITING) {
7b98c2e4
DR
653 set_thread_flag(TIF_MEMDIE);
654 return;
655 }
656
9b0f8b04
CL
657 /*
658 * Check if there were limitations on the allocation (only relevant for
659 * NUMA) that may require different handling.
660 */
a63d83f4
DR
661 constraint = constrained_alloc(zonelist, gfp_mask, nodemask,
662 &totalpages);
e85bfd3a
DR
663 mpol_mask = (constraint == CONSTRAINT_MEMORY_POLICY) ? nodemask : NULL;
664 check_panic_on_oom(constraint, gfp_mask, order, mpol_mask);
0aad4b31 665
121d1ba0 666 if (sysctl_oom_kill_allocating_task && current->mm &&
a96cfd6e 667 !oom_unkillable_task(current, NULL, nodemask) &&
121d1ba0 668 current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
6b0c81b3 669 get_task_struct(current);
2a1c9b1f
DR
670 oom_kill_process(current, gfp_mask, order, 0, totalpages, NULL,
671 nodemask,
672 "Out of memory (oom_kill_allocating_task)");
673 goto out;
0aad4b31
DR
674 }
675
9cbb78bb 676 p = select_bad_process(&points, totalpages, mpol_mask, force_kill);
0aad4b31
DR
677 /* Found nothing?!?! Either we hang forever, or we panic. */
678 if (!p) {
e85bfd3a 679 dump_header(NULL, gfp_mask, order, NULL, mpol_mask);
0aad4b31
DR
680 panic("Out of memory and no killable processes...\n");
681 }
6b4f2b56 682 if (p != (void *)-1UL) {
2a1c9b1f
DR
683 oom_kill_process(p, gfp_mask, order, points, totalpages, NULL,
684 nodemask, "Out of memory");
685 killed = 1;
686 }
b52723c5 687out:
1da177e4 688 /*
4f774b91
DR
689 * Give the killed threads a good chance of exiting before trying to
690 * allocate memory again.
1da177e4 691 */
4f774b91
DR
692 if (killed)
693 schedule_timeout_killable(1);
1da177e4 694}
e3658932
DR
695
696/*
697 * The pagefault handler calls here because it is out of memory, so kill a
efacd02e
DR
698 * memory-hogging task. If any populated zone has ZONE_OOM_LOCKED set, a
699 * parallel oom killing is already in progress so do nothing.
e3658932
DR
700 */
701void pagefault_out_of_memory(void)
702{
3812c8c8 703 struct zonelist *zonelist;
efacd02e 704
49426420 705 if (mem_cgroup_oom_synchronize(true))
3812c8c8
JW
706 return;
707
8d060bf4 708 zonelist = node_zonelist(first_memory_node, GFP_KERNEL);
e972a070 709 if (oom_zonelist_trylock(zonelist, GFP_KERNEL)) {
08ab9b10 710 out_of_memory(NULL, 0, 0, NULL, false);
e972a070 711 oom_zonelist_unlock(zonelist, GFP_KERNEL);
e3658932 712 }
e3658932 713}