oom_kill.c 27.3 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 25 26 27
#include <linux/sched.h>
#include <linux/swap.h>
#include <linux/timex.h>
#include <linux/jiffies.h>
28
#include <linux/cpuset.h>
29
#include <linux/export.h>
30
#include <linux/notifier.h>
31
#include <linux/memcontrol.h>
32
#include <linux/mempolicy.h>
33
#include <linux/security.h>
34
#include <linux/ptrace.h>
35
#include <linux/freezer.h>
36
#include <linux/ftrace.h>
37
#include <linux/ratelimit.h>
M
Michal Hocko 已提交
38 39 40 41 42
#include <linux/kthread.h>
#include <linux/init.h>

#include <asm/tlb.h>
#include "internal.h"
43 44 45

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

47
int sysctl_panic_on_oom;
48
int sysctl_oom_kill_allocating_task;
49
int sysctl_oom_dump_tasks = 1;
50 51

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

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

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

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

101 102 103 104 105 106
/*
 * 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.
 */
107
struct task_struct *find_lock_task_mm(struct task_struct *p)
108
{
109
	struct task_struct *t;
110

111 112
	rcu_read_lock();

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

123
	return t;
124 125
}

126 127 128 129 130 131 132 133 134
/*
 * 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;
}

135
/* return true if the task is not adequate as candidate victim task. */
136
static bool oom_unkillable_task(struct task_struct *p,
137
		struct mem_cgroup *memcg, const nodemask_t *nodemask)
138 139 140 141 142 143 144
{
	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 */
145
	if (memcg && !task_in_mem_cgroup(p, memcg))
146 147 148 149 150 151 152 153 154
		return true;

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

	return false;
}

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

170
	if (oom_unkillable_task(p, memcg, nodemask))
171
		return 0;
L
Linus Torvalds 已提交
172

173 174
	p = find_lock_task_mm(p);
	if (!p)
L
Linus Torvalds 已提交
175 176
		return 0;

177 178
	/*
	 * Do not even consider tasks which are explicitly marked oom
179 180
	 * unkillable or have been already oom reaped or the are in
	 * the middle of vfork
181
	 */
182
	adj = (long)p->signal->oom_score_adj;
183
	if (adj == OOM_SCORE_ADJ_MIN ||
184 185
			test_bit(MMF_OOM_REAPED, &p->mm->flags) ||
			in_vfork(p)) {
186 187 188 189
		task_unlock(p);
		return 0;
	}

L
Linus Torvalds 已提交
190
	/*
D
David Rientjes 已提交
191
	 * The baseline for the badness score is the proportion of RAM that each
192
	 * task's rss, pagetable and swap space use.
L
Linus Torvalds 已提交
193
	 */
194 195
	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 已提交
196
	task_unlock(p);
L
Linus Torvalds 已提交
197 198

	/*
D
David Rientjes 已提交
199 200
	 * Root processes get 3% bonus, just like the __vm_enough_memory()
	 * implementation used by LSMs.
L
Linus Torvalds 已提交
201
	 */
D
David Rientjes 已提交
202
	if (has_capability_noaudit(p, CAP_SYS_ADMIN))
203
		points -= (points * 3) / 100;
L
Linus Torvalds 已提交
204

205 206 207
	/* Normalize to oom_score_adj units */
	adj *= totalpages / 1000;
	points += adj;
L
Linus Torvalds 已提交
208

209
	/*
210 211
	 * 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).
212
	 */
213
	return points > 0 ? points : 1;
L
Linus Torvalds 已提交
214 215
}

216 217 218 219
/*
 * Determine the type of allocation constraint.
 */
#ifdef CONFIG_NUMA
220 221
static enum oom_constraint constrained_alloc(struct oom_control *oc,
					     unsigned long *totalpages)
222
{
223
	struct zone *zone;
224
	struct zoneref *z;
225
	enum zone_type high_zoneidx = gfp_zone(oc->gfp_mask);
D
David Rientjes 已提交
226 227
	bool cpuset_limited = false;
	int nid;
228

D
David Rientjes 已提交
229 230 231
	/* Default to all available memory */
	*totalpages = totalram_pages + total_swap_pages;

232
	if (!oc->zonelist)
D
David Rientjes 已提交
233
		return CONSTRAINT_NONE;
234 235 236 237 238
	/*
	 * 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.
	 */
239
	if (oc->gfp_mask & __GFP_THISNODE)
240
		return CONSTRAINT_NONE;
241

242
	/*
D
David Rientjes 已提交
243 244 245
	 * 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().
246
	 */
247 248
	if (oc->nodemask &&
	    !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {
D
David Rientjes 已提交
249
		*totalpages = total_swap_pages;
250
		for_each_node_mask(nid, *oc->nodemask)
D
David Rientjes 已提交
251
			*totalpages += node_spanned_pages(nid);
252
		return CONSTRAINT_MEMORY_POLICY;
D
David Rientjes 已提交
253
	}
254 255

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

D
David Rientjes 已提交
261 262 263 264 265 266
	if (cpuset_limited) {
		*totalpages = total_swap_pages;
		for_each_node_mask(nid, cpuset_current_mems_allowed)
			*totalpages += node_spanned_pages(nid);
		return CONSTRAINT_CPUSET;
	}
267 268
	return CONSTRAINT_NONE;
}
269
#else
270 271
static enum oom_constraint constrained_alloc(struct oom_control *oc,
					     unsigned long *totalpages)
272
{
D
David Rientjes 已提交
273
	*totalpages = totalram_pages + total_swap_pages;
274 275 276
	return CONSTRAINT_NONE;
}
#endif
277

278
enum oom_scan_t oom_scan_process_thread(struct oom_control *oc,
279
					struct task_struct *task)
280
{
281
	if (oom_unkillable_task(task, NULL, oc->nodemask))
282 283 284 285 286 287
		return OOM_SCAN_CONTINUE;

	/*
	 * This task already has access to memory reserves and is being killed.
	 * Don't allow any other task to have access to the reserves.
	 */
288 289
	if (!is_sysrq_oom(oc) && atomic_read(&task->signal->oom_victims))
		return OOM_SCAN_ABORT;
290

291 292 293 294 295 296 297
	/*
	 * If task is allocating a lot of memory and has been marked to be
	 * killed first if it triggers an oom, then select it.
	 */
	if (oom_task_origin(task))
		return OOM_SCAN_SELECT;

298 299 300
	return OOM_SCAN_OK;
}

L
Linus Torvalds 已提交
301 302
/*
 * Simple selection loop. We chose the process with the highest
303
 * number of 'points'.  Returns -1 on scan abort.
L
Linus Torvalds 已提交
304
 */
305 306
static struct task_struct *select_bad_process(struct oom_control *oc,
		unsigned int *ppoints, unsigned long totalpages)
L
Linus Torvalds 已提交
307
{
308
	struct task_struct *p;
L
Linus Torvalds 已提交
309
	struct task_struct *chosen = NULL;
310
	unsigned long chosen_points = 0;
L
Linus Torvalds 已提交
311

312
	rcu_read_lock();
313
	for_each_process(p) {
D
David Rientjes 已提交
314
		unsigned int points;
P
Paul Jackson 已提交
315

316
		switch (oom_scan_process_thread(oc, p)) {
317 318 319 320 321
		case OOM_SCAN_SELECT:
			chosen = p;
			chosen_points = ULONG_MAX;
			/* fall through */
		case OOM_SCAN_CONTINUE:
322
			continue;
323
		case OOM_SCAN_ABORT:
324
			rcu_read_unlock();
325
			return (struct task_struct *)(-1UL);
326 327 328
		case OOM_SCAN_OK:
			break;
		};
329
		points = oom_badness(p, NULL, oc->nodemask, totalpages);
330 331 332 333 334
		if (!points || points < chosen_points)
			continue;

		chosen = p;
		chosen_points = points;
335
	}
336 337 338
	if (chosen)
		get_task_struct(chosen);
	rcu_read_unlock();
339

340
	*ppoints = chosen_points * 1000 / totalpages;
L
Linus Torvalds 已提交
341 342 343
	return chosen;
}

344
/**
R
Randy Dunlap 已提交
345
 * dump_tasks - dump current memory state of all system tasks
W
Wanpeng Li 已提交
346
 * @memcg: current's memory controller, if constrained
347
 * @nodemask: nodemask passed to page allocator for mempolicy ooms
R
Randy Dunlap 已提交
348
 *
349 350 351
 * 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.
352 353
 * State information includes task's pid, uid, tgid, vm size, rss, nr_ptes,
 * swapents, oom_score_adj value, and name.
354
 */
355
static void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask)
356
{
357 358
	struct task_struct *p;
	struct task_struct *task;
359

360
	pr_info("[ pid ]   uid  tgid total_vm      rss nr_ptes nr_pmds swapents oom_score_adj name\n");
361
	rcu_read_lock();
362
	for_each_process(p) {
363
		if (oom_unkillable_task(p, memcg, nodemask))
364
			continue;
365

366 367
		task = find_lock_task_mm(p);
		if (!task) {
368
			/*
369 370
			 * This is a kthread or all of p's threads have already
			 * detached their mm's.  There's no need to report
371
			 * them; they can't be oom killed anyway.
372 373 374
			 */
			continue;
		}
375

376
		pr_info("[%5d] %5d %5d %8lu %8lu %7ld %7ld %8lu         %5hd %s\n",
377 378
			task->pid, from_kuid(&init_user_ns, task_uid(task)),
			task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
379
			atomic_long_read(&task->mm->nr_ptes),
380
			mm_nr_pmds(task->mm),
381
			get_mm_counter(task->mm, MM_SWAPENTS),
D
David Rientjes 已提交
382
			task->signal->oom_score_adj, task->comm);
383 384
		task_unlock(task);
	}
385
	rcu_read_unlock();
386 387
}

388
static void dump_header(struct oom_control *oc, struct task_struct *p)
389
{
J
Joe Perches 已提交
390
	pr_warn("%s invoked oom-killer: gfp_mask=%#x(%pGg), order=%d, oom_score_adj=%hd\n",
391
		current->comm, oc->gfp_mask, &oc->gfp_mask, oc->order,
D
David Rientjes 已提交
392
		current->signal->oom_score_adj);
393

394
	cpuset_print_current_mems_allowed();
395
	dump_stack();
396 397
	if (oc->memcg)
		mem_cgroup_print_oom_info(oc->memcg, p);
398 399
	else
		show_mem(SHOW_MEM_FILTER_NODES);
400
	if (sysctl_oom_dump_tasks)
401
		dump_tasks(oc->memcg, oc->nodemask);
402 403
}

404
/*
405
 * Number of OOM victims in flight
406
 */
407 408
static atomic_t oom_victims = ATOMIC_INIT(0);
static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);
409

410
bool oom_killer_disabled __read_mostly;
411

412 413
#define K(x) ((x) << (PAGE_SHIFT-10))

414 415 416 417 418 419
/*
 * 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.
 */
420
bool process_shares_mm(struct task_struct *p, struct mm_struct *mm)
421 422 423 424 425 426 427 428 429 430 431 432
{
	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 已提交
433 434 435 436 437 438 439
#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);
440
static struct task_struct *oom_reaper_list;
441 442
static DEFINE_SPINLOCK(oom_reaper_lock);

443
static bool __oom_reap_task(struct task_struct *tsk)
M
Michal Hocko 已提交
444 445 446
{
	struct mmu_gather tlb;
	struct vm_area_struct *vma;
447
	struct mm_struct *mm = NULL;
448
	struct task_struct *p;
M
Michal Hocko 已提交
449 450 451 452
	struct zap_details details = {.check_swap_entries = true,
				      .ignore_dirty = true};
	bool ret = true;

453 454 455 456
	/*
	 * We have to make sure to not race with the victim exit path
	 * and cause premature new oom victim selection:
	 * __oom_reap_task		exit_mm
457
	 *   mmget_not_zero
458 459 460 461 462 463 464 465 466 467 468
	 *				  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);

469 470 471 472 473 474 475 476
	/*
	 * Make sure we find the associated mm_struct even when the particular
	 * thread has already terminated and cleared its mm.
	 * We might have race with exit path so consider our work done if there
	 * is no mm.
	 */
	p = find_lock_task_mm(tsk);
	if (!p)
477
		goto unlock_oom;
478
	mm = p->mm;
479
	atomic_inc(&mm->mm_count);
480
	task_unlock(p);
M
Michal Hocko 已提交
481 482 483

	if (!down_read_trylock(&mm->mmap_sem)) {
		ret = false;
484 485 486 487 488 489 490 491 492 493 494
		goto mm_drop;
	}

	/*
	 * 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);
		goto mm_drop;
M
Michal Hocko 已提交
495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523
	}

	tlb_gather_mmu(&tlb, mm, 0, -1);
	for (vma = mm->mmap ; vma; vma = vma->vm_next) {
		if (is_vm_hugetlb_page(vma))
			continue;

		/*
		 * mlocked VMAs require explicit munlocking before unmap.
		 * Let's keep it simple here and skip such VMAs.
		 */
		if (vma->vm_flags & VM_LOCKED)
			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,
					 &details);
	}
	tlb_finish_mmu(&tlb, 0, -1);
524 525 526 527 528
	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 已提交
529
	up_read(&mm->mmap_sem);
530 531

	/*
532 533
	 * This task can be safely ignored because we cannot do much more
	 * to release its memory.
534
	 */
535
	set_bit(MMF_OOM_REAPED, &mm->flags);
536 537 538 539 540
	/*
	 * 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.
	 */
541 542 543 544 545
	mmput_async(mm);
mm_drop:
	mmdrop(mm);
unlock_oom:
	mutex_unlock(&oom_lock);
M
Michal Hocko 已提交
546 547 548
	return ret;
}

549
#define MAX_OOM_REAP_RETRIES 10
550
static void oom_reap_task(struct task_struct *tsk)
M
Michal Hocko 已提交
551 552 553 554
{
	int attempts = 0;

	/* Retry the down_read_trylock(mmap_sem) a few times */
555
	while (attempts++ < MAX_OOM_REAP_RETRIES && !__oom_reap_task(tsk))
M
Michal Hocko 已提交
556 557
		schedule_timeout_idle(HZ/10);

558 559 560 561 562 563
	if (attempts > MAX_OOM_REAP_RETRIES) {
		pr_info("oom_reaper: unable to reap pid:%d (%s)\n",
				task_pid_nr(tsk), tsk->comm);
		debug_show_all_locks();
	}

564 565 566 567 568 569 570 571 572
	/*
	 * Clear TIF_MEMDIE because the task shouldn't be sitting on a
	 * reasonably reclaimable memory anymore or it is not a good candidate
	 * for the oom victim right now because it cannot release its memory
	 * itself nor by the oom reaper.
	 */
	tsk->oom_reaper_list = NULL;
	exit_oom_victim(tsk);

M
Michal Hocko 已提交
573
	/* Drop a reference taken by wake_oom_reaper */
574
	put_task_struct(tsk);
M
Michal Hocko 已提交
575 576 577 578
}

static int oom_reaper(void *unused)
{
M
Michal Hocko 已提交
579 580
	set_freezable();

M
Michal Hocko 已提交
581
	while (true) {
582
		struct task_struct *tsk = NULL;
M
Michal Hocko 已提交
583

584
		wait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL);
585
		spin_lock(&oom_reaper_lock);
586 587 588
		if (oom_reaper_list != NULL) {
			tsk = oom_reaper_list;
			oom_reaper_list = tsk->oom_reaper_list;
589 590 591 592 593
		}
		spin_unlock(&oom_reaper_lock);

		if (tsk)
			oom_reap_task(tsk);
M
Michal Hocko 已提交
594 595 596 597 598
	}

	return 0;
}

599
static void wake_oom_reaper(struct task_struct *tsk)
M
Michal Hocko 已提交
600
{
601 602 603 604 605
	if (!oom_reaper_th)
		return;

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

608
	get_task_struct(tsk);
M
Michal Hocko 已提交
609

610
	spin_lock(&oom_reaper_lock);
611 612
	tsk->oom_reaper_list = oom_reaper_list;
	oom_reaper_list = tsk;
613 614
	spin_unlock(&oom_reaper_lock);
	wake_up(&oom_reaper_wait);
M
Michal Hocko 已提交
615 616
}

617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643
/* Check if we can reap the given task. This has to be called with stable
 * tsk->mm
 */
void try_oom_reaper(struct task_struct *tsk)
{
	struct mm_struct *mm = tsk->mm;
	struct task_struct *p;

	if (!mm)
		return;

	/*
	 * There might be other threads/processes which are either not
	 * dying or even not killable.
	 */
	if (atomic_read(&mm->mm_users) > 1) {
		rcu_read_lock();
		for_each_process(p) {
			if (!process_shares_mm(p, mm))
				continue;
			if (fatal_signal_pending(p))
				continue;

			/*
			 * If the task is exiting make sure the whole thread group
			 * is exiting and cannot acces mm anymore.
			 */
644
			if (signal_group_exit(p->signal))
645 646 647 648 649 650 651 652 653 654 655 656
				continue;

			/* Give up */
			rcu_read_unlock();
			return;
		}
		rcu_read_unlock();
	}

	wake_oom_reaper(tsk);
}

M
Michal Hocko 已提交
657 658 659 660 661 662 663 664 665 666 667 668
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)
#else
669
static void wake_oom_reaper(struct task_struct *tsk)
M
Michal Hocko 已提交
670 671 672 673
{
}
#endif

674
/**
675
 * mark_oom_victim - mark the given task as OOM victim
676
 * @tsk: task to mark
677
 *
678
 * Has to be called with oom_lock held and never after
679
 * oom has been disabled already.
680
 */
681
void mark_oom_victim(struct task_struct *tsk)
682
{
683 684 685 686
	WARN_ON(oom_killer_disabled);
	/* OOM killer might race with memcg OOM */
	if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))
		return;
687
	atomic_inc(&tsk->signal->oom_victims);
688 689 690 691 692 693 694
	/*
	 * 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);
695
	atomic_inc(&oom_victims);
696 697 698
}

/**
699
 * exit_oom_victim - note the exit of an OOM victim
700
 */
701
void exit_oom_victim(struct task_struct *tsk)
702
{
703 704
	if (!test_and_clear_tsk_thread_flag(tsk, TIF_MEMDIE))
		return;
705
	atomic_dec(&tsk->signal->oom_victims);
706

707
	if (!atomic_dec_return(&oom_victims))
708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726
		wake_up_all(&oom_victims_wait);
}

/**
 * oom_killer_disable - disable OOM killer
 *
 * Forces all page allocations to fail rather than trigger OOM killer.
 * Will block and wait until all OOM victims are killed.
 *
 * 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.
 */
bool oom_killer_disable(void)
{
	/*
727 728
	 * 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).
729
	 */
730
	if (mutex_lock_killable(&oom_lock))
731 732
		return false;
	oom_killer_disabled = true;
733
	mutex_unlock(&oom_lock);
734 735 736 737 738 739 740 741 742 743 744 745

	wait_event(oom_victims_wait, !atomic_read(&oom_victims));

	return true;
}

/**
 * oom_killer_enable - enable OOM killer
 */
void oom_killer_enable(void)
{
	oom_killer_disabled = false;
746 747
}

748 749 750 751
/*
 * Must be called while holding a reference to p, which will be released upon
 * returning.
 */
752
void oom_kill_process(struct oom_control *oc, struct task_struct *p,
753
		      unsigned int points, unsigned long totalpages,
754
		      const char *message)
L
Linus Torvalds 已提交
755
{
756
	struct task_struct *victim = p;
757
	struct task_struct *child;
758
	struct task_struct *t;
759
	struct mm_struct *mm;
760
	unsigned int victim_points = 0;
761 762
	static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
					      DEFAULT_RATELIMIT_BURST);
763
	bool can_oom_reap = true;
L
Linus Torvalds 已提交
764

765 766 767 768
	/*
	 * 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
	 */
769 770
	task_lock(p);
	if (p->mm && task_will_free_mem(p)) {
771
		mark_oom_victim(p);
772
		try_oom_reaper(p);
773
		task_unlock(p);
774
		put_task_struct(p);
775
		return;
776
	}
777
	task_unlock(p);
778

779
	if (__ratelimit(&oom_rs))
780
		dump_header(oc, p);
781

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

785 786
	/*
	 * If any of p's children has a different mm and is eligible for kill,
787
	 * the one with the highest oom_badness() score is sacrificed for its
788 789 790
	 * parent.  This attempts to lose the minimal amount of work done while
	 * still freeing memory.
	 */
791
	read_lock(&tasklist_lock);
792
	for_each_thread(p, t) {
793
		list_for_each_entry(child, &t->children, sibling) {
D
David Rientjes 已提交
794
			unsigned int child_points;
795

796
			if (process_shares_mm(child, p->mm))
797
				continue;
D
David Rientjes 已提交
798 799 800
			/*
			 * oom_badness() returns 0 if the thread is unkillable
			 */
801 802
			child_points = oom_badness(child,
					oc->memcg, oc->nodemask, totalpages);
803
			if (child_points > victim_points) {
804
				put_task_struct(victim);
805 806
				victim = child;
				victim_points = child_points;
807
				get_task_struct(victim);
808
			}
809
		}
810
	}
811
	read_unlock(&tasklist_lock);
812

813 814 815
	p = find_lock_task_mm(victim);
	if (!p) {
		put_task_struct(victim);
816
		return;
817 818 819 820 821
	} else if (victim != p) {
		get_task_struct(p);
		put_task_struct(victim);
		victim = p;
	}
822

823
	/* Get a reference to safely compare mm after task_unlock(victim) */
824
	mm = victim->mm;
825
	atomic_inc(&mm->mm_count);
826 827 828 829 830 831
	/*
	 * 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);
832
	mark_oom_victim(victim);
833
	pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
834 835
		task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
		K(get_mm_counter(victim->mm, MM_ANONPAGES)),
836 837
		K(get_mm_counter(victim->mm, MM_FILEPAGES)),
		K(get_mm_counter(victim->mm, MM_SHMEMPAGES)));
838 839 840 841 842 843 844 845 846 847 848
	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.
	 */
849
	rcu_read_lock();
850
	for_each_process(p) {
851
		if (!process_shares_mm(p, mm))
852 853 854
			continue;
		if (same_thread_group(p, victim))
			continue;
M
Michal Hocko 已提交
855 856 857 858 859 860 861 862
		if (unlikely(p->flags & PF_KTHREAD) || is_global_init(p) ||
		    p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN) {
			/*
			 * We cannot use oom_reaper for the mm shared by this
			 * process because it wouldn't get killed and so the
			 * memory might be still used.
			 */
			can_oom_reap = false;
863
			continue;
M
Michal Hocko 已提交
864
		}
865 866
		do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
	}
867
	rcu_read_unlock();
868

M
Michal Hocko 已提交
869
	if (can_oom_reap)
870
		wake_oom_reaper(victim);
M
Michal Hocko 已提交
871

872
	mmdrop(mm);
873
	put_task_struct(victim);
L
Linus Torvalds 已提交
874
}
875
#undef K
L
Linus Torvalds 已提交
876

877 878 879
/*
 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
 */
880
void check_panic_on_oom(struct oom_control *oc, enum oom_constraint constraint)
881 882 883 884 885 886 887 888 889 890 891 892
{
	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;
	}
893
	/* Do not panic for oom kills triggered by sysrq */
894
	if (is_sysrq_oom(oc))
895
		return;
896
	dump_header(oc, NULL);
897 898 899 900
	panic("Out of memory: %s panic_on_oom is enabled\n",
		sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
}

901 902 903 904 905 906 907 908 909 910 911 912 913 914
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 已提交
915
/**
916 917
 * out_of_memory - kill the "best" process when we run out of memory
 * @oc: pointer to struct oom_control
L
Linus Torvalds 已提交
918 919 920 921 922 923
 *
 * 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.
 */
924
bool out_of_memory(struct oom_control *oc)
L
Linus Torvalds 已提交
925
{
926
	struct task_struct *p;
D
David Rientjes 已提交
927
	unsigned long totalpages;
928
	unsigned long freed = 0;
929
	unsigned int uninitialized_var(points);
930
	enum oom_constraint constraint = CONSTRAINT_NONE;
931

932 933 934
	if (oom_killer_disabled)
		return false;

935 936 937
	blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
	if (freed > 0)
		/* Got some memory back in the last second. */
938
		return true;
L
Linus Torvalds 已提交
939

940
	/*
941 942 943
	 * 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.
944 945 946
	 *
	 * But don't select if current has already released its mm and cleared
	 * TIF_MEMDIE flag at exit_mm(), otherwise an OOM livelock may occur.
947
	 */
948 949
	if (current->mm &&
	    (fatal_signal_pending(current) || task_will_free_mem(current))) {
950
		mark_oom_victim(current);
951
		try_oom_reaper(current);
952
		return true;
953 954
	}

955 956 957 958 959 960 961 962 963
	/*
	 * 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.
	 */
	if (oc->gfp_mask && !(oc->gfp_mask & (__GFP_FS|__GFP_NOFAIL)))
		return true;

964 965 966 967
	/*
	 * Check if there were limitations on the allocation (only relevant for
	 * NUMA) that may require different handling.
	 */
968 969 970
	constraint = constrained_alloc(oc, &totalpages);
	if (constraint != CONSTRAINT_MEMORY_POLICY)
		oc->nodemask = NULL;
971
	check_panic_on_oom(oc, constraint);
972

973
	if (sysctl_oom_kill_allocating_task && current->mm &&
974
	    !oom_unkillable_task(current, NULL, oc->nodemask) &&
975
	    current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
976
		get_task_struct(current);
977
		oom_kill_process(oc, current, 0, totalpages,
978
				 "Out of memory (oom_kill_allocating_task)");
979
		return true;
980 981
	}

982
	p = select_bad_process(oc, &points, totalpages);
983
	/* Found nothing?!?! Either we hang forever, or we panic. */
984
	if (!p && !is_sysrq_oom(oc)) {
985
		dump_header(oc, NULL);
986 987
		panic("Out of memory and no killable processes...\n");
	}
988
	if (p && p != (void *)-1UL) {
989
		oom_kill_process(oc, p, points, totalpages, "Out of memory");
990 991 992 993
		/*
		 * Give the killed process a good chance to exit before trying
		 * to allocate memory again.
		 */
994
		schedule_timeout_killable(1);
995
	}
996
	return true;
997 998
}

999 1000
/*
 * The pagefault handler calls here because it is out of memory, so kill a
V
Vladimir Davydov 已提交
1001 1002
 * memory-hogging task. If oom_lock is held by somebody else, a parallel oom
 * killing is already in progress so do nothing.
1003 1004 1005
 */
void pagefault_out_of_memory(void)
{
1006 1007 1008
	struct oom_control oc = {
		.zonelist = NULL,
		.nodemask = NULL,
1009
		.memcg = NULL,
1010 1011 1012 1013
		.gfp_mask = 0,
		.order = 0,
	};

1014
	if (mem_cgroup_oom_synchronize(true))
1015
		return;
1016

1017 1018
	if (!mutex_trylock(&oom_lock))
		return;
1019

1020
	if (!out_of_memory(&oc)) {
1021 1022 1023 1024 1025 1026 1027
		/*
		 * There shouldn't be any user tasks runnable while the
		 * OOM killer is disabled, so the current task has to
		 * be a racing OOM victim for which oom_killer_disable()
		 * is waiting for.
		 */
		WARN_ON(test_thread_flag(TIF_MEMDIE));
1028
	}
1029 1030

	mutex_unlock(&oom_lock);
1031
}