unevictable-lru.rst 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614
  1. .. _unevictable_lru:
  2. ==============================
  3. Unevictable LRU Infrastructure
  4. ==============================
  5. .. contents:: :local:
  6. Introduction
  7. ============
  8. This document describes the Linux memory manager's "Unevictable LRU"
  9. infrastructure and the use of this to manage several types of "unevictable"
  10. pages.
  11. The document attempts to provide the overall rationale behind this mechanism
  12. and the rationale for some of the design decisions that drove the
  13. implementation. The latter design rationale is discussed in the context of an
  14. implementation description. Admittedly, one can obtain the implementation
  15. details - the "what does it do?" - by reading the code. One hopes that the
  16. descriptions below add value by provide the answer to "why does it do that?".
  17. The Unevictable LRU
  18. ===================
  19. The Unevictable LRU facility adds an additional LRU list to track unevictable
  20. pages and to hide these pages from vmscan. This mechanism is based on a patch
  21. by Larry Woodman of Red Hat to address several scalability problems with page
  22. reclaim in Linux. The problems have been observed at customer sites on large
  23. memory x86_64 systems.
  24. To illustrate this with an example, a non-NUMA x86_64 platform with 128GB of
  25. main memory will have over 32 million 4k pages in a single zone. When a large
  26. fraction of these pages are not evictable for any reason [see below], vmscan
  27. will spend a lot of time scanning the LRU lists looking for the small fraction
  28. of pages that are evictable. This can result in a situation where all CPUs are
  29. spending 100% of their time in vmscan for hours or days on end, with the system
  30. completely unresponsive.
  31. The unevictable list addresses the following classes of unevictable pages:
  32. * Those owned by ramfs.
  33. * Those mapped into SHM_LOCK'd shared memory regions.
  34. * Those mapped into VM_LOCKED [mlock()ed] VMAs.
  35. The infrastructure may also be able to handle other conditions that make pages
  36. unevictable, either by definition or by circumstance, in the future.
  37. The Unevictable Page List
  38. -------------------------
  39. The Unevictable LRU infrastructure consists of an additional, per-zone, LRU list
  40. called the "unevictable" list and an associated page flag, PG_unevictable, to
  41. indicate that the page is being managed on the unevictable list.
  42. The PG_unevictable flag is analogous to, and mutually exclusive with, the
  43. PG_active flag in that it indicates on which LRU list a page resides when
  44. PG_lru is set.
  45. The Unevictable LRU infrastructure maintains unevictable pages on an additional
  46. LRU list for a few reasons:
  47. (1) We get to "treat unevictable pages just like we treat other pages in the
  48. system - which means we get to use the same code to manipulate them, the
  49. same code to isolate them (for migrate, etc.), the same code to keep track
  50. of the statistics, etc..." [Rik van Riel]
  51. (2) We want to be able to migrate unevictable pages between nodes for memory
  52. defragmentation, workload management and memory hotplug. The linux kernel
  53. can only migrate pages that it can successfully isolate from the LRU
  54. lists. If we were to maintain pages elsewhere than on an LRU-like list,
  55. where they can be found by isolate_lru_page(), we would prevent their
  56. migration, unless we reworked migration code to find the unevictable pages
  57. itself.
  58. The unevictable list does not differentiate between file-backed and anonymous,
  59. swap-backed pages. This differentiation is only important while the pages are,
  60. in fact, evictable.
  61. The unevictable list benefits from the "arrayification" of the per-zone LRU
  62. lists and statistics originally proposed and posted by Christoph Lameter.
  63. The unevictable list does not use the LRU pagevec mechanism. Rather,
  64. unevictable pages are placed directly on the page's zone's unevictable list
  65. under the zone lru_lock. This allows us to prevent the stranding of pages on
  66. the unevictable list when one task has the page isolated from the LRU and other
  67. tasks are changing the "evictability" state of the page.
  68. Memory Control Group Interaction
  69. --------------------------------
  70. The unevictable LRU facility interacts with the memory control group [aka
  71. memory controller; see Documentation/cgroup-v1/memory.txt] by extending the
  72. lru_list enum.
  73. The memory controller data structure automatically gets a per-zone unevictable
  74. list as a result of the "arrayification" of the per-zone LRU lists (one per
  75. lru_list enum element). The memory controller tracks the movement of pages to
  76. and from the unevictable list.
  77. When a memory control group comes under memory pressure, the controller will
  78. not attempt to reclaim pages on the unevictable list. This has a couple of
  79. effects:
  80. (1) Because the pages are "hidden" from reclaim on the unevictable list, the
  81. reclaim process can be more efficient, dealing only with pages that have a
  82. chance of being reclaimed.
  83. (2) On the other hand, if too many of the pages charged to the control group
  84. are unevictable, the evictable portion of the working set of the tasks in
  85. the control group may not fit into the available memory. This can cause
  86. the control group to thrash or to OOM-kill tasks.
  87. .. _mark_addr_space_unevict:
  88. Marking Address Spaces Unevictable
  89. ----------------------------------
  90. For facilities such as ramfs none of the pages attached to the address space
  91. may be evicted. To prevent eviction of any such pages, the AS_UNEVICTABLE
  92. address space flag is provided, and this can be manipulated by a filesystem
  93. using a number of wrapper functions:
  94. * ``void mapping_set_unevictable(struct address_space *mapping);``
  95. Mark the address space as being completely unevictable.
  96. * ``void mapping_clear_unevictable(struct address_space *mapping);``
  97. Mark the address space as being evictable.
  98. * ``int mapping_unevictable(struct address_space *mapping);``
  99. Query the address space, and return true if it is completely
  100. unevictable.
  101. These are currently used in two places in the kernel:
  102. (1) By ramfs to mark the address spaces of its inodes when they are created,
  103. and this mark remains for the life of the inode.
  104. (2) By SYSV SHM to mark SHM_LOCK'd address spaces until SHM_UNLOCK is called.
  105. Note that SHM_LOCK is not required to page in the locked pages if they're
  106. swapped out; the application must touch the pages manually if it wants to
  107. ensure they're in memory.
  108. Detecting Unevictable Pages
  109. ---------------------------
  110. The function page_evictable() in vmscan.c determines whether a page is
  111. evictable or not using the query function outlined above [see section
  112. :ref:`Marking address spaces unevictable <mark_addr_space_unevict>`]
  113. to check the AS_UNEVICTABLE flag.
  114. For address spaces that are so marked after being populated (as SHM regions
  115. might be), the lock action (eg: SHM_LOCK) can be lazy, and need not populate
  116. the page tables for the region as does, for example, mlock(), nor need it make
  117. any special effort to push any pages in the SHM_LOCK'd area to the unevictable
  118. list. Instead, vmscan will do this if and when it encounters the pages during
  119. a reclamation scan.
  120. On an unlock action (such as SHM_UNLOCK), the unlocker (eg: shmctl()) must scan
  121. the pages in the region and "rescue" them from the unevictable list if no other
  122. condition is keeping them unevictable. If an unevictable region is destroyed,
  123. the pages are also "rescued" from the unevictable list in the process of
  124. freeing them.
  125. page_evictable() also checks for mlocked pages by testing an additional page
  126. flag, PG_mlocked (as wrapped by PageMlocked()), which is set when a page is
  127. faulted into a VM_LOCKED vma, or found in a vma being VM_LOCKED.
  128. Vmscan's Handling of Unevictable Pages
  129. --------------------------------------
  130. If unevictable pages are culled in the fault path, or moved to the unevictable
  131. list at mlock() or mmap() time, vmscan will not encounter the pages until they
  132. have become evictable again (via munlock() for example) and have been "rescued"
  133. from the unevictable list. However, there may be situations where we decide,
  134. for the sake of expediency, to leave a unevictable page on one of the regular
  135. active/inactive LRU lists for vmscan to deal with. vmscan checks for such
  136. pages in all of the shrink_{active|inactive|page}_list() functions and will
  137. "cull" such pages that it encounters: that is, it diverts those pages to the
  138. unevictable list for the zone being scanned.
  139. There may be situations where a page is mapped into a VM_LOCKED VMA, but the
  140. page is not marked as PG_mlocked. Such pages will make it all the way to
  141. shrink_page_list() where they will be detected when vmscan walks the reverse
  142. map in try_to_unmap(). If try_to_unmap() returns SWAP_MLOCK,
  143. shrink_page_list() will cull the page at that point.
  144. To "cull" an unevictable page, vmscan simply puts the page back on the LRU list
  145. using putback_lru_page() - the inverse operation to isolate_lru_page() - after
  146. dropping the page lock. Because the condition which makes the page unevictable
  147. may change once the page is unlocked, putback_lru_page() will recheck the
  148. unevictable state of a page that it places on the unevictable list. If the
  149. page has become unevictable, putback_lru_page() removes it from the list and
  150. retries, including the page_unevictable() test. Because such a race is a rare
  151. event and movement of pages onto the unevictable list should be rare, these
  152. extra evictabilty checks should not occur in the majority of calls to
  153. putback_lru_page().
  154. MLOCKED Pages
  155. =============
  156. The unevictable page list is also useful for mlock(), in addition to ramfs and
  157. SYSV SHM. Note that mlock() is only available in CONFIG_MMU=y situations; in
  158. NOMMU situations, all mappings are effectively mlocked.
  159. History
  160. -------
  161. The "Unevictable mlocked Pages" infrastructure is based on work originally
  162. posted by Nick Piggin in an RFC patch entitled "mm: mlocked pages off LRU".
  163. Nick posted his patch as an alternative to a patch posted by Christoph Lameter
  164. to achieve the same objective: hiding mlocked pages from vmscan.
  165. In Nick's patch, he used one of the struct page LRU list link fields as a count
  166. of VM_LOCKED VMAs that map the page. This use of the link field for a count
  167. prevented the management of the pages on an LRU list, and thus mlocked pages
  168. were not migratable as isolate_lru_page() could not find them, and the LRU list
  169. link field was not available to the migration subsystem.
  170. Nick resolved this by putting mlocked pages back on the lru list before
  171. attempting to isolate them, thus abandoning the count of VM_LOCKED VMAs. When
  172. Nick's patch was integrated with the Unevictable LRU work, the count was
  173. replaced by walking the reverse map to determine whether any VM_LOCKED VMAs
  174. mapped the page. More on this below.
  175. Basic Management
  176. ----------------
  177. mlocked pages - pages mapped into a VM_LOCKED VMA - are a class of unevictable
  178. pages. When such a page has been "noticed" by the memory management subsystem,
  179. the page is marked with the PG_mlocked flag. This can be manipulated using the
  180. PageMlocked() functions.
  181. A PG_mlocked page will be placed on the unevictable list when it is added to
  182. the LRU. Such pages can be "noticed" by memory management in several places:
  183. (1) in the mlock()/mlockall() system call handlers;
  184. (2) in the mmap() system call handler when mmapping a region with the
  185. MAP_LOCKED flag;
  186. (3) mmapping a region in a task that has called mlockall() with the MCL_FUTURE
  187. flag
  188. (4) in the fault path, if mlocked pages are "culled" in the fault path,
  189. and when a VM_LOCKED stack segment is expanded; or
  190. (5) as mentioned above, in vmscan:shrink_page_list() when attempting to
  191. reclaim a page in a VM_LOCKED VMA via try_to_unmap()
  192. all of which result in the VM_LOCKED flag being set for the VMA if it doesn't
  193. already have it set.
  194. mlocked pages become unlocked and rescued from the unevictable list when:
  195. (1) mapped in a range unlocked via the munlock()/munlockall() system calls;
  196. (2) munmap()'d out of the last VM_LOCKED VMA that maps the page, including
  197. unmapping at task exit;
  198. (3) when the page is truncated from the last VM_LOCKED VMA of an mmapped file;
  199. or
  200. (4) before a page is COW'd in a VM_LOCKED VMA.
  201. mlock()/mlockall() System Call Handling
  202. ---------------------------------------
  203. Both [do\_]mlock() and [do\_]mlockall() system call handlers call mlock_fixup()
  204. for each VMA in the range specified by the call. In the case of mlockall(),
  205. this is the entire active address space of the task. Note that mlock_fixup()
  206. is used for both mlocking and munlocking a range of memory. A call to mlock()
  207. an already VM_LOCKED VMA, or to munlock() a VMA that is not VM_LOCKED is
  208. treated as a no-op, and mlock_fixup() simply returns.
  209. If the VMA passes some filtering as described in "Filtering Special Vmas"
  210. below, mlock_fixup() will attempt to merge the VMA with its neighbors or split
  211. off a subset of the VMA if the range does not cover the entire VMA. Once the
  212. VMA has been merged or split or neither, mlock_fixup() will call
  213. populate_vma_page_range() to fault in the pages via get_user_pages() and to
  214. mark the pages as mlocked via mlock_vma_page().
  215. Note that the VMA being mlocked might be mapped with PROT_NONE. In this case,
  216. get_user_pages() will be unable to fault in the pages. That's okay. If pages
  217. do end up getting faulted into this VM_LOCKED VMA, we'll handle them in the
  218. fault path or in vmscan.
  219. Also note that a page returned by get_user_pages() could be truncated or
  220. migrated out from under us, while we're trying to mlock it. To detect this,
  221. populate_vma_page_range() checks page_mapping() after acquiring the page lock.
  222. If the page is still associated with its mapping, we'll go ahead and call
  223. mlock_vma_page(). If the mapping is gone, we just unlock the page and move on.
  224. In the worst case, this will result in a page mapped in a VM_LOCKED VMA
  225. remaining on a normal LRU list without being PageMlocked(). Again, vmscan will
  226. detect and cull such pages.
  227. mlock_vma_page() will call TestSetPageMlocked() for each page returned by
  228. get_user_pages(). We use TestSetPageMlocked() because the page might already
  229. be mlocked by another task/VMA and we don't want to do extra work. We
  230. especially do not want to count an mlocked page more than once in the
  231. statistics. If the page was already mlocked, mlock_vma_page() need do nothing
  232. more.
  233. If the page was NOT already mlocked, mlock_vma_page() attempts to isolate the
  234. page from the LRU, as it is likely on the appropriate active or inactive list
  235. at that time. If the isolate_lru_page() succeeds, mlock_vma_page() will put
  236. back the page - by calling putback_lru_page() - which will notice that the page
  237. is now mlocked and divert the page to the zone's unevictable list. If
  238. mlock_vma_page() is unable to isolate the page from the LRU, vmscan will handle
  239. it later if and when it attempts to reclaim the page.
  240. Filtering Special VMAs
  241. ----------------------
  242. mlock_fixup() filters several classes of "special" VMAs:
  243. 1) VMAs with VM_IO or VM_PFNMAP set are skipped entirely. The pages behind
  244. these mappings are inherently pinned, so we don't need to mark them as
  245. mlocked. In any case, most of the pages have no struct page in which to so
  246. mark the page. Because of this, get_user_pages() will fail for these VMAs,
  247. so there is no sense in attempting to visit them.
  248. 2) VMAs mapping hugetlbfs page are already effectively pinned into memory. We
  249. neither need nor want to mlock() these pages. However, to preserve the
  250. prior behavior of mlock() - before the unevictable/mlock changes -
  251. mlock_fixup() will call make_pages_present() in the hugetlbfs VMA range to
  252. allocate the huge pages and populate the ptes.
  253. 3) VMAs with VM_DONTEXPAND are generally userspace mappings of kernel pages,
  254. such as the VDSO page, relay channel pages, etc. These pages
  255. are inherently unevictable and are not managed on the LRU lists.
  256. mlock_fixup() treats these VMAs the same as hugetlbfs VMAs. It calls
  257. make_pages_present() to populate the ptes.
  258. Note that for all of these special VMAs, mlock_fixup() does not set the
  259. VM_LOCKED flag. Therefore, we won't have to deal with them later during
  260. munlock(), munmap() or task exit. Neither does mlock_fixup() account these
  261. VMAs against the task's "locked_vm".
  262. .. _munlock_munlockall_handling:
  263. munlock()/munlockall() System Call Handling
  264. -------------------------------------------
  265. The munlock() and munlockall() system calls are handled by the same functions -
  266. do_mlock[all]() - as the mlock() and mlockall() system calls with the unlock vs
  267. lock operation indicated by an argument. So, these system calls are also
  268. handled by mlock_fixup(). Again, if called for an already munlocked VMA,
  269. mlock_fixup() simply returns. Because of the VMA filtering discussed above,
  270. VM_LOCKED will not be set in any "special" VMAs. So, these VMAs will be
  271. ignored for munlock.
  272. If the VMA is VM_LOCKED, mlock_fixup() again attempts to merge or split off the
  273. specified range. The range is then munlocked via the function
  274. populate_vma_page_range() - the same function used to mlock a VMA range -
  275. passing a flag to indicate that munlock() is being performed.
  276. Because the VMA access protections could have been changed to PROT_NONE after
  277. faulting in and mlocking pages, get_user_pages() was unreliable for visiting
  278. these pages for munlocking. Because we don't want to leave pages mlocked,
  279. get_user_pages() was enhanced to accept a flag to ignore the permissions when
  280. fetching the pages - all of which should be resident as a result of previous
  281. mlocking.
  282. For munlock(), populate_vma_page_range() unlocks individual pages by calling
  283. munlock_vma_page(). munlock_vma_page() unconditionally clears the PG_mlocked
  284. flag using TestClearPageMlocked(). As with mlock_vma_page(),
  285. munlock_vma_page() use the Test*PageMlocked() function to handle the case where
  286. the page might have already been unlocked by another task. If the page was
  287. mlocked, munlock_vma_page() updates that zone statistics for the number of
  288. mlocked pages. Note, however, that at this point we haven't checked whether
  289. the page is mapped by other VM_LOCKED VMAs.
  290. We can't call try_to_munlock(), the function that walks the reverse map to
  291. check for other VM_LOCKED VMAs, without first isolating the page from the LRU.
  292. try_to_munlock() is a variant of try_to_unmap() and thus requires that the page
  293. not be on an LRU list [more on these below]. However, the call to
  294. isolate_lru_page() could fail, in which case we couldn't try_to_munlock(). So,
  295. we go ahead and clear PG_mlocked up front, as this might be the only chance we
  296. have. If we can successfully isolate the page, we go ahead and
  297. try_to_munlock(), which will restore the PG_mlocked flag and update the zone
  298. page statistics if it finds another VMA holding the page mlocked. If we fail
  299. to isolate the page, we'll have left a potentially mlocked page on the LRU.
  300. This is fine, because we'll catch it later if and if vmscan tries to reclaim
  301. the page. This should be relatively rare.
  302. Migrating MLOCKED Pages
  303. -----------------------
  304. A page that is being migrated has been isolated from the LRU lists and is held
  305. locked across unmapping of the page, updating the page's address space entry
  306. and copying the contents and state, until the page table entry has been
  307. replaced with an entry that refers to the new page. Linux supports migration
  308. of mlocked pages and other unevictable pages. This involves simply moving the
  309. PG_mlocked and PG_unevictable states from the old page to the new page.
  310. Note that page migration can race with mlocking or munlocking of the same page.
  311. This has been discussed from the mlock/munlock perspective in the respective
  312. sections above. Both processes (migration and m[un]locking) hold the page
  313. locked. This provides the first level of synchronization. Page migration
  314. zeros out the page_mapping of the old page before unlocking it, so m[un]lock
  315. can skip these pages by testing the page mapping under page lock.
  316. To complete page migration, we place the new and old pages back onto the LRU
  317. after dropping the page lock. The "unneeded" page - old page on success, new
  318. page on failure - will be freed when the reference count held by the migration
  319. process is released. To ensure that we don't strand pages on the unevictable
  320. list because of a race between munlock and migration, page migration uses the
  321. putback_lru_page() function to add migrated pages back to the LRU.
  322. Compacting MLOCKED Pages
  323. ------------------------
  324. The unevictable LRU can be scanned for compactable regions and the default
  325. behavior is to do so. /proc/sys/vm/compact_unevictable_allowed controls
  326. this behavior (see Documentation/sysctl/vm.txt). Once scanning of the
  327. unevictable LRU is enabled, the work of compaction is mostly handled by
  328. the page migration code and the same work flow as described in MIGRATING
  329. MLOCKED PAGES will apply.
  330. MLOCKING Transparent Huge Pages
  331. -------------------------------
  332. A transparent huge page is represented by a single entry on an LRU list.
  333. Therefore, we can only make unevictable an entire compound page, not
  334. individual subpages.
  335. If a user tries to mlock() part of a huge page, we want the rest of the
  336. page to be reclaimable.
  337. We cannot just split the page on partial mlock() as split_huge_page() can
  338. fail and new intermittent failure mode for the syscall is undesirable.
  339. We handle this by keeping PTE-mapped huge pages on normal LRU lists: the
  340. PMD on border of VM_LOCKED VMA will be split into PTE table.
  341. This way the huge page is accessible for vmscan. Under memory pressure the
  342. page will be split, subpages which belong to VM_LOCKED VMAs will be moved
  343. to unevictable LRU and the rest can be reclaimed.
  344. See also comment in follow_trans_huge_pmd().
  345. mmap(MAP_LOCKED) System Call Handling
  346. -------------------------------------
  347. In addition the mlock()/mlockall() system calls, an application can request
  348. that a region of memory be mlocked supplying the MAP_LOCKED flag to the mmap()
  349. call. There is one important and subtle difference here, though. mmap() + mlock()
  350. will fail if the range cannot be faulted in (e.g. because mm_populate fails)
  351. and returns with ENOMEM while mmap(MAP_LOCKED) will not fail. The mmaped
  352. area will still have properties of the locked area - aka. pages will not get
  353. swapped out - but major page faults to fault memory in might still happen.
  354. Furthermore, any mmap() call or brk() call that expands the heap by a
  355. task that has previously called mlockall() with the MCL_FUTURE flag will result
  356. in the newly mapped memory being mlocked. Before the unevictable/mlock
  357. changes, the kernel simply called make_pages_present() to allocate pages and
  358. populate the page table.
  359. To mlock a range of memory under the unevictable/mlock infrastructure, the
  360. mmap() handler and task address space expansion functions call
  361. populate_vma_page_range() specifying the vma and the address range to mlock.
  362. The callers of populate_vma_page_range() will have already added the memory range
  363. to be mlocked to the task's "locked_vm". To account for filtered VMAs,
  364. populate_vma_page_range() returns the number of pages NOT mlocked. All of the
  365. callers then subtract a non-negative return value from the task's locked_vm. A
  366. negative return value represent an error - for example, from get_user_pages()
  367. attempting to fault in a VMA with PROT_NONE access. In this case, we leave the
  368. memory range accounted as locked_vm, as the protections could be changed later
  369. and pages allocated into that region.
  370. munmap()/exit()/exec() System Call Handling
  371. -------------------------------------------
  372. When unmapping an mlocked region of memory, whether by an explicit call to
  373. munmap() or via an internal unmap from exit() or exec() processing, we must
  374. munlock the pages if we're removing the last VM_LOCKED VMA that maps the pages.
  375. Before the unevictable/mlock changes, mlocking did not mark the pages in any
  376. way, so unmapping them required no processing.
  377. To munlock a range of memory under the unevictable/mlock infrastructure, the
  378. munmap() handler and task address space call tear down function
  379. munlock_vma_pages_all(). The name reflects the observation that one always
  380. specifies the entire VMA range when munlock()ing during unmap of a region.
  381. Because of the VMA filtering when mlocking() regions, only "normal" VMAs that
  382. actually contain mlocked pages will be passed to munlock_vma_pages_all().
  383. munlock_vma_pages_all() clears the VM_LOCKED VMA flag and, like mlock_fixup()
  384. for the munlock case, calls __munlock_vma_pages_range() to walk the page table
  385. for the VMA's memory range and munlock_vma_page() each resident page mapped by
  386. the VMA. This effectively munlocks the page, only if this is the last
  387. VM_LOCKED VMA that maps the page.
  388. try_to_unmap()
  389. --------------
  390. Pages can, of course, be mapped into multiple VMAs. Some of these VMAs may
  391. have VM_LOCKED flag set. It is possible for a page mapped into one or more
  392. VM_LOCKED VMAs not to have the PG_mlocked flag set and therefore reside on one
  393. of the active or inactive LRU lists. This could happen if, for example, a task
  394. in the process of munlocking the page could not isolate the page from the LRU.
  395. As a result, vmscan/shrink_page_list() might encounter such a page as described
  396. in section "vmscan's handling of unevictable pages". To handle this situation,
  397. try_to_unmap() checks for VM_LOCKED VMAs while it is walking a page's reverse
  398. map.
  399. try_to_unmap() is always called, by either vmscan for reclaim or for page
  400. migration, with the argument page locked and isolated from the LRU. Separate
  401. functions handle anonymous and mapped file and KSM pages, as these types of
  402. pages have different reverse map lookup mechanisms, with different locking.
  403. In each case, whether rmap_walk_anon() or rmap_walk_file() or rmap_walk_ksm(),
  404. it will call try_to_unmap_one() for every VMA which might contain the page.
  405. When trying to reclaim, if try_to_unmap_one() finds the page in a VM_LOCKED
  406. VMA, it will then mlock the page via mlock_vma_page() instead of unmapping it,
  407. and return SWAP_MLOCK to indicate that the page is unevictable: and the scan
  408. stops there.
  409. mlock_vma_page() is called while holding the page table's lock (in addition
  410. to the page lock, and the rmap lock): to serialize against concurrent mlock or
  411. munlock or munmap system calls, mm teardown (munlock_vma_pages_all), reclaim,
  412. holepunching, and truncation of file pages and their anonymous COWed pages.
  413. try_to_munlock() Reverse Map Scan
  414. ---------------------------------
  415. .. warning::
  416. [!] TODO/FIXME: a better name might be page_mlocked() - analogous to the
  417. page_referenced() reverse map walker.
  418. When munlock_vma_page() [see section :ref:`munlock()/munlockall() System Call
  419. Handling <munlock_munlockall_handling>` above] tries to munlock a
  420. page, it needs to determine whether or not the page is mapped by any
  421. VM_LOCKED VMA without actually attempting to unmap all PTEs from the
  422. page. For this purpose, the unevictable/mlock infrastructure
  423. introduced a variant of try_to_unmap() called try_to_munlock().
  424. try_to_munlock() calls the same functions as try_to_unmap() for anonymous and
  425. mapped file and KSM pages with a flag argument specifying unlock versus unmap
  426. processing. Again, these functions walk the respective reverse maps looking
  427. for VM_LOCKED VMAs. When such a VMA is found, as in the try_to_unmap() case,
  428. the functions mlock the page via mlock_vma_page() and return SWAP_MLOCK. This
  429. undoes the pre-clearing of the page's PG_mlocked done by munlock_vma_page.
  430. Note that try_to_munlock()'s reverse map walk must visit every VMA in a page's
  431. reverse map to determine that a page is NOT mapped into any VM_LOCKED VMA.
  432. However, the scan can terminate when it encounters a VM_LOCKED VMA.
  433. Although try_to_munlock() might be called a great many times when munlocking a
  434. large region or tearing down a large address space that has been mlocked via
  435. mlockall(), overall this is a fairly rare event.
  436. Page Reclaim in shrink_*_list()
  437. -------------------------------
  438. shrink_active_list() culls any obviously unevictable pages - i.e.
  439. !page_evictable(page) - diverting these to the unevictable list.
  440. However, shrink_active_list() only sees unevictable pages that made it onto the
  441. active/inactive lru lists. Note that these pages do not have PageUnevictable
  442. set - otherwise they would be on the unevictable list and shrink_active_list
  443. would never see them.
  444. Some examples of these unevictable pages on the LRU lists are:
  445. (1) ramfs pages that have been placed on the LRU lists when first allocated.
  446. (2) SHM_LOCK'd shared memory pages. shmctl(SHM_LOCK) does not attempt to
  447. allocate or fault in the pages in the shared memory region. This happens
  448. when an application accesses the page the first time after SHM_LOCK'ing
  449. the segment.
  450. (3) mlocked pages that could not be isolated from the LRU and moved to the
  451. unevictable list in mlock_vma_page().
  452. shrink_inactive_list() also diverts any unevictable pages that it finds on the
  453. inactive lists to the appropriate zone's unevictable list.
  454. shrink_inactive_list() should only see SHM_LOCK'd pages that became SHM_LOCK'd
  455. after shrink_active_list() had moved them to the inactive list, or pages mapped
  456. into VM_LOCKED VMAs that munlock_vma_page() couldn't isolate from the LRU to
  457. recheck via try_to_munlock(). shrink_inactive_list() won't notice the latter,
  458. but will pass on to shrink_page_list().
  459. shrink_page_list() again culls obviously unevictable pages that it could
  460. encounter for similar reason to shrink_inactive_list(). Pages mapped into
  461. VM_LOCKED VMAs but without PG_mlocked set will make it all the way to
  462. try_to_unmap(). shrink_page_list() will divert them to the unevictable list
  463. when try_to_unmap() returns SWAP_MLOCK, as discussed above.