oom_kill.c 20.3 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6
/*
 *  linux/mm/oom_kill.c
 * 
 *  Copyright (C)  1998,2000  Rik van Riel
 *	Thanks go out to Claus Fischer for some serious inspiration and
 *	for goading me into coding this file...
D
David Rientjes 已提交
7 8
 *  Copyright (C)  2010  Google, Inc.
 *	Rewritten by David Rientjes
L
Linus Torvalds 已提交
9 10
 *
 *  The routines in this file are used to kill a process when
P
Paul Jackson 已提交
11 12
 *  we're seriously out of memory. This gets called from __alloc_pages()
 *  in mm/page_alloc.c when we really run out of memory.
L
Linus Torvalds 已提交
13 14 15 16 17 18 19
 *
 *  Since we won't call these routines often (on a well-configured
 *  machine) this file will double as a 'coding guide' and a signpost
 *  for newbie kernel hackers. It features several pointers to major
 *  kernel subsystems and hints as to where to find out what things do.
 */

20
#include <linux/oom.h>
L
Linus Torvalds 已提交
21
#include <linux/mm.h>
A
Alexey Dobriyan 已提交
22
#include <linux/err.h>
23
#include <linux/gfp.h>
L
Linus Torvalds 已提交
24 25 26 27
#include <linux/sched.h>
#include <linux/swap.h>
#include <linux/timex.h>
#include <linux/jiffies.h>
28
#include <linux/cpuset.h>
29 30
#include <linux/module.h>
#include <linux/notifier.h>
31
#include <linux/memcontrol.h>
32
#include <linux/mempolicy.h>
33
#include <linux/security.h>
L
Linus Torvalds 已提交
34

35
int sysctl_panic_on_oom;
36
int sysctl_oom_kill_allocating_task;
37
int sysctl_oom_dump_tasks = 1;
D
David Rientjes 已提交
38
static DEFINE_SPINLOCK(zone_scan_lock);
L
Linus Torvalds 已提交
39

40 41 42 43 44 45 46 47 48
#ifdef CONFIG_NUMA
/**
 * has_intersects_mems_allowed() - check task eligiblity for kill
 * @tsk: task struct of which task to consider
 * @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.
49
 */
50 51
static bool has_intersects_mems_allowed(struct task_struct *tsk,
					const nodemask_t *mask)
52
{
53
	struct task_struct *start = tsk;
54 55

	do {
56 57 58 59 60 61 62 63 64 65 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.
			 */
			if (mempolicy_nodemask_intersects(tsk, mask))
				return true;
		} else {
			/*
			 * This is not a mempolicy constrained oom, so only
			 * check the mems of tsk's cpuset.
			 */
			if (cpuset_mems_allowed_intersects(current, tsk))
				return true;
		}
73 74
	} while_each_thread(start, tsk);

75 76 77 78 79 80 81
	return false;
}
#else
static bool has_intersects_mems_allowed(struct task_struct *tsk,
					const nodemask_t *mask)
{
	return true;
82
}
83
#endif /* CONFIG_NUMA */
84

85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102
/*
 * If this is a system OOM (not a memcg OOM) and the task selected to be
 * killed is not already running at high (RT) priorities, speed up the
 * recovery by boosting the dying task to the lowest FIFO priority.
 * That helps with the recovery and avoids interfering with RT tasks.
 */
static void boost_dying_task_prio(struct task_struct *p,
				  struct mem_cgroup *mem)
{
	struct sched_param param = { .sched_priority = 1 };

	if (mem)
		return;

	if (!rt_task(p))
		sched_setscheduler_nocheck(p, SCHED_FIFO, &param);
}

103 104 105 106 107 108
/*
 * 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.
 */
109
struct task_struct *find_lock_task_mm(struct task_struct *p)
110 111 112 113 114 115 116 117 118 119 120 121 122
{
	struct task_struct *t = p;

	do {
		task_lock(t);
		if (likely(t->mm))
			return t;
		task_unlock(t);
	} while_each_thread(p, t);

	return NULL;
}

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

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

	return false;
}

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

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

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

	/*
D
David Rientjes 已提交
165 166
	 * Shortcut check for OOM_SCORE_ADJ_MIN so the entire heuristic doesn't
	 * need to be executed for something that cannot be killed.
L
Linus Torvalds 已提交
167
	 */
D
David Rientjes 已提交
168 169 170 171
	if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN) {
		task_unlock(p);
		return 0;
	}
L
Linus Torvalds 已提交
172 173

	/*
D
David Rientjes 已提交
174 175
	 * When the PF_OOM_ORIGIN bit is set, it indicates the task should have
	 * priority for oom killing.
L
Linus Torvalds 已提交
176
	 */
D
David Rientjes 已提交
177 178 179 180
	if (p->flags & PF_OOM_ORIGIN) {
		task_unlock(p);
		return 1000;
	}
L
Linus Torvalds 已提交
181 182

	/*
D
David Rientjes 已提交
183 184
	 * The memory controller may have a limit of 0 bytes, so avoid a divide
	 * by zero, if necessary.
L
Linus Torvalds 已提交
185
	 */
D
David Rientjes 已提交
186 187
	if (!totalpages)
		totalpages = 1;
L
Linus Torvalds 已提交
188 189

	/*
D
David Rientjes 已提交
190 191
	 * The baseline for the badness score is the proportion of RAM that each
	 * task's rss and swap space use.
L
Linus Torvalds 已提交
192
	 */
D
David Rientjes 已提交
193 194 195
	points = (get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS)) * 1000 /
			totalpages;
	task_unlock(p);
L
Linus Torvalds 已提交
196 197

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

	/*
D
David Rientjes 已提交
205 206 207
	 * /proc/pid/oom_score_adj ranges from -1000 to +1000 such that it may
	 * either completely disable oom killing or always prefer a certain
	 * task.
L
Linus Torvalds 已提交
208
	 */
D
David Rientjes 已提交
209
	points += p->signal->oom_score_adj;
L
Linus Torvalds 已提交
210

211 212 213 214 215 216 217
	/*
	 * Never return 0 for an eligible task that may be killed since it's
	 * possible that no single user task uses more than 0.1% of memory and
	 * no single admin tasks uses more than 3.0%.
	 */
	if (points <= 0)
		return 1;
D
David Rientjes 已提交
218
	return (points < 1000) ? points : 1000;
L
Linus Torvalds 已提交
219 220
}

221 222 223 224
/*
 * Determine the type of allocation constraint.
 */
#ifdef CONFIG_NUMA
225
static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
D
David Rientjes 已提交
226 227
				gfp_t gfp_mask, nodemask_t *nodemask,
				unsigned long *totalpages)
228
{
229
	struct zone *zone;
230
	struct zoneref *z;
231
	enum zone_type high_zoneidx = gfp_zone(gfp_mask);
D
David Rientjes 已提交
232 233
	bool cpuset_limited = false;
	int nid;
234

D
David Rientjes 已提交
235 236 237 238 239
	/* Default to all available memory */
	*totalpages = totalram_pages + total_swap_pages;

	if (!zonelist)
		return CONSTRAINT_NONE;
240 241 242 243 244 245 246
	/*
	 * 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.
	 */
	if (gfp_mask & __GFP_THISNODE)
		return CONSTRAINT_NONE;
247

248
	/*
D
David Rientjes 已提交
249 250 251
	 * 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().
252
	 */
D
David Rientjes 已提交
253 254 255 256
	if (nodemask && !nodes_subset(node_states[N_HIGH_MEMORY], *nodemask)) {
		*totalpages = total_swap_pages;
		for_each_node_mask(nid, *nodemask)
			*totalpages += node_spanned_pages(nid);
257
		return CONSTRAINT_MEMORY_POLICY;
D
David Rientjes 已提交
258
	}
259 260 261 262 263

	/* Check this allocation failure is caused by cpuset's wall function */
	for_each_zone_zonelist_nodemask(zone, z, zonelist,
			high_zoneidx, nodemask)
		if (!cpuset_zone_allowed_softwall(zone, gfp_mask))
D
David Rientjes 已提交
264
			cpuset_limited = true;
265

D
David Rientjes 已提交
266 267 268 269 270 271
	if (cpuset_limited) {
		*totalpages = total_swap_pages;
		for_each_node_mask(nid, cpuset_current_mems_allowed)
			*totalpages += node_spanned_pages(nid);
		return CONSTRAINT_CPUSET;
	}
272 273
	return CONSTRAINT_NONE;
}
274 275
#else
static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
D
David Rientjes 已提交
276 277
				gfp_t gfp_mask, nodemask_t *nodemask,
				unsigned long *totalpages)
278
{
D
David Rientjes 已提交
279
	*totalpages = totalram_pages + total_swap_pages;
280 281 282
	return CONSTRAINT_NONE;
}
#endif
283

L
Linus Torvalds 已提交
284 285 286 287 288 289
/*
 * Simple selection loop. We chose the process with the highest
 * number of 'points'. We expect the caller will lock the tasklist.
 *
 * (not docbooked, we don't want this one cluttering up the manual)
 */
D
David Rientjes 已提交
290 291 292
static struct task_struct *select_bad_process(unsigned int *ppoints,
		unsigned long totalpages, struct mem_cgroup *mem,
		const nodemask_t *nodemask)
L
Linus Torvalds 已提交
293
{
294
	struct task_struct *p;
L
Linus Torvalds 已提交
295
	struct task_struct *chosen = NULL;
296
	*ppoints = 0;
L
Linus Torvalds 已提交
297

298
	for_each_process(p) {
D
David Rientjes 已提交
299
		unsigned int points;
P
Paul Jackson 已提交
300

301
		if (oom_unkillable_task(p, mem, nodemask))
302
			continue;
303

304 305 306 307 308 309 310 311 312 313 314 315
		/*
		 * This task already has access to memory reserves and is
		 * being killed. Don't allow any other task access to the
		 * memory reserve.
		 *
		 * Note: this may have a chance of deadlock if it gets
		 * blocked waiting for another task which itself is waiting
		 * for memory. Is there a better alternative?
		 */
		if (test_tsk_thread_flag(p, TIF_MEMDIE))
			return ERR_PTR(-1UL);

P
Paul Jackson 已提交
316
		/*
317
		 * This is in the process of releasing memory so wait for it
P
Paul Jackson 已提交
318
		 * to finish before killing some other task by mistake.
319 320 321 322 323
		 *
		 * However, if p is the current task, we allow the 'kill' to
		 * go ahead if it is exiting: this will simply set TIF_MEMDIE,
		 * which will allow it to gain access to memory reserves in
		 * the process of exiting and releasing its resources.
324
		 * Otherwise we could get an easy OOM deadlock.
P
Paul Jackson 已提交
325
		 */
326
		if (thread_group_empty(p) && (p->flags & PF_EXITING) && p->mm) {
327 328 329
			if (p != current)
				return ERR_PTR(-1UL);

330
			chosen = p;
D
David Rientjes 已提交
331
			*ppoints = 1000;
332
		}
333

D
David Rientjes 已提交
334 335
		points = oom_badness(p, mem, nodemask, totalpages);
		if (points > *ppoints) {
P
Paul Jackson 已提交
336
			chosen = p;
337
			*ppoints = points;
L
Linus Torvalds 已提交
338
		}
339
	}
340

L
Linus Torvalds 已提交
341 342 343
	return chosen;
}

344
/**
R
Randy Dunlap 已提交
345
 * dump_tasks - dump current memory state of all system tasks
346
 * @mem: current's memory controller, if constrained
347
 * @nodemask: nodemask passed to page allocator for mempolicy ooms
R
Randy Dunlap 已提交
348
 *
349 350 351
 * Dumps the current memory state of all eligible tasks.  Tasks not in the same
 * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
 * are not shown.
352
 * State information includes task's pid, uid, tgid, vm size, rss, cpu, oom_adj
D
David Rientjes 已提交
353
 * value, oom_score_adj value, and name.
354 355 356
 *
 * Call with tasklist_lock read-locked.
 */
357
static void dump_tasks(const struct mem_cgroup *mem, const nodemask_t *nodemask)
358
{
359 360
	struct task_struct *p;
	struct task_struct *task;
361

D
David Rientjes 已提交
362
	pr_info("[ pid ]   uid  tgid total_vm      rss cpu oom_adj oom_score_adj name\n");
363
	for_each_process(p) {
364
		if (oom_unkillable_task(p, mem, nodemask))
365
			continue;
366

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

D
David Rientjes 已提交
377
		pr_info("[%5d] %5d %5d %8lu %8lu %3u     %3d         %5d %s\n",
378
			task->pid, task_uid(task), task->tgid,
D
David Rientjes 已提交
379 380 381
			task->mm->total_vm, get_mm_rss(task->mm),
			task_cpu(task), task->signal->oom_adj,
			task->signal->oom_score_adj, task->comm);
382 383
		task_unlock(task);
	}
384 385
}

386
static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order,
387
			struct mem_cgroup *mem, const nodemask_t *nodemask)
388
{
389
	task_lock(current);
390
	pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
D
David Rientjes 已提交
391 392 393
		"oom_adj=%d, oom_score_adj=%d\n",
		current->comm, gfp_mask, order, current->signal->oom_adj,
		current->signal->oom_score_adj);
394 395 396
	cpuset_print_task_mems_allowed(current);
	task_unlock(current);
	dump_stack();
397
	mem_cgroup_print_oom_info(mem, p);
398 399
	show_mem();
	if (sysctl_oom_dump_tasks)
400
		dump_tasks(mem, nodemask);
401 402
}

403
#define K(x) ((x) << (PAGE_SHIFT-10))
404
static int oom_kill_task(struct task_struct *p, struct mem_cgroup *mem)
L
Linus Torvalds 已提交
405
{
406
	p = find_lock_task_mm(p);
407
	if (!p)
408
		return 1;
409

410 411 412 413
	pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
		task_pid_nr(p), p->comm, K(p->mm->total_vm),
		K(get_mm_counter(p->mm, MM_ANONPAGES)),
		K(get_mm_counter(p->mm, MM_FILEPAGES)));
414
	task_unlock(p);
L
Linus Torvalds 已提交
415

416

L
Linus Torvalds 已提交
417 418
	set_tsk_thread_flag(p, TIF_MEMDIE);
	force_sig(SIGKILL, p);
419 420 421 422 423 424 425 426

	/*
	 * We give our sacrificial lamb high priority and access to
	 * all the memory it needs. That way it should be able to
	 * exit() and clear out its resources quickly...
	 */
	boost_dying_task_prio(p, mem);

427
	return 0;
L
Linus Torvalds 已提交
428
}
429
#undef K
L
Linus Torvalds 已提交
430

431
static int oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order,
D
David Rientjes 已提交
432 433 434
			    unsigned int points, unsigned long totalpages,
			    struct mem_cgroup *mem, nodemask_t *nodemask,
			    const char *message)
L
Linus Torvalds 已提交
435
{
436 437
	struct task_struct *victim = p;
	struct task_struct *child;
438
	struct task_struct *t = p;
D
David Rientjes 已提交
439
	unsigned int victim_points = 0;
L
Linus Torvalds 已提交
440

441
	if (printk_ratelimit())
442
		dump_header(p, gfp_mask, order, mem, nodemask);
443

444 445 446 447
	/*
	 * 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
	 */
448
	if (p->flags & PF_EXITING) {
449
		set_tsk_thread_flag(p, TIF_MEMDIE);
450
		boost_dying_task_prio(p, mem);
451 452 453
		return 0;
	}

454
	task_lock(p);
D
David Rientjes 已提交
455
	pr_err("%s: Kill process %d (%s) score %d or sacrifice child\n",
456 457
		message, task_pid_nr(p), p->comm, points);
	task_unlock(p);
N
Nick Piggin 已提交
458

459 460 461 462 463 464
	/*
	 * If any of p's children has a different mm and is eligible for kill,
	 * the one with the highest badness() score is sacrificed for its
	 * parent.  This attempts to lose the minimal amount of work done while
	 * still freeing memory.
	 */
465
	do {
466
		list_for_each_entry(child, &t->children, sibling) {
D
David Rientjes 已提交
467
			unsigned int child_points;
468

D
David Rientjes 已提交
469 470 471 472 473
			/*
			 * oom_badness() returns 0 if the thread is unkillable
			 */
			child_points = oom_badness(child, mem, nodemask,
								totalpages);
474 475 476 477
			if (child_points > victim_points) {
				victim = child;
				victim_points = child_points;
			}
478 479 480
		}
	} while_each_thread(p, t);

481
	return oom_kill_task(victim, mem);
L
Linus Torvalds 已提交
482 483
}

484 485 486 487
/*
 * Determines whether the kernel must panic because of the panic_on_oom sysctl.
 */
static void check_panic_on_oom(enum oom_constraint constraint, gfp_t gfp_mask,
488
				int order, const nodemask_t *nodemask)
489 490 491 492 493 494 495 496 497 498 499 500 501
{
	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;
	}
	read_lock(&tasklist_lock);
502
	dump_header(NULL, gfp_mask, order, NULL, nodemask);
503 504 505 506 507
	read_unlock(&tasklist_lock);
	panic("Out of memory: %s panic_on_oom is enabled\n",
		sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
}

508
#ifdef CONFIG_CGROUP_MEM_RES_CTLR
509 510
void mem_cgroup_out_of_memory(struct mem_cgroup *mem, gfp_t gfp_mask)
{
D
David Rientjes 已提交
511 512
	unsigned long limit;
	unsigned int points = 0;
513 514
	struct task_struct *p;

515
	check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, 0, NULL);
D
David Rientjes 已提交
516
	limit = mem_cgroup_get_limit(mem) >> PAGE_SHIFT;
L
Li Zefan 已提交
517
	read_lock(&tasklist_lock);
518
retry:
D
David Rientjes 已提交
519
	p = select_bad_process(&points, limit, mem, NULL);
520
	if (!p || PTR_ERR(p) == -1UL)
521 522
		goto out;

D
David Rientjes 已提交
523
	if (oom_kill_process(p, gfp_mask, 0, points, limit, mem, NULL,
524 525 526
				"Memory cgroup out of memory"))
		goto retry;
out:
L
Li Zefan 已提交
527
	read_unlock(&tasklist_lock);
528 529 530
}
#endif

531 532 533 534 535 536 537 538 539 540 541 542 543 544
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);

D
David Rientjes 已提交
545 546 547 548 549
/*
 * Try to acquire the OOM killer lock for the zones in zonelist.  Returns zero
 * if a parallel OOM killing is already taking place that includes a zone in
 * the zonelist.  Otherwise, locks all zones in the zonelist and returns 1.
 */
550
int try_set_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
D
David Rientjes 已提交
551
{
552 553
	struct zoneref *z;
	struct zone *zone;
D
David Rientjes 已提交
554 555
	int ret = 1;

D
David Rientjes 已提交
556
	spin_lock(&zone_scan_lock);
557 558
	for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
		if (zone_is_oom_locked(zone)) {
D
David Rientjes 已提交
559 560 561
			ret = 0;
			goto out;
		}
562 563 564 565
	}

	for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
		/*
D
David Rientjes 已提交
566
		 * Lock each zone in the zonelist under zone_scan_lock so a
567
		 * parallel invocation of try_set_zonelist_oom() doesn't succeed
568 569 570 571
		 * when it shouldn't.
		 */
		zone_set_flag(zone, ZONE_OOM_LOCKED);
	}
D
David Rientjes 已提交
572 573

out:
D
David Rientjes 已提交
574
	spin_unlock(&zone_scan_lock);
D
David Rientjes 已提交
575 576 577 578 579 580 581 582
	return ret;
}

/*
 * Clears the ZONE_OOM_LOCKED flag for all zones in the zonelist so that failed
 * allocation attempts with zonelists containing them may now recall the OOM
 * killer, if necessary.
 */
583
void clear_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
D
David Rientjes 已提交
584
{
585 586
	struct zoneref *z;
	struct zone *zone;
D
David Rientjes 已提交
587

D
David Rientjes 已提交
588
	spin_lock(&zone_scan_lock);
589 590 591
	for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
		zone_clear_flag(zone, ZONE_OOM_LOCKED);
	}
D
David Rientjes 已提交
592
	spin_unlock(&zone_scan_lock);
D
David Rientjes 已提交
593 594
}

595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631
/*
 * Try to acquire the oom killer lock for all system zones.  Returns zero if a
 * parallel oom killing is taking place, otherwise locks all zones and returns
 * non-zero.
 */
static int try_set_system_oom(void)
{
	struct zone *zone;
	int ret = 1;

	spin_lock(&zone_scan_lock);
	for_each_populated_zone(zone)
		if (zone_is_oom_locked(zone)) {
			ret = 0;
			goto out;
		}
	for_each_populated_zone(zone)
		zone_set_flag(zone, ZONE_OOM_LOCKED);
out:
	spin_unlock(&zone_scan_lock);
	return ret;
}

/*
 * Clears ZONE_OOM_LOCKED for all system zones so that failed allocation
 * attempts or page faults may now recall the oom killer, if necessary.
 */
static void clear_system_oom(void)
{
	struct zone *zone;

	spin_lock(&zone_scan_lock);
	for_each_populated_zone(zone)
		zone_clear_flag(zone, ZONE_OOM_LOCKED);
	spin_unlock(&zone_scan_lock);
}

L
Linus Torvalds 已提交
632
/**
633
 * out_of_memory - kill the "best" process when we run out of memory
R
Randy Dunlap 已提交
634 635 636
 * @zonelist: zonelist pointer
 * @gfp_mask: memory allocation flags
 * @order: amount of memory being requested as a power of 2
637
 * @nodemask: nodemask passed to page allocator
L
Linus Torvalds 已提交
638 639 640 641 642 643
 *
 * 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.
 */
644 645
void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask,
		int order, nodemask_t *nodemask)
L
Linus Torvalds 已提交
646
{
647
	const nodemask_t *mpol_mask;
648
	struct task_struct *p;
D
David Rientjes 已提交
649
	unsigned long totalpages;
650
	unsigned long freed = 0;
D
David Rientjes 已提交
651
	unsigned int points;
652
	enum oom_constraint constraint = CONSTRAINT_NONE;
K
KOSAKI Motohiro 已提交
653
	int killed = 0;
654 655 656 657 658

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

660 661 662 663 664 665 666
	/*
	 * If current has a pending SIGKILL, then automatically select it.  The
	 * goal is to allow it to allocate so that it may quickly exit and free
	 * its memory.
	 */
	if (fatal_signal_pending(current)) {
		set_thread_flag(TIF_MEMDIE);
667
		boost_dying_task_prio(current, NULL);
668 669 670
		return;
	}

671 672 673 674
	/*
	 * Check if there were limitations on the allocation (only relevant for
	 * NUMA) that may require different handling.
	 */
D
David Rientjes 已提交
675 676
	constraint = constrained_alloc(zonelist, gfp_mask, nodemask,
						&totalpages);
677 678
	mpol_mask = (constraint == CONSTRAINT_MEMORY_POLICY) ? nodemask : NULL;
	check_panic_on_oom(constraint, gfp_mask, order, mpol_mask);
679

D
David Rientjes 已提交
680
	read_lock(&tasklist_lock);
681
	if (sysctl_oom_kill_allocating_task &&
682 683
	    !oom_unkillable_task(current, NULL, nodemask) &&
	    (current->signal->oom_adj != OOM_DISABLE)) {
684 685 686 687 688
		/*
		 * oom_kill_process() needs tasklist_lock held.  If it returns
		 * non-zero, current could not be killed so we must fallback to
		 * the tasklist scan.
		 */
D
David Rientjes 已提交
689 690
		if (!oom_kill_process(current, gfp_mask, order, 0, totalpages,
				NULL, nodemask,
691
				"Out of memory (oom_kill_allocating_task)"))
K
KOSAKI Motohiro 已提交
692
			goto out;
693 694 695
	}

retry:
696
	p = select_bad_process(&points, totalpages, NULL, mpol_mask);
697
	if (PTR_ERR(p) == -1UL)
K
KOSAKI Motohiro 已提交
698
		goto out;
699 700 701

	/* Found nothing?!?! Either we hang forever, or we panic. */
	if (!p) {
702
		dump_header(NULL, gfp_mask, order, NULL, mpol_mask);
703 704 705 706
		read_unlock(&tasklist_lock);
		panic("Out of memory and no killable processes...\n");
	}

D
David Rientjes 已提交
707 708
	if (oom_kill_process(p, gfp_mask, order, points, totalpages, NULL,
				nodemask, "Out of memory"))
709
		goto retry;
K
KOSAKI Motohiro 已提交
710 711
	killed = 1;
out:
712
	read_unlock(&tasklist_lock);
L
Linus Torvalds 已提交
713 714 715

	/*
	 * Give "p" a good chance of killing itself before we
716
	 * retry to allocate memory unless "p" is current
L
Linus Torvalds 已提交
717
	 */
K
KOSAKI Motohiro 已提交
718
	if (killed && !test_thread_flag(TIF_MEMDIE))
719
		schedule_timeout_uninterruptible(1);
L
Linus Torvalds 已提交
720
}
721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736

/*
 * The pagefault handler calls here because it is out of memory, so kill a
 * memory-hogging task.  If a populated zone has ZONE_OOM_LOCKED set, a parallel
 * oom killing is already in progress so do nothing.  If a task is found with
 * TIF_MEMDIE set, it has been killed so do nothing and allow it to exit.
 */
void pagefault_out_of_memory(void)
{
	if (try_set_system_oom()) {
		out_of_memory(NULL, 0, 0, NULL);
		clear_system_oom();
	}
	if (!test_thread_flag(TIF_MEMDIE))
		schedule_timeout_uninterruptible(1);
}