oom_kill.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029
  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. /*
  157. * Do not even consider tasks which are explicitly marked oom
  158. * unkillable or have been already oom reaped.
  159. */
  160. adj = (long)p->signal->oom_score_adj;
  161. if (adj == OOM_SCORE_ADJ_MIN ||
  162. test_bit(MMF_OOM_REAPED, &p->mm->flags)) {
  163. task_unlock(p);
  164. return 0;
  165. }
  166. /*
  167. * The baseline for the badness score is the proportion of RAM that each
  168. * task's rss, pagetable and swap space use.
  169. */
  170. points = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) +
  171. atomic_long_read(&p->mm->nr_ptes) + mm_nr_pmds(p->mm);
  172. task_unlock(p);
  173. /*
  174. * Root processes get 3% bonus, just like the __vm_enough_memory()
  175. * implementation used by LSMs.
  176. */
  177. if (has_capability_noaudit(p, CAP_SYS_ADMIN))
  178. points -= (points * 3) / 100;
  179. /* Normalize to oom_score_adj units */
  180. adj *= totalpages / 1000;
  181. points += adj;
  182. /*
  183. * Never return 0 for an eligible task regardless of the root bonus and
  184. * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).
  185. */
  186. return points > 0 ? points : 1;
  187. }
  188. /*
  189. * Determine the type of allocation constraint.
  190. */
  191. #ifdef CONFIG_NUMA
  192. static enum oom_constraint constrained_alloc(struct oom_control *oc,
  193. unsigned long *totalpages)
  194. {
  195. struct zone *zone;
  196. struct zoneref *z;
  197. enum zone_type high_zoneidx = gfp_zone(oc->gfp_mask);
  198. bool cpuset_limited = false;
  199. int nid;
  200. /* Default to all available memory */
  201. *totalpages = totalram_pages + total_swap_pages;
  202. if (!oc->zonelist)
  203. return CONSTRAINT_NONE;
  204. /*
  205. * Reach here only when __GFP_NOFAIL is used. So, we should avoid
  206. * to kill current.We have to random task kill in this case.
  207. * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
  208. */
  209. if (oc->gfp_mask & __GFP_THISNODE)
  210. return CONSTRAINT_NONE;
  211. /*
  212. * This is not a __GFP_THISNODE allocation, so a truncated nodemask in
  213. * the page allocator means a mempolicy is in effect. Cpuset policy
  214. * is enforced in get_page_from_freelist().
  215. */
  216. if (oc->nodemask &&
  217. !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {
  218. *totalpages = total_swap_pages;
  219. for_each_node_mask(nid, *oc->nodemask)
  220. *totalpages += node_spanned_pages(nid);
  221. return CONSTRAINT_MEMORY_POLICY;
  222. }
  223. /* Check this allocation failure is caused by cpuset's wall function */
  224. for_each_zone_zonelist_nodemask(zone, z, oc->zonelist,
  225. high_zoneidx, oc->nodemask)
  226. if (!cpuset_zone_allowed(zone, oc->gfp_mask))
  227. cpuset_limited = true;
  228. if (cpuset_limited) {
  229. *totalpages = total_swap_pages;
  230. for_each_node_mask(nid, cpuset_current_mems_allowed)
  231. *totalpages += node_spanned_pages(nid);
  232. return CONSTRAINT_CPUSET;
  233. }
  234. return CONSTRAINT_NONE;
  235. }
  236. #else
  237. static enum oom_constraint constrained_alloc(struct oom_control *oc,
  238. unsigned long *totalpages)
  239. {
  240. *totalpages = totalram_pages + total_swap_pages;
  241. return CONSTRAINT_NONE;
  242. }
  243. #endif
  244. enum oom_scan_t oom_scan_process_thread(struct oom_control *oc,
  245. struct task_struct *task)
  246. {
  247. if (oom_unkillable_task(task, NULL, oc->nodemask))
  248. return OOM_SCAN_CONTINUE;
  249. /*
  250. * This task already has access to memory reserves and is being killed.
  251. * Don't allow any other task to have access to the reserves.
  252. */
  253. if (!is_sysrq_oom(oc) && atomic_read(&task->signal->oom_victims))
  254. return OOM_SCAN_ABORT;
  255. /*
  256. * If task is allocating a lot of memory and has been marked to be
  257. * killed first if it triggers an oom, then select it.
  258. */
  259. if (oom_task_origin(task))
  260. return OOM_SCAN_SELECT;
  261. return OOM_SCAN_OK;
  262. }
  263. /*
  264. * Simple selection loop. We chose the process with the highest
  265. * number of 'points'. Returns -1 on scan abort.
  266. */
  267. static struct task_struct *select_bad_process(struct oom_control *oc,
  268. unsigned int *ppoints, unsigned long totalpages)
  269. {
  270. struct task_struct *p;
  271. struct task_struct *chosen = NULL;
  272. unsigned long chosen_points = 0;
  273. rcu_read_lock();
  274. for_each_process(p) {
  275. unsigned int points;
  276. switch (oom_scan_process_thread(oc, p)) {
  277. case OOM_SCAN_SELECT:
  278. chosen = p;
  279. chosen_points = ULONG_MAX;
  280. /* fall through */
  281. case OOM_SCAN_CONTINUE:
  282. continue;
  283. case OOM_SCAN_ABORT:
  284. rcu_read_unlock();
  285. return (struct task_struct *)(-1UL);
  286. case OOM_SCAN_OK:
  287. break;
  288. };
  289. points = oom_badness(p, NULL, oc->nodemask, totalpages);
  290. if (!points || points < chosen_points)
  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. {
  343. pr_warn("%s invoked oom-killer: gfp_mask=%#x(%pGg), order=%d, oom_score_adj=%hd\n",
  344. current->comm, oc->gfp_mask, &oc->gfp_mask, oc->order,
  345. current->signal->oom_score_adj);
  346. cpuset_print_current_mems_allowed();
  347. dump_stack();
  348. if (oc->memcg)
  349. mem_cgroup_print_oom_info(oc->memcg, p);
  350. else
  351. show_mem(SHOW_MEM_FILTER_NODES);
  352. if (sysctl_oom_dump_tasks)
  353. dump_tasks(oc->memcg, oc->nodemask);
  354. }
  355. /*
  356. * Number of OOM victims in flight
  357. */
  358. static atomic_t oom_victims = ATOMIC_INIT(0);
  359. static DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);
  360. bool oom_killer_disabled __read_mostly;
  361. #define K(x) ((x) << (PAGE_SHIFT-10))
  362. /*
  363. * task->mm can be NULL if the task is the exited group leader. So to
  364. * determine whether the task is using a particular mm, we examine all the
  365. * task's threads: if one of those is using this mm then this task was also
  366. * using it.
  367. */
  368. static bool process_shares_mm(struct task_struct *p, struct mm_struct *mm)
  369. {
  370. struct task_struct *t;
  371. for_each_thread(p, t) {
  372. struct mm_struct *t_mm = READ_ONCE(t->mm);
  373. if (t_mm)
  374. return t_mm == mm;
  375. }
  376. return false;
  377. }
  378. #ifdef CONFIG_MMU
  379. /*
  380. * OOM Reaper kernel thread which tries to reap the memory used by the OOM
  381. * victim (if that is possible) to help the OOM killer to move on.
  382. */
  383. static struct task_struct *oom_reaper_th;
  384. static DECLARE_WAIT_QUEUE_HEAD(oom_reaper_wait);
  385. static struct task_struct *oom_reaper_list;
  386. static DEFINE_SPINLOCK(oom_reaper_lock);
  387. static bool __oom_reap_task(struct task_struct *tsk)
  388. {
  389. struct mmu_gather tlb;
  390. struct vm_area_struct *vma;
  391. struct mm_struct *mm = NULL;
  392. struct task_struct *p;
  393. struct zap_details details = {.check_swap_entries = true,
  394. .ignore_dirty = true};
  395. bool ret = true;
  396. /*
  397. * We have to make sure to not race with the victim exit path
  398. * and cause premature new oom victim selection:
  399. * __oom_reap_task exit_mm
  400. * mmget_not_zero
  401. * mmput
  402. * atomic_dec_and_test
  403. * exit_oom_victim
  404. * [...]
  405. * out_of_memory
  406. * select_bad_process
  407. * # no TIF_MEMDIE task selects new victim
  408. * unmap_page_range # frees some memory
  409. */
  410. mutex_lock(&oom_lock);
  411. /*
  412. * Make sure we find the associated mm_struct even when the particular
  413. * thread has already terminated and cleared its mm.
  414. * We might have race with exit path so consider our work done if there
  415. * is no mm.
  416. */
  417. p = find_lock_task_mm(tsk);
  418. if (!p)
  419. goto unlock_oom;
  420. mm = p->mm;
  421. atomic_inc(&mm->mm_count);
  422. task_unlock(p);
  423. if (!down_read_trylock(&mm->mmap_sem)) {
  424. ret = false;
  425. goto mm_drop;
  426. }
  427. /*
  428. * increase mm_users only after we know we will reap something so
  429. * that the mmput_async is called only when we have reaped something
  430. * and delayed __mmput doesn't matter that much
  431. */
  432. if (!mmget_not_zero(mm)) {
  433. up_read(&mm->mmap_sem);
  434. goto mm_drop;
  435. }
  436. tlb_gather_mmu(&tlb, mm, 0, -1);
  437. for (vma = mm->mmap ; vma; vma = vma->vm_next) {
  438. if (is_vm_hugetlb_page(vma))
  439. continue;
  440. /*
  441. * mlocked VMAs require explicit munlocking before unmap.
  442. * Let's keep it simple here and skip such VMAs.
  443. */
  444. if (vma->vm_flags & VM_LOCKED)
  445. continue;
  446. /*
  447. * Only anonymous pages have a good chance to be dropped
  448. * without additional steps which we cannot afford as we
  449. * are OOM already.
  450. *
  451. * We do not even care about fs backed pages because all
  452. * which are reclaimable have already been reclaimed and
  453. * we do not want to block exit_mmap by keeping mm ref
  454. * count elevated without a good reason.
  455. */
  456. if (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED))
  457. unmap_page_range(&tlb, vma, vma->vm_start, vma->vm_end,
  458. &details);
  459. }
  460. tlb_finish_mmu(&tlb, 0, -1);
  461. pr_info("oom_reaper: reaped process %d (%s), now anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
  462. task_pid_nr(tsk), tsk->comm,
  463. K(get_mm_counter(mm, MM_ANONPAGES)),
  464. K(get_mm_counter(mm, MM_FILEPAGES)),
  465. K(get_mm_counter(mm, MM_SHMEMPAGES)));
  466. up_read(&mm->mmap_sem);
  467. /*
  468. * This task can be safely ignored because we cannot do much more
  469. * to release its memory.
  470. */
  471. set_bit(MMF_OOM_REAPED, &mm->flags);
  472. /*
  473. * Drop our reference but make sure the mmput slow path is called from a
  474. * different context because we shouldn't risk we get stuck there and
  475. * put the oom_reaper out of the way.
  476. */
  477. mmput_async(mm);
  478. mm_drop:
  479. mmdrop(mm);
  480. unlock_oom:
  481. mutex_unlock(&oom_lock);
  482. return ret;
  483. }
  484. #define MAX_OOM_REAP_RETRIES 10
  485. static void oom_reap_task(struct task_struct *tsk)
  486. {
  487. int attempts = 0;
  488. /* Retry the down_read_trylock(mmap_sem) a few times */
  489. while (attempts++ < MAX_OOM_REAP_RETRIES && !__oom_reap_task(tsk))
  490. schedule_timeout_idle(HZ/10);
  491. if (attempts > MAX_OOM_REAP_RETRIES) {
  492. pr_info("oom_reaper: unable to reap pid:%d (%s)\n",
  493. task_pid_nr(tsk), tsk->comm);
  494. debug_show_all_locks();
  495. }
  496. /*
  497. * Clear TIF_MEMDIE because the task shouldn't be sitting on a
  498. * reasonably reclaimable memory anymore or it is not a good candidate
  499. * for the oom victim right now because it cannot release its memory
  500. * itself nor by the oom reaper.
  501. */
  502. tsk->oom_reaper_list = NULL;
  503. exit_oom_victim(tsk);
  504. /* Drop a reference taken by wake_oom_reaper */
  505. put_task_struct(tsk);
  506. }
  507. static int oom_reaper(void *unused)
  508. {
  509. set_freezable();
  510. while (true) {
  511. struct task_struct *tsk = NULL;
  512. wait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL);
  513. spin_lock(&oom_reaper_lock);
  514. if (oom_reaper_list != NULL) {
  515. tsk = oom_reaper_list;
  516. oom_reaper_list = tsk->oom_reaper_list;
  517. }
  518. spin_unlock(&oom_reaper_lock);
  519. if (tsk)
  520. oom_reap_task(tsk);
  521. }
  522. return 0;
  523. }
  524. static void wake_oom_reaper(struct task_struct *tsk)
  525. {
  526. if (!oom_reaper_th)
  527. return;
  528. /* tsk is already queued? */
  529. if (tsk == oom_reaper_list || tsk->oom_reaper_list)
  530. return;
  531. get_task_struct(tsk);
  532. spin_lock(&oom_reaper_lock);
  533. tsk->oom_reaper_list = oom_reaper_list;
  534. oom_reaper_list = tsk;
  535. spin_unlock(&oom_reaper_lock);
  536. wake_up(&oom_reaper_wait);
  537. }
  538. /* Check if we can reap the given task. This has to be called with stable
  539. * tsk->mm
  540. */
  541. void try_oom_reaper(struct task_struct *tsk)
  542. {
  543. struct mm_struct *mm = tsk->mm;
  544. struct task_struct *p;
  545. if (!mm)
  546. return;
  547. /*
  548. * There might be other threads/processes which are either not
  549. * dying or even not killable.
  550. */
  551. if (atomic_read(&mm->mm_users) > 1) {
  552. rcu_read_lock();
  553. for_each_process(p) {
  554. if (!process_shares_mm(p, mm))
  555. continue;
  556. if (fatal_signal_pending(p))
  557. continue;
  558. /*
  559. * If the task is exiting make sure the whole thread group
  560. * is exiting and cannot acces mm anymore.
  561. */
  562. if (signal_group_exit(p->signal))
  563. continue;
  564. /* Give up */
  565. rcu_read_unlock();
  566. return;
  567. }
  568. rcu_read_unlock();
  569. }
  570. wake_oom_reaper(tsk);
  571. }
  572. static int __init oom_init(void)
  573. {
  574. oom_reaper_th = kthread_run(oom_reaper, NULL, "oom_reaper");
  575. if (IS_ERR(oom_reaper_th)) {
  576. pr_err("Unable to start OOM reaper %ld. Continuing regardless\n",
  577. PTR_ERR(oom_reaper_th));
  578. oom_reaper_th = NULL;
  579. }
  580. return 0;
  581. }
  582. subsys_initcall(oom_init)
  583. #else
  584. static void wake_oom_reaper(struct task_struct *tsk)
  585. {
  586. }
  587. #endif
  588. /**
  589. * mark_oom_victim - mark the given task as OOM victim
  590. * @tsk: task to mark
  591. *
  592. * Has to be called with oom_lock held and never after
  593. * oom has been disabled already.
  594. */
  595. void mark_oom_victim(struct task_struct *tsk)
  596. {
  597. WARN_ON(oom_killer_disabled);
  598. /* OOM killer might race with memcg OOM */
  599. if (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))
  600. return;
  601. atomic_inc(&tsk->signal->oom_victims);
  602. /*
  603. * Make sure that the task is woken up from uninterruptible sleep
  604. * if it is frozen because OOM killer wouldn't be able to free
  605. * any memory and livelock. freezing_slow_path will tell the freezer
  606. * that TIF_MEMDIE tasks should be ignored.
  607. */
  608. __thaw_task(tsk);
  609. atomic_inc(&oom_victims);
  610. }
  611. /**
  612. * exit_oom_victim - note the exit of an OOM victim
  613. */
  614. void exit_oom_victim(struct task_struct *tsk)
  615. {
  616. if (!test_and_clear_tsk_thread_flag(tsk, TIF_MEMDIE))
  617. return;
  618. atomic_dec(&tsk->signal->oom_victims);
  619. if (!atomic_dec_return(&oom_victims))
  620. wake_up_all(&oom_victims_wait);
  621. }
  622. /**
  623. * oom_killer_disable - disable OOM killer
  624. *
  625. * Forces all page allocations to fail rather than trigger OOM killer.
  626. * Will block and wait until all OOM victims are killed.
  627. *
  628. * The function cannot be called when there are runnable user tasks because
  629. * the userspace would see unexpected allocation failures as a result. Any
  630. * new usage of this function should be consulted with MM people.
  631. *
  632. * Returns true if successful and false if the OOM killer cannot be
  633. * disabled.
  634. */
  635. bool oom_killer_disable(void)
  636. {
  637. /*
  638. * Make sure to not race with an ongoing OOM killer. Check that the
  639. * current is not killed (possibly due to sharing the victim's memory).
  640. */
  641. if (mutex_lock_killable(&oom_lock))
  642. return false;
  643. oom_killer_disabled = true;
  644. mutex_unlock(&oom_lock);
  645. wait_event(oom_victims_wait, !atomic_read(&oom_victims));
  646. return true;
  647. }
  648. /**
  649. * oom_killer_enable - enable OOM killer
  650. */
  651. void oom_killer_enable(void)
  652. {
  653. oom_killer_disabled = false;
  654. }
  655. /*
  656. * Must be called while holding a reference to p, which will be released upon
  657. * returning.
  658. */
  659. void oom_kill_process(struct oom_control *oc, struct task_struct *p,
  660. unsigned int points, unsigned long totalpages,
  661. const char *message)
  662. {
  663. struct task_struct *victim = p;
  664. struct task_struct *child;
  665. struct task_struct *t;
  666. struct mm_struct *mm;
  667. unsigned int victim_points = 0;
  668. static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
  669. DEFAULT_RATELIMIT_BURST);
  670. bool can_oom_reap = true;
  671. /*
  672. * If the task is already exiting, don't alarm the sysadmin or kill
  673. * its children or threads, just set TIF_MEMDIE so it can die quickly
  674. */
  675. task_lock(p);
  676. if (p->mm && task_will_free_mem(p)) {
  677. mark_oom_victim(p);
  678. try_oom_reaper(p);
  679. task_unlock(p);
  680. put_task_struct(p);
  681. return;
  682. }
  683. task_unlock(p);
  684. if (__ratelimit(&oom_rs))
  685. dump_header(oc, p);
  686. pr_err("%s: Kill process %d (%s) score %u or sacrifice child\n",
  687. message, task_pid_nr(p), p->comm, points);
  688. /*
  689. * If any of p's children has a different mm and is eligible for kill,
  690. * the one with the highest oom_badness() score is sacrificed for its
  691. * parent. This attempts to lose the minimal amount of work done while
  692. * still freeing memory.
  693. */
  694. read_lock(&tasklist_lock);
  695. for_each_thread(p, t) {
  696. list_for_each_entry(child, &t->children, sibling) {
  697. unsigned int child_points;
  698. if (process_shares_mm(child, p->mm))
  699. continue;
  700. /*
  701. * oom_badness() returns 0 if the thread is unkillable
  702. */
  703. child_points = oom_badness(child,
  704. oc->memcg, oc->nodemask, totalpages);
  705. if (child_points > victim_points) {
  706. put_task_struct(victim);
  707. victim = child;
  708. victim_points = child_points;
  709. get_task_struct(victim);
  710. }
  711. }
  712. }
  713. read_unlock(&tasklist_lock);
  714. p = find_lock_task_mm(victim);
  715. if (!p) {
  716. put_task_struct(victim);
  717. return;
  718. } else if (victim != p) {
  719. get_task_struct(p);
  720. put_task_struct(victim);
  721. victim = p;
  722. }
  723. /* Get a reference to safely compare mm after task_unlock(victim) */
  724. mm = victim->mm;
  725. atomic_inc(&mm->mm_count);
  726. /*
  727. * We should send SIGKILL before setting TIF_MEMDIE in order to prevent
  728. * the OOM victim from depleting the memory reserves from the user
  729. * space under its control.
  730. */
  731. do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
  732. mark_oom_victim(victim);
  733. pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\n",
  734. task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
  735. K(get_mm_counter(victim->mm, MM_ANONPAGES)),
  736. K(get_mm_counter(victim->mm, MM_FILEPAGES)),
  737. K(get_mm_counter(victim->mm, MM_SHMEMPAGES)));
  738. task_unlock(victim);
  739. /*
  740. * Kill all user processes sharing victim->mm in other thread groups, if
  741. * any. They don't get access to memory reserves, though, to avoid
  742. * depletion of all memory. This prevents mm->mmap_sem livelock when an
  743. * oom killed thread cannot exit because it requires the semaphore and
  744. * its contended by another thread trying to allocate memory itself.
  745. * That thread will now get access to memory reserves since it has a
  746. * pending fatal signal.
  747. */
  748. rcu_read_lock();
  749. for_each_process(p) {
  750. if (!process_shares_mm(p, mm))
  751. continue;
  752. if (same_thread_group(p, victim))
  753. continue;
  754. if (unlikely(p->flags & PF_KTHREAD) || is_global_init(p) ||
  755. p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN) {
  756. /*
  757. * We cannot use oom_reaper for the mm shared by this
  758. * process because it wouldn't get killed and so the
  759. * memory might be still used.
  760. */
  761. can_oom_reap = false;
  762. continue;
  763. }
  764. do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
  765. }
  766. rcu_read_unlock();
  767. if (can_oom_reap)
  768. wake_oom_reaper(victim);
  769. mmdrop(mm);
  770. put_task_struct(victim);
  771. }
  772. #undef K
  773. /*
  774. * Determines whether the kernel must panic because of the panic_on_oom sysctl.
  775. */
  776. void check_panic_on_oom(struct oom_control *oc, enum oom_constraint constraint)
  777. {
  778. if (likely(!sysctl_panic_on_oom))
  779. return;
  780. if (sysctl_panic_on_oom != 2) {
  781. /*
  782. * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
  783. * does not panic for cpuset, mempolicy, or memcg allocation
  784. * failures.
  785. */
  786. if (constraint != CONSTRAINT_NONE)
  787. return;
  788. }
  789. /* Do not panic for oom kills triggered by sysrq */
  790. if (is_sysrq_oom(oc))
  791. return;
  792. dump_header(oc, NULL);
  793. panic("Out of memory: %s panic_on_oom is enabled\n",
  794. sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
  795. }
  796. static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
  797. int register_oom_notifier(struct notifier_block *nb)
  798. {
  799. return blocking_notifier_chain_register(&oom_notify_list, nb);
  800. }
  801. EXPORT_SYMBOL_GPL(register_oom_notifier);
  802. int unregister_oom_notifier(struct notifier_block *nb)
  803. {
  804. return blocking_notifier_chain_unregister(&oom_notify_list, nb);
  805. }
  806. EXPORT_SYMBOL_GPL(unregister_oom_notifier);
  807. /**
  808. * out_of_memory - kill the "best" process when we run out of memory
  809. * @oc: pointer to struct oom_control
  810. *
  811. * If we run out of memory, we have the choice between either
  812. * killing a random task (bad), letting the system crash (worse)
  813. * OR try to be smart about which process to kill. Note that we
  814. * don't have to be perfect here, we just have to be good.
  815. */
  816. bool out_of_memory(struct oom_control *oc)
  817. {
  818. struct task_struct *p;
  819. unsigned long totalpages;
  820. unsigned long freed = 0;
  821. unsigned int uninitialized_var(points);
  822. enum oom_constraint constraint = CONSTRAINT_NONE;
  823. if (oom_killer_disabled)
  824. return false;
  825. blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
  826. if (freed > 0)
  827. /* Got some memory back in the last second. */
  828. return true;
  829. /*
  830. * If current has a pending SIGKILL or is exiting, then automatically
  831. * select it. The goal is to allow it to allocate so that it may
  832. * quickly exit and free its memory.
  833. *
  834. * But don't select if current has already released its mm and cleared
  835. * TIF_MEMDIE flag at exit_mm(), otherwise an OOM livelock may occur.
  836. */
  837. if (current->mm &&
  838. (fatal_signal_pending(current) || task_will_free_mem(current))) {
  839. mark_oom_victim(current);
  840. try_oom_reaper(current);
  841. return true;
  842. }
  843. /*
  844. * The OOM killer does not compensate for IO-less reclaim.
  845. * pagefault_out_of_memory lost its gfp context so we have to
  846. * make sure exclude 0 mask - all other users should have at least
  847. * ___GFP_DIRECT_RECLAIM to get here.
  848. */
  849. if (oc->gfp_mask && !(oc->gfp_mask & (__GFP_FS|__GFP_NOFAIL)))
  850. return true;
  851. /*
  852. * Check if there were limitations on the allocation (only relevant for
  853. * NUMA) that may require different handling.
  854. */
  855. constraint = constrained_alloc(oc, &totalpages);
  856. if (constraint != CONSTRAINT_MEMORY_POLICY)
  857. oc->nodemask = NULL;
  858. check_panic_on_oom(oc, constraint);
  859. if (sysctl_oom_kill_allocating_task && current->mm &&
  860. !oom_unkillable_task(current, NULL, oc->nodemask) &&
  861. current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
  862. get_task_struct(current);
  863. oom_kill_process(oc, current, 0, totalpages,
  864. "Out of memory (oom_kill_allocating_task)");
  865. return true;
  866. }
  867. p = select_bad_process(oc, &points, totalpages);
  868. /* Found nothing?!?! Either we hang forever, or we panic. */
  869. if (!p && !is_sysrq_oom(oc)) {
  870. dump_header(oc, NULL);
  871. panic("Out of memory and no killable processes...\n");
  872. }
  873. if (p && p != (void *)-1UL) {
  874. oom_kill_process(oc, p, points, totalpages, "Out of memory");
  875. /*
  876. * Give the killed process a good chance to exit before trying
  877. * to allocate memory again.
  878. */
  879. schedule_timeout_killable(1);
  880. }
  881. return true;
  882. }
  883. /*
  884. * The pagefault handler calls here because it is out of memory, so kill a
  885. * memory-hogging task. If oom_lock is held by somebody else, a parallel oom
  886. * killing is already in progress so do nothing.
  887. */
  888. void pagefault_out_of_memory(void)
  889. {
  890. struct oom_control oc = {
  891. .zonelist = NULL,
  892. .nodemask = NULL,
  893. .memcg = NULL,
  894. .gfp_mask = 0,
  895. .order = 0,
  896. };
  897. if (mem_cgroup_oom_synchronize(true))
  898. return;
  899. if (!mutex_trylock(&oom_lock))
  900. return;
  901. if (!out_of_memory(&oc)) {
  902. /*
  903. * There shouldn't be any user tasks runnable while the
  904. * OOM killer is disabled, so the current task has to
  905. * be a racing OOM victim for which oom_killer_disable()
  906. * is waiting for.
  907. */
  908. WARN_ON(test_thread_flag(TIF_MEMDIE));
  909. }
  910. mutex_unlock(&oom_lock);
  911. }