vmpressure.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570
  1. /*
  2. * Linux VM pressure
  3. *
  4. * Copyright 2012 Linaro Ltd.
  5. * Anton Vorontsov <[email protected]>
  6. *
  7. * Based on ideas from Andrew Morton, David Rientjes, KOSAKI Motohiro,
  8. * Leonid Moiseichuk, Mel Gorman, Minchan Kim and Pekka Enberg.
  9. *
  10. * This program is free software; you can redistribute it and/or modify it
  11. * under the terms of the GNU General Public License version 2 as published
  12. * by the Free Software Foundation.
  13. */
  14. #include <linux/cgroup.h>
  15. #include <linux/fs.h>
  16. #include <linux/log2.h>
  17. #include <linux/sched.h>
  18. #include <linux/mm.h>
  19. #include <linux/vmstat.h>
  20. #include <linux/eventfd.h>
  21. #include <linux/slab.h>
  22. #include <linux/swap.h>
  23. #include <linux/printk.h>
  24. #include <linux/notifier.h>
  25. #include <linux/init.h>
  26. #include <linux/module.h>
  27. #include <linux/vmpressure.h>
  28. /*
  29. * The window size (vmpressure_win) is the number of scanned pages before
  30. * we try to analyze scanned/reclaimed ratio. So the window is used as a
  31. * rate-limit tunable for the "low" level notification, and also for
  32. * averaging the ratio for medium/critical levels. Using small window
  33. * sizes can cause lot of false positives, but too big window size will
  34. * delay the notifications.
  35. *
  36. * As the vmscan reclaimer logic works with chunks which are multiple of
  37. * SWAP_CLUSTER_MAX, it makes sense to use it for the window size as well.
  38. *
  39. * TODO: Make the window size depend on machine size, as we do for vmstat
  40. * thresholds. Currently we set it to 512 pages (2MB for 4KB pages).
  41. */
  42. static unsigned long vmpressure_win = SWAP_CLUSTER_MAX * 16;
  43. /*
  44. * These thresholds are used when we account memory pressure through
  45. * scanned/reclaimed ratio. The current values were chosen empirically. In
  46. * essence, they are percents: the higher the value, the more number
  47. * unsuccessful reclaims there were.
  48. */
  49. static const unsigned int vmpressure_level_med = 60;
  50. static const unsigned int vmpressure_level_critical = 95;
  51. static unsigned long vmpressure_scale_max = 100;
  52. module_param_named(vmpressure_scale_max, vmpressure_scale_max,
  53. ulong, 0644);
  54. /* vmpressure values >= this will be scaled based on allocstalls */
  55. static unsigned long allocstall_threshold = 70;
  56. module_param_named(allocstall_threshold, allocstall_threshold,
  57. ulong, 0644);
  58. static struct vmpressure global_vmpressure;
  59. static BLOCKING_NOTIFIER_HEAD(vmpressure_notifier);
  60. int vmpressure_notifier_register(struct notifier_block *nb)
  61. {
  62. return blocking_notifier_chain_register(&vmpressure_notifier, nb);
  63. }
  64. int vmpressure_notifier_unregister(struct notifier_block *nb)
  65. {
  66. return blocking_notifier_chain_unregister(&vmpressure_notifier, nb);
  67. }
  68. static void vmpressure_notify(unsigned long pressure)
  69. {
  70. blocking_notifier_call_chain(&vmpressure_notifier, pressure, NULL);
  71. }
  72. /*
  73. * When there are too little pages left to scan, vmpressure() may miss the
  74. * critical pressure as number of pages will be less than "window size".
  75. * However, in that case the vmscan priority will raise fast as the
  76. * reclaimer will try to scan LRUs more deeply.
  77. *
  78. * The vmscan logic considers these special priorities:
  79. *
  80. * prio == DEF_PRIORITY (12): reclaimer starts with that value
  81. * prio <= DEF_PRIORITY - 2 : kswapd becomes somewhat overwhelmed
  82. * prio == 0 : close to OOM, kernel scans every page in an lru
  83. *
  84. * Any value in this range is acceptable for this tunable (i.e. from 12 to
  85. * 0). Current value for the vmpressure_level_critical_prio is chosen
  86. * empirically, but the number, in essence, means that we consider
  87. * critical level when scanning depth is ~10% of the lru size (vmscan
  88. * scans 'lru_size >> prio' pages, so it is actually 12.5%, or one
  89. * eights).
  90. */
  91. static const unsigned int vmpressure_level_critical_prio = ilog2(100 / 10);
  92. static struct vmpressure *work_to_vmpressure(struct work_struct *work)
  93. {
  94. return container_of(work, struct vmpressure, work);
  95. }
  96. #ifdef CONFIG_MEMCG
  97. static struct vmpressure *vmpressure_parent(struct vmpressure *vmpr)
  98. {
  99. struct cgroup_subsys_state *css = vmpressure_to_css(vmpr);
  100. struct mem_cgroup *memcg = mem_cgroup_from_css(css);
  101. memcg = parent_mem_cgroup(memcg);
  102. if (!memcg)
  103. return NULL;
  104. return memcg_to_vmpressure(memcg);
  105. }
  106. #else
  107. static struct vmpressure *vmpressure_parent(struct vmpressure *vmpr)
  108. {
  109. return NULL;
  110. }
  111. #endif
  112. enum vmpressure_levels {
  113. VMPRESSURE_LOW = 0,
  114. VMPRESSURE_MEDIUM,
  115. VMPRESSURE_CRITICAL,
  116. VMPRESSURE_NUM_LEVELS,
  117. };
  118. static const char * const vmpressure_str_levels[] = {
  119. [VMPRESSURE_LOW] = "low",
  120. [VMPRESSURE_MEDIUM] = "medium",
  121. [VMPRESSURE_CRITICAL] = "critical",
  122. };
  123. static enum vmpressure_levels vmpressure_level(unsigned long pressure)
  124. {
  125. if (pressure >= vmpressure_level_critical)
  126. return VMPRESSURE_CRITICAL;
  127. else if (pressure >= vmpressure_level_med)
  128. return VMPRESSURE_MEDIUM;
  129. return VMPRESSURE_LOW;
  130. }
  131. static unsigned long vmpressure_calc_pressure(unsigned long scanned,
  132. unsigned long reclaimed)
  133. {
  134. unsigned long scale = scanned + reclaimed;
  135. unsigned long pressure = 0;
  136. /*
  137. * reclaimed can be greater than scanned in cases
  138. * like THP, where the scanned is 1 and reclaimed
  139. * could be 512
  140. */
  141. if (reclaimed >= scanned)
  142. goto out;
  143. /*
  144. * We calculate the ratio (in percents) of how many pages were
  145. * scanned vs. reclaimed in a given time frame (window). Note that
  146. * time is in VM reclaimer's "ticks", i.e. number of pages
  147. * scanned. This makes it possible to set desired reaction time
  148. * and serves as a ratelimit.
  149. */
  150. pressure = scale - (reclaimed * scale / scanned);
  151. pressure = pressure * 100 / scale;
  152. out:
  153. pr_debug("%s: %3lu (s: %lu r: %lu)\n", __func__, pressure,
  154. scanned, reclaimed);
  155. return pressure;
  156. }
  157. static unsigned long vmpressure_account_stall(unsigned long pressure,
  158. unsigned long stall, unsigned long scanned)
  159. {
  160. unsigned long scale;
  161. if (pressure < allocstall_threshold)
  162. return pressure;
  163. scale = ((vmpressure_scale_max - pressure) * stall) / scanned;
  164. return pressure + scale;
  165. }
  166. struct vmpressure_event {
  167. struct eventfd_ctx *efd;
  168. enum vmpressure_levels level;
  169. struct list_head node;
  170. };
  171. static bool vmpressure_event(struct vmpressure *vmpr,
  172. enum vmpressure_levels level)
  173. {
  174. struct vmpressure_event *ev;
  175. bool signalled = false;
  176. mutex_lock(&vmpr->events_lock);
  177. list_for_each_entry(ev, &vmpr->events, node) {
  178. if (level >= ev->level) {
  179. eventfd_signal(ev->efd, 1);
  180. signalled = true;
  181. }
  182. }
  183. mutex_unlock(&vmpr->events_lock);
  184. return signalled;
  185. }
  186. static void vmpressure_work_fn(struct work_struct *work)
  187. {
  188. struct vmpressure *vmpr = work_to_vmpressure(work);
  189. unsigned long scanned;
  190. unsigned long reclaimed;
  191. unsigned long pressure;
  192. enum vmpressure_levels level;
  193. spin_lock(&vmpr->sr_lock);
  194. /*
  195. * Several contexts might be calling vmpressure(), so it is
  196. * possible that the work was rescheduled again before the old
  197. * work context cleared the counters. In that case we will run
  198. * just after the old work returns, but then scanned might be zero
  199. * here. No need for any locks here since we don't care if
  200. * vmpr->reclaimed is in sync.
  201. */
  202. scanned = vmpr->tree_scanned;
  203. if (!scanned) {
  204. spin_unlock(&vmpr->sr_lock);
  205. return;
  206. }
  207. reclaimed = vmpr->tree_reclaimed;
  208. vmpr->tree_scanned = 0;
  209. vmpr->tree_reclaimed = 0;
  210. spin_unlock(&vmpr->sr_lock);
  211. pressure = vmpressure_calc_pressure(scanned, reclaimed);
  212. level = vmpressure_level(pressure);
  213. do {
  214. if (vmpressure_event(vmpr, level))
  215. break;
  216. /*
  217. * If not handled, propagate the event upward into the
  218. * hierarchy.
  219. */
  220. } while ((vmpr = vmpressure_parent(vmpr)));
  221. }
  222. #ifdef CONFIG_MEMCG
  223. static void vmpressure_memcg(gfp_t gfp, struct mem_cgroup *memcg, bool tree,
  224. unsigned long scanned, unsigned long reclaimed)
  225. {
  226. struct vmpressure *vmpr = memcg_to_vmpressure(memcg);
  227. /*
  228. * Here we only want to account pressure that userland is able to
  229. * help us with. For example, suppose that DMA zone is under
  230. * pressure; if we notify userland about that kind of pressure,
  231. * then it will be mostly a waste as it will trigger unnecessary
  232. * freeing of memory by userland (since userland is more likely to
  233. * have HIGHMEM/MOVABLE pages instead of the DMA fallback). That
  234. * is why we include only movable, highmem and FS/IO pages.
  235. * Indirect reclaim (kswapd) sets sc->gfp_mask to GFP_KERNEL, so
  236. * we account it too.
  237. */
  238. if (!(gfp & (__GFP_HIGHMEM | __GFP_MOVABLE | __GFP_IO | __GFP_FS)))
  239. return;
  240. /*
  241. * If we got here with no pages scanned, then that is an indicator
  242. * that reclaimer was unable to find any shrinkable LRUs at the
  243. * current scanning depth. But it does not mean that we should
  244. * report the critical pressure, yet. If the scanning priority
  245. * (scanning depth) goes too high (deep), we will be notified
  246. * through vmpressure_prio(). But so far, keep calm.
  247. */
  248. if (!scanned)
  249. return;
  250. if (tree) {
  251. spin_lock(&vmpr->sr_lock);
  252. scanned = vmpr->tree_scanned += scanned;
  253. vmpr->tree_reclaimed += reclaimed;
  254. spin_unlock(&vmpr->sr_lock);
  255. if (scanned < vmpressure_win)
  256. return;
  257. schedule_work(&vmpr->work);
  258. } else {
  259. enum vmpressure_levels level;
  260. unsigned long pressure;
  261. /* For now, no users for root-level efficiency */
  262. if (!memcg || memcg == root_mem_cgroup)
  263. return;
  264. spin_lock(&vmpr->sr_lock);
  265. scanned = vmpr->scanned += scanned;
  266. reclaimed = vmpr->reclaimed += reclaimed;
  267. if (scanned < vmpressure_win) {
  268. spin_unlock(&vmpr->sr_lock);
  269. return;
  270. }
  271. vmpr->scanned = vmpr->reclaimed = 0;
  272. spin_unlock(&vmpr->sr_lock);
  273. pressure = vmpressure_calc_pressure(scanned, reclaimed);
  274. level = vmpressure_level(pressure);
  275. if (level > VMPRESSURE_LOW) {
  276. /*
  277. * Let the socket buffer allocator know that
  278. * we are having trouble reclaiming LRU pages.
  279. *
  280. * For hysteresis keep the pressure state
  281. * asserted for a second in which subsequent
  282. * pressure events can occur.
  283. */
  284. memcg->socket_pressure = jiffies + HZ;
  285. }
  286. }
  287. }
  288. #else
  289. static void vmpressure_memcg(gfp_t gfp, struct mem_cgroup *memcg, bool tree,
  290. unsigned long scanned, unsigned long reclaimed) { }
  291. #endif
  292. static void calculate_vmpressure_win(void)
  293. {
  294. long x;
  295. x = global_node_page_state(NR_FILE_PAGES) -
  296. global_node_page_state(NR_SHMEM) -
  297. total_swapcache_pages() +
  298. global_page_state(NR_FREE_PAGES);
  299. if (x < 1)
  300. x = 1;
  301. /*
  302. * For low (free + cached), vmpressure window should be
  303. * small, and high for higher values of (free + cached).
  304. * But it should not be linear as well. This ensures
  305. * timely vmpressure notifications when system is under
  306. * memory pressure, and optimal number of events when
  307. * cached is high. The sqaure root function is empirically
  308. * found to serve the purpose.
  309. */
  310. x = int_sqrt(x);
  311. vmpressure_win = x;
  312. }
  313. static void vmpressure_global(gfp_t gfp, unsigned long scanned,
  314. unsigned long reclaimed)
  315. {
  316. struct vmpressure *vmpr = &global_vmpressure;
  317. unsigned long pressure;
  318. unsigned long stall;
  319. if (!(gfp & (__GFP_HIGHMEM | __GFP_MOVABLE | __GFP_IO | __GFP_FS)))
  320. return;
  321. if (!scanned)
  322. return;
  323. spin_lock(&vmpr->sr_lock);
  324. if (!vmpr->scanned)
  325. calculate_vmpressure_win();
  326. vmpr->scanned += scanned;
  327. vmpr->reclaimed += reclaimed;
  328. if (!current_is_kswapd())
  329. vmpr->stall += scanned;
  330. stall = vmpr->stall;
  331. scanned = vmpr->scanned;
  332. reclaimed = vmpr->reclaimed;
  333. spin_unlock(&vmpr->sr_lock);
  334. if (scanned < vmpressure_win)
  335. return;
  336. spin_lock(&vmpr->sr_lock);
  337. vmpr->scanned = 0;
  338. vmpr->reclaimed = 0;
  339. vmpr->stall = 0;
  340. spin_unlock(&vmpr->sr_lock);
  341. pressure = vmpressure_calc_pressure(scanned, reclaimed);
  342. pressure = vmpressure_account_stall(pressure, stall, scanned);
  343. vmpressure_notify(pressure);
  344. }
  345. /**
  346. * vmpressure() - Account memory pressure through scanned/reclaimed ratio
  347. * @gfp: reclaimer's gfp mask
  348. * @memcg: cgroup memory controller handle
  349. * @tree: legacy subtree mode
  350. * @scanned: number of pages scanned
  351. * @reclaimed: number of pages reclaimed
  352. *
  353. * This function should be called from the vmscan reclaim path to account
  354. * "instantaneous" memory pressure (scanned/reclaimed ratio). The raw
  355. * pressure index is then further refined and averaged over time.
  356. *
  357. * If @tree is set, vmpressure is in traditional userspace reporting
  358. * mode: @memcg is considered the pressure root and userspace is
  359. * notified of the entire subtree's reclaim efficiency.
  360. *
  361. * If @tree is not set, reclaim efficiency is recorded for @memcg, and
  362. * only in-kernel users are notified.
  363. *
  364. * This function does not return any value.
  365. */
  366. void vmpressure(gfp_t gfp, struct mem_cgroup *memcg, bool tree,
  367. unsigned long scanned, unsigned long reclaimed)
  368. {
  369. if (!memcg && tree)
  370. vmpressure_global(gfp, scanned, reclaimed);
  371. if (IS_ENABLED(CONFIG_MEMCG))
  372. vmpressure_memcg(gfp, memcg, tree, scanned, reclaimed);
  373. }
  374. /**
  375. * vmpressure_prio() - Account memory pressure through reclaimer priority level
  376. * @gfp: reclaimer's gfp mask
  377. * @memcg: cgroup memory controller handle
  378. * @prio: reclaimer's priority
  379. *
  380. * This function should be called from the reclaim path every time when
  381. * the vmscan's reclaiming priority (scanning depth) changes.
  382. *
  383. * This function does not return any value.
  384. */
  385. void vmpressure_prio(gfp_t gfp, struct mem_cgroup *memcg, int prio)
  386. {
  387. /*
  388. * We only use prio for accounting critical level. For more info
  389. * see comment for vmpressure_level_critical_prio variable above.
  390. */
  391. if (prio > vmpressure_level_critical_prio)
  392. return;
  393. /*
  394. * OK, the prio is below the threshold, updating vmpressure
  395. * information before shrinker dives into long shrinking of long
  396. * range vmscan. Passing scanned = vmpressure_win, reclaimed = 0
  397. * to the vmpressure() basically means that we signal 'critical'
  398. * level.
  399. */
  400. vmpressure(gfp, memcg, true, vmpressure_win, 0);
  401. }
  402. /**
  403. * vmpressure_register_event() - Bind vmpressure notifications to an eventfd
  404. * @memcg: memcg that is interested in vmpressure notifications
  405. * @eventfd: eventfd context to link notifications with
  406. * @args: event arguments (used to set up a pressure level threshold)
  407. *
  408. * This function associates eventfd context with the vmpressure
  409. * infrastructure, so that the notifications will be delivered to the
  410. * @eventfd. The @args parameter is a string that denotes pressure level
  411. * threshold (one of vmpressure_str_levels, i.e. "low", "medium", or
  412. * "critical").
  413. *
  414. * To be used as memcg event method.
  415. */
  416. int vmpressure_register_event(struct mem_cgroup *memcg,
  417. struct eventfd_ctx *eventfd, const char *args)
  418. {
  419. struct vmpressure *vmpr = memcg_to_vmpressure(memcg);
  420. struct vmpressure_event *ev;
  421. int level;
  422. for (level = 0; level < VMPRESSURE_NUM_LEVELS; level++) {
  423. if (!strcmp(vmpressure_str_levels[level], args))
  424. break;
  425. }
  426. if (level >= VMPRESSURE_NUM_LEVELS)
  427. return -EINVAL;
  428. ev = kzalloc(sizeof(*ev), GFP_KERNEL);
  429. if (!ev)
  430. return -ENOMEM;
  431. ev->efd = eventfd;
  432. ev->level = level;
  433. mutex_lock(&vmpr->events_lock);
  434. list_add(&ev->node, &vmpr->events);
  435. mutex_unlock(&vmpr->events_lock);
  436. return 0;
  437. }
  438. /**
  439. * vmpressure_unregister_event() - Unbind eventfd from vmpressure
  440. * @memcg: memcg handle
  441. * @eventfd: eventfd context that was used to link vmpressure with the @cg
  442. *
  443. * This function does internal manipulations to detach the @eventfd from
  444. * the vmpressure notifications, and then frees internal resources
  445. * associated with the @eventfd (but the @eventfd itself is not freed).
  446. *
  447. * To be used as memcg event method.
  448. */
  449. void vmpressure_unregister_event(struct mem_cgroup *memcg,
  450. struct eventfd_ctx *eventfd)
  451. {
  452. struct vmpressure *vmpr = memcg_to_vmpressure(memcg);
  453. struct vmpressure_event *ev;
  454. mutex_lock(&vmpr->events_lock);
  455. list_for_each_entry(ev, &vmpr->events, node) {
  456. if (ev->efd != eventfd)
  457. continue;
  458. list_del(&ev->node);
  459. kfree(ev);
  460. break;
  461. }
  462. mutex_unlock(&vmpr->events_lock);
  463. }
  464. /**
  465. * vmpressure_init() - Initialize vmpressure control structure
  466. * @vmpr: Structure to be initialized
  467. *
  468. * This function should be called on every allocated vmpressure structure
  469. * before any usage.
  470. */
  471. void vmpressure_init(struct vmpressure *vmpr)
  472. {
  473. spin_lock_init(&vmpr->sr_lock);
  474. mutex_init(&vmpr->events_lock);
  475. INIT_LIST_HEAD(&vmpr->events);
  476. INIT_WORK(&vmpr->work, vmpressure_work_fn);
  477. }
  478. /**
  479. * vmpressure_cleanup() - shuts down vmpressure control structure
  480. * @vmpr: Structure to be cleaned up
  481. *
  482. * This function should be called before the structure in which it is
  483. * embedded is cleaned up.
  484. */
  485. void vmpressure_cleanup(struct vmpressure *vmpr)
  486. {
  487. /*
  488. * Make sure there is no pending work before eventfd infrastructure
  489. * goes away.
  490. */
  491. flush_work(&vmpr->work);
  492. }
  493. static int vmpressure_global_init(void)
  494. {
  495. vmpressure_init(&global_vmpressure);
  496. return 0;
  497. }
  498. late_initcall(vmpressure_global_init);