oom_kill.c 20.0 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>
38 39 40

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

42
int sysctl_panic_on_oom;
43
int sysctl_oom_kill_allocating_task;
44
int sysctl_oom_dump_tasks = 1;
45 46

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

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

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

86
	return ret;
87 88 89 90 91 92
}
#else
static bool has_intersects_mems_allowed(struct task_struct *tsk,
					const nodemask_t *mask)
{
	return true;
93
}
94
#endif /* CONFIG_NUMA */
95

96 97 98 99 100 101
/*
 * 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.
 */
102
struct task_struct *find_lock_task_mm(struct task_struct *p)
103
{
104
	struct task_struct *t;
105

106 107
	rcu_read_lock();

108
	for_each_thread(p, t) {
109 110
		task_lock(t);
		if (likely(t->mm))
111
			goto found;
112
		task_unlock(t);
113
	}
114 115 116
	t = NULL;
found:
	rcu_read_unlock();
117

118
	return t;
119 120
}

121
/* return true if the task is not adequate as candidate victim task. */
122
static bool oom_unkillable_task(struct task_struct *p,
123
		struct mem_cgroup *memcg, const nodemask_t *nodemask)
124 125 126 127 128 129 130
{
	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 */
131
	if (memcg && !task_in_mem_cgroup(p, memcg))
132 133 134 135 136 137 138 139 140
		return true;

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

	return false;
}

L
Linus Torvalds 已提交
141
/**
D
David Rientjes 已提交
142
 * oom_badness - heuristic function to determine which candidate task to kill
L
Linus Torvalds 已提交
143
 * @p: task struct of which task we should calculate
D
David Rientjes 已提交
144
 * @totalpages: total present RAM allowed for page allocation
L
Linus Torvalds 已提交
145
 *
D
David Rientjes 已提交
146 147 148
 * 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 已提交
149
 */
150 151
unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
			  const nodemask_t *nodemask, unsigned long totalpages)
L
Linus Torvalds 已提交
152
{
153
	long points;
154
	long adj;
155

156
	if (oom_unkillable_task(p, memcg, nodemask))
157
		return 0;
L
Linus Torvalds 已提交
158

159 160
	p = find_lock_task_mm(p);
	if (!p)
L
Linus Torvalds 已提交
161 162
		return 0;

163
	adj = (long)p->signal->oom_score_adj;
164
	if (adj == OOM_SCORE_ADJ_MIN) {
165 166 167 168
		task_unlock(p);
		return 0;
	}

L
Linus Torvalds 已提交
169
	/*
D
David Rientjes 已提交
170
	 * The baseline for the badness score is the proportion of RAM that each
171
	 * task's rss, pagetable and swap space use.
L
Linus Torvalds 已提交
172
	 */
173 174
	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 已提交
175
	task_unlock(p);
L
Linus Torvalds 已提交
176 177

	/*
D
David Rientjes 已提交
178 179
	 * Root processes get 3% bonus, just like the __vm_enough_memory()
	 * implementation used by LSMs.
L
Linus Torvalds 已提交
180
	 */
D
David Rientjes 已提交
181
	if (has_capability_noaudit(p, CAP_SYS_ADMIN))
182
		points -= (points * 3) / 100;
L
Linus Torvalds 已提交
183

184 185 186
	/* Normalize to oom_score_adj units */
	adj *= totalpages / 1000;
	points += adj;
L
Linus Torvalds 已提交
187

188
	/*
189 190
	 * 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).
191
	 */
192
	return points > 0 ? points : 1;
L
Linus Torvalds 已提交
193 194
}

195 196 197 198
/*
 * Determine the type of allocation constraint.
 */
#ifdef CONFIG_NUMA
199 200
static enum oom_constraint constrained_alloc(struct oom_control *oc,
					     unsigned long *totalpages)
201
{
202
	struct zone *zone;
203
	struct zoneref *z;
204
	enum zone_type high_zoneidx = gfp_zone(oc->gfp_mask);
D
David Rientjes 已提交
205 206
	bool cpuset_limited = false;
	int nid;
207

D
David Rientjes 已提交
208 209 210
	/* Default to all available memory */
	*totalpages = totalram_pages + total_swap_pages;

211
	if (!oc->zonelist)
D
David Rientjes 已提交
212
		return CONSTRAINT_NONE;
213 214 215 216 217
	/*
	 * 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.
	 */
218
	if (oc->gfp_mask & __GFP_THISNODE)
219
		return CONSTRAINT_NONE;
220

221
	/*
D
David Rientjes 已提交
222 223 224
	 * 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().
225
	 */
226 227
	if (oc->nodemask &&
	    !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {
D
David Rientjes 已提交
228
		*totalpages = total_swap_pages;
229
		for_each_node_mask(nid, *oc->nodemask)
D
David Rientjes 已提交
230
			*totalpages += node_spanned_pages(nid);
231
		return CONSTRAINT_MEMORY_POLICY;
D
David Rientjes 已提交
232
	}
233 234

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

D
David Rientjes 已提交
240 241 242 243 244 245
	if (cpuset_limited) {
		*totalpages = total_swap_pages;
		for_each_node_mask(nid, cpuset_current_mems_allowed)
			*totalpages += node_spanned_pages(nid);
		return CONSTRAINT_CPUSET;
	}
246 247
	return CONSTRAINT_NONE;
}
248
#else
249 250
static enum oom_constraint constrained_alloc(struct oom_control *oc,
					     unsigned long *totalpages)
251
{
D
David Rientjes 已提交
252
	*totalpages = totalram_pages + total_swap_pages;
253 254 255
	return CONSTRAINT_NONE;
}
#endif
256

257 258
enum oom_scan_t oom_scan_process_thread(struct oom_control *oc,
			struct task_struct *task, unsigned long totalpages)
259
{
260
	if (oom_unkillable_task(task, NULL, oc->nodemask))
261 262 263 264 265 266 267
		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.
	 */
	if (test_tsk_thread_flag(task, TIF_MEMDIE)) {
268
		if (oc->order != -1)
269 270 271 272 273
			return OOM_SCAN_ABORT;
	}
	if (!task->mm)
		return OOM_SCAN_CONTINUE;

274 275 276 277 278 279 280
	/*
	 * 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;

281
	if (task_will_free_mem(task) && oc->order != -1)
282 283
		return OOM_SCAN_ABORT;

284 285 286
	return OOM_SCAN_OK;
}

L
Linus Torvalds 已提交
287 288
/*
 * Simple selection loop. We chose the process with the highest
289
 * number of 'points'.  Returns -1 on scan abort.
L
Linus Torvalds 已提交
290
 */
291 292
static struct task_struct *select_bad_process(struct oom_control *oc,
		unsigned int *ppoints, unsigned long totalpages)
L
Linus Torvalds 已提交
293
{
294
	struct task_struct *g, *p;
L
Linus Torvalds 已提交
295
	struct task_struct *chosen = NULL;
296
	unsigned long chosen_points = 0;
L
Linus Torvalds 已提交
297

298
	rcu_read_lock();
299
	for_each_process_thread(g, p) {
D
David Rientjes 已提交
300
		unsigned int points;
P
Paul Jackson 已提交
301

302
		switch (oom_scan_process_thread(oc, p, totalpages)) {
303 304 305 306 307
		case OOM_SCAN_SELECT:
			chosen = p;
			chosen_points = ULONG_MAX;
			/* fall through */
		case OOM_SCAN_CONTINUE:
308
			continue;
309
		case OOM_SCAN_ABORT:
310
			rcu_read_unlock();
311
			return (struct task_struct *)(-1UL);
312 313 314
		case OOM_SCAN_OK:
			break;
		};
315
		points = oom_badness(p, NULL, oc->nodemask, totalpages);
316 317 318 319 320 321 322 323
		if (!points || points < chosen_points)
			continue;
		/* Prefer thread group leaders for display purposes */
		if (points == chosen_points && thread_group_leader(chosen))
			continue;

		chosen = p;
		chosen_points = points;
324
	}
325 326 327
	if (chosen)
		get_task_struct(chosen);
	rcu_read_unlock();
328

329
	*ppoints = chosen_points * 1000 / totalpages;
L
Linus Torvalds 已提交
330 331 332
	return chosen;
}

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

349
	pr_info("[ pid ]   uid  tgid total_vm      rss nr_ptes nr_pmds swapents oom_score_adj name\n");
350
	rcu_read_lock();
351
	for_each_process(p) {
352
		if (oom_unkillable_task(p, memcg, nodemask))
353
			continue;
354

355 356
		task = find_lock_task_mm(p);
		if (!task) {
357
			/*
358 359
			 * This is a kthread or all of p's threads have already
			 * detached their mm's.  There's no need to report
360
			 * them; they can't be oom killed anyway.
361 362 363
			 */
			continue;
		}
364

365
		pr_info("[%5d] %5d %5d %8lu %8lu %7ld %7ld %8lu         %5hd %s\n",
366 367
			task->pid, from_kuid(&init_user_ns, task_uid(task)),
			task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
368
			atomic_long_read(&task->mm->nr_ptes),
369
			mm_nr_pmds(task->mm),
370
			get_mm_counter(task->mm, MM_SWAPENTS),
D
David Rientjes 已提交
371
			task->signal->oom_score_adj, task->comm);
372 373
		task_unlock(task);
	}
374
	rcu_read_unlock();
375 376
}

377 378
static void dump_header(struct oom_control *oc, struct task_struct *p,
			struct mem_cgroup *memcg)
379
{
380
	task_lock(current);
381
	pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
382
		"oom_score_adj=%hd\n",
383
		current->comm, oc->gfp_mask, oc->order,
D
David Rientjes 已提交
384
		current->signal->oom_score_adj);
385 386 387
	cpuset_print_task_mems_allowed(current);
	task_unlock(current);
	dump_stack();
388 389 390 391
	if (memcg)
		mem_cgroup_print_oom_info(memcg, p);
	else
		show_mem(SHOW_MEM_FILTER_NODES);
392
	if (sysctl_oom_dump_tasks)
393
		dump_tasks(memcg, oc->nodemask);
394 395
}

396
/*
397
 * Number of OOM victims in flight
398
 */
399 400
static atomic_t oom_victims = ATOMIC_INIT(0);
static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);
401

402
bool oom_killer_disabled __read_mostly;
403

404
/**
405
 * mark_oom_victim - mark the given task as OOM victim
406
 * @tsk: task to mark
407
 *
408
 * Has to be called with oom_lock held and never after
409
 * oom has been disabled already.
410
 */
411
void mark_oom_victim(struct task_struct *tsk)
412
{
413 414 415 416
	WARN_ON(oom_killer_disabled);
	/* OOM killer might race with memcg OOM */
	if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))
		return;
417 418 419 420 421 422 423
	/*
	 * 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);
424
	atomic_inc(&oom_victims);
425 426 427
}

/**
428
 * exit_oom_victim - note the exit of an OOM victim
429
 */
430
void exit_oom_victim(void)
431
{
432
	clear_thread_flag(TIF_MEMDIE);
433

434
	if (!atomic_dec_return(&oom_victims))
435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456
		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)
{
	/*
	 * Make sure to not race with an ongoing OOM killer
	 * and that the current is not the victim.
	 */
457
	mutex_lock(&oom_lock);
458
	if (test_thread_flag(TIF_MEMDIE)) {
459
		mutex_unlock(&oom_lock);
460 461 462 463
		return false;
	}

	oom_killer_disabled = true;
464
	mutex_unlock(&oom_lock);
465 466 467 468 469 470 471 472 473 474 475 476

	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;
477 478
}

479
#define K(x) ((x) << (PAGE_SHIFT-10))
480 481 482 483
/*
 * Must be called while holding a reference to p, which will be released upon
 * returning.
 */
484
void oom_kill_process(struct oom_control *oc, struct task_struct *p,
485
		      unsigned int points, unsigned long totalpages,
486
		      struct mem_cgroup *memcg, const char *message)
L
Linus Torvalds 已提交
487
{
488
	struct task_struct *victim = p;
489
	struct task_struct *child;
490
	struct task_struct *t;
491
	struct mm_struct *mm;
492
	unsigned int victim_points = 0;
493 494
	static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
					      DEFAULT_RATELIMIT_BURST);
L
Linus Torvalds 已提交
495

496 497 498 499
	/*
	 * 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
	 */
500 501
	task_lock(p);
	if (p->mm && task_will_free_mem(p)) {
502
		mark_oom_victim(p);
503
		task_unlock(p);
504
		put_task_struct(p);
505
		return;
506
	}
507
	task_unlock(p);
508

509
	if (__ratelimit(&oom_rs))
510
		dump_header(oc, p, memcg);
511

512
	task_lock(p);
513
	pr_err("%s: Kill process %d (%s) score %u or sacrifice child\n",
514 515
		message, task_pid_nr(p), p->comm, points);
	task_unlock(p);
N
Nick Piggin 已提交
516

517 518
	/*
	 * If any of p's children has a different mm and is eligible for kill,
519
	 * the one with the highest oom_badness() score is sacrificed for its
520 521 522
	 * parent.  This attempts to lose the minimal amount of work done while
	 * still freeing memory.
	 */
523
	read_lock(&tasklist_lock);
524
	for_each_thread(p, t) {
525
		list_for_each_entry(child, &t->children, sibling) {
D
David Rientjes 已提交
526
			unsigned int child_points;
527

528 529
			if (child->mm == p->mm)
				continue;
D
David Rientjes 已提交
530 531 532
			/*
			 * oom_badness() returns 0 if the thread is unkillable
			 */
533
			child_points = oom_badness(child, memcg, oc->nodemask,
D
David Rientjes 已提交
534
								totalpages);
535
			if (child_points > victim_points) {
536
				put_task_struct(victim);
537 538
				victim = child;
				victim_points = child_points;
539
				get_task_struct(victim);
540
			}
541
		}
542
	}
543
	read_unlock(&tasklist_lock);
544

545 546 547
	p = find_lock_task_mm(victim);
	if (!p) {
		put_task_struct(victim);
548
		return;
549 550 551 552 553
	} else if (victim != p) {
		get_task_struct(p);
		put_task_struct(victim);
		victim = p;
	}
554 555 556

	/* mm cannot safely be dereferenced after task_unlock(victim) */
	mm = victim->mm;
557
	mark_oom_victim(victim);
558 559 560 561 562 563 564 565 566 567 568 569 570 571 572
	pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
		task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
		K(get_mm_counter(victim->mm, MM_ANONPAGES)),
		K(get_mm_counter(victim->mm, MM_FILEPAGES)));
	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.
	 */
573
	rcu_read_lock();
574 575 576 577 578 579 580 581 582 583
	for_each_process(p)
		if (p->mm == mm && !same_thread_group(p, victim) &&
		    !(p->flags & PF_KTHREAD)) {
			if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
				continue;

			task_lock(p);	/* Protect ->comm from prctl() */
			pr_err("Kill process %d (%s) sharing same memory\n",
				task_pid_nr(p), p->comm);
			task_unlock(p);
584
			do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
585
		}
586
	rcu_read_unlock();
587

588
	do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
589
	put_task_struct(victim);
L
Linus Torvalds 已提交
590
}
591
#undef K
L
Linus Torvalds 已提交
592

593 594 595
/*
 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
 */
596
void check_panic_on_oom(struct oom_control *oc, enum oom_constraint constraint,
597
			struct mem_cgroup *memcg)
598 599 600 601 602 603 604 605 606 607 608 609
{
	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;
	}
610 611 612
	/* Do not panic for oom kills triggered by sysrq */
	if (oc->order == -1)
		return;
613
	dump_header(oc, NULL, memcg);
614 615 616 617
	panic("Out of memory: %s panic_on_oom is enabled\n",
		sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
}

618 619 620 621 622 623 624 625 626 627 628 629 630 631
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 已提交
632
/**
633 634
 * out_of_memory - kill the "best" process when we run out of memory
 * @oc: pointer to struct oom_control
L
Linus Torvalds 已提交
635 636 637 638 639 640
 *
 * 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.
 */
641
bool out_of_memory(struct oom_control *oc)
L
Linus Torvalds 已提交
642
{
643
	struct task_struct *p;
D
David Rientjes 已提交
644
	unsigned long totalpages;
645
	unsigned long freed = 0;
646
	unsigned int uninitialized_var(points);
647
	enum oom_constraint constraint = CONSTRAINT_NONE;
648

649 650 651
	if (oom_killer_disabled)
		return false;

652 653 654
	blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
	if (freed > 0)
		/* Got some memory back in the last second. */
655
		return true;
L
Linus Torvalds 已提交
656

657
	/*
658 659 660
	 * 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.
661 662 663
	 *
	 * 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.
664
	 */
665 666
	if (current->mm &&
	    (fatal_signal_pending(current) || task_will_free_mem(current))) {
667
		mark_oom_victim(current);
668
		return true;
669 670
	}

671 672 673 674
	/*
	 * Check if there were limitations on the allocation (only relevant for
	 * NUMA) that may require different handling.
	 */
675 676 677 678
	constraint = constrained_alloc(oc, &totalpages);
	if (constraint != CONSTRAINT_MEMORY_POLICY)
		oc->nodemask = NULL;
	check_panic_on_oom(oc, constraint, NULL);
679

680
	if (sysctl_oom_kill_allocating_task && current->mm &&
681
	    !oom_unkillable_task(current, NULL, oc->nodemask) &&
682
	    current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
683
		get_task_struct(current);
684
		oom_kill_process(oc, current, 0, totalpages, NULL,
685
				 "Out of memory (oom_kill_allocating_task)");
686
		return true;
687 688
	}

689
	p = select_bad_process(oc, &points, totalpages);
690
	/* Found nothing?!?! Either we hang forever, or we panic. */
691
	if (!p && oc->order != -1) {
692
		dump_header(oc, NULL, NULL);
693 694
		panic("Out of memory and no killable processes...\n");
	}
695
	if (p && p != (void *)-1UL) {
696 697
		oom_kill_process(oc, p, points, totalpages, NULL,
				 "Out of memory");
698 699 700 701
		/*
		 * Give the killed process a good chance to exit before trying
		 * to allocate memory again.
		 */
702
		schedule_timeout_killable(1);
703
	}
704
	return true;
705 706
}

707 708
/*
 * The pagefault handler calls here because it is out of memory, so kill a
709 710
 * memory-hogging task.  If any populated zone has ZONE_OOM_LOCKED set, a
 * parallel oom killing is already in progress so do nothing.
711 712 713
 */
void pagefault_out_of_memory(void)
{
714 715 716 717 718 719 720
	struct oom_control oc = {
		.zonelist = NULL,
		.nodemask = NULL,
		.gfp_mask = 0,
		.order = 0,
	};

721
	if (mem_cgroup_oom_synchronize(true))
722
		return;
723

724 725
	if (!mutex_trylock(&oom_lock))
		return;
726

727
	if (!out_of_memory(&oc)) {
728 729 730 731 732 733 734
		/*
		 * 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));
735
	}
736 737

	mutex_unlock(&oom_lock);
738
}