oom_kill.c 22 KB

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