blob: 9b223af6a147f6fc82b22c58d1d878f09fb80053 [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
KOSAKI Motohiro495789a2009-09-21 17:03:14 -070037/*
38 * Is all threads of the target process nodes overlap ours?
39 */
40static int has_intersects_mems_allowed(struct task_struct *tsk)
41{
42 struct task_struct *t;
43
44 t = tsk;
45 do {
46 if (cpuset_mems_allowed_intersects(current, t))
47 return 1;
48 t = next_thread(t);
49 } while (t != tsk);
50
51 return 0;
52}
53
Linus Torvalds1da177e2005-04-16 15:20:36 -070054/**
Dave Peterson6937a252006-06-23 02:03:13 -070055 * badness - calculate a numeric value for how bad this task has been
Linus Torvalds1da177e2005-04-16 15:20:36 -070056 * @p: task struct of which task we should calculate
Paul Jacksona49335c2005-09-06 15:18:09 -070057 * @uptime: current uptime in seconds
Linus Torvalds1da177e2005-04-16 15:20:36 -070058 *
59 * The formula used is relatively simple and documented inline in the
60 * function. The main rationale is that we want to select a good task
61 * to kill when we run out of memory.
62 *
63 * Good in this context means that:
64 * 1) we lose the minimum amount of work done
65 * 2) we recover a large amount of memory
66 * 3) we don't kill anything innocent of eating tons of memory
67 * 4) we want to kill the minimum amount of processes (one)
68 * 5) we try to kill the process the user expects us to kill, this
69 * algorithm has been meticulously tuned to meet the principle
70 * of least surprise ... (be careful when you change it)
71 */
72
Li Zefan97d87c92008-04-28 02:13:35 -070073unsigned long badness(struct task_struct *p, unsigned long uptime)
Linus Torvalds1da177e2005-04-16 15:20:36 -070074{
Cyrill Gorcunova12888f2009-03-31 15:19:27 -070075 unsigned long points, cpu_time, run_time;
Andrew Morton97c2c9b82006-04-18 22:20:38 -070076 struct mm_struct *mm;
77 struct task_struct *child;
KOSAKI Motohiro28b83c52009-09-21 17:03:13 -070078 int oom_adj = p->signal->oom_adj;
KOSAKI Motohiro495789a2009-09-21 17:03:14 -070079 struct task_cputime task_time;
80 unsigned long utime;
81 unsigned long stime;
KOSAKI Motohiro28b83c52009-09-21 17:03:13 -070082
83 if (oom_adj == OOM_DISABLE)
84 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -070085
Andrew Morton97c2c9b82006-04-18 22:20:38 -070086 task_lock(p);
87 mm = p->mm;
88 if (!mm) {
89 task_unlock(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -070090 return 0;
Andrew Morton97c2c9b82006-04-18 22:20:38 -070091 }
Linus Torvalds1da177e2005-04-16 15:20:36 -070092
93 /*
94 * The memory size of the process is the basis for the badness.
95 */
Andrew Morton97c2c9b82006-04-18 22:20:38 -070096 points = mm->total_vm;
97
98 /*
99 * After this unlock we can no longer dereference local variable `mm'
100 */
101 task_unlock(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700102
103 /*
Hugh Dickins7ba34852007-01-05 16:37:03 -0800104 * swapoff can easily use up all memory, so kill those first.
105 */
Hugh Dickins35451be2009-09-21 17:02:27 -0700106 if (p->flags & PF_OOM_ORIGIN)
Hugh Dickins7ba34852007-01-05 16:37:03 -0800107 return ULONG_MAX;
108
109 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700110 * Processes which fork a lot of child processes are likely
Kurt Garloff9827b782006-02-20 18:27:51 -0800111 * a good choice. We add half the vmsize of the children if they
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112 * have an own mm. This prevents forking servers to flood the
Kurt Garloff9827b782006-02-20 18:27:51 -0800113 * machine with an endless amount of children. In case a single
114 * child is eating the vast majority of memory, adding only half
115 * to the parents will make the child our kill candidate of choice.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116 */
Andrew Morton97c2c9b82006-04-18 22:20:38 -0700117 list_for_each_entry(child, &p->children, sibling) {
118 task_lock(child);
119 if (child->mm != mm && child->mm)
120 points += child->mm->total_vm/2 + 1;
121 task_unlock(child);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 }
123
124 /*
125 * CPU time is in tens of seconds and run time is in thousands
126 * of seconds. There is no particular reason for this other than
127 * that it turned out to work very well in practice.
128 */
KOSAKI Motohiro495789a2009-09-21 17:03:14 -0700129 thread_group_cputime(p, &task_time);
130 utime = cputime_to_jiffies(task_time.utime);
131 stime = cputime_to_jiffies(task_time.stime);
132 cpu_time = (utime + stime) >> (SHIFT_HZ + 3);
133
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134
135 if (uptime >= p->start_time.tv_sec)
136 run_time = (uptime - p->start_time.tv_sec) >> 10;
137 else
138 run_time = 0;
139
Cyrill Gorcunova12888f2009-03-31 15:19:27 -0700140 if (cpu_time)
141 points /= int_sqrt(cpu_time);
142 if (run_time)
143 points /= int_sqrt(int_sqrt(run_time));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700144
145 /*
146 * Niced processes are most likely less important, so double
147 * their badness points.
148 */
149 if (task_nice(p) > 0)
150 points *= 2;
151
152 /*
153 * Superuser processes are usually more important, so we make it
154 * less likely that we kill those.
155 */
Eric Parisa2f29452008-11-11 22:02:54 +1100156 if (has_capability_noaudit(p, CAP_SYS_ADMIN) ||
157 has_capability_noaudit(p, CAP_SYS_RESOURCE))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158 points /= 4;
159
160 /*
161 * We don't want to kill a process with direct hardware access.
162 * Not only could that mess up the hardware, but usually users
163 * tend to only have this flag set on applications they think
164 * of as important.
165 */
Eric Parisa2f29452008-11-11 22:02:54 +1100166 if (has_capability_noaudit(p, CAP_SYS_RAWIO))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700167 points /= 4;
168
169 /*
Nick Piggin7887a3d2006-09-25 23:31:29 -0700170 * If p's nodes don't overlap ours, it may still help to kill p
171 * because p may have allocated or otherwise mapped memory on
172 * this node before. However it will be less likely.
173 */
KOSAKI Motohiro495789a2009-09-21 17:03:14 -0700174 if (!has_intersects_mems_allowed(p))
Nick Piggin7887a3d2006-09-25 23:31:29 -0700175 points /= 8;
176
177 /*
KOSAKI Motohiro28b83c52009-09-21 17:03:13 -0700178 * Adjust the score by oom_adj.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179 */
KOSAKI Motohiro28b83c52009-09-21 17:03:13 -0700180 if (oom_adj) {
181 if (oom_adj > 0) {
Joshua N Pritikin9a827822007-05-06 14:49:07 -0700182 if (!points)
183 points = 1;
KOSAKI Motohiro28b83c52009-09-21 17:03:13 -0700184 points <<= oom_adj;
Joshua N Pritikin9a827822007-05-06 14:49:07 -0700185 } else
KOSAKI Motohiro28b83c52009-09-21 17:03:13 -0700186 points >>= -(oom_adj);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187 }
188
189#ifdef DEBUG
David Rientjesa5e58a62007-07-31 00:37:32 -0700190 printk(KERN_DEBUG "OOMkill: task %d (%s) got %lu points\n",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191 p->pid, p->comm, points);
192#endif
193 return points;
194}
195
196/*
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800197 * Determine the type of allocation constraint.
198 */
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800199#ifdef CONFIG_NUMA
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800200static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
201 gfp_t gfp_mask, nodemask_t *nodemask)
202{
Mel Gorman54a6eb52008-04-28 02:12:16 -0700203 struct zone *zone;
Mel Gormandd1a2392008-04-28 02:12:17 -0700204 struct zoneref *z;
Mel Gorman54a6eb52008-04-28 02:12:16 -0700205 enum zone_type high_zoneidx = gfp_zone(gfp_mask);
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800206
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800207 /*
208 * Reach here only when __GFP_NOFAIL is used. So, we should avoid
209 * to kill current.We have to random task kill in this case.
210 * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
211 */
212 if (gfp_mask & __GFP_THISNODE)
213 return CONSTRAINT_NONE;
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800214
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800215 /*
216 * The nodemask here is a nodemask passed to alloc_pages(). Now,
217 * cpuset doesn't use this nodemask for its hardwall/softwall/hierarchy
218 * feature. mempolicy is an only user of nodemask here.
219 * check mempolicy's nodemask contains all N_HIGH_MEMORY
220 */
221 if (nodemask && !nodes_subset(node_states[N_HIGH_MEMORY], *nodemask))
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800222 return CONSTRAINT_MEMORY_POLICY;
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800223
224 /* Check this allocation failure is caused by cpuset's wall function */
225 for_each_zone_zonelist_nodemask(zone, z, zonelist,
226 high_zoneidx, nodemask)
227 if (!cpuset_zone_allowed_softwall(zone, gfp_mask))
228 return CONSTRAINT_CPUSET;
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800229
230 return CONSTRAINT_NONE;
231}
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800232#else
233static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
234 gfp_t gfp_mask, nodemask_t *nodemask)
235{
236 return CONSTRAINT_NONE;
237}
238#endif
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800239
240/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241 * Simple selection loop. We chose the process with the highest
242 * number of 'points'. We expect the caller will lock the tasklist.
243 *
244 * (not docbooked, we don't want this one cluttering up the manual)
245 */
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800246static struct task_struct *select_bad_process(unsigned long *ppoints,
247 struct mem_cgroup *mem)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700248{
KOSAKI Motohiro495789a2009-09-21 17:03:14 -0700249 struct task_struct *p;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250 struct task_struct *chosen = NULL;
251 struct timespec uptime;
Kurt Garloff9827b782006-02-20 18:27:51 -0800252 *ppoints = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253
254 do_posix_clock_monotonic_gettime(&uptime);
KOSAKI Motohiro495789a2009-09-21 17:03:14 -0700255 for_each_process(p) {
Paul Jacksona49335c2005-09-06 15:18:09 -0700256 unsigned long points;
Paul Jacksona49335c2005-09-06 15:18:09 -0700257
Oleg Nesterov28324d12006-09-29 02:01:12 -0700258 /*
259 * skip kernel threads and tasks which have already released
260 * their mm.
261 */
Nick Piggin5081dde2006-09-25 23:31:32 -0700262 if (!p->mm)
263 continue;
Oleg Nesterov28324d12006-09-29 02:01:12 -0700264 /* skip the init task */
Serge E. Hallynb460cbc2007-10-18 23:39:52 -0700265 if (is_global_init(p))
Paul Jacksona49335c2005-09-06 15:18:09 -0700266 continue;
David Rientjes4c4a2212008-02-07 00:14:06 -0800267 if (mem && !task_in_mem_cgroup(p, mem))
268 continue;
Paul Jacksonef08e3b2005-09-06 15:18:13 -0700269
Paul Jacksona49335c2005-09-06 15:18:09 -0700270 /*
Nick Pigginb78483a2006-09-29 02:01:14 -0700271 * This task already has access to memory reserves and is
272 * being killed. Don't allow any other task access to the
273 * memory reserve.
274 *
275 * Note: this may have a chance of deadlock if it gets
276 * blocked waiting for another task which itself is waiting
277 * for memory. Is there a better alternative?
278 */
279 if (test_tsk_thread_flag(p, TIF_MEMDIE))
280 return ERR_PTR(-1UL);
281
282 /*
Dave Peterson6937a252006-06-23 02:03:13 -0700283 * This is in the process of releasing memory so wait for it
Paul Jacksona49335c2005-09-06 15:18:09 -0700284 * to finish before killing some other task by mistake.
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700285 *
286 * However, if p is the current task, we allow the 'kill' to
287 * go ahead if it is exiting: this will simply set TIF_MEMDIE,
288 * which will allow it to gain access to memory reserves in
289 * the process of exiting and releasing its resources.
Nick Pigginb78483a2006-09-29 02:01:14 -0700290 * Otherwise we could get an easy OOM deadlock.
Paul Jacksona49335c2005-09-06 15:18:09 -0700291 */
Nick Pigginb78483a2006-09-29 02:01:14 -0700292 if (p->flags & PF_EXITING) {
293 if (p != current)
294 return ERR_PTR(-1UL);
295
Oleg Nesterov972c4ea2006-09-29 02:01:12 -0700296 chosen = p;
297 *ppoints = ULONG_MAX;
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700298 }
Oleg Nesterov972c4ea2006-09-29 02:01:12 -0700299
KOSAKI Motohiro28b83c52009-09-21 17:03:13 -0700300 if (p->signal->oom_adj == OOM_DISABLE)
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700301 continue;
302
Li Zefan97d87c92008-04-28 02:13:35 -0700303 points = badness(p, uptime.tv_sec);
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700304 if (points > *ppoints || !chosen) {
Paul Jacksona49335c2005-09-06 15:18:09 -0700305 chosen = p;
Kurt Garloff9827b782006-02-20 18:27:51 -0800306 *ppoints = points;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700307 }
KOSAKI Motohiro495789a2009-09-21 17:03:14 -0700308 }
Oleg Nesterov972c4ea2006-09-29 02:01:12 -0700309
Linus Torvalds1da177e2005-04-16 15:20:36 -0700310 return chosen;
311}
312
313/**
Randy Dunlap1b578df2008-03-19 17:00:42 -0700314 * dump_tasks - dump current memory state of all system tasks
315 * @mem: target memory controller
316 *
David Rientjesfef1bdd2008-02-07 00:14:07 -0800317 * Dumps the current memory state of all system tasks, excluding kernel threads.
318 * State information includes task's pid, uid, tgid, vm size, rss, cpu, oom_adj
319 * score, and name.
320 *
321 * If the actual is non-NULL, only tasks that are a member of the mem_cgroup are
322 * shown.
323 *
324 * Call with tasklist_lock read-locked.
325 */
326static void dump_tasks(const struct mem_cgroup *mem)
327{
328 struct task_struct *g, *p;
329
330 printk(KERN_INFO "[ pid ] uid tgid total_vm rss cpu oom_adj "
331 "name\n");
332 do_each_thread(g, p) {
David Rientjes6d2661e2009-05-28 14:34:19 -0700333 struct mm_struct *mm;
334
David Rientjesfef1bdd2008-02-07 00:14:07 -0800335 if (mem && !task_in_mem_cgroup(p, mem))
336 continue;
David Rientjesb4416d22008-11-06 12:53:29 -0800337 if (!thread_group_leader(p))
338 continue;
David Rientjesfef1bdd2008-02-07 00:14:07 -0800339
340 task_lock(p);
David Rientjes6d2661e2009-05-28 14:34:19 -0700341 mm = p->mm;
342 if (!mm) {
343 /*
344 * total_vm and rss sizes do not exist for tasks with no
345 * mm so there's no need to report them; they can't be
346 * oom killed anyway.
347 */
348 task_unlock(p);
349 continue;
350 }
David Rientjesfef1bdd2008-02-07 00:14:07 -0800351 printk(KERN_INFO "[%5d] %5d %5d %8lu %8lu %3d %3d %s\n",
David Rientjes6d2661e2009-05-28 14:34:19 -0700352 p->pid, __task_cred(p)->uid, p->tgid, mm->total_vm,
KOSAKI Motohiro28b83c52009-09-21 17:03:13 -0700353 get_mm_rss(mm), (int)task_cpu(p), p->signal->oom_adj,
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700354 p->comm);
David Rientjesfef1bdd2008-02-07 00:14:07 -0800355 task_unlock(p);
356 } while_each_thread(g, p);
357}
358
Daisuke Nishimurad31f56d2009-12-15 16:47:12 -0800359static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order,
360 struct mem_cgroup *mem)
David Rientjes1b604d72009-12-14 17:57:47 -0800361{
362 pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
363 "oom_adj=%d\n",
364 current->comm, gfp_mask, order, current->signal->oom_adj);
365 task_lock(current);
366 cpuset_print_task_mems_allowed(current);
367 task_unlock(current);
368 dump_stack();
Daisuke Nishimurad31f56d2009-12-15 16:47:12 -0800369 mem_cgroup_print_oom_info(mem, p);
David Rientjes1b604d72009-12-14 17:57:47 -0800370 show_mem();
371 if (sysctl_oom_dump_tasks)
372 dump_tasks(mem);
373}
374
KOSAKI Motohiro3b4798c2009-12-15 16:45:32 -0800375#define K(x) ((x) << (PAGE_SHIFT-10))
376
Randy Dunlap1b578df2008-03-19 17:00:42 -0700377/*
Ram Gupta5a291b982006-09-25 23:31:54 -0700378 * Send SIGKILL to the selected process irrespective of CAP_SYS_RAW_IO
379 * flag though it's unlikely that we select a process with CAP_SYS_RAW_IO
380 * set.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381 */
Nick Pigginf3af38d2006-12-06 20:31:51 -0800382static void __oom_kill_task(struct task_struct *p, int verbose)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383{
Serge E. Hallynb460cbc2007-10-18 23:39:52 -0700384 if (is_global_init(p)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700385 WARN_ON(1);
386 printk(KERN_WARNING "tried to kill init!\n");
387 return;
388 }
389
KOSAKI Motohiro3b4798c2009-12-15 16:45:32 -0800390 task_lock(p);
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700391 if (!p->mm) {
392 WARN_ON(1);
KOSAKI Motohiro3b4798c2009-12-15 16:45:32 -0800393 printk(KERN_WARNING "tried to kill an mm-less task %d (%s)!\n",
394 task_pid_nr(p), p->comm);
395 task_unlock(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396 return;
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700397 }
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700398
Nick Pigginf3af38d2006-12-06 20:31:51 -0800399 if (verbose)
KOSAKI Motohiro3b4798c2009-12-15 16:45:32 -0800400 printk(KERN_ERR "Killed process %d (%s) "
401 "vsz:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
402 task_pid_nr(p), p->comm,
403 K(p->mm->total_vm),
KAMEZAWA Hiroyukid559db02010-03-05 13:41:39 -0800404 K(get_mm_counter(p->mm, MM_ANONPAGES)),
405 K(get_mm_counter(p->mm, MM_FILEPAGES)));
KOSAKI Motohiro3b4798c2009-12-15 16:45:32 -0800406 task_unlock(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407
408 /*
409 * We give our sacrificial lamb high priority and access to
410 * all the memory it needs. That way it should be able to
411 * exit() and clear out its resources quickly...
412 */
Peter Zijlstrafa717062008-01-25 21:08:27 +0100413 p->rt.time_slice = HZ;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414 set_tsk_thread_flag(p, TIF_MEMDIE);
415
416 force_sig(SIGKILL, p);
417}
418
Nick Pigginf3af38d2006-12-06 20:31:51 -0800419static int oom_kill_task(struct task_struct *p)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700420{
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700421 /* WARNING: mm may not be dereferenced since we did not obtain its
422 * value from get_task_mm(p). This is OK since all we need to do is
423 * compare mm to q->mm below.
424 *
425 * Furthermore, even if mm contains a non-NULL value, p->mm may
426 * change to NULL at any time since we do not hold task_lock(p).
427 * However, this is of no concern to us.
428 */
KOSAKI Motohiro8c5cd6f2009-09-21 17:03:15 -0700429 if (!p->mm || p->signal->oom_adj == OOM_DISABLE)
Dave Peterson01315922006-04-18 22:20:44 -0700430 return 1;
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700431
Nick Pigginf3af38d2006-12-06 20:31:51 -0800432 __oom_kill_task(p, 1);
Nick Pigginc33e0fc2006-12-06 20:31:50 -0800433
Dave Peterson01315922006-04-18 22:20:44 -0700434 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435}
436
David Rientjes7213f502007-10-16 23:25:57 -0700437static int oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order,
David Rientjesfef1bdd2008-02-07 00:14:07 -0800438 unsigned long points, struct mem_cgroup *mem,
439 const char *message)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700440{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441 struct task_struct *c;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442
David Rientjes1b604d72009-12-14 17:57:47 -0800443 if (printk_ratelimit())
Daisuke Nishimurad31f56d2009-12-15 16:47:12 -0800444 dump_header(p, gfp_mask, order, mem);
David Rientjes7213f502007-10-16 23:25:57 -0700445
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700446 /*
447 * If the task is already exiting, don't alarm the sysadmin or kill
448 * its children or threads, just set TIF_MEMDIE so it can die quickly
449 */
KOSAKI Motohiro0753ba02009-08-18 14:11:10 -0700450 if (p->flags & PF_EXITING) {
Nick Pigginf3af38d2006-12-06 20:31:51 -0800451 __oom_kill_task(p, 0);
Nick Piggin50ec3bb2006-09-25 23:31:29 -0700452 return 0;
453 }
454
Nick Pigginf3af38d2006-12-06 20:31:51 -0800455 printk(KERN_ERR "%s: kill process %d (%s) score %li or a child\n",
Pavel Emelyanovba25f9d2007-10-18 23:40:40 -0700456 message, task_pid_nr(p), p->comm, points);
Nick Pigginf3af38d2006-12-06 20:31:51 -0800457
Linus Torvalds1da177e2005-04-16 15:20:36 -0700458 /* Try to kill a child first */
Matthias Kaehlcke7b1915a2007-10-18 23:39:58 -0700459 list_for_each_entry(c, &p->children, sibling) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460 if (c->mm == p->mm)
461 continue;
KAMEZAWA Hiroyuki5a2d4192010-02-22 12:44:14 -0800462 if (mem && !task_in_mem_cgroup(c, mem))
463 continue;
Nick Pigginf3af38d2006-12-06 20:31:51 -0800464 if (!oom_kill_task(c))
Dave Peterson01315922006-04-18 22:20:44 -0700465 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700466 }
Nick Pigginf3af38d2006-12-06 20:31:51 -0800467 return oom_kill_task(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700468}
469
Balbir Singh00f0b822008-03-04 14:28:39 -0800470#ifdef CONFIG_CGROUP_MEM_RES_CTLR
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800471void mem_cgroup_out_of_memory(struct mem_cgroup *mem, gfp_t gfp_mask)
472{
473 unsigned long points = 0;
474 struct task_struct *p;
475
KAMEZAWA Hiroyukidaaf1e62010-03-10 15:22:32 -0800476 if (sysctl_panic_on_oom == 2)
477 panic("out of memory(memcg). panic_on_oom is selected.\n");
Li Zefane115f2d2008-04-15 14:34:37 -0700478 read_lock(&tasklist_lock);
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800479retry:
480 p = select_bad_process(&points, mem);
481 if (PTR_ERR(p) == -1UL)
482 goto out;
483
484 if (!p)
485 p = current;
486
David Rientjesfef1bdd2008-02-07 00:14:07 -0800487 if (oom_kill_process(p, gfp_mask, 0, points, mem,
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800488 "Memory cgroup out of memory"))
489 goto retry;
490out:
Li Zefane115f2d2008-04-15 14:34:37 -0700491 read_unlock(&tasklist_lock);
Pavel Emelianovc7ba5c92008-02-07 00:13:58 -0800492}
493#endif
494
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -0700495static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
496
497int register_oom_notifier(struct notifier_block *nb)
498{
499 return blocking_notifier_chain_register(&oom_notify_list, nb);
500}
501EXPORT_SYMBOL_GPL(register_oom_notifier);
502
503int unregister_oom_notifier(struct notifier_block *nb)
504{
505 return blocking_notifier_chain_unregister(&oom_notify_list, nb);
506}
507EXPORT_SYMBOL_GPL(unregister_oom_notifier);
508
David Rientjes098d7f12007-10-16 23:25:55 -0700509/*
510 * Try to acquire the OOM killer lock for the zones in zonelist. Returns zero
511 * if a parallel OOM killing is already taking place that includes a zone in
512 * the zonelist. Otherwise, locks all zones in the zonelist and returns 1.
513 */
Mel Gormandd1a2392008-04-28 02:12:17 -0700514int try_set_zone_oom(struct zonelist *zonelist, gfp_t gfp_mask)
David Rientjes098d7f12007-10-16 23:25:55 -0700515{
Mel Gormandd1a2392008-04-28 02:12:17 -0700516 struct zoneref *z;
517 struct zone *zone;
David Rientjes098d7f12007-10-16 23:25:55 -0700518 int ret = 1;
519
David Rientjesc7d4cae2009-01-06 14:39:00 -0800520 spin_lock(&zone_scan_lock);
Mel Gormandd1a2392008-04-28 02:12:17 -0700521 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
522 if (zone_is_oom_locked(zone)) {
David Rientjes098d7f12007-10-16 23:25:55 -0700523 ret = 0;
524 goto out;
525 }
Mel Gormandd1a2392008-04-28 02:12:17 -0700526 }
David Rientjes098d7f12007-10-16 23:25:55 -0700527
Mel Gormandd1a2392008-04-28 02:12:17 -0700528 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
529 /*
David Rientjesc7d4cae2009-01-06 14:39:00 -0800530 * Lock each zone in the zonelist under zone_scan_lock so a
Mel Gormandd1a2392008-04-28 02:12:17 -0700531 * parallel invocation of try_set_zone_oom() doesn't succeed
532 * when it shouldn't.
533 */
534 zone_set_flag(zone, ZONE_OOM_LOCKED);
535 }
536
David Rientjes098d7f12007-10-16 23:25:55 -0700537out:
David Rientjesc7d4cae2009-01-06 14:39:00 -0800538 spin_unlock(&zone_scan_lock);
David Rientjes098d7f12007-10-16 23:25:55 -0700539 return ret;
540}
541
542/*
543 * Clears the ZONE_OOM_LOCKED flag for all zones in the zonelist so that failed
544 * allocation attempts with zonelists containing them may now recall the OOM
545 * killer, if necessary.
546 */
Mel Gormandd1a2392008-04-28 02:12:17 -0700547void clear_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
David Rientjes098d7f12007-10-16 23:25:55 -0700548{
Mel Gormandd1a2392008-04-28 02:12:17 -0700549 struct zoneref *z;
550 struct zone *zone;
David Rientjes098d7f12007-10-16 23:25:55 -0700551
David Rientjesc7d4cae2009-01-06 14:39:00 -0800552 spin_lock(&zone_scan_lock);
Mel Gormandd1a2392008-04-28 02:12:17 -0700553 for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
554 zone_clear_flag(zone, ZONE_OOM_LOCKED);
555 }
David Rientjesc7d4cae2009-01-06 14:39:00 -0800556 spin_unlock(&zone_scan_lock);
David Rientjes098d7f12007-10-16 23:25:55 -0700557}
558
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800559/*
560 * Must be called with tasklist_lock held for read.
561 */
562static void __out_of_memory(gfp_t gfp_mask, int order)
563{
David Rientjes184101b2009-05-06 16:02:55 -0700564 struct task_struct *p;
565 unsigned long points;
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800566
David Rientjes184101b2009-05-06 16:02:55 -0700567 if (sysctl_oom_kill_allocating_task)
568 if (!oom_kill_process(current, gfp_mask, order, 0, NULL,
569 "Out of memory (oom_kill_allocating_task)"))
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800570 return;
David Rientjes184101b2009-05-06 16:02:55 -0700571retry:
572 /*
573 * Rambo mode: Shoot down a process and hope it solves whatever
574 * issues we may have.
575 */
576 p = select_bad_process(&points, NULL);
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800577
David Rientjes184101b2009-05-06 16:02:55 -0700578 if (PTR_ERR(p) == -1UL)
579 return;
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800580
David Rientjes184101b2009-05-06 16:02:55 -0700581 /* Found nothing?!?! Either we hang forever, or we panic. */
582 if (!p) {
583 read_unlock(&tasklist_lock);
Daisuke Nishimurad31f56d2009-12-15 16:47:12 -0800584 dump_header(NULL, gfp_mask, order, NULL);
David Rientjes184101b2009-05-06 16:02:55 -0700585 panic("Out of memory and no killable processes...\n");
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800586 }
David Rientjes184101b2009-05-06 16:02:55 -0700587
588 if (oom_kill_process(p, gfp_mask, order, points, NULL,
589 "Out of memory"))
590 goto retry;
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800591}
592
593/*
594 * pagefault handler calls into here because it is out of memory but
595 * doesn't know exactly how or why.
596 */
597void pagefault_out_of_memory(void)
598{
599 unsigned long freed = 0;
600
601 blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
602 if (freed > 0)
603 /* Got some memory back in the last second. */
604 return;
605
606 if (sysctl_panic_on_oom)
607 panic("out of memory from page fault. panic_on_oom is selected.\n");
608
609 read_lock(&tasklist_lock);
610 __out_of_memory(0, 0); /* unknown gfp_mask and order */
611 read_unlock(&tasklist_lock);
612
613 /*
614 * Give "p" a good chance of killing itself before we
615 * retry to allocate memory.
616 */
617 if (!test_thread_flag(TIF_MEMDIE))
618 schedule_timeout_uninterruptible(1);
619}
620
Linus Torvalds1da177e2005-04-16 15:20:36 -0700621/**
Dave Peterson6937a252006-06-23 02:03:13 -0700622 * out_of_memory - kill the "best" process when we run out of memory
Randy Dunlap1b578df2008-03-19 17:00:42 -0700623 * @zonelist: zonelist pointer
624 * @gfp_mask: memory allocation flags
625 * @order: amount of memory being requested as a power of 2
Linus Torvalds1da177e2005-04-16 15:20:36 -0700626 *
627 * If we run out of memory, we have the choice between either
628 * killing a random task (bad), letting the system crash (worse)
629 * OR try to be smart about which process to kill. Note that we
630 * don't have to be perfect here, we just have to be good.
631 */
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800632void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask,
633 int order, nodemask_t *nodemask)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634{
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -0700635 unsigned long freed = 0;
David Rientjes70e24bd2007-10-16 23:25:53 -0700636 enum oom_constraint constraint;
Martin Schwidefsky8bc719d2006-09-25 23:31:20 -0700637
638 blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
639 if (freed > 0)
640 /* Got some memory back in the last second. */
641 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700642
David Rientjes1b604d72009-12-14 17:57:47 -0800643 if (sysctl_panic_on_oom == 2) {
Daisuke Nishimurad31f56d2009-12-15 16:47:12 -0800644 dump_header(NULL, gfp_mask, order, NULL);
Yasunori Goto2b744c02007-05-06 14:49:59 -0700645 panic("out of memory. Compulsory panic_on_oom is selected.\n");
David Rientjes1b604d72009-12-14 17:57:47 -0800646 }
Yasunori Goto2b744c02007-05-06 14:49:59 -0700647
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800648 /*
649 * Check if there were limitations on the allocation (only relevant for
650 * NUMA) that may require different handling.
651 */
KAMEZAWA Hiroyuki4365a562009-12-15 16:45:33 -0800652 constraint = constrained_alloc(zonelist, gfp_mask, nodemask);
David Rientjes2b45ab32007-05-06 14:50:00 -0700653 read_lock(&tasklist_lock);
654
655 switch (constraint) {
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800656 case CONSTRAINT_MEMORY_POLICY:
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800657 oom_kill_process(current, gfp_mask, order, 0, NULL,
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800658 "No available memory (MPOL_BIND)");
659 break;
660
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800661 case CONSTRAINT_NONE:
David Rientjes1b604d72009-12-14 17:57:47 -0800662 if (sysctl_panic_on_oom) {
Daisuke Nishimurad31f56d2009-12-15 16:47:12 -0800663 dump_header(NULL, gfp_mask, order, NULL);
KAMEZAWA Hiroyukifadd8fb2006-06-23 02:03:13 -0700664 panic("out of memory. panic_on_oom is selected\n");
David Rientjes1b604d72009-12-14 17:57:47 -0800665 }
David Rientjesfe071d72007-10-16 23:25:56 -0700666 /* Fall-through */
667 case CONSTRAINT_CPUSET:
Nick Piggin1c0fe6e2009-01-06 14:38:59 -0800668 __out_of_memory(gfp_mask, order);
Christoph Lameter9b0f8b02006-02-20 18:27:52 -0800669 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670 }
671
Andrew Morton140ffce2006-03-02 02:54:28 -0800672 read_unlock(&tasklist_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673
674 /*
675 * Give "p" a good chance of killing itself before we
Kirill Korotaev2f659f42006-01-08 01:01:05 -0800676 * retry to allocate memory unless "p" is current
Linus Torvalds1da177e2005-04-16 15:20:36 -0700677 */
Kirill Korotaev2f659f42006-01-08 01:01:05 -0800678 if (!test_thread_flag(TIF_MEMDIE))
Andrew Morton140ffce2006-03-02 02:54:28 -0800679 schedule_timeout_uninterruptible(1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700680}