vmpressure.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430
  1. /*
  2. * Linux VM pressure
  3. *
  4. * Copyright 2012 Linaro Ltd.
  5. * Anton Vorontsov <anton.vorontsov@linaro.org>
  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/vmpressure.h>
  25. /*
  26. * The window size (vmpressure_win) is the number of scanned pages before
  27. * we try to analyze scanned/reclaimed ratio. So the window is used as a
  28. * rate-limit tunable for the "low" level notification, and also for
  29. * averaging the ratio for medium/critical levels. Using small window
  30. * sizes can cause lot of false positives, but too big window size will
  31. * delay the notifications.
  32. *
  33. * As the vmscan reclaimer logic works with chunks which are multiple of
  34. * SWAP_CLUSTER_MAX, it makes sense to use it for the window size as well.
  35. *
  36. * TODO: Make the window size depend on machine size, as we do for vmstat
  37. * thresholds. Currently we set it to 512 pages (2MB for 4KB pages).
  38. */
  39. static const unsigned long vmpressure_win = SWAP_CLUSTER_MAX * 16;
  40. /*
  41. * These thresholds are used when we account memory pressure through
  42. * scanned/reclaimed ratio. The current values were chosen empirically. In
  43. * essence, they are percents: the higher the value, the more number
  44. * unsuccessful reclaims there were.
  45. */
  46. static const unsigned int vmpressure_level_med = 60;
  47. static const unsigned int vmpressure_level_critical = 95;
  48. /*
  49. * When there are too little pages left to scan, vmpressure() may miss the
  50. * critical pressure as number of pages will be less than "window size".
  51. * However, in that case the vmscan priority will raise fast as the
  52. * reclaimer will try to scan LRUs more deeply.
  53. *
  54. * The vmscan logic considers these special priorities:
  55. *
  56. * prio == DEF_PRIORITY (12): reclaimer starts with that value
  57. * prio <= DEF_PRIORITY - 2 : kswapd becomes somewhat overwhelmed
  58. * prio == 0 : close to OOM, kernel scans every page in an lru
  59. *
  60. * Any value in this range is acceptable for this tunable (i.e. from 12 to
  61. * 0). Current value for the vmpressure_level_critical_prio is chosen
  62. * empirically, but the number, in essence, means that we consider
  63. * critical level when scanning depth is ~10% of the lru size (vmscan
  64. * scans 'lru_size >> prio' pages, so it is actually 12.5%, or one
  65. * eights).
  66. */
  67. static const unsigned int vmpressure_level_critical_prio = ilog2(100 / 10);
  68. static struct vmpressure *work_to_vmpressure(struct work_struct *work)
  69. {
  70. return container_of(work, struct vmpressure, work);
  71. }
  72. static struct vmpressure *vmpressure_parent(struct vmpressure *vmpr)
  73. {
  74. struct cgroup_subsys_state *css = vmpressure_to_css(vmpr);
  75. struct mem_cgroup *memcg = mem_cgroup_from_css(css);
  76. memcg = parent_mem_cgroup(memcg);
  77. if (!memcg)
  78. return NULL;
  79. return memcg_to_vmpressure(memcg);
  80. }
  81. enum vmpressure_levels {
  82. VMPRESSURE_LOW = 0,
  83. VMPRESSURE_MEDIUM,
  84. VMPRESSURE_CRITICAL,
  85. VMPRESSURE_NUM_LEVELS,
  86. };
  87. static const char * const vmpressure_str_levels[] = {
  88. [VMPRESSURE_LOW] = "low",
  89. [VMPRESSURE_MEDIUM] = "medium",
  90. [VMPRESSURE_CRITICAL] = "critical",
  91. };
  92. static enum vmpressure_levels vmpressure_level(unsigned long pressure)
  93. {
  94. if (pressure >= vmpressure_level_critical)
  95. return VMPRESSURE_CRITICAL;
  96. else if (pressure >= vmpressure_level_med)
  97. return VMPRESSURE_MEDIUM;
  98. return VMPRESSURE_LOW;
  99. }
  100. static enum vmpressure_levels vmpressure_calc_level(unsigned long scanned,
  101. unsigned long reclaimed)
  102. {
  103. unsigned long scale = scanned + reclaimed;
  104. unsigned long pressure = 0;
  105. /*
  106. * reclaimed can be greater than scanned in cases
  107. * like THP, where the scanned is 1 and reclaimed
  108. * could be 512
  109. */
  110. if (reclaimed >= scanned)
  111. goto out;
  112. /*
  113. * We calculate the ratio (in percents) of how many pages were
  114. * scanned vs. reclaimed in a given time frame (window). Note that
  115. * time is in VM reclaimer's "ticks", i.e. number of pages
  116. * scanned. This makes it possible to set desired reaction time
  117. * and serves as a ratelimit.
  118. */
  119. pressure = scale - (reclaimed * scale / scanned);
  120. pressure = pressure * 100 / scale;
  121. out:
  122. pr_debug("%s: %3lu (s: %lu r: %lu)\n", __func__, pressure,
  123. scanned, reclaimed);
  124. return vmpressure_level(pressure);
  125. }
  126. struct vmpressure_event {
  127. struct eventfd_ctx *efd;
  128. enum vmpressure_levels level;
  129. struct list_head node;
  130. };
  131. static bool vmpressure_event(struct vmpressure *vmpr,
  132. enum vmpressure_levels level)
  133. {
  134. struct vmpressure_event *ev;
  135. bool signalled = false;
  136. mutex_lock(&vmpr->events_lock);
  137. list_for_each_entry(ev, &vmpr->events, node) {
  138. if (level >= ev->level) {
  139. eventfd_signal(ev->efd, 1);
  140. signalled = true;
  141. }
  142. }
  143. mutex_unlock(&vmpr->events_lock);
  144. return signalled;
  145. }
  146. static void vmpressure_work_fn(struct work_struct *work)
  147. {
  148. struct vmpressure *vmpr = work_to_vmpressure(work);
  149. unsigned long scanned;
  150. unsigned long reclaimed;
  151. enum vmpressure_levels level;
  152. spin_lock(&vmpr->sr_lock);
  153. /*
  154. * Several contexts might be calling vmpressure(), so it is
  155. * possible that the work was rescheduled again before the old
  156. * work context cleared the counters. In that case we will run
  157. * just after the old work returns, but then scanned might be zero
  158. * here. No need for any locks here since we don't care if
  159. * vmpr->reclaimed is in sync.
  160. */
  161. scanned = vmpr->tree_scanned;
  162. if (!scanned) {
  163. spin_unlock(&vmpr->sr_lock);
  164. return;
  165. }
  166. reclaimed = vmpr->tree_reclaimed;
  167. vmpr->tree_scanned = 0;
  168. vmpr->tree_reclaimed = 0;
  169. spin_unlock(&vmpr->sr_lock);
  170. level = vmpressure_calc_level(scanned, reclaimed);
  171. do {
  172. if (vmpressure_event(vmpr, level))
  173. break;
  174. /*
  175. * If not handled, propagate the event upward into the
  176. * hierarchy.
  177. */
  178. } while ((vmpr = vmpressure_parent(vmpr)));
  179. }
  180. /**
  181. * vmpressure() - Account memory pressure through scanned/reclaimed ratio
  182. * @gfp: reclaimer's gfp mask
  183. * @memcg: cgroup memory controller handle
  184. * @tree: legacy subtree mode
  185. * @scanned: number of pages scanned
  186. * @reclaimed: number of pages reclaimed
  187. *
  188. * This function should be called from the vmscan reclaim path to account
  189. * "instantaneous" memory pressure (scanned/reclaimed ratio). The raw
  190. * pressure index is then further refined and averaged over time.
  191. *
  192. * If @tree is set, vmpressure is in traditional userspace reporting
  193. * mode: @memcg is considered the pressure root and userspace is
  194. * notified of the entire subtree's reclaim efficiency.
  195. *
  196. * If @tree is not set, reclaim efficiency is recorded for @memcg, and
  197. * only in-kernel users are notified.
  198. *
  199. * This function does not return any value.
  200. */
  201. void vmpressure(gfp_t gfp, struct mem_cgroup *memcg, bool tree,
  202. unsigned long scanned, unsigned long reclaimed)
  203. {
  204. struct vmpressure *vmpr = memcg_to_vmpressure(memcg);
  205. /*
  206. * Here we only want to account pressure that userland is able to
  207. * help us with. For example, suppose that DMA zone is under
  208. * pressure; if we notify userland about that kind of pressure,
  209. * then it will be mostly a waste as it will trigger unnecessary
  210. * freeing of memory by userland (since userland is more likely to
  211. * have HIGHMEM/MOVABLE pages instead of the DMA fallback). That
  212. * is why we include only movable, highmem and FS/IO pages.
  213. * Indirect reclaim (kswapd) sets sc->gfp_mask to GFP_KERNEL, so
  214. * we account it too.
  215. */
  216. if (!(gfp & (__GFP_HIGHMEM | __GFP_MOVABLE | __GFP_IO | __GFP_FS)))
  217. return;
  218. /*
  219. * If we got here with no pages scanned, then that is an indicator
  220. * that reclaimer was unable to find any shrinkable LRUs at the
  221. * current scanning depth. But it does not mean that we should
  222. * report the critical pressure, yet. If the scanning priority
  223. * (scanning depth) goes too high (deep), we will be notified
  224. * through vmpressure_prio(). But so far, keep calm.
  225. */
  226. if (!scanned)
  227. return;
  228. if (tree) {
  229. spin_lock(&vmpr->sr_lock);
  230. scanned = vmpr->tree_scanned += scanned;
  231. vmpr->tree_reclaimed += reclaimed;
  232. spin_unlock(&vmpr->sr_lock);
  233. if (scanned < vmpressure_win)
  234. return;
  235. schedule_work(&vmpr->work);
  236. } else {
  237. enum vmpressure_levels level;
  238. /* For now, no users for root-level efficiency */
  239. if (!memcg || memcg == root_mem_cgroup)
  240. return;
  241. spin_lock(&vmpr->sr_lock);
  242. scanned = vmpr->scanned += scanned;
  243. reclaimed = vmpr->reclaimed += reclaimed;
  244. if (scanned < vmpressure_win) {
  245. spin_unlock(&vmpr->sr_lock);
  246. return;
  247. }
  248. vmpr->scanned = vmpr->reclaimed = 0;
  249. spin_unlock(&vmpr->sr_lock);
  250. level = vmpressure_calc_level(scanned, reclaimed);
  251. if (level > VMPRESSURE_LOW) {
  252. /*
  253. * Let the socket buffer allocator know that
  254. * we are having trouble reclaiming LRU pages.
  255. *
  256. * For hysteresis keep the pressure state
  257. * asserted for a second in which subsequent
  258. * pressure events can occur.
  259. */
  260. memcg->socket_pressure = jiffies + HZ;
  261. }
  262. }
  263. }
  264. /**
  265. * vmpressure_prio() - Account memory pressure through reclaimer priority level
  266. * @gfp: reclaimer's gfp mask
  267. * @memcg: cgroup memory controller handle
  268. * @prio: reclaimer's priority
  269. *
  270. * This function should be called from the reclaim path every time when
  271. * the vmscan's reclaiming priority (scanning depth) changes.
  272. *
  273. * This function does not return any value.
  274. */
  275. void vmpressure_prio(gfp_t gfp, struct mem_cgroup *memcg, int prio)
  276. {
  277. /*
  278. * We only use prio for accounting critical level. For more info
  279. * see comment for vmpressure_level_critical_prio variable above.
  280. */
  281. if (prio > vmpressure_level_critical_prio)
  282. return;
  283. /*
  284. * OK, the prio is below the threshold, updating vmpressure
  285. * information before shrinker dives into long shrinking of long
  286. * range vmscan. Passing scanned = vmpressure_win, reclaimed = 0
  287. * to the vmpressure() basically means that we signal 'critical'
  288. * level.
  289. */
  290. vmpressure(gfp, memcg, true, vmpressure_win, 0);
  291. }
  292. /**
  293. * vmpressure_register_event() - Bind vmpressure notifications to an eventfd
  294. * @memcg: memcg that is interested in vmpressure notifications
  295. * @eventfd: eventfd context to link notifications with
  296. * @args: event arguments (used to set up a pressure level threshold)
  297. *
  298. * This function associates eventfd context with the vmpressure
  299. * infrastructure, so that the notifications will be delivered to the
  300. * @eventfd. The @args parameter is a string that denotes pressure level
  301. * threshold (one of vmpressure_str_levels, i.e. "low", "medium", or
  302. * "critical").
  303. *
  304. * To be used as memcg event method.
  305. */
  306. int vmpressure_register_event(struct mem_cgroup *memcg,
  307. struct eventfd_ctx *eventfd, const char *args)
  308. {
  309. struct vmpressure *vmpr = memcg_to_vmpressure(memcg);
  310. struct vmpressure_event *ev;
  311. int level;
  312. for (level = 0; level < VMPRESSURE_NUM_LEVELS; level++) {
  313. if (!strcmp(vmpressure_str_levels[level], args))
  314. break;
  315. }
  316. if (level >= VMPRESSURE_NUM_LEVELS)
  317. return -EINVAL;
  318. ev = kzalloc(sizeof(*ev), GFP_KERNEL);
  319. if (!ev)
  320. return -ENOMEM;
  321. ev->efd = eventfd;
  322. ev->level = level;
  323. mutex_lock(&vmpr->events_lock);
  324. list_add(&ev->node, &vmpr->events);
  325. mutex_unlock(&vmpr->events_lock);
  326. return 0;
  327. }
  328. /**
  329. * vmpressure_unregister_event() - Unbind eventfd from vmpressure
  330. * @memcg: memcg handle
  331. * @eventfd: eventfd context that was used to link vmpressure with the @cg
  332. *
  333. * This function does internal manipulations to detach the @eventfd from
  334. * the vmpressure notifications, and then frees internal resources
  335. * associated with the @eventfd (but the @eventfd itself is not freed).
  336. *
  337. * To be used as memcg event method.
  338. */
  339. void vmpressure_unregister_event(struct mem_cgroup *memcg,
  340. struct eventfd_ctx *eventfd)
  341. {
  342. struct vmpressure *vmpr = memcg_to_vmpressure(memcg);
  343. struct vmpressure_event *ev;
  344. mutex_lock(&vmpr->events_lock);
  345. list_for_each_entry(ev, &vmpr->events, node) {
  346. if (ev->efd != eventfd)
  347. continue;
  348. list_del(&ev->node);
  349. kfree(ev);
  350. break;
  351. }
  352. mutex_unlock(&vmpr->events_lock);
  353. }
  354. /**
  355. * vmpressure_init() - Initialize vmpressure control structure
  356. * @vmpr: Structure to be initialized
  357. *
  358. * This function should be called on every allocated vmpressure structure
  359. * before any usage.
  360. */
  361. void vmpressure_init(struct vmpressure *vmpr)
  362. {
  363. spin_lock_init(&vmpr->sr_lock);
  364. mutex_init(&vmpr->events_lock);
  365. INIT_LIST_HEAD(&vmpr->events);
  366. INIT_WORK(&vmpr->work, vmpressure_work_fn);
  367. }
  368. /**
  369. * vmpressure_cleanup() - shuts down vmpressure control structure
  370. * @vmpr: Structure to be cleaned up
  371. *
  372. * This function should be called before the structure in which it is
  373. * embedded is cleaned up.
  374. */
  375. void vmpressure_cleanup(struct vmpressure *vmpr)
  376. {
  377. /*
  378. * Make sure there is no pending work before eventfd infrastructure
  379. * goes away.
  380. */
  381. flush_work(&vmpr->work);
  382. }