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...
8 * The routines in this file are used to kill a process when
9 * 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.
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.
18 #include <linux/oom.h>
20 #include <linux/sched.h>
21 #include <linux/swap.h>
22 #include <linux/timex.h>
23 #include <linux/jiffies.h>
24 #include <linux/cpuset.h>
25 #include <linux/module.h>
26 #include <linux/notifier.h>
27 #include <linux/vs_memory.h>
29 int sysctl_panic_on_oom;
33 * badness - calculate a numeric value for how bad this task has been
34 * @p: task struct of which task we should calculate
35 * @uptime: current uptime in seconds
37 * The formula used is relatively simple and documented inline in the
38 * function. The main rationale is that we want to select a good task
39 * to kill when we run out of memory.
41 * Good in this context means that:
42 * 1) we lose the minimum amount of work done
43 * 2) we recover a large amount of memory
44 * 3) we don't kill anything innocent of eating tons of memory
45 * 4) we want to kill the minimum amount of processes (one)
46 * 5) we try to kill the process the user expects us to kill, this
47 * algorithm has been meticulously tuned to meet the principle
48 * of least surprise ... (be careful when you change it)
51 unsigned long badness(struct task_struct *p, unsigned long uptime)
53 unsigned long points, cpu_time, run_time, s;
55 struct task_struct *child;
65 * The memory size of the process is the basis for the badness.
67 points = mm->total_vm;
70 * add points for context badness
73 points += vx_badness(p, mm);
76 * After this unlock we can no longer dereference local variable `mm'
81 * swapoff can easily use up all memory, so kill those first.
83 if (p->flags & PF_SWAPOFF)
87 * Processes which fork a lot of child processes are likely
88 * a good choice. We add half the vmsize of the children if they
89 * have an own mm. This prevents forking servers to flood the
90 * machine with an endless amount of children. In case a single
91 * child is eating the vast majority of memory, adding only half
92 * to the parents will make the child our kill candidate of choice.
94 list_for_each_entry(child, &p->children, sibling) {
96 if (child->mm != mm && child->mm)
97 points += child->mm->total_vm/2 + 1;
102 * CPU time is in tens of seconds and run time is in thousands
103 * of seconds. There is no particular reason for this other than
104 * that it turned out to work very well in practice.
106 cpu_time = (cputime_to_jiffies(p->utime) + cputime_to_jiffies(p->stime))
109 if (uptime >= p->start_time.tv_sec)
110 run_time = (uptime - p->start_time.tv_sec) >> 10;
114 s = int_sqrt(cpu_time);
117 s = int_sqrt(int_sqrt(run_time));
122 * Niced processes are most likely less important, so double
123 * their badness points.
125 if (task_nice(p) > 0)
129 * Superuser processes are usually more important, so we make it
130 * less likely that we kill those.
132 if (cap_t(p->cap_effective) & CAP_TO_MASK(CAP_SYS_ADMIN) ||
133 p->uid == 0 || p->euid == 0)
137 * We don't want to kill a process with direct hardware access.
138 * Not only could that mess up the hardware, but usually users
139 * tend to only have this flag set on applications they think
142 if (cap_t(p->cap_effective) & CAP_TO_MASK(CAP_SYS_RAWIO))
146 * If p's nodes don't overlap ours, it may still help to kill p
147 * because p may have allocated or otherwise mapped memory on
148 * this node before. However it will be less likely.
150 if (!cpuset_excl_nodes_overlap(p))
154 * Adjust the score by oomkilladj.
157 if (p->oomkilladj > 0)
158 points <<= p->oomkilladj;
160 points >>= -(p->oomkilladj);
164 printk(KERN_DEBUG "OOMkill: task %d:#%u (%s) got %d points\n",
165 p->pid, p->xid, p->comm, points);
171 * Types of limitations to the nodes from which allocations may occur
173 #define CONSTRAINT_NONE 1
174 #define CONSTRAINT_MEMORY_POLICY 2
175 #define CONSTRAINT_CPUSET 3
178 * Determine the type of allocation constraint.
180 static inline int constrained_alloc(struct zonelist *zonelist, gfp_t gfp_mask)
188 /* node has memory ? */
189 for_each_online_node(node)
190 if (NODE_DATA(node)->node_present_pages)
191 node_set(node, nodes);
193 for (z = zonelist->zones; *z; z++)
194 if (cpuset_zone_allowed_softwall(*z, gfp_mask))
195 node_clear(zone_to_nid(*z), nodes);
197 return CONSTRAINT_CPUSET;
199 if (!nodes_empty(nodes))
200 return CONSTRAINT_MEMORY_POLICY;
203 return CONSTRAINT_NONE;
207 * Simple selection loop. We chose the process with the highest
208 * number of 'points'. We expect the caller will lock the tasklist.
210 * (not docbooked, we don't want this one cluttering up the manual)
212 static struct task_struct *select_bad_process(unsigned long *ppoints)
214 struct task_struct *g, *p;
215 struct task_struct *chosen = NULL;
216 struct timespec uptime;
219 do_posix_clock_monotonic_gettime(&uptime);
220 do_each_thread(g, p) {
221 unsigned long points;
224 * skip kernel threads and tasks which have already released
229 /* skip the init task */
234 * This task already has access to memory reserves and is
235 * being killed. Don't allow any other task access to the
238 * Note: this may have a chance of deadlock if it gets
239 * blocked waiting for another task which itself is waiting
240 * for memory. Is there a better alternative?
242 if (test_tsk_thread_flag(p, TIF_MEMDIE))
243 return ERR_PTR(-1UL);
246 * This is in the process of releasing memory so wait for it
247 * to finish before killing some other task by mistake.
249 * However, if p is the current task, we allow the 'kill' to
250 * go ahead if it is exiting: this will simply set TIF_MEMDIE,
251 * which will allow it to gain access to memory reserves in
252 * the process of exiting and releasing its resources.
253 * Otherwise we could get an easy OOM deadlock.
255 if (p->flags & PF_EXITING) {
257 return ERR_PTR(-1UL);
260 *ppoints = ULONG_MAX;
263 if (p->oomkilladj == OOM_DISABLE)
266 points = badness(p, uptime.tv_sec);
267 if (points > *ppoints || !chosen) {
271 } while_each_thread(g, p);
277 * Send SIGKILL to the selected process irrespective of CAP_SYS_RAW_IO
278 * flag though it's unlikely that we select a process with CAP_SYS_RAW_IO
281 static void __oom_kill_task(struct task_struct *p, int verbose)
285 printk(KERN_WARNING "tried to kill init!\n");
291 printk(KERN_WARNING "tried to kill an mm-less task!\n");
296 printk(KERN_ERR "Killed process %d:#%u (%s)\n",
297 p->pid, p->xid, p->comm);
300 * We give our sacrificial lamb high priority and access to
301 * all the memory it needs. That way it should be able to
302 * exit() and clear out its resources quickly...
305 set_tsk_thread_flag(p, TIF_MEMDIE);
307 force_sig(SIGKILL, p);
310 static int oom_kill_task(struct task_struct *p)
312 struct mm_struct *mm;
313 struct task_struct *g, *q;
317 /* WARNING: mm may not be dereferenced since we did not obtain its
318 * value from get_task_mm(p). This is OK since all we need to do is
319 * compare mm to q->mm below.
321 * Furthermore, even if mm contains a non-NULL value, p->mm may
322 * change to NULL at any time since we do not hold task_lock(p).
323 * However, this is of no concern to us.
330 * Don't kill the process if any threads are set to OOM_DISABLE
332 do_each_thread(g, q) {
333 if (q->mm == mm && q->oomkilladj == OOM_DISABLE)
335 } while_each_thread(g, q);
337 __oom_kill_task(p, 1);
340 * kill all processes that share the ->mm (i.e. all threads),
341 * but are in a different thread group. Don't let them have access
342 * to memory reserves though, otherwise we might deplete all memory.
344 do_each_thread(g, q) {
345 if (q->mm == mm && q->tgid != p->tgid)
346 force_sig(SIGKILL, q);
347 } while_each_thread(g, q);
352 static int oom_kill_process(struct task_struct *p, unsigned long points,
355 struct task_struct *c;
356 struct list_head *tsk;
359 * If the task is already exiting, don't alarm the sysadmin or kill
360 * its children or threads, just set TIF_MEMDIE so it can die quickly
362 if (p->flags & PF_EXITING) {
363 __oom_kill_task(p, 0);
367 printk(KERN_ERR "%s: kill process %d:#%u (%s) score %li or a child\n",
368 message, p->pid, p->xid, p->comm, points);
370 /* Try to kill a child first */
371 list_for_each(tsk, &p->children) {
372 c = list_entry(tsk, struct task_struct, sibling);
375 if (!oom_kill_task(c))
378 return oom_kill_task(p);
381 static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
383 int register_oom_notifier(struct notifier_block *nb)
385 return blocking_notifier_chain_register(&oom_notify_list, nb);
387 EXPORT_SYMBOL_GPL(register_oom_notifier);
389 int unregister_oom_notifier(struct notifier_block *nb)
391 return blocking_notifier_chain_unregister(&oom_notify_list, nb);
393 EXPORT_SYMBOL_GPL(unregister_oom_notifier);
396 * out_of_memory - kill the "best" process when we run out of memory
398 * If we run out of memory, we have the choice between either
399 * killing a random task (bad), letting the system crash (worse)
400 * OR try to be smart about which process to kill. Note that we
401 * don't have to be perfect here, we just have to be good.
403 void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask, int order)
405 struct task_struct *p;
406 unsigned long points = 0;
407 unsigned long freed = 0;
409 blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
411 /* Got some memory back in the last second. */
414 if (printk_ratelimit()) {
415 printk(KERN_WARNING "%s invoked oom-killer: "
416 "gfp_mask=0x%x, order=%d, oomkilladj=%d\n",
417 current->comm, gfp_mask, order, current->oomkilladj);
423 read_lock(&tasklist_lock);
426 * Check if there were limitations on the allocation (only relevant for
427 * NUMA) that may require different handling.
429 switch (constrained_alloc(zonelist, gfp_mask)) {
430 case CONSTRAINT_MEMORY_POLICY:
431 oom_kill_process(current, points,
432 "No available memory (MPOL_BIND)");
435 case CONSTRAINT_CPUSET:
436 oom_kill_process(current, points,
437 "No available memory in cpuset");
440 case CONSTRAINT_NONE:
441 if (sysctl_panic_on_oom)
442 panic("out of memory. panic_on_oom is selected\n");
445 * Rambo mode: Shoot down a process and hope it solves whatever
446 * issues we may have.
448 p = select_bad_process(&points);
450 if (PTR_ERR(p) == -1UL)
453 /* Found nothing?!?! Either we hang forever, or we panic. */
455 read_unlock(&tasklist_lock);
457 panic("Out of memory and no killable processes...\n");
460 if (oom_kill_process(p, points, "Out of memory"))
467 read_unlock(&tasklist_lock);
471 * Give "p" a good chance of killing itself before we
472 * retry to allocate memory unless "p" is current
474 if (!test_thread_flag(TIF_MEMDIE))
475 schedule_timeout_uninterruptible(1);