oom_kill.c 28.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6
/*
 *  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 已提交
7 8
 *  Copyright (C)  2010  Google, Inc.
 *	Rewritten by David Rientjes
L
Linus Torvalds 已提交
9 10
 *
 *  The routines in this file are used to kill a process when
P
Paul Jackson 已提交
11 12
 *  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 已提交
13 14 15 16 17 18 19
 *
 *  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.
 */

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

#include <asm/tlb.h>
#include "internal.h"
46 47 48

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

50
int sysctl_panic_on_oom;
51
int sysctl_oom_kill_allocating_task;
52
int sysctl_oom_dump_tasks = 1;
53 54

DEFINE_MUTEX(oom_lock);
L
Linus Torvalds 已提交
55

56 57 58
#ifdef CONFIG_NUMA
/**
 * has_intersects_mems_allowed() - check task eligiblity for kill
59
 * @start: task struct of which task to consider
60 61 62 63 64
 * @mask: nodemask passed to page allocator for mempolicy ooms
 *
 * 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.
65
 */
66
static bool has_intersects_mems_allowed(struct task_struct *start,
67
					const nodemask_t *mask)
68
{
69 70
	struct task_struct *tsk;
	bool ret = false;
71

72
	rcu_read_lock();
73
	for_each_thread(start, tsk) {
74 75 76 77 78 79 80
		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.
			 */
81
			ret = mempolicy_nodemask_intersects(tsk, mask);
82 83 84 85 86
		} else {
			/*
			 * This is not a mempolicy constrained oom, so only
			 * check the mems of tsk's cpuset.
			 */
87
			ret = cpuset_mems_allowed_intersects(current, tsk);
88
		}
89 90
		if (ret)
			break;
91
	}
92
	rcu_read_unlock();
93

94
	return ret;
95 96 97 98 99 100
}
#else
static bool has_intersects_mems_allowed(struct task_struct *tsk,
					const nodemask_t *mask)
{
	return true;
101
}
102
#endif /* CONFIG_NUMA */
103

104 105 106 107 108 109
/*
 * The process p may have detached its own ->mm while exiting or through
 * use_mm(), but one or more of its subthreads may still have a valid
 * pointer.  Return p, or any of its subthreads with a valid ->mm, with
 * task_lock() held.
 */
110
struct task_struct *find_lock_task_mm(struct task_struct *p)
111
{
112
	struct task_struct *t;
113

114 115
	rcu_read_lock();

116
	for_each_thread(p, t) {
117 118
		task_lock(t);
		if (likely(t->mm))
119
			goto found;
120
		task_unlock(t);
121
	}
122 123 124
	t = NULL;
found:
	rcu_read_unlock();
125

126
	return t;
127 128
}

129 130 131 132 133 134 135 136 137
/*
 * 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;
}

138 139 140 141 142
static inline bool is_memcg_oom(struct oom_control *oc)
{
	return oc->memcg != NULL;
}

143
/* return true if the task is not adequate as candidate victim task. */
144
static bool oom_unkillable_task(struct task_struct *p,
145
		struct mem_cgroup *memcg, const nodemask_t *nodemask)
146 147 148 149 150 151 152
{
	if (is_global_init(p))
		return true;
	if (p->flags & PF_KTHREAD)
		return true;

	/* When mem_cgroup_out_of_memory() and p is not member of the group */
153
	if (memcg && !task_in_mem_cgroup(p, memcg))
154 155 156 157 158 159 160 161 162
		return true;

	/* p may not have freeable memory in nodemask */
	if (!has_intersects_mems_allowed(p, nodemask))
		return true;

	return false;
}

L
Linus Torvalds 已提交
163
/**
D
David Rientjes 已提交
164
 * oom_badness - heuristic function to determine which candidate task to kill
L
Linus Torvalds 已提交
165
 * @p: task struct of which task we should calculate
D
David Rientjes 已提交
166
 * @totalpages: total present RAM allowed for page allocation
L
Linus Torvalds 已提交
167
 *
D
David Rientjes 已提交
168 169 170
 * 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 已提交
171
 */
172 173
unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
			  const nodemask_t *nodemask, unsigned long totalpages)
L
Linus Torvalds 已提交
174
{
175
	long points;
176
	long adj;
177

178
	if (oom_unkillable_task(p, memcg, nodemask))
179
		return 0;
L
Linus Torvalds 已提交
180

181 182
	p = find_lock_task_mm(p);
	if (!p)
L
Linus Torvalds 已提交
183 184
		return 0;

185 186
	/*
	 * Do not even consider tasks which are explicitly marked oom
187 188
	 * unkillable or have been already oom reaped or the are in
	 * the middle of vfork
189
	 */
190
	adj = (long)p->signal->oom_score_adj;
191
	if (adj == OOM_SCORE_ADJ_MIN ||
192
			test_bit(MMF_OOM_SKIP, &p->mm->flags) ||
193
			in_vfork(p)) {
194 195 196 197
		task_unlock(p);
		return 0;
	}

L
Linus Torvalds 已提交
198
	/*
D
David Rientjes 已提交
199
	 * The baseline for the badness score is the proportion of RAM that each
200
	 * task's rss, pagetable and swap space use.
L
Linus Torvalds 已提交
201
	 */
202 203
	points = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) +
		atomic_long_read(&p->mm->nr_ptes) + mm_nr_pmds(p->mm);
D
David Rientjes 已提交
204
	task_unlock(p);
L
Linus Torvalds 已提交
205 206

	/*
D
David Rientjes 已提交
207 208
	 * Root processes get 3% bonus, just like the __vm_enough_memory()
	 * implementation used by LSMs.
L
Linus Torvalds 已提交
209
	 */
D
David Rientjes 已提交
210
	if (has_capability_noaudit(p, CAP_SYS_ADMIN))
211
		points -= (points * 3) / 100;
L
Linus Torvalds 已提交
212

213 214 215
	/* Normalize to oom_score_adj units */
	adj *= totalpages / 1000;
	points += adj;
L
Linus Torvalds 已提交
216

217
	/*
218 219
	 * Never return 0 for an eligible task regardless of the root bonus and
	 * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).
220
	 */
221
	return points > 0 ? points : 1;
L
Linus Torvalds 已提交
222 223
}

224 225 226 227 228 229 230
enum oom_constraint {
	CONSTRAINT_NONE,
	CONSTRAINT_CPUSET,
	CONSTRAINT_MEMORY_POLICY,
	CONSTRAINT_MEMCG,
};

231 232 233
/*
 * Determine the type of allocation constraint.
 */
234
static enum oom_constraint constrained_alloc(struct oom_control *oc)
235
{
236
	struct zone *zone;
237
	struct zoneref *z;
238
	enum zone_type high_zoneidx = gfp_zone(oc->gfp_mask);
D
David Rientjes 已提交
239 240
	bool cpuset_limited = false;
	int nid;
241

242 243 244 245 246
	if (is_memcg_oom(oc)) {
		oc->totalpages = mem_cgroup_get_limit(oc->memcg) ?: 1;
		return CONSTRAINT_MEMCG;
	}

D
David Rientjes 已提交
247
	/* Default to all available memory */
248 249 250 251
	oc->totalpages = totalram_pages + total_swap_pages;

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

253
	if (!oc->zonelist)
D
David Rientjes 已提交
254
		return CONSTRAINT_NONE;
255 256 257 258 259
	/*
	 * 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.
	 */
260
	if (oc->gfp_mask & __GFP_THISNODE)
261
		return CONSTRAINT_NONE;
262

263
	/*
D
David Rientjes 已提交
264 265 266
	 * 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().
267
	 */
268 269
	if (oc->nodemask &&
	    !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {
270
		oc->totalpages = total_swap_pages;
271
		for_each_node_mask(nid, *oc->nodemask)
272
			oc->totalpages += node_spanned_pages(nid);
273
		return CONSTRAINT_MEMORY_POLICY;
D
David Rientjes 已提交
274
	}
275 276

	/* Check this allocation failure is caused by cpuset's wall function */
277 278 279
	for_each_zone_zonelist_nodemask(zone, z, oc->zonelist,
			high_zoneidx, oc->nodemask)
		if (!cpuset_zone_allowed(zone, oc->gfp_mask))
D
David Rientjes 已提交
280
			cpuset_limited = true;
281

D
David Rientjes 已提交
282
	if (cpuset_limited) {
283
		oc->totalpages = total_swap_pages;
D
David Rientjes 已提交
284
		for_each_node_mask(nid, cpuset_current_mems_allowed)
285
			oc->totalpages += node_spanned_pages(nid);
D
David Rientjes 已提交
286 287
		return CONSTRAINT_CPUSET;
	}
288 289 290
	return CONSTRAINT_NONE;
}

291
static int oom_evaluate_task(struct task_struct *task, void *arg)
292
{
293 294 295
	struct oom_control *oc = arg;
	unsigned long points;

296
	if (oom_unkillable_task(task, NULL, oc->nodemask))
297
		goto next;
298 299 300

	/*
	 * This task already has access to memory reserves and is being killed.
301
	 * Don't allow any other task to have access to the reserves unless
302
	 * the task has MMF_OOM_SKIP because chances that it would release
303
	 * any memory is quite low.
304
	 */
305 306
	if (!is_sysrq_oom(oc) && tsk_is_oom_victim(task)) {
		if (test_bit(MMF_OOM_SKIP, &task->signal->oom_mm->flags))
307 308
			goto next;
		goto abort;
309
	}
310

311 312 313 314
	/*
	 * If task is allocating a lot of memory and has been marked to be
	 * killed first if it triggers an oom, then select it.
	 */
315 316 317 318
	if (oom_task_origin(task)) {
		points = ULONG_MAX;
		goto select;
	}
319

320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339
	points = oom_badness(task, NULL, oc->nodemask, oc->totalpages);
	if (!points || points < oc->chosen_points)
		goto next;

	/* Prefer thread group leaders for display purposes */
	if (points == oc->chosen_points && thread_group_leader(oc->chosen))
		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;
340 341
}

L
Linus Torvalds 已提交
342
/*
343 344
 * 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 已提交
345
 */
346
static void select_bad_process(struct oom_control *oc)
L
Linus Torvalds 已提交
347
{
348 349 350 351
	if (is_memcg_oom(oc))
		mem_cgroup_scan_tasks(oc->memcg, oom_evaluate_task, oc);
	else {
		struct task_struct *p;
352

353 354 355 356 357
		rcu_read_lock();
		for_each_process(p)
			if (oom_evaluate_task(p, oc))
				break;
		rcu_read_unlock();
358
	}
359

360
	oc->chosen_points = oc->chosen_points * 1000 / oc->totalpages;
L
Linus Torvalds 已提交
361 362
}

363
/**
R
Randy Dunlap 已提交
364
 * dump_tasks - dump current memory state of all system tasks
W
Wanpeng Li 已提交
365
 * @memcg: current's memory controller, if constrained
366
 * @nodemask: nodemask passed to page allocator for mempolicy ooms
R
Randy Dunlap 已提交
367
 *
368 369 370
 * 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.
371 372
 * State information includes task's pid, uid, tgid, vm size, rss, nr_ptes,
 * swapents, oom_score_adj value, and name.
373
 */
374
static void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask)
375
{
376 377
	struct task_struct *p;
	struct task_struct *task;
378

379
	pr_info("[ pid ]   uid  tgid total_vm      rss nr_ptes nr_pmds swapents oom_score_adj name\n");
380
	rcu_read_lock();
381
	for_each_process(p) {
382
		if (oom_unkillable_task(p, memcg, nodemask))
383
			continue;
384

385 386
		task = find_lock_task_mm(p);
		if (!task) {
387
			/*
388 389
			 * This is a kthread or all of p's threads have already
			 * detached their mm's.  There's no need to report
390
			 * them; they can't be oom killed anyway.
391 392 393
			 */
			continue;
		}
394

395
		pr_info("[%5d] %5d %5d %8lu %8lu %7ld %7ld %8lu         %5hd %s\n",
396 397
			task->pid, from_kuid(&init_user_ns, task_uid(task)),
			task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
398
			atomic_long_read(&task->mm->nr_ptes),
399
			mm_nr_pmds(task->mm),
400
			get_mm_counter(task->mm, MM_SWAPENTS),
D
David Rientjes 已提交
401
			task->signal->oom_score_adj, task->comm);
402 403
		task_unlock(task);
	}
404
	rcu_read_unlock();
405 406
}

407
static void dump_header(struct oom_control *oc, struct task_struct *p)
408
{
409 410 411 412 413 414 415 416
	pr_warn("%s invoked oom-killer: gfp_mask=%#x(%pGg), nodemask=",
		current->comm, oc->gfp_mask, &oc->gfp_mask);
	if (oc->nodemask)
		pr_cont("%*pbl", nodemask_pr_args(oc->nodemask));
	else
		pr_cont("(null)");
	pr_cont(",  order=%d, oom_score_adj=%hd\n",
		oc->order, current->signal->oom_score_adj);
417 418
	if (!IS_ENABLED(CONFIG_COMPACTION) && oc->order)
		pr_warn("COMPACTION is disabled!!!\n");
419

420
	cpuset_print_current_mems_allowed();
421
	dump_stack();
422 423
	if (oc->memcg)
		mem_cgroup_print_oom_info(oc->memcg, p);
424
	else
425
		show_mem(SHOW_MEM_FILTER_NODES, oc->nodemask);
426
	if (sysctl_oom_dump_tasks)
427
		dump_tasks(oc->memcg, oc->nodemask);
428 429
}

430
/*
431
 * Number of OOM victims in flight
432
 */
433 434
static atomic_t oom_victims = ATOMIC_INIT(0);
static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);
435

436
static bool oom_killer_disabled __read_mostly;
437

438 439
#define K(x) ((x) << (PAGE_SHIFT-10))

440 441 442 443 444 445
/*
 * 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.
 */
446
bool process_shares_mm(struct task_struct *p, struct mm_struct *mm)
447 448 449 450 451 452 453 454 455 456 457 458
{
	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 已提交
459 460 461 462 463 464 465
#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);
466
static struct task_struct *oom_reaper_list;
467 468
static DEFINE_SPINLOCK(oom_reaper_lock);

469
static bool __oom_reap_task_mm(struct task_struct *tsk, struct mm_struct *mm)
M
Michal Hocko 已提交
470 471 472 473 474
{
	struct mmu_gather tlb;
	struct vm_area_struct *vma;
	bool ret = true;

475 476 477
	/*
	 * We have to make sure to not race with the victim exit path
	 * and cause premature new oom victim selection:
478
	 * __oom_reap_task_mm		exit_mm
479
	 *   mmget_not_zero
480 481 482 483 484 485 486 487 488 489 490
	 *				  mmput
	 *				    atomic_dec_and_test
	 *				  exit_oom_victim
	 *				[...]
	 *				out_of_memory
	 *				  select_bad_process
	 *				    # no TIF_MEMDIE task selects new victim
	 *  unmap_page_range # frees some memory
	 */
	mutex_lock(&oom_lock);

M
Michal Hocko 已提交
491 492
	if (!down_read_trylock(&mm->mmap_sem)) {
		ret = false;
493
		goto unlock_oom;
494 495 496 497 498 499 500 501 502
	}

	/*
	 * increase mm_users only after we know we will reap something so
	 * that the mmput_async is called only when we have reaped something
	 * and delayed __mmput doesn't matter that much
	 */
	if (!mmget_not_zero(mm)) {
		up_read(&mm->mmap_sem);
503
		goto unlock_oom;
M
Michal Hocko 已提交
504 505
	}

506 507 508 509 510 511 512 513
	/*
	 * 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);

M
Michal Hocko 已提交
514 515
	tlb_gather_mmu(&tlb, mm, 0, -1);
	for (vma = mm->mmap ; vma; vma = vma->vm_next) {
516
		if (!can_madv_dontneed_vma(vma))
M
Michal Hocko 已提交
517 518 519 520 521 522 523 524 525 526 527 528 529 530
			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))
			unmap_page_range(&tlb, vma, vma->vm_start, vma->vm_end,
531
					 NULL);
M
Michal Hocko 已提交
532 533
	}
	tlb_finish_mmu(&tlb, 0, -1);
534 535 536 537 538
	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)));
M
Michal Hocko 已提交
539
	up_read(&mm->mmap_sem);
540

541 542 543 544 545
	/*
	 * Drop our reference but make sure the mmput slow path is called from a
	 * different context because we shouldn't risk we get stuck there and
	 * put the oom_reaper out of the way.
	 */
546 547 548
	mmput_async(mm);
unlock_oom:
	mutex_unlock(&oom_lock);
M
Michal Hocko 已提交
549 550 551
	return ret;
}

552
#define MAX_OOM_REAP_RETRIES 10
553
static void oom_reap_task(struct task_struct *tsk)
M
Michal Hocko 已提交
554 555
{
	int attempts = 0;
556
	struct mm_struct *mm = tsk->signal->oom_mm;
M
Michal Hocko 已提交
557 558

	/* Retry the down_read_trylock(mmap_sem) a few times */
559
	while (attempts++ < MAX_OOM_REAP_RETRIES && !__oom_reap_task_mm(tsk, mm))
M
Michal Hocko 已提交
560 561
		schedule_timeout_idle(HZ/10);

562 563
	if (attempts <= MAX_OOM_REAP_RETRIES)
		goto done;
564

565

566 567 568
	pr_info("oom_reaper: unable to reap pid:%d (%s)\n",
		task_pid_nr(tsk), tsk->comm);
	debug_show_all_locks();
569

570
done:
571 572
	tsk->oom_reaper_list = NULL;

573 574 575 576
	/*
	 * Hide this mm from OOM killer because it has been either reaped or
	 * somebody can't call up_write(mmap_sem).
	 */
577
	set_bit(MMF_OOM_SKIP, &mm->flags);
578

M
Michal Hocko 已提交
579
	/* Drop a reference taken by wake_oom_reaper */
580
	put_task_struct(tsk);
M
Michal Hocko 已提交
581 582 583 584 585
}

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

588
		wait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL);
589
		spin_lock(&oom_reaper_lock);
590 591 592
		if (oom_reaper_list != NULL) {
			tsk = oom_reaper_list;
			oom_reaper_list = tsk->oom_reaper_list;
593 594 595 596 597
		}
		spin_unlock(&oom_reaper_lock);

		if (tsk)
			oom_reap_task(tsk);
M
Michal Hocko 已提交
598 599 600 601 602
	}

	return 0;
}

603
static void wake_oom_reaper(struct task_struct *tsk)
M
Michal Hocko 已提交
604
{
605 606 607 608 609
	if (!oom_reaper_th)
		return;

	/* tsk is already queued? */
	if (tsk == oom_reaper_list || tsk->oom_reaper_list)
M
Michal Hocko 已提交
610 611
		return;

612
	get_task_struct(tsk);
M
Michal Hocko 已提交
613

614
	spin_lock(&oom_reaper_lock);
615 616
	tsk->oom_reaper_list = oom_reaper_list;
	oom_reaper_list = tsk;
617 618
	spin_unlock(&oom_reaper_lock);
	wake_up(&oom_reaper_wait);
M
Michal Hocko 已提交
619 620 621 622 623 624 625 626 627 628 629 630 631
}

static int __init oom_init(void)
{
	oom_reaper_th = kthread_run(oom_reaper, NULL, "oom_reaper");
	if (IS_ERR(oom_reaper_th)) {
		pr_err("Unable to start OOM reaper %ld. Continuing regardless\n",
				PTR_ERR(oom_reaper_th));
		oom_reaper_th = NULL;
	}
	return 0;
}
subsys_initcall(oom_init)
632 633 634 635 636
#else
static inline void wake_oom_reaper(struct task_struct *tsk)
{
}
#endif /* CONFIG_MMU */
M
Michal Hocko 已提交
637

638
/**
639
 * mark_oom_victim - mark the given task as OOM victim
640
 * @tsk: task to mark
641
 *
642
 * Has to be called with oom_lock held and never after
643
 * oom has been disabled already.
644 645 646
 *
 * tsk->mm has to be non NULL and caller has to guarantee it is stable (either
 * under task_lock or operate on the current).
647
 */
648
static void mark_oom_victim(struct task_struct *tsk)
649
{
650 651
	struct mm_struct *mm = tsk->mm;

652 653 654 655
	WARN_ON(oom_killer_disabled);
	/* OOM killer might race with memcg OOM */
	if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))
		return;
656 657 658

	/* oom_mm is bound to the signal struct life time. */
	if (!cmpxchg(&tsk->signal->oom_mm, NULL, mm))
V
Vegard Nossum 已提交
659
		mmgrab(tsk->signal->oom_mm);
660

661 662 663 664 665 666 667
	/*
	 * 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);
668
	atomic_inc(&oom_victims);
669 670 671
}

/**
672
 * exit_oom_victim - note the exit of an OOM victim
673
 */
674
void exit_oom_victim(void)
675
{
676
	clear_thread_flag(TIF_MEMDIE);
677

678
	if (!atomic_dec_return(&oom_victims))
679 680 681
		wake_up_all(&oom_victims_wait);
}

682 683 684 685 686 687 688 689
/**
 * oom_killer_enable - enable OOM killer
 */
void oom_killer_enable(void)
{
	oom_killer_disabled = false;
}

690 691
/**
 * oom_killer_disable - disable OOM killer
692
 * @timeout: maximum timeout to wait for oom victims in jiffies
693 694
 *
 * Forces all page allocations to fail rather than trigger OOM killer.
695 696
 * Will block and wait until all OOM victims are killed or the given
 * timeout expires.
697 698 699 700 701 702 703 704
 *
 * 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.
 */
705
bool oom_killer_disable(signed long timeout)
706
{
707 708
	signed long ret;

709
	/*
710 711
	 * 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).
712
	 */
713
	if (mutex_lock_killable(&oom_lock))
714 715
		return false;
	oom_killer_disabled = true;
716
	mutex_unlock(&oom_lock);
717

718 719 720 721 722 723
	ret = wait_event_interruptible_timeout(oom_victims_wait,
			!atomic_read(&oom_victims), timeout);
	if (ret <= 0) {
		oom_killer_enable();
		return false;
	}
724 725 726 727

	return true;
}

728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752
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.
753 754
 * Caller has to make sure that task->mm is stable (hold task_lock or
 * it operates on the current).
755
 */
756
static bool task_will_free_mem(struct task_struct *task)
757
{
758
	struct mm_struct *mm = task->mm;
759
	struct task_struct *p;
760
	bool ret = true;
761 762

	/*
763 764 765
	 * 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.
766
	 */
767
	if (!mm)
768 769
		return false;

770 771
	if (!__task_will_free_mem(task))
		return false;
772 773 774 775 776

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

780
	if (atomic_read(&mm->mm_users) <= 1)
781 782 783
		return true;

	/*
784 785 786
	 * 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.
787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802
	 */
	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;
}

803
static void oom_kill_process(struct oom_control *oc, const char *message)
L
Linus Torvalds 已提交
804
{
805 806
	struct task_struct *p = oc->chosen;
	unsigned int points = oc->chosen_points;
807
	struct task_struct *victim = p;
808
	struct task_struct *child;
809
	struct task_struct *t;
810
	struct mm_struct *mm;
811
	unsigned int victim_points = 0;
812 813
	static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
					      DEFAULT_RATELIMIT_BURST);
814
	bool can_oom_reap = true;
L
Linus Torvalds 已提交
815

816 817 818 819
	/*
	 * If the task is already exiting, don't alarm the sysadmin or kill
	 * its children or threads, just set TIF_MEMDIE so it can die quickly
	 */
820
	task_lock(p);
821
	if (task_will_free_mem(p)) {
822
		mark_oom_victim(p);
823
		wake_oom_reaper(p);
824
		task_unlock(p);
825
		put_task_struct(p);
826
		return;
827
	}
828
	task_unlock(p);
829

830
	if (__ratelimit(&oom_rs))
831
		dump_header(oc, p);
832

833
	pr_err("%s: Kill process %d (%s) score %u or sacrifice child\n",
834
		message, task_pid_nr(p), p->comm, points);
N
Nick Piggin 已提交
835

836 837
	/*
	 * If any of p's children has a different mm and is eligible for kill,
838
	 * the one with the highest oom_badness() score is sacrificed for its
839 840 841
	 * parent.  This attempts to lose the minimal amount of work done while
	 * still freeing memory.
	 */
842
	read_lock(&tasklist_lock);
843
	for_each_thread(p, t) {
844
		list_for_each_entry(child, &t->children, sibling) {
D
David Rientjes 已提交
845
			unsigned int child_points;
846

847
			if (process_shares_mm(child, p->mm))
848
				continue;
D
David Rientjes 已提交
849 850 851
			/*
			 * oom_badness() returns 0 if the thread is unkillable
			 */
852
			child_points = oom_badness(child,
853
				oc->memcg, oc->nodemask, oc->totalpages);
854
			if (child_points > victim_points) {
855
				put_task_struct(victim);
856 857
				victim = child;
				victim_points = child_points;
858
				get_task_struct(victim);
859
			}
860
		}
861
	}
862
	read_unlock(&tasklist_lock);
863

864 865 866
	p = find_lock_task_mm(victim);
	if (!p) {
		put_task_struct(victim);
867
		return;
868 869 870 871 872
	} else if (victim != p) {
		get_task_struct(p);
		put_task_struct(victim);
		victim = p;
	}
873

874
	/* Get a reference to safely compare mm after task_unlock(victim) */
875
	mm = victim->mm;
V
Vegard Nossum 已提交
876
	mmgrab(mm);
877 878 879 880 881 882
	/*
	 * We should send SIGKILL before setting TIF_MEMDIE in order to prevent
	 * the OOM victim from depleting the memory reserves from the user
	 * space under its control.
	 */
	do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
883
	mark_oom_victim(victim);
884
	pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
885 886
		task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
		K(get_mm_counter(victim->mm, MM_ANONPAGES)),
887 888
		K(get_mm_counter(victim->mm, MM_FILEPAGES)),
		K(get_mm_counter(victim->mm, MM_SHMEMPAGES)));
889 890 891 892 893 894 895 896 897 898 899
	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
	 * depletion of all memory.  This prevents mm->mmap_sem livelock when an
	 * 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.
	 */
900
	rcu_read_lock();
901
	for_each_process(p) {
902
		if (!process_shares_mm(p, mm))
903 904 905
			continue;
		if (same_thread_group(p, victim))
			continue;
906
		if (is_global_init(p)) {
M
Michal Hocko 已提交
907
			can_oom_reap = false;
908
			set_bit(MMF_OOM_SKIP, &mm->flags);
909 910 911
			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);
912
			continue;
M
Michal Hocko 已提交
913
		}
914 915 916 917 918 919
		/*
		 * No use_mm() user needs to read from the userspace so we are
		 * ok to reap it.
		 */
		if (unlikely(p->flags & PF_KTHREAD))
			continue;
920 921
		do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
	}
922
	rcu_read_unlock();
923

M
Michal Hocko 已提交
924
	if (can_oom_reap)
925
		wake_oom_reaper(victim);
M
Michal Hocko 已提交
926

927
	mmdrop(mm);
928
	put_task_struct(victim);
L
Linus Torvalds 已提交
929
}
930
#undef K
L
Linus Torvalds 已提交
931

932 933 934
/*
 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
 */
935 936
static void check_panic_on_oom(struct oom_control *oc,
			       enum oom_constraint constraint)
937 938 939 940 941 942 943 944 945 946 947 948
{
	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.
		 */
		if (constraint != CONSTRAINT_NONE)
			return;
	}
949
	/* Do not panic for oom kills triggered by sysrq */
950
	if (is_sysrq_oom(oc))
951
		return;
952
	dump_header(oc, NULL);
953 954 955 956
	panic("Out of memory: %s panic_on_oom is enabled\n",
		sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
}

957 958 959 960 961 962 963 964 965 966 967 968 969 970
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 已提交
971
/**
972 973
 * out_of_memory - kill the "best" process when we run out of memory
 * @oc: pointer to struct oom_control
L
Linus Torvalds 已提交
974 975 976 977 978 979
 *
 * 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.
 */
980
bool out_of_memory(struct oom_control *oc)
L
Linus Torvalds 已提交
981
{
982
	unsigned long freed = 0;
983
	enum oom_constraint constraint = CONSTRAINT_NONE;
984

985 986 987
	if (oom_killer_disabled)
		return false;

988 989 990 991 992 993
	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 已提交
994

995
	/*
996 997 998
	 * 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.
999
	 */
1000
	if (task_will_free_mem(current)) {
1001
		mark_oom_victim(current);
1002
		wake_oom_reaper(current);
1003
		return true;
1004 1005
	}

1006 1007 1008 1009 1010 1011
	/*
	 * 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
	 * ___GFP_DIRECT_RECLAIM to get here.
	 */
1012
	if (oc->gfp_mask && !(oc->gfp_mask & __GFP_FS))
1013 1014
		return true;

1015 1016
	/*
	 * Check if there were limitations on the allocation (only relevant for
1017
	 * NUMA and memcg) that may require different handling.
1018
	 */
1019
	constraint = constrained_alloc(oc);
1020 1021
	if (constraint != CONSTRAINT_MEMORY_POLICY)
		oc->nodemask = NULL;
1022
	check_panic_on_oom(oc, constraint);
1023

1024 1025
	if (!is_memcg_oom(oc) && sysctl_oom_kill_allocating_task &&
	    current->mm && !oom_unkillable_task(current, NULL, oc->nodemask) &&
1026
	    current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
1027
		get_task_struct(current);
1028 1029
		oc->chosen = current;
		oom_kill_process(oc, "Out of memory (oom_kill_allocating_task)");
1030
		return true;
1031 1032
	}

1033
	select_bad_process(oc);
1034
	/* Found nothing?!?! Either we hang forever, or we panic. */
1035
	if (!oc->chosen && !is_sysrq_oom(oc) && !is_memcg_oom(oc)) {
1036
		dump_header(oc, NULL);
1037 1038
		panic("Out of memory and no killable processes...\n");
	}
1039 1040 1041
	if (oc->chosen && oc->chosen != (void *)-1UL) {
		oom_kill_process(oc, !is_memcg_oom(oc) ? "Out of memory" :
				 "Memory cgroup out of memory");
1042 1043 1044 1045
		/*
		 * Give the killed process a good chance to exit before trying
		 * to allocate memory again.
		 */
1046
		schedule_timeout_killable(1);
1047
	}
1048
	return !!oc->chosen;
1049 1050
}

1051 1052
/*
 * The pagefault handler calls here because it is out of memory, so kill a
V
Vladimir Davydov 已提交
1053 1054
 * memory-hogging task. If oom_lock is held by somebody else, a parallel oom
 * killing is already in progress so do nothing.
1055 1056 1057
 */
void pagefault_out_of_memory(void)
{
1058 1059 1060
	struct oom_control oc = {
		.zonelist = NULL,
		.nodemask = NULL,
1061
		.memcg = NULL,
1062 1063 1064 1065
		.gfp_mask = 0,
		.order = 0,
	};

1066
	if (mem_cgroup_oom_synchronize(true))
1067
		return;
1068

1069 1070
	if (!mutex_trylock(&oom_lock))
		return;
1071
	out_of_memory(&oc);
1072
	mutex_unlock(&oom_lock);
1073
}