Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/mm/oom_kill.c | |
3 | * | |
4 | * Copyright (C) 1998,2000 Rik van Riel | |
5 | * Thanks go out to Claus Fischer for some serious inspiration and | |
6 | * for goading me into coding this file... | |
a63d83f4 DR |
7 | * Copyright (C) 2010 Google, Inc. |
8 | * Rewritten by David Rientjes | |
1da177e4 LT |
9 | * |
10 | * The routines in this file are used to kill a process when | |
a49335cc PJ |
11 | * we're seriously out of memory. This gets called from __alloc_pages() |
12 | * in mm/page_alloc.c when we really run out of memory. | |
1da177e4 LT |
13 | * |
14 | * Since we won't call these routines often (on a well-configured | |
15 | * machine) this file will double as a 'coding guide' and a signpost | |
16 | * for newbie kernel hackers. It features several pointers to major | |
17 | * kernel subsystems and hints as to where to find out what things do. | |
18 | */ | |
19 | ||
8ac773b4 | 20 | #include <linux/oom.h> |
1da177e4 | 21 | #include <linux/mm.h> |
4e950f6f | 22 | #include <linux/err.h> |
5a0e3ad6 | 23 | #include <linux/gfp.h> |
1da177e4 LT |
24 | #include <linux/sched.h> |
25 | #include <linux/swap.h> | |
26 | #include <linux/timex.h> | |
27 | #include <linux/jiffies.h> | |
ef08e3b4 | 28 | #include <linux/cpuset.h> |
8bc719d3 MS |
29 | #include <linux/module.h> |
30 | #include <linux/notifier.h> | |
c7ba5c9e | 31 | #include <linux/memcontrol.h> |
6f48d0eb | 32 | #include <linux/mempolicy.h> |
5cd9c58f | 33 | #include <linux/security.h> |
edd45544 | 34 | #include <linux/ptrace.h> |
1da177e4 | 35 | |
fadd8fbd | 36 | int sysctl_panic_on_oom; |
fe071d7e | 37 | int sysctl_oom_kill_allocating_task; |
ad915c43 | 38 | int sysctl_oom_dump_tasks = 1; |
c7d4caeb | 39 | static DEFINE_SPINLOCK(zone_scan_lock); |
1da177e4 | 40 | |
72788c38 DR |
41 | /** |
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 | */ | |
49 | int 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(¤t->mm->oom_disable_count); | |
59 | else if (old_val == OOM_SCORE_ADJ_MIN) | |
60 | atomic_dec(¤t->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 | ||
6f48d0eb DR |
68 | #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. | |
495789a5 | 77 | */ |
6f48d0eb DR |
78 | static bool has_intersects_mems_allowed(struct task_struct *tsk, |
79 | const nodemask_t *mask) | |
495789a5 | 80 | { |
6f48d0eb | 81 | struct task_struct *start = tsk; |
495789a5 | 82 | |
495789a5 | 83 | do { |
6f48d0eb DR |
84 | if (mask) { |
85 | /* | |
86 | * If this is a mempolicy constrained oom, tsk's | |
87 | * cpuset is irrelevant. Only return true if its | |
88 | * mempolicy intersects current, otherwise it may be | |
89 | * needlessly killed. | |
90 | */ | |
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 | } | |
df1090a8 KM |
101 | } while_each_thread(start, tsk); |
102 | ||
6f48d0eb DR |
103 | return false; |
104 | } | |
105 | #else | |
106 | static bool has_intersects_mems_allowed(struct task_struct *tsk, | |
107 | const nodemask_t *mask) | |
108 | { | |
109 | return true; | |
495789a5 | 110 | } |
6f48d0eb | 111 | #endif /* CONFIG_NUMA */ |
495789a5 | 112 | |
6f48d0eb DR |
113 | /* |
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 | */ | |
158e0a2d | 119 | struct task_struct *find_lock_task_mm(struct task_struct *p) |
dd8e8f40 ON |
120 | { |
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 | ||
ab290adb | 133 | /* return true if the task is not adequate as candidate victim task. */ |
e85bfd3a DR |
134 | static bool oom_unkillable_task(struct task_struct *p, |
135 | const struct mem_cgroup *mem, const nodemask_t *nodemask) | |
ab290adb KM |
136 | { |
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 | ||
1da177e4 | 153 | /** |
a63d83f4 | 154 | * oom_badness - heuristic function to determine which candidate task to kill |
1da177e4 | 155 | * @p: task struct of which task we should calculate |
a63d83f4 | 156 | * @totalpages: total present RAM allowed for page allocation |
1da177e4 | 157 | * |
a63d83f4 DR |
158 | * 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. | |
1da177e4 | 161 | */ |
a63d83f4 DR |
162 | unsigned int oom_badness(struct task_struct *p, struct mem_cgroup *mem, |
163 | const nodemask_t *nodemask, unsigned long totalpages) | |
1da177e4 | 164 | { |
a63d83f4 | 165 | int points; |
28b83c51 | 166 | |
26ebc984 KM |
167 | if (oom_unkillable_task(p, mem, nodemask)) |
168 | return 0; | |
1da177e4 | 169 | |
dd8e8f40 ON |
170 | p = find_lock_task_mm(p); |
171 | if (!p) | |
1da177e4 LT |
172 | return 0; |
173 | ||
174 | /* | |
e18641e1 DR |
175 | * 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. | |
1da177e4 | 178 | */ |
e18641e1 | 179 | if (atomic_read(&p->mm->oom_disable_count)) { |
a63d83f4 DR |
180 | task_unlock(p); |
181 | return 0; | |
182 | } | |
1da177e4 | 183 | |
1da177e4 | 184 | /* |
a63d83f4 DR |
185 | * The memory controller may have a limit of 0 bytes, so avoid a divide |
186 | * by zero, if necessary. | |
1da177e4 | 187 | */ |
a63d83f4 DR |
188 | if (!totalpages) |
189 | totalpages = 1; | |
1da177e4 LT |
190 | |
191 | /* | |
a63d83f4 | 192 | * The baseline for the badness score is the proportion of RAM that each |
f755a042 | 193 | * task's rss, pagetable and swap space use. |
1da177e4 | 194 | */ |
f755a042 KM |
195 | 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; | |
a63d83f4 | 200 | task_unlock(p); |
1da177e4 LT |
201 | |
202 | /* | |
a63d83f4 DR |
203 | * Root processes get 3% bonus, just like the __vm_enough_memory() |
204 | * implementation used by LSMs. | |
1da177e4 | 205 | */ |
a63d83f4 DR |
206 | if (has_capability_noaudit(p, CAP_SYS_ADMIN)) |
207 | points -= 30; | |
1da177e4 LT |
208 | |
209 | /* | |
a63d83f4 DR |
210 | * /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. | |
1da177e4 | 213 | */ |
a63d83f4 | 214 | points += p->signal->oom_score_adj; |
1da177e4 | 215 | |
f19e8aa1 DR |
216 | /* |
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; | |
a63d83f4 | 223 | return (points < 1000) ? points : 1000; |
1da177e4 LT |
224 | } |
225 | ||
9b0f8b04 CL |
226 | /* |
227 | * Determine the type of allocation constraint. | |
228 | */ | |
9b0f8b04 | 229 | #ifdef CONFIG_NUMA |
4365a567 | 230 | static enum oom_constraint constrained_alloc(struct zonelist *zonelist, |
a63d83f4 DR |
231 | gfp_t gfp_mask, nodemask_t *nodemask, |
232 | unsigned long *totalpages) | |
4365a567 | 233 | { |
54a6eb5c | 234 | struct zone *zone; |
dd1a239f | 235 | struct zoneref *z; |
54a6eb5c | 236 | enum zone_type high_zoneidx = gfp_zone(gfp_mask); |
a63d83f4 DR |
237 | bool cpuset_limited = false; |
238 | int nid; | |
9b0f8b04 | 239 | |
a63d83f4 DR |
240 | /* Default to all available memory */ |
241 | *totalpages = totalram_pages + total_swap_pages; | |
242 | ||
243 | if (!zonelist) | |
244 | return CONSTRAINT_NONE; | |
4365a567 KH |
245 | /* |
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; | |
9b0f8b04 | 252 | |
4365a567 | 253 | /* |
a63d83f4 DR |
254 | * 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(). | |
4365a567 | 257 | */ |
a63d83f4 DR |
258 | 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); | |
9b0f8b04 | 262 | return CONSTRAINT_MEMORY_POLICY; |
a63d83f4 | 263 | } |
4365a567 KH |
264 | |
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)) | |
a63d83f4 | 269 | cpuset_limited = true; |
9b0f8b04 | 270 | |
a63d83f4 DR |
271 | 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 | } | |
9b0f8b04 CL |
277 | return CONSTRAINT_NONE; |
278 | } | |
4365a567 KH |
279 | #else |
280 | static enum oom_constraint constrained_alloc(struct zonelist *zonelist, | |
a63d83f4 DR |
281 | gfp_t gfp_mask, nodemask_t *nodemask, |
282 | unsigned long *totalpages) | |
4365a567 | 283 | { |
a63d83f4 | 284 | *totalpages = totalram_pages + total_swap_pages; |
4365a567 KH |
285 | return CONSTRAINT_NONE; |
286 | } | |
287 | #endif | |
9b0f8b04 | 288 | |
1da177e4 LT |
289 | /* |
290 | * 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 | */ | |
a63d83f4 DR |
295 | static struct task_struct *select_bad_process(unsigned int *ppoints, |
296 | unsigned long totalpages, struct mem_cgroup *mem, | |
297 | const nodemask_t *nodemask) | |
1da177e4 | 298 | { |
3a5dda7a | 299 | struct task_struct *g, *p; |
1da177e4 | 300 | struct task_struct *chosen = NULL; |
9827b781 | 301 | *ppoints = 0; |
1da177e4 | 302 | |
3a5dda7a | 303 | do_each_thread(g, p) { |
a63d83f4 | 304 | unsigned int points; |
a49335cc | 305 | |
30e2b41f AV |
306 | if (!p->mm) |
307 | continue; | |
ab290adb | 308 | if (oom_unkillable_task(p, mem, nodemask)) |
6cf86ac6 | 309 | continue; |
ef08e3b4 | 310 | |
b78483a4 NP |
311 | /* |
312 | * 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 | ||
30e2b41f | 323 | if (p->flags & PF_EXITING) { |
edd45544 DR |
324 | /* |
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 | */ | |
d21142ec | 342 | if (!(p->group_leader->ptrace & PT_TRACE_EXIT)) |
edd45544 DR |
343 | return ERR_PTR(-1UL); |
344 | } | |
50ec3bbf | 345 | } |
972c4ea5 | 346 | |
a63d83f4 DR |
347 | points = oom_badness(p, mem, nodemask, totalpages); |
348 | if (points > *ppoints) { | |
a49335cc | 349 | chosen = p; |
9827b781 | 350 | *ppoints = points; |
1da177e4 | 351 | } |
3a5dda7a | 352 | } while_each_thread(g, p); |
972c4ea5 | 353 | |
1da177e4 LT |
354 | return chosen; |
355 | } | |
356 | ||
fef1bdd6 | 357 | /** |
1b578df0 | 358 | * dump_tasks - dump current memory state of all system tasks |
74ab7f1d | 359 | * @mem: current's memory controller, if constrained |
e85bfd3a | 360 | * @nodemask: nodemask passed to page allocator for mempolicy ooms |
1b578df0 | 361 | * |
e85bfd3a DR |
362 | * 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. | |
fef1bdd6 | 365 | * State information includes task's pid, uid, tgid, vm size, rss, cpu, oom_adj |
a63d83f4 | 366 | * value, oom_score_adj value, and name. |
fef1bdd6 | 367 | * |
fef1bdd6 DR |
368 | * Call with tasklist_lock read-locked. |
369 | */ | |
e85bfd3a | 370 | static void dump_tasks(const struct mem_cgroup *mem, const nodemask_t *nodemask) |
fef1bdd6 | 371 | { |
c55db957 KM |
372 | struct task_struct *p; |
373 | struct task_struct *task; | |
fef1bdd6 | 374 | |
a63d83f4 | 375 | pr_info("[ pid ] uid tgid total_vm rss cpu oom_adj oom_score_adj name\n"); |
c55db957 | 376 | for_each_process(p) { |
e85bfd3a | 377 | if (oom_unkillable_task(p, mem, nodemask)) |
b4416d2b | 378 | continue; |
fef1bdd6 | 379 | |
c55db957 KM |
380 | task = find_lock_task_mm(p); |
381 | if (!task) { | |
6d2661ed | 382 | /* |
74ab7f1d DR |
383 | * This is a kthread or all of p's threads have already |
384 | * detached their mm's. There's no need to report | |
c55db957 | 385 | * them; they can't be oom killed anyway. |
6d2661ed | 386 | */ |
6d2661ed DR |
387 | continue; |
388 | } | |
c55db957 | 389 | |
a63d83f4 | 390 | pr_info("[%5d] %5d %5d %8lu %8lu %3u %3d %5d %s\n", |
8d6c83f0 | 391 | task->pid, task_uid(task), task->tgid, |
a63d83f4 DR |
392 | 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); | |
c55db957 KM |
395 | task_unlock(task); |
396 | } | |
fef1bdd6 DR |
397 | } |
398 | ||
d31f56db | 399 | static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order, |
e85bfd3a | 400 | struct mem_cgroup *mem, const nodemask_t *nodemask) |
1b604d75 | 401 | { |
5e9d834a | 402 | task_lock(current); |
1b604d75 | 403 | pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, " |
a63d83f4 DR |
404 | "oom_adj=%d, oom_score_adj=%d\n", |
405 | current->comm, gfp_mask, order, current->signal->oom_adj, | |
406 | current->signal->oom_score_adj); | |
1b604d75 DR |
407 | cpuset_print_task_mems_allowed(current); |
408 | task_unlock(current); | |
409 | dump_stack(); | |
d31f56db | 410 | mem_cgroup_print_oom_info(mem, p); |
b2b755b5 | 411 | show_mem(SHOW_MEM_FILTER_NODES); |
1b604d75 | 412 | if (sysctl_oom_dump_tasks) |
e85bfd3a | 413 | dump_tasks(mem, nodemask); |
1b604d75 DR |
414 | } |
415 | ||
3b4798cb | 416 | #define K(x) ((x) << (PAGE_SHIFT-10)) |
93b43fa5 | 417 | static int oom_kill_task(struct task_struct *p, struct mem_cgroup *mem) |
1da177e4 | 418 | { |
1e99bad0 DR |
419 | struct task_struct *q; |
420 | struct mm_struct *mm; | |
421 | ||
dd8e8f40 | 422 | p = find_lock_task_mm(p); |
be71cf22 | 423 | if (!p) |
b940fd70 | 424 | return 1; |
be71cf22 | 425 | |
1e99bad0 DR |
426 | /* mm cannot be safely dereferenced after task_unlock(p) */ |
427 | mm = p->mm; | |
428 | ||
b940fd70 DR |
429 | 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))); | |
3b4798cb | 433 | task_unlock(p); |
1da177e4 | 434 | |
1e99bad0 DR |
435 | /* |
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 | } | |
93b43fa5 | 453 | |
1da177e4 | 454 | set_tsk_thread_flag(p, TIF_MEMDIE); |
1da177e4 | 455 | force_sig(SIGKILL, p); |
93b43fa5 | 456 | |
01315922 | 457 | return 0; |
1da177e4 | 458 | } |
b940fd70 | 459 | #undef K |
1da177e4 | 460 | |
7213f506 | 461 | static int oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order, |
a63d83f4 DR |
462 | unsigned int points, unsigned long totalpages, |
463 | struct mem_cgroup *mem, nodemask_t *nodemask, | |
464 | const char *message) | |
1da177e4 | 465 | { |
52d3c036 | 466 | struct task_struct *victim = p; |
5e9d834a | 467 | struct task_struct *child; |
52d3c036 LT |
468 | struct task_struct *t = p; |
469 | unsigned int victim_points = 0; | |
1da177e4 | 470 | |
1b604d75 | 471 | if (printk_ratelimit()) |
e85bfd3a | 472 | dump_header(p, gfp_mask, order, mem, nodemask); |
7213f506 | 473 | |
50ec3bbf NP |
474 | /* |
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 | */ | |
0753ba01 | 478 | if (p->flags & PF_EXITING) { |
4358997a | 479 | set_tsk_thread_flag(p, TIF_MEMDIE); |
50ec3bbf NP |
480 | return 0; |
481 | } | |
482 | ||
5e9d834a | 483 | task_lock(p); |
a63d83f4 | 484 | pr_err("%s: Kill process %d (%s) score %d or sacrifice child\n", |
5e9d834a DR |
485 | message, task_pid_nr(p), p->comm, points); |
486 | task_unlock(p); | |
f3af38d3 | 487 | |
5e9d834a DR |
488 | /* |
489 | * If any of p's children has a different mm and is eligible for kill, | |
11239836 | 490 | * the one with the highest oom_badness() score is sacrificed for its |
5e9d834a DR |
491 | * parent. This attempts to lose the minimal amount of work done while |
492 | * still freeing memory. | |
493 | */ | |
dd8e8f40 | 494 | do { |
5e9d834a | 495 | list_for_each_entry(child, &t->children, sibling) { |
a63d83f4 | 496 | unsigned int child_points; |
5e9d834a | 497 | |
edd45544 DR |
498 | if (child->mm == p->mm) |
499 | continue; | |
a63d83f4 DR |
500 | /* |
501 | * oom_badness() returns 0 if the thread is unkillable | |
502 | */ | |
503 | child_points = oom_badness(child, mem, nodemask, | |
504 | totalpages); | |
5e9d834a DR |
505 | if (child_points > victim_points) { |
506 | victim = child; | |
507 | victim_points = child_points; | |
508 | } | |
dd8e8f40 ON |
509 | } |
510 | } while_each_thread(p, t); | |
511 | ||
93b43fa5 | 512 | return oom_kill_task(victim, mem); |
1da177e4 LT |
513 | } |
514 | ||
309ed882 DR |
515 | /* |
516 | * Determines whether the kernel must panic because of the panic_on_oom sysctl. | |
517 | */ | |
518 | static void check_panic_on_oom(enum oom_constraint constraint, gfp_t gfp_mask, | |
e85bfd3a | 519 | int order, const nodemask_t *nodemask) |
309ed882 DR |
520 | { |
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); | |
e85bfd3a | 533 | dump_header(NULL, gfp_mask, order, NULL, nodemask); |
309ed882 DR |
534 | 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 | ||
00f0b825 | 539 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR |
c7ba5c9e PE |
540 | void mem_cgroup_out_of_memory(struct mem_cgroup *mem, gfp_t gfp_mask) |
541 | { | |
a63d83f4 DR |
542 | unsigned long limit; |
543 | unsigned int points = 0; | |
c7ba5c9e PE |
544 | struct task_struct *p; |
545 | ||
f9434ad1 DR |
546 | /* |
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); | |
f9434ad1 DR |
553 | return; |
554 | } | |
555 | ||
e85bfd3a | 556 | check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, 0, NULL); |
a63d83f4 | 557 | limit = mem_cgroup_get_limit(mem) >> PAGE_SHIFT; |
e115f2d8 | 558 | read_lock(&tasklist_lock); |
c7ba5c9e | 559 | retry: |
a63d83f4 | 560 | p = select_bad_process(&points, limit, mem, NULL); |
df64f81b | 561 | if (!p || PTR_ERR(p) == -1UL) |
c7ba5c9e PE |
562 | goto out; |
563 | ||
a63d83f4 | 564 | if (oom_kill_process(p, gfp_mask, 0, points, limit, mem, NULL, |
c7ba5c9e PE |
565 | "Memory cgroup out of memory")) |
566 | goto retry; | |
567 | out: | |
e115f2d8 | 568 | read_unlock(&tasklist_lock); |
c7ba5c9e PE |
569 | } |
570 | #endif | |
571 | ||
8bc719d3 MS |
572 | static BLOCKING_NOTIFIER_HEAD(oom_notify_list); |
573 | ||
574 | int register_oom_notifier(struct notifier_block *nb) | |
575 | { | |
576 | return blocking_notifier_chain_register(&oom_notify_list, nb); | |
577 | } | |
578 | EXPORT_SYMBOL_GPL(register_oom_notifier); | |
579 | ||
580 | int unregister_oom_notifier(struct notifier_block *nb) | |
581 | { | |
582 | return blocking_notifier_chain_unregister(&oom_notify_list, nb); | |
583 | } | |
584 | EXPORT_SYMBOL_GPL(unregister_oom_notifier); | |
585 | ||
098d7f12 DR |
586 | /* |
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 | */ | |
ff321fea | 591 | int try_set_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask) |
098d7f12 | 592 | { |
dd1a239f MG |
593 | struct zoneref *z; |
594 | struct zone *zone; | |
098d7f12 DR |
595 | int ret = 1; |
596 | ||
c7d4caeb | 597 | spin_lock(&zone_scan_lock); |
dd1a239f MG |
598 | for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) { |
599 | if (zone_is_oom_locked(zone)) { | |
098d7f12 DR |
600 | ret = 0; |
601 | goto out; | |
602 | } | |
dd1a239f MG |
603 | } |
604 | ||
605 | for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) { | |
606 | /* | |
c7d4caeb | 607 | * Lock each zone in the zonelist under zone_scan_lock so a |
ff321fea | 608 | * parallel invocation of try_set_zonelist_oom() doesn't succeed |
dd1a239f MG |
609 | * when it shouldn't. |
610 | */ | |
611 | zone_set_flag(zone, ZONE_OOM_LOCKED); | |
612 | } | |
098d7f12 | 613 | |
098d7f12 | 614 | out: |
c7d4caeb | 615 | spin_unlock(&zone_scan_lock); |
098d7f12 DR |
616 | 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 | */ | |
dd1a239f | 624 | void clear_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask) |
098d7f12 | 625 | { |
dd1a239f MG |
626 | struct zoneref *z; |
627 | struct zone *zone; | |
098d7f12 | 628 | |
c7d4caeb | 629 | spin_lock(&zone_scan_lock); |
dd1a239f MG |
630 | for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) { |
631 | zone_clear_flag(zone, ZONE_OOM_LOCKED); | |
632 | } | |
c7d4caeb | 633 | spin_unlock(&zone_scan_lock); |
098d7f12 DR |
634 | } |
635 | ||
e3658932 DR |
636 | /* |
637 | * 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 | */ | |
641 | static 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); | |
654 | out: | |
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 | */ | |
663 | static 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 | ||
1da177e4 | 673 | /** |
6937a25c | 674 | * out_of_memory - kill the "best" process when we run out of memory |
1b578df0 RD |
675 | * @zonelist: zonelist pointer |
676 | * @gfp_mask: memory allocation flags | |
677 | * @order: amount of memory being requested as a power of 2 | |
6f48d0eb | 678 | * @nodemask: nodemask passed to page allocator |
1da177e4 LT |
679 | * |
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 | */ | |
4365a567 KH |
685 | void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask, |
686 | int order, nodemask_t *nodemask) | |
1da177e4 | 687 | { |
e85bfd3a | 688 | const nodemask_t *mpol_mask; |
0aad4b31 | 689 | struct task_struct *p; |
a63d83f4 | 690 | unsigned long totalpages; |
8bc719d3 | 691 | unsigned long freed = 0; |
a63d83f4 | 692 | unsigned int points; |
e3658932 | 693 | enum oom_constraint constraint = CONSTRAINT_NONE; |
b52723c5 | 694 | int killed = 0; |
8bc719d3 MS |
695 | |
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; | |
1da177e4 | 700 | |
7b98c2e4 DR |
701 | /* |
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 | ||
9b0f8b04 CL |
711 | /* |
712 | * Check if there were limitations on the allocation (only relevant for | |
713 | * NUMA) that may require different handling. | |
714 | */ | |
a63d83f4 DR |
715 | constraint = constrained_alloc(zonelist, gfp_mask, nodemask, |
716 | &totalpages); | |
e85bfd3a DR |
717 | mpol_mask = (constraint == CONSTRAINT_MEMORY_POLICY) ? nodemask : NULL; |
718 | check_panic_on_oom(constraint, gfp_mask, order, mpol_mask); | |
0aad4b31 | 719 | |
2b45ab33 | 720 | read_lock(&tasklist_lock); |
f88ccad5 | 721 | if (sysctl_oom_kill_allocating_task && |
a96cfd6e | 722 | !oom_unkillable_task(current, NULL, nodemask) && |
e18641e1 | 723 | current->mm && !atomic_read(¤t->mm->oom_disable_count)) { |
0aad4b31 DR |
724 | /* |
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 | */ | |
a63d83f4 DR |
729 | if (!oom_kill_process(current, gfp_mask, order, 0, totalpages, |
730 | NULL, nodemask, | |
0aad4b31 | 731 | "Out of memory (oom_kill_allocating_task)")) |
b52723c5 | 732 | goto out; |
0aad4b31 DR |
733 | } |
734 | ||
735 | retry: | |
e85bfd3a | 736 | p = select_bad_process(&points, totalpages, NULL, mpol_mask); |
0aad4b31 | 737 | if (PTR_ERR(p) == -1UL) |
b52723c5 | 738 | goto out; |
0aad4b31 DR |
739 | |
740 | /* Found nothing?!?! Either we hang forever, or we panic. */ | |
741 | if (!p) { | |
e85bfd3a | 742 | dump_header(NULL, gfp_mask, order, NULL, mpol_mask); |
0aad4b31 DR |
743 | read_unlock(&tasklist_lock); |
744 | panic("Out of memory and no killable processes...\n"); | |
745 | } | |
746 | ||
a63d83f4 DR |
747 | if (oom_kill_process(p, gfp_mask, order, points, totalpages, NULL, |
748 | nodemask, "Out of memory")) | |
0aad4b31 | 749 | goto retry; |
b52723c5 KM |
750 | killed = 1; |
751 | out: | |
140ffcec | 752 | read_unlock(&tasklist_lock); |
1da177e4 LT |
753 | |
754 | /* | |
755 | * Give "p" a good chance of killing itself before we | |
2f659f46 | 756 | * retry to allocate memory unless "p" is current |
1da177e4 | 757 | */ |
b52723c5 | 758 | if (killed && !test_thread_flag(TIF_MEMDIE)) |
140ffcec | 759 | schedule_timeout_uninterruptible(1); |
1da177e4 | 760 | } |
e3658932 DR |
761 | |
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 | */ | |
768 | void 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 | } |