blob: a7b2460e922b779252ebcc225cecaf6060b0e964 [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...
7 *
8 * The routines in this file are used to kill a process when
Paul Jacksona49335c2005-09-06 15:18:09 -07009 * we're seriously out of memory. This gets called from __alloc_pages()
10 * in mm/page_alloc.c when we really run out of memory.
Linus Torvalds1da177e2005-04-16 15:20:36 -070011 *
12 * Since we won't call these routines often (on a well-configured
13 * machine) this file will double as a 'coding guide' and a signpost
14 * for newbie kernel hackers. It features several pointers to major
15 * kernel subsystems and hints as to where to find out what things do.
16 */
17
Alexey Dobriyan8ac773b2006-10-19 23:28:32 -070018#include <linux/oom.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070019#include <linux/mm.h>
Alexey Dobriyan4e950f62007-07-30 02:36:13 +040020#include <linux/err.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070021#include <linux/sched.h>
22#include <linux/swap.h>
23#include <linux/timex.h>
24#include <linux/jiffies.h>
Paul Jacksonef08e3b2005-09-06 15:18:13 -070025#include <linux/cpuset.h>
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -070026#include <linux/module.h>
27#include <linux/notifier.h>
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -080028#include <linux/memcontrol.h>
David Howells5cd9c582008-08-14 11:37:28 +010029#include <linux/security.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070030
KAMEZAWA Hiroyukifadd8fb2006-06-23 02:03:13 -070031int sysctl_panic_on_oom;
David Rientjesfe071d72007-10-16 23:25:56 -070032int sysctl_oom_kill_allocating_task;
David Rientjesfef1bdd2008-02-07 00:14:07 -080033int sysctl_oom_dump_tasks;
David Rientjesc7d4cae2009-01-06 14:39:00 -080034static DEFINE_SPINLOCK(zone_scan_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -070035/* #define DEBUG */
36
37/**
Dave Peterson6937a252006-06-23 02:03:13 -070038 * badness - calculate a numeric value for how bad this task has been
Linus Torvalds1da177e2005-04-16 15:20:36 -070039 * @p: task struct of which task we should calculate
Paul Jacksona49335c2005-09-06 15:18:09 -070040 * @uptime: current uptime in seconds
Linus Torvalds1da177e2005-04-16 15:20:36 -070041 *
42 * The formula used is relatively simple and documented inline in the
43 * function. The main rationale is that we want to select a good task
44 * to kill when we run out of memory.
45 *
46 * Good in this context means that:
47 * 1) we lose the minimum amount of work done
48 * 2) we recover a large amount of memory
49 * 3) we don't kill anything innocent of eating tons of memory
50 * 4) we want to kill the minimum amount of processes (one)
51 * 5) we try to kill the process the user expects us to kill, this
52 * algorithm has been meticulously tuned to meet the principle
53 * of least surprise ... (be careful when you change it)
54 */
55
Li Zefan97d87c92008-04-28 02:13:35 -070056unsigned long badness(struct task_struct *p, unsigned long uptime)
Linus Torvalds1da177e2005-04-16 15:20:36 -070057{
Cyrill Gorcunova12888f2009-03-31 15:19:27 -070058 unsigned long points, cpu_time, run_time;
Andrew Morton97c2c9b2006-04-18 22:20:38 -070059 struct mm_struct *mm;
60 struct task_struct *child;
Linus Torvalds1da177e2005-04-16 15:20:36 -070061
Andrew Morton97c2c9b2006-04-18 22:20:38 -070062 task_lock(p);
63 mm = p->mm;
64 if (!mm) {
65 task_unlock(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -070066 return 0;
Andrew Morton97c2c9b2006-04-18 22:20:38 -070067 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070068
69 /*
70 * The memory size of the process is the basis for the badness.
71 */
Andrew Morton97c2c9b2006-04-18 22:20:38 -070072 points = mm->total_vm;
73
74 /*
75 * After this unlock we can no longer dereference local variable `mm'
76 */
77 task_unlock(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -070078
79 /*
Hugh Dickins7ba34852007-01-05 16:37:03 -080080 * swapoff can easily use up all memory, so kill those first.
81 */
82 if (p->flags & PF_SWAPOFF)
83 return ULONG_MAX;
84
85 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -070086 * Processes which fork a lot of child processes are likely
Kurt Garloff9827b782006-02-20 18:27:51 -080087 * a good choice. We add half the vmsize of the children if they
Linus Torvalds1da177e2005-04-16 15:20:36 -070088 * have an own mm. This prevents forking servers to flood the
Kurt Garloff9827b782006-02-20 18:27:51 -080089 * machine with an endless amount of children. In case a single
90 * child is eating the vast majority of memory, adding only half
91 * to the parents will make the child our kill candidate of choice.
Linus Torvalds1da177e2005-04-16 15:20:36 -070092 */
Andrew Morton97c2c9b2006-04-18 22:20:38 -070093 list_for_each_entry(child, &p->children, sibling) {
94 task_lock(child);
95 if (child->mm != mm && child->mm)
96 points += child->mm->total_vm/2 + 1;
97 task_unlock(child);
Linus Torvalds1da177e2005-04-16 15:20:36 -070098 }
99
100 /*
101 * CPU time is in tens of seconds and run time is in thousands
102 * of seconds. There is no particular reason for this other than
103 * that it turned out to work very well in practice.
104 */
105 cpu_time = (cputime_to_jiffies(p->utime) + cputime_to_jiffies(p->stime))
106 >> (SHIFT_HZ + 3);
107
108 if (uptime >= p->start_time.tv_sec)
109 run_time = (uptime - p->start_time.tv_sec) >> 10;
110 else
111 run_time = 0;
112
Cyrill Gorcunova12888f2009-03-31 15:19:27 -0700113 if (cpu_time)
114 points /= int_sqrt(cpu_time);
115 if (run_time)
116 points /= int_sqrt(int_sqrt(run_time));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700117
118 /*
119 * Niced processes are most likely less important, so double
120 * their badness points.
121 */
122 if (task_nice(p) > 0)
123 points *= 2;
124
125 /*
126 * Superuser processes are usually more important, so we make it
127 * less likely that we kill those.
128 */
Eric Parisa2f29452008-11-11 22:02:54 +1100129 if (has_capability_noaudit(p, CAP_SYS_ADMIN) ||
130 has_capability_noaudit(p, CAP_SYS_RESOURCE))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 points /= 4;
132
133 /*
134 * We don't want to kill a process with direct hardware access.
135 * Not only could that mess up the hardware, but usually users
136 * tend to only have this flag set on applications they think
137 * of as important.
138 */
Eric Parisa2f29452008-11-11 22:02:54 +1100139 if (has_capability_noaudit(p, CAP_SYS_RAWIO))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 points /= 4;
141
142 /*
Nick Piggin7887a3d2006-09-25 23:31:29 -0700143 * If p's nodes don't overlap ours, it may still help to kill p
144 * because p may have allocated or otherwise mapped memory on
145 * this node before. However it will be less likely.
146 */
David Rientjesbbe373f2007-10-16 23:25:58 -0700147 if (!cpuset_mems_allowed_intersects(current, p))
Nick Piggin7887a3d2006-09-25 23:31:29 -0700148 points /= 8;
149
150 /*
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700151 * Adjust the score by oomkilladj.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152 */
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700153 if (p->oomkilladj) {
154 if (p->oomkilladj > 0) {
Joshua N Pritikin9a827822007-05-06 14:49:07 -0700155 if (!points)
156 points = 1;
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700157 points <<= p->oomkilladj;
Joshua N Pritikin9a827822007-05-06 14:49:07 -0700158 } else
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700159 points >>= -(p->oomkilladj);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700160 }
161
162#ifdef DEBUG
David Rientjesa5e58a62007-07-31 00:37:32 -0700163 printk(KERN_DEBUG "OOMkill: task %d (%s) got %lu points\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164 p->pid, p->comm, points);
165#endif
166 return points;
167}
168
169/*
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800170 * Determine the type of allocation constraint.
171 */
David Rientjes70e24bd2007-10-16 23:25:53 -0700172static inline enum oom_constraint constrained_alloc(struct zonelist *zonelist,
173 gfp_t gfp_mask)
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800174{
175#ifdef CONFIG_NUMA
Mel Gorman54a6eb52008-04-28 02:12:16 -0700176 struct zone *zone;
Mel Gormandd1a2392008-04-28 02:12:17 -0700177 struct zoneref *z;
Mel Gorman54a6eb52008-04-28 02:12:16 -0700178 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
Christoph Lameteree31af52007-10-16 01:25:30 -0700179 nodemask_t nodes = node_states[N_HIGH_MEMORY];
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800180
Mel Gorman54a6eb52008-04-28 02:12:16 -0700181 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx)
182 if (cpuset_zone_allowed_softwall(zone, gfp_mask))
183 node_clear(zone_to_nid(zone), nodes);
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800184 else
185 return CONSTRAINT_CPUSET;
186
187 if (!nodes_empty(nodes))
188 return CONSTRAINT_MEMORY_POLICY;
189#endif
190
191 return CONSTRAINT_NONE;
192}
193
194/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 * Simple selection loop. We chose the process with the highest
196 * number of 'points'. We expect the caller will lock the tasklist.
197 *
198 * (not docbooked, we don't want this one cluttering up the manual)
199 */
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800200static struct task_struct *select_bad_process(unsigned long *ppoints,
201 struct mem_cgroup *mem)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203 struct task_struct *g, *p;
204 struct task_struct *chosen = NULL;
205 struct timespec uptime;
Kurt Garloff9827b782006-02-20 18:27:51 -0800206 *ppoints = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207
208 do_posix_clock_monotonic_gettime(&uptime);
Paul Jacksona49335c2005-09-06 15:18:09 -0700209 do_each_thread(g, p) {
210 unsigned long points;
Paul Jacksona49335c2005-09-06 15:18:09 -0700211
Oleg Nesterov28324d12006-09-29 02:01:12 -0700212 /*
213 * skip kernel threads and tasks which have already released
214 * their mm.
215 */
Nick Piggin5081dde2006-09-25 23:31:32 -0700216 if (!p->mm)
217 continue;
Oleg Nesterov28324d12006-09-29 02:01:12 -0700218 /* skip the init task */
Serge E. Hallynb460cbc2007-10-18 23:39:52 -0700219 if (is_global_init(p))
Paul Jacksona49335c2005-09-06 15:18:09 -0700220 continue;
David Rientjes4c4a2212008-02-07 00:14:06 -0800221 if (mem && !task_in_mem_cgroup(p, mem))
222 continue;
Paul Jacksonef08e3b2005-09-06 15:18:13 -0700223
Paul Jacksona49335c2005-09-06 15:18:09 -0700224 /*
Nick Pigginb78483a2006-09-29 02:01:14 -0700225 * This task already has access to memory reserves and is
226 * being killed. Don't allow any other task access to the
227 * memory reserve.
228 *
229 * Note: this may have a chance of deadlock if it gets
230 * blocked waiting for another task which itself is waiting
231 * for memory. Is there a better alternative?
232 */
233 if (test_tsk_thread_flag(p, TIF_MEMDIE))
234 return ERR_PTR(-1UL);
235
236 /*
Dave Peterson6937a252006-06-23 02:03:13 -0700237 * This is in the process of releasing memory so wait for it
Paul Jacksona49335c2005-09-06 15:18:09 -0700238 * to finish before killing some other task by mistake.
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700239 *
240 * However, if p is the current task, we allow the 'kill' to
241 * go ahead if it is exiting: this will simply set TIF_MEMDIE,
242 * which will allow it to gain access to memory reserves in
243 * the process of exiting and releasing its resources.
Nick Pigginb78483a2006-09-29 02:01:14 -0700244 * Otherwise we could get an easy OOM deadlock.
Paul Jacksona49335c2005-09-06 15:18:09 -0700245 */
Nick Pigginb78483a2006-09-29 02:01:14 -0700246 if (p->flags & PF_EXITING) {
247 if (p != current)
248 return ERR_PTR(-1UL);
249
Oleg Nesterov972c4ea2006-09-29 02:01:12 -0700250 chosen = p;
251 *ppoints = ULONG_MAX;
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700252 }
Oleg Nesterov972c4ea2006-09-29 02:01:12 -0700253
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700254 if (p->oomkilladj == OOM_DISABLE)
255 continue;
256
Li Zefan97d87c92008-04-28 02:13:35 -0700257 points = badness(p, uptime.tv_sec);
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700258 if (points > *ppoints || !chosen) {
Paul Jacksona49335c2005-09-06 15:18:09 -0700259 chosen = p;
Kurt Garloff9827b782006-02-20 18:27:51 -0800260 *ppoints = points;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261 }
Paul Jacksona49335c2005-09-06 15:18:09 -0700262 } while_each_thread(g, p);
Oleg Nesterov972c4ea2006-09-29 02:01:12 -0700263
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 return chosen;
265}
266
267/**
Randy Dunlap1b578df2008-03-19 17:00:42 -0700268 * dump_tasks - dump current memory state of all system tasks
269 * @mem: target memory controller
270 *
David Rientjesfef1bdd2008-02-07 00:14:07 -0800271 * Dumps the current memory state of all system tasks, excluding kernel threads.
272 * State information includes task's pid, uid, tgid, vm size, rss, cpu, oom_adj
273 * score, and name.
274 *
275 * If the actual is non-NULL, only tasks that are a member of the mem_cgroup are
276 * shown.
277 *
278 * Call with tasklist_lock read-locked.
279 */
280static void dump_tasks(const struct mem_cgroup *mem)
281{
282 struct task_struct *g, *p;
283
284 printk(KERN_INFO "[ pid ] uid tgid total_vm rss cpu oom_adj "
285 "name\n");
286 do_each_thread(g, p) {
David Rientjes6d2661e2009-05-28 14:34:19 -0700287 struct mm_struct *mm;
288
David Rientjesfef1bdd2008-02-07 00:14:07 -0800289 if (mem && !task_in_mem_cgroup(p, mem))
290 continue;
David Rientjesb4416d22008-11-06 12:53:29 -0800291 if (!thread_group_leader(p))
292 continue;
David Rientjesfef1bdd2008-02-07 00:14:07 -0800293
294 task_lock(p);
David Rientjes6d2661e2009-05-28 14:34:19 -0700295 mm = p->mm;
296 if (!mm) {
297 /*
298 * total_vm and rss sizes do not exist for tasks with no
299 * mm so there's no need to report them; they can't be
300 * oom killed anyway.
301 */
302 task_unlock(p);
303 continue;
304 }
David Rientjesfef1bdd2008-02-07 00:14:07 -0800305 printk(KERN_INFO "[%5d] %5d %5d %8lu %8lu %3d %3d %s\n",
David Rientjes6d2661e2009-05-28 14:34:19 -0700306 p->pid, __task_cred(p)->uid, p->tgid, mm->total_vm,
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700307 get_mm_rss(mm), (int)task_cpu(p), p->oomkilladj,
308 p->comm);
David Rientjesfef1bdd2008-02-07 00:14:07 -0800309 task_unlock(p);
310 } while_each_thread(g, p);
311}
312
Randy Dunlap1b578df2008-03-19 17:00:42 -0700313/*
Ram Gupta5a291b982006-09-25 23:31:54 -0700314 * Send SIGKILL to the selected process irrespective of CAP_SYS_RAW_IO
315 * flag though it's unlikely that we select a process with CAP_SYS_RAW_IO
316 * set.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700317 */
Nick Pigginf3af38d2006-12-06 20:31:51 -0800318static void __oom_kill_task(struct task_struct *p, int verbose)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319{
Serge E. Hallynb460cbc2007-10-18 23:39:52 -0700320 if (is_global_init(p)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700321 WARN_ON(1);
322 printk(KERN_WARNING "tried to kill init!\n");
323 return;
324 }
325
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700326 if (!p->mm) {
327 WARN_ON(1);
328 printk(KERN_WARNING "tried to kill an mm-less task!\n");
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329 return;
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700330 }
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700331
Nick Pigginf3af38d2006-12-06 20:31:51 -0800332 if (verbose)
Pavel Emelyanovba25f9d2007-10-18 23:40:40 -0700333 printk(KERN_ERR "Killed process %d (%s)\n",
334 task_pid_nr(p), p->comm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335
336 /*
337 * We give our sacrificial lamb high priority and access to
338 * all the memory it needs. That way it should be able to
339 * exit() and clear out its resources quickly...
340 */
Peter Zijlstrafa717062008-01-25 21:08:27 +0100341 p->rt.time_slice = HZ;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700342 set_tsk_thread_flag(p, TIF_MEMDIE);
343
344 force_sig(SIGKILL, p);
345}
346
Nick Pigginf3af38d2006-12-06 20:31:51 -0800347static int oom_kill_task(struct task_struct *p)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700348{
Dave Peterson01315922006-04-18 22:20:44 -0700349 struct mm_struct *mm;
Ingo Molnar36c8b582006-07-03 00:25:41 -0700350 struct task_struct *g, *q;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700351
Dave Peterson01315922006-04-18 22:20:44 -0700352 mm = p->mm;
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700353
354 /* WARNING: mm may not be dereferenced since we did not obtain its
355 * value from get_task_mm(p). This is OK since all we need to do is
356 * compare mm to q->mm below.
357 *
358 * Furthermore, even if mm contains a non-NULL value, p->mm may
359 * change to NULL at any time since we do not hold task_lock(p).
360 * However, this is of no concern to us.
361 */
362
363 if (mm == NULL)
Dave Peterson01315922006-04-18 22:20:44 -0700364 return 1;
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700365
366 /*
367 * Don't kill the process if any threads are set to OOM_DISABLE
368 */
369 do_each_thread(g, q) {
370 if (q->mm == mm && q->oomkilladj == OOM_DISABLE)
371 return 1;
372 } while_each_thread(g, q);
373
Nick Pigginf3af38d2006-12-06 20:31:51 -0800374 __oom_kill_task(p, 1);
Nick Pigginc33e0fc2006-12-06 20:31:50 -0800375
Linus Torvalds1da177e2005-04-16 15:20:36 -0700376 /*
377 * kill all processes that share the ->mm (i.e. all threads),
Nick Pigginf2a2a712006-12-06 20:31:52 -0800378 * but are in a different thread group. Don't let them have access
379 * to memory reserves though, otherwise we might deplete all memory.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700380 */
Nick Pigginc33e0fc2006-12-06 20:31:50 -0800381 do_each_thread(g, q) {
Pavel Emelyanovbac0abd2007-10-18 23:40:18 -0700382 if (q->mm == mm && !same_thread_group(q, p))
David Rientjes650a7c92007-04-23 21:36:13 -0700383 force_sig(SIGKILL, q);
Nick Pigginc33e0fc2006-12-06 20:31:50 -0800384 } while_each_thread(g, q);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700385
Dave Peterson01315922006-04-18 22:20:44 -0700386 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387}
388
David Rientjes7213f502007-10-16 23:25:57 -0700389static int oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order,
David Rientjesfef1bdd2008-02-07 00:14:07 -0800390 unsigned long points, struct mem_cgroup *mem,
391 const char *message)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393 struct task_struct *c;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394
David Rientjes7213f502007-10-16 23:25:57 -0700395 if (printk_ratelimit()) {
David Rientjes2ff05b22009-06-16 15:32:56 -0700396 printk(KERN_WARNING "%s invoked oom-killer: "
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700397 "gfp_mask=0x%x, order=%d, oomkilladj=%d\n",
398 current->comm, gfp_mask, order, current->oomkilladj);
399 task_lock(current);
David Rientjes75aa1992009-01-06 14:39:01 -0800400 cpuset_print_task_mems_allowed(current);
401 task_unlock(current);
David Rientjes7213f502007-10-16 23:25:57 -0700402 dump_stack();
Balbir Singhe2224322009-04-02 16:57:39 -0700403 mem_cgroup_print_oom_info(mem, current);
David Rientjes7213f502007-10-16 23:25:57 -0700404 show_mem();
David Rientjesfef1bdd2008-02-07 00:14:07 -0800405 if (sysctl_oom_dump_tasks)
406 dump_tasks(mem);
David Rientjes7213f502007-10-16 23:25:57 -0700407 }
408
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700409 /*
410 * If the task is already exiting, don't alarm the sysadmin or kill
411 * its children or threads, just set TIF_MEMDIE so it can die quickly
412 */
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700413 if (p->flags & PF_EXITING) {
Nick Pigginf3af38d2006-12-06 20:31:51 -0800414 __oom_kill_task(p, 0);
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700415 return 0;
416 }
417
Nick Pigginf3af38d2006-12-06 20:31:51 -0800418 printk(KERN_ERR "%s: kill process %d (%s) score %li or a child\n",
Pavel Emelyanovba25f9d2007-10-18 23:40:40 -0700419 message, task_pid_nr(p), p->comm, points);
Nick Pigginf3af38d2006-12-06 20:31:51 -0800420
Linus Torvalds1da177e2005-04-16 15:20:36 -0700421 /* Try to kill a child first */
Matthias Kaehlcke7b1915a2007-10-18 23:39:58 -0700422 list_for_each_entry(c, &p->children, sibling) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423 if (c->mm == p->mm)
424 continue;
Nick Pigginf3af38d2006-12-06 20:31:51 -0800425 if (!oom_kill_task(c))
Dave Peterson01315922006-04-18 22:20:44 -0700426 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700427 }
Nick Pigginf3af38d2006-12-06 20:31:51 -0800428 return oom_kill_task(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429}
430
Balbir Singh00f0b822008-03-04 14:28:39 -0800431#ifdef CONFIG_CGROUP_MEM_RES_CTLR
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800432void mem_cgroup_out_of_memory(struct mem_cgroup *mem, gfp_t gfp_mask)
433{
434 unsigned long points = 0;
435 struct task_struct *p;
436
Li Zefane115f2d2008-04-15 14:34:37 -0700437 read_lock(&tasklist_lock);
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800438retry:
439 p = select_bad_process(&points, mem);
440 if (PTR_ERR(p) == -1UL)
441 goto out;
442
443 if (!p)
444 p = current;
445
David Rientjesfef1bdd2008-02-07 00:14:07 -0800446 if (oom_kill_process(p, gfp_mask, 0, points, mem,
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800447 "Memory cgroup out of memory"))
448 goto retry;
449out:
Li Zefane115f2d2008-04-15 14:34:37 -0700450 read_unlock(&tasklist_lock);
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800451}
452#endif
453
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -0700454static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
455
456int register_oom_notifier(struct notifier_block *nb)
457{
458 return blocking_notifier_chain_register(&oom_notify_list, nb);
459}
460EXPORT_SYMBOL_GPL(register_oom_notifier);
461
462int unregister_oom_notifier(struct notifier_block *nb)
463{
464 return blocking_notifier_chain_unregister(&oom_notify_list, nb);
465}
466EXPORT_SYMBOL_GPL(unregister_oom_notifier);
467
David Rientjes098d7f12007-10-16 23:25:55 -0700468/*
469 * Try to acquire the OOM killer lock for the zones in zonelist. Returns zero
470 * if a parallel OOM killing is already taking place that includes a zone in
471 * the zonelist. Otherwise, locks all zones in the zonelist and returns 1.
472 */
Mel Gormandd1a2392008-04-28 02:12:17 -0700473int try_set_zone_oom(struct zonelist *zonelist, gfp_t gfp_mask)
David Rientjes098d7f12007-10-16 23:25:55 -0700474{
Mel Gormandd1a2392008-04-28 02:12:17 -0700475 struct zoneref *z;
476 struct zone *zone;
David Rientjes098d7f12007-10-16 23:25:55 -0700477 int ret = 1;
478
David Rientjesc7d4cae2009-01-06 14:39:00 -0800479 spin_lock(&zone_scan_lock);
Mel Gormandd1a2392008-04-28 02:12:17 -0700480 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
481 if (zone_is_oom_locked(zone)) {
David Rientjes098d7f12007-10-16 23:25:55 -0700482 ret = 0;
483 goto out;
484 }
Mel Gormandd1a2392008-04-28 02:12:17 -0700485 }
David Rientjes098d7f12007-10-16 23:25:55 -0700486
Mel Gormandd1a2392008-04-28 02:12:17 -0700487 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
488 /*
David Rientjesc7d4cae2009-01-06 14:39:00 -0800489 * Lock each zone in the zonelist under zone_scan_lock so a
Mel Gormandd1a2392008-04-28 02:12:17 -0700490 * parallel invocation of try_set_zone_oom() doesn't succeed
491 * when it shouldn't.
492 */
493 zone_set_flag(zone, ZONE_OOM_LOCKED);
494 }
495
David Rientjes098d7f12007-10-16 23:25:55 -0700496out:
David Rientjesc7d4cae2009-01-06 14:39:00 -0800497 spin_unlock(&zone_scan_lock);
David Rientjes098d7f12007-10-16 23:25:55 -0700498 return ret;
499}
500
501/*
502 * Clears the ZONE_OOM_LOCKED flag for all zones in the zonelist so that failed
503 * allocation attempts with zonelists containing them may now recall the OOM
504 * killer, if necessary.
505 */
Mel Gormandd1a2392008-04-28 02:12:17 -0700506void clear_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
David Rientjes098d7f12007-10-16 23:25:55 -0700507{
Mel Gormandd1a2392008-04-28 02:12:17 -0700508 struct zoneref *z;
509 struct zone *zone;
David Rientjes098d7f12007-10-16 23:25:55 -0700510
David Rientjesc7d4cae2009-01-06 14:39:00 -0800511 spin_lock(&zone_scan_lock);
Mel Gormandd1a2392008-04-28 02:12:17 -0700512 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
513 zone_clear_flag(zone, ZONE_OOM_LOCKED);
514 }
David Rientjesc7d4cae2009-01-06 14:39:00 -0800515 spin_unlock(&zone_scan_lock);
David Rientjes098d7f12007-10-16 23:25:55 -0700516}
517
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800518/*
519 * Must be called with tasklist_lock held for read.
520 */
521static void __out_of_memory(gfp_t gfp_mask, int order)
522{
David Rientjes184101b2009-05-06 16:02:55 -0700523 struct task_struct *p;
524 unsigned long points;
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800525
David Rientjes184101b2009-05-06 16:02:55 -0700526 if (sysctl_oom_kill_allocating_task)
527 if (!oom_kill_process(current, gfp_mask, order, 0, NULL,
528 "Out of memory (oom_kill_allocating_task)"))
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800529 return;
David Rientjes184101b2009-05-06 16:02:55 -0700530retry:
531 /*
532 * Rambo mode: Shoot down a process and hope it solves whatever
533 * issues we may have.
534 */
535 p = select_bad_process(&points, NULL);
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800536
David Rientjes184101b2009-05-06 16:02:55 -0700537 if (PTR_ERR(p) == -1UL)
538 return;
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800539
David Rientjes184101b2009-05-06 16:02:55 -0700540 /* Found nothing?!?! Either we hang forever, or we panic. */
541 if (!p) {
542 read_unlock(&tasklist_lock);
543 panic("Out of memory and no killable processes...\n");
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800544 }
David Rientjes184101b2009-05-06 16:02:55 -0700545
546 if (oom_kill_process(p, gfp_mask, order, points, NULL,
547 "Out of memory"))
548 goto retry;
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800549}
550
551/*
552 * pagefault handler calls into here because it is out of memory but
553 * doesn't know exactly how or why.
554 */
555void pagefault_out_of_memory(void)
556{
557 unsigned long freed = 0;
558
559 blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
560 if (freed > 0)
561 /* Got some memory back in the last second. */
562 return;
563
KAMEZAWA Hiroyukia636b322009-01-07 18:08:08 -0800564 /*
565 * If this is from memcg, oom-killer is already invoked.
566 * and not worth to go system-wide-oom.
567 */
568 if (mem_cgroup_oom_called(current))
569 goto rest_and_return;
570
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800571 if (sysctl_panic_on_oom)
572 panic("out of memory from page fault. panic_on_oom is selected.\n");
573
574 read_lock(&tasklist_lock);
575 __out_of_memory(0, 0); /* unknown gfp_mask and order */
576 read_unlock(&tasklist_lock);
577
578 /*
579 * Give "p" a good chance of killing itself before we
580 * retry to allocate memory.
581 */
KAMEZAWA Hiroyukia636b322009-01-07 18:08:08 -0800582rest_and_return:
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800583 if (!test_thread_flag(TIF_MEMDIE))
584 schedule_timeout_uninterruptible(1);
585}
586
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587/**
Dave Peterson6937a252006-06-23 02:03:13 -0700588 * out_of_memory - kill the "best" process when we run out of memory
Randy Dunlap1b578df2008-03-19 17:00:42 -0700589 * @zonelist: zonelist pointer
590 * @gfp_mask: memory allocation flags
591 * @order: amount of memory being requested as a power of 2
Linus Torvalds1da177e2005-04-16 15:20:36 -0700592 *
593 * If we run out of memory, we have the choice between either
594 * killing a random task (bad), letting the system crash (worse)
595 * OR try to be smart about which process to kill. Note that we
596 * don't have to be perfect here, we just have to be good.
597 */
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800598void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask, int order)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599{
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -0700600 unsigned long freed = 0;
David Rientjes70e24bd2007-10-16 23:25:53 -0700601 enum oom_constraint constraint;
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -0700602
603 blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
604 if (freed > 0)
605 /* Got some memory back in the last second. */
606 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607
Yasunori Goto2b744c02007-05-06 14:49:59 -0700608 if (sysctl_panic_on_oom == 2)
609 panic("out of memory. Compulsory panic_on_oom is selected.\n");
610
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800611 /*
612 * Check if there were limitations on the allocation (only relevant for
613 * NUMA) that may require different handling.
614 */
David Rientjes2b45ab32007-05-06 14:50:00 -0700615 constraint = constrained_alloc(zonelist, gfp_mask);
David Rientjes2b45ab32007-05-06 14:50:00 -0700616 read_lock(&tasklist_lock);
617
618 switch (constraint) {
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800619 case CONSTRAINT_MEMORY_POLICY:
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800620 oom_kill_process(current, gfp_mask, order, 0, NULL,
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800621 "No available memory (MPOL_BIND)");
622 break;
623
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800624 case CONSTRAINT_NONE:
KAMEZAWA Hiroyukifadd8fb2006-06-23 02:03:13 -0700625 if (sysctl_panic_on_oom)
626 panic("out of memory. panic_on_oom is selected\n");
David Rientjesfe071d72007-10-16 23:25:56 -0700627 /* Fall-through */
628 case CONSTRAINT_CPUSET:
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800629 __out_of_memory(gfp_mask, order);
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800630 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700631 }
632
Andrew Morton140ffce2006-03-02 02:54:28 -0800633 read_unlock(&tasklist_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634
635 /*
636 * Give "p" a good chance of killing itself before we
Kirill Korotaev2f659f42006-01-08 01:01:05 -0800637 * retry to allocate memory unless "p" is current
Linus Torvalds1da177e2005-04-16 15:20:36 -0700638 */
Kirill Korotaev2f659f42006-01-08 01:01:05 -0800639 if (!test_thread_flag(TIF_MEMDIE))
Andrew Morton140ffce2006-03-02 02:54:28 -0800640 schedule_timeout_uninterruptible(1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700641}