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