oom_kill.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749
  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. #include <linux/ratelimit.h>
  37. #define CREATE_TRACE_POINTS
  38. #include <trace/events/oom.h>
  39. int sysctl_panic_on_oom;
  40. int sysctl_oom_kill_allocating_task;
  41. int sysctl_oom_dump_tasks = 1;
  42. DEFINE_MUTEX(oom_lock);
  43. #ifdef CONFIG_NUMA
  44. /**
  45. * has_intersects_mems_allowed() - check task eligiblity for kill
  46. * @start: task struct of which task to consider
  47. * @mask: nodemask passed to page allocator for mempolicy ooms
  48. *
  49. * Task eligibility is determined by whether or not a candidate task, @tsk,
  50. * shares the same mempolicy nodes as current if it is bound by such a policy
  51. * and whether or not it has the same set of allowed cpuset nodes.
  52. */
  53. static bool has_intersects_mems_allowed(struct task_struct *start,
  54. const nodemask_t *mask)
  55. {
  56. struct task_struct *tsk;
  57. bool ret = false;
  58. rcu_read_lock();
  59. for_each_thread(start, tsk) {
  60. if (mask) {
  61. /*
  62. * If this is a mempolicy constrained oom, tsk's
  63. * cpuset is irrelevant. Only return true if its
  64. * mempolicy intersects current, otherwise it may be
  65. * needlessly killed.
  66. */
  67. ret = mempolicy_nodemask_intersects(tsk, mask);
  68. } else {
  69. /*
  70. * This is not a mempolicy constrained oom, so only
  71. * check the mems of tsk's cpuset.
  72. */
  73. ret = cpuset_mems_allowed_intersects(current, tsk);
  74. }
  75. if (ret)
  76. break;
  77. }
  78. rcu_read_unlock();
  79. return ret;
  80. }
  81. #else
  82. static bool has_intersects_mems_allowed(struct task_struct *tsk,
  83. const nodemask_t *mask)
  84. {
  85. return true;
  86. }
  87. #endif /* CONFIG_NUMA */
  88. /*
  89. * The process p may have detached its own ->mm while exiting or through
  90. * use_mm(), but one or more of its subthreads may still have a valid
  91. * pointer. Return p, or any of its subthreads with a valid ->mm, with
  92. * task_lock() held.
  93. */
  94. struct task_struct *find_lock_task_mm(struct task_struct *p)
  95. {
  96. struct task_struct *t;
  97. rcu_read_lock();
  98. for_each_thread(p, t) {
  99. task_lock(t);
  100. if (likely(t->mm))
  101. goto found;
  102. task_unlock(t);
  103. }
  104. t = NULL;
  105. found:
  106. rcu_read_unlock();
  107. return t;
  108. }
  109. /* return true if the task is not adequate as candidate victim task. */
  110. static bool oom_unkillable_task(struct task_struct *p,
  111. struct mem_cgroup *memcg, const nodemask_t *nodemask)
  112. {
  113. if (is_global_init(p))
  114. return true;
  115. if (p->flags & PF_KTHREAD)
  116. return true;
  117. /* When mem_cgroup_out_of_memory() and p is not member of the group */
  118. if (memcg && !task_in_mem_cgroup(p, memcg))
  119. return true;
  120. /* p may not have freeable memory in nodemask */
  121. if (!has_intersects_mems_allowed(p, nodemask))
  122. return true;
  123. return false;
  124. }
  125. /**
  126. * oom_badness - heuristic function to determine which candidate task to kill
  127. * @p: task struct of which task we should calculate
  128. * @totalpages: total present RAM allowed for page allocation
  129. *
  130. * The heuristic for determining which task to kill is made to be as simple and
  131. * predictable as possible. The goal is to return the highest value for the
  132. * task consuming the most memory to avoid subsequent oom failures.
  133. */
  134. unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
  135. const nodemask_t *nodemask, unsigned long totalpages)
  136. {
  137. long points;
  138. long adj;
  139. if (oom_unkillable_task(p, memcg, nodemask))
  140. return 0;
  141. p = find_lock_task_mm(p);
  142. if (!p)
  143. return 0;
  144. adj = (long)p->signal->oom_score_adj;
  145. if (adj == OOM_SCORE_ADJ_MIN) {
  146. task_unlock(p);
  147. return 0;
  148. }
  149. /*
  150. * The baseline for the badness score is the proportion of RAM that each
  151. * task's rss, pagetable and swap space use.
  152. */
  153. points = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) +
  154. atomic_long_read(&p->mm->nr_ptes) + mm_nr_pmds(p->mm);
  155. task_unlock(p);
  156. /*
  157. * Root processes get 3% bonus, just like the __vm_enough_memory()
  158. * implementation used by LSMs.
  159. */
  160. if (has_capability_noaudit(p, CAP_SYS_ADMIN))
  161. points -= (points * 3) / 100;
  162. /* Normalize to oom_score_adj units */
  163. adj *= totalpages / 1000;
  164. points += adj;
  165. /*
  166. * Never return 0 for an eligible task regardless of the root bonus and
  167. * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).
  168. */
  169. return points > 0 ? points : 1;
  170. }
  171. /*
  172. * Determine the type of allocation constraint.
  173. */
  174. #ifdef CONFIG_NUMA
  175. static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
  176. gfp_t gfp_mask, nodemask_t *nodemask,
  177. unsigned long *totalpages)
  178. {
  179. struct zone *zone;
  180. struct zoneref *z;
  181. enum zone_type high_zoneidx = gfp_zone(gfp_mask);
  182. bool cpuset_limited = false;
  183. int nid;
  184. /* Default to all available memory */
  185. *totalpages = totalram_pages + total_swap_pages;
  186. if (!zonelist)
  187. return CONSTRAINT_NONE;
  188. /*
  189. * Reach here only when __GFP_NOFAIL is used. So, we should avoid
  190. * to kill current.We have to random task kill in this case.
  191. * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
  192. */
  193. if (gfp_mask & __GFP_THISNODE)
  194. return CONSTRAINT_NONE;
  195. /*
  196. * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
  197. * the page allocator means a mempolicy is in effect. Cpuset policy
  198. * is enforced in get_page_from_freelist().
  199. */
  200. if (nodemask && !nodes_subset(node_states[N_MEMORY], *nodemask)) {
  201. *totalpages = total_swap_pages;
  202. for_each_node_mask(nid, *nodemask)
  203. *totalpages += node_spanned_pages(nid);
  204. return CONSTRAINT_MEMORY_POLICY;
  205. }
  206. /* Check this allocation failure is caused by cpuset's wall function */
  207. for_each_zone_zonelist_nodemask(zone, z, zonelist,
  208. high_zoneidx, nodemask)
  209. if (!cpuset_zone_allowed(zone, gfp_mask))
  210. cpuset_limited = true;
  211. if (cpuset_limited) {
  212. *totalpages = total_swap_pages;
  213. for_each_node_mask(nid, cpuset_current_mems_allowed)
  214. *totalpages += node_spanned_pages(nid);
  215. return CONSTRAINT_CPUSET;
  216. }
  217. return CONSTRAINT_NONE;
  218. }
  219. #else
  220. static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
  221. gfp_t gfp_mask, nodemask_t *nodemask,
  222. unsigned long *totalpages)
  223. {
  224. *totalpages = totalram_pages + total_swap_pages;
  225. return CONSTRAINT_NONE;
  226. }
  227. #endif
  228. enum oom_scan_t oom_scan_process_thread(struct task_struct *task,
  229. unsigned long totalpages, const nodemask_t *nodemask,
  230. bool force_kill)
  231. {
  232. if (oom_unkillable_task(task, NULL, nodemask))
  233. return OOM_SCAN_CONTINUE;
  234. /*
  235. * This task already has access to memory reserves and is being killed.
  236. * Don't allow any other task to have access to the reserves.
  237. */
  238. if (test_tsk_thread_flag(task, TIF_MEMDIE)) {
  239. if (!force_kill)
  240. return OOM_SCAN_ABORT;
  241. }
  242. if (!task->mm)
  243. return OOM_SCAN_CONTINUE;
  244. /*
  245. * If task is allocating a lot of memory and has been marked to be
  246. * killed first if it triggers an oom, then select it.
  247. */
  248. if (oom_task_origin(task))
  249. return OOM_SCAN_SELECT;
  250. if (task_will_free_mem(task) && !force_kill)
  251. return OOM_SCAN_ABORT;
  252. return OOM_SCAN_OK;
  253. }
  254. /*
  255. * Simple selection loop. We chose the process with the highest
  256. * number of 'points'. Returns -1 on scan abort.
  257. *
  258. * (not docbooked, we don't want this one cluttering up the manual)
  259. */
  260. static struct task_struct *select_bad_process(unsigned int *ppoints,
  261. unsigned long totalpages, const nodemask_t *nodemask,
  262. bool force_kill)
  263. {
  264. struct task_struct *g, *p;
  265. struct task_struct *chosen = NULL;
  266. unsigned long chosen_points = 0;
  267. rcu_read_lock();
  268. for_each_process_thread(g, p) {
  269. unsigned int points;
  270. switch (oom_scan_process_thread(p, totalpages, nodemask,
  271. force_kill)) {
  272. case OOM_SCAN_SELECT:
  273. chosen = p;
  274. chosen_points = ULONG_MAX;
  275. /* fall through */
  276. case OOM_SCAN_CONTINUE:
  277. continue;
  278. case OOM_SCAN_ABORT:
  279. rcu_read_unlock();
  280. return (struct task_struct *)(-1UL);
  281. case OOM_SCAN_OK:
  282. break;
  283. };
  284. points = oom_badness(p, NULL, nodemask, totalpages);
  285. if (!points || points < chosen_points)
  286. continue;
  287. /* Prefer thread group leaders for display purposes */
  288. if (points == chosen_points && thread_group_leader(chosen))
  289. continue;
  290. chosen = p;
  291. chosen_points = points;
  292. }
  293. if (chosen)
  294. get_task_struct(chosen);
  295. rcu_read_unlock();
  296. *ppoints = chosen_points * 1000 / totalpages;
  297. return chosen;
  298. }
  299. /**
  300. * dump_tasks - dump current memory state of all system tasks
  301. * @memcg: current's memory controller, if constrained
  302. * @nodemask: nodemask passed to page allocator for mempolicy ooms
  303. *
  304. * Dumps the current memory state of all eligible tasks. Tasks not in the same
  305. * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
  306. * are not shown.
  307. * State information includes task's pid, uid, tgid, vm size, rss, nr_ptes,
  308. * swapents, oom_score_adj value, and name.
  309. */
  310. static void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask)
  311. {
  312. struct task_struct *p;
  313. struct task_struct *task;
  314. pr_info("[ pid ] uid tgid total_vm rss nr_ptes nr_pmds swapents oom_score_adj name\n");
  315. rcu_read_lock();
  316. for_each_process(p) {
  317. if (oom_unkillable_task(p, memcg, nodemask))
  318. continue;
  319. task = find_lock_task_mm(p);
  320. if (!task) {
  321. /*
  322. * This is a kthread or all of p's threads have already
  323. * detached their mm's. There's no need to report
  324. * them; they can't be oom killed anyway.
  325. */
  326. continue;
  327. }
  328. pr_info("[%5d] %5d %5d %8lu %8lu %7ld %7ld %8lu %5hd %s\n",
  329. task->pid, from_kuid(&init_user_ns, task_uid(task)),
  330. task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
  331. atomic_long_read(&task->mm->nr_ptes),
  332. mm_nr_pmds(task->mm),
  333. get_mm_counter(task->mm, MM_SWAPENTS),
  334. task->signal->oom_score_adj, task->comm);
  335. task_unlock(task);
  336. }
  337. rcu_read_unlock();
  338. }
  339. static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order,
  340. struct mem_cgroup *memcg, const nodemask_t *nodemask)
  341. {
  342. task_lock(current);
  343. pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
  344. "oom_score_adj=%hd\n",
  345. current->comm, gfp_mask, order,
  346. current->signal->oom_score_adj);
  347. cpuset_print_task_mems_allowed(current);
  348. task_unlock(current);
  349. dump_stack();
  350. if (memcg)
  351. mem_cgroup_print_oom_info(memcg, p);
  352. else
  353. show_mem(SHOW_MEM_FILTER_NODES);
  354. if (sysctl_oom_dump_tasks)
  355. dump_tasks(memcg, nodemask);
  356. }
  357. /*
  358. * Number of OOM victims in flight
  359. */
  360. static atomic_t oom_victims = ATOMIC_INIT(0);
  361. static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);
  362. bool oom_killer_disabled __read_mostly;
  363. /**
  364. * mark_oom_victim - mark the given task as OOM victim
  365. * @tsk: task to mark
  366. *
  367. * Has to be called with oom_lock held and never after
  368. * oom has been disabled already.
  369. */
  370. void mark_oom_victim(struct task_struct *tsk)
  371. {
  372. WARN_ON(oom_killer_disabled);
  373. /* OOM killer might race with memcg OOM */
  374. if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))
  375. return;
  376. /*
  377. * Make sure that the task is woken up from uninterruptible sleep
  378. * if it is frozen because OOM killer wouldn't be able to free
  379. * any memory and livelock. freezing_slow_path will tell the freezer
  380. * that TIF_MEMDIE tasks should be ignored.
  381. */
  382. __thaw_task(tsk);
  383. atomic_inc(&oom_victims);
  384. }
  385. /**
  386. * exit_oom_victim - note the exit of an OOM victim
  387. */
  388. void exit_oom_victim(void)
  389. {
  390. clear_thread_flag(TIF_MEMDIE);
  391. if (!atomic_dec_return(&oom_victims))
  392. wake_up_all(&oom_victims_wait);
  393. }
  394. /**
  395. * oom_killer_disable - disable OOM killer
  396. *
  397. * Forces all page allocations to fail rather than trigger OOM killer.
  398. * Will block and wait until all OOM victims are killed.
  399. *
  400. * The function cannot be called when there are runnable user tasks because
  401. * the userspace would see unexpected allocation failures as a result. Any
  402. * new usage of this function should be consulted with MM people.
  403. *
  404. * Returns true if successful and false if the OOM killer cannot be
  405. * disabled.
  406. */
  407. bool oom_killer_disable(void)
  408. {
  409. /*
  410. * Make sure to not race with an ongoing OOM killer
  411. * and that the current is not the victim.
  412. */
  413. mutex_lock(&oom_lock);
  414. if (test_thread_flag(TIF_MEMDIE)) {
  415. mutex_unlock(&oom_lock);
  416. return false;
  417. }
  418. oom_killer_disabled = true;
  419. mutex_unlock(&oom_lock);
  420. wait_event(oom_victims_wait, !atomic_read(&oom_victims));
  421. return true;
  422. }
  423. /**
  424. * oom_killer_enable - enable OOM killer
  425. */
  426. void oom_killer_enable(void)
  427. {
  428. oom_killer_disabled = false;
  429. }
  430. #define K(x) ((x) << (PAGE_SHIFT-10))
  431. /*
  432. * Must be called while holding a reference to p, which will be released upon
  433. * returning.
  434. */
  435. void oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order,
  436. unsigned int points, unsigned long totalpages,
  437. struct mem_cgroup *memcg, nodemask_t *nodemask,
  438. const char *message)
  439. {
  440. struct task_struct *victim = p;
  441. struct task_struct *child;
  442. struct task_struct *t;
  443. struct mm_struct *mm;
  444. unsigned int victim_points = 0;
  445. static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
  446. DEFAULT_RATELIMIT_BURST);
  447. /*
  448. * If the task is already exiting, don't alarm the sysadmin or kill
  449. * its children or threads, just set TIF_MEMDIE so it can die quickly
  450. */
  451. task_lock(p);
  452. if (p->mm && task_will_free_mem(p)) {
  453. mark_oom_victim(p);
  454. task_unlock(p);
  455. put_task_struct(p);
  456. return;
  457. }
  458. task_unlock(p);
  459. if (__ratelimit(&oom_rs))
  460. dump_header(p, gfp_mask, order, memcg, nodemask);
  461. task_lock(p);
  462. pr_err("%s: Kill process %d (%s) score %u or sacrifice child\n",
  463. message, task_pid_nr(p), p->comm, points);
  464. task_unlock(p);
  465. /*
  466. * If any of p's children has a different mm and is eligible for kill,
  467. * the one with the highest oom_badness() score is sacrificed for its
  468. * parent. This attempts to lose the minimal amount of work done while
  469. * still freeing memory.
  470. */
  471. read_lock(&tasklist_lock);
  472. for_each_thread(p, t) {
  473. list_for_each_entry(child, &t->children, sibling) {
  474. unsigned int child_points;
  475. if (child->mm == p->mm)
  476. continue;
  477. /*
  478. * oom_badness() returns 0 if the thread is unkillable
  479. */
  480. child_points = oom_badness(child, memcg, nodemask,
  481. totalpages);
  482. if (child_points > victim_points) {
  483. put_task_struct(victim);
  484. victim = child;
  485. victim_points = child_points;
  486. get_task_struct(victim);
  487. }
  488. }
  489. }
  490. read_unlock(&tasklist_lock);
  491. p = find_lock_task_mm(victim);
  492. if (!p) {
  493. put_task_struct(victim);
  494. return;
  495. } else if (victim != p) {
  496. get_task_struct(p);
  497. put_task_struct(victim);
  498. victim = p;
  499. }
  500. /* mm cannot safely be dereferenced after task_unlock(victim) */
  501. mm = victim->mm;
  502. mark_oom_victim(victim);
  503. pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
  504. task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
  505. K(get_mm_counter(victim->mm, MM_ANONPAGES)),
  506. K(get_mm_counter(victim->mm, MM_FILEPAGES)));
  507. task_unlock(victim);
  508. /*
  509. * Kill all user processes sharing victim->mm in other thread groups, if
  510. * any. They don't get access to memory reserves, though, to avoid
  511. * depletion of all memory. This prevents mm->mmap_sem livelock when an
  512. * oom killed thread cannot exit because it requires the semaphore and
  513. * its contended by another thread trying to allocate memory itself.
  514. * That thread will now get access to memory reserves since it has a
  515. * pending fatal signal.
  516. */
  517. rcu_read_lock();
  518. for_each_process(p)
  519. if (p->mm == mm && !same_thread_group(p, victim) &&
  520. !(p->flags & PF_KTHREAD)) {
  521. if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
  522. continue;
  523. task_lock(p); /* Protect ->comm from prctl() */
  524. pr_err("Kill process %d (%s) sharing same memory\n",
  525. task_pid_nr(p), p->comm);
  526. task_unlock(p);
  527. do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
  528. }
  529. rcu_read_unlock();
  530. do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
  531. put_task_struct(victim);
  532. }
  533. #undef K
  534. /*
  535. * Determines whether the kernel must panic because of the panic_on_oom sysctl.
  536. */
  537. void check_panic_on_oom(enum oom_constraint constraint, gfp_t gfp_mask,
  538. int order, const nodemask_t *nodemask,
  539. struct mem_cgroup *memcg)
  540. {
  541. if (likely(!sysctl_panic_on_oom))
  542. return;
  543. if (sysctl_panic_on_oom != 2) {
  544. /*
  545. * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
  546. * does not panic for cpuset, mempolicy, or memcg allocation
  547. * failures.
  548. */
  549. if (constraint != CONSTRAINT_NONE)
  550. return;
  551. }
  552. dump_header(NULL, gfp_mask, order, memcg, nodemask);
  553. panic("Out of memory: %s panic_on_oom is enabled\n",
  554. sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
  555. }
  556. static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
  557. int register_oom_notifier(struct notifier_block *nb)
  558. {
  559. return blocking_notifier_chain_register(&oom_notify_list, nb);
  560. }
  561. EXPORT_SYMBOL_GPL(register_oom_notifier);
  562. int unregister_oom_notifier(struct notifier_block *nb)
  563. {
  564. return blocking_notifier_chain_unregister(&oom_notify_list, nb);
  565. }
  566. EXPORT_SYMBOL_GPL(unregister_oom_notifier);
  567. /**
  568. * __out_of_memory - kill the "best" process when we run out of memory
  569. * @zonelist: zonelist pointer
  570. * @gfp_mask: memory allocation flags
  571. * @order: amount of memory being requested as a power of 2
  572. * @nodemask: nodemask passed to page allocator
  573. * @force_kill: true if a task must be killed, even if others are exiting
  574. *
  575. * If we run out of memory, we have the choice between either
  576. * killing a random task (bad), letting the system crash (worse)
  577. * OR try to be smart about which process to kill. Note that we
  578. * don't have to be perfect here, we just have to be good.
  579. */
  580. bool out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask,
  581. int order, nodemask_t *nodemask, bool force_kill)
  582. {
  583. const nodemask_t *mpol_mask;
  584. struct task_struct *p;
  585. unsigned long totalpages;
  586. unsigned long freed = 0;
  587. unsigned int uninitialized_var(points);
  588. enum oom_constraint constraint = CONSTRAINT_NONE;
  589. int killed = 0;
  590. if (oom_killer_disabled)
  591. return false;
  592. blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
  593. if (freed > 0)
  594. /* Got some memory back in the last second. */
  595. goto out;
  596. /*
  597. * If current has a pending SIGKILL or is exiting, then automatically
  598. * select it. The goal is to allow it to allocate so that it may
  599. * quickly exit and free its memory.
  600. *
  601. * But don't select if current has already released its mm and cleared
  602. * TIF_MEMDIE flag at exit_mm(), otherwise an OOM livelock may occur.
  603. */
  604. if (current->mm &&
  605. (fatal_signal_pending(current) || task_will_free_mem(current))) {
  606. mark_oom_victim(current);
  607. goto out;
  608. }
  609. /*
  610. * Check if there were limitations on the allocation (only relevant for
  611. * NUMA) that may require different handling.
  612. */
  613. constraint = constrained_alloc(zonelist, gfp_mask, nodemask,
  614. &totalpages);
  615. mpol_mask = (constraint == CONSTRAINT_MEMORY_POLICY) ? nodemask : NULL;
  616. check_panic_on_oom(constraint, gfp_mask, order, mpol_mask, NULL);
  617. if (sysctl_oom_kill_allocating_task && current->mm &&
  618. !oom_unkillable_task(current, NULL, nodemask) &&
  619. current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
  620. get_task_struct(current);
  621. oom_kill_process(current, gfp_mask, order, 0, totalpages, NULL,
  622. nodemask,
  623. "Out of memory (oom_kill_allocating_task)");
  624. goto out;
  625. }
  626. p = select_bad_process(&points, totalpages, mpol_mask, force_kill);
  627. /* Found nothing?!?! Either we hang forever, or we panic. */
  628. if (!p) {
  629. dump_header(NULL, gfp_mask, order, NULL, mpol_mask);
  630. panic("Out of memory and no killable processes...\n");
  631. }
  632. if (p != (void *)-1UL) {
  633. oom_kill_process(p, gfp_mask, order, points, totalpages, NULL,
  634. nodemask, "Out of memory");
  635. killed = 1;
  636. }
  637. out:
  638. /*
  639. * Give the killed threads a good chance of exiting before trying to
  640. * allocate memory again.
  641. */
  642. if (killed)
  643. schedule_timeout_killable(1);
  644. return true;
  645. }
  646. /*
  647. * The pagefault handler calls here because it is out of memory, so kill a
  648. * memory-hogging task. If any populated zone has ZONE_OOM_LOCKED set, a
  649. * parallel oom killing is already in progress so do nothing.
  650. */
  651. void pagefault_out_of_memory(void)
  652. {
  653. if (mem_cgroup_oom_synchronize(true))
  654. return;
  655. if (!mutex_trylock(&oom_lock))
  656. return;
  657. if (!out_of_memory(NULL, 0, 0, NULL, false)) {
  658. /*
  659. * There shouldn't be any user tasks runnable while the
  660. * OOM killer is disabled, so the current task has to
  661. * be a racing OOM victim for which oom_killer_disable()
  662. * is waiting for.
  663. */
  664. WARN_ON(test_thread_flag(TIF_MEMDIE));
  665. }
  666. mutex_unlock(&oom_lock);
  667. }