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> |
f660daac | 35 | #include <linux/freezer.h> |
1da177e4 | 36 | |
fadd8fbd | 37 | int sysctl_panic_on_oom; |
fe071d7e | 38 | int sysctl_oom_kill_allocating_task; |
ad915c43 | 39 | int sysctl_oom_dump_tasks = 1; |
c7d4caeb | 40 | static DEFINE_SPINLOCK(zone_scan_lock); |
1da177e4 | 41 | |
43362a49 DR |
42 | /* |
43 | * compare_swap_oom_score_adj() - compare and swap current's oom_score_adj | |
44 | * @old_val: old oom_score_adj for compare | |
45 | * @new_val: new oom_score_adj for swap | |
46 | * | |
47 | * Sets the oom_score_adj value for current to @new_val iff its present value is | |
48 | * @old_val. Usually used to reinstate a previous value to prevent racing with | |
49 | * userspacing tuning the value in the interim. | |
50 | */ | |
51 | void compare_swap_oom_score_adj(int old_val, int new_val) | |
52 | { | |
53 | struct sighand_struct *sighand = current->sighand; | |
54 | ||
55 | spin_lock_irq(&sighand->siglock); | |
56 | if (current->signal->oom_score_adj == old_val) | |
57 | current->signal->oom_score_adj = new_val; | |
58 | spin_unlock_irq(&sighand->siglock); | |
59 | } | |
60 | ||
72788c38 DR |
61 | /** |
62 | * test_set_oom_score_adj() - set current's oom_score_adj and return old value | |
63 | * @new_val: new oom_score_adj value | |
64 | * | |
65 | * Sets the oom_score_adj value for current to @new_val with proper | |
66 | * synchronization and returns the old value. Usually used to temporarily | |
67 | * set a value, save the old value in the caller, and then reinstate it later. | |
68 | */ | |
69 | int test_set_oom_score_adj(int new_val) | |
70 | { | |
71 | struct sighand_struct *sighand = current->sighand; | |
72 | int old_val; | |
73 | ||
74 | spin_lock_irq(&sighand->siglock); | |
75 | old_val = current->signal->oom_score_adj; | |
c9f01245 | 76 | current->signal->oom_score_adj = new_val; |
72788c38 DR |
77 | spin_unlock_irq(&sighand->siglock); |
78 | ||
79 | return old_val; | |
80 | } | |
81 | ||
6f48d0eb DR |
82 | #ifdef CONFIG_NUMA |
83 | /** | |
84 | * has_intersects_mems_allowed() - check task eligiblity for kill | |
85 | * @tsk: task struct of which task to consider | |
86 | * @mask: nodemask passed to page allocator for mempolicy ooms | |
87 | * | |
88 | * Task eligibility is determined by whether or not a candidate task, @tsk, | |
89 | * shares the same mempolicy nodes as current if it is bound by such a policy | |
90 | * and whether or not it has the same set of allowed cpuset nodes. | |
495789a5 | 91 | */ |
6f48d0eb DR |
92 | static bool has_intersects_mems_allowed(struct task_struct *tsk, |
93 | const nodemask_t *mask) | |
495789a5 | 94 | { |
6f48d0eb | 95 | struct task_struct *start = tsk; |
495789a5 | 96 | |
495789a5 | 97 | do { |
6f48d0eb DR |
98 | if (mask) { |
99 | /* | |
100 | * If this is a mempolicy constrained oom, tsk's | |
101 | * cpuset is irrelevant. Only return true if its | |
102 | * mempolicy intersects current, otherwise it may be | |
103 | * needlessly killed. | |
104 | */ | |
105 | if (mempolicy_nodemask_intersects(tsk, mask)) | |
106 | return true; | |
107 | } else { | |
108 | /* | |
109 | * This is not a mempolicy constrained oom, so only | |
110 | * check the mems of tsk's cpuset. | |
111 | */ | |
112 | if (cpuset_mems_allowed_intersects(current, tsk)) | |
113 | return true; | |
114 | } | |
df1090a8 KM |
115 | } while_each_thread(start, tsk); |
116 | ||
6f48d0eb DR |
117 | return false; |
118 | } | |
119 | #else | |
120 | static bool has_intersects_mems_allowed(struct task_struct *tsk, | |
121 | const nodemask_t *mask) | |
122 | { | |
123 | return true; | |
495789a5 | 124 | } |
6f48d0eb | 125 | #endif /* CONFIG_NUMA */ |
495789a5 | 126 | |
6f48d0eb DR |
127 | /* |
128 | * The process p may have detached its own ->mm while exiting or through | |
129 | * use_mm(), but one or more of its subthreads may still have a valid | |
130 | * pointer. Return p, or any of its subthreads with a valid ->mm, with | |
131 | * task_lock() held. | |
132 | */ | |
158e0a2d | 133 | struct task_struct *find_lock_task_mm(struct task_struct *p) |
dd8e8f40 ON |
134 | { |
135 | struct task_struct *t = p; | |
136 | ||
137 | do { | |
138 | task_lock(t); | |
139 | if (likely(t->mm)) | |
140 | return t; | |
141 | task_unlock(t); | |
142 | } while_each_thread(p, t); | |
143 | ||
144 | return NULL; | |
145 | } | |
146 | ||
ab290adb | 147 | /* return true if the task is not adequate as candidate victim task. */ |
e85bfd3a DR |
148 | static bool oom_unkillable_task(struct task_struct *p, |
149 | const struct mem_cgroup *mem, const nodemask_t *nodemask) | |
ab290adb KM |
150 | { |
151 | if (is_global_init(p)) | |
152 | return true; | |
153 | if (p->flags & PF_KTHREAD) | |
154 | return true; | |
155 | ||
156 | /* When mem_cgroup_out_of_memory() and p is not member of the group */ | |
157 | if (mem && !task_in_mem_cgroup(p, mem)) | |
158 | return true; | |
159 | ||
160 | /* p may not have freeable memory in nodemask */ | |
161 | if (!has_intersects_mems_allowed(p, nodemask)) | |
162 | return true; | |
163 | ||
164 | return false; | |
165 | } | |
166 | ||
1da177e4 | 167 | /** |
a63d83f4 | 168 | * oom_badness - heuristic function to determine which candidate task to kill |
1da177e4 | 169 | * @p: task struct of which task we should calculate |
a63d83f4 | 170 | * @totalpages: total present RAM allowed for page allocation |
1da177e4 | 171 | * |
a63d83f4 DR |
172 | * The heuristic for determining which task to kill is made to be as simple and |
173 | * predictable as possible. The goal is to return the highest value for the | |
174 | * task consuming the most memory to avoid subsequent oom failures. | |
1da177e4 | 175 | */ |
a63d83f4 DR |
176 | unsigned int oom_badness(struct task_struct *p, struct mem_cgroup *mem, |
177 | const nodemask_t *nodemask, unsigned long totalpages) | |
1da177e4 | 178 | { |
a63d83f4 | 179 | int points; |
28b83c51 | 180 | |
26ebc984 KM |
181 | if (oom_unkillable_task(p, mem, nodemask)) |
182 | return 0; | |
1da177e4 | 183 | |
dd8e8f40 ON |
184 | p = find_lock_task_mm(p); |
185 | if (!p) | |
1da177e4 LT |
186 | return 0; |
187 | ||
1da177e4 | 188 | /* |
a63d83f4 DR |
189 | * The memory controller may have a limit of 0 bytes, so avoid a divide |
190 | * by zero, if necessary. | |
1da177e4 | 191 | */ |
a63d83f4 DR |
192 | if (!totalpages) |
193 | totalpages = 1; | |
1da177e4 LT |
194 | |
195 | /* | |
a63d83f4 | 196 | * The baseline for the badness score is the proportion of RAM that each |
f755a042 | 197 | * task's rss, pagetable and swap space use. |
1da177e4 | 198 | */ |
f755a042 KM |
199 | points = get_mm_rss(p->mm) + p->mm->nr_ptes; |
200 | points += get_mm_counter(p->mm, MM_SWAPENTS); | |
201 | ||
202 | points *= 1000; | |
203 | points /= totalpages; | |
a63d83f4 | 204 | task_unlock(p); |
1da177e4 LT |
205 | |
206 | /* | |
a63d83f4 DR |
207 | * Root processes get 3% bonus, just like the __vm_enough_memory() |
208 | * implementation used by LSMs. | |
1da177e4 | 209 | */ |
a63d83f4 DR |
210 | if (has_capability_noaudit(p, CAP_SYS_ADMIN)) |
211 | points -= 30; | |
1da177e4 LT |
212 | |
213 | /* | |
a63d83f4 DR |
214 | * /proc/pid/oom_score_adj ranges from -1000 to +1000 such that it may |
215 | * either completely disable oom killing or always prefer a certain | |
216 | * task. | |
1da177e4 | 217 | */ |
a63d83f4 | 218 | points += p->signal->oom_score_adj; |
1da177e4 | 219 | |
f19e8aa1 DR |
220 | /* |
221 | * Never return 0 for an eligible task that may be killed since it's | |
222 | * possible that no single user task uses more than 0.1% of memory and | |
223 | * no single admin tasks uses more than 3.0%. | |
224 | */ | |
225 | if (points <= 0) | |
226 | return 1; | |
a63d83f4 | 227 | return (points < 1000) ? points : 1000; |
1da177e4 LT |
228 | } |
229 | ||
9b0f8b04 CL |
230 | /* |
231 | * Determine the type of allocation constraint. | |
232 | */ | |
9b0f8b04 | 233 | #ifdef CONFIG_NUMA |
4365a567 | 234 | static enum oom_constraint constrained_alloc(struct zonelist *zonelist, |
a63d83f4 DR |
235 | gfp_t gfp_mask, nodemask_t *nodemask, |
236 | unsigned long *totalpages) | |
4365a567 | 237 | { |
54a6eb5c | 238 | struct zone *zone; |
dd1a239f | 239 | struct zoneref *z; |
54a6eb5c | 240 | enum zone_type high_zoneidx = gfp_zone(gfp_mask); |
a63d83f4 DR |
241 | bool cpuset_limited = false; |
242 | int nid; | |
9b0f8b04 | 243 | |
a63d83f4 DR |
244 | /* Default to all available memory */ |
245 | *totalpages = totalram_pages + total_swap_pages; | |
246 | ||
247 | if (!zonelist) | |
248 | return CONSTRAINT_NONE; | |
4365a567 KH |
249 | /* |
250 | * Reach here only when __GFP_NOFAIL is used. So, we should avoid | |
251 | * to kill current.We have to random task kill in this case. | |
252 | * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now. | |
253 | */ | |
254 | if (gfp_mask & __GFP_THISNODE) | |
255 | return CONSTRAINT_NONE; | |
9b0f8b04 | 256 | |
4365a567 | 257 | /* |
a63d83f4 DR |
258 | * This is not a __GFP_THISNODE allocation, so a truncated nodemask in |
259 | * the page allocator means a mempolicy is in effect. Cpuset policy | |
260 | * is enforced in get_page_from_freelist(). | |
4365a567 | 261 | */ |
a63d83f4 DR |
262 | if (nodemask && !nodes_subset(node_states[N_HIGH_MEMORY], *nodemask)) { |
263 | *totalpages = total_swap_pages; | |
264 | for_each_node_mask(nid, *nodemask) | |
265 | *totalpages += node_spanned_pages(nid); | |
9b0f8b04 | 266 | return CONSTRAINT_MEMORY_POLICY; |
a63d83f4 | 267 | } |
4365a567 KH |
268 | |
269 | /* Check this allocation failure is caused by cpuset's wall function */ | |
270 | for_each_zone_zonelist_nodemask(zone, z, zonelist, | |
271 | high_zoneidx, nodemask) | |
272 | if (!cpuset_zone_allowed_softwall(zone, gfp_mask)) | |
a63d83f4 | 273 | cpuset_limited = true; |
9b0f8b04 | 274 | |
a63d83f4 DR |
275 | if (cpuset_limited) { |
276 | *totalpages = total_swap_pages; | |
277 | for_each_node_mask(nid, cpuset_current_mems_allowed) | |
278 | *totalpages += node_spanned_pages(nid); | |
279 | return CONSTRAINT_CPUSET; | |
280 | } | |
9b0f8b04 CL |
281 | return CONSTRAINT_NONE; |
282 | } | |
4365a567 KH |
283 | #else |
284 | static enum oom_constraint constrained_alloc(struct zonelist *zonelist, | |
a63d83f4 DR |
285 | gfp_t gfp_mask, nodemask_t *nodemask, |
286 | unsigned long *totalpages) | |
4365a567 | 287 | { |
a63d83f4 | 288 | *totalpages = totalram_pages + total_swap_pages; |
4365a567 KH |
289 | return CONSTRAINT_NONE; |
290 | } | |
291 | #endif | |
9b0f8b04 | 292 | |
1da177e4 LT |
293 | /* |
294 | * Simple selection loop. We chose the process with the highest | |
295 | * number of 'points'. We expect the caller will lock the tasklist. | |
296 | * | |
297 | * (not docbooked, we don't want this one cluttering up the manual) | |
298 | */ | |
a63d83f4 DR |
299 | static struct task_struct *select_bad_process(unsigned int *ppoints, |
300 | unsigned long totalpages, struct mem_cgroup *mem, | |
301 | const nodemask_t *nodemask) | |
1da177e4 | 302 | { |
3a5dda7a | 303 | struct task_struct *g, *p; |
1da177e4 | 304 | struct task_struct *chosen = NULL; |
9827b781 | 305 | *ppoints = 0; |
1da177e4 | 306 | |
3a5dda7a | 307 | do_each_thread(g, p) { |
a63d83f4 | 308 | unsigned int points; |
a49335cc | 309 | |
c027a474 | 310 | if (p->exit_state) |
30e2b41f | 311 | continue; |
ab290adb | 312 | if (oom_unkillable_task(p, mem, nodemask)) |
6cf86ac6 | 313 | continue; |
ef08e3b4 | 314 | |
b78483a4 NP |
315 | /* |
316 | * This task already has access to memory reserves and is | |
317 | * being killed. Don't allow any other task access to the | |
318 | * memory reserve. | |
319 | * | |
320 | * Note: this may have a chance of deadlock if it gets | |
321 | * blocked waiting for another task which itself is waiting | |
322 | * for memory. Is there a better alternative? | |
323 | */ | |
f660daac DR |
324 | if (test_tsk_thread_flag(p, TIF_MEMDIE)) { |
325 | if (unlikely(frozen(p))) | |
326 | thaw_process(p); | |
b78483a4 | 327 | return ERR_PTR(-1UL); |
f660daac | 328 | } |
c027a474 ON |
329 | if (!p->mm) |
330 | continue; | |
b78483a4 | 331 | |
30e2b41f | 332 | if (p->flags & PF_EXITING) { |
edd45544 DR |
333 | /* |
334 | * If p is the current task and is in the process of | |
335 | * releasing memory, we allow the "kill" to set | |
336 | * TIF_MEMDIE, which will allow it to gain access to | |
337 | * memory reserves. Otherwise, it may stall forever. | |
338 | * | |
339 | * The loop isn't broken here, however, in case other | |
340 | * threads are found to have already been oom killed. | |
341 | */ | |
342 | if (p == current) { | |
343 | chosen = p; | |
344 | *ppoints = 1000; | |
345 | } else { | |
346 | /* | |
347 | * If this task is not being ptraced on exit, | |
348 | * then wait for it to finish before killing | |
349 | * some other task unnecessarily. | |
350 | */ | |
d21142ec | 351 | if (!(p->group_leader->ptrace & PT_TRACE_EXIT)) |
edd45544 DR |
352 | return ERR_PTR(-1UL); |
353 | } | |
50ec3bbf | 354 | } |
972c4ea5 | 355 | |
a63d83f4 DR |
356 | points = oom_badness(p, mem, nodemask, totalpages); |
357 | if (points > *ppoints) { | |
a49335cc | 358 | chosen = p; |
9827b781 | 359 | *ppoints = points; |
1da177e4 | 360 | } |
3a5dda7a | 361 | } while_each_thread(g, p); |
972c4ea5 | 362 | |
1da177e4 LT |
363 | return chosen; |
364 | } | |
365 | ||
fef1bdd6 | 366 | /** |
1b578df0 | 367 | * dump_tasks - dump current memory state of all system tasks |
74ab7f1d | 368 | * @mem: current's memory controller, if constrained |
e85bfd3a | 369 | * @nodemask: nodemask passed to page allocator for mempolicy ooms |
1b578df0 | 370 | * |
e85bfd3a DR |
371 | * Dumps the current memory state of all eligible tasks. Tasks not in the same |
372 | * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes | |
373 | * are not shown. | |
fef1bdd6 | 374 | * State information includes task's pid, uid, tgid, vm size, rss, cpu, oom_adj |
a63d83f4 | 375 | * value, oom_score_adj value, and name. |
fef1bdd6 | 376 | * |
fef1bdd6 DR |
377 | * Call with tasklist_lock read-locked. |
378 | */ | |
e85bfd3a | 379 | static void dump_tasks(const struct mem_cgroup *mem, const nodemask_t *nodemask) |
fef1bdd6 | 380 | { |
c55db957 KM |
381 | struct task_struct *p; |
382 | struct task_struct *task; | |
fef1bdd6 | 383 | |
a63d83f4 | 384 | pr_info("[ pid ] uid tgid total_vm rss cpu oom_adj oom_score_adj name\n"); |
c55db957 | 385 | for_each_process(p) { |
e85bfd3a | 386 | if (oom_unkillable_task(p, mem, nodemask)) |
b4416d2b | 387 | continue; |
fef1bdd6 | 388 | |
c55db957 KM |
389 | task = find_lock_task_mm(p); |
390 | if (!task) { | |
6d2661ed | 391 | /* |
74ab7f1d DR |
392 | * This is a kthread or all of p's threads have already |
393 | * detached their mm's. There's no need to report | |
c55db957 | 394 | * them; they can't be oom killed anyway. |
6d2661ed | 395 | */ |
6d2661ed DR |
396 | continue; |
397 | } | |
c55db957 | 398 | |
a63d83f4 | 399 | pr_info("[%5d] %5d %5d %8lu %8lu %3u %3d %5d %s\n", |
8d6c83f0 | 400 | task->pid, task_uid(task), task->tgid, |
a63d83f4 DR |
401 | task->mm->total_vm, get_mm_rss(task->mm), |
402 | task_cpu(task), task->signal->oom_adj, | |
403 | task->signal->oom_score_adj, task->comm); | |
c55db957 KM |
404 | task_unlock(task); |
405 | } | |
fef1bdd6 DR |
406 | } |
407 | ||
d31f56db | 408 | static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order, |
e85bfd3a | 409 | struct mem_cgroup *mem, const nodemask_t *nodemask) |
1b604d75 | 410 | { |
5e9d834a | 411 | task_lock(current); |
1b604d75 | 412 | pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, " |
a63d83f4 DR |
413 | "oom_adj=%d, oom_score_adj=%d\n", |
414 | current->comm, gfp_mask, order, current->signal->oom_adj, | |
415 | current->signal->oom_score_adj); | |
1b604d75 DR |
416 | cpuset_print_task_mems_allowed(current); |
417 | task_unlock(current); | |
418 | dump_stack(); | |
d31f56db | 419 | mem_cgroup_print_oom_info(mem, p); |
b2b755b5 | 420 | show_mem(SHOW_MEM_FILTER_NODES); |
1b604d75 | 421 | if (sysctl_oom_dump_tasks) |
e85bfd3a | 422 | dump_tasks(mem, nodemask); |
1b604d75 DR |
423 | } |
424 | ||
3b4798cb | 425 | #define K(x) ((x) << (PAGE_SHIFT-10)) |
93b43fa5 | 426 | static int oom_kill_task(struct task_struct *p, struct mem_cgroup *mem) |
1da177e4 | 427 | { |
1e99bad0 DR |
428 | struct task_struct *q; |
429 | struct mm_struct *mm; | |
430 | ||
dd8e8f40 | 431 | p = find_lock_task_mm(p); |
be71cf22 | 432 | if (!p) |
b940fd70 | 433 | return 1; |
be71cf22 | 434 | |
1e99bad0 DR |
435 | /* mm cannot be safely dereferenced after task_unlock(p) */ |
436 | mm = p->mm; | |
437 | ||
b940fd70 DR |
438 | pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n", |
439 | task_pid_nr(p), p->comm, K(p->mm->total_vm), | |
440 | K(get_mm_counter(p->mm, MM_ANONPAGES)), | |
441 | K(get_mm_counter(p->mm, MM_FILEPAGES))); | |
3b4798cb | 442 | task_unlock(p); |
1da177e4 | 443 | |
1e99bad0 | 444 | /* |
7b0d44fa | 445 | * Kill all user processes sharing p->mm in other thread groups, if any. |
1e99bad0 DR |
446 | * They don't get access to memory reserves or a higher scheduler |
447 | * priority, though, to avoid depletion of all memory or task | |
448 | * starvation. This prevents mm->mmap_sem livelock when an oom killed | |
449 | * task cannot exit because it requires the semaphore and its contended | |
450 | * by another thread trying to allocate memory itself. That thread will | |
451 | * now get access to memory reserves since it has a pending fatal | |
452 | * signal. | |
453 | */ | |
454 | for_each_process(q) | |
7b0d44fa DR |
455 | if (q->mm == mm && !same_thread_group(q, p) && |
456 | !(q->flags & PF_KTHREAD)) { | |
c9f01245 DR |
457 | if (q->signal->oom_score_adj == OOM_SCORE_ADJ_MIN) |
458 | continue; | |
459 | ||
1e99bad0 DR |
460 | task_lock(q); /* Protect ->comm from prctl() */ |
461 | pr_err("Kill process %d (%s) sharing same memory\n", | |
462 | task_pid_nr(q), q->comm); | |
463 | task_unlock(q); | |
464 | force_sig(SIGKILL, q); | |
465 | } | |
93b43fa5 | 466 | |
1da177e4 | 467 | set_tsk_thread_flag(p, TIF_MEMDIE); |
1da177e4 | 468 | force_sig(SIGKILL, p); |
93b43fa5 | 469 | |
01315922 | 470 | return 0; |
1da177e4 | 471 | } |
b940fd70 | 472 | #undef K |
1da177e4 | 473 | |
7213f506 | 474 | static int oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order, |
a63d83f4 DR |
475 | unsigned int points, unsigned long totalpages, |
476 | struct mem_cgroup *mem, nodemask_t *nodemask, | |
477 | const char *message) | |
1da177e4 | 478 | { |
52d3c036 | 479 | struct task_struct *victim = p; |
5e9d834a | 480 | struct task_struct *child; |
52d3c036 LT |
481 | struct task_struct *t = p; |
482 | unsigned int victim_points = 0; | |
1da177e4 | 483 | |
1b604d75 | 484 | if (printk_ratelimit()) |
e85bfd3a | 485 | dump_header(p, gfp_mask, order, mem, nodemask); |
7213f506 | 486 | |
50ec3bbf NP |
487 | /* |
488 | * If the task is already exiting, don't alarm the sysadmin or kill | |
489 | * its children or threads, just set TIF_MEMDIE so it can die quickly | |
490 | */ | |
0753ba01 | 491 | if (p->flags & PF_EXITING) { |
4358997a | 492 | set_tsk_thread_flag(p, TIF_MEMDIE); |
50ec3bbf NP |
493 | return 0; |
494 | } | |
495 | ||
5e9d834a | 496 | task_lock(p); |
a63d83f4 | 497 | pr_err("%s: Kill process %d (%s) score %d or sacrifice child\n", |
5e9d834a DR |
498 | message, task_pid_nr(p), p->comm, points); |
499 | task_unlock(p); | |
f3af38d3 | 500 | |
5e9d834a DR |
501 | /* |
502 | * If any of p's children has a different mm and is eligible for kill, | |
11239836 | 503 | * the one with the highest oom_badness() score is sacrificed for its |
5e9d834a DR |
504 | * parent. This attempts to lose the minimal amount of work done while |
505 | * still freeing memory. | |
506 | */ | |
dd8e8f40 | 507 | do { |
5e9d834a | 508 | list_for_each_entry(child, &t->children, sibling) { |
a63d83f4 | 509 | unsigned int child_points; |
5e9d834a | 510 | |
edd45544 DR |
511 | if (child->mm == p->mm) |
512 | continue; | |
a63d83f4 DR |
513 | /* |
514 | * oom_badness() returns 0 if the thread is unkillable | |
515 | */ | |
516 | child_points = oom_badness(child, mem, nodemask, | |
517 | totalpages); | |
5e9d834a DR |
518 | if (child_points > victim_points) { |
519 | victim = child; | |
520 | victim_points = child_points; | |
521 | } | |
dd8e8f40 ON |
522 | } |
523 | } while_each_thread(p, t); | |
524 | ||
93b43fa5 | 525 | return oom_kill_task(victim, mem); |
1da177e4 LT |
526 | } |
527 | ||
309ed882 DR |
528 | /* |
529 | * Determines whether the kernel must panic because of the panic_on_oom sysctl. | |
530 | */ | |
531 | static void check_panic_on_oom(enum oom_constraint constraint, gfp_t gfp_mask, | |
e85bfd3a | 532 | int order, const nodemask_t *nodemask) |
309ed882 DR |
533 | { |
534 | if (likely(!sysctl_panic_on_oom)) | |
535 | return; | |
536 | if (sysctl_panic_on_oom != 2) { | |
537 | /* | |
538 | * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel | |
539 | * does not panic for cpuset, mempolicy, or memcg allocation | |
540 | * failures. | |
541 | */ | |
542 | if (constraint != CONSTRAINT_NONE) | |
543 | return; | |
544 | } | |
545 | read_lock(&tasklist_lock); | |
e85bfd3a | 546 | dump_header(NULL, gfp_mask, order, NULL, nodemask); |
309ed882 DR |
547 | read_unlock(&tasklist_lock); |
548 | panic("Out of memory: %s panic_on_oom is enabled\n", | |
549 | sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide"); | |
550 | } | |
551 | ||
00f0b825 | 552 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR |
c7ba5c9e PE |
553 | void mem_cgroup_out_of_memory(struct mem_cgroup *mem, gfp_t gfp_mask) |
554 | { | |
a63d83f4 DR |
555 | unsigned long limit; |
556 | unsigned int points = 0; | |
c7ba5c9e PE |
557 | struct task_struct *p; |
558 | ||
f9434ad1 DR |
559 | /* |
560 | * If current has a pending SIGKILL, then automatically select it. The | |
561 | * goal is to allow it to allocate so that it may quickly exit and free | |
562 | * its memory. | |
563 | */ | |
564 | if (fatal_signal_pending(current)) { | |
565 | set_thread_flag(TIF_MEMDIE); | |
f9434ad1 DR |
566 | return; |
567 | } | |
568 | ||
e85bfd3a | 569 | check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, 0, NULL); |
a63d83f4 | 570 | limit = mem_cgroup_get_limit(mem) >> PAGE_SHIFT; |
e115f2d8 | 571 | read_lock(&tasklist_lock); |
c7ba5c9e | 572 | retry: |
a63d83f4 | 573 | p = select_bad_process(&points, limit, mem, NULL); |
df64f81b | 574 | if (!p || PTR_ERR(p) == -1UL) |
c7ba5c9e PE |
575 | goto out; |
576 | ||
a63d83f4 | 577 | if (oom_kill_process(p, gfp_mask, 0, points, limit, mem, NULL, |
c7ba5c9e PE |
578 | "Memory cgroup out of memory")) |
579 | goto retry; | |
580 | out: | |
e115f2d8 | 581 | read_unlock(&tasklist_lock); |
c7ba5c9e PE |
582 | } |
583 | #endif | |
584 | ||
8bc719d3 MS |
585 | static BLOCKING_NOTIFIER_HEAD(oom_notify_list); |
586 | ||
587 | int register_oom_notifier(struct notifier_block *nb) | |
588 | { | |
589 | return blocking_notifier_chain_register(&oom_notify_list, nb); | |
590 | } | |
591 | EXPORT_SYMBOL_GPL(register_oom_notifier); | |
592 | ||
593 | int unregister_oom_notifier(struct notifier_block *nb) | |
594 | { | |
595 | return blocking_notifier_chain_unregister(&oom_notify_list, nb); | |
596 | } | |
597 | EXPORT_SYMBOL_GPL(unregister_oom_notifier); | |
598 | ||
098d7f12 DR |
599 | /* |
600 | * Try to acquire the OOM killer lock for the zones in zonelist. Returns zero | |
601 | * if a parallel OOM killing is already taking place that includes a zone in | |
602 | * the zonelist. Otherwise, locks all zones in the zonelist and returns 1. | |
603 | */ | |
ff321fea | 604 | int try_set_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask) |
098d7f12 | 605 | { |
dd1a239f MG |
606 | struct zoneref *z; |
607 | struct zone *zone; | |
098d7f12 DR |
608 | int ret = 1; |
609 | ||
c7d4caeb | 610 | spin_lock(&zone_scan_lock); |
dd1a239f MG |
611 | for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) { |
612 | if (zone_is_oom_locked(zone)) { | |
098d7f12 DR |
613 | ret = 0; |
614 | goto out; | |
615 | } | |
dd1a239f MG |
616 | } |
617 | ||
618 | for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) { | |
619 | /* | |
c7d4caeb | 620 | * Lock each zone in the zonelist under zone_scan_lock so a |
ff321fea | 621 | * parallel invocation of try_set_zonelist_oom() doesn't succeed |
dd1a239f MG |
622 | * when it shouldn't. |
623 | */ | |
624 | zone_set_flag(zone, ZONE_OOM_LOCKED); | |
625 | } | |
098d7f12 | 626 | |
098d7f12 | 627 | out: |
c7d4caeb | 628 | spin_unlock(&zone_scan_lock); |
098d7f12 DR |
629 | return ret; |
630 | } | |
631 | ||
632 | /* | |
633 | * Clears the ZONE_OOM_LOCKED flag for all zones in the zonelist so that failed | |
634 | * allocation attempts with zonelists containing them may now recall the OOM | |
635 | * killer, if necessary. | |
636 | */ | |
dd1a239f | 637 | void clear_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask) |
098d7f12 | 638 | { |
dd1a239f MG |
639 | struct zoneref *z; |
640 | struct zone *zone; | |
098d7f12 | 641 | |
c7d4caeb | 642 | spin_lock(&zone_scan_lock); |
dd1a239f MG |
643 | for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) { |
644 | zone_clear_flag(zone, ZONE_OOM_LOCKED); | |
645 | } | |
c7d4caeb | 646 | spin_unlock(&zone_scan_lock); |
098d7f12 DR |
647 | } |
648 | ||
e3658932 DR |
649 | /* |
650 | * Try to acquire the oom killer lock for all system zones. Returns zero if a | |
651 | * parallel oom killing is taking place, otherwise locks all zones and returns | |
652 | * non-zero. | |
653 | */ | |
654 | static int try_set_system_oom(void) | |
655 | { | |
656 | struct zone *zone; | |
657 | int ret = 1; | |
658 | ||
659 | spin_lock(&zone_scan_lock); | |
660 | for_each_populated_zone(zone) | |
661 | if (zone_is_oom_locked(zone)) { | |
662 | ret = 0; | |
663 | goto out; | |
664 | } | |
665 | for_each_populated_zone(zone) | |
666 | zone_set_flag(zone, ZONE_OOM_LOCKED); | |
667 | out: | |
668 | spin_unlock(&zone_scan_lock); | |
669 | return ret; | |
670 | } | |
671 | ||
672 | /* | |
673 | * Clears ZONE_OOM_LOCKED for all system zones so that failed allocation | |
674 | * attempts or page faults may now recall the oom killer, if necessary. | |
675 | */ | |
676 | static void clear_system_oom(void) | |
677 | { | |
678 | struct zone *zone; | |
679 | ||
680 | spin_lock(&zone_scan_lock); | |
681 | for_each_populated_zone(zone) | |
682 | zone_clear_flag(zone, ZONE_OOM_LOCKED); | |
683 | spin_unlock(&zone_scan_lock); | |
684 | } | |
685 | ||
1da177e4 | 686 | /** |
6937a25c | 687 | * out_of_memory - kill the "best" process when we run out of memory |
1b578df0 RD |
688 | * @zonelist: zonelist pointer |
689 | * @gfp_mask: memory allocation flags | |
690 | * @order: amount of memory being requested as a power of 2 | |
6f48d0eb | 691 | * @nodemask: nodemask passed to page allocator |
1da177e4 LT |
692 | * |
693 | * If we run out of memory, we have the choice between either | |
694 | * killing a random task (bad), letting the system crash (worse) | |
695 | * OR try to be smart about which process to kill. Note that we | |
696 | * don't have to be perfect here, we just have to be good. | |
697 | */ | |
4365a567 KH |
698 | void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask, |
699 | int order, nodemask_t *nodemask) | |
1da177e4 | 700 | { |
e85bfd3a | 701 | const nodemask_t *mpol_mask; |
0aad4b31 | 702 | struct task_struct *p; |
a63d83f4 | 703 | unsigned long totalpages; |
8bc719d3 | 704 | unsigned long freed = 0; |
a63d83f4 | 705 | unsigned int points; |
e3658932 | 706 | enum oom_constraint constraint = CONSTRAINT_NONE; |
b52723c5 | 707 | int killed = 0; |
8bc719d3 MS |
708 | |
709 | blocking_notifier_call_chain(&oom_notify_list, 0, &freed); | |
710 | if (freed > 0) | |
711 | /* Got some memory back in the last second. */ | |
712 | return; | |
1da177e4 | 713 | |
7b98c2e4 DR |
714 | /* |
715 | * If current has a pending SIGKILL, then automatically select it. The | |
716 | * goal is to allow it to allocate so that it may quickly exit and free | |
717 | * its memory. | |
718 | */ | |
719 | if (fatal_signal_pending(current)) { | |
720 | set_thread_flag(TIF_MEMDIE); | |
721 | return; | |
722 | } | |
723 | ||
9b0f8b04 CL |
724 | /* |
725 | * Check if there were limitations on the allocation (only relevant for | |
726 | * NUMA) that may require different handling. | |
727 | */ | |
a63d83f4 DR |
728 | constraint = constrained_alloc(zonelist, gfp_mask, nodemask, |
729 | &totalpages); | |
e85bfd3a DR |
730 | mpol_mask = (constraint == CONSTRAINT_MEMORY_POLICY) ? nodemask : NULL; |
731 | check_panic_on_oom(constraint, gfp_mask, order, mpol_mask); | |
0aad4b31 | 732 | |
2b45ab33 | 733 | read_lock(&tasklist_lock); |
f88ccad5 | 734 | if (sysctl_oom_kill_allocating_task && |
a96cfd6e | 735 | !oom_unkillable_task(current, NULL, nodemask) && |
c9f01245 | 736 | current->mm) { |
0aad4b31 DR |
737 | /* |
738 | * oom_kill_process() needs tasklist_lock held. If it returns | |
739 | * non-zero, current could not be killed so we must fallback to | |
740 | * the tasklist scan. | |
741 | */ | |
a63d83f4 DR |
742 | if (!oom_kill_process(current, gfp_mask, order, 0, totalpages, |
743 | NULL, nodemask, | |
0aad4b31 | 744 | "Out of memory (oom_kill_allocating_task)")) |
b52723c5 | 745 | goto out; |
0aad4b31 DR |
746 | } |
747 | ||
748 | retry: | |
e85bfd3a | 749 | p = select_bad_process(&points, totalpages, NULL, mpol_mask); |
0aad4b31 | 750 | if (PTR_ERR(p) == -1UL) |
b52723c5 | 751 | goto out; |
0aad4b31 DR |
752 | |
753 | /* Found nothing?!?! Either we hang forever, or we panic. */ | |
754 | if (!p) { | |
e85bfd3a | 755 | dump_header(NULL, gfp_mask, order, NULL, mpol_mask); |
0aad4b31 DR |
756 | read_unlock(&tasklist_lock); |
757 | panic("Out of memory and no killable processes...\n"); | |
758 | } | |
759 | ||
a63d83f4 DR |
760 | if (oom_kill_process(p, gfp_mask, order, points, totalpages, NULL, |
761 | nodemask, "Out of memory")) | |
0aad4b31 | 762 | goto retry; |
b52723c5 KM |
763 | killed = 1; |
764 | out: | |
140ffcec | 765 | read_unlock(&tasklist_lock); |
1da177e4 LT |
766 | |
767 | /* | |
768 | * Give "p" a good chance of killing itself before we | |
2f659f46 | 769 | * retry to allocate memory unless "p" is current |
1da177e4 | 770 | */ |
b52723c5 | 771 | if (killed && !test_thread_flag(TIF_MEMDIE)) |
140ffcec | 772 | schedule_timeout_uninterruptible(1); |
1da177e4 | 773 | } |
e3658932 DR |
774 | |
775 | /* | |
776 | * The pagefault handler calls here because it is out of memory, so kill a | |
777 | * memory-hogging task. If a populated zone has ZONE_OOM_LOCKED set, a parallel | |
778 | * oom killing is already in progress so do nothing. If a task is found with | |
779 | * TIF_MEMDIE set, it has been killed so do nothing and allow it to exit. | |
780 | */ | |
781 | void pagefault_out_of_memory(void) | |
782 | { | |
783 | if (try_set_system_oom()) { | |
784 | out_of_memory(NULL, 0, 0, NULL); | |
785 | clear_system_oom(); | |
786 | } | |
787 | if (!test_thread_flag(TIF_MEMDIE)) | |
788 | schedule_timeout_uninterruptible(1); | |
789 | } |