oom_kill.c 30.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
#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
#include <linux/kthread.h>
#include <linux/init.h>
43
#include <linux/mmu_notifier.h>
M
Michal Hocko 已提交
44 45 46

#include <asm/tlb.h>
#include "internal.h"
47
#include "slab.h"
48 49 50

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

52
int sysctl_panic_on_oom;
53
int sysctl_oom_kill_allocating_task;
54
int sysctl_oom_dump_tasks = 1;
55

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

66 67 68
#ifdef CONFIG_NUMA
/**
 * has_intersects_mems_allowed() - check task eligiblity for kill
69
 * @start: task struct of which task to consider
70 71 72 73 74
 * @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.
75
 */
76
static bool has_intersects_mems_allowed(struct task_struct *start,
77
					const nodemask_t *mask)
78
{
79 80
	struct task_struct *tsk;
	bool ret = false;
81

82
	rcu_read_lock();
83
	for_each_thread(start, tsk) {
84 85 86 87 88 89 90
		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.
			 */
91
			ret = mempolicy_nodemask_intersects(tsk, mask);
92 93 94 95 96
		} else {
			/*
			 * This is not a mempolicy constrained oom, so only
			 * check the mems of tsk's cpuset.
			 */
97
			ret = cpuset_mems_allowed_intersects(current, tsk);
98
		}
99 100
		if (ret)
			break;
101
	}
102
	rcu_read_unlock();
103

104
	return ret;
105 106 107 108 109 110
}
#else
static bool has_intersects_mems_allowed(struct task_struct *tsk,
					const nodemask_t *mask)
{
	return true;
111
}
112
#endif /* CONFIG_NUMA */
113

114 115 116 117 118 119
/*
 * 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.
 */
120
struct task_struct *find_lock_task_mm(struct task_struct *p)
121
{
122
	struct task_struct *t;
123

124 125
	rcu_read_lock();

126
	for_each_thread(p, t) {
127 128
		task_lock(t);
		if (likely(t->mm))
129
			goto found;
130
		task_unlock(t);
131
	}
132 133 134
	t = NULL;
found:
	rcu_read_unlock();
135

136
	return t;
137 138
}

139 140 141 142 143 144 145 146 147
/*
 * 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;
}

148 149 150 151 152
static inline bool is_memcg_oom(struct oom_control *oc)
{
	return oc->memcg != NULL;
}

153
/* return true if the task is not adequate as candidate victim task. */
154
static bool oom_unkillable_task(struct task_struct *p,
155
		struct mem_cgroup *memcg, const nodemask_t *nodemask)
156 157 158 159 160 161 162
{
	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 */
163
	if (memcg && !task_in_mem_cgroup(p, memcg))
164 165 166 167 168 169 170 171 172
		return true;

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

	return false;
}

173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191
/*
 * Print out unreclaimble slabs info when unreclaimable slabs amount is greater
 * than all user memory (LRU pages)
 */
static bool is_dump_unreclaim_slabs(void)
{
	unsigned long nr_lru;

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

	return (global_node_page_state(NR_SLAB_UNRECLAIMABLE) > nr_lru);
}

L
Linus Torvalds 已提交
192
/**
D
David Rientjes 已提交
193
 * oom_badness - heuristic function to determine which candidate task to kill
L
Linus Torvalds 已提交
194
 * @p: task struct of which task we should calculate
D
David Rientjes 已提交
195
 * @totalpages: total present RAM allowed for page allocation
196 197
 * @memcg: task's memory controller, if constrained
 * @nodemask: nodemask passed to page allocator for mempolicy ooms
L
Linus Torvalds 已提交
198
 *
D
David Rientjes 已提交
199 200 201
 * 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 已提交
202
 */
203 204
unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
			  const nodemask_t *nodemask, unsigned long totalpages)
L
Linus Torvalds 已提交
205
{
206
	long points;
207
	long adj;
208

209
	if (oom_unkillable_task(p, memcg, nodemask))
210
		return 0;
L
Linus Torvalds 已提交
211

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

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

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

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

241
	/*
242 243
	 * 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).
244
	 */
245
	return points > 0 ? points : 1;
L
Linus Torvalds 已提交
246 247
}

248 249 250 251 252
static const char * const oom_constraint_text[] = {
	[CONSTRAINT_NONE] = "CONSTRAINT_NONE",
	[CONSTRAINT_CPUSET] = "CONSTRAINT_CPUSET",
	[CONSTRAINT_MEMORY_POLICY] = "CONSTRAINT_MEMORY_POLICY",
	[CONSTRAINT_MEMCG] = "CONSTRAINT_MEMCG",
253 254
};

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

266
	if (is_memcg_oom(oc)) {
267
		oc->totalpages = mem_cgroup_get_max(oc->memcg) ?: 1;
268 269 270
		return CONSTRAINT_MEMCG;
	}

D
David Rientjes 已提交
271
	/* Default to all available memory */
272
	oc->totalpages = totalram_pages() + total_swap_pages;
273 274 275

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

277
	if (!oc->zonelist)
D
David Rientjes 已提交
278
		return CONSTRAINT_NONE;
279 280 281 282 283
	/*
	 * 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.
	 */
284
	if (oc->gfp_mask & __GFP_THISNODE)
285
		return CONSTRAINT_NONE;
286

287
	/*
D
David Rientjes 已提交
288 289 290
	 * 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().
291
	 */
292 293
	if (oc->nodemask &&
	    !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {
294
		oc->totalpages = total_swap_pages;
295
		for_each_node_mask(nid, *oc->nodemask)
296
			oc->totalpages += node_spanned_pages(nid);
297
		return CONSTRAINT_MEMORY_POLICY;
D
David Rientjes 已提交
298
	}
299 300

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

D
David Rientjes 已提交
306
	if (cpuset_limited) {
307
		oc->totalpages = total_swap_pages;
D
David Rientjes 已提交
308
		for_each_node_mask(nid, cpuset_current_mems_allowed)
309
			oc->totalpages += node_spanned_pages(nid);
D
David Rientjes 已提交
310 311
		return CONSTRAINT_CPUSET;
	}
312 313 314
	return CONSTRAINT_NONE;
}

315
static int oom_evaluate_task(struct task_struct *task, void *arg)
316
{
317 318 319
	struct oom_control *oc = arg;
	unsigned long points;

320
	if (oom_unkillable_task(task, NULL, oc->nodemask))
321
		goto next;
322 323 324

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

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

344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
	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;
364 365
}

L
Linus Torvalds 已提交
366
/*
367 368
 * 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 已提交
369
 */
370
static void select_bad_process(struct oom_control *oc)
L
Linus Torvalds 已提交
371
{
372 373 374 375
	if (is_memcg_oom(oc))
		mem_cgroup_scan_tasks(oc->memcg, oom_evaluate_task, oc);
	else {
		struct task_struct *p;
376

377 378 379 380 381
		rcu_read_lock();
		for_each_process(p)
			if (oom_evaluate_task(p, oc))
				break;
		rcu_read_unlock();
382
	}
383

384
	oc->chosen_points = oc->chosen_points * 1000 / oc->totalpages;
L
Linus Torvalds 已提交
385 386
}

387
/**
R
Randy Dunlap 已提交
388
 * dump_tasks - dump current memory state of all system tasks
W
Wanpeng Li 已提交
389
 * @memcg: current's memory controller, if constrained
390
 * @nodemask: nodemask passed to page allocator for mempolicy ooms
R
Randy Dunlap 已提交
391
 *
392 393 394
 * 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.
395 396
 * State information includes task's pid, uid, tgid, vm size, rss,
 * pgtables_bytes, swapents, oom_score_adj value, and name.
397
 */
398
static void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask)
399
{
400 401
	struct task_struct *p;
	struct task_struct *task;
402

403 404
	pr_info("Tasks state (memory values in pages):\n");
	pr_info("[  pid  ]   uid  tgid total_vm      rss pgtables_bytes swapents oom_score_adj name\n");
405
	rcu_read_lock();
406
	for_each_process(p) {
407
		if (oom_unkillable_task(p, memcg, nodemask))
408
			continue;
409

410 411
		task = find_lock_task_mm(p);
		if (!task) {
412
			/*
413 414
			 * This is a kthread or all of p's threads have already
			 * detached their mm's.  There's no need to report
415
			 * them; they can't be oom killed anyway.
416 417 418
			 */
			continue;
		}
419

420
		pr_info("[%7d] %5d %5d %8lu %8lu %8ld %8lu         %5hd %s\n",
421 422
			task->pid, from_kuid(&init_user_ns, task_uid(task)),
			task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
423
			mm_pgtables_bytes(task->mm),
424
			get_mm_counter(task->mm, MM_SWAPENTS),
D
David Rientjes 已提交
425
			task->signal->oom_score_adj, task->comm);
426 427
		task_unlock(task);
	}
428
	rcu_read_unlock();
429 430
}

431 432 433 434 435 436 437
static void dump_oom_summary(struct oom_control *oc, struct task_struct *victim)
{
	/* one line summary of the oom killer context. */
	pr_info("oom-kill:constraint=%s,nodemask=%*pbl",
			oom_constraint_text[oc->constraint],
			nodemask_pr_args(oc->nodemask));
	cpuset_print_current_mems_allowed();
438
	mem_cgroup_print_oom_context(oc->memcg, victim);
439 440 441 442
	pr_cont(",task=%s,pid=%d,uid=%d\n", victim->comm, victim->pid,
		from_kuid(&init_user_ns, task_uid(victim)));
}

443
static void dump_header(struct oom_control *oc, struct task_struct *p)
444
{
445 446
	pr_warn("%s invoked oom-killer: gfp_mask=%#x(%pGg), order=%d, oom_score_adj=%hd\n",
		current->comm, oc->gfp_mask, &oc->gfp_mask, oc->order,
M
Michal Hocko 已提交
447
			current->signal->oom_score_adj);
448 449
	if (!IS_ENABLED(CONFIG_COMPACTION) && oc->order)
		pr_warn("COMPACTION is disabled!!!\n");
450

451
	dump_stack();
452
	if (is_memcg_oom(oc))
453
		mem_cgroup_print_oom_meminfo(oc->memcg);
454
	else {
455
		show_mem(SHOW_MEM_FILTER_NODES, oc->nodemask);
456 457 458
		if (is_dump_unreclaim_slabs())
			dump_unreclaimable_slab();
	}
459
	if (sysctl_oom_dump_tasks)
460
		dump_tasks(oc->memcg, oc->nodemask);
461 462
	if (p)
		dump_oom_summary(oc, p);
463 464
}

465
/*
466
 * Number of OOM victims in flight
467
 */
468 469
static atomic_t oom_victims = ATOMIC_INIT(0);
static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);
470

471
static bool oom_killer_disabled __read_mostly;
472

473 474
#define K(x) ((x) << (PAGE_SHIFT-10))

475 476 477 478 479 480
/*
 * 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.
 */
481
bool process_shares_mm(struct task_struct *p, struct mm_struct *mm)
482 483 484 485 486 487 488 489 490 491 492
{
	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 已提交
493 494 495 496 497 498 499
#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);
500
static struct task_struct *oom_reaper_list;
501 502
static DEFINE_SPINLOCK(oom_reaper_lock);

503
bool __oom_reap_task_mm(struct mm_struct *mm)
M
Michal Hocko 已提交
504 505
{
	struct vm_area_struct *vma;
506
	bool ret = true;
507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530

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

	for (vma = mm->mmap ; vma; vma = vma->vm_next) {
		if (!can_madv_dontneed_vma(vma))
			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)) {
531
			struct mmu_notifier_range range;
532 533
			struct mmu_gather tlb;

534 535 536 537 538
			mmu_notifier_range_init(&range, mm, vma->vm_start,
						vma->vm_end);
			tlb_gather_mmu(&tlb, mm, range.start, range.end);
			if (mmu_notifier_invalidate_range_start_nonblock(&range)) {
				tlb_finish_mmu(&tlb, range.start, range.end);
539 540 541
				ret = false;
				continue;
			}
542 543 544
			unmap_page_range(&tlb, vma, range.start, range.end, NULL);
			mmu_notifier_invalidate_range_end(&range);
			tlb_finish_mmu(&tlb, range.start, range.end);
545 546
		}
	}
547 548

	return ret;
549 550
}

551 552 553 554 555 556
/*
 * Reaps the address space of the give task.
 *
 * Returns true on success and false if none or part of the address space
 * has been reclaimed and the caller should retry later.
 */
557 558
static bool oom_reap_task_mm(struct task_struct *tsk, struct mm_struct *mm)
{
M
Michal Hocko 已提交
559 560 561
	bool ret = true;

	if (!down_read_trylock(&mm->mmap_sem)) {
562
		trace_skip_task_reaping(tsk->pid);
563
		return false;
564 565
	}

566
	/*
567 568 569 570
	 * MMF_OOM_SKIP is set by exit_mmap when the OOM reaper can't
	 * work on the mm anymore. The check for MMF_OOM_SKIP must run
	 * under mmap_sem for reading because it serializes against the
	 * down_write();up_write() cycle in exit_mmap().
571
	 */
572
	if (test_bit(MMF_OOM_SKIP, &mm->flags)) {
573
		trace_skip_task_reaping(tsk->pid);
574
		goto out_unlock;
M
Michal Hocko 已提交
575 576
	}

577 578
	trace_start_task_reaping(tsk->pid);

579
	/* failed to reap part of the address space. Try again later */
580 581 582
	ret = __oom_reap_task_mm(mm);
	if (!ret)
		goto out_finish;
M
Michal Hocko 已提交
583

584 585 586 587 588
	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)));
589 590 591
out_finish:
	trace_finish_task_reaping(tsk->pid);
out_unlock:
M
Michal Hocko 已提交
592
	up_read(&mm->mmap_sem);
593

M
Michal Hocko 已提交
594 595 596
	return ret;
}

597
#define MAX_OOM_REAP_RETRIES 10
598
static void oom_reap_task(struct task_struct *tsk)
M
Michal Hocko 已提交
599 600
{
	int attempts = 0;
601
	struct mm_struct *mm = tsk->signal->oom_mm;
M
Michal Hocko 已提交
602 603

	/* Retry the down_read_trylock(mmap_sem) a few times */
604
	while (attempts++ < MAX_OOM_REAP_RETRIES && !oom_reap_task_mm(tsk, mm))
M
Michal Hocko 已提交
605 606
		schedule_timeout_idle(HZ/10);

607 608
	if (attempts <= MAX_OOM_REAP_RETRIES ||
	    test_bit(MMF_OOM_SKIP, &mm->flags))
609
		goto done;
610

611 612 613
	pr_info("oom_reaper: unable to reap pid:%d (%s)\n",
		task_pid_nr(tsk), tsk->comm);
	debug_show_all_locks();
614

615
done:
616 617
	tsk->oom_reaper_list = NULL;

618 619 620 621
	/*
	 * Hide this mm from OOM killer because it has been either reaped or
	 * somebody can't call up_write(mmap_sem).
	 */
622
	set_bit(MMF_OOM_SKIP, &mm->flags);
623

M
Michal Hocko 已提交
624
	/* Drop a reference taken by wake_oom_reaper */
625
	put_task_struct(tsk);
M
Michal Hocko 已提交
626 627 628 629 630
}

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

633
		wait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL);
634
		spin_lock(&oom_reaper_lock);
635 636 637
		if (oom_reaper_list != NULL) {
			tsk = oom_reaper_list;
			oom_reaper_list = tsk->oom_reaper_list;
638 639 640 641 642
		}
		spin_unlock(&oom_reaper_lock);

		if (tsk)
			oom_reap_task(tsk);
M
Michal Hocko 已提交
643 644 645 646 647
	}

	return 0;
}

648
static void wake_oom_reaper(struct task_struct *tsk)
M
Michal Hocko 已提交
649
{
650 651
	/* mm is already queued? */
	if (test_and_set_bit(MMF_OOM_REAP_QUEUED, &tsk->signal->oom_mm->flags))
M
Michal Hocko 已提交
652 653
		return;

654
	get_task_struct(tsk);
M
Michal Hocko 已提交
655

656
	spin_lock(&oom_reaper_lock);
657 658
	tsk->oom_reaper_list = oom_reaper_list;
	oom_reaper_list = tsk;
659
	spin_unlock(&oom_reaper_lock);
660
	trace_wake_reaper(tsk->pid);
661
	wake_up(&oom_reaper_wait);
M
Michal Hocko 已提交
662 663 664 665 666 667 668 669
}

static int __init oom_init(void)
{
	oom_reaper_th = kthread_run(oom_reaper, NULL, "oom_reaper");
	return 0;
}
subsys_initcall(oom_init)
670 671 672 673 674
#else
static inline void wake_oom_reaper(struct task_struct *tsk)
{
}
#endif /* CONFIG_MMU */
M
Michal Hocko 已提交
675

676
/**
677
 * mark_oom_victim - mark the given task as OOM victim
678
 * @tsk: task to mark
679
 *
680
 * Has to be called with oom_lock held and never after
681
 * oom has been disabled already.
682 683 684
 *
 * tsk->mm has to be non NULL and caller has to guarantee it is stable (either
 * under task_lock or operate on the current).
685
 */
686
static void mark_oom_victim(struct task_struct *tsk)
687
{
688 689
	struct mm_struct *mm = tsk->mm;

690 691 692 693
	WARN_ON(oom_killer_disabled);
	/* OOM killer might race with memcg OOM */
	if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))
		return;
694 695

	/* oom_mm is bound to the signal struct life time. */
696
	if (!cmpxchg(&tsk->signal->oom_mm, NULL, mm)) {
V
Vegard Nossum 已提交
697
		mmgrab(tsk->signal->oom_mm);
698 699
		set_bit(MMF_OOM_VICTIM, &mm->flags);
	}
700

701 702 703 704 705 706 707
	/*
	 * 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);
708
	atomic_inc(&oom_victims);
709
	trace_mark_victim(tsk->pid);
710 711 712
}

/**
713
 * exit_oom_victim - note the exit of an OOM victim
714
 */
715
void exit_oom_victim(void)
716
{
717
	clear_thread_flag(TIF_MEMDIE);
718

719
	if (!atomic_dec_return(&oom_victims))
720 721 722
		wake_up_all(&oom_victims_wait);
}

723 724 725 726 727 728
/**
 * oom_killer_enable - enable OOM killer
 */
void oom_killer_enable(void)
{
	oom_killer_disabled = false;
M
Michal Hocko 已提交
729
	pr_info("OOM killer enabled.\n");
730 731
}

732 733
/**
 * oom_killer_disable - disable OOM killer
734
 * @timeout: maximum timeout to wait for oom victims in jiffies
735 736
 *
 * Forces all page allocations to fail rather than trigger OOM killer.
737 738
 * Will block and wait until all OOM victims are killed or the given
 * timeout expires.
739 740 741 742 743 744 745 746
 *
 * 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.
 */
747
bool oom_killer_disable(signed long timeout)
748
{
749 750
	signed long ret;

751
	/*
752 753
	 * 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).
754
	 */
755
	if (mutex_lock_killable(&oom_lock))
756 757
		return false;
	oom_killer_disabled = true;
758
	mutex_unlock(&oom_lock);
759

760 761 762 763 764 765
	ret = wait_event_interruptible_timeout(oom_victims_wait,
			!atomic_read(&oom_victims), timeout);
	if (ret <= 0) {
		oom_killer_enable();
		return false;
	}
M
Michal Hocko 已提交
766
	pr_info("OOM killer disabled.\n");
767 768 769 770

	return true;
}

771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795
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.
796 797
 * Caller has to make sure that task->mm is stable (hold task_lock or
 * it operates on the current).
798
 */
799
static bool task_will_free_mem(struct task_struct *task)
800
{
801
	struct mm_struct *mm = task->mm;
802
	struct task_struct *p;
803
	bool ret = true;
804 805

	/*
806 807 808
	 * 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.
809
	 */
810
	if (!mm)
811 812
		return false;

813 814
	if (!__task_will_free_mem(task))
		return false;
815 816 817 818 819

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

823
	if (atomic_read(&mm->mm_users) <= 1)
824 825 826
		return true;

	/*
827 828 829
	 * 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.
830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845
	 */
	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;
}

846
static void __oom_kill_process(struct task_struct *victim, const char *message)
L
Linus Torvalds 已提交
847
{
848
	struct task_struct *p;
849
	struct mm_struct *mm;
850
	bool can_oom_reap = true;
L
Linus Torvalds 已提交
851

852 853 854
	p = find_lock_task_mm(victim);
	if (!p) {
		put_task_struct(victim);
855
		return;
856 857 858 859 860
	} else if (victim != p) {
		get_task_struct(p);
		put_task_struct(victim);
		victim = p;
	}
861

862
	/* Get a reference to safely compare mm after task_unlock(victim) */
863
	mm = victim->mm;
V
Vegard Nossum 已提交
864
	mmgrab(mm);
865 866 867

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

870
	/*
871 872 873
	 * We should send SIGKILL before granting access to memory reserves
	 * in order to prevent the OOM victim from depleting the memory
	 * reserves from the user space under its control.
874
	 */
875
	do_send_sig_info(SIGKILL, SEND_SIG_PRIV, victim, PIDTYPE_TGID);
876
	mark_oom_victim(victim);
877 878 879
	pr_err("%s: Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
		message, task_pid_nr(victim), victim->comm,
		K(victim->mm->total_vm),
880
		K(get_mm_counter(victim->mm, MM_ANONPAGES)),
881 882
		K(get_mm_counter(victim->mm, MM_FILEPAGES)),
		K(get_mm_counter(victim->mm, MM_SHMEMPAGES)));
883 884 885 886 887 888 889 890 891 892 893
	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.
	 */
894
	rcu_read_lock();
895
	for_each_process(p) {
896
		if (!process_shares_mm(p, mm))
897 898 899
			continue;
		if (same_thread_group(p, victim))
			continue;
900
		if (is_global_init(p)) {
M
Michal Hocko 已提交
901
			can_oom_reap = false;
902
			set_bit(MMF_OOM_SKIP, &mm->flags);
903 904 905
			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);
906
			continue;
M
Michal Hocko 已提交
907
		}
908 909 910 911 912 913
		/*
		 * No use_mm() user needs to read from the userspace so we are
		 * ok to reap it.
		 */
		if (unlikely(p->flags & PF_KTHREAD))
			continue;
914
		do_send_sig_info(SIGKILL, SEND_SIG_PRIV, p, PIDTYPE_TGID);
915
	}
916
	rcu_read_unlock();
917

M
Michal Hocko 已提交
918
	if (can_oom_reap)
919
		wake_oom_reaper(victim);
M
Michal Hocko 已提交
920

921
	mmdrop(mm);
922
	put_task_struct(victim);
L
Linus Torvalds 已提交
923
}
924
#undef K
L
Linus Torvalds 已提交
925

926 927 928 929
/*
 * Kill provided task unless it's secured by setting
 * oom_score_adj to OOM_SCORE_ADJ_MIN.
 */
930
static int oom_kill_memcg_member(struct task_struct *task, void *message)
931
{
932 933
	if (task->signal->oom_score_adj != OOM_SCORE_ADJ_MIN &&
	    !is_global_init(task)) {
934
		get_task_struct(task);
935
		__oom_kill_process(task, message);
936 937 938 939
	}
	return 0;
}

940 941
static void oom_kill_process(struct oom_control *oc, const char *message)
{
942
	struct task_struct *victim = oc->chosen;
943
	struct mem_cgroup *oom_group;
944 945 946 947 948 949 950 951
	static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
					      DEFAULT_RATELIMIT_BURST);

	/*
	 * If the task is already exiting, don't alarm the sysadmin or kill
	 * its children or threads, just give it access to memory reserves
	 * so it can die quickly
	 */
952 953 954 955 956 957
	task_lock(victim);
	if (task_will_free_mem(victim)) {
		mark_oom_victim(victim);
		wake_oom_reaper(victim);
		task_unlock(victim);
		put_task_struct(victim);
958 959
		return;
	}
960
	task_unlock(victim);
961 962

	if (__ratelimit(&oom_rs))
963
		dump_header(oc, victim);
964

965 966 967 968 969 970 971
	/*
	 * Do we need to kill the entire memory cgroup?
	 * Or even one of the ancestor memory cgroups?
	 * Check this out before killing the victim task.
	 */
	oom_group = mem_cgroup_get_oom_group(victim, oc->memcg);

972
	__oom_kill_process(victim, message);
973 974 975 976 977 978

	/*
	 * If necessary, kill all tasks in the selected memory cgroup.
	 */
	if (oom_group) {
		mem_cgroup_print_oom_group(oom_group);
979 980
		mem_cgroup_scan_tasks(oom_group, oom_kill_memcg_member,
				      (void*)message);
981 982
		mem_cgroup_put(oom_group);
	}
983 984
}

985 986 987
/*
 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
 */
988 989
static void check_panic_on_oom(struct oom_control *oc,
			       enum oom_constraint constraint)
990 991 992 993 994 995 996 997 998 999 1000 1001
{
	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;
	}
1002
	/* Do not panic for oom kills triggered by sysrq */
1003
	if (is_sysrq_oom(oc))
1004
		return;
1005
	dump_header(oc, NULL);
1006 1007 1008 1009
	panic("Out of memory: %s panic_on_oom is enabled\n",
		sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
}

1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023
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 已提交
1024
/**
1025 1026
 * out_of_memory - kill the "best" process when we run out of memory
 * @oc: pointer to struct oom_control
L
Linus Torvalds 已提交
1027 1028 1029 1030 1031 1032
 *
 * 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.
 */
1033
bool out_of_memory(struct oom_control *oc)
L
Linus Torvalds 已提交
1034
{
1035
	unsigned long freed = 0;
1036
	enum oom_constraint constraint = CONSTRAINT_NONE;
1037

1038 1039 1040
	if (oom_killer_disabled)
		return false;

1041 1042 1043 1044 1045 1046
	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 已提交
1047

1048
	/*
1049 1050 1051
	 * 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.
1052
	 */
1053
	if (task_will_free_mem(current)) {
1054
		mark_oom_victim(current);
1055
		wake_oom_reaper(current);
1056
		return true;
1057 1058
	}

1059 1060 1061 1062 1063 1064
	/*
	 * 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.
	 */
1065
	if (oc->gfp_mask && !(oc->gfp_mask & __GFP_FS))
1066 1067
		return true;

1068 1069
	/*
	 * Check if there were limitations on the allocation (only relevant for
1070
	 * NUMA and memcg) that may require different handling.
1071
	 */
1072
	constraint = constrained_alloc(oc);
1073 1074
	if (constraint != CONSTRAINT_MEMORY_POLICY)
		oc->nodemask = NULL;
1075
	check_panic_on_oom(oc, constraint);
1076

1077 1078
	if (!is_memcg_oom(oc) && sysctl_oom_kill_allocating_task &&
	    current->mm && !oom_unkillable_task(current, NULL, oc->nodemask) &&
1079
	    current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
1080
		get_task_struct(current);
1081 1082
		oc->chosen = current;
		oom_kill_process(oc, "Out of memory (oom_kill_allocating_task)");
1083
		return true;
1084 1085
	}

1086
	select_bad_process(oc);
1087 1088
	/* Found nothing?!?! */
	if (!oc->chosen) {
1089
		dump_header(oc, NULL);
1090 1091 1092 1093 1094 1095 1096 1097
		pr_warn("Out of memory and no killable processes...\n");
		/*
		 * If we got here due to an actual allocation at the
		 * system level, we cannot survive this and will enter
		 * an endless loop in the allocator. Bail out now.
		 */
		if (!is_sysrq_oom(oc) && !is_memcg_oom(oc))
			panic("System is deadlocked on memory\n");
1098
	}
1099
	if (oc->chosen && oc->chosen != (void *)-1UL)
1100 1101 1102
		oom_kill_process(oc, !is_memcg_oom(oc) ? "Out of memory" :
				 "Memory cgroup out of memory");
	return !!oc->chosen;
1103 1104
}

1105 1106
/*
 * The pagefault handler calls here because it is out of memory, so kill a
V
Vladimir Davydov 已提交
1107 1108
 * memory-hogging task. If oom_lock is held by somebody else, a parallel oom
 * killing is already in progress so do nothing.
1109 1110 1111
 */
void pagefault_out_of_memory(void)
{
1112 1113 1114
	struct oom_control oc = {
		.zonelist = NULL,
		.nodemask = NULL,
1115
		.memcg = NULL,
1116 1117 1118 1119
		.gfp_mask = 0,
		.order = 0,
	};

1120
	if (mem_cgroup_oom_synchronize(true))
1121
		return;
1122

1123 1124
	if (!mutex_trylock(&oom_lock))
		return;
1125
	out_of_memory(&oc);
1126
	mutex_unlock(&oom_lock);
1127
}