oom_kill.c 27.2 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 179 180
	/*
	 * Do not even consider tasks which are explicitly marked oom
	 * unkillable or have been already oom reaped.
	 */
181
	adj = (long)p->signal->oom_score_adj;
182 183
	if (adj == OOM_SCORE_ADJ_MIN ||
			test_bit(MMF_OOM_REAPED, &p->mm->flags)) {
184 185 186 187
		task_unlock(p);
		return 0;
	}

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

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

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

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

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

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

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

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

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

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

276
enum oom_scan_t oom_scan_process_thread(struct oom_control *oc,
277
					struct task_struct *task)
278
{
279
	if (oom_unkillable_task(task, NULL, oc->nodemask))
280 281 282 283 284 285
		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.
	 */
286 287
	if (!is_sysrq_oom(oc) && atomic_read(&task->signal->oom_victims))
		return OOM_SCAN_ABORT;
288

289 290 291 292 293 294 295
	/*
	 * 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;

296 297 298
	return OOM_SCAN_OK;
}

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

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

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

		chosen = p;
		chosen_points = points;
333
	}
334 335 336
	if (chosen)
		get_task_struct(chosen);
	rcu_read_unlock();
337

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

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

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

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

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

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

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

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

408
bool oom_killer_disabled __read_mostly;
409

410 411
#define K(x) ((x) << (PAGE_SHIFT-10))

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

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

451 452 453 454
	/*
	 * 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
455
	 *   mmget_not_zero
456 457 458 459 460 461 462 463 464 465 466
	 *				  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);

467 468 469 470 471 472 473 474
	/*
	 * 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)
475
		goto unlock_oom;
476
	mm = p->mm;
477
	atomic_inc(&mm->mm_count);
478
	task_unlock(p);
M
Michal Hocko 已提交
479 480 481

	if (!down_read_trylock(&mm->mmap_sem)) {
		ret = false;
482 483 484 485 486 487 488 489 490 491 492
		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 已提交
493 494 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
	}

	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);
522 523 524 525 526
	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 已提交
527
	up_read(&mm->mmap_sem);
528 529

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

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

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

556 557 558 559 560 561
	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();
	}

562 563 564 565 566 567 568 569 570
	/*
	 * 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 已提交
571
	/* Drop a reference taken by wake_oom_reaper */
572
	put_task_struct(tsk);
M
Michal Hocko 已提交
573 574 575 576
}

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

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

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

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

	return 0;
}

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

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

606
	get_task_struct(tsk);
M
Michal Hocko 已提交
607

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

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
/* 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.
			 */
642
			if (signal_group_exit(p->signal))
643 644 645 646 647 648 649 650 651 652 653 654
				continue;

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

	wake_oom_reaper(tsk);
}

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

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

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

705
	if (!atomic_dec_return(&oom_victims))
706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724
		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)
{
	/*
725 726
	 * 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).
727
	 */
728
	if (mutex_lock_killable(&oom_lock))
729 730
		return false;
	oom_killer_disabled = true;
731
	mutex_unlock(&oom_lock);
732 733 734 735 736 737 738 739 740 741 742 743

	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;
744 745
}

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

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

777
	if (__ratelimit(&oom_rs))
778
		dump_header(oc, p);
779

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

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

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

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

821
	/* Get a reference to safely compare mm after task_unlock(victim) */
822
	mm = victim->mm;
823
	atomic_inc(&mm->mm_count);
824 825 826 827 828 829
	/*
	 * 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);
830
	mark_oom_victim(victim);
831
	pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
832 833
		task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
		K(get_mm_counter(victim->mm, MM_ANONPAGES)),
834 835
		K(get_mm_counter(victim->mm, MM_FILEPAGES)),
		K(get_mm_counter(victim->mm, MM_SHMEMPAGES)));
836 837 838 839 840 841 842 843 844 845 846
	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.
	 */
847
	rcu_read_lock();
848
	for_each_process(p) {
849
		if (!process_shares_mm(p, mm))
850 851 852
			continue;
		if (same_thread_group(p, victim))
			continue;
M
Michal Hocko 已提交
853 854 855 856 857 858 859 860
		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;
861
			continue;
M
Michal Hocko 已提交
862
		}
863 864
		do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
	}
865
	rcu_read_unlock();
866

M
Michal Hocko 已提交
867
	if (can_oom_reap)
868
		wake_oom_reaper(victim);
M
Michal Hocko 已提交
869

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

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

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

930 931 932
	if (oom_killer_disabled)
		return false;

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

938
	/*
939 940 941
	 * 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.
942 943 944
	 *
	 * 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.
945
	 */
946 947
	if (current->mm &&
	    (fatal_signal_pending(current) || task_will_free_mem(current))) {
948
		mark_oom_victim(current);
949
		try_oom_reaper(current);
950
		return true;
951 952
	}

953 954 955 956 957 958 959 960 961
	/*
	 * 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;

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

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

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

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

1012
	if (mem_cgroup_oom_synchronize(true))
1013
		return;
1014

1015 1016
	if (!mutex_trylock(&oom_lock))
		return;
1017

1018
	if (!out_of_memory(&oc)) {
1019 1020 1021 1022 1023 1024 1025
		/*
		 * 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));
1026
	}
1027 1028

	mutex_unlock(&oom_lock);
1029
}