]>
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> |
b95f1b31 | 29 | #include <linux/export.h> |
8bc719d3 | 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> |
43d2b113 | 36 | #include <linux/ftrace.h> |
dc3f21ea | 37 | #include <linux/ratelimit.h> |
43d2b113 KH |
38 | |
39 | #define CREATE_TRACE_POINTS | |
40 | #include <trace/events/oom.h> | |
1da177e4 | 41 | |
fadd8fbd | 42 | int sysctl_panic_on_oom; |
fe071d7e | 43 | int sysctl_oom_kill_allocating_task; |
ad915c43 | 44 | int sysctl_oom_dump_tasks = 1; |
dc56401f JW |
45 | |
46 | DEFINE_MUTEX(oom_lock); | |
1da177e4 | 47 | |
6f48d0eb DR |
48 | #ifdef CONFIG_NUMA |
49 | /** | |
50 | * has_intersects_mems_allowed() - check task eligiblity for kill | |
ad962441 | 51 | * @start: task struct of which task to consider |
6f48d0eb DR |
52 | * @mask: nodemask passed to page allocator for mempolicy ooms |
53 | * | |
54 | * Task eligibility is determined by whether or not a candidate task, @tsk, | |
55 | * shares the same mempolicy nodes as current if it is bound by such a policy | |
56 | * and whether or not it has the same set of allowed cpuset nodes. | |
495789a5 | 57 | */ |
ad962441 | 58 | static bool has_intersects_mems_allowed(struct task_struct *start, |
6f48d0eb | 59 | const nodemask_t *mask) |
495789a5 | 60 | { |
ad962441 ON |
61 | struct task_struct *tsk; |
62 | bool ret = false; | |
495789a5 | 63 | |
ad962441 | 64 | rcu_read_lock(); |
1da4db0c | 65 | for_each_thread(start, tsk) { |
6f48d0eb DR |
66 | if (mask) { |
67 | /* | |
68 | * If this is a mempolicy constrained oom, tsk's | |
69 | * cpuset is irrelevant. Only return true if its | |
70 | * mempolicy intersects current, otherwise it may be | |
71 | * needlessly killed. | |
72 | */ | |
ad962441 | 73 | ret = mempolicy_nodemask_intersects(tsk, mask); |
6f48d0eb DR |
74 | } else { |
75 | /* | |
76 | * This is not a mempolicy constrained oom, so only | |
77 | * check the mems of tsk's cpuset. | |
78 | */ | |
ad962441 | 79 | ret = cpuset_mems_allowed_intersects(current, tsk); |
6f48d0eb | 80 | } |
ad962441 ON |
81 | if (ret) |
82 | break; | |
1da4db0c | 83 | } |
ad962441 | 84 | rcu_read_unlock(); |
df1090a8 | 85 | |
ad962441 | 86 | return ret; |
6f48d0eb DR |
87 | } |
88 | #else | |
89 | static bool has_intersects_mems_allowed(struct task_struct *tsk, | |
90 | const nodemask_t *mask) | |
91 | { | |
92 | return true; | |
495789a5 | 93 | } |
6f48d0eb | 94 | #endif /* CONFIG_NUMA */ |
495789a5 | 95 | |
6f48d0eb DR |
96 | /* |
97 | * The process p may have detached its own ->mm while exiting or through | |
98 | * use_mm(), but one or more of its subthreads may still have a valid | |
99 | * pointer. Return p, or any of its subthreads with a valid ->mm, with | |
100 | * task_lock() held. | |
101 | */ | |
158e0a2d | 102 | struct task_struct *find_lock_task_mm(struct task_struct *p) |
dd8e8f40 | 103 | { |
1da4db0c | 104 | struct task_struct *t; |
dd8e8f40 | 105 | |
4d4048be ON |
106 | rcu_read_lock(); |
107 | ||
1da4db0c | 108 | for_each_thread(p, t) { |
dd8e8f40 ON |
109 | task_lock(t); |
110 | if (likely(t->mm)) | |
4d4048be | 111 | goto found; |
dd8e8f40 | 112 | task_unlock(t); |
1da4db0c | 113 | } |
4d4048be ON |
114 | t = NULL; |
115 | found: | |
116 | rcu_read_unlock(); | |
dd8e8f40 | 117 | |
4d4048be | 118 | return t; |
dd8e8f40 ON |
119 | } |
120 | ||
db2a0dd7 YB |
121 | /* |
122 | * order == -1 means the oom kill is required by sysrq, otherwise only | |
123 | * for display purposes. | |
124 | */ | |
125 | static inline bool is_sysrq_oom(struct oom_control *oc) | |
126 | { | |
127 | return oc->order == -1; | |
128 | } | |
129 | ||
ab290adb | 130 | /* return true if the task is not adequate as candidate victim task. */ |
e85bfd3a | 131 | static bool oom_unkillable_task(struct task_struct *p, |
2314b42d | 132 | struct mem_cgroup *memcg, const nodemask_t *nodemask) |
ab290adb KM |
133 | { |
134 | if (is_global_init(p)) | |
135 | return true; | |
136 | if (p->flags & PF_KTHREAD) | |
137 | return true; | |
138 | ||
139 | /* When mem_cgroup_out_of_memory() and p is not member of the group */ | |
72835c86 | 140 | if (memcg && !task_in_mem_cgroup(p, memcg)) |
ab290adb KM |
141 | return true; |
142 | ||
143 | /* p may not have freeable memory in nodemask */ | |
144 | if (!has_intersects_mems_allowed(p, nodemask)) | |
145 | return true; | |
146 | ||
147 | return false; | |
148 | } | |
149 | ||
1da177e4 | 150 | /** |
a63d83f4 | 151 | * oom_badness - heuristic function to determine which candidate task to kill |
1da177e4 | 152 | * @p: task struct of which task we should calculate |
a63d83f4 | 153 | * @totalpages: total present RAM allowed for page allocation |
1da177e4 | 154 | * |
a63d83f4 DR |
155 | * The heuristic for determining which task to kill is made to be as simple and |
156 | * predictable as possible. The goal is to return the highest value for the | |
157 | * task consuming the most memory to avoid subsequent oom failures. | |
1da177e4 | 158 | */ |
a7f638f9 DR |
159 | unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg, |
160 | const nodemask_t *nodemask, unsigned long totalpages) | |
1da177e4 | 161 | { |
1e11ad8d | 162 | long points; |
61eafb00 | 163 | long adj; |
28b83c51 | 164 | |
72835c86 | 165 | if (oom_unkillable_task(p, memcg, nodemask)) |
26ebc984 | 166 | return 0; |
1da177e4 | 167 | |
dd8e8f40 ON |
168 | p = find_lock_task_mm(p); |
169 | if (!p) | |
1da177e4 LT |
170 | return 0; |
171 | ||
a9c58b90 | 172 | adj = (long)p->signal->oom_score_adj; |
61eafb00 | 173 | if (adj == OOM_SCORE_ADJ_MIN) { |
5aecc85a MH |
174 | task_unlock(p); |
175 | return 0; | |
176 | } | |
177 | ||
1da177e4 | 178 | /* |
a63d83f4 | 179 | * The baseline for the badness score is the proportion of RAM that each |
f755a042 | 180 | * task's rss, pagetable and swap space use. |
1da177e4 | 181 | */ |
dc6c9a35 KS |
182 | points = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) + |
183 | atomic_long_read(&p->mm->nr_ptes) + mm_nr_pmds(p->mm); | |
a63d83f4 | 184 | task_unlock(p); |
1da177e4 LT |
185 | |
186 | /* | |
a63d83f4 DR |
187 | * Root processes get 3% bonus, just like the __vm_enough_memory() |
188 | * implementation used by LSMs. | |
1da177e4 | 189 | */ |
a63d83f4 | 190 | if (has_capability_noaudit(p, CAP_SYS_ADMIN)) |
778c14af | 191 | points -= (points * 3) / 100; |
1da177e4 | 192 | |
61eafb00 DR |
193 | /* Normalize to oom_score_adj units */ |
194 | adj *= totalpages / 1000; | |
195 | points += adj; | |
1da177e4 | 196 | |
f19e8aa1 | 197 | /* |
a7f638f9 DR |
198 | * Never return 0 for an eligible task regardless of the root bonus and |
199 | * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here). | |
f19e8aa1 | 200 | */ |
1e11ad8d | 201 | return points > 0 ? points : 1; |
1da177e4 LT |
202 | } |
203 | ||
9b0f8b04 CL |
204 | /* |
205 | * Determine the type of allocation constraint. | |
206 | */ | |
9b0f8b04 | 207 | #ifdef CONFIG_NUMA |
6e0fc46d DR |
208 | static enum oom_constraint constrained_alloc(struct oom_control *oc, |
209 | unsigned long *totalpages) | |
4365a567 | 210 | { |
54a6eb5c | 211 | struct zone *zone; |
dd1a239f | 212 | struct zoneref *z; |
6e0fc46d | 213 | enum zone_type high_zoneidx = gfp_zone(oc->gfp_mask); |
a63d83f4 DR |
214 | bool cpuset_limited = false; |
215 | int nid; | |
9b0f8b04 | 216 | |
a63d83f4 DR |
217 | /* Default to all available memory */ |
218 | *totalpages = totalram_pages + total_swap_pages; | |
219 | ||
6e0fc46d | 220 | if (!oc->zonelist) |
a63d83f4 | 221 | return CONSTRAINT_NONE; |
4365a567 KH |
222 | /* |
223 | * Reach here only when __GFP_NOFAIL is used. So, we should avoid | |
224 | * to kill current.We have to random task kill in this case. | |
225 | * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now. | |
226 | */ | |
6e0fc46d | 227 | if (oc->gfp_mask & __GFP_THISNODE) |
4365a567 | 228 | return CONSTRAINT_NONE; |
9b0f8b04 | 229 | |
4365a567 | 230 | /* |
a63d83f4 DR |
231 | * This is not a __GFP_THISNODE allocation, so a truncated nodemask in |
232 | * the page allocator means a mempolicy is in effect. Cpuset policy | |
233 | * is enforced in get_page_from_freelist(). | |
4365a567 | 234 | */ |
6e0fc46d DR |
235 | if (oc->nodemask && |
236 | !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) { | |
a63d83f4 | 237 | *totalpages = total_swap_pages; |
6e0fc46d | 238 | for_each_node_mask(nid, *oc->nodemask) |
a63d83f4 | 239 | *totalpages += node_spanned_pages(nid); |
9b0f8b04 | 240 | return CONSTRAINT_MEMORY_POLICY; |
a63d83f4 | 241 | } |
4365a567 KH |
242 | |
243 | /* Check this allocation failure is caused by cpuset's wall function */ | |
6e0fc46d DR |
244 | for_each_zone_zonelist_nodemask(zone, z, oc->zonelist, |
245 | high_zoneidx, oc->nodemask) | |
246 | if (!cpuset_zone_allowed(zone, oc->gfp_mask)) | |
a63d83f4 | 247 | cpuset_limited = true; |
9b0f8b04 | 248 | |
a63d83f4 DR |
249 | if (cpuset_limited) { |
250 | *totalpages = total_swap_pages; | |
251 | for_each_node_mask(nid, cpuset_current_mems_allowed) | |
252 | *totalpages += node_spanned_pages(nid); | |
253 | return CONSTRAINT_CPUSET; | |
254 | } | |
9b0f8b04 CL |
255 | return CONSTRAINT_NONE; |
256 | } | |
4365a567 | 257 | #else |
6e0fc46d DR |
258 | static enum oom_constraint constrained_alloc(struct oom_control *oc, |
259 | unsigned long *totalpages) | |
4365a567 | 260 | { |
a63d83f4 | 261 | *totalpages = totalram_pages + total_swap_pages; |
4365a567 KH |
262 | return CONSTRAINT_NONE; |
263 | } | |
264 | #endif | |
9b0f8b04 | 265 | |
6e0fc46d DR |
266 | enum oom_scan_t oom_scan_process_thread(struct oom_control *oc, |
267 | struct task_struct *task, unsigned long totalpages) | |
462607ec | 268 | { |
6e0fc46d | 269 | if (oom_unkillable_task(task, NULL, oc->nodemask)) |
462607ec DR |
270 | return OOM_SCAN_CONTINUE; |
271 | ||
272 | /* | |
273 | * This task already has access to memory reserves and is being killed. | |
274 | * Don't allow any other task to have access to the reserves. | |
275 | */ | |
276 | if (test_tsk_thread_flag(task, TIF_MEMDIE)) { | |
db2a0dd7 | 277 | if (!is_sysrq_oom(oc)) |
462607ec DR |
278 | return OOM_SCAN_ABORT; |
279 | } | |
280 | if (!task->mm) | |
281 | return OOM_SCAN_CONTINUE; | |
282 | ||
e1e12d2f DR |
283 | /* |
284 | * If task is allocating a lot of memory and has been marked to be | |
285 | * killed first if it triggers an oom, then select it. | |
286 | */ | |
287 | if (oom_task_origin(task)) | |
288 | return OOM_SCAN_SELECT; | |
289 | ||
db2a0dd7 | 290 | if (task_will_free_mem(task) && !is_sysrq_oom(oc)) |
6a2d5679 ON |
291 | return OOM_SCAN_ABORT; |
292 | ||
462607ec DR |
293 | return OOM_SCAN_OK; |
294 | } | |
295 | ||
1da177e4 LT |
296 | /* |
297 | * Simple selection loop. We chose the process with the highest | |
6b4f2b56 | 298 | * number of 'points'. Returns -1 on scan abort. |
1da177e4 | 299 | */ |
6e0fc46d DR |
300 | static struct task_struct *select_bad_process(struct oom_control *oc, |
301 | unsigned int *ppoints, unsigned long totalpages) | |
1da177e4 | 302 | { |
3a5dda7a | 303 | struct task_struct *g, *p; |
1da177e4 | 304 | struct task_struct *chosen = NULL; |
a7f638f9 | 305 | unsigned long chosen_points = 0; |
1da177e4 | 306 | |
6b0c81b3 | 307 | rcu_read_lock(); |
1da4db0c | 308 | for_each_process_thread(g, p) { |
a63d83f4 | 309 | unsigned int points; |
a49335cc | 310 | |
6e0fc46d | 311 | switch (oom_scan_process_thread(oc, p, totalpages)) { |
462607ec DR |
312 | case OOM_SCAN_SELECT: |
313 | chosen = p; | |
314 | chosen_points = ULONG_MAX; | |
315 | /* fall through */ | |
316 | case OOM_SCAN_CONTINUE: | |
c027a474 | 317 | continue; |
462607ec | 318 | case OOM_SCAN_ABORT: |
6b0c81b3 | 319 | rcu_read_unlock(); |
6b4f2b56 | 320 | return (struct task_struct *)(-1UL); |
462607ec DR |
321 | case OOM_SCAN_OK: |
322 | break; | |
323 | }; | |
6e0fc46d | 324 | points = oom_badness(p, NULL, oc->nodemask, totalpages); |
d49ad935 DR |
325 | if (!points || points < chosen_points) |
326 | continue; | |
327 | /* Prefer thread group leaders for display purposes */ | |
328 | if (points == chosen_points && thread_group_leader(chosen)) | |
329 | continue; | |
330 | ||
331 | chosen = p; | |
332 | chosen_points = points; | |
1da4db0c | 333 | } |
6b0c81b3 DR |
334 | if (chosen) |
335 | get_task_struct(chosen); | |
336 | rcu_read_unlock(); | |
972c4ea5 | 337 | |
a7f638f9 | 338 | *ppoints = chosen_points * 1000 / totalpages; |
1da177e4 LT |
339 | return chosen; |
340 | } | |
341 | ||
fef1bdd6 | 342 | /** |
1b578df0 | 343 | * dump_tasks - dump current memory state of all system tasks |
dad7557e | 344 | * @memcg: current's memory controller, if constrained |
e85bfd3a | 345 | * @nodemask: nodemask passed to page allocator for mempolicy ooms |
1b578df0 | 346 | * |
e85bfd3a DR |
347 | * Dumps the current memory state of all eligible tasks. Tasks not in the same |
348 | * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes | |
349 | * are not shown. | |
de34d965 DR |
350 | * State information includes task's pid, uid, tgid, vm size, rss, nr_ptes, |
351 | * swapents, oom_score_adj value, and name. | |
fef1bdd6 | 352 | */ |
2314b42d | 353 | static void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask) |
fef1bdd6 | 354 | { |
c55db957 KM |
355 | struct task_struct *p; |
356 | struct task_struct *task; | |
fef1bdd6 | 357 | |
dc6c9a35 | 358 | pr_info("[ pid ] uid tgid total_vm rss nr_ptes nr_pmds swapents oom_score_adj name\n"); |
6b0c81b3 | 359 | rcu_read_lock(); |
c55db957 | 360 | for_each_process(p) { |
72835c86 | 361 | if (oom_unkillable_task(p, memcg, nodemask)) |
b4416d2b | 362 | continue; |
fef1bdd6 | 363 | |
c55db957 KM |
364 | task = find_lock_task_mm(p); |
365 | if (!task) { | |
6d2661ed | 366 | /* |
74ab7f1d DR |
367 | * This is a kthread or all of p's threads have already |
368 | * detached their mm's. There's no need to report | |
c55db957 | 369 | * them; they can't be oom killed anyway. |
6d2661ed | 370 | */ |
6d2661ed DR |
371 | continue; |
372 | } | |
c55db957 | 373 | |
dc6c9a35 | 374 | pr_info("[%5d] %5d %5d %8lu %8lu %7ld %7ld %8lu %5hd %s\n", |
078de5f7 EB |
375 | task->pid, from_kuid(&init_user_ns, task_uid(task)), |
376 | task->tgid, task->mm->total_vm, get_mm_rss(task->mm), | |
e1f56c89 | 377 | atomic_long_read(&task->mm->nr_ptes), |
dc6c9a35 | 378 | mm_nr_pmds(task->mm), |
de34d965 | 379 | get_mm_counter(task->mm, MM_SWAPENTS), |
a63d83f4 | 380 | task->signal->oom_score_adj, task->comm); |
c55db957 KM |
381 | task_unlock(task); |
382 | } | |
6b0c81b3 | 383 | rcu_read_unlock(); |
fef1bdd6 DR |
384 | } |
385 | ||
6e0fc46d DR |
386 | static void dump_header(struct oom_control *oc, struct task_struct *p, |
387 | struct mem_cgroup *memcg) | |
1b604d75 DR |
388 | { |
389 | pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, " | |
a9c58b90 | 390 | "oom_score_adj=%hd\n", |
6e0fc46d | 391 | current->comm, oc->gfp_mask, oc->order, |
a63d83f4 | 392 | current->signal->oom_score_adj); |
da39da3a | 393 | cpuset_print_current_mems_allowed(); |
1b604d75 | 394 | dump_stack(); |
58cf188e SZ |
395 | if (memcg) |
396 | mem_cgroup_print_oom_info(memcg, p); | |
397 | else | |
398 | show_mem(SHOW_MEM_FILTER_NODES); | |
1b604d75 | 399 | if (sysctl_oom_dump_tasks) |
6e0fc46d | 400 | dump_tasks(memcg, oc->nodemask); |
1b604d75 DR |
401 | } |
402 | ||
5695be14 | 403 | /* |
c32b3cbe | 404 | * Number of OOM victims in flight |
5695be14 | 405 | */ |
c32b3cbe MH |
406 | static atomic_t oom_victims = ATOMIC_INIT(0); |
407 | static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait); | |
5695be14 | 408 | |
c32b3cbe | 409 | bool oom_killer_disabled __read_mostly; |
5695be14 | 410 | |
49550b60 | 411 | /** |
16e95196 | 412 | * mark_oom_victim - mark the given task as OOM victim |
49550b60 | 413 | * @tsk: task to mark |
c32b3cbe | 414 | * |
dc56401f | 415 | * Has to be called with oom_lock held and never after |
c32b3cbe | 416 | * oom has been disabled already. |
49550b60 | 417 | */ |
16e95196 | 418 | void mark_oom_victim(struct task_struct *tsk) |
49550b60 | 419 | { |
c32b3cbe MH |
420 | WARN_ON(oom_killer_disabled); |
421 | /* OOM killer might race with memcg OOM */ | |
422 | if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE)) | |
423 | return; | |
63a8ca9b MH |
424 | /* |
425 | * Make sure that the task is woken up from uninterruptible sleep | |
426 | * if it is frozen because OOM killer wouldn't be able to free | |
427 | * any memory and livelock. freezing_slow_path will tell the freezer | |
428 | * that TIF_MEMDIE tasks should be ignored. | |
429 | */ | |
430 | __thaw_task(tsk); | |
c32b3cbe | 431 | atomic_inc(&oom_victims); |
49550b60 MH |
432 | } |
433 | ||
434 | /** | |
16e95196 | 435 | * exit_oom_victim - note the exit of an OOM victim |
49550b60 | 436 | */ |
16e95196 | 437 | void exit_oom_victim(void) |
49550b60 | 438 | { |
46402778 | 439 | clear_thread_flag(TIF_MEMDIE); |
c32b3cbe | 440 | |
c38f1025 | 441 | if (!atomic_dec_return(&oom_victims)) |
c32b3cbe | 442 | wake_up_all(&oom_victims_wait); |
c32b3cbe MH |
443 | } |
444 | ||
445 | /** | |
446 | * oom_killer_disable - disable OOM killer | |
447 | * | |
448 | * Forces all page allocations to fail rather than trigger OOM killer. | |
449 | * Will block and wait until all OOM victims are killed. | |
450 | * | |
451 | * The function cannot be called when there are runnable user tasks because | |
452 | * the userspace would see unexpected allocation failures as a result. Any | |
453 | * new usage of this function should be consulted with MM people. | |
454 | * | |
455 | * Returns true if successful and false if the OOM killer cannot be | |
456 | * disabled. | |
457 | */ | |
458 | bool oom_killer_disable(void) | |
459 | { | |
460 | /* | |
461 | * Make sure to not race with an ongoing OOM killer | |
462 | * and that the current is not the victim. | |
463 | */ | |
dc56401f | 464 | mutex_lock(&oom_lock); |
c32b3cbe | 465 | if (test_thread_flag(TIF_MEMDIE)) { |
dc56401f | 466 | mutex_unlock(&oom_lock); |
c32b3cbe MH |
467 | return false; |
468 | } | |
469 | ||
470 | oom_killer_disabled = true; | |
dc56401f | 471 | mutex_unlock(&oom_lock); |
c32b3cbe MH |
472 | |
473 | wait_event(oom_victims_wait, !atomic_read(&oom_victims)); | |
474 | ||
475 | return true; | |
476 | } | |
477 | ||
478 | /** | |
479 | * oom_killer_enable - enable OOM killer | |
480 | */ | |
481 | void oom_killer_enable(void) | |
482 | { | |
c32b3cbe | 483 | oom_killer_disabled = false; |
49550b60 MH |
484 | } |
485 | ||
4d7b3394 ON |
486 | /* |
487 | * task->mm can be NULL if the task is the exited group leader. So to | |
488 | * determine whether the task is using a particular mm, we examine all the | |
489 | * task's threads: if one of those is using this mm then this task was also | |
490 | * using it. | |
491 | */ | |
492 | static bool process_shares_mm(struct task_struct *p, struct mm_struct *mm) | |
493 | { | |
494 | struct task_struct *t; | |
495 | ||
496 | for_each_thread(p, t) { | |
497 | struct mm_struct *t_mm = READ_ONCE(t->mm); | |
498 | if (t_mm) | |
499 | return t_mm == mm; | |
500 | } | |
501 | return false; | |
502 | } | |
503 | ||
3b4798cb | 504 | #define K(x) ((x) << (PAGE_SHIFT-10)) |
6b0c81b3 DR |
505 | /* |
506 | * Must be called while holding a reference to p, which will be released upon | |
507 | * returning. | |
508 | */ | |
6e0fc46d | 509 | void oom_kill_process(struct oom_control *oc, struct task_struct *p, |
9cbb78bb | 510 | unsigned int points, unsigned long totalpages, |
6e0fc46d | 511 | struct mem_cgroup *memcg, const char *message) |
1da177e4 | 512 | { |
52d3c036 | 513 | struct task_struct *victim = p; |
5e9d834a | 514 | struct task_struct *child; |
1da4db0c | 515 | struct task_struct *t; |
647f2bdf | 516 | struct mm_struct *mm; |
52d3c036 | 517 | unsigned int victim_points = 0; |
dc3f21ea DR |
518 | static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL, |
519 | DEFAULT_RATELIMIT_BURST); | |
1da177e4 | 520 | |
50ec3bbf NP |
521 | /* |
522 | * If the task is already exiting, don't alarm the sysadmin or kill | |
523 | * its children or threads, just set TIF_MEMDIE so it can die quickly | |
524 | */ | |
83363b91 MH |
525 | task_lock(p); |
526 | if (p->mm && task_will_free_mem(p)) { | |
16e95196 | 527 | mark_oom_victim(p); |
83363b91 | 528 | task_unlock(p); |
6b0c81b3 | 529 | put_task_struct(p); |
2a1c9b1f | 530 | return; |
50ec3bbf | 531 | } |
83363b91 | 532 | task_unlock(p); |
50ec3bbf | 533 | |
dc3f21ea | 534 | if (__ratelimit(&oom_rs)) |
6e0fc46d | 535 | dump_header(oc, p, memcg); |
8447d950 | 536 | |
f0d6647e | 537 | pr_err("%s: Kill process %d (%s) score %u or sacrifice child\n", |
5e9d834a | 538 | message, task_pid_nr(p), p->comm, points); |
f3af38d3 | 539 | |
5e9d834a DR |
540 | /* |
541 | * If any of p's children has a different mm and is eligible for kill, | |
11239836 | 542 | * the one with the highest oom_badness() score is sacrificed for its |
5e9d834a DR |
543 | * parent. This attempts to lose the minimal amount of work done while |
544 | * still freeing memory. | |
545 | */ | |
6b0c81b3 | 546 | read_lock(&tasklist_lock); |
1da4db0c | 547 | for_each_thread(p, t) { |
5e9d834a | 548 | list_for_each_entry(child, &t->children, sibling) { |
a63d83f4 | 549 | unsigned int child_points; |
5e9d834a | 550 | |
4d7b3394 | 551 | if (process_shares_mm(child, p->mm)) |
edd45544 | 552 | continue; |
a63d83f4 DR |
553 | /* |
554 | * oom_badness() returns 0 if the thread is unkillable | |
555 | */ | |
6e0fc46d | 556 | child_points = oom_badness(child, memcg, oc->nodemask, |
a63d83f4 | 557 | totalpages); |
5e9d834a | 558 | if (child_points > victim_points) { |
6b0c81b3 | 559 | put_task_struct(victim); |
5e9d834a DR |
560 | victim = child; |
561 | victim_points = child_points; | |
6b0c81b3 | 562 | get_task_struct(victim); |
5e9d834a | 563 | } |
dd8e8f40 | 564 | } |
1da4db0c | 565 | } |
6b0c81b3 | 566 | read_unlock(&tasklist_lock); |
dd8e8f40 | 567 | |
6b0c81b3 DR |
568 | p = find_lock_task_mm(victim); |
569 | if (!p) { | |
6b0c81b3 | 570 | put_task_struct(victim); |
647f2bdf | 571 | return; |
6b0c81b3 DR |
572 | } else if (victim != p) { |
573 | get_task_struct(p); | |
574 | put_task_struct(victim); | |
575 | victim = p; | |
576 | } | |
647f2bdf | 577 | |
880b7689 | 578 | /* Get a reference to safely compare mm after task_unlock(victim) */ |
647f2bdf | 579 | mm = victim->mm; |
880b7689 | 580 | atomic_inc(&mm->mm_count); |
426fb5e7 TH |
581 | /* |
582 | * We should send SIGKILL before setting TIF_MEMDIE in order to prevent | |
583 | * the OOM victim from depleting the memory reserves from the user | |
584 | * space under its control. | |
585 | */ | |
586 | do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true); | |
16e95196 | 587 | mark_oom_victim(victim); |
eca56ff9 | 588 | pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n", |
647f2bdf DR |
589 | task_pid_nr(victim), victim->comm, K(victim->mm->total_vm), |
590 | K(get_mm_counter(victim->mm, MM_ANONPAGES)), | |
eca56ff9 JM |
591 | K(get_mm_counter(victim->mm, MM_FILEPAGES)), |
592 | K(get_mm_counter(victim->mm, MM_SHMEMPAGES))); | |
647f2bdf DR |
593 | task_unlock(victim); |
594 | ||
595 | /* | |
596 | * Kill all user processes sharing victim->mm in other thread groups, if | |
597 | * any. They don't get access to memory reserves, though, to avoid | |
598 | * depletion of all memory. This prevents mm->mmap_sem livelock when an | |
599 | * oom killed thread cannot exit because it requires the semaphore and | |
600 | * its contended by another thread trying to allocate memory itself. | |
601 | * That thread will now get access to memory reserves since it has a | |
602 | * pending fatal signal. | |
603 | */ | |
4d4048be | 604 | rcu_read_lock(); |
c319025a | 605 | for_each_process(p) { |
4d7b3394 | 606 | if (!process_shares_mm(p, mm)) |
c319025a ON |
607 | continue; |
608 | if (same_thread_group(p, victim)) | |
609 | continue; | |
610 | if (unlikely(p->flags & PF_KTHREAD)) | |
611 | continue; | |
a2b829d9 CJ |
612 | if (is_global_init(p)) |
613 | continue; | |
c319025a ON |
614 | if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN) |
615 | continue; | |
647f2bdf | 616 | |
c319025a ON |
617 | do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true); |
618 | } | |
6b0c81b3 | 619 | rcu_read_unlock(); |
647f2bdf | 620 | |
880b7689 | 621 | mmdrop(mm); |
6b0c81b3 | 622 | put_task_struct(victim); |
1da177e4 | 623 | } |
647f2bdf | 624 | #undef K |
1da177e4 | 625 | |
309ed882 DR |
626 | /* |
627 | * Determines whether the kernel must panic because of the panic_on_oom sysctl. | |
628 | */ | |
6e0fc46d | 629 | void check_panic_on_oom(struct oom_control *oc, enum oom_constraint constraint, |
2415b9f5 | 630 | struct mem_cgroup *memcg) |
309ed882 DR |
631 | { |
632 | if (likely(!sysctl_panic_on_oom)) | |
633 | return; | |
634 | if (sysctl_panic_on_oom != 2) { | |
635 | /* | |
636 | * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel | |
637 | * does not panic for cpuset, mempolicy, or memcg allocation | |
638 | * failures. | |
639 | */ | |
640 | if (constraint != CONSTRAINT_NONE) | |
641 | return; | |
642 | } | |
071a4bef | 643 | /* Do not panic for oom kills triggered by sysrq */ |
db2a0dd7 | 644 | if (is_sysrq_oom(oc)) |
071a4bef | 645 | return; |
6e0fc46d | 646 | dump_header(oc, NULL, memcg); |
309ed882 DR |
647 | panic("Out of memory: %s panic_on_oom is enabled\n", |
648 | sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide"); | |
649 | } | |
650 | ||
8bc719d3 MS |
651 | static BLOCKING_NOTIFIER_HEAD(oom_notify_list); |
652 | ||
653 | int register_oom_notifier(struct notifier_block *nb) | |
654 | { | |
655 | return blocking_notifier_chain_register(&oom_notify_list, nb); | |
656 | } | |
657 | EXPORT_SYMBOL_GPL(register_oom_notifier); | |
658 | ||
659 | int unregister_oom_notifier(struct notifier_block *nb) | |
660 | { | |
661 | return blocking_notifier_chain_unregister(&oom_notify_list, nb); | |
662 | } | |
663 | EXPORT_SYMBOL_GPL(unregister_oom_notifier); | |
664 | ||
1da177e4 | 665 | /** |
6e0fc46d DR |
666 | * out_of_memory - kill the "best" process when we run out of memory |
667 | * @oc: pointer to struct oom_control | |
1da177e4 LT |
668 | * |
669 | * If we run out of memory, we have the choice between either | |
670 | * killing a random task (bad), letting the system crash (worse) | |
671 | * OR try to be smart about which process to kill. Note that we | |
672 | * don't have to be perfect here, we just have to be good. | |
673 | */ | |
6e0fc46d | 674 | bool out_of_memory(struct oom_control *oc) |
1da177e4 | 675 | { |
0aad4b31 | 676 | struct task_struct *p; |
a63d83f4 | 677 | unsigned long totalpages; |
8bc719d3 | 678 | unsigned long freed = 0; |
9cbb78bb | 679 | unsigned int uninitialized_var(points); |
e3658932 | 680 | enum oom_constraint constraint = CONSTRAINT_NONE; |
8bc719d3 | 681 | |
dc56401f JW |
682 | if (oom_killer_disabled) |
683 | return false; | |
684 | ||
8bc719d3 MS |
685 | blocking_notifier_call_chain(&oom_notify_list, 0, &freed); |
686 | if (freed > 0) | |
687 | /* Got some memory back in the last second. */ | |
75e8f8b2 | 688 | return true; |
1da177e4 | 689 | |
7b98c2e4 | 690 | /* |
9ff4868e DR |
691 | * If current has a pending SIGKILL or is exiting, then automatically |
692 | * select it. The goal is to allow it to allocate so that it may | |
693 | * quickly exit and free its memory. | |
d7a94e7e TH |
694 | * |
695 | * But don't select if current has already released its mm and cleared | |
696 | * TIF_MEMDIE flag at exit_mm(), otherwise an OOM livelock may occur. | |
7b98c2e4 | 697 | */ |
d7a94e7e TH |
698 | if (current->mm && |
699 | (fatal_signal_pending(current) || task_will_free_mem(current))) { | |
16e95196 | 700 | mark_oom_victim(current); |
75e8f8b2 | 701 | return true; |
7b98c2e4 DR |
702 | } |
703 | ||
9b0f8b04 CL |
704 | /* |
705 | * Check if there were limitations on the allocation (only relevant for | |
706 | * NUMA) that may require different handling. | |
707 | */ | |
6e0fc46d DR |
708 | constraint = constrained_alloc(oc, &totalpages); |
709 | if (constraint != CONSTRAINT_MEMORY_POLICY) | |
710 | oc->nodemask = NULL; | |
711 | check_panic_on_oom(oc, constraint, NULL); | |
0aad4b31 | 712 | |
121d1ba0 | 713 | if (sysctl_oom_kill_allocating_task && current->mm && |
6e0fc46d | 714 | !oom_unkillable_task(current, NULL, oc->nodemask) && |
121d1ba0 | 715 | current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) { |
6b0c81b3 | 716 | get_task_struct(current); |
6e0fc46d | 717 | oom_kill_process(oc, current, 0, totalpages, NULL, |
2a1c9b1f | 718 | "Out of memory (oom_kill_allocating_task)"); |
75e8f8b2 | 719 | return true; |
0aad4b31 DR |
720 | } |
721 | ||
6e0fc46d | 722 | p = select_bad_process(oc, &points, totalpages); |
0aad4b31 | 723 | /* Found nothing?!?! Either we hang forever, or we panic. */ |
db2a0dd7 | 724 | if (!p && !is_sysrq_oom(oc)) { |
6e0fc46d | 725 | dump_header(oc, NULL, NULL); |
0aad4b31 DR |
726 | panic("Out of memory and no killable processes...\n"); |
727 | } | |
071a4bef | 728 | if (p && p != (void *)-1UL) { |
6e0fc46d DR |
729 | oom_kill_process(oc, p, points, totalpages, NULL, |
730 | "Out of memory"); | |
75e8f8b2 DR |
731 | /* |
732 | * Give the killed process a good chance to exit before trying | |
733 | * to allocate memory again. | |
734 | */ | |
4f774b91 | 735 | schedule_timeout_killable(1); |
75e8f8b2 | 736 | } |
dc56401f | 737 | return true; |
c32b3cbe MH |
738 | } |
739 | ||
e3658932 DR |
740 | /* |
741 | * The pagefault handler calls here because it is out of memory, so kill a | |
efacd02e DR |
742 | * memory-hogging task. If any populated zone has ZONE_OOM_LOCKED set, a |
743 | * parallel oom killing is already in progress so do nothing. | |
e3658932 DR |
744 | */ |
745 | void pagefault_out_of_memory(void) | |
746 | { | |
6e0fc46d DR |
747 | struct oom_control oc = { |
748 | .zonelist = NULL, | |
749 | .nodemask = NULL, | |
750 | .gfp_mask = 0, | |
751 | .order = 0, | |
6e0fc46d DR |
752 | }; |
753 | ||
49426420 | 754 | if (mem_cgroup_oom_synchronize(true)) |
dc56401f | 755 | return; |
3812c8c8 | 756 | |
dc56401f JW |
757 | if (!mutex_trylock(&oom_lock)) |
758 | return; | |
c32b3cbe | 759 | |
6e0fc46d | 760 | if (!out_of_memory(&oc)) { |
dc56401f JW |
761 | /* |
762 | * There shouldn't be any user tasks runnable while the | |
763 | * OOM killer is disabled, so the current task has to | |
764 | * be a racing OOM victim for which oom_killer_disable() | |
765 | * is waiting for. | |
766 | */ | |
767 | WARN_ON(test_thread_flag(TIF_MEMDIE)); | |
e3658932 | 768 | } |
dc56401f JW |
769 | |
770 | mutex_unlock(&oom_lock); | |
e3658932 | 771 | } |