]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - mm/oom_kill.c
userns: Convert group_info values from gid_t to kgid_t.
[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
43362a49
DR
47/*
48 * compare_swap_oom_score_adj() - compare and swap current's oom_score_adj
49 * @old_val: old oom_score_adj for compare
50 * @new_val: new oom_score_adj for swap
51 *
52 * Sets the oom_score_adj value for current to @new_val iff its present value is
53 * @old_val. Usually used to reinstate a previous value to prevent racing with
54 * userspacing tuning the value in the interim.
55 */
56void compare_swap_oom_score_adj(int old_val, int new_val)
57{
58 struct sighand_struct *sighand = current->sighand;
59
60 spin_lock_irq(&sighand->siglock);
61 if (current->signal->oom_score_adj == old_val)
62 current->signal->oom_score_adj = new_val;
43d2b113 63 trace_oom_score_adj_update(current);
43362a49
DR
64 spin_unlock_irq(&sighand->siglock);
65}
66
72788c38
DR
67/**
68 * test_set_oom_score_adj() - set current's oom_score_adj and return old value
69 * @new_val: new oom_score_adj value
70 *
71 * Sets the oom_score_adj value for current to @new_val with proper
72 * synchronization and returns the old value. Usually used to temporarily
73 * set a value, save the old value in the caller, and then reinstate it later.
74 */
75int test_set_oom_score_adj(int new_val)
76{
77 struct sighand_struct *sighand = current->sighand;
78 int old_val;
79
80 spin_lock_irq(&sighand->siglock);
81 old_val = current->signal->oom_score_adj;
c9f01245 82 current->signal->oom_score_adj = new_val;
43d2b113 83 trace_oom_score_adj_update(current);
72788c38
DR
84 spin_unlock_irq(&sighand->siglock);
85
86 return old_val;
87}
88
6f48d0eb
DR
89#ifdef CONFIG_NUMA
90/**
91 * has_intersects_mems_allowed() - check task eligiblity for kill
92 * @tsk: task struct of which task to consider
93 * @mask: nodemask passed to page allocator for mempolicy ooms
94 *
95 * Task eligibility is determined by whether or not a candidate task, @tsk,
96 * shares the same mempolicy nodes as current if it is bound by such a policy
97 * and whether or not it has the same set of allowed cpuset nodes.
495789a5 98 */
6f48d0eb
DR
99static bool has_intersects_mems_allowed(struct task_struct *tsk,
100 const nodemask_t *mask)
495789a5 101{
6f48d0eb 102 struct task_struct *start = tsk;
495789a5 103
495789a5 104 do {
6f48d0eb
DR
105 if (mask) {
106 /*
107 * If this is a mempolicy constrained oom, tsk's
108 * cpuset is irrelevant. Only return true if its
109 * mempolicy intersects current, otherwise it may be
110 * needlessly killed.
111 */
112 if (mempolicy_nodemask_intersects(tsk, mask))
113 return true;
114 } else {
115 /*
116 * This is not a mempolicy constrained oom, so only
117 * check the mems of tsk's cpuset.
118 */
119 if (cpuset_mems_allowed_intersects(current, tsk))
120 return true;
121 }
df1090a8
KM
122 } while_each_thread(start, tsk);
123
6f48d0eb
DR
124 return false;
125}
126#else
127static bool has_intersects_mems_allowed(struct task_struct *tsk,
128 const nodemask_t *mask)
129{
130 return true;
495789a5 131}
6f48d0eb 132#endif /* CONFIG_NUMA */
495789a5 133
6f48d0eb
DR
134/*
135 * The process p may have detached its own ->mm while exiting or through
136 * use_mm(), but one or more of its subthreads may still have a valid
137 * pointer. Return p, or any of its subthreads with a valid ->mm, with
138 * task_lock() held.
139 */
158e0a2d 140struct task_struct *find_lock_task_mm(struct task_struct *p)
dd8e8f40
ON
141{
142 struct task_struct *t = p;
143
144 do {
145 task_lock(t);
146 if (likely(t->mm))
147 return t;
148 task_unlock(t);
149 } while_each_thread(p, t);
150
151 return NULL;
152}
153
ab290adb 154/* return true if the task is not adequate as candidate victim task. */
e85bfd3a 155static bool oom_unkillable_task(struct task_struct *p,
72835c86 156 const struct mem_cgroup *memcg, const nodemask_t *nodemask)
ab290adb
KM
157{
158 if (is_global_init(p))
159 return true;
160 if (p->flags & PF_KTHREAD)
161 return true;
162
163 /* When mem_cgroup_out_of_memory() and p is not member of the group */
72835c86 164 if (memcg && !task_in_mem_cgroup(p, memcg))
ab290adb
KM
165 return true;
166
167 /* p may not have freeable memory in nodemask */
168 if (!has_intersects_mems_allowed(p, nodemask))
169 return true;
170
171 return false;
172}
173
1da177e4 174/**
a63d83f4 175 * oom_badness - heuristic function to determine which candidate task to kill
1da177e4 176 * @p: task struct of which task we should calculate
a63d83f4 177 * @totalpages: total present RAM allowed for page allocation
1da177e4 178 *
a63d83f4
DR
179 * The heuristic for determining which task to kill is made to be as simple and
180 * predictable as possible. The goal is to return the highest value for the
181 * task consuming the most memory to avoid subsequent oom failures.
1da177e4 182 */
72835c86 183unsigned int oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
a63d83f4 184 const nodemask_t *nodemask, unsigned long totalpages)
1da177e4 185{
ff05b6f7 186 long points;
28b83c51 187
72835c86 188 if (oom_unkillable_task(p, memcg, nodemask))
26ebc984 189 return 0;
1da177e4 190
dd8e8f40
ON
191 p = find_lock_task_mm(p);
192 if (!p)
1da177e4
LT
193 return 0;
194
5aecc85a
MH
195 if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN) {
196 task_unlock(p);
197 return 0;
198 }
199
1da177e4 200 /*
a63d83f4
DR
201 * The memory controller may have a limit of 0 bytes, so avoid a divide
202 * by zero, if necessary.
1da177e4 203 */
a63d83f4
DR
204 if (!totalpages)
205 totalpages = 1;
1da177e4
LT
206
207 /*
a63d83f4 208 * The baseline for the badness score is the proportion of RAM that each
f755a042 209 * task's rss, pagetable and swap space use.
1da177e4 210 */
f755a042
KM
211 points = get_mm_rss(p->mm) + p->mm->nr_ptes;
212 points += get_mm_counter(p->mm, MM_SWAPENTS);
213
214 points *= 1000;
215 points /= totalpages;
a63d83f4 216 task_unlock(p);
1da177e4
LT
217
218 /*
a63d83f4
DR
219 * Root processes get 3% bonus, just like the __vm_enough_memory()
220 * implementation used by LSMs.
1da177e4 221 */
a63d83f4
DR
222 if (has_capability_noaudit(p, CAP_SYS_ADMIN))
223 points -= 30;
1da177e4
LT
224
225 /*
a63d83f4
DR
226 * /proc/pid/oom_score_adj ranges from -1000 to +1000 such that it may
227 * either completely disable oom killing or always prefer a certain
228 * task.
1da177e4 229 */
a63d83f4 230 points += p->signal->oom_score_adj;
1da177e4 231
f19e8aa1
DR
232 /*
233 * Never return 0 for an eligible task that may be killed since it's
234 * possible that no single user task uses more than 0.1% of memory and
235 * no single admin tasks uses more than 3.0%.
236 */
237 if (points <= 0)
238 return 1;
a63d83f4 239 return (points < 1000) ? points : 1000;
1da177e4
LT
240}
241
9b0f8b04
CL
242/*
243 * Determine the type of allocation constraint.
244 */
9b0f8b04 245#ifdef CONFIG_NUMA
4365a567 246static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
a63d83f4
DR
247 gfp_t gfp_mask, nodemask_t *nodemask,
248 unsigned long *totalpages)
4365a567 249{
54a6eb5c 250 struct zone *zone;
dd1a239f 251 struct zoneref *z;
54a6eb5c 252 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
a63d83f4
DR
253 bool cpuset_limited = false;
254 int nid;
9b0f8b04 255
a63d83f4
DR
256 /* Default to all available memory */
257 *totalpages = totalram_pages + total_swap_pages;
258
259 if (!zonelist)
260 return CONSTRAINT_NONE;
4365a567
KH
261 /*
262 * Reach here only when __GFP_NOFAIL is used. So, we should avoid
263 * to kill current.We have to random task kill in this case.
264 * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
265 */
266 if (gfp_mask & __GFP_THISNODE)
267 return CONSTRAINT_NONE;
9b0f8b04 268
4365a567 269 /*
a63d83f4
DR
270 * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
271 * the page allocator means a mempolicy is in effect. Cpuset policy
272 * is enforced in get_page_from_freelist().
4365a567 273 */
a63d83f4
DR
274 if (nodemask && !nodes_subset(node_states[N_HIGH_MEMORY], *nodemask)) {
275 *totalpages = total_swap_pages;
276 for_each_node_mask(nid, *nodemask)
277 *totalpages += node_spanned_pages(nid);
9b0f8b04 278 return CONSTRAINT_MEMORY_POLICY;
a63d83f4 279 }
4365a567
KH
280
281 /* Check this allocation failure is caused by cpuset's wall function */
282 for_each_zone_zonelist_nodemask(zone, z, zonelist,
283 high_zoneidx, nodemask)
284 if (!cpuset_zone_allowed_softwall(zone, gfp_mask))
a63d83f4 285 cpuset_limited = true;
9b0f8b04 286
a63d83f4
DR
287 if (cpuset_limited) {
288 *totalpages = total_swap_pages;
289 for_each_node_mask(nid, cpuset_current_mems_allowed)
290 *totalpages += node_spanned_pages(nid);
291 return CONSTRAINT_CPUSET;
292 }
9b0f8b04
CL
293 return CONSTRAINT_NONE;
294}
4365a567
KH
295#else
296static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
a63d83f4
DR
297 gfp_t gfp_mask, nodemask_t *nodemask,
298 unsigned long *totalpages)
4365a567 299{
a63d83f4 300 *totalpages = totalram_pages + total_swap_pages;
4365a567
KH
301 return CONSTRAINT_NONE;
302}
303#endif
9b0f8b04 304
1da177e4
LT
305/*
306 * Simple selection loop. We chose the process with the highest
307 * number of 'points'. We expect the caller will lock the tasklist.
308 *
309 * (not docbooked, we don't want this one cluttering up the manual)
310 */
a63d83f4 311static struct task_struct *select_bad_process(unsigned int *ppoints,
72835c86 312 unsigned long totalpages, struct mem_cgroup *memcg,
08ab9b10 313 const nodemask_t *nodemask, bool force_kill)
1da177e4 314{
3a5dda7a 315 struct task_struct *g, *p;
1da177e4 316 struct task_struct *chosen = NULL;
9827b781 317 *ppoints = 0;
1da177e4 318
3a5dda7a 319 do_each_thread(g, p) {
a63d83f4 320 unsigned int points;
a49335cc 321
c027a474 322 if (p->exit_state)
30e2b41f 323 continue;
72835c86 324 if (oom_unkillable_task(p, memcg, nodemask))
6cf86ac6 325 continue;
ef08e3b4 326
b78483a4
NP
327 /*
328 * This task already has access to memory reserves and is
329 * being killed. Don't allow any other task access to the
330 * memory reserve.
331 *
332 * Note: this may have a chance of deadlock if it gets
333 * blocked waiting for another task which itself is waiting
334 * for memory. Is there a better alternative?
335 */
f660daac
DR
336 if (test_tsk_thread_flag(p, TIF_MEMDIE)) {
337 if (unlikely(frozen(p)))
a5be2d0d 338 __thaw_task(p);
08ab9b10
DR
339 if (!force_kill)
340 return ERR_PTR(-1UL);
f660daac 341 }
c027a474
ON
342 if (!p->mm)
343 continue;
b78483a4 344
30e2b41f 345 if (p->flags & PF_EXITING) {
edd45544
DR
346 /*
347 * If p is the current task and is in the process of
348 * releasing memory, we allow the "kill" to set
349 * TIF_MEMDIE, which will allow it to gain access to
350 * memory reserves. Otherwise, it may stall forever.
351 *
352 * The loop isn't broken here, however, in case other
353 * threads are found to have already been oom killed.
354 */
355 if (p == current) {
356 chosen = p;
357 *ppoints = 1000;
08ab9b10 358 } else if (!force_kill) {
edd45544
DR
359 /*
360 * If this task is not being ptraced on exit,
361 * then wait for it to finish before killing
362 * some other task unnecessarily.
363 */
d21142ec 364 if (!(p->group_leader->ptrace & PT_TRACE_EXIT))
edd45544
DR
365 return ERR_PTR(-1UL);
366 }
50ec3bbf 367 }
972c4ea5 368
72835c86 369 points = oom_badness(p, memcg, nodemask, totalpages);
a63d83f4 370 if (points > *ppoints) {
a49335cc 371 chosen = p;
9827b781 372 *ppoints = points;
1da177e4 373 }
3a5dda7a 374 } while_each_thread(g, p);
972c4ea5 375
1da177e4
LT
376 return chosen;
377}
378
fef1bdd6 379/**
1b578df0 380 * dump_tasks - dump current memory state of all system tasks
74ab7f1d 381 * @mem: current's memory controller, if constrained
e85bfd3a 382 * @nodemask: nodemask passed to page allocator for mempolicy ooms
1b578df0 383 *
e85bfd3a
DR
384 * Dumps the current memory state of all eligible tasks. Tasks not in the same
385 * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
386 * are not shown.
fef1bdd6 387 * State information includes task's pid, uid, tgid, vm size, rss, cpu, oom_adj
a63d83f4 388 * value, oom_score_adj value, and name.
fef1bdd6 389 *
fef1bdd6
DR
390 * Call with tasklist_lock read-locked.
391 */
72835c86 392static void dump_tasks(const struct mem_cgroup *memcg, const nodemask_t *nodemask)
fef1bdd6 393{
c55db957
KM
394 struct task_struct *p;
395 struct task_struct *task;
fef1bdd6 396
a63d83f4 397 pr_info("[ pid ] uid tgid total_vm rss cpu oom_adj oom_score_adj name\n");
c55db957 398 for_each_process(p) {
72835c86 399 if (oom_unkillable_task(p, memcg, nodemask))
b4416d2b 400 continue;
fef1bdd6 401
c55db957
KM
402 task = find_lock_task_mm(p);
403 if (!task) {
6d2661ed 404 /*
74ab7f1d
DR
405 * This is a kthread or all of p's threads have already
406 * detached their mm's. There's no need to report
c55db957 407 * them; they can't be oom killed anyway.
6d2661ed 408 */
6d2661ed
DR
409 continue;
410 }
c55db957 411
a63d83f4 412 pr_info("[%5d] %5d %5d %8lu %8lu %3u %3d %5d %s\n",
8d6c83f0 413 task->pid, task_uid(task), task->tgid,
a63d83f4
DR
414 task->mm->total_vm, get_mm_rss(task->mm),
415 task_cpu(task), task->signal->oom_adj,
416 task->signal->oom_score_adj, task->comm);
c55db957
KM
417 task_unlock(task);
418 }
fef1bdd6
DR
419}
420
d31f56db 421static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order,
72835c86 422 struct mem_cgroup *memcg, const nodemask_t *nodemask)
1b604d75 423{
5e9d834a 424 task_lock(current);
1b604d75 425 pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
a63d83f4
DR
426 "oom_adj=%d, oom_score_adj=%d\n",
427 current->comm, gfp_mask, order, current->signal->oom_adj,
428 current->signal->oom_score_adj);
1b604d75
DR
429 cpuset_print_task_mems_allowed(current);
430 task_unlock(current);
431 dump_stack();
72835c86 432 mem_cgroup_print_oom_info(memcg, p);
b2b755b5 433 show_mem(SHOW_MEM_FILTER_NODES);
1b604d75 434 if (sysctl_oom_dump_tasks)
72835c86 435 dump_tasks(memcg, nodemask);
1b604d75
DR
436}
437
3b4798cb 438#define K(x) ((x) << (PAGE_SHIFT-10))
2a1c9b1f
DR
439static void oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order,
440 unsigned int points, unsigned long totalpages,
441 struct mem_cgroup *memcg, nodemask_t *nodemask,
442 const char *message)
1da177e4 443{
52d3c036 444 struct task_struct *victim = p;
5e9d834a 445 struct task_struct *child;
52d3c036 446 struct task_struct *t = p;
647f2bdf 447 struct mm_struct *mm;
52d3c036 448 unsigned int victim_points = 0;
dc3f21ea
DR
449 static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
450 DEFAULT_RATELIMIT_BURST);
1da177e4 451
50ec3bbf
NP
452 /*
453 * If the task is already exiting, don't alarm the sysadmin or kill
454 * its children or threads, just set TIF_MEMDIE so it can die quickly
455 */
0753ba01 456 if (p->flags & PF_EXITING) {
4358997a 457 set_tsk_thread_flag(p, TIF_MEMDIE);
2a1c9b1f 458 return;
50ec3bbf
NP
459 }
460
dc3f21ea 461 if (__ratelimit(&oom_rs))
8447d950
DR
462 dump_header(p, gfp_mask, order, memcg, nodemask);
463
5e9d834a 464 task_lock(p);
a63d83f4 465 pr_err("%s: Kill process %d (%s) score %d or sacrifice child\n",
5e9d834a
DR
466 message, task_pid_nr(p), p->comm, points);
467 task_unlock(p);
f3af38d3 468
5e9d834a
DR
469 /*
470 * If any of p's children has a different mm and is eligible for kill,
11239836 471 * the one with the highest oom_badness() score is sacrificed for its
5e9d834a
DR
472 * parent. This attempts to lose the minimal amount of work done while
473 * still freeing memory.
474 */
dd8e8f40 475 do {
5e9d834a 476 list_for_each_entry(child, &t->children, sibling) {
a63d83f4 477 unsigned int child_points;
5e9d834a 478
edd45544
DR
479 if (child->mm == p->mm)
480 continue;
a63d83f4
DR
481 /*
482 * oom_badness() returns 0 if the thread is unkillable
483 */
72835c86 484 child_points = oom_badness(child, memcg, nodemask,
a63d83f4 485 totalpages);
5e9d834a
DR
486 if (child_points > victim_points) {
487 victim = child;
488 victim_points = child_points;
489 }
dd8e8f40
ON
490 }
491 } while_each_thread(p, t);
492
647f2bdf
DR
493 victim = find_lock_task_mm(victim);
494 if (!victim)
495 return;
496
497 /* mm cannot safely be dereferenced after task_unlock(victim) */
498 mm = victim->mm;
499 pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
500 task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
501 K(get_mm_counter(victim->mm, MM_ANONPAGES)),
502 K(get_mm_counter(victim->mm, MM_FILEPAGES)));
503 task_unlock(victim);
504
505 /*
506 * Kill all user processes sharing victim->mm in other thread groups, if
507 * any. They don't get access to memory reserves, though, to avoid
508 * depletion of all memory. This prevents mm->mmap_sem livelock when an
509 * oom killed thread cannot exit because it requires the semaphore and
510 * its contended by another thread trying to allocate memory itself.
511 * That thread will now get access to memory reserves since it has a
512 * pending fatal signal.
513 */
514 for_each_process(p)
515 if (p->mm == mm && !same_thread_group(p, victim) &&
516 !(p->flags & PF_KTHREAD)) {
517 if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
518 continue;
519
520 task_lock(p); /* Protect ->comm from prctl() */
521 pr_err("Kill process %d (%s) sharing same memory\n",
522 task_pid_nr(p), p->comm);
523 task_unlock(p);
d2d39309 524 do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
647f2bdf
DR
525 }
526
527 set_tsk_thread_flag(victim, TIF_MEMDIE);
d2d39309 528 do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
1da177e4 529}
647f2bdf 530#undef K
1da177e4 531
309ed882
DR
532/*
533 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
534 */
535static void check_panic_on_oom(enum oom_constraint constraint, gfp_t gfp_mask,
e85bfd3a 536 int order, const nodemask_t *nodemask)
309ed882
DR
537{
538 if (likely(!sysctl_panic_on_oom))
539 return;
540 if (sysctl_panic_on_oom != 2) {
541 /*
542 * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
543 * does not panic for cpuset, mempolicy, or memcg allocation
544 * failures.
545 */
546 if (constraint != CONSTRAINT_NONE)
547 return;
548 }
549 read_lock(&tasklist_lock);
e85bfd3a 550 dump_header(NULL, gfp_mask, order, NULL, nodemask);
309ed882
DR
551 read_unlock(&tasklist_lock);
552 panic("Out of memory: %s panic_on_oom is enabled\n",
553 sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
554}
555
00f0b825 556#ifdef CONFIG_CGROUP_MEM_RES_CTLR
e845e199
DR
557void mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask,
558 int order)
c7ba5c9e 559{
a63d83f4
DR
560 unsigned long limit;
561 unsigned int points = 0;
c7ba5c9e
PE
562 struct task_struct *p;
563
f9434ad1
DR
564 /*
565 * If current has a pending SIGKILL, then automatically select it. The
566 * goal is to allow it to allocate so that it may quickly exit and free
567 * its memory.
568 */
569 if (fatal_signal_pending(current)) {
570 set_thread_flag(TIF_MEMDIE);
f9434ad1
DR
571 return;
572 }
573
e845e199 574 check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, order, NULL);
72835c86 575 limit = mem_cgroup_get_limit(memcg) >> PAGE_SHIFT;
e115f2d8 576 read_lock(&tasklist_lock);
08ab9b10 577 p = select_bad_process(&points, limit, memcg, NULL, false);
2a1c9b1f 578 if (p && PTR_ERR(p) != -1UL)
e845e199 579 oom_kill_process(p, gfp_mask, order, points, limit, memcg, NULL,
2a1c9b1f 580 "Memory cgroup out of memory");
e115f2d8 581 read_unlock(&tasklist_lock);
c7ba5c9e
PE
582}
583#endif
584
8bc719d3
MS
585static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
586
587int register_oom_notifier(struct notifier_block *nb)
588{
589 return blocking_notifier_chain_register(&oom_notify_list, nb);
590}
591EXPORT_SYMBOL_GPL(register_oom_notifier);
592
593int unregister_oom_notifier(struct notifier_block *nb)
594{
595 return blocking_notifier_chain_unregister(&oom_notify_list, nb);
596}
597EXPORT_SYMBOL_GPL(unregister_oom_notifier);
598
098d7f12
DR
599/*
600 * Try to acquire the OOM killer lock for the zones in zonelist. Returns zero
601 * if a parallel OOM killing is already taking place that includes a zone in
602 * the zonelist. Otherwise, locks all zones in the zonelist and returns 1.
603 */
ff321fea 604int try_set_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
098d7f12 605{
dd1a239f
MG
606 struct zoneref *z;
607 struct zone *zone;
098d7f12
DR
608 int ret = 1;
609
c7d4caeb 610 spin_lock(&zone_scan_lock);
dd1a239f
MG
611 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
612 if (zone_is_oom_locked(zone)) {
098d7f12
DR
613 ret = 0;
614 goto out;
615 }
dd1a239f
MG
616 }
617
618 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
619 /*
c7d4caeb 620 * Lock each zone in the zonelist under zone_scan_lock so a
ff321fea 621 * parallel invocation of try_set_zonelist_oom() doesn't succeed
dd1a239f
MG
622 * when it shouldn't.
623 */
624 zone_set_flag(zone, ZONE_OOM_LOCKED);
625 }
098d7f12 626
098d7f12 627out:
c7d4caeb 628 spin_unlock(&zone_scan_lock);
098d7f12
DR
629 return ret;
630}
631
632/*
633 * Clears the ZONE_OOM_LOCKED flag for all zones in the zonelist so that failed
634 * allocation attempts with zonelists containing them may now recall the OOM
635 * killer, if necessary.
636 */
dd1a239f 637void clear_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
098d7f12 638{
dd1a239f
MG
639 struct zoneref *z;
640 struct zone *zone;
098d7f12 641
c7d4caeb 642 spin_lock(&zone_scan_lock);
dd1a239f
MG
643 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
644 zone_clear_flag(zone, ZONE_OOM_LOCKED);
645 }
c7d4caeb 646 spin_unlock(&zone_scan_lock);
098d7f12
DR
647}
648
e3658932
DR
649/*
650 * Try to acquire the oom killer lock for all system zones. Returns zero if a
651 * parallel oom killing is taking place, otherwise locks all zones and returns
652 * non-zero.
653 */
654static int try_set_system_oom(void)
655{
656 struct zone *zone;
657 int ret = 1;
658
659 spin_lock(&zone_scan_lock);
660 for_each_populated_zone(zone)
661 if (zone_is_oom_locked(zone)) {
662 ret = 0;
663 goto out;
664 }
665 for_each_populated_zone(zone)
666 zone_set_flag(zone, ZONE_OOM_LOCKED);
667out:
668 spin_unlock(&zone_scan_lock);
669 return ret;
670}
671
672/*
673 * Clears ZONE_OOM_LOCKED for all system zones so that failed allocation
674 * attempts or page faults may now recall the oom killer, if necessary.
675 */
676static void clear_system_oom(void)
677{
678 struct zone *zone;
679
680 spin_lock(&zone_scan_lock);
681 for_each_populated_zone(zone)
682 zone_clear_flag(zone, ZONE_OOM_LOCKED);
683 spin_unlock(&zone_scan_lock);
684}
685
1da177e4 686/**
6937a25c 687 * out_of_memory - kill the "best" process when we run out of memory
1b578df0
RD
688 * @zonelist: zonelist pointer
689 * @gfp_mask: memory allocation flags
690 * @order: amount of memory being requested as a power of 2
6f48d0eb 691 * @nodemask: nodemask passed to page allocator
08ab9b10 692 * @force_kill: true if a task must be killed, even if others are exiting
1da177e4
LT
693 *
694 * If we run out of memory, we have the choice between either
695 * killing a random task (bad), letting the system crash (worse)
696 * OR try to be smart about which process to kill. Note that we
697 * don't have to be perfect here, we just have to be good.
698 */
4365a567 699void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask,
08ab9b10 700 int order, nodemask_t *nodemask, bool force_kill)
1da177e4 701{
e85bfd3a 702 const nodemask_t *mpol_mask;
0aad4b31 703 struct task_struct *p;
a63d83f4 704 unsigned long totalpages;
8bc719d3 705 unsigned long freed = 0;
a63d83f4 706 unsigned int points;
e3658932 707 enum oom_constraint constraint = CONSTRAINT_NONE;
b52723c5 708 int killed = 0;
8bc719d3
MS
709
710 blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
711 if (freed > 0)
712 /* Got some memory back in the last second. */
713 return;
1da177e4 714
7b98c2e4
DR
715 /*
716 * If current has a pending SIGKILL, then automatically select it. The
717 * goal is to allow it to allocate so that it may quickly exit and free
718 * its memory.
719 */
720 if (fatal_signal_pending(current)) {
721 set_thread_flag(TIF_MEMDIE);
722 return;
723 }
724
9b0f8b04
CL
725 /*
726 * Check if there were limitations on the allocation (only relevant for
727 * NUMA) that may require different handling.
728 */
a63d83f4
DR
729 constraint = constrained_alloc(zonelist, gfp_mask, nodemask,
730 &totalpages);
e85bfd3a
DR
731 mpol_mask = (constraint == CONSTRAINT_MEMORY_POLICY) ? nodemask : NULL;
732 check_panic_on_oom(constraint, gfp_mask, order, mpol_mask);
0aad4b31 733
2b45ab33 734 read_lock(&tasklist_lock);
f88ccad5 735 if (sysctl_oom_kill_allocating_task &&
a96cfd6e 736 !oom_unkillable_task(current, NULL, nodemask) &&
c9f01245 737 current->mm) {
2a1c9b1f
DR
738 oom_kill_process(current, gfp_mask, order, 0, totalpages, NULL,
739 nodemask,
740 "Out of memory (oom_kill_allocating_task)");
741 goto out;
0aad4b31
DR
742 }
743
08ab9b10
DR
744 p = select_bad_process(&points, totalpages, NULL, mpol_mask,
745 force_kill);
0aad4b31
DR
746 /* Found nothing?!?! Either we hang forever, or we panic. */
747 if (!p) {
e85bfd3a 748 dump_header(NULL, gfp_mask, order, NULL, mpol_mask);
0aad4b31
DR
749 read_unlock(&tasklist_lock);
750 panic("Out of memory and no killable processes...\n");
751 }
2a1c9b1f
DR
752 if (PTR_ERR(p) != -1UL) {
753 oom_kill_process(p, gfp_mask, order, points, totalpages, NULL,
754 nodemask, "Out of memory");
755 killed = 1;
756 }
b52723c5 757out:
140ffcec 758 read_unlock(&tasklist_lock);
1da177e4
LT
759
760 /*
761 * Give "p" a good chance of killing itself before we
2f659f46 762 * retry to allocate memory unless "p" is current
1da177e4 763 */
b52723c5 764 if (killed && !test_thread_flag(TIF_MEMDIE))
140ffcec 765 schedule_timeout_uninterruptible(1);
1da177e4 766}
e3658932
DR
767
768/*
769 * The pagefault handler calls here because it is out of memory, so kill a
770 * memory-hogging task. If a populated zone has ZONE_OOM_LOCKED set, a parallel
771 * oom killing is already in progress so do nothing. If a task is found with
772 * TIF_MEMDIE set, it has been killed so do nothing and allow it to exit.
773 */
774void pagefault_out_of_memory(void)
775{
776 if (try_set_system_oom()) {
08ab9b10 777 out_of_memory(NULL, 0, 0, NULL, false);
e3658932
DR
778 clear_system_oom();
779 }
780 if (!test_thread_flag(TIF_MEMDIE))
781 schedule_timeout_uninterruptible(1);
782}