oom_kill.c 31.6 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0-only
L
Linus Torvalds 已提交
2 3 4 5 6 7
/*
 *  linux/mm/oom_kill.c
 * 
 *  Copyright (C)  1998,2000  Rik van Riel
 *	Thanks go out to Claus Fischer for some serious inspiration and
 *	for goading me into coding this file...
D
David Rientjes 已提交
8 9
 *  Copyright (C)  2010  Google, Inc.
 *	Rewritten by David Rientjes
L
Linus Torvalds 已提交
10 11
 *
 *  The routines in this file are used to kill a process when
P
Paul Jackson 已提交
12 13
 *  we're seriously out of memory. This gets called from __alloc_pages()
 *  in mm/page_alloc.c when we really run out of memory.
L
Linus Torvalds 已提交
14 15 16 17 18 19 20
 *
 *  Since we won't call these routines often (on a well-configured
 *  machine) this file will double as a 'coding guide' and a signpost
 *  for newbie kernel hackers. It features several pointers to major
 *  kernel subsystems and hints as to where to find out what things do.
 */

21
#include <linux/oom.h>
L
Linus Torvalds 已提交
22
#include <linux/mm.h>
A
Alexey Dobriyan 已提交
23
#include <linux/err.h>
24
#include <linux/gfp.h>
L
Linus Torvalds 已提交
25
#include <linux/sched.h>
26
#include <linux/sched/mm.h>
27
#include <linux/sched/coredump.h>
28
#include <linux/sched/task.h>
29
#include <linux/sched/debug.h>
L
Linus Torvalds 已提交
30
#include <linux/swap.h>
31
#include <linux/syscalls.h>
L
Linus Torvalds 已提交
32 33
#include <linux/timex.h>
#include <linux/jiffies.h>
34
#include <linux/cpuset.h>
35
#include <linux/export.h>
36
#include <linux/notifier.h>
37
#include <linux/memcontrol.h>
38
#include <linux/mempolicy.h>
39
#include <linux/security.h>
40
#include <linux/ptrace.h>
41
#include <linux/freezer.h>
42
#include <linux/ftrace.h>
43
#include <linux/ratelimit.h>
M
Michal Hocko 已提交
44 45
#include <linux/kthread.h>
#include <linux/init.h>
46
#include <linux/mmu_notifier.h>
M
Michal Hocko 已提交
47 48 49

#include <asm/tlb.h>
#include "internal.h"
50
#include "slab.h"
51 52 53

#define CREATE_TRACE_POINTS
#include <trace/events/oom.h>
L
Linus Torvalds 已提交
54

55
int sysctl_panic_on_oom;
56
int sysctl_oom_kill_allocating_task;
57
int sysctl_oom_dump_tasks = 1;
58

M
Michal Hocko 已提交
59 60 61 62 63 64 65 66
/*
 * Serializes oom killer invocations (out_of_memory()) from all contexts to
 * prevent from over eager oom killing (e.g. when the oom killer is invoked
 * from different domains).
 *
 * oom_killer_disable() relies on this lock to stabilize oom_killer_disabled
 * and mark_oom_victim
 */
67
DEFINE_MUTEX(oom_lock);
68 69
/* Serializes oom_score_adj and oom_score_adj_min updates */
DEFINE_MUTEX(oom_adj_mutex);
L
Linus Torvalds 已提交
70

71 72 73 74 75
static inline bool is_memcg_oom(struct oom_control *oc)
{
	return oc->memcg != NULL;
}

76 77
#ifdef CONFIG_NUMA
/**
I
Ingo Molnar 已提交
78
 * oom_cpuset_eligible() - check task eligibility for kill
79
 * @start: task struct of which task to consider
80
 * @oc: pointer to struct oom_control
81 82 83 84
 *
 * Task eligibility is determined by whether or not a candidate task, @tsk,
 * shares the same mempolicy nodes as current if it is bound by such a policy
 * and whether or not it has the same set of allowed cpuset nodes.
85 86 87
 *
 * This function is assuming oom-killer context and 'current' has triggered
 * the oom-killer.
88
 */
89 90
static bool oom_cpuset_eligible(struct task_struct *start,
				struct oom_control *oc)
91
{
92 93
	struct task_struct *tsk;
	bool ret = false;
94 95 96 97
	const nodemask_t *mask = oc->nodemask;

	if (is_memcg_oom(oc))
		return true;
98

99
	rcu_read_lock();
100
	for_each_thread(start, tsk) {
101 102 103 104 105 106 107
		if (mask) {
			/*
			 * If this is a mempolicy constrained oom, tsk's
			 * cpuset is irrelevant.  Only return true if its
			 * mempolicy intersects current, otherwise it may be
			 * needlessly killed.
			 */
108
			ret = mempolicy_in_oom_domain(tsk, mask);
109 110 111 112 113
		} else {
			/*
			 * This is not a mempolicy constrained oom, so only
			 * check the mems of tsk's cpuset.
			 */
114
			ret = cpuset_mems_allowed_intersects(current, tsk);
115
		}
116 117
		if (ret)
			break;
118
	}
119
	rcu_read_unlock();
120

121
	return ret;
122 123
}
#else
124
static bool oom_cpuset_eligible(struct task_struct *tsk, struct oom_control *oc)
125 126
{
	return true;
127
}
128
#endif /* CONFIG_NUMA */
129

130 131
/*
 * The process p may have detached its own ->mm while exiting or through
132
 * kthread_use_mm(), but one or more of its subthreads may still have a valid
133 134 135
 * pointer.  Return p, or any of its subthreads with a valid ->mm, with
 * task_lock() held.
 */
136
struct task_struct *find_lock_task_mm(struct task_struct *p)
137
{
138
	struct task_struct *t;
139

140 141
	rcu_read_lock();

142
	for_each_thread(p, t) {
143 144
		task_lock(t);
		if (likely(t->mm))
145
			goto found;
146
		task_unlock(t);
147
	}
148 149 150
	t = NULL;
found:
	rcu_read_unlock();
151

152
	return t;
153 154
}

155 156 157 158 159 160 161 162 163
/*
 * order == -1 means the oom kill is required by sysrq, otherwise only
 * for display purposes.
 */
static inline bool is_sysrq_oom(struct oom_control *oc)
{
	return oc->order == -1;
}

164
/* return true if the task is not adequate as candidate victim task. */
165
static bool oom_unkillable_task(struct task_struct *p)
166 167 168 169 170 171 172 173
{
	if (is_global_init(p))
		return true;
	if (p->flags & PF_KTHREAD)
		return true;
	return false;
}

174
/*
175 176 177 178 179 180
 * Check whether unreclaimable slab amount is greater than
 * all user memory(LRU pages).
 * dump_unreclaimable_slab() could help in the case that
 * oom due to too much unreclaimable slab used by kernel.
*/
static bool should_dump_unreclaim_slab(void)
181 182 183 184 185 186 187 188 189 190 191
{
	unsigned long nr_lru;

	nr_lru = global_node_page_state(NR_ACTIVE_ANON) +
		 global_node_page_state(NR_INACTIVE_ANON) +
		 global_node_page_state(NR_ACTIVE_FILE) +
		 global_node_page_state(NR_INACTIVE_FILE) +
		 global_node_page_state(NR_ISOLATED_ANON) +
		 global_node_page_state(NR_ISOLATED_FILE) +
		 global_node_page_state(NR_UNEVICTABLE);

192
	return (global_node_page_state_pages(NR_SLAB_UNRECLAIMABLE_B) > nr_lru);
193 194
}

L
Linus Torvalds 已提交
195
/**
D
David Rientjes 已提交
196
 * oom_badness - heuristic function to determine which candidate task to kill
L
Linus Torvalds 已提交
197
 * @p: task struct of which task we should calculate
D
David Rientjes 已提交
198
 * @totalpages: total present RAM allowed for page allocation
L
Linus Torvalds 已提交
199
 *
D
David Rientjes 已提交
200 201 202
 * The heuristic for determining which task to kill is made to be as simple and
 * predictable as possible.  The goal is to return the highest value for the
 * task consuming the most memory to avoid subsequent oom failures.
L
Linus Torvalds 已提交
203
 */
204
long oom_badness(struct task_struct *p, unsigned long totalpages)
L
Linus Torvalds 已提交
205
{
206
	long points;
207
	long adj;
208

209
	if (oom_unkillable_task(p))
210
		return LONG_MIN;
L
Linus Torvalds 已提交
211

212 213
	p = find_lock_task_mm(p);
	if (!p)
214
		return LONG_MIN;
L
Linus Torvalds 已提交
215

216 217
	/*
	 * Do not even consider tasks which are explicitly marked oom
218 219
	 * unkillable or have been already oom reaped or the are in
	 * the middle of vfork
220
	 */
221
	adj = (long)p->signal->oom_score_adj;
222
	if (adj == OOM_SCORE_ADJ_MIN ||
223
			test_bit(MMF_OOM_SKIP, &p->mm->flags) ||
224
			in_vfork(p)) {
225
		task_unlock(p);
226
		return LONG_MIN;
227 228
	}

L
Linus Torvalds 已提交
229
	/*
D
David Rientjes 已提交
230
	 * The baseline for the badness score is the proportion of RAM that each
231
	 * task's rss, pagetable and swap space use.
L
Linus Torvalds 已提交
232
	 */
233
	points = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) +
234
		mm_pgtables_bytes(p->mm) / PAGE_SIZE;
D
David Rientjes 已提交
235
	task_unlock(p);
L
Linus Torvalds 已提交
236

237 238 239
	/* Normalize to oom_score_adj units */
	adj *= totalpages / 1000;
	points += adj;
L
Linus Torvalds 已提交
240

241
	return points;
L
Linus Torvalds 已提交
242 243
}

244 245 246 247 248
static const char * const oom_constraint_text[] = {
	[CONSTRAINT_NONE] = "CONSTRAINT_NONE",
	[CONSTRAINT_CPUSET] = "CONSTRAINT_CPUSET",
	[CONSTRAINT_MEMORY_POLICY] = "CONSTRAINT_MEMORY_POLICY",
	[CONSTRAINT_MEMCG] = "CONSTRAINT_MEMCG",
249 250
};

251 252 253
/*
 * Determine the type of allocation constraint.
 */
254
static enum oom_constraint constrained_alloc(struct oom_control *oc)
255
{
256
	struct zone *zone;
257
	struct zoneref *z;
258
	enum zone_type highest_zoneidx = gfp_zone(oc->gfp_mask);
D
David Rientjes 已提交
259 260
	bool cpuset_limited = false;
	int nid;
261

262
	if (is_memcg_oom(oc)) {
263
		oc->totalpages = mem_cgroup_get_max(oc->memcg) ?: 1;
264 265 266
		return CONSTRAINT_MEMCG;
	}

D
David Rientjes 已提交
267
	/* Default to all available memory */
268
	oc->totalpages = totalram_pages() + total_swap_pages;
269 270 271

	if (!IS_ENABLED(CONFIG_NUMA))
		return CONSTRAINT_NONE;
D
David Rientjes 已提交
272

273
	if (!oc->zonelist)
D
David Rientjes 已提交
274
		return CONSTRAINT_NONE;
275 276 277 278 279
	/*
	 * Reach here only when __GFP_NOFAIL is used. So, we should avoid
	 * to kill current.We have to random task kill in this case.
	 * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
	 */
280
	if (oc->gfp_mask & __GFP_THISNODE)
281
		return CONSTRAINT_NONE;
282

283
	/*
D
David Rientjes 已提交
284 285 286
	 * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
	 * the page allocator means a mempolicy is in effect.  Cpuset policy
	 * is enforced in get_page_from_freelist().
287
	 */
288 289
	if (oc->nodemask &&
	    !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {
290
		oc->totalpages = total_swap_pages;
291
		for_each_node_mask(nid, *oc->nodemask)
292
			oc->totalpages += node_present_pages(nid);
293
		return CONSTRAINT_MEMORY_POLICY;
D
David Rientjes 已提交
294
	}
295 296

	/* Check this allocation failure is caused by cpuset's wall function */
297
	for_each_zone_zonelist_nodemask(zone, z, oc->zonelist,
298
			highest_zoneidx, oc->nodemask)
299
		if (!cpuset_zone_allowed(zone, oc->gfp_mask))
D
David Rientjes 已提交
300
			cpuset_limited = true;
301

D
David Rientjes 已提交
302
	if (cpuset_limited) {
303
		oc->totalpages = total_swap_pages;
D
David Rientjes 已提交
304
		for_each_node_mask(nid, cpuset_current_mems_allowed)
305
			oc->totalpages += node_present_pages(nid);
D
David Rientjes 已提交
306 307
		return CONSTRAINT_CPUSET;
	}
308 309 310
	return CONSTRAINT_NONE;
}

311
static int oom_evaluate_task(struct task_struct *task, void *arg)
312
{
313
	struct oom_control *oc = arg;
314
	long points;
315

316 317 318 319 320
	if (oom_unkillable_task(task))
		goto next;

	/* p may not have freeable memory in nodemask */
	if (!is_memcg_oom(oc) && !oom_cpuset_eligible(task, oc))
321
		goto next;
322 323 324

	/*
	 * This task already has access to memory reserves and is being killed.
325
	 * Don't allow any other task to have access to the reserves unless
326
	 * the task has MMF_OOM_SKIP because chances that it would release
327
	 * any memory is quite low.
328
	 */
329 330
	if (!is_sysrq_oom(oc) && tsk_is_oom_victim(task)) {
		if (test_bit(MMF_OOM_SKIP, &task->signal->oom_mm->flags))
331 332
			goto next;
		goto abort;
333
	}
334

335 336 337 338
	/*
	 * If task is allocating a lot of memory and has been marked to be
	 * killed first if it triggers an oom, then select it.
	 */
339
	if (oom_task_origin(task)) {
340
		points = LONG_MAX;
341 342
		goto select;
	}
343

344
	points = oom_badness(task, oc->totalpages);
345
	if (points == LONG_MIN || points < oc->chosen_points)
346 347 348 349 350 351 352 353 354 355 356 357 358 359 360
		goto next;

select:
	if (oc->chosen)
		put_task_struct(oc->chosen);
	get_task_struct(task);
	oc->chosen = task;
	oc->chosen_points = points;
next:
	return 0;
abort:
	if (oc->chosen)
		put_task_struct(oc->chosen);
	oc->chosen = (void *)-1UL;
	return 1;
361 362
}

L
Linus Torvalds 已提交
363
/*
364 365
 * Simple selection loop. We choose the process with the highest number of
 * 'points'. In case scan was aborted, oc->chosen is set to -1.
L
Linus Torvalds 已提交
366
 */
367
static void select_bad_process(struct oom_control *oc)
L
Linus Torvalds 已提交
368
{
369 370
	oc->chosen_points = LONG_MIN;

371 372 373 374
	if (is_memcg_oom(oc))
		mem_cgroup_scan_tasks(oc->memcg, oom_evaluate_task, oc);
	else {
		struct task_struct *p;
375

376 377 378 379 380
		rcu_read_lock();
		for_each_process(p)
			if (oom_evaluate_task(p, oc))
				break;
		rcu_read_unlock();
381
	}
L
Linus Torvalds 已提交
382 383
}

384 385 386 387 388
static int dump_task(struct task_struct *p, void *arg)
{
	struct oom_control *oc = arg;
	struct task_struct *task;

389 390 391 392 393
	if (oom_unkillable_task(p))
		return 0;

	/* p may not have freeable memory in nodemask */
	if (!is_memcg_oom(oc) && !oom_cpuset_eligible(p, oc))
394 395 396 397 398
		return 0;

	task = find_lock_task_mm(p);
	if (!task) {
		/*
399 400
		 * All of p's threads have already detached their mm's. There's
		 * no need to report them; they can't be oom killed anyway.
401 402 403 404 405 406 407 408 409 410 411 412 413 414 415
		 */
		return 0;
	}

	pr_info("[%7d] %5d %5d %8lu %8lu %8ld %8lu         %5hd %s\n",
		task->pid, from_kuid(&init_user_ns, task_uid(task)),
		task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
		mm_pgtables_bytes(task->mm),
		get_mm_counter(task->mm, MM_SWAPENTS),
		task->signal->oom_score_adj, task->comm);
	task_unlock(task);

	return 0;
}

416
/**
R
Randy Dunlap 已提交
417
 * dump_tasks - dump current memory state of all system tasks
418
 * @oc: pointer to struct oom_control
R
Randy Dunlap 已提交
419
 *
420 421 422
 * Dumps the current memory state of all eligible tasks.  Tasks not in the same
 * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
 * are not shown.
423 424
 * State information includes task's pid, uid, tgid, vm size, rss,
 * pgtables_bytes, swapents, oom_score_adj value, and name.
425
 */
426
static void dump_tasks(struct oom_control *oc)
427
{
428 429
	pr_info("Tasks state (memory values in pages):\n");
	pr_info("[  pid  ]   uid  tgid total_vm      rss pgtables_bytes swapents oom_score_adj name\n");
430

431 432 433 434
	if (is_memcg_oom(oc))
		mem_cgroup_scan_tasks(oc->memcg, dump_task, oc);
	else {
		struct task_struct *p;
435

436 437 438 439
		rcu_read_lock();
		for_each_process(p)
			dump_task(p, oc);
		rcu_read_unlock();
440
	}
441 442
}

443 444 445 446 447 448 449
static void dump_oom_summary(struct oom_control *oc, struct task_struct *victim)
{
	/* one line summary of the oom killer context. */
	pr_info("oom-kill:constraint=%s,nodemask=%*pbl",
			oom_constraint_text[oc->constraint],
			nodemask_pr_args(oc->nodemask));
	cpuset_print_current_mems_allowed();
450
	mem_cgroup_print_oom_context(oc->memcg, victim);
451 452 453 454
	pr_cont(",task=%s,pid=%d,uid=%d\n", victim->comm, victim->pid,
		from_kuid(&init_user_ns, task_uid(victim)));
}

455
static void dump_header(struct oom_control *oc, struct task_struct *p)
456
{
457 458
	pr_warn("%s invoked oom-killer: gfp_mask=%#x(%pGg), order=%d, oom_score_adj=%hd\n",
		current->comm, oc->gfp_mask, &oc->gfp_mask, oc->order,
M
Michal Hocko 已提交
459
			current->signal->oom_score_adj);
460 461
	if (!IS_ENABLED(CONFIG_COMPACTION) && oc->order)
		pr_warn("COMPACTION is disabled!!!\n");
462

463
	dump_stack();
464
	if (is_memcg_oom(oc))
465
		mem_cgroup_print_oom_meminfo(oc->memcg);
466
	else {
467
		show_mem(SHOW_MEM_FILTER_NODES, oc->nodemask);
468
		if (should_dump_unreclaim_slab())
469 470
			dump_unreclaimable_slab();
	}
471
	if (sysctl_oom_dump_tasks)
472
		dump_tasks(oc);
473 474
	if (p)
		dump_oom_summary(oc, p);
475 476
}

477
/*
478
 * Number of OOM victims in flight
479
 */
480 481
static atomic_t oom_victims = ATOMIC_INIT(0);
static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);
482

483
static bool oom_killer_disabled __read_mostly;
484

485 486
#define K(x) ((x) << (PAGE_SHIFT-10))

487 488 489 490 491 492
/*
 * task->mm can be NULL if the task is the exited group leader.  So to
 * determine whether the task is using a particular mm, we examine all the
 * task's threads: if one of those is using this mm then this task was also
 * using it.
 */
493
bool process_shares_mm(struct task_struct *p, struct mm_struct *mm)
494 495 496 497 498 499 500 501 502 503 504
{
	struct task_struct *t;

	for_each_thread(p, t) {
		struct mm_struct *t_mm = READ_ONCE(t->mm);
		if (t_mm)
			return t_mm == mm;
	}
	return false;
}

M
Michal Hocko 已提交
505 506 507 508 509 510 511
#ifdef CONFIG_MMU
/*
 * OOM Reaper kernel thread which tries to reap the memory used by the OOM
 * victim (if that is possible) to help the OOM killer to move on.
 */
static struct task_struct *oom_reaper_th;
static DECLARE_WAIT_QUEUE_HEAD(oom_reaper_wait);
512
static struct task_struct *oom_reaper_list;
513 514
static DEFINE_SPINLOCK(oom_reaper_lock);

515
bool __oom_reap_task_mm(struct mm_struct *mm)
M
Michal Hocko 已提交
516 517
{
	struct vm_area_struct *vma;
518
	bool ret = true;
519 520 521 522 523 524 525 526 527 528

	/*
	 * Tell all users of get_user/copy_from_user etc... that the content
	 * is no longer stable. No barriers really needed because unmapping
	 * should imply barriers already and the reader would hit a page fault
	 * if it stumbled over a reaped memory.
	 */
	set_bit(MMF_UNSTABLE, &mm->flags);

	for (vma = mm->mmap ; vma; vma = vma->vm_next) {
M
Minchan Kim 已提交
529
		if (!can_madv_lru_vma(vma))
530 531 532 533 534 535 536 537 538 539 540 541 542
			continue;

		/*
		 * Only anonymous pages have a good chance to be dropped
		 * without additional steps which we cannot afford as we
		 * are OOM already.
		 *
		 * We do not even care about fs backed pages because all
		 * which are reclaimable have already been reclaimed and
		 * we do not want to block exit_mmap by keeping mm ref
		 * count elevated without a good reason.
		 */
		if (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED)) {
543
			struct mmu_notifier_range range;
544 545
			struct mmu_gather tlb;

546 547
			mmu_notifier_range_init(&range, MMU_NOTIFY_UNMAP, 0,
						vma, mm, vma->vm_start,
548
						vma->vm_end);
549
			tlb_gather_mmu(&tlb, mm);
550
			if (mmu_notifier_invalidate_range_start_nonblock(&range)) {
551
				tlb_finish_mmu(&tlb);
552 553 554
				ret = false;
				continue;
			}
555 556
			unmap_page_range(&tlb, vma, range.start, range.end, NULL);
			mmu_notifier_invalidate_range_end(&range);
557
			tlb_finish_mmu(&tlb);
558 559
		}
	}
560 561

	return ret;
562 563
}

564 565 566 567 568 569
/*
 * Reaps the address space of the give task.
 *
 * Returns true on success and false if none or part of the address space
 * has been reclaimed and the caller should retry later.
 */
570 571
static bool oom_reap_task_mm(struct task_struct *tsk, struct mm_struct *mm)
{
M
Michal Hocko 已提交
572 573
	bool ret = true;

574
	if (!mmap_read_trylock(mm)) {
575
		trace_skip_task_reaping(tsk->pid);
576
		return false;
577 578
	}

579
	/*
580 581
	 * MMF_OOM_SKIP is set by exit_mmap when the OOM reaper can't
	 * work on the mm anymore. The check for MMF_OOM_SKIP must run
582 583
	 * under mmap_lock for reading because it serializes against the
	 * mmap_write_lock();mmap_write_unlock() cycle in exit_mmap().
584
	 */
585
	if (test_bit(MMF_OOM_SKIP, &mm->flags)) {
586
		trace_skip_task_reaping(tsk->pid);
587
		goto out_unlock;
M
Michal Hocko 已提交
588 589
	}

590 591
	trace_start_task_reaping(tsk->pid);

592
	/* failed to reap part of the address space. Try again later */
593 594 595
	ret = __oom_reap_task_mm(mm);
	if (!ret)
		goto out_finish;
M
Michal Hocko 已提交
596

597 598 599 600 601
	pr_info("oom_reaper: reaped process %d (%s), now anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
			task_pid_nr(tsk), tsk->comm,
			K(get_mm_counter(mm, MM_ANONPAGES)),
			K(get_mm_counter(mm, MM_FILEPAGES)),
			K(get_mm_counter(mm, MM_SHMEMPAGES)));
602 603 604
out_finish:
	trace_finish_task_reaping(tsk->pid);
out_unlock:
605
	mmap_read_unlock(mm);
606

M
Michal Hocko 已提交
607 608 609
	return ret;
}

610
#define MAX_OOM_REAP_RETRIES 10
611
static void oom_reap_task(struct task_struct *tsk)
M
Michal Hocko 已提交
612 613
{
	int attempts = 0;
614
	struct mm_struct *mm = tsk->signal->oom_mm;
M
Michal Hocko 已提交
615

616
	/* Retry the mmap_read_trylock(mm) a few times */
617
	while (attempts++ < MAX_OOM_REAP_RETRIES && !oom_reap_task_mm(tsk, mm))
M
Michal Hocko 已提交
618 619
		schedule_timeout_idle(HZ/10);

620 621
	if (attempts <= MAX_OOM_REAP_RETRIES ||
	    test_bit(MMF_OOM_SKIP, &mm->flags))
622
		goto done;
623

624 625
	pr_info("oom_reaper: unable to reap pid:%d (%s)\n",
		task_pid_nr(tsk), tsk->comm);
626
	sched_show_task(tsk);
627
	debug_show_all_locks();
628

629
done:
630 631
	tsk->oom_reaper_list = NULL;

632 633
	/*
	 * Hide this mm from OOM killer because it has been either reaped or
634
	 * somebody can't call mmap_write_unlock(mm).
635
	 */
636
	set_bit(MMF_OOM_SKIP, &mm->flags);
637

M
Michal Hocko 已提交
638
	/* Drop a reference taken by wake_oom_reaper */
639
	put_task_struct(tsk);
M
Michal Hocko 已提交
640 641 642 643 644
}

static int oom_reaper(void *unused)
{
	while (true) {
645
		struct task_struct *tsk = NULL;
M
Michal Hocko 已提交
646

647
		wait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL);
648
		spin_lock(&oom_reaper_lock);
649 650 651
		if (oom_reaper_list != NULL) {
			tsk = oom_reaper_list;
			oom_reaper_list = tsk->oom_reaper_list;
652 653 654 655 656
		}
		spin_unlock(&oom_reaper_lock);

		if (tsk)
			oom_reap_task(tsk);
M
Michal Hocko 已提交
657 658 659 660 661
	}

	return 0;
}

662
static void wake_oom_reaper(struct task_struct *tsk)
M
Michal Hocko 已提交
663
{
664 665
	/* mm is already queued? */
	if (test_and_set_bit(MMF_OOM_REAP_QUEUED, &tsk->signal->oom_mm->flags))
M
Michal Hocko 已提交
666 667
		return;

668
	get_task_struct(tsk);
M
Michal Hocko 已提交
669

670
	spin_lock(&oom_reaper_lock);
671 672
	tsk->oom_reaper_list = oom_reaper_list;
	oom_reaper_list = tsk;
673
	spin_unlock(&oom_reaper_lock);
674
	trace_wake_reaper(tsk->pid);
675
	wake_up(&oom_reaper_wait);
M
Michal Hocko 已提交
676 677 678 679 680 681 682 683
}

static int __init oom_init(void)
{
	oom_reaper_th = kthread_run(oom_reaper, NULL, "oom_reaper");
	return 0;
}
subsys_initcall(oom_init)
684 685 686 687 688
#else
static inline void wake_oom_reaper(struct task_struct *tsk)
{
}
#endif /* CONFIG_MMU */
M
Michal Hocko 已提交
689

690
/**
691
 * mark_oom_victim - mark the given task as OOM victim
692
 * @tsk: task to mark
693
 *
694
 * Has to be called with oom_lock held and never after
695
 * oom has been disabled already.
696 697 698
 *
 * tsk->mm has to be non NULL and caller has to guarantee it is stable (either
 * under task_lock or operate on the current).
699
 */
700
static void mark_oom_victim(struct task_struct *tsk)
701
{
702 703
	struct mm_struct *mm = tsk->mm;

704 705 706 707
	WARN_ON(oom_killer_disabled);
	/* OOM killer might race with memcg OOM */
	if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))
		return;
708 709

	/* oom_mm is bound to the signal struct life time. */
710
	if (!cmpxchg(&tsk->signal->oom_mm, NULL, mm)) {
V
Vegard Nossum 已提交
711
		mmgrab(tsk->signal->oom_mm);
712 713
		set_bit(MMF_OOM_VICTIM, &mm->flags);
	}
714

715 716 717 718 719 720 721
	/*
	 * Make sure that the task is woken up from uninterruptible sleep
	 * if it is frozen because OOM killer wouldn't be able to free
	 * any memory and livelock. freezing_slow_path will tell the freezer
	 * that TIF_MEMDIE tasks should be ignored.
	 */
	__thaw_task(tsk);
722
	atomic_inc(&oom_victims);
723
	trace_mark_victim(tsk->pid);
724 725 726
}

/**
727
 * exit_oom_victim - note the exit of an OOM victim
728
 */
729
void exit_oom_victim(void)
730
{
731
	clear_thread_flag(TIF_MEMDIE);
732

733
	if (!atomic_dec_return(&oom_victims))
734 735 736
		wake_up_all(&oom_victims_wait);
}

737 738 739 740 741 742
/**
 * oom_killer_enable - enable OOM killer
 */
void oom_killer_enable(void)
{
	oom_killer_disabled = false;
M
Michal Hocko 已提交
743
	pr_info("OOM killer enabled.\n");
744 745
}

746 747
/**
 * oom_killer_disable - disable OOM killer
748
 * @timeout: maximum timeout to wait for oom victims in jiffies
749 750
 *
 * Forces all page allocations to fail rather than trigger OOM killer.
751 752
 * Will block and wait until all OOM victims are killed or the given
 * timeout expires.
753 754 755 756 757 758 759 760
 *
 * The function cannot be called when there are runnable user tasks because
 * the userspace would see unexpected allocation failures as a result. Any
 * new usage of this function should be consulted with MM people.
 *
 * Returns true if successful and false if the OOM killer cannot be
 * disabled.
 */
761
bool oom_killer_disable(signed long timeout)
762
{
763 764
	signed long ret;

765
	/*
766 767
	 * Make sure to not race with an ongoing OOM killer. Check that the
	 * current is not killed (possibly due to sharing the victim's memory).
768
	 */
769
	if (mutex_lock_killable(&oom_lock))
770 771
		return false;
	oom_killer_disabled = true;
772
	mutex_unlock(&oom_lock);
773

774 775 776 777 778 779
	ret = wait_event_interruptible_timeout(oom_victims_wait,
			!atomic_read(&oom_victims), timeout);
	if (ret <= 0) {
		oom_killer_enable();
		return false;
	}
M
Michal Hocko 已提交
780
	pr_info("OOM killer disabled.\n");
781 782 783 784

	return true;
}

785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809
static inline bool __task_will_free_mem(struct task_struct *task)
{
	struct signal_struct *sig = task->signal;

	/*
	 * A coredumping process may sleep for an extended period in exit_mm(),
	 * so the oom killer cannot assume that the process will promptly exit
	 * and release memory.
	 */
	if (sig->flags & SIGNAL_GROUP_COREDUMP)
		return false;

	if (sig->flags & SIGNAL_GROUP_EXIT)
		return true;

	if (thread_group_empty(task) && (task->flags & PF_EXITING))
		return true;

	return false;
}

/*
 * Checks whether the given task is dying or exiting and likely to
 * release its address space. This means that all threads and processes
 * sharing the same mm have to be killed or exiting.
810 811
 * Caller has to make sure that task->mm is stable (hold task_lock or
 * it operates on the current).
812
 */
813
static bool task_will_free_mem(struct task_struct *task)
814
{
815
	struct mm_struct *mm = task->mm;
816
	struct task_struct *p;
817
	bool ret = true;
818 819

	/*
820 821 822
	 * Skip tasks without mm because it might have passed its exit_mm and
	 * exit_oom_victim. oom_reaper could have rescued that but do not rely
	 * on that for now. We can consider find_lock_task_mm in future.
823
	 */
824
	if (!mm)
825 826
		return false;

827 828
	if (!__task_will_free_mem(task))
		return false;
829 830 831 832 833

	/*
	 * This task has already been drained by the oom reaper so there are
	 * only small chances it will free some more
	 */
834
	if (test_bit(MMF_OOM_SKIP, &mm->flags))
835 836
		return false;

837
	if (atomic_read(&mm->mm_users) <= 1)
838 839 840
		return true;

	/*
841 842 843
	 * Make sure that all tasks which share the mm with the given tasks
	 * are dying as well to make sure that a) nobody pins its mm and
	 * b) the task is also reapable by the oom reaper.
844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859
	 */
	rcu_read_lock();
	for_each_process(p) {
		if (!process_shares_mm(p, mm))
			continue;
		if (same_thread_group(task, p))
			continue;
		ret = __task_will_free_mem(p);
		if (!ret)
			break;
	}
	rcu_read_unlock();

	return ret;
}

860
static void __oom_kill_process(struct task_struct *victim, const char *message)
L
Linus Torvalds 已提交
861
{
862
	struct task_struct *p;
863
	struct mm_struct *mm;
864
	bool can_oom_reap = true;
L
Linus Torvalds 已提交
865

866 867
	p = find_lock_task_mm(victim);
	if (!p) {
868 869
		pr_info("%s: OOM victim %d (%s) is already exiting. Skip killing the task\n",
			message, task_pid_nr(victim), victim->comm);
870
		put_task_struct(victim);
871
		return;
872 873 874 875 876
	} else if (victim != p) {
		get_task_struct(p);
		put_task_struct(victim);
		victim = p;
	}
877

878
	/* Get a reference to safely compare mm after task_unlock(victim) */
879
	mm = victim->mm;
V
Vegard Nossum 已提交
880
	mmgrab(mm);
881 882 883

	/* Raise event before sending signal: task reaper must see this */
	count_vm_event(OOM_KILL);
R
Roman Gushchin 已提交
884
	memcg_memory_event_mm(mm, MEMCG_OOM_KILL);
885

886
	/*
887 888 889
	 * We should send SIGKILL before granting access to memory reserves
	 * in order to prevent the OOM victim from depleting the memory
	 * reserves from the user space under its control.
890
	 */
891
	do_send_sig_info(SIGKILL, SEND_SIG_PRIV, victim, PIDTYPE_TGID);
892
	mark_oom_victim(victim);
893 894 895 896 897 898
	pr_err("%s: Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB, UID:%u pgtables:%lukB oom_score_adj:%hd\n",
		message, task_pid_nr(victim), victim->comm, K(mm->total_vm),
		K(get_mm_counter(mm, MM_ANONPAGES)),
		K(get_mm_counter(mm, MM_FILEPAGES)),
		K(get_mm_counter(mm, MM_SHMEMPAGES)),
		from_kuid(&init_user_ns, task_uid(victim)),
899
		mm_pgtables_bytes(mm) >> 10, victim->signal->oom_score_adj);
900 901 902 903 904
	task_unlock(victim);

	/*
	 * Kill all user processes sharing victim->mm in other thread groups, if
	 * any.  They don't get access to memory reserves, though, to avoid
905
	 * depletion of all memory.  This prevents mm->mmap_lock livelock when an
906 907 908 909 910
	 * oom killed thread cannot exit because it requires the semaphore and
	 * its contended by another thread trying to allocate memory itself.
	 * That thread will now get access to memory reserves since it has a
	 * pending fatal signal.
	 */
911
	rcu_read_lock();
912
	for_each_process(p) {
913
		if (!process_shares_mm(p, mm))
914 915 916
			continue;
		if (same_thread_group(p, victim))
			continue;
917
		if (is_global_init(p)) {
M
Michal Hocko 已提交
918
			can_oom_reap = false;
919
			set_bit(MMF_OOM_SKIP, &mm->flags);
920 921 922
			pr_info("oom killer %d (%s) has mm pinned by %d (%s)\n",
					task_pid_nr(victim), victim->comm,
					task_pid_nr(p), p->comm);
923
			continue;
M
Michal Hocko 已提交
924
		}
925
		/*
926
		 * No kthread_use_mm() user needs to read from the userspace so
927
		 * we are ok to reap it.
928 929 930
		 */
		if (unlikely(p->flags & PF_KTHREAD))
			continue;
931
		do_send_sig_info(SIGKILL, SEND_SIG_PRIV, p, PIDTYPE_TGID);
932
	}
933
	rcu_read_unlock();
934

M
Michal Hocko 已提交
935
	if (can_oom_reap)
936
		wake_oom_reaper(victim);
M
Michal Hocko 已提交
937

938
	mmdrop(mm);
939
	put_task_struct(victim);
L
Linus Torvalds 已提交
940
}
941
#undef K
L
Linus Torvalds 已提交
942

943 944 945 946
/*
 * Kill provided task unless it's secured by setting
 * oom_score_adj to OOM_SCORE_ADJ_MIN.
 */
947
static int oom_kill_memcg_member(struct task_struct *task, void *message)
948
{
949 950
	if (task->signal->oom_score_adj != OOM_SCORE_ADJ_MIN &&
	    !is_global_init(task)) {
951
		get_task_struct(task);
952
		__oom_kill_process(task, message);
953 954 955 956
	}
	return 0;
}

957 958
static void oom_kill_process(struct oom_control *oc, const char *message)
{
959
	struct task_struct *victim = oc->chosen;
960
	struct mem_cgroup *oom_group;
961 962 963 964 965 966 967 968
	static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
					      DEFAULT_RATELIMIT_BURST);

	/*
	 * If the task is already exiting, don't alarm the sysadmin or kill
	 * its children or threads, just give it access to memory reserves
	 * so it can die quickly
	 */
969 970 971 972 973 974
	task_lock(victim);
	if (task_will_free_mem(victim)) {
		mark_oom_victim(victim);
		wake_oom_reaper(victim);
		task_unlock(victim);
		put_task_struct(victim);
975 976
		return;
	}
977
	task_unlock(victim);
978 979

	if (__ratelimit(&oom_rs))
980
		dump_header(oc, victim);
981

982 983 984 985 986 987 988
	/*
	 * Do we need to kill the entire memory cgroup?
	 * Or even one of the ancestor memory cgroups?
	 * Check this out before killing the victim task.
	 */
	oom_group = mem_cgroup_get_oom_group(victim, oc->memcg);

989
	__oom_kill_process(victim, message);
990 991 992 993 994 995

	/*
	 * If necessary, kill all tasks in the selected memory cgroup.
	 */
	if (oom_group) {
		mem_cgroup_print_oom_group(oom_group);
996
		mem_cgroup_scan_tasks(oom_group, oom_kill_memcg_member,
997
				      (void *)message);
998 999
		mem_cgroup_put(oom_group);
	}
1000 1001
}

1002 1003 1004
/*
 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
 */
1005
static void check_panic_on_oom(struct oom_control *oc)
1006 1007 1008 1009 1010 1011 1012 1013 1014
{
	if (likely(!sysctl_panic_on_oom))
		return;
	if (sysctl_panic_on_oom != 2) {
		/*
		 * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
		 * does not panic for cpuset, mempolicy, or memcg allocation
		 * failures.
		 */
1015
		if (oc->constraint != CONSTRAINT_NONE)
1016 1017
			return;
	}
1018
	/* Do not panic for oom kills triggered by sysrq */
1019
	if (is_sysrq_oom(oc))
1020
		return;
1021
	dump_header(oc, NULL);
1022 1023 1024 1025
	panic("Out of memory: %s panic_on_oom is enabled\n",
		sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
}

1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039
static BLOCKING_NOTIFIER_HEAD(oom_notify_list);

int register_oom_notifier(struct notifier_block *nb)
{
	return blocking_notifier_chain_register(&oom_notify_list, nb);
}
EXPORT_SYMBOL_GPL(register_oom_notifier);

int unregister_oom_notifier(struct notifier_block *nb)
{
	return blocking_notifier_chain_unregister(&oom_notify_list, nb);
}
EXPORT_SYMBOL_GPL(unregister_oom_notifier);

L
Linus Torvalds 已提交
1040
/**
1041 1042
 * out_of_memory - kill the "best" process when we run out of memory
 * @oc: pointer to struct oom_control
L
Linus Torvalds 已提交
1043 1044 1045 1046 1047 1048
 *
 * If we run out of memory, we have the choice between either
 * killing a random task (bad), letting the system crash (worse)
 * OR try to be smart about which process to kill. Note that we
 * don't have to be perfect here, we just have to be good.
 */
1049
bool out_of_memory(struct oom_control *oc)
L
Linus Torvalds 已提交
1050
{
1051 1052
	unsigned long freed = 0;

1053 1054 1055
	if (oom_killer_disabled)
		return false;

1056 1057 1058 1059 1060 1061
	if (!is_memcg_oom(oc)) {
		blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
		if (freed > 0)
			/* Got some memory back in the last second. */
			return true;
	}
L
Linus Torvalds 已提交
1062

1063
	/*
1064 1065 1066
	 * If current has a pending SIGKILL or is exiting, then automatically
	 * select it.  The goal is to allow it to allocate so that it may
	 * quickly exit and free its memory.
1067
	 */
1068
	if (task_will_free_mem(current)) {
1069
		mark_oom_victim(current);
1070
		wake_oom_reaper(current);
1071
		return true;
1072 1073
	}

1074 1075 1076 1077
	/*
	 * The OOM killer does not compensate for IO-less reclaim.
	 * pagefault_out_of_memory lost its gfp context so we have to
	 * make sure exclude 0 mask - all other users should have at least
1078 1079
	 * ___GFP_DIRECT_RECLAIM to get here. But mem_cgroup_oom() has to
	 * invoke the OOM killer even if it is a GFP_NOFS allocation.
1080
	 */
1081
	if (oc->gfp_mask && !(oc->gfp_mask & __GFP_FS) && !is_memcg_oom(oc))
1082 1083
		return true;

1084 1085
	/*
	 * Check if there were limitations on the allocation (only relevant for
1086
	 * NUMA and memcg) that may require different handling.
1087
	 */
1088 1089
	oc->constraint = constrained_alloc(oc);
	if (oc->constraint != CONSTRAINT_MEMORY_POLICY)
1090
		oc->nodemask = NULL;
1091
	check_panic_on_oom(oc);
1092

1093
	if (!is_memcg_oom(oc) && sysctl_oom_kill_allocating_task &&
1094 1095
	    current->mm && !oom_unkillable_task(current) &&
	    oom_cpuset_eligible(current, oc) &&
1096
	    current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
1097
		get_task_struct(current);
1098 1099
		oc->chosen = current;
		oom_kill_process(oc, "Out of memory (oom_kill_allocating_task)");
1100
		return true;
1101 1102
	}

1103
	select_bad_process(oc);
1104 1105
	/* Found nothing?!?! */
	if (!oc->chosen) {
1106
		dump_header(oc, NULL);
1107 1108 1109 1110 1111 1112 1113 1114
		pr_warn("Out of memory and no killable processes...\n");
		/*
		 * If we got here due to an actual allocation at the
		 * system level, we cannot survive this and will enter
		 * an endless loop in the allocator. Bail out now.
		 */
		if (!is_sysrq_oom(oc) && !is_memcg_oom(oc))
			panic("System is deadlocked on memory\n");
1115
	}
1116
	if (oc->chosen && oc->chosen != (void *)-1UL)
1117 1118 1119
		oom_kill_process(oc, !is_memcg_oom(oc) ? "Out of memory" :
				 "Memory cgroup out of memory");
	return !!oc->chosen;
1120 1121
}

1122
/*
1123 1124 1125 1126
 * The pagefault handler calls here because some allocation has failed. We have
 * to take care of the memcg OOM here because this is the only safe context without
 * any locks held but let the oom killer triggered from the allocation context care
 * about the global OOM.
1127 1128 1129
 */
void pagefault_out_of_memory(void)
{
1130 1131
	static DEFINE_RATELIMIT_STATE(pfoom_rs, DEFAULT_RATELIMIT_INTERVAL,
				      DEFAULT_RATELIMIT_BURST);
1132

1133
	if (mem_cgroup_oom_synchronize(true))
1134
		return;
1135

1136 1137 1138
	if (fatal_signal_pending(current))
		return;

1139 1140
	if (__ratelimit(&pfoom_rs))
		pr_warn("Huh VM_FAULT_OOM leaked out to the #PF handler. Retrying PF\n");
1141
}
1142 1143 1144 1145 1146 1147 1148 1149

SYSCALL_DEFINE2(process_mrelease, int, pidfd, unsigned int, flags)
{
#ifdef CONFIG_MMU
	struct mm_struct *mm = NULL;
	struct task_struct *task;
	struct task_struct *p;
	unsigned int f_flags;
1150
	bool reap = false;
1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176
	struct pid *pid;
	long ret = 0;

	if (flags)
		return -EINVAL;

	pid = pidfd_get_pid(pidfd, &f_flags);
	if (IS_ERR(pid))
		return PTR_ERR(pid);

	task = get_pid_task(pid, PIDTYPE_TGID);
	if (!task) {
		ret = -ESRCH;
		goto put_pid;
	}

	/*
	 * Make sure to choose a thread which still has a reference to mm
	 * during the group exit
	 */
	p = find_lock_task_mm(task);
	if (!p) {
		ret = -ESRCH;
		goto put_task;
	}

1177 1178 1179 1180 1181 1182 1183 1184 1185
	if (mmget_not_zero(p->mm)) {
		mm = p->mm;
		if (task_will_free_mem(p))
			reap = true;
		else {
			/* Error only if the work has not been done already */
			if (!test_bit(MMF_OOM_SKIP, &mm->flags))
				ret = -EINVAL;
		}
1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200
	}
	task_unlock(p);

	if (!reap)
		goto drop_mm;

	if (mmap_read_lock_killable(mm)) {
		ret = -EINTR;
		goto drop_mm;
	}
	if (!__oom_reap_task_mm(mm))
		ret = -EAGAIN;
	mmap_read_unlock(mm);

drop_mm:
1201 1202
	if (mm)
		mmput(mm);
1203 1204 1205 1206 1207 1208 1209 1210 1211
put_task:
	put_task_struct(task);
put_pid:
	put_pid(pid);
	return ret;
#else
	return -ENOSYS;
#endif /* CONFIG_MMU */
}