blob: eafff89b3dd634e8836842005695c1ad48cc0cb2 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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...
David Rientjesa63d83f2010-08-09 17:19:46 -07007 * Copyright (C) 2010 Google, Inc.
8 * Rewritten by David Rientjes
Linus Torvalds1da177e2005-04-16 15:20:36 -07009 *
10 * The routines in this file are used to kill a process when
Paul Jacksona49335c2005-09-06 15:18:09 -070011 * 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.
Linus Torvalds1da177e2005-04-16 15:20:36 -070013 *
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
Alexey Dobriyan8ac773b2006-10-19 23:28:32 -070020#include <linux/oom.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070021#include <linux/mm.h>
Alexey Dobriyan4e950f62007-07-30 02:36:13 +040022#include <linux/err.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090023#include <linux/gfp.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include <linux/sched.h>
25#include <linux/swap.h>
26#include <linux/timex.h>
27#include <linux/jiffies.h>
Paul Jacksonef08e3b2005-09-06 15:18:13 -070028#include <linux/cpuset.h>
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -070029#include <linux/module.h>
30#include <linux/notifier.h>
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -080031#include <linux/memcontrol.h>
David Rientjes6f48d0eb2010-08-09 17:18:52 -070032#include <linux/mempolicy.h>
David Howells5cd9c582008-08-14 11:37:28 +010033#include <linux/security.h>
David Rientjesedd45542011-03-22 16:30:12 -070034#include <linux/ptrace.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070035
KAMEZAWA Hiroyukifadd8fb2006-06-23 02:03:13 -070036int sysctl_panic_on_oom;
David Rientjesfe071d72007-10-16 23:25:56 -070037int sysctl_oom_kill_allocating_task;
David Rientjesad915c42010-08-09 17:18:53 -070038int sysctl_oom_dump_tasks = 1;
David Rientjesc7d4cae2009-01-06 14:39:00 -080039static DEFINE_SPINLOCK(zone_scan_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -070040
David Rientjes72788c32011-05-24 17:11:40 -070041/**
42 * test_set_oom_score_adj() - set current's oom_score_adj and return old value
43 * @new_val: new oom_score_adj value
44 *
45 * Sets the oom_score_adj value for current to @new_val with proper
46 * synchronization and returns the old value. Usually used to temporarily
47 * set a value, save the old value in the caller, and then reinstate it later.
48 */
49int test_set_oom_score_adj(int new_val)
50{
51 struct sighand_struct *sighand = current->sighand;
52 int old_val;
53
54 spin_lock_irq(&sighand->siglock);
55 old_val = current->signal->oom_score_adj;
56 if (new_val != old_val) {
57 if (new_val == OOM_SCORE_ADJ_MIN)
58 atomic_inc(&current->mm->oom_disable_count);
59 else if (old_val == OOM_SCORE_ADJ_MIN)
60 atomic_dec(&current->mm->oom_disable_count);
61 current->signal->oom_score_adj = new_val;
62 }
63 spin_unlock_irq(&sighand->siglock);
64
65 return old_val;
66}
67
David Rientjes6f48d0eb2010-08-09 17:18:52 -070068#ifdef CONFIG_NUMA
69/**
70 * has_intersects_mems_allowed() - check task eligiblity for kill
71 * @tsk: task struct of which task to consider
72 * @mask: nodemask passed to page allocator for mempolicy ooms
73 *
74 * Task eligibility is determined by whether or not a candidate task, @tsk,
75 * shares the same mempolicy nodes as current if it is bound by such a policy
76 * and whether or not it has the same set of allowed cpuset nodes.
KOSAKI Motohiro495789a2009-09-21 17:03:14 -070077 */
David Rientjes6f48d0eb2010-08-09 17:18:52 -070078static bool has_intersects_mems_allowed(struct task_struct *tsk,
79 const nodemask_t *mask)
KOSAKI Motohiro495789a2009-09-21 17:03:14 -070080{
David Rientjes6f48d0eb2010-08-09 17:18:52 -070081 struct task_struct *start = tsk;
KOSAKI Motohiro495789a2009-09-21 17:03:14 -070082
KOSAKI Motohiro495789a2009-09-21 17:03:14 -070083 do {
David Rientjes6f48d0eb2010-08-09 17:18:52 -070084 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 */
91 if (mempolicy_nodemask_intersects(tsk, mask))
92 return true;
93 } else {
94 /*
95 * This is not a mempolicy constrained oom, so only
96 * check the mems of tsk's cpuset.
97 */
98 if (cpuset_mems_allowed_intersects(current, tsk))
99 return true;
100 }
KOSAKI Motohirodf1090a2010-08-09 17:19:39 -0700101 } while_each_thread(start, tsk);
102
David Rientjes6f48d0eb2010-08-09 17:18:52 -0700103 return false;
KOSAKI Motohiro495789a2009-09-21 17:03:14 -0700104}
David Rientjes6f48d0eb2010-08-09 17:18:52 -0700105#else
106static bool has_intersects_mems_allowed(struct task_struct *tsk,
107 const nodemask_t *mask)
108{
109 return true;
110}
111#endif /* CONFIG_NUMA */
KOSAKI Motohiro495789a2009-09-21 17:03:14 -0700112
David Rientjes6f48d0eb2010-08-09 17:18:52 -0700113/*
114 * The process p may have detached its own ->mm while exiting or through
115 * use_mm(), but one or more of its subthreads may still have a valid
116 * pointer. Return p, or any of its subthreads with a valid ->mm, with
117 * task_lock() held.
118 */
KAMEZAWA Hiroyuki158e0a22010-08-10 18:03:00 -0700119struct task_struct *find_lock_task_mm(struct task_struct *p)
Oleg Nesterovdd8e8f42010-08-09 17:18:45 -0700120{
121 struct task_struct *t = p;
122
123 do {
124 task_lock(t);
125 if (likely(t->mm))
126 return t;
127 task_unlock(t);
128 } while_each_thread(p, t);
129
130 return NULL;
131}
132
KOSAKI Motohiroab290ad2010-08-09 17:19:35 -0700133/* return true if the task is not adequate as candidate victim task. */
David Rientjese85bfd32010-09-22 13:05:10 -0700134static bool oom_unkillable_task(struct task_struct *p,
135 const struct mem_cgroup *mem, const nodemask_t *nodemask)
KOSAKI Motohiroab290ad2010-08-09 17:19:35 -0700136{
137 if (is_global_init(p))
138 return true;
139 if (p->flags & PF_KTHREAD)
140 return true;
141
142 /* When mem_cgroup_out_of_memory() and p is not member of the group */
143 if (mem && !task_in_mem_cgroup(p, mem))
144 return true;
145
146 /* p may not have freeable memory in nodemask */
147 if (!has_intersects_mems_allowed(p, nodemask))
148 return true;
149
150 return false;
151}
152
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153/**
David Rientjesa63d83f2010-08-09 17:19:46 -0700154 * oom_badness - heuristic function to determine which candidate task to kill
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155 * @p: task struct of which task we should calculate
David Rientjesa63d83f2010-08-09 17:19:46 -0700156 * @totalpages: total present RAM allowed for page allocation
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157 *
David Rientjesa63d83f2010-08-09 17:19:46 -0700158 * The heuristic for determining which task to kill is made to be as simple and
159 * predictable as possible. The goal is to return the highest value for the
160 * task consuming the most memory to avoid subsequent oom failures.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700161 */
David Rientjesa63d83f2010-08-09 17:19:46 -0700162unsigned int oom_badness(struct task_struct *p, struct mem_cgroup *mem,
163 const nodemask_t *nodemask, unsigned long totalpages)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164{
David Rientjesa63d83f2010-08-09 17:19:46 -0700165 int points;
KOSAKI Motohiro28b83c52009-09-21 17:03:13 -0700166
KOSAKI Motohiro26ebc982010-08-09 17:19:37 -0700167 if (oom_unkillable_task(p, mem, nodemask))
168 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169
Oleg Nesterovdd8e8f42010-08-09 17:18:45 -0700170 p = find_lock_task_mm(p);
171 if (!p)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172 return 0;
173
174 /*
David Rientjese18641e2010-10-26 14:21:23 -0700175 * Shortcut check for a thread sharing p->mm that is OOM_SCORE_ADJ_MIN
176 * so the entire heuristic doesn't need to be executed for something
177 * that cannot be killed.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178 */
David Rientjese18641e2010-10-26 14:21:23 -0700179 if (atomic_read(&p->mm->oom_disable_count)) {
David Rientjesa63d83f2010-08-09 17:19:46 -0700180 task_unlock(p);
181 return 0;
182 }
183
184 /*
David Rientjesa63d83f2010-08-09 17:19:46 -0700185 * The memory controller may have a limit of 0 bytes, so avoid a divide
186 * by zero, if necessary.
187 */
188 if (!totalpages)
189 totalpages = 1;
190
191 /*
192 * The baseline for the badness score is the proportion of RAM that each
KOSAKI Motohirof755a042011-04-27 15:26:50 -0700193 * task's rss, pagetable and swap space use.
David Rientjesa63d83f2010-08-09 17:19:46 -0700194 */
KOSAKI Motohirof755a042011-04-27 15:26:50 -0700195 points = get_mm_rss(p->mm) + p->mm->nr_ptes;
196 points += get_mm_counter(p->mm, MM_SWAPENTS);
197
198 points *= 1000;
199 points /= totalpages;
Andrew Morton97c2c9b2006-04-18 22:20:38 -0700200 task_unlock(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700201
202 /*
David Rientjesa63d83f2010-08-09 17:19:46 -0700203 * Root processes get 3% bonus, just like the __vm_enough_memory()
204 * implementation used by LSMs.
Hugh Dickins7ba34852007-01-05 16:37:03 -0800205 */
David Rientjesa63d83f2010-08-09 17:19:46 -0700206 if (has_capability_noaudit(p, CAP_SYS_ADMIN))
207 points -= 30;
Hugh Dickins7ba34852007-01-05 16:37:03 -0800208
209 /*
David Rientjesa63d83f2010-08-09 17:19:46 -0700210 * /proc/pid/oom_score_adj ranges from -1000 to +1000 such that it may
211 * either completely disable oom killing or always prefer a certain
212 * task.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213 */
David Rientjesa63d83f2010-08-09 17:19:46 -0700214 points += p->signal->oom_score_adj;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215
David Rientjesf19e8aa2010-09-22 13:04:52 -0700216 /*
217 * Never return 0 for an eligible task that may be killed since it's
218 * possible that no single user task uses more than 0.1% of memory and
219 * no single admin tasks uses more than 3.0%.
220 */
221 if (points <= 0)
222 return 1;
David Rientjesa63d83f2010-08-09 17:19:46 -0700223 return (points < 1000) ? points : 1000;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700224}
225
226/*
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800227 * Determine the type of allocation constraint.
228 */
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800229#ifdef CONFIG_NUMA
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800230static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
David Rientjesa63d83f2010-08-09 17:19:46 -0700231 gfp_t gfp_mask, nodemask_t *nodemask,
232 unsigned long *totalpages)
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800233{
Mel Gorman54a6eb52008-04-28 02:12:16 -0700234 struct zone *zone;
Mel Gormandd1a2392008-04-28 02:12:17 -0700235 struct zoneref *z;
Mel Gorman54a6eb52008-04-28 02:12:16 -0700236 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
David Rientjesa63d83f2010-08-09 17:19:46 -0700237 bool cpuset_limited = false;
238 int nid;
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800239
David Rientjesa63d83f2010-08-09 17:19:46 -0700240 /* Default to all available memory */
241 *totalpages = totalram_pages + total_swap_pages;
242
243 if (!zonelist)
244 return CONSTRAINT_NONE;
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800245 /*
246 * Reach here only when __GFP_NOFAIL is used. So, we should avoid
247 * to kill current.We have to random task kill in this case.
248 * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
249 */
250 if (gfp_mask & __GFP_THISNODE)
251 return CONSTRAINT_NONE;
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800252
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800253 /*
David Rientjesa63d83f2010-08-09 17:19:46 -0700254 * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
255 * the page allocator means a mempolicy is in effect. Cpuset policy
256 * is enforced in get_page_from_freelist().
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800257 */
David Rientjesa63d83f2010-08-09 17:19:46 -0700258 if (nodemask && !nodes_subset(node_states[N_HIGH_MEMORY], *nodemask)) {
259 *totalpages = total_swap_pages;
260 for_each_node_mask(nid, *nodemask)
261 *totalpages += node_spanned_pages(nid);
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800262 return CONSTRAINT_MEMORY_POLICY;
David Rientjesa63d83f2010-08-09 17:19:46 -0700263 }
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800264
265 /* Check this allocation failure is caused by cpuset's wall function */
266 for_each_zone_zonelist_nodemask(zone, z, zonelist,
267 high_zoneidx, nodemask)
268 if (!cpuset_zone_allowed_softwall(zone, gfp_mask))
David Rientjesa63d83f2010-08-09 17:19:46 -0700269 cpuset_limited = true;
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800270
David Rientjesa63d83f2010-08-09 17:19:46 -0700271 if (cpuset_limited) {
272 *totalpages = total_swap_pages;
273 for_each_node_mask(nid, cpuset_current_mems_allowed)
274 *totalpages += node_spanned_pages(nid);
275 return CONSTRAINT_CPUSET;
276 }
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800277 return CONSTRAINT_NONE;
278}
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800279#else
280static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
David Rientjesa63d83f2010-08-09 17:19:46 -0700281 gfp_t gfp_mask, nodemask_t *nodemask,
282 unsigned long *totalpages)
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800283{
David Rientjesa63d83f2010-08-09 17:19:46 -0700284 *totalpages = totalram_pages + total_swap_pages;
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800285 return CONSTRAINT_NONE;
286}
287#endif
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800288
289/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290 * Simple selection loop. We chose the process with the highest
291 * number of 'points'. We expect the caller will lock the tasklist.
292 *
293 * (not docbooked, we don't want this one cluttering up the manual)
294 */
David Rientjesa63d83f2010-08-09 17:19:46 -0700295static struct task_struct *select_bad_process(unsigned int *ppoints,
296 unsigned long totalpages, struct mem_cgroup *mem,
297 const nodemask_t *nodemask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298{
David Rientjes3a5dda72011-03-22 16:30:09 -0700299 struct task_struct *g, *p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700300 struct task_struct *chosen = NULL;
Kurt Garloff9827b782006-02-20 18:27:51 -0800301 *ppoints = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700302
David Rientjes3a5dda72011-03-22 16:30:09 -0700303 do_each_thread(g, p) {
David Rientjesa63d83f2010-08-09 17:19:46 -0700304 unsigned int points;
Paul Jacksona49335c2005-09-06 15:18:09 -0700305
Andrey Vagin30e2b412011-03-22 16:30:11 -0700306 if (!p->mm)
307 continue;
KOSAKI Motohiroab290ad2010-08-09 17:19:35 -0700308 if (oom_unkillable_task(p, mem, nodemask))
David Rientjes6cf86ac2010-08-09 17:18:50 -0700309 continue;
Paul Jacksonef08e3b2005-09-06 15:18:13 -0700310
Paul Jacksona49335c2005-09-06 15:18:09 -0700311 /*
Nick Pigginb78483a2006-09-29 02:01:14 -0700312 * This task already has access to memory reserves and is
313 * being killed. Don't allow any other task access to the
314 * memory reserve.
315 *
316 * Note: this may have a chance of deadlock if it gets
317 * blocked waiting for another task which itself is waiting
318 * for memory. Is there a better alternative?
319 */
320 if (test_tsk_thread_flag(p, TIF_MEMDIE))
321 return ERR_PTR(-1UL);
322
Andrey Vagin30e2b412011-03-22 16:30:11 -0700323 if (p->flags & PF_EXITING) {
David Rientjesedd45542011-03-22 16:30:12 -0700324 /*
325 * If p is the current task and is in the process of
326 * releasing memory, we allow the "kill" to set
327 * TIF_MEMDIE, which will allow it to gain access to
328 * memory reserves. Otherwise, it may stall forever.
329 *
330 * The loop isn't broken here, however, in case other
331 * threads are found to have already been oom killed.
332 */
333 if (p == current) {
334 chosen = p;
335 *ppoints = 1000;
336 } else {
337 /*
338 * If this task is not being ptraced on exit,
339 * then wait for it to finish before killing
340 * some other task unnecessarily.
341 */
Tejun Heod21142e2011-06-17 16:50:34 +0200342 if (!(p->group_leader->ptrace & PT_TRACE_EXIT))
David Rientjesedd45542011-03-22 16:30:12 -0700343 return ERR_PTR(-1UL);
344 }
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700345 }
Oleg Nesterov972c4ea2006-09-29 02:01:12 -0700346
David Rientjesa63d83f2010-08-09 17:19:46 -0700347 points = oom_badness(p, mem, nodemask, totalpages);
348 if (points > *ppoints) {
Paul Jacksona49335c2005-09-06 15:18:09 -0700349 chosen = p;
Kurt Garloff9827b782006-02-20 18:27:51 -0800350 *ppoints = points;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351 }
David Rientjes3a5dda72011-03-22 16:30:09 -0700352 } while_each_thread(g, p);
Oleg Nesterov972c4ea2006-09-29 02:01:12 -0700353
Linus Torvalds1da177e2005-04-16 15:20:36 -0700354 return chosen;
355}
356
357/**
Randy Dunlap1b578df2008-03-19 17:00:42 -0700358 * dump_tasks - dump current memory state of all system tasks
David Rientjes74ab7f12010-08-09 17:18:46 -0700359 * @mem: current's memory controller, if constrained
David Rientjese85bfd32010-09-22 13:05:10 -0700360 * @nodemask: nodemask passed to page allocator for mempolicy ooms
Randy Dunlap1b578df2008-03-19 17:00:42 -0700361 *
David Rientjese85bfd32010-09-22 13:05:10 -0700362 * Dumps the current memory state of all eligible tasks. Tasks not in the same
363 * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
364 * are not shown.
David Rientjesfef1bdd2008-02-07 00:14:07 -0800365 * State information includes task's pid, uid, tgid, vm size, rss, cpu, oom_adj
David Rientjesa63d83f2010-08-09 17:19:46 -0700366 * value, oom_score_adj value, and name.
David Rientjesfef1bdd2008-02-07 00:14:07 -0800367 *
David Rientjesfef1bdd2008-02-07 00:14:07 -0800368 * Call with tasklist_lock read-locked.
369 */
David Rientjese85bfd32010-09-22 13:05:10 -0700370static void dump_tasks(const struct mem_cgroup *mem, const nodemask_t *nodemask)
David Rientjesfef1bdd2008-02-07 00:14:07 -0800371{
KOSAKI Motohiroc55db952010-08-09 17:18:46 -0700372 struct task_struct *p;
373 struct task_struct *task;
David Rientjesfef1bdd2008-02-07 00:14:07 -0800374
David Rientjesa63d83f2010-08-09 17:19:46 -0700375 pr_info("[ pid ] uid tgid total_vm rss cpu oom_adj oom_score_adj name\n");
KOSAKI Motohiroc55db952010-08-09 17:18:46 -0700376 for_each_process(p) {
David Rientjese85bfd32010-09-22 13:05:10 -0700377 if (oom_unkillable_task(p, mem, nodemask))
David Rientjesfef1bdd2008-02-07 00:14:07 -0800378 continue;
379
KOSAKI Motohiroc55db952010-08-09 17:18:46 -0700380 task = find_lock_task_mm(p);
381 if (!task) {
David Rientjes6d2661e2009-05-28 14:34:19 -0700382 /*
David Rientjes74ab7f12010-08-09 17:18:46 -0700383 * This is a kthread or all of p's threads have already
384 * detached their mm's. There's no need to report
KOSAKI Motohiroc55db952010-08-09 17:18:46 -0700385 * them; they can't be oom killed anyway.
David Rientjes6d2661e2009-05-28 14:34:19 -0700386 */
David Rientjes6d2661e2009-05-28 14:34:19 -0700387 continue;
388 }
KOSAKI Motohiroc55db952010-08-09 17:18:46 -0700389
David Rientjesa63d83f2010-08-09 17:19:46 -0700390 pr_info("[%5d] %5d %5d %8lu %8lu %3u %3d %5d %s\n",
KOSAKI Motohiro8d6c83f2010-08-19 14:13:39 -0700391 task->pid, task_uid(task), task->tgid,
David Rientjesa63d83f2010-08-09 17:19:46 -0700392 task->mm->total_vm, get_mm_rss(task->mm),
393 task_cpu(task), task->signal->oom_adj,
394 task->signal->oom_score_adj, task->comm);
KOSAKI Motohiroc55db952010-08-09 17:18:46 -0700395 task_unlock(task);
396 }
David Rientjesfef1bdd2008-02-07 00:14:07 -0800397}
398
Daisuke Nishimurad31f56d2009-12-15 16:47:12 -0800399static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order,
David Rientjese85bfd32010-09-22 13:05:10 -0700400 struct mem_cgroup *mem, const nodemask_t *nodemask)
David Rientjes1b604d72009-12-14 17:57:47 -0800401{
David Rientjes5e9d8342010-08-09 17:18:51 -0700402 task_lock(current);
David Rientjes1b604d72009-12-14 17:57:47 -0800403 pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
David Rientjesa63d83f2010-08-09 17:19:46 -0700404 "oom_adj=%d, oom_score_adj=%d\n",
405 current->comm, gfp_mask, order, current->signal->oom_adj,
406 current->signal->oom_score_adj);
David Rientjes1b604d72009-12-14 17:57:47 -0800407 cpuset_print_task_mems_allowed(current);
408 task_unlock(current);
409 dump_stack();
Daisuke Nishimurad31f56d2009-12-15 16:47:12 -0800410 mem_cgroup_print_oom_info(mem, p);
David Rientjesb2b755b2011-03-24 15:18:15 -0700411 show_mem(SHOW_MEM_FILTER_NODES);
David Rientjes1b604d72009-12-14 17:57:47 -0800412 if (sysctl_oom_dump_tasks)
David Rientjese85bfd32010-09-22 13:05:10 -0700413 dump_tasks(mem, nodemask);
David Rientjes1b604d72009-12-14 17:57:47 -0800414}
415
KOSAKI Motohiro3b4798c2009-12-15 16:45:32 -0800416#define K(x) ((x) << (PAGE_SHIFT-10))
Luis Claudio R. Goncalves93b43fa2010-08-09 17:19:41 -0700417static int oom_kill_task(struct task_struct *p, struct mem_cgroup *mem)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418{
David Rientjes1e99bad2010-10-26 14:21:24 -0700419 struct task_struct *q;
420 struct mm_struct *mm;
421
David Rientjesb940fd72010-08-09 17:18:57 -0700422 p = find_lock_task_mm(p);
KOSAKI Motohirobe71cf22010-08-19 14:13:38 -0700423 if (!p)
Dave Peterson01315922006-04-18 22:20:44 -0700424 return 1;
KOSAKI Motohirobe71cf22010-08-19 14:13:38 -0700425
David Rientjes1e99bad2010-10-26 14:21:24 -0700426 /* mm cannot be safely dereferenced after task_unlock(p) */
427 mm = p->mm;
428
David Rientjesb940fd72010-08-09 17:18:57 -0700429 pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
430 task_pid_nr(p), p->comm, K(p->mm->total_vm),
431 K(get_mm_counter(p->mm, MM_ANONPAGES)),
432 K(get_mm_counter(p->mm, MM_FILEPAGES)));
433 task_unlock(p);
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700434
David Rientjes1e99bad2010-10-26 14:21:24 -0700435 /*
436 * Kill all processes sharing p->mm in other thread groups, if any.
437 * They don't get access to memory reserves or a higher scheduler
438 * priority, though, to avoid depletion of all memory or task
439 * starvation. This prevents mm->mmap_sem livelock when an oom killed
440 * task cannot exit because it requires the semaphore and its contended
441 * by another thread trying to allocate memory itself. That thread will
442 * now get access to memory reserves since it has a pending fatal
443 * signal.
444 */
445 for_each_process(q)
446 if (q->mm == mm && !same_thread_group(q, p)) {
447 task_lock(q); /* Protect ->comm from prctl() */
448 pr_err("Kill process %d (%s) sharing same memory\n",
449 task_pid_nr(q), q->comm);
450 task_unlock(q);
451 force_sig(SIGKILL, q);
452 }
Luis Claudio R. Goncalves93b43fa2010-08-09 17:19:41 -0700453
David Rientjesb940fd72010-08-09 17:18:57 -0700454 set_tsk_thread_flag(p, TIF_MEMDIE);
455 force_sig(SIGKILL, p);
Luis Claudio R. Goncalves93b43fa2010-08-09 17:19:41 -0700456
Dave Peterson01315922006-04-18 22:20:44 -0700457 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700458}
David Rientjesb940fd72010-08-09 17:18:57 -0700459#undef K
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460
David Rientjes7213f502007-10-16 23:25:57 -0700461static int oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order,
David Rientjesa63d83f2010-08-09 17:19:46 -0700462 unsigned int points, unsigned long totalpages,
463 struct mem_cgroup *mem, nodemask_t *nodemask,
464 const char *message)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700465{
Linus Torvalds52d3c032011-03-14 15:17:07 -0700466 struct task_struct *victim = p;
David Rientjes5e9d8342010-08-09 17:18:51 -0700467 struct task_struct *child;
Linus Torvalds52d3c032011-03-14 15:17:07 -0700468 struct task_struct *t = p;
469 unsigned int victim_points = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700470
David Rientjes1b604d72009-12-14 17:57:47 -0800471 if (printk_ratelimit())
David Rientjese85bfd32010-09-22 13:05:10 -0700472 dump_header(p, gfp_mask, order, mem, nodemask);
David Rientjes7213f502007-10-16 23:25:57 -0700473
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700474 /*
475 * If the task is already exiting, don't alarm the sysadmin or kill
476 * its children or threads, just set TIF_MEMDIE so it can die quickly
477 */
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700478 if (p->flags & PF_EXITING) {
David Rientjes43589972010-08-09 17:18:49 -0700479 set_tsk_thread_flag(p, TIF_MEMDIE);
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700480 return 0;
481 }
482
David Rientjes5e9d8342010-08-09 17:18:51 -0700483 task_lock(p);
David Rientjesa63d83f2010-08-09 17:19:46 -0700484 pr_err("%s: Kill process %d (%s) score %d or sacrifice child\n",
David Rientjes5e9d8342010-08-09 17:18:51 -0700485 message, task_pid_nr(p), p->comm, points);
486 task_unlock(p);
Nick Pigginf3af38d2006-12-06 20:31:51 -0800487
David Rientjes5e9d8342010-08-09 17:18:51 -0700488 /*
489 * If any of p's children has a different mm and is eligible for kill,
David Rientjes11239832011-07-25 17:12:17 -0700490 * the one with the highest oom_badness() score is sacrificed for its
David Rientjes5e9d8342010-08-09 17:18:51 -0700491 * parent. This attempts to lose the minimal amount of work done while
492 * still freeing memory.
493 */
Oleg Nesterovdd8e8f42010-08-09 17:18:45 -0700494 do {
David Rientjes5e9d8342010-08-09 17:18:51 -0700495 list_for_each_entry(child, &t->children, sibling) {
David Rientjesa63d83f2010-08-09 17:19:46 -0700496 unsigned int child_points;
David Rientjes5e9d8342010-08-09 17:18:51 -0700497
David Rientjesedd45542011-03-22 16:30:12 -0700498 if (child->mm == p->mm)
499 continue;
David Rientjesa63d83f2010-08-09 17:19:46 -0700500 /*
501 * oom_badness() returns 0 if the thread is unkillable
502 */
503 child_points = oom_badness(child, mem, nodemask,
504 totalpages);
David Rientjes5e9d8342010-08-09 17:18:51 -0700505 if (child_points > victim_points) {
506 victim = child;
507 victim_points = child_points;
508 }
Oleg Nesterovdd8e8f42010-08-09 17:18:45 -0700509 }
510 } while_each_thread(p, t);
511
Luis Claudio R. Goncalves93b43fa2010-08-09 17:19:41 -0700512 return oom_kill_task(victim, mem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513}
514
David Rientjes309ed882010-08-09 17:18:54 -0700515/*
516 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
517 */
518static void check_panic_on_oom(enum oom_constraint constraint, gfp_t gfp_mask,
David Rientjese85bfd32010-09-22 13:05:10 -0700519 int order, const nodemask_t *nodemask)
David Rientjes309ed882010-08-09 17:18:54 -0700520{
521 if (likely(!sysctl_panic_on_oom))
522 return;
523 if (sysctl_panic_on_oom != 2) {
524 /*
525 * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
526 * does not panic for cpuset, mempolicy, or memcg allocation
527 * failures.
528 */
529 if (constraint != CONSTRAINT_NONE)
530 return;
531 }
532 read_lock(&tasklist_lock);
David Rientjese85bfd32010-09-22 13:05:10 -0700533 dump_header(NULL, gfp_mask, order, NULL, nodemask);
David Rientjes309ed882010-08-09 17:18:54 -0700534 read_unlock(&tasklist_lock);
535 panic("Out of memory: %s panic_on_oom is enabled\n",
536 sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
537}
538
Balbir Singh00f0b822008-03-04 14:28:39 -0800539#ifdef CONFIG_CGROUP_MEM_RES_CTLR
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800540void mem_cgroup_out_of_memory(struct mem_cgroup *mem, gfp_t gfp_mask)
541{
David Rientjesa63d83f2010-08-09 17:19:46 -0700542 unsigned long limit;
543 unsigned int points = 0;
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800544 struct task_struct *p;
545
David Rientjesf9434ad2011-03-23 16:42:44 -0700546 /*
547 * If current has a pending SIGKILL, then automatically select it. The
548 * goal is to allow it to allocate so that it may quickly exit and free
549 * its memory.
550 */
551 if (fatal_signal_pending(current)) {
552 set_thread_flag(TIF_MEMDIE);
David Rientjesf9434ad2011-03-23 16:42:44 -0700553 return;
554 }
555
David Rientjese85bfd32010-09-22 13:05:10 -0700556 check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, 0, NULL);
David Rientjesa63d83f2010-08-09 17:19:46 -0700557 limit = mem_cgroup_get_limit(mem) >> PAGE_SHIFT;
Li Zefane115f2d2008-04-15 14:34:37 -0700558 read_lock(&tasklist_lock);
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800559retry:
David Rientjesa63d83f2010-08-09 17:19:46 -0700560 p = select_bad_process(&points, limit, mem, NULL);
David Rientjesdf64f812010-05-26 14:42:41 -0700561 if (!p || PTR_ERR(p) == -1UL)
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800562 goto out;
563
David Rientjesa63d83f2010-08-09 17:19:46 -0700564 if (oom_kill_process(p, gfp_mask, 0, points, limit, mem, NULL,
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800565 "Memory cgroup out of memory"))
566 goto retry;
567out:
Li Zefane115f2d2008-04-15 14:34:37 -0700568 read_unlock(&tasklist_lock);
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800569}
570#endif
571
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -0700572static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
573
574int register_oom_notifier(struct notifier_block *nb)
575{
576 return blocking_notifier_chain_register(&oom_notify_list, nb);
577}
578EXPORT_SYMBOL_GPL(register_oom_notifier);
579
580int unregister_oom_notifier(struct notifier_block *nb)
581{
582 return blocking_notifier_chain_unregister(&oom_notify_list, nb);
583}
584EXPORT_SYMBOL_GPL(unregister_oom_notifier);
585
David Rientjes098d7f12007-10-16 23:25:55 -0700586/*
587 * Try to acquire the OOM killer lock for the zones in zonelist. Returns zero
588 * if a parallel OOM killing is already taking place that includes a zone in
589 * the zonelist. Otherwise, locks all zones in the zonelist and returns 1.
590 */
Minchan Kimff321fe2010-08-09 17:18:57 -0700591int try_set_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
David Rientjes098d7f12007-10-16 23:25:55 -0700592{
Mel Gormandd1a2392008-04-28 02:12:17 -0700593 struct zoneref *z;
594 struct zone *zone;
David Rientjes098d7f12007-10-16 23:25:55 -0700595 int ret = 1;
596
David Rientjesc7d4cae2009-01-06 14:39:00 -0800597 spin_lock(&zone_scan_lock);
Mel Gormandd1a2392008-04-28 02:12:17 -0700598 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
599 if (zone_is_oom_locked(zone)) {
David Rientjes098d7f12007-10-16 23:25:55 -0700600 ret = 0;
601 goto out;
602 }
Mel Gormandd1a2392008-04-28 02:12:17 -0700603 }
David Rientjes098d7f12007-10-16 23:25:55 -0700604
Mel Gormandd1a2392008-04-28 02:12:17 -0700605 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
606 /*
David Rientjesc7d4cae2009-01-06 14:39:00 -0800607 * Lock each zone in the zonelist under zone_scan_lock so a
Minchan Kimff321fe2010-08-09 17:18:57 -0700608 * parallel invocation of try_set_zonelist_oom() doesn't succeed
Mel Gormandd1a2392008-04-28 02:12:17 -0700609 * when it shouldn't.
610 */
611 zone_set_flag(zone, ZONE_OOM_LOCKED);
612 }
613
David Rientjes098d7f12007-10-16 23:25:55 -0700614out:
David Rientjesc7d4cae2009-01-06 14:39:00 -0800615 spin_unlock(&zone_scan_lock);
David Rientjes098d7f12007-10-16 23:25:55 -0700616 return ret;
617}
618
619/*
620 * Clears the ZONE_OOM_LOCKED flag for all zones in the zonelist so that failed
621 * allocation attempts with zonelists containing them may now recall the OOM
622 * killer, if necessary.
623 */
Mel Gormandd1a2392008-04-28 02:12:17 -0700624void clear_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
David Rientjes098d7f12007-10-16 23:25:55 -0700625{
Mel Gormandd1a2392008-04-28 02:12:17 -0700626 struct zoneref *z;
627 struct zone *zone;
David Rientjes098d7f12007-10-16 23:25:55 -0700628
David Rientjesc7d4cae2009-01-06 14:39:00 -0800629 spin_lock(&zone_scan_lock);
Mel Gormandd1a2392008-04-28 02:12:17 -0700630 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
631 zone_clear_flag(zone, ZONE_OOM_LOCKED);
632 }
David Rientjesc7d4cae2009-01-06 14:39:00 -0800633 spin_unlock(&zone_scan_lock);
David Rientjes098d7f12007-10-16 23:25:55 -0700634}
635
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800636/*
David Rientjese3658932010-08-09 17:18:55 -0700637 * Try to acquire the oom killer lock for all system zones. Returns zero if a
638 * parallel oom killing is taking place, otherwise locks all zones and returns
639 * non-zero.
640 */
641static int try_set_system_oom(void)
642{
643 struct zone *zone;
644 int ret = 1;
645
646 spin_lock(&zone_scan_lock);
647 for_each_populated_zone(zone)
648 if (zone_is_oom_locked(zone)) {
649 ret = 0;
650 goto out;
651 }
652 for_each_populated_zone(zone)
653 zone_set_flag(zone, ZONE_OOM_LOCKED);
654out:
655 spin_unlock(&zone_scan_lock);
656 return ret;
657}
658
659/*
660 * Clears ZONE_OOM_LOCKED for all system zones so that failed allocation
661 * attempts or page faults may now recall the oom killer, if necessary.
662 */
663static void clear_system_oom(void)
664{
665 struct zone *zone;
666
667 spin_lock(&zone_scan_lock);
668 for_each_populated_zone(zone)
669 zone_clear_flag(zone, ZONE_OOM_LOCKED);
670 spin_unlock(&zone_scan_lock);
671}
672
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673/**
Dave Peterson6937a252006-06-23 02:03:13 -0700674 * out_of_memory - kill the "best" process when we run out of memory
Randy Dunlap1b578df2008-03-19 17:00:42 -0700675 * @zonelist: zonelist pointer
676 * @gfp_mask: memory allocation flags
677 * @order: amount of memory being requested as a power of 2
David Rientjes6f48d0eb2010-08-09 17:18:52 -0700678 * @nodemask: nodemask passed to page allocator
Linus Torvalds1da177e2005-04-16 15:20:36 -0700679 *
680 * If we run out of memory, we have the choice between either
681 * killing a random task (bad), letting the system crash (worse)
682 * OR try to be smart about which process to kill. Note that we
683 * don't have to be perfect here, we just have to be good.
684 */
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800685void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask,
686 int order, nodemask_t *nodemask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700687{
David Rientjese85bfd32010-09-22 13:05:10 -0700688 const nodemask_t *mpol_mask;
David Rientjes0aad4b32010-08-09 17:18:59 -0700689 struct task_struct *p;
David Rientjesa63d83f2010-08-09 17:19:46 -0700690 unsigned long totalpages;
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -0700691 unsigned long freed = 0;
David Rientjesa63d83f2010-08-09 17:19:46 -0700692 unsigned int points;
David Rientjese3658932010-08-09 17:18:55 -0700693 enum oom_constraint constraint = CONSTRAINT_NONE;
KOSAKI Motohirob52723c2010-08-19 14:13:39 -0700694 int killed = 0;
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -0700695
696 blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
697 if (freed > 0)
698 /* Got some memory back in the last second. */
699 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700700
David Rientjes7b98c2e2010-08-09 17:18:48 -0700701 /*
702 * If current has a pending SIGKILL, then automatically select it. The
703 * goal is to allow it to allocate so that it may quickly exit and free
704 * its memory.
705 */
706 if (fatal_signal_pending(current)) {
707 set_thread_flag(TIF_MEMDIE);
708 return;
709 }
710
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800711 /*
712 * Check if there were limitations on the allocation (only relevant for
713 * NUMA) that may require different handling.
714 */
David Rientjesa63d83f2010-08-09 17:19:46 -0700715 constraint = constrained_alloc(zonelist, gfp_mask, nodemask,
716 &totalpages);
David Rientjese85bfd32010-09-22 13:05:10 -0700717 mpol_mask = (constraint == CONSTRAINT_MEMORY_POLICY) ? nodemask : NULL;
718 check_panic_on_oom(constraint, gfp_mask, order, mpol_mask);
David Rientjes0aad4b32010-08-09 17:18:59 -0700719
David Rientjes2b45ab32007-05-06 14:50:00 -0700720 read_lock(&tasklist_lock);
KOSAKI Motohirof88ccad2010-08-09 17:19:36 -0700721 if (sysctl_oom_kill_allocating_task &&
KOSAKI Motohiroa96cfd62010-08-09 17:19:38 -0700722 !oom_unkillable_task(current, NULL, nodemask) &&
David Rientjese18641e2010-10-26 14:21:23 -0700723 current->mm && !atomic_read(&current->mm->oom_disable_count)) {
David Rientjes0aad4b32010-08-09 17:18:59 -0700724 /*
725 * oom_kill_process() needs tasklist_lock held. If it returns
726 * non-zero, current could not be killed so we must fallback to
727 * the tasklist scan.
728 */
David Rientjesa63d83f2010-08-09 17:19:46 -0700729 if (!oom_kill_process(current, gfp_mask, order, 0, totalpages,
730 NULL, nodemask,
David Rientjes0aad4b32010-08-09 17:18:59 -0700731 "Out of memory (oom_kill_allocating_task)"))
KOSAKI Motohirob52723c2010-08-19 14:13:39 -0700732 goto out;
David Rientjes0aad4b32010-08-09 17:18:59 -0700733 }
734
735retry:
David Rientjese85bfd32010-09-22 13:05:10 -0700736 p = select_bad_process(&points, totalpages, NULL, mpol_mask);
David Rientjes0aad4b32010-08-09 17:18:59 -0700737 if (PTR_ERR(p) == -1UL)
KOSAKI Motohirob52723c2010-08-19 14:13:39 -0700738 goto out;
David Rientjes0aad4b32010-08-09 17:18:59 -0700739
740 /* Found nothing?!?! Either we hang forever, or we panic. */
741 if (!p) {
David Rientjese85bfd32010-09-22 13:05:10 -0700742 dump_header(NULL, gfp_mask, order, NULL, mpol_mask);
David Rientjes0aad4b32010-08-09 17:18:59 -0700743 read_unlock(&tasklist_lock);
744 panic("Out of memory and no killable processes...\n");
745 }
746
David Rientjesa63d83f2010-08-09 17:19:46 -0700747 if (oom_kill_process(p, gfp_mask, order, points, totalpages, NULL,
748 nodemask, "Out of memory"))
David Rientjes0aad4b32010-08-09 17:18:59 -0700749 goto retry;
KOSAKI Motohirob52723c2010-08-19 14:13:39 -0700750 killed = 1;
751out:
Andrew Morton140ffce2006-03-02 02:54:28 -0800752 read_unlock(&tasklist_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700753
754 /*
755 * Give "p" a good chance of killing itself before we
Kirill Korotaev2f659f42006-01-08 01:01:05 -0800756 * retry to allocate memory unless "p" is current
Linus Torvalds1da177e2005-04-16 15:20:36 -0700757 */
KOSAKI Motohirob52723c2010-08-19 14:13:39 -0700758 if (killed && !test_thread_flag(TIF_MEMDIE))
Andrew Morton140ffce2006-03-02 02:54:28 -0800759 schedule_timeout_uninterruptible(1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700760}
David Rientjese3658932010-08-09 17:18:55 -0700761
762/*
763 * The pagefault handler calls here because it is out of memory, so kill a
764 * memory-hogging task. If a populated zone has ZONE_OOM_LOCKED set, a parallel
765 * oom killing is already in progress so do nothing. If a task is found with
766 * TIF_MEMDIE set, it has been killed so do nothing and allow it to exit.
767 */
768void pagefault_out_of_memory(void)
769{
770 if (try_set_system_oom()) {
771 out_of_memory(NULL, 0, 0, NULL);
772 clear_system_oom();
773 }
774 if (!test_thread_flag(TIF_MEMDIE))
775 schedule_timeout_uninterruptible(1);
776}