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