oom_kill.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800
  1. /*
  2. * linux/mm/oom_kill.c
  3. *
  4. * Copyright (C) 1998,2000 Rik van Riel
  5. * Thanks go out to Claus Fischer for some serious inspiration and
  6. * for goading me into coding this file...
  7. * Copyright (C) 2010 Google, Inc.
  8. * Rewritten by David Rientjes
  9. *
  10. * The routines in this file are used to kill a process when
  11. * we're seriously out of memory. This gets called from __alloc_pages()
  12. * in mm/page_alloc.c when we really run out of memory.
  13. *
  14. * Since we won't call these routines often (on a well-configured
  15. * machine) this file will double as a 'coding guide' and a signpost
  16. * for newbie kernel hackers. It features several pointers to major
  17. * kernel subsystems and hints as to where to find out what things do.
  18. */
  19. #include <linux/oom.h>
  20. #include <linux/mm.h>
  21. #include <linux/err.h>
  22. #include <linux/gfp.h>
  23. #include <linux/sched.h>
  24. #include <linux/swap.h>
  25. #include <linux/timex.h>
  26. #include <linux/jiffies.h>
  27. #include <linux/cpuset.h>
  28. #include <linux/export.h>
  29. #include <linux/notifier.h>
  30. #include <linux/memcontrol.h>
  31. #include <linux/mempolicy.h>
  32. #include <linux/security.h>
  33. #include <linux/ptrace.h>
  34. #include <linux/freezer.h>
  35. #include <linux/ftrace.h>
  36. #define CREATE_TRACE_POINTS
  37. #include <trace/events/oom.h>
  38. int sysctl_panic_on_oom;
  39. int sysctl_oom_kill_allocating_task;
  40. int sysctl_oom_dump_tasks = 1;
  41. static DEFINE_SPINLOCK(zone_scan_lock);
  42. /*
  43. * compare_swap_oom_score_adj() - compare and swap current's oom_score_adj
  44. * @old_val: old oom_score_adj for compare
  45. * @new_val: new oom_score_adj for swap
  46. *
  47. * Sets the oom_score_adj value for current to @new_val iff its present value is
  48. * @old_val. Usually used to reinstate a previous value to prevent racing with
  49. * userspacing tuning the value in the interim.
  50. */
  51. void compare_swap_oom_score_adj(int old_val, int new_val)
  52. {
  53. struct sighand_struct *sighand = current->sighand;
  54. spin_lock_irq(&sighand->siglock);
  55. if (current->signal->oom_score_adj == old_val)
  56. current->signal->oom_score_adj = new_val;
  57. trace_oom_score_adj_update(current);
  58. spin_unlock_irq(&sighand->siglock);
  59. }
  60. /**
  61. * test_set_oom_score_adj() - set current's oom_score_adj and return old value
  62. * @new_val: new oom_score_adj value
  63. *
  64. * Sets the oom_score_adj value for current to @new_val with proper
  65. * synchronization and returns the old value. Usually used to temporarily
  66. * set a value, save the old value in the caller, and then reinstate it later.
  67. */
  68. int test_set_oom_score_adj(int new_val)
  69. {
  70. struct sighand_struct *sighand = current->sighand;
  71. int old_val;
  72. spin_lock_irq(&sighand->siglock);
  73. old_val = current->signal->oom_score_adj;
  74. current->signal->oom_score_adj = new_val;
  75. trace_oom_score_adj_update(current);
  76. spin_unlock_irq(&sighand->siglock);
  77. return old_val;
  78. }
  79. #ifdef CONFIG_NUMA
  80. /**
  81. * has_intersects_mems_allowed() - check task eligiblity for kill
  82. * @tsk: task struct of which task to consider
  83. * @mask: nodemask passed to page allocator for mempolicy ooms
  84. *
  85. * Task eligibility is determined by whether or not a candidate task, @tsk,
  86. * shares the same mempolicy nodes as current if it is bound by such a policy
  87. * and whether or not it has the same set of allowed cpuset nodes.
  88. */
  89. static bool has_intersects_mems_allowed(struct task_struct *tsk,
  90. const nodemask_t *mask)
  91. {
  92. struct task_struct *start = tsk;
  93. do {
  94. if (mask) {
  95. /*
  96. * If this is a mempolicy constrained oom, tsk's
  97. * cpuset is irrelevant. Only return true if its
  98. * mempolicy intersects current, otherwise it may be
  99. * needlessly killed.
  100. */
  101. if (mempolicy_nodemask_intersects(tsk, mask))
  102. return true;
  103. } else {
  104. /*
  105. * This is not a mempolicy constrained oom, so only
  106. * check the mems of tsk's cpuset.
  107. */
  108. if (cpuset_mems_allowed_intersects(current, tsk))
  109. return true;
  110. }
  111. } while_each_thread(start, tsk);
  112. return false;
  113. }
  114. #else
  115. static bool has_intersects_mems_allowed(struct task_struct *tsk,
  116. const nodemask_t *mask)
  117. {
  118. return true;
  119. }
  120. #endif /* CONFIG_NUMA */
  121. /*
  122. * The process p may have detached its own ->mm while exiting or through
  123. * use_mm(), but one or more of its subthreads may still have a valid
  124. * pointer. Return p, or any of its subthreads with a valid ->mm, with
  125. * task_lock() held.
  126. */
  127. struct task_struct *find_lock_task_mm(struct task_struct *p)
  128. {
  129. struct task_struct *t = p;
  130. do {
  131. task_lock(t);
  132. if (likely(t->mm))
  133. return t;
  134. task_unlock(t);
  135. } while_each_thread(p, t);
  136. return NULL;
  137. }
  138. /* return true if the task is not adequate as candidate victim task. */
  139. static bool oom_unkillable_task(struct task_struct *p,
  140. const struct mem_cgroup *memcg, const nodemask_t *nodemask)
  141. {
  142. if (is_global_init(p))
  143. return true;
  144. if (p->flags & PF_KTHREAD)
  145. return true;
  146. /* When mem_cgroup_out_of_memory() and p is not member of the group */
  147. if (memcg && !task_in_mem_cgroup(p, memcg))
  148. return true;
  149. /* p may not have freeable memory in nodemask */
  150. if (!has_intersects_mems_allowed(p, nodemask))
  151. return true;
  152. return false;
  153. }
  154. /**
  155. * oom_badness - heuristic function to determine which candidate task to kill
  156. * @p: task struct of which task we should calculate
  157. * @totalpages: total present RAM allowed for page allocation
  158. *
  159. * The heuristic for determining which task to kill is made to be as simple and
  160. * predictable as possible. The goal is to return the highest value for the
  161. * task consuming the most memory to avoid subsequent oom failures.
  162. */
  163. unsigned int oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
  164. const nodemask_t *nodemask, unsigned long totalpages)
  165. {
  166. long points;
  167. if (oom_unkillable_task(p, memcg, nodemask))
  168. return 0;
  169. p = find_lock_task_mm(p);
  170. if (!p)
  171. return 0;
  172. if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN) {
  173. task_unlock(p);
  174. return 0;
  175. }
  176. /*
  177. * The memory controller may have a limit of 0 bytes, so avoid a divide
  178. * by zero, if necessary.
  179. */
  180. if (!totalpages)
  181. totalpages = 1;
  182. /*
  183. * The baseline for the badness score is the proportion of RAM that each
  184. * task's rss, pagetable and swap space use.
  185. */
  186. points = get_mm_rss(p->mm) + p->mm->nr_ptes;
  187. points += get_mm_counter(p->mm, MM_SWAPENTS);
  188. points *= 1000;
  189. points /= totalpages;
  190. task_unlock(p);
  191. /*
  192. * Root processes get 3% bonus, just like the __vm_enough_memory()
  193. * implementation used by LSMs.
  194. */
  195. if (has_capability_noaudit(p, CAP_SYS_ADMIN))
  196. points -= 30;
  197. /*
  198. * /proc/pid/oom_score_adj ranges from -1000 to +1000 such that it may
  199. * either completely disable oom killing or always prefer a certain
  200. * task.
  201. */
  202. points += p->signal->oom_score_adj;
  203. /*
  204. * Never return 0 for an eligible task that may be killed since it's
  205. * possible that no single user task uses more than 0.1% of memory and
  206. * no single admin tasks uses more than 3.0%.
  207. */
  208. if (points <= 0)
  209. return 1;
  210. return (points < 1000) ? points : 1000;
  211. }
  212. /*
  213. * Determine the type of allocation constraint.
  214. */
  215. #ifdef CONFIG_NUMA
  216. static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
  217. gfp_t gfp_mask, nodemask_t *nodemask,
  218. unsigned long *totalpages)
  219. {
  220. struct zone *zone;
  221. struct zoneref *z;
  222. enum zone_type high_zoneidx = gfp_zone(gfp_mask);
  223. bool cpuset_limited = false;
  224. int nid;
  225. /* Default to all available memory */
  226. *totalpages = totalram_pages + total_swap_pages;
  227. if (!zonelist)
  228. return CONSTRAINT_NONE;
  229. /*
  230. * Reach here only when __GFP_NOFAIL is used. So, we should avoid
  231. * to kill current.We have to random task kill in this case.
  232. * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
  233. */
  234. if (gfp_mask & __GFP_THISNODE)
  235. return CONSTRAINT_NONE;
  236. /*
  237. * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
  238. * the page allocator means a mempolicy is in effect. Cpuset policy
  239. * is enforced in get_page_from_freelist().
  240. */
  241. if (nodemask && !nodes_subset(node_states[N_HIGH_MEMORY], *nodemask)) {
  242. *totalpages = total_swap_pages;
  243. for_each_node_mask(nid, *nodemask)
  244. *totalpages += node_spanned_pages(nid);
  245. return CONSTRAINT_MEMORY_POLICY;
  246. }
  247. /* Check this allocation failure is caused by cpuset's wall function */
  248. for_each_zone_zonelist_nodemask(zone, z, zonelist,
  249. high_zoneidx, nodemask)
  250. if (!cpuset_zone_allowed_softwall(zone, gfp_mask))
  251. cpuset_limited = true;
  252. if (cpuset_limited) {
  253. *totalpages = total_swap_pages;
  254. for_each_node_mask(nid, cpuset_current_mems_allowed)
  255. *totalpages += node_spanned_pages(nid);
  256. return CONSTRAINT_CPUSET;
  257. }
  258. return CONSTRAINT_NONE;
  259. }
  260. #else
  261. static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
  262. gfp_t gfp_mask, nodemask_t *nodemask,
  263. unsigned long *totalpages)
  264. {
  265. *totalpages = totalram_pages + total_swap_pages;
  266. return CONSTRAINT_NONE;
  267. }
  268. #endif
  269. /*
  270. * Simple selection loop. We chose the process with the highest
  271. * number of 'points'. We expect the caller will lock the tasklist.
  272. *
  273. * (not docbooked, we don't want this one cluttering up the manual)
  274. */
  275. static struct task_struct *select_bad_process(unsigned int *ppoints,
  276. unsigned long totalpages, struct mem_cgroup *memcg,
  277. const nodemask_t *nodemask)
  278. {
  279. struct task_struct *g, *p;
  280. struct task_struct *chosen = NULL;
  281. *ppoints = 0;
  282. do_each_thread(g, p) {
  283. unsigned int points;
  284. if (p->exit_state)
  285. continue;
  286. if (oom_unkillable_task(p, memcg, nodemask))
  287. continue;
  288. /*
  289. * This task already has access to memory reserves and is
  290. * being killed. Don't allow any other task access to the
  291. * memory reserve.
  292. *
  293. * Note: this may have a chance of deadlock if it gets
  294. * blocked waiting for another task which itself is waiting
  295. * for memory. Is there a better alternative?
  296. */
  297. if (test_tsk_thread_flag(p, TIF_MEMDIE)) {
  298. if (unlikely(frozen(p)))
  299. __thaw_task(p);
  300. return ERR_PTR(-1UL);
  301. }
  302. if (!p->mm)
  303. continue;
  304. if (p->flags & PF_EXITING) {
  305. /*
  306. * If p is the current task and is in the process of
  307. * releasing memory, we allow the "kill" to set
  308. * TIF_MEMDIE, which will allow it to gain access to
  309. * memory reserves. Otherwise, it may stall forever.
  310. *
  311. * The loop isn't broken here, however, in case other
  312. * threads are found to have already been oom killed.
  313. */
  314. if (p == current) {
  315. chosen = p;
  316. *ppoints = 1000;
  317. } else {
  318. /*
  319. * If this task is not being ptraced on exit,
  320. * then wait for it to finish before killing
  321. * some other task unnecessarily.
  322. */
  323. if (!(p->group_leader->ptrace & PT_TRACE_EXIT))
  324. return ERR_PTR(-1UL);
  325. }
  326. }
  327. points = oom_badness(p, memcg, nodemask, totalpages);
  328. if (points > *ppoints) {
  329. chosen = p;
  330. *ppoints = points;
  331. }
  332. } while_each_thread(g, p);
  333. return chosen;
  334. }
  335. /**
  336. * dump_tasks - dump current memory state of all system tasks
  337. * @mem: current's memory controller, if constrained
  338. * @nodemask: nodemask passed to page allocator for mempolicy ooms
  339. *
  340. * Dumps the current memory state of all eligible tasks. Tasks not in the same
  341. * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
  342. * are not shown.
  343. * State information includes task's pid, uid, tgid, vm size, rss, cpu, oom_adj
  344. * value, oom_score_adj value, and name.
  345. *
  346. * Call with tasklist_lock read-locked.
  347. */
  348. static void dump_tasks(const struct mem_cgroup *memcg, const nodemask_t *nodemask)
  349. {
  350. struct task_struct *p;
  351. struct task_struct *task;
  352. pr_info("[ pid ] uid tgid total_vm rss cpu oom_adj oom_score_adj name\n");
  353. for_each_process(p) {
  354. if (oom_unkillable_task(p, memcg, nodemask))
  355. continue;
  356. task = find_lock_task_mm(p);
  357. if (!task) {
  358. /*
  359. * This is a kthread or all of p's threads have already
  360. * detached their mm's. There's no need to report
  361. * them; they can't be oom killed anyway.
  362. */
  363. continue;
  364. }
  365. pr_info("[%5d] %5d %5d %8lu %8lu %3u %3d %5d %s\n",
  366. task->pid, task_uid(task), task->tgid,
  367. task->mm->total_vm, get_mm_rss(task->mm),
  368. task_cpu(task), task->signal->oom_adj,
  369. task->signal->oom_score_adj, task->comm);
  370. task_unlock(task);
  371. }
  372. }
  373. static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order,
  374. struct mem_cgroup *memcg, const nodemask_t *nodemask)
  375. {
  376. task_lock(current);
  377. pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
  378. "oom_adj=%d, oom_score_adj=%d\n",
  379. current->comm, gfp_mask, order, current->signal->oom_adj,
  380. current->signal->oom_score_adj);
  381. cpuset_print_task_mems_allowed(current);
  382. task_unlock(current);
  383. dump_stack();
  384. mem_cgroup_print_oom_info(memcg, p);
  385. show_mem(SHOW_MEM_FILTER_NODES);
  386. if (sysctl_oom_dump_tasks)
  387. dump_tasks(memcg, nodemask);
  388. }
  389. #define K(x) ((x) << (PAGE_SHIFT-10))
  390. static int oom_kill_task(struct task_struct *p)
  391. {
  392. struct task_struct *q;
  393. struct mm_struct *mm;
  394. p = find_lock_task_mm(p);
  395. if (!p)
  396. return 1;
  397. /* mm cannot be safely dereferenced after task_unlock(p) */
  398. mm = p->mm;
  399. pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
  400. task_pid_nr(p), p->comm, K(p->mm->total_vm),
  401. K(get_mm_counter(p->mm, MM_ANONPAGES)),
  402. K(get_mm_counter(p->mm, MM_FILEPAGES)));
  403. task_unlock(p);
  404. /*
  405. * Kill all user processes sharing p->mm in other thread groups, if any.
  406. * They don't get access to memory reserves or a higher scheduler
  407. * priority, though, to avoid depletion of all memory or task
  408. * starvation. This prevents mm->mmap_sem livelock when an oom killed
  409. * task cannot exit because it requires the semaphore and its contended
  410. * by another thread trying to allocate memory itself. That thread will
  411. * now get access to memory reserves since it has a pending fatal
  412. * signal.
  413. */
  414. for_each_process(q)
  415. if (q->mm == mm && !same_thread_group(q, p) &&
  416. !(q->flags & PF_KTHREAD)) {
  417. if (q->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
  418. continue;
  419. task_lock(q); /* Protect ->comm from prctl() */
  420. pr_err("Kill process %d (%s) sharing same memory\n",
  421. task_pid_nr(q), q->comm);
  422. task_unlock(q);
  423. force_sig(SIGKILL, q);
  424. }
  425. set_tsk_thread_flag(p, TIF_MEMDIE);
  426. force_sig(SIGKILL, p);
  427. return 0;
  428. }
  429. #undef K
  430. static int oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order,
  431. unsigned int points, unsigned long totalpages,
  432. struct mem_cgroup *memcg, nodemask_t *nodemask,
  433. const char *message)
  434. {
  435. struct task_struct *victim = p;
  436. struct task_struct *child;
  437. struct task_struct *t = p;
  438. unsigned int victim_points = 0;
  439. if (printk_ratelimit())
  440. dump_header(p, gfp_mask, order, memcg, nodemask);
  441. /*
  442. * If the task is already exiting, don't alarm the sysadmin or kill
  443. * its children or threads, just set TIF_MEMDIE so it can die quickly
  444. */
  445. if (p->flags & PF_EXITING) {
  446. set_tsk_thread_flag(p, TIF_MEMDIE);
  447. return 0;
  448. }
  449. task_lock(p);
  450. pr_err("%s: Kill process %d (%s) score %d or sacrifice child\n",
  451. message, task_pid_nr(p), p->comm, points);
  452. task_unlock(p);
  453. /*
  454. * If any of p's children has a different mm and is eligible for kill,
  455. * the one with the highest oom_badness() score is sacrificed for its
  456. * parent. This attempts to lose the minimal amount of work done while
  457. * still freeing memory.
  458. */
  459. do {
  460. list_for_each_entry(child, &t->children, sibling) {
  461. unsigned int child_points;
  462. if (child->mm == p->mm)
  463. continue;
  464. /*
  465. * oom_badness() returns 0 if the thread is unkillable
  466. */
  467. child_points = oom_badness(child, memcg, nodemask,
  468. totalpages);
  469. if (child_points > victim_points) {
  470. victim = child;
  471. victim_points = child_points;
  472. }
  473. }
  474. } while_each_thread(p, t);
  475. return oom_kill_task(victim);
  476. }
  477. /*
  478. * Determines whether the kernel must panic because of the panic_on_oom sysctl.
  479. */
  480. static void check_panic_on_oom(enum oom_constraint constraint, gfp_t gfp_mask,
  481. int order, const nodemask_t *nodemask)
  482. {
  483. if (likely(!sysctl_panic_on_oom))
  484. return;
  485. if (sysctl_panic_on_oom != 2) {
  486. /*
  487. * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
  488. * does not panic for cpuset, mempolicy, or memcg allocation
  489. * failures.
  490. */
  491. if (constraint != CONSTRAINT_NONE)
  492. return;
  493. }
  494. read_lock(&tasklist_lock);
  495. dump_header(NULL, gfp_mask, order, NULL, nodemask);
  496. read_unlock(&tasklist_lock);
  497. panic("Out of memory: %s panic_on_oom is enabled\n",
  498. sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
  499. }
  500. #ifdef CONFIG_CGROUP_MEM_RES_CTLR
  501. void mem_cgroup_out_of_memory(struct mem_cgroup *memcg, gfp_t gfp_mask)
  502. {
  503. unsigned long limit;
  504. unsigned int points = 0;
  505. struct task_struct *p;
  506. /*
  507. * If current has a pending SIGKILL, then automatically select it. The
  508. * goal is to allow it to allocate so that it may quickly exit and free
  509. * its memory.
  510. */
  511. if (fatal_signal_pending(current)) {
  512. set_thread_flag(TIF_MEMDIE);
  513. return;
  514. }
  515. check_panic_on_oom(CONSTRAINT_MEMCG, gfp_mask, 0, NULL);
  516. limit = mem_cgroup_get_limit(memcg) >> PAGE_SHIFT;
  517. read_lock(&tasklist_lock);
  518. retry:
  519. p = select_bad_process(&points, limit, memcg, NULL);
  520. if (!p || PTR_ERR(p) == -1UL)
  521. goto out;
  522. if (oom_kill_process(p, gfp_mask, 0, points, limit, memcg, NULL,
  523. "Memory cgroup out of memory"))
  524. goto retry;
  525. out:
  526. read_unlock(&tasklist_lock);
  527. }
  528. #endif
  529. static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
  530. int register_oom_notifier(struct notifier_block *nb)
  531. {
  532. return blocking_notifier_chain_register(&oom_notify_list, nb);
  533. }
  534. EXPORT_SYMBOL_GPL(register_oom_notifier);
  535. int unregister_oom_notifier(struct notifier_block *nb)
  536. {
  537. return blocking_notifier_chain_unregister(&oom_notify_list, nb);
  538. }
  539. EXPORT_SYMBOL_GPL(unregister_oom_notifier);
  540. /*
  541. * Try to acquire the OOM killer lock for the zones in zonelist. Returns zero
  542. * if a parallel OOM killing is already taking place that includes a zone in
  543. * the zonelist. Otherwise, locks all zones in the zonelist and returns 1.
  544. */
  545. int try_set_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
  546. {
  547. struct zoneref *z;
  548. struct zone *zone;
  549. int ret = 1;
  550. spin_lock(&zone_scan_lock);
  551. for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
  552. if (zone_is_oom_locked(zone)) {
  553. ret = 0;
  554. goto out;
  555. }
  556. }
  557. for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
  558. /*
  559. * Lock each zone in the zonelist under zone_scan_lock so a
  560. * parallel invocation of try_set_zonelist_oom() doesn't succeed
  561. * when it shouldn't.
  562. */
  563. zone_set_flag(zone, ZONE_OOM_LOCKED);
  564. }
  565. out:
  566. spin_unlock(&zone_scan_lock);
  567. return ret;
  568. }
  569. /*
  570. * Clears the ZONE_OOM_LOCKED flag for all zones in the zonelist so that failed
  571. * allocation attempts with zonelists containing them may now recall the OOM
  572. * killer, if necessary.
  573. */
  574. void clear_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
  575. {
  576. struct zoneref *z;
  577. struct zone *zone;
  578. spin_lock(&zone_scan_lock);
  579. for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
  580. zone_clear_flag(zone, ZONE_OOM_LOCKED);
  581. }
  582. spin_unlock(&zone_scan_lock);
  583. }
  584. /*
  585. * Try to acquire the oom killer lock for all system zones. Returns zero if a
  586. * parallel oom killing is taking place, otherwise locks all zones and returns
  587. * non-zero.
  588. */
  589. static int try_set_system_oom(void)
  590. {
  591. struct zone *zone;
  592. int ret = 1;
  593. spin_lock(&zone_scan_lock);
  594. for_each_populated_zone(zone)
  595. if (zone_is_oom_locked(zone)) {
  596. ret = 0;
  597. goto out;
  598. }
  599. for_each_populated_zone(zone)
  600. zone_set_flag(zone, ZONE_OOM_LOCKED);
  601. out:
  602. spin_unlock(&zone_scan_lock);
  603. return ret;
  604. }
  605. /*
  606. * Clears ZONE_OOM_LOCKED for all system zones so that failed allocation
  607. * attempts or page faults may now recall the oom killer, if necessary.
  608. */
  609. static void clear_system_oom(void)
  610. {
  611. struct zone *zone;
  612. spin_lock(&zone_scan_lock);
  613. for_each_populated_zone(zone)
  614. zone_clear_flag(zone, ZONE_OOM_LOCKED);
  615. spin_unlock(&zone_scan_lock);
  616. }
  617. /**
  618. * out_of_memory - kill the "best" process when we run out of memory
  619. * @zonelist: zonelist pointer
  620. * @gfp_mask: memory allocation flags
  621. * @order: amount of memory being requested as a power of 2
  622. * @nodemask: nodemask passed to page allocator
  623. *
  624. * If we run out of memory, we have the choice between either
  625. * killing a random task (bad), letting the system crash (worse)
  626. * OR try to be smart about which process to kill. Note that we
  627. * don't have to be perfect here, we just have to be good.
  628. */
  629. void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask,
  630. int order, nodemask_t *nodemask)
  631. {
  632. const nodemask_t *mpol_mask;
  633. struct task_struct *p;
  634. unsigned long totalpages;
  635. unsigned long freed = 0;
  636. unsigned int points;
  637. enum oom_constraint constraint = CONSTRAINT_NONE;
  638. int killed = 0;
  639. blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
  640. if (freed > 0)
  641. /* Got some memory back in the last second. */
  642. return;
  643. /*
  644. * If current has a pending SIGKILL, then automatically select it. The
  645. * goal is to allow it to allocate so that it may quickly exit and free
  646. * its memory.
  647. */
  648. if (fatal_signal_pending(current)) {
  649. set_thread_flag(TIF_MEMDIE);
  650. return;
  651. }
  652. /*
  653. * Check if there were limitations on the allocation (only relevant for
  654. * NUMA) that may require different handling.
  655. */
  656. constraint = constrained_alloc(zonelist, gfp_mask, nodemask,
  657. &totalpages);
  658. mpol_mask = (constraint == CONSTRAINT_MEMORY_POLICY) ? nodemask : NULL;
  659. check_panic_on_oom(constraint, gfp_mask, order, mpol_mask);
  660. read_lock(&tasklist_lock);
  661. if (sysctl_oom_kill_allocating_task &&
  662. !oom_unkillable_task(current, NULL, nodemask) &&
  663. current->mm) {
  664. /*
  665. * oom_kill_process() needs tasklist_lock held. If it returns
  666. * non-zero, current could not be killed so we must fallback to
  667. * the tasklist scan.
  668. */
  669. if (!oom_kill_process(current, gfp_mask, order, 0, totalpages,
  670. NULL, nodemask,
  671. "Out of memory (oom_kill_allocating_task)"))
  672. goto out;
  673. }
  674. retry:
  675. p = select_bad_process(&points, totalpages, NULL, mpol_mask);
  676. if (PTR_ERR(p) == -1UL)
  677. goto out;
  678. /* Found nothing?!?! Either we hang forever, or we panic. */
  679. if (!p) {
  680. dump_header(NULL, gfp_mask, order, NULL, mpol_mask);
  681. read_unlock(&tasklist_lock);
  682. panic("Out of memory and no killable processes...\n");
  683. }
  684. if (oom_kill_process(p, gfp_mask, order, points, totalpages, NULL,
  685. nodemask, "Out of memory"))
  686. goto retry;
  687. killed = 1;
  688. out:
  689. read_unlock(&tasklist_lock);
  690. /*
  691. * Give "p" a good chance of killing itself before we
  692. * retry to allocate memory unless "p" is current
  693. */
  694. if (killed && !test_thread_flag(TIF_MEMDIE))
  695. schedule_timeout_uninterruptible(1);
  696. }
  697. /*
  698. * The pagefault handler calls here because it is out of memory, so kill a
  699. * memory-hogging task. If a populated zone has ZONE_OOM_LOCKED set, a parallel
  700. * oom killing is already in progress so do nothing. If a task is found with
  701. * TIF_MEMDIE set, it has been killed so do nothing and allow it to exit.
  702. */
  703. void pagefault_out_of_memory(void)
  704. {
  705. if (try_set_system_oom()) {
  706. out_of_memory(NULL, 0, 0, NULL);
  707. clear_system_oom();
  708. }
  709. if (!test_thread_flag(TIF_MEMDIE))
  710. schedule_timeout_uninterruptible(1);
  711. }