oom_kill.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778
  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. /*
  110. * order == -1 means the oom kill is required by sysrq, otherwise only
  111. * for display purposes.
  112. */
  113. static inline bool is_sysrq_oom(struct oom_control *oc)
  114. {
  115. return oc->order == -1;
  116. }
  117. /* return true if the task is not adequate as candidate victim task. */
  118. static bool oom_unkillable_task(struct task_struct *p,
  119. struct mem_cgroup *memcg, const nodemask_t *nodemask)
  120. {
  121. if (is_global_init(p))
  122. return true;
  123. if (p->flags & PF_KTHREAD)
  124. return true;
  125. /* When mem_cgroup_out_of_memory() and p is not member of the group */
  126. if (memcg && !task_in_mem_cgroup(p, memcg))
  127. return true;
  128. /* p may not have freeable memory in nodemask */
  129. if (!has_intersects_mems_allowed(p, nodemask))
  130. return true;
  131. return false;
  132. }
  133. /**
  134. * oom_badness - heuristic function to determine which candidate task to kill
  135. * @p: task struct of which task we should calculate
  136. * @totalpages: total present RAM allowed for page allocation
  137. *
  138. * The heuristic for determining which task to kill is made to be as simple and
  139. * predictable as possible. The goal is to return the highest value for the
  140. * task consuming the most memory to avoid subsequent oom failures.
  141. */
  142. unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
  143. const nodemask_t *nodemask, unsigned long totalpages)
  144. {
  145. long points;
  146. long adj;
  147. if (oom_unkillable_task(p, memcg, nodemask))
  148. return 0;
  149. p = find_lock_task_mm(p);
  150. if (!p)
  151. return 0;
  152. adj = (long)p->signal->oom_score_adj;
  153. if (adj == OOM_SCORE_ADJ_MIN) {
  154. task_unlock(p);
  155. return 0;
  156. }
  157. /*
  158. * The baseline for the badness score is the proportion of RAM that each
  159. * task's rss, pagetable and swap space use.
  160. */
  161. points = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) +
  162. atomic_long_read(&p->mm->nr_ptes) + mm_nr_pmds(p->mm);
  163. task_unlock(p);
  164. /*
  165. * Root processes get 3% bonus, just like the __vm_enough_memory()
  166. * implementation used by LSMs.
  167. */
  168. if (has_capability_noaudit(p, CAP_SYS_ADMIN))
  169. points -= (points * 3) / 100;
  170. /* Normalize to oom_score_adj units */
  171. adj *= totalpages / 1000;
  172. points += adj;
  173. /*
  174. * Never return 0 for an eligible task regardless of the root bonus and
  175. * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).
  176. */
  177. return points > 0 ? points : 1;
  178. }
  179. /*
  180. * Determine the type of allocation constraint.
  181. */
  182. #ifdef CONFIG_NUMA
  183. static enum oom_constraint constrained_alloc(struct oom_control *oc,
  184. unsigned long *totalpages)
  185. {
  186. struct zone *zone;
  187. struct zoneref *z;
  188. enum zone_type high_zoneidx = gfp_zone(oc->gfp_mask);
  189. bool cpuset_limited = false;
  190. int nid;
  191. /* Default to all available memory */
  192. *totalpages = totalram_pages + total_swap_pages;
  193. if (!oc->zonelist)
  194. return CONSTRAINT_NONE;
  195. /*
  196. * Reach here only when __GFP_NOFAIL is used. So, we should avoid
  197. * to kill current.We have to random task kill in this case.
  198. * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
  199. */
  200. if (oc->gfp_mask & __GFP_THISNODE)
  201. return CONSTRAINT_NONE;
  202. /*
  203. * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
  204. * the page allocator means a mempolicy is in effect. Cpuset policy
  205. * is enforced in get_page_from_freelist().
  206. */
  207. if (oc->nodemask &&
  208. !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {
  209. *totalpages = total_swap_pages;
  210. for_each_node_mask(nid, *oc->nodemask)
  211. *totalpages += node_spanned_pages(nid);
  212. return CONSTRAINT_MEMORY_POLICY;
  213. }
  214. /* Check this allocation failure is caused by cpuset's wall function */
  215. for_each_zone_zonelist_nodemask(zone, z, oc->zonelist,
  216. high_zoneidx, oc->nodemask)
  217. if (!cpuset_zone_allowed(zone, oc->gfp_mask))
  218. cpuset_limited = true;
  219. if (cpuset_limited) {
  220. *totalpages = total_swap_pages;
  221. for_each_node_mask(nid, cpuset_current_mems_allowed)
  222. *totalpages += node_spanned_pages(nid);
  223. return CONSTRAINT_CPUSET;
  224. }
  225. return CONSTRAINT_NONE;
  226. }
  227. #else
  228. static enum oom_constraint constrained_alloc(struct oom_control *oc,
  229. unsigned long *totalpages)
  230. {
  231. *totalpages = totalram_pages + total_swap_pages;
  232. return CONSTRAINT_NONE;
  233. }
  234. #endif
  235. enum oom_scan_t oom_scan_process_thread(struct oom_control *oc,
  236. struct task_struct *task, unsigned long totalpages)
  237. {
  238. if (oom_unkillable_task(task, NULL, oc->nodemask))
  239. return OOM_SCAN_CONTINUE;
  240. /*
  241. * This task already has access to memory reserves and is being killed.
  242. * Don't allow any other task to have access to the reserves.
  243. */
  244. if (test_tsk_thread_flag(task, TIF_MEMDIE)) {
  245. if (!is_sysrq_oom(oc))
  246. return OOM_SCAN_ABORT;
  247. }
  248. if (!task->mm)
  249. return OOM_SCAN_CONTINUE;
  250. /*
  251. * If task is allocating a lot of memory and has been marked to be
  252. * killed first if it triggers an oom, then select it.
  253. */
  254. if (oom_task_origin(task))
  255. return OOM_SCAN_SELECT;
  256. if (task_will_free_mem(task) && !is_sysrq_oom(oc))
  257. return OOM_SCAN_ABORT;
  258. return OOM_SCAN_OK;
  259. }
  260. /*
  261. * Simple selection loop. We chose the process with the highest
  262. * number of 'points'. Returns -1 on scan abort.
  263. */
  264. static struct task_struct *select_bad_process(struct oom_control *oc,
  265. unsigned int *ppoints, unsigned long totalpages)
  266. {
  267. struct task_struct *g, *p;
  268. struct task_struct *chosen = NULL;
  269. unsigned long chosen_points = 0;
  270. rcu_read_lock();
  271. for_each_process_thread(g, p) {
  272. unsigned int points;
  273. switch (oom_scan_process_thread(oc, p, totalpages)) {
  274. case OOM_SCAN_SELECT:
  275. chosen = p;
  276. chosen_points = ULONG_MAX;
  277. /* fall through */
  278. case OOM_SCAN_CONTINUE:
  279. continue;
  280. case OOM_SCAN_ABORT:
  281. rcu_read_unlock();
  282. return (struct task_struct *)(-1UL);
  283. case OOM_SCAN_OK:
  284. break;
  285. };
  286. points = oom_badness(p, NULL, oc->nodemask, totalpages);
  287. if (!points || points < chosen_points)
  288. continue;
  289. /* Prefer thread group leaders for display purposes */
  290. if (points == chosen_points && thread_group_leader(chosen))
  291. continue;
  292. chosen = p;
  293. chosen_points = points;
  294. }
  295. if (chosen)
  296. get_task_struct(chosen);
  297. rcu_read_unlock();
  298. *ppoints = chosen_points * 1000 / totalpages;
  299. return chosen;
  300. }
  301. /**
  302. * dump_tasks - dump current memory state of all system tasks
  303. * @memcg: current's memory controller, if constrained
  304. * @nodemask: nodemask passed to page allocator for mempolicy ooms
  305. *
  306. * Dumps the current memory state of all eligible tasks. Tasks not in the same
  307. * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
  308. * are not shown.
  309. * State information includes task's pid, uid, tgid, vm size, rss, nr_ptes,
  310. * swapents, oom_score_adj value, and name.
  311. */
  312. static void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask)
  313. {
  314. struct task_struct *p;
  315. struct task_struct *task;
  316. pr_info("[ pid ] uid tgid total_vm rss nr_ptes nr_pmds swapents oom_score_adj name\n");
  317. rcu_read_lock();
  318. for_each_process(p) {
  319. if (oom_unkillable_task(p, memcg, nodemask))
  320. continue;
  321. task = find_lock_task_mm(p);
  322. if (!task) {
  323. /*
  324. * This is a kthread or all of p's threads have already
  325. * detached their mm's. There's no need to report
  326. * them; they can't be oom killed anyway.
  327. */
  328. continue;
  329. }
  330. pr_info("[%5d] %5d %5d %8lu %8lu %7ld %7ld %8lu %5hd %s\n",
  331. task->pid, from_kuid(&init_user_ns, task_uid(task)),
  332. task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
  333. atomic_long_read(&task->mm->nr_ptes),
  334. mm_nr_pmds(task->mm),
  335. get_mm_counter(task->mm, MM_SWAPENTS),
  336. task->signal->oom_score_adj, task->comm);
  337. task_unlock(task);
  338. }
  339. rcu_read_unlock();
  340. }
  341. static void dump_header(struct oom_control *oc, struct task_struct *p,
  342. struct mem_cgroup *memcg)
  343. {
  344. pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
  345. "oom_score_adj=%hd\n",
  346. current->comm, oc->gfp_mask, oc->order,
  347. current->signal->oom_score_adj);
  348. cpuset_print_current_mems_allowed();
  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, oc->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. /*
  431. * task->mm can be NULL if the task is the exited group leader. So to
  432. * determine whether the task is using a particular mm, we examine all the
  433. * task's threads: if one of those is using this mm then this task was also
  434. * using it.
  435. */
  436. static bool process_shares_mm(struct task_struct *p, struct mm_struct *mm)
  437. {
  438. struct task_struct *t;
  439. for_each_thread(p, t) {
  440. struct mm_struct *t_mm = READ_ONCE(t->mm);
  441. if (t_mm)
  442. return t_mm == mm;
  443. }
  444. return false;
  445. }
  446. #define K(x) ((x) << (PAGE_SHIFT-10))
  447. /*
  448. * Must be called while holding a reference to p, which will be released upon
  449. * returning.
  450. */
  451. void oom_kill_process(struct oom_control *oc, struct task_struct *p,
  452. unsigned int points, unsigned long totalpages,
  453. struct mem_cgroup *memcg, const char *message)
  454. {
  455. struct task_struct *victim = p;
  456. struct task_struct *child;
  457. struct task_struct *t;
  458. struct mm_struct *mm;
  459. unsigned int victim_points = 0;
  460. static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
  461. DEFAULT_RATELIMIT_BURST);
  462. /*
  463. * If the task is already exiting, don't alarm the sysadmin or kill
  464. * its children or threads, just set TIF_MEMDIE so it can die quickly
  465. */
  466. task_lock(p);
  467. if (p->mm && task_will_free_mem(p)) {
  468. mark_oom_victim(p);
  469. task_unlock(p);
  470. put_task_struct(p);
  471. return;
  472. }
  473. task_unlock(p);
  474. if (__ratelimit(&oom_rs))
  475. dump_header(oc, p, memcg);
  476. pr_err("%s: Kill process %d (%s) score %u or sacrifice child\n",
  477. message, task_pid_nr(p), p->comm, points);
  478. /*
  479. * If any of p's children has a different mm and is eligible for kill,
  480. * the one with the highest oom_badness() score is sacrificed for its
  481. * parent. This attempts to lose the minimal amount of work done while
  482. * still freeing memory.
  483. */
  484. read_lock(&tasklist_lock);
  485. /*
  486. * The task 'p' might have already exited before reaching here. The
  487. * put_task_struct() will free task_struct 'p' while the loop still try
  488. * to access the field of 'p', so, get an extra reference.
  489. */
  490. get_task_struct(p);
  491. for_each_thread(p, t) {
  492. list_for_each_entry(child, &t->children, sibling) {
  493. unsigned int child_points;
  494. if (process_shares_mm(child, p->mm))
  495. continue;
  496. /*
  497. * oom_badness() returns 0 if the thread is unkillable
  498. */
  499. child_points = oom_badness(child, memcg, oc->nodemask,
  500. totalpages);
  501. if (child_points > victim_points) {
  502. put_task_struct(victim);
  503. victim = child;
  504. victim_points = child_points;
  505. get_task_struct(victim);
  506. }
  507. }
  508. }
  509. put_task_struct(p);
  510. read_unlock(&tasklist_lock);
  511. p = find_lock_task_mm(victim);
  512. if (!p) {
  513. put_task_struct(victim);
  514. return;
  515. } else if (victim != p) {
  516. get_task_struct(p);
  517. put_task_struct(victim);
  518. victim = p;
  519. }
  520. /* Get a reference to safely compare mm after task_unlock(victim) */
  521. mm = victim->mm;
  522. atomic_inc(&mm->mm_count);
  523. /*
  524. * We should send SIGKILL before setting TIF_MEMDIE in order to prevent
  525. * the OOM victim from depleting the memory reserves from the user
  526. * space under its control.
  527. */
  528. do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
  529. mark_oom_victim(victim);
  530. pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
  531. task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
  532. K(get_mm_counter(victim->mm, MM_ANONPAGES)),
  533. K(get_mm_counter(victim->mm, MM_FILEPAGES)));
  534. task_unlock(victim);
  535. /*
  536. * Kill all user processes sharing victim->mm in other thread groups, if
  537. * any. They don't get access to memory reserves, though, to avoid
  538. * depletion of all memory. This prevents mm->mmap_sem livelock when an
  539. * oom killed thread cannot exit because it requires the semaphore and
  540. * its contended by another thread trying to allocate memory itself.
  541. * That thread will now get access to memory reserves since it has a
  542. * pending fatal signal.
  543. */
  544. rcu_read_lock();
  545. for_each_process(p) {
  546. if (!process_shares_mm(p, mm))
  547. continue;
  548. if (same_thread_group(p, victim))
  549. continue;
  550. if (unlikely(p->flags & PF_KTHREAD))
  551. continue;
  552. if (is_global_init(p))
  553. continue;
  554. if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
  555. continue;
  556. do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
  557. }
  558. rcu_read_unlock();
  559. mmdrop(mm);
  560. put_task_struct(victim);
  561. }
  562. #undef K
  563. /*
  564. * Determines whether the kernel must panic because of the panic_on_oom sysctl.
  565. */
  566. void check_panic_on_oom(struct oom_control *oc, enum oom_constraint constraint,
  567. struct mem_cgroup *memcg)
  568. {
  569. if (likely(!sysctl_panic_on_oom))
  570. return;
  571. if (sysctl_panic_on_oom != 2) {
  572. /*
  573. * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
  574. * does not panic for cpuset, mempolicy, or memcg allocation
  575. * failures.
  576. */
  577. if (constraint != CONSTRAINT_NONE)
  578. return;
  579. }
  580. /* Do not panic for oom kills triggered by sysrq */
  581. if (is_sysrq_oom(oc))
  582. return;
  583. dump_header(oc, NULL, memcg);
  584. panic("Out of memory: %s panic_on_oom is enabled\n",
  585. sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
  586. }
  587. static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
  588. int register_oom_notifier(struct notifier_block *nb)
  589. {
  590. return blocking_notifier_chain_register(&oom_notify_list, nb);
  591. }
  592. EXPORT_SYMBOL_GPL(register_oom_notifier);
  593. int unregister_oom_notifier(struct notifier_block *nb)
  594. {
  595. return blocking_notifier_chain_unregister(&oom_notify_list, nb);
  596. }
  597. EXPORT_SYMBOL_GPL(unregister_oom_notifier);
  598. /**
  599. * out_of_memory - kill the "best" process when we run out of memory
  600. * @oc: pointer to struct oom_control
  601. *
  602. * If we run out of memory, we have the choice between either
  603. * killing a random task (bad), letting the system crash (worse)
  604. * OR try to be smart about which process to kill. Note that we
  605. * don't have to be perfect here, we just have to be good.
  606. */
  607. bool out_of_memory(struct oom_control *oc)
  608. {
  609. struct task_struct *p;
  610. unsigned long totalpages;
  611. unsigned long freed = 0;
  612. unsigned int uninitialized_var(points);
  613. enum oom_constraint constraint = CONSTRAINT_NONE;
  614. if (oom_killer_disabled)
  615. return false;
  616. blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
  617. if (freed > 0)
  618. /* Got some memory back in the last second. */
  619. return true;
  620. /*
  621. * If current has a pending SIGKILL or is exiting, then automatically
  622. * select it. The goal is to allow it to allocate so that it may
  623. * quickly exit and free its memory.
  624. *
  625. * But don't select if current has already released its mm and cleared
  626. * TIF_MEMDIE flag at exit_mm(), otherwise an OOM livelock may occur.
  627. */
  628. if (current->mm &&
  629. (fatal_signal_pending(current) || task_will_free_mem(current))) {
  630. mark_oom_victim(current);
  631. return true;
  632. }
  633. /*
  634. * Check if there were limitations on the allocation (only relevant for
  635. * NUMA) that may require different handling.
  636. */
  637. constraint = constrained_alloc(oc, &totalpages);
  638. if (constraint != CONSTRAINT_MEMORY_POLICY)
  639. oc->nodemask = NULL;
  640. check_panic_on_oom(oc, constraint, NULL);
  641. if (sysctl_oom_kill_allocating_task && current->mm &&
  642. !oom_unkillable_task(current, NULL, oc->nodemask) &&
  643. current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
  644. get_task_struct(current);
  645. oom_kill_process(oc, current, 0, totalpages, NULL,
  646. "Out of memory (oom_kill_allocating_task)");
  647. return true;
  648. }
  649. p = select_bad_process(oc, &points, totalpages);
  650. /* Found nothing?!?! Either we hang forever, or we panic. */
  651. if (!p && !is_sysrq_oom(oc)) {
  652. dump_header(oc, NULL, NULL);
  653. panic("Out of memory and no killable processes...\n");
  654. }
  655. if (p && p != (void *)-1UL) {
  656. oom_kill_process(oc, p, points, totalpages, NULL,
  657. "Out of memory");
  658. /*
  659. * Give the killed process a good chance to exit before trying
  660. * to allocate memory again.
  661. */
  662. schedule_timeout_killable(1);
  663. }
  664. return true;
  665. }
  666. /*
  667. * The pagefault handler calls here because it is out of memory, so kill a
  668. * memory-hogging task. If any populated zone has ZONE_OOM_LOCKED set, a
  669. * parallel oom killing is already in progress so do nothing.
  670. */
  671. void pagefault_out_of_memory(void)
  672. {
  673. struct oom_control oc = {
  674. .zonelist = NULL,
  675. .nodemask = NULL,
  676. .gfp_mask = 0,
  677. .order = 0,
  678. };
  679. if (mem_cgroup_oom_synchronize(true))
  680. return;
  681. if (!mutex_trylock(&oom_lock))
  682. return;
  683. if (!out_of_memory(&oc)) {
  684. /*
  685. * There shouldn't be any user tasks runnable while the
  686. * OOM killer is disabled, so the current task has to
  687. * be a racing OOM victim for which oom_killer_disable()
  688. * is waiting for.
  689. */
  690. WARN_ON(test_thread_flag(TIF_MEMDIE));
  691. }
  692. mutex_unlock(&oom_lock);
  693. }