oom_kill.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942
  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. #include <linux/kthread.h>
  38. #include <linux/init.h>
  39. #include <asm/tlb.h>
  40. #include "internal.h"
  41. #define CREATE_TRACE_POINTS
  42. #include <trace/events/oom.h>
  43. int sysctl_panic_on_oom;
  44. int sysctl_oom_kill_allocating_task;
  45. int sysctl_oom_dump_tasks = 1;
  46. DEFINE_MUTEX(oom_lock);
  47. #ifdef CONFIG_NUMA
  48. /**
  49. * has_intersects_mems_allowed() - check task eligiblity for kill
  50. * @start: task struct of which task to consider
  51. * @mask: nodemask passed to page allocator for mempolicy ooms
  52. *
  53. * Task eligibility is determined by whether or not a candidate task, @tsk,
  54. * shares the same mempolicy nodes as current if it is bound by such a policy
  55. * and whether or not it has the same set of allowed cpuset nodes.
  56. */
  57. static bool has_intersects_mems_allowed(struct task_struct *start,
  58. const nodemask_t *mask)
  59. {
  60. struct task_struct *tsk;
  61. bool ret = false;
  62. rcu_read_lock();
  63. for_each_thread(start, tsk) {
  64. if (mask) {
  65. /*
  66. * If this is a mempolicy constrained oom, tsk's
  67. * cpuset is irrelevant. Only return true if its
  68. * mempolicy intersects current, otherwise it may be
  69. * needlessly killed.
  70. */
  71. ret = mempolicy_nodemask_intersects(tsk, mask);
  72. } else {
  73. /*
  74. * This is not a mempolicy constrained oom, so only
  75. * check the mems of tsk's cpuset.
  76. */
  77. ret = cpuset_mems_allowed_intersects(current, tsk);
  78. }
  79. if (ret)
  80. break;
  81. }
  82. rcu_read_unlock();
  83. return ret;
  84. }
  85. #else
  86. static bool has_intersects_mems_allowed(struct task_struct *tsk,
  87. const nodemask_t *mask)
  88. {
  89. return true;
  90. }
  91. #endif /* CONFIG_NUMA */
  92. /*
  93. * The process p may have detached its own ->mm while exiting or through
  94. * use_mm(), but one or more of its subthreads may still have a valid
  95. * pointer. Return p, or any of its subthreads with a valid ->mm, with
  96. * task_lock() held.
  97. */
  98. struct task_struct *find_lock_task_mm(struct task_struct *p)
  99. {
  100. struct task_struct *t;
  101. rcu_read_lock();
  102. for_each_thread(p, t) {
  103. task_lock(t);
  104. if (likely(t->mm))
  105. goto found;
  106. task_unlock(t);
  107. }
  108. t = NULL;
  109. found:
  110. rcu_read_unlock();
  111. return t;
  112. }
  113. /*
  114. * order == -1 means the oom kill is required by sysrq, otherwise only
  115. * for display purposes.
  116. */
  117. static inline bool is_sysrq_oom(struct oom_control *oc)
  118. {
  119. return oc->order == -1;
  120. }
  121. /* return true if the task is not adequate as candidate victim task. */
  122. static bool oom_unkillable_task(struct task_struct *p,
  123. struct mem_cgroup *memcg, const nodemask_t *nodemask)
  124. {
  125. if (is_global_init(p))
  126. return true;
  127. if (p->flags & PF_KTHREAD)
  128. return true;
  129. /* When mem_cgroup_out_of_memory() and p is not member of the group */
  130. if (memcg && !task_in_mem_cgroup(p, memcg))
  131. return true;
  132. /* p may not have freeable memory in nodemask */
  133. if (!has_intersects_mems_allowed(p, nodemask))
  134. return true;
  135. return false;
  136. }
  137. /**
  138. * oom_badness - heuristic function to determine which candidate task to kill
  139. * @p: task struct of which task we should calculate
  140. * @totalpages: total present RAM allowed for page allocation
  141. *
  142. * The heuristic for determining which task to kill is made to be as simple and
  143. * predictable as possible. The goal is to return the highest value for the
  144. * task consuming the most memory to avoid subsequent oom failures.
  145. */
  146. unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
  147. const nodemask_t *nodemask, unsigned long totalpages)
  148. {
  149. long points;
  150. long adj;
  151. if (oom_unkillable_task(p, memcg, nodemask))
  152. return 0;
  153. p = find_lock_task_mm(p);
  154. if (!p)
  155. return 0;
  156. adj = (long)p->signal->oom_score_adj;
  157. if (adj == OOM_SCORE_ADJ_MIN) {
  158. task_unlock(p);
  159. return 0;
  160. }
  161. /*
  162. * The baseline for the badness score is the proportion of RAM that each
  163. * task's rss, pagetable and swap space use.
  164. */
  165. points = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) +
  166. atomic_long_read(&p->mm->nr_ptes) + mm_nr_pmds(p->mm);
  167. task_unlock(p);
  168. /*
  169. * Root processes get 3% bonus, just like the __vm_enough_memory()
  170. * implementation used by LSMs.
  171. */
  172. if (has_capability_noaudit(p, CAP_SYS_ADMIN))
  173. points -= (points * 3) / 100;
  174. /* Normalize to oom_score_adj units */
  175. adj *= totalpages / 1000;
  176. points += adj;
  177. /*
  178. * Never return 0 for an eligible task regardless of the root bonus and
  179. * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).
  180. */
  181. return points > 0 ? points : 1;
  182. }
  183. /*
  184. * Determine the type of allocation constraint.
  185. */
  186. #ifdef CONFIG_NUMA
  187. static enum oom_constraint constrained_alloc(struct oom_control *oc,
  188. unsigned long *totalpages)
  189. {
  190. struct zone *zone;
  191. struct zoneref *z;
  192. enum zone_type high_zoneidx = gfp_zone(oc->gfp_mask);
  193. bool cpuset_limited = false;
  194. int nid;
  195. /* Default to all available memory */
  196. *totalpages = totalram_pages + total_swap_pages;
  197. if (!oc->zonelist)
  198. return CONSTRAINT_NONE;
  199. /*
  200. * Reach here only when __GFP_NOFAIL is used. So, we should avoid
  201. * to kill current.We have to random task kill in this case.
  202. * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
  203. */
  204. if (oc->gfp_mask & __GFP_THISNODE)
  205. return CONSTRAINT_NONE;
  206. /*
  207. * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
  208. * the page allocator means a mempolicy is in effect. Cpuset policy
  209. * is enforced in get_page_from_freelist().
  210. */
  211. if (oc->nodemask &&
  212. !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {
  213. *totalpages = total_swap_pages;
  214. for_each_node_mask(nid, *oc->nodemask)
  215. *totalpages += node_spanned_pages(nid);
  216. return CONSTRAINT_MEMORY_POLICY;
  217. }
  218. /* Check this allocation failure is caused by cpuset's wall function */
  219. for_each_zone_zonelist_nodemask(zone, z, oc->zonelist,
  220. high_zoneidx, oc->nodemask)
  221. if (!cpuset_zone_allowed(zone, oc->gfp_mask))
  222. cpuset_limited = true;
  223. if (cpuset_limited) {
  224. *totalpages = total_swap_pages;
  225. for_each_node_mask(nid, cpuset_current_mems_allowed)
  226. *totalpages += node_spanned_pages(nid);
  227. return CONSTRAINT_CPUSET;
  228. }
  229. return CONSTRAINT_NONE;
  230. }
  231. #else
  232. static enum oom_constraint constrained_alloc(struct oom_control *oc,
  233. unsigned long *totalpages)
  234. {
  235. *totalpages = totalram_pages + total_swap_pages;
  236. return CONSTRAINT_NONE;
  237. }
  238. #endif
  239. enum oom_scan_t oom_scan_process_thread(struct oom_control *oc,
  240. struct task_struct *task, unsigned long totalpages)
  241. {
  242. if (oom_unkillable_task(task, NULL, oc->nodemask))
  243. return OOM_SCAN_CONTINUE;
  244. /*
  245. * This task already has access to memory reserves and is being killed.
  246. * Don't allow any other task to have access to the reserves.
  247. */
  248. if (test_tsk_thread_flag(task, TIF_MEMDIE)) {
  249. if (!is_sysrq_oom(oc))
  250. return OOM_SCAN_ABORT;
  251. }
  252. if (!task->mm)
  253. return OOM_SCAN_CONTINUE;
  254. /*
  255. * If task is allocating a lot of memory and has been marked to be
  256. * killed first if it triggers an oom, then select it.
  257. */
  258. if (oom_task_origin(task))
  259. return OOM_SCAN_SELECT;
  260. return OOM_SCAN_OK;
  261. }
  262. /*
  263. * Simple selection loop. We chose the process with the highest
  264. * number of 'points'. Returns -1 on scan abort.
  265. */
  266. static struct task_struct *select_bad_process(struct oom_control *oc,
  267. unsigned int *ppoints, unsigned long totalpages)
  268. {
  269. struct task_struct *g, *p;
  270. struct task_struct *chosen = NULL;
  271. unsigned long chosen_points = 0;
  272. rcu_read_lock();
  273. for_each_process_thread(g, p) {
  274. unsigned int points;
  275. switch (oom_scan_process_thread(oc, p, totalpages)) {
  276. case OOM_SCAN_SELECT:
  277. chosen = p;
  278. chosen_points = ULONG_MAX;
  279. /* fall through */
  280. case OOM_SCAN_CONTINUE:
  281. continue;
  282. case OOM_SCAN_ABORT:
  283. rcu_read_unlock();
  284. return (struct task_struct *)(-1UL);
  285. case OOM_SCAN_OK:
  286. break;
  287. };
  288. points = oom_badness(p, NULL, oc->nodemask, totalpages);
  289. if (!points || points < chosen_points)
  290. continue;
  291. /* Prefer thread group leaders for display purposes */
  292. if (points == chosen_points && thread_group_leader(chosen))
  293. continue;
  294. chosen = p;
  295. chosen_points = points;
  296. }
  297. if (chosen)
  298. get_task_struct(chosen);
  299. rcu_read_unlock();
  300. *ppoints = chosen_points * 1000 / totalpages;
  301. return chosen;
  302. }
  303. /**
  304. * dump_tasks - dump current memory state of all system tasks
  305. * @memcg: current's memory controller, if constrained
  306. * @nodemask: nodemask passed to page allocator for mempolicy ooms
  307. *
  308. * Dumps the current memory state of all eligible tasks. Tasks not in the same
  309. * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
  310. * are not shown.
  311. * State information includes task's pid, uid, tgid, vm size, rss, nr_ptes,
  312. * swapents, oom_score_adj value, and name.
  313. */
  314. static void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask)
  315. {
  316. struct task_struct *p;
  317. struct task_struct *task;
  318. pr_info("[ pid ] uid tgid total_vm rss nr_ptes nr_pmds swapents oom_score_adj name\n");
  319. rcu_read_lock();
  320. for_each_process(p) {
  321. if (oom_unkillable_task(p, memcg, nodemask))
  322. continue;
  323. task = find_lock_task_mm(p);
  324. if (!task) {
  325. /*
  326. * This is a kthread or all of p's threads have already
  327. * detached their mm's. There's no need to report
  328. * them; they can't be oom killed anyway.
  329. */
  330. continue;
  331. }
  332. pr_info("[%5d] %5d %5d %8lu %8lu %7ld %7ld %8lu %5hd %s\n",
  333. task->pid, from_kuid(&init_user_ns, task_uid(task)),
  334. task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
  335. atomic_long_read(&task->mm->nr_ptes),
  336. mm_nr_pmds(task->mm),
  337. get_mm_counter(task->mm, MM_SWAPENTS),
  338. task->signal->oom_score_adj, task->comm);
  339. task_unlock(task);
  340. }
  341. rcu_read_unlock();
  342. }
  343. static void dump_header(struct oom_control *oc, struct task_struct *p,
  344. struct mem_cgroup *memcg)
  345. {
  346. pr_warn("%s invoked oom-killer: gfp_mask=%#x(%pGg), order=%d, oom_score_adj=%hd\n",
  347. current->comm, oc->gfp_mask, &oc->gfp_mask, oc->order,
  348. current->signal->oom_score_adj);
  349. cpuset_print_current_mems_allowed();
  350. dump_stack();
  351. if (memcg)
  352. mem_cgroup_print_oom_info(memcg, p);
  353. else
  354. show_mem(SHOW_MEM_FILTER_NODES);
  355. if (sysctl_oom_dump_tasks)
  356. dump_tasks(memcg, oc->nodemask);
  357. }
  358. /*
  359. * Number of OOM victims in flight
  360. */
  361. static atomic_t oom_victims = ATOMIC_INIT(0);
  362. static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);
  363. bool oom_killer_disabled __read_mostly;
  364. #define K(x) ((x) << (PAGE_SHIFT-10))
  365. #ifdef CONFIG_MMU
  366. /*
  367. * OOM Reaper kernel thread which tries to reap the memory used by the OOM
  368. * victim (if that is possible) to help the OOM killer to move on.
  369. */
  370. static struct task_struct *oom_reaper_th;
  371. static DECLARE_WAIT_QUEUE_HEAD(oom_reaper_wait);
  372. static struct task_struct *oom_reaper_list;
  373. static DEFINE_SPINLOCK(oom_reaper_lock);
  374. static bool __oom_reap_task(struct task_struct *tsk)
  375. {
  376. struct mmu_gather tlb;
  377. struct vm_area_struct *vma;
  378. struct mm_struct *mm;
  379. struct task_struct *p;
  380. struct zap_details details = {.check_swap_entries = true,
  381. .ignore_dirty = true};
  382. bool ret = true;
  383. /*
  384. * Make sure we find the associated mm_struct even when the particular
  385. * thread has already terminated and cleared its mm.
  386. * We might have race with exit path so consider our work done if there
  387. * is no mm.
  388. */
  389. p = find_lock_task_mm(tsk);
  390. if (!p)
  391. return true;
  392. mm = p->mm;
  393. if (!atomic_inc_not_zero(&mm->mm_users)) {
  394. task_unlock(p);
  395. return true;
  396. }
  397. task_unlock(p);
  398. if (!down_read_trylock(&mm->mmap_sem)) {
  399. ret = false;
  400. goto out;
  401. }
  402. tlb_gather_mmu(&tlb, mm, 0, -1);
  403. for (vma = mm->mmap ; vma; vma = vma->vm_next) {
  404. if (is_vm_hugetlb_page(vma))
  405. continue;
  406. /*
  407. * mlocked VMAs require explicit munlocking before unmap.
  408. * Let's keep it simple here and skip such VMAs.
  409. */
  410. if (vma->vm_flags & VM_LOCKED)
  411. continue;
  412. /*
  413. * Only anonymous pages have a good chance to be dropped
  414. * without additional steps which we cannot afford as we
  415. * are OOM already.
  416. *
  417. * We do not even care about fs backed pages because all
  418. * which are reclaimable have already been reclaimed and
  419. * we do not want to block exit_mmap by keeping mm ref
  420. * count elevated without a good reason.
  421. */
  422. if (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED))
  423. unmap_page_range(&tlb, vma, vma->vm_start, vma->vm_end,
  424. &details);
  425. }
  426. tlb_finish_mmu(&tlb, 0, -1);
  427. pr_info("oom_reaper: reaped process %d (%s), now anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
  428. task_pid_nr(tsk), tsk->comm,
  429. K(get_mm_counter(mm, MM_ANONPAGES)),
  430. K(get_mm_counter(mm, MM_FILEPAGES)),
  431. K(get_mm_counter(mm, MM_SHMEMPAGES)));
  432. up_read(&mm->mmap_sem);
  433. /*
  434. * Clear TIF_MEMDIE because the task shouldn't be sitting on a
  435. * reasonably reclaimable memory anymore. OOM killer can continue
  436. * by selecting other victim if unmapping hasn't led to any
  437. * improvements. This also means that selecting this task doesn't
  438. * make any sense.
  439. */
  440. tsk->signal->oom_score_adj = OOM_SCORE_ADJ_MIN;
  441. exit_oom_victim(tsk);
  442. out:
  443. mmput(mm);
  444. return ret;
  445. }
  446. #define MAX_OOM_REAP_RETRIES 10
  447. static void oom_reap_task(struct task_struct *tsk)
  448. {
  449. int attempts = 0;
  450. /* Retry the down_read_trylock(mmap_sem) a few times */
  451. while (attempts++ < MAX_OOM_REAP_RETRIES && !__oom_reap_task(tsk))
  452. schedule_timeout_idle(HZ/10);
  453. if (attempts > MAX_OOM_REAP_RETRIES) {
  454. pr_info("oom_reaper: unable to reap pid:%d (%s)\n",
  455. task_pid_nr(tsk), tsk->comm);
  456. debug_show_all_locks();
  457. }
  458. /* Drop a reference taken by wake_oom_reaper */
  459. put_task_struct(tsk);
  460. }
  461. static int oom_reaper(void *unused)
  462. {
  463. set_freezable();
  464. while (true) {
  465. struct task_struct *tsk = NULL;
  466. wait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL);
  467. spin_lock(&oom_reaper_lock);
  468. if (oom_reaper_list != NULL) {
  469. tsk = oom_reaper_list;
  470. oom_reaper_list = tsk->oom_reaper_list;
  471. }
  472. spin_unlock(&oom_reaper_lock);
  473. if (tsk)
  474. oom_reap_task(tsk);
  475. }
  476. return 0;
  477. }
  478. static void wake_oom_reaper(struct task_struct *tsk)
  479. {
  480. if (!oom_reaper_th || tsk->oom_reaper_list)
  481. return;
  482. get_task_struct(tsk);
  483. spin_lock(&oom_reaper_lock);
  484. tsk->oom_reaper_list = oom_reaper_list;
  485. oom_reaper_list = tsk;
  486. spin_unlock(&oom_reaper_lock);
  487. wake_up(&oom_reaper_wait);
  488. }
  489. static int __init oom_init(void)
  490. {
  491. oom_reaper_th = kthread_run(oom_reaper, NULL, "oom_reaper");
  492. if (IS_ERR(oom_reaper_th)) {
  493. pr_err("Unable to start OOM reaper %ld. Continuing regardless\n",
  494. PTR_ERR(oom_reaper_th));
  495. oom_reaper_th = NULL;
  496. }
  497. return 0;
  498. }
  499. subsys_initcall(oom_init)
  500. #else
  501. static void wake_oom_reaper(struct task_struct *tsk)
  502. {
  503. }
  504. #endif
  505. /**
  506. * mark_oom_victim - mark the given task as OOM victim
  507. * @tsk: task to mark
  508. *
  509. * Has to be called with oom_lock held and never after
  510. * oom has been disabled already.
  511. */
  512. void mark_oom_victim(struct task_struct *tsk)
  513. {
  514. WARN_ON(oom_killer_disabled);
  515. /* OOM killer might race with memcg OOM */
  516. if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))
  517. return;
  518. /*
  519. * Make sure that the task is woken up from uninterruptible sleep
  520. * if it is frozen because OOM killer wouldn't be able to free
  521. * any memory and livelock. freezing_slow_path will tell the freezer
  522. * that TIF_MEMDIE tasks should be ignored.
  523. */
  524. __thaw_task(tsk);
  525. atomic_inc(&oom_victims);
  526. }
  527. /**
  528. * exit_oom_victim - note the exit of an OOM victim
  529. */
  530. void exit_oom_victim(struct task_struct *tsk)
  531. {
  532. if (!test_and_clear_tsk_thread_flag(tsk, TIF_MEMDIE))
  533. return;
  534. if (!atomic_dec_return(&oom_victims))
  535. wake_up_all(&oom_victims_wait);
  536. }
  537. /**
  538. * oom_killer_disable - disable OOM killer
  539. *
  540. * Forces all page allocations to fail rather than trigger OOM killer.
  541. * Will block and wait until all OOM victims are killed.
  542. *
  543. * The function cannot be called when there are runnable user tasks because
  544. * the userspace would see unexpected allocation failures as a result. Any
  545. * new usage of this function should be consulted with MM people.
  546. *
  547. * Returns true if successful and false if the OOM killer cannot be
  548. * disabled.
  549. */
  550. bool oom_killer_disable(void)
  551. {
  552. /*
  553. * Make sure to not race with an ongoing OOM killer. Check that the
  554. * current is not killed (possibly due to sharing the victim's memory).
  555. */
  556. if (mutex_lock_killable(&oom_lock))
  557. return false;
  558. oom_killer_disabled = true;
  559. mutex_unlock(&oom_lock);
  560. wait_event(oom_victims_wait, !atomic_read(&oom_victims));
  561. return true;
  562. }
  563. /**
  564. * oom_killer_enable - enable OOM killer
  565. */
  566. void oom_killer_enable(void)
  567. {
  568. oom_killer_disabled = false;
  569. }
  570. /*
  571. * task->mm can be NULL if the task is the exited group leader. So to
  572. * determine whether the task is using a particular mm, we examine all the
  573. * task's threads: if one of those is using this mm then this task was also
  574. * using it.
  575. */
  576. static bool process_shares_mm(struct task_struct *p, struct mm_struct *mm)
  577. {
  578. struct task_struct *t;
  579. for_each_thread(p, t) {
  580. struct mm_struct *t_mm = READ_ONCE(t->mm);
  581. if (t_mm)
  582. return t_mm == mm;
  583. }
  584. return false;
  585. }
  586. /*
  587. * Must be called while holding a reference to p, which will be released upon
  588. * returning.
  589. */
  590. void oom_kill_process(struct oom_control *oc, struct task_struct *p,
  591. unsigned int points, unsigned long totalpages,
  592. struct mem_cgroup *memcg, const char *message)
  593. {
  594. struct task_struct *victim = p;
  595. struct task_struct *child;
  596. struct task_struct *t;
  597. struct mm_struct *mm;
  598. unsigned int victim_points = 0;
  599. static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
  600. DEFAULT_RATELIMIT_BURST);
  601. bool can_oom_reap = true;
  602. /*
  603. * If the task is already exiting, don't alarm the sysadmin or kill
  604. * its children or threads, just set TIF_MEMDIE so it can die quickly
  605. */
  606. task_lock(p);
  607. if (p->mm && task_will_free_mem(p)) {
  608. mark_oom_victim(p);
  609. task_unlock(p);
  610. put_task_struct(p);
  611. return;
  612. }
  613. task_unlock(p);
  614. if (__ratelimit(&oom_rs))
  615. dump_header(oc, p, memcg);
  616. pr_err("%s: Kill process %d (%s) score %u or sacrifice child\n",
  617. message, task_pid_nr(p), p->comm, points);
  618. /*
  619. * If any of p's children has a different mm and is eligible for kill,
  620. * the one with the highest oom_badness() score is sacrificed for its
  621. * parent. This attempts to lose the minimal amount of work done while
  622. * still freeing memory.
  623. */
  624. read_lock(&tasklist_lock);
  625. for_each_thread(p, t) {
  626. list_for_each_entry(child, &t->children, sibling) {
  627. unsigned int child_points;
  628. if (process_shares_mm(child, p->mm))
  629. continue;
  630. /*
  631. * oom_badness() returns 0 if the thread is unkillable
  632. */
  633. child_points = oom_badness(child, memcg, oc->nodemask,
  634. totalpages);
  635. if (child_points > victim_points) {
  636. put_task_struct(victim);
  637. victim = child;
  638. victim_points = child_points;
  639. get_task_struct(victim);
  640. }
  641. }
  642. }
  643. read_unlock(&tasklist_lock);
  644. p = find_lock_task_mm(victim);
  645. if (!p) {
  646. put_task_struct(victim);
  647. return;
  648. } else if (victim != p) {
  649. get_task_struct(p);
  650. put_task_struct(victim);
  651. victim = p;
  652. }
  653. /* Get a reference to safely compare mm after task_unlock(victim) */
  654. mm = victim->mm;
  655. atomic_inc(&mm->mm_count);
  656. /*
  657. * We should send SIGKILL before setting TIF_MEMDIE in order to prevent
  658. * the OOM victim from depleting the memory reserves from the user
  659. * space under its control.
  660. */
  661. do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
  662. mark_oom_victim(victim);
  663. pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
  664. task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
  665. K(get_mm_counter(victim->mm, MM_ANONPAGES)),
  666. K(get_mm_counter(victim->mm, MM_FILEPAGES)),
  667. K(get_mm_counter(victim->mm, MM_SHMEMPAGES)));
  668. task_unlock(victim);
  669. /*
  670. * Kill all user processes sharing victim->mm in other thread groups, if
  671. * any. They don't get access to memory reserves, though, to avoid
  672. * depletion of all memory. This prevents mm->mmap_sem livelock when an
  673. * oom killed thread cannot exit because it requires the semaphore and
  674. * its contended by another thread trying to allocate memory itself.
  675. * That thread will now get access to memory reserves since it has a
  676. * pending fatal signal.
  677. */
  678. rcu_read_lock();
  679. for_each_process(p) {
  680. if (!process_shares_mm(p, mm))
  681. continue;
  682. if (same_thread_group(p, victim))
  683. continue;
  684. if (unlikely(p->flags & PF_KTHREAD) || is_global_init(p) ||
  685. p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN) {
  686. /*
  687. * We cannot use oom_reaper for the mm shared by this
  688. * process because it wouldn't get killed and so the
  689. * memory might be still used.
  690. */
  691. can_oom_reap = false;
  692. continue;
  693. }
  694. do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
  695. }
  696. rcu_read_unlock();
  697. if (can_oom_reap)
  698. wake_oom_reaper(victim);
  699. mmdrop(mm);
  700. put_task_struct(victim);
  701. }
  702. #undef K
  703. /*
  704. * Determines whether the kernel must panic because of the panic_on_oom sysctl.
  705. */
  706. void check_panic_on_oom(struct oom_control *oc, enum oom_constraint constraint,
  707. struct mem_cgroup *memcg)
  708. {
  709. if (likely(!sysctl_panic_on_oom))
  710. return;
  711. if (sysctl_panic_on_oom != 2) {
  712. /*
  713. * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
  714. * does not panic for cpuset, mempolicy, or memcg allocation
  715. * failures.
  716. */
  717. if (constraint != CONSTRAINT_NONE)
  718. return;
  719. }
  720. /* Do not panic for oom kills triggered by sysrq */
  721. if (is_sysrq_oom(oc))
  722. return;
  723. dump_header(oc, NULL, memcg);
  724. panic("Out of memory: %s panic_on_oom is enabled\n",
  725. sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
  726. }
  727. static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
  728. int register_oom_notifier(struct notifier_block *nb)
  729. {
  730. return blocking_notifier_chain_register(&oom_notify_list, nb);
  731. }
  732. EXPORT_SYMBOL_GPL(register_oom_notifier);
  733. int unregister_oom_notifier(struct notifier_block *nb)
  734. {
  735. return blocking_notifier_chain_unregister(&oom_notify_list, nb);
  736. }
  737. EXPORT_SYMBOL_GPL(unregister_oom_notifier);
  738. /**
  739. * out_of_memory - kill the "best" process when we run out of memory
  740. * @oc: pointer to struct oom_control
  741. *
  742. * If we run out of memory, we have the choice between either
  743. * killing a random task (bad), letting the system crash (worse)
  744. * OR try to be smart about which process to kill. Note that we
  745. * don't have to be perfect here, we just have to be good.
  746. */
  747. bool out_of_memory(struct oom_control *oc)
  748. {
  749. struct task_struct *p;
  750. unsigned long totalpages;
  751. unsigned long freed = 0;
  752. unsigned int uninitialized_var(points);
  753. enum oom_constraint constraint = CONSTRAINT_NONE;
  754. if (oom_killer_disabled)
  755. return false;
  756. blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
  757. if (freed > 0)
  758. /* Got some memory back in the last second. */
  759. return true;
  760. /*
  761. * If current has a pending SIGKILL or is exiting, then automatically
  762. * select it. The goal is to allow it to allocate so that it may
  763. * quickly exit and free its memory.
  764. *
  765. * But don't select if current has already released its mm and cleared
  766. * TIF_MEMDIE flag at exit_mm(), otherwise an OOM livelock may occur.
  767. */
  768. if (current->mm &&
  769. (fatal_signal_pending(current) || task_will_free_mem(current))) {
  770. mark_oom_victim(current);
  771. return true;
  772. }
  773. /*
  774. * Check if there were limitations on the allocation (only relevant for
  775. * NUMA) that may require different handling.
  776. */
  777. constraint = constrained_alloc(oc, &totalpages);
  778. if (constraint != CONSTRAINT_MEMORY_POLICY)
  779. oc->nodemask = NULL;
  780. check_panic_on_oom(oc, constraint, NULL);
  781. if (sysctl_oom_kill_allocating_task && current->mm &&
  782. !oom_unkillable_task(current, NULL, oc->nodemask) &&
  783. current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
  784. get_task_struct(current);
  785. oom_kill_process(oc, current, 0, totalpages, NULL,
  786. "Out of memory (oom_kill_allocating_task)");
  787. return true;
  788. }
  789. p = select_bad_process(oc, &points, totalpages);
  790. /* Found nothing?!?! Either we hang forever, or we panic. */
  791. if (!p && !is_sysrq_oom(oc)) {
  792. dump_header(oc, NULL, NULL);
  793. panic("Out of memory and no killable processes...\n");
  794. }
  795. if (p && p != (void *)-1UL) {
  796. oom_kill_process(oc, p, points, totalpages, NULL,
  797. "Out of memory");
  798. /*
  799. * Give the killed process a good chance to exit before trying
  800. * to allocate memory again.
  801. */
  802. schedule_timeout_killable(1);
  803. }
  804. return true;
  805. }
  806. /*
  807. * The pagefault handler calls here because it is out of memory, so kill a
  808. * memory-hogging task. If any populated zone has ZONE_OOM_LOCKED set, a
  809. * parallel oom killing is already in progress so do nothing.
  810. */
  811. void pagefault_out_of_memory(void)
  812. {
  813. struct oom_control oc = {
  814. .zonelist = NULL,
  815. .nodemask = NULL,
  816. .gfp_mask = 0,
  817. .order = 0,
  818. };
  819. if (mem_cgroup_oom_synchronize(true))
  820. return;
  821. if (!mutex_trylock(&oom_lock))
  822. return;
  823. if (!out_of_memory(&oc)) {
  824. /*
  825. * There shouldn't be any user tasks runnable while the
  826. * OOM killer is disabled, so the current task has to
  827. * be a racing OOM victim for which oom_killer_disable()
  828. * is waiting for.
  829. */
  830. WARN_ON(test_thread_flag(TIF_MEMDIE));
  831. }
  832. mutex_unlock(&oom_lock);
  833. }