unevictable-lru.txt 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615
  1. This document describes the Linux memory management "Unevictable LRU"
  2. infrastructure and the use of this infrastructure to manage several types
  3. of "unevictable" pages. The document attempts to provide the overall
  4. rationale behind this mechanism and the rationale for some of the design
  5. decisions that drove the implementation. The latter design rationale is
  6. discussed in the context of an implementation description. Admittedly, one
  7. can obtain the implementation details--the "what does it do?"--by reading the
  8. code. One hopes that the descriptions below add value by provide the answer
  9. to "why does it do that?".
  10. Unevictable LRU Infrastructure:
  11. The Unevictable LRU adds an additional LRU list to track unevictable pages
  12. and to hide these pages from vmscan. This mechanism is based on a patch by
  13. Larry Woodman of Red Hat to address several scalability problems with page
  14. reclaim in Linux. The problems have been observed at customer sites on large
  15. memory x86_64 systems. For example, a non-numal x86_64 platform with 128GB
  16. of main memory will have over 32 million 4k pages in a single zone. When a
  17. large fraction of these pages are not evictable for any reason [see below],
  18. vmscan will spend a lot of time scanning the LRU lists looking for the small
  19. fraction of pages that are evictable. This can result in a situation where
  20. all cpus are spending 100% of their time in vmscan for hours or days on end,
  21. with the system completely unresponsive.
  22. The Unevictable LRU infrastructure addresses the following classes of
  23. unevictable pages:
  24. + page owned by ramfs
  25. + page mapped into SHM_LOCKed shared memory regions
  26. + page mapped into VM_LOCKED [mlock()ed] vmas
  27. The infrastructure might be able to handle other conditions that make pages
  28. unevictable, either by definition or by circumstance, in the future.
  29. The Unevictable LRU List
  30. The Unevictable LRU infrastructure consists of an additional, per-zone, LRU list
  31. called the "unevictable" list and an associated page flag, PG_unevictable, to
  32. indicate that the page is being managed on the unevictable list. The
  33. PG_unevictable flag is analogous to, and mutually exclusive with, the PG_active
  34. flag in that it indicates on which LRU list a page resides when PG_lru is set.
  35. The unevictable LRU list is source configurable based on the UNEVICTABLE_LRU
  36. Kconfig option.
  37. The Unevictable LRU infrastructure maintains unevictable pages on an additional
  38. LRU list for a few reasons:
  39. 1) We get to "treat unevictable pages just like we treat other pages in the
  40. system, which means we get to use the same code to manipulate them, the
  41. same code to isolate them (for migrate, etc.), the same code to keep track
  42. of the statistics, etc..." [Rik van Riel]
  43. 2) We want to be able to migrate unevictable pages between nodes--for memory
  44. defragmentation, workload management and memory hotplug. The linux kernel
  45. can only migrate pages that it can successfully isolate from the lru lists.
  46. If we were to maintain pages elsewise than on an lru-like list, where they
  47. can be found by isolate_lru_page(), we would prevent their migration, unless
  48. we reworked migration code to find the unevictable pages.
  49. The unevictable LRU list does not differentiate between file backed and swap
  50. backed [anon] pages. This differentiation is only important while the pages
  51. are, in fact, evictable.
  52. The unevictable LRU list benefits from the "arrayification" of the per-zone
  53. LRU lists and statistics originally proposed and posted by Christoph Lameter.
  54. The unevictable list does not use the lru pagevec mechanism. Rather,
  55. unevictable pages are placed directly on the page's zone's unevictable
  56. list under the zone lru_lock. The reason for this is to prevent stranding
  57. of pages on the unevictable list when one task has the page isolated from the
  58. lru and other tasks are changing the "evictability" state of the page.
  59. Unevictable LRU and Memory Controller Interaction
  60. The memory controller data structure automatically gets a per zone unevictable
  61. lru list as a result of the "arrayification" of the per-zone LRU lists. The
  62. memory controller tracks the movement of pages to and from the unevictable list.
  63. When a memory control group comes under memory pressure, the controller will
  64. not attempt to reclaim pages on the unevictable list. This has a couple of
  65. effects. Because the pages are "hidden" from reclaim on the unevictable list,
  66. the reclaim process can be more efficient, dealing only with pages that have
  67. a chance of being reclaimed. On the other hand, if too many of the pages
  68. charged to the control group are unevictable, the evictable portion of the
  69. working set of the tasks in the control group may not fit into the available
  70. memory. This can cause the control group to thrash or to oom-kill tasks.
  71. Unevictable LRU: Detecting Unevictable Pages
  72. The function page_evictable(page, vma) in vmscan.c determines whether a
  73. page is evictable or not. For ramfs pages and pages in SHM_LOCKed regions,
  74. page_evictable() tests a new address space flag, AS_UNEVICTABLE, in the page's
  75. address space using a wrapper function. Wrapper functions are used to set,
  76. clear and test the flag to reduce the requirement for #ifdef's throughout the
  77. source code. AS_UNEVICTABLE is set on ramfs inode/mapping when it is created.
  78. This flag remains for the life of the inode.
  79. For shared memory regions, AS_UNEVICTABLE is set when an application
  80. successfully SHM_LOCKs the region and is removed when the region is
  81. SHM_UNLOCKed. Note that shmctl(SHM_LOCK, ...) does not populate the page
  82. tables for the region as does, for example, mlock(). So, we make no special
  83. effort to push any pages in the SHM_LOCKed region to the unevictable list.
  84. Vmscan will do this when/if it encounters the pages during reclaim. On
  85. SHM_UNLOCK, shmctl() scans the pages in the region and "rescues" them from the
  86. unevictable list if no other condition keeps them unevictable. If a SHM_LOCKed
  87. region is destroyed, the pages are also "rescued" from the unevictable list in
  88. the process of freeing them.
  89. page_evictable() detects mlock()ed pages by testing an additional page flag,
  90. PG_mlocked via the PageMlocked() wrapper. If the page is NOT mlocked, and a
  91. non-NULL vma is supplied, page_evictable() will check whether the vma is
  92. VM_LOCKED via is_mlocked_vma(). is_mlocked_vma() will SetPageMlocked() and
  93. update the appropriate statistics if the vma is VM_LOCKED. This method allows
  94. efficient "culling" of pages in the fault path that are being faulted in to
  95. VM_LOCKED vmas.
  96. Unevictable Pages and Vmscan [shrink_*_list()]
  97. If unevictable pages are culled in the fault path, or moved to the unevictable
  98. list at mlock() or mmap() time, vmscan will never encounter the pages until
  99. they have become evictable again, for example, via munlock() and have been
  100. "rescued" from the unevictable list. However, there may be situations where we
  101. decide, for the sake of expediency, to leave a unevictable page on one of the
  102. regular active/inactive LRU lists for vmscan to deal with. Vmscan checks for
  103. such pages in all of the shrink_{active|inactive|page}_list() functions and
  104. will "cull" such pages that it encounters--that is, it diverts those pages to
  105. the unevictable list for the zone being scanned.
  106. There may be situations where a page is mapped into a VM_LOCKED vma, but the
  107. page is not marked as PageMlocked. Such pages will make it all the way to
  108. shrink_page_list() where they will be detected when vmscan walks the reverse
  109. map in try_to_unmap(). If try_to_unmap() returns SWAP_MLOCK, shrink_page_list()
  110. will cull the page at that point.
  111. Note that for anonymous pages, shrink_page_list() attempts to add the page to
  112. the swap cache before it tries to unmap the page. To avoid this unnecessary
  113. consumption of swap space, shrink_page_list() calls try_to_munlock() to check
  114. whether any VM_LOCKED vmas map the page without attempting to unmap the page.
  115. If try_to_munlock() returns SWAP_MLOCK, shrink_page_list() will cull the page
  116. without consuming swap space. try_to_munlock() will be described below.
  117. To "cull" an unevictable page, vmscan simply puts the page back on the lru
  118. list using putback_lru_page()--the inverse operation to isolate_lru_page()--
  119. after dropping the page lock. Because the condition which makes the page
  120. unevictable may change once the page is unlocked, putback_lru_page() will
  121. recheck the unevictable state of a page that it places on the unevictable lru
  122. list. If the page has become unevictable, putback_lru_page() removes it from
  123. the list and retries, including the page_unevictable() test. Because such a
  124. race is a rare event and movement of pages onto the unevictable list should be
  125. rare, these extra evictabilty checks should not occur in the majority of calls
  126. to putback_lru_page().
  127. Mlocked Page: Prior Work
  128. The "Unevictable Mlocked Pages" infrastructure is based on work originally
  129. posted by Nick Piggin in an RFC patch entitled "mm: mlocked pages off LRU".
  130. Nick posted his patch as an alternative to a patch posted by Christoph
  131. Lameter to achieve the same objective--hiding mlocked pages from vmscan.
  132. In Nick's patch, he used one of the struct page lru list link fields as a count
  133. of VM_LOCKED vmas that map the page. This use of the link field for a count
  134. prevented the management of the pages on an LRU list. Thus, mlocked pages were
  135. not migratable as isolate_lru_page() could not find them and the lru list link
  136. field was not available to the migration subsystem. Nick resolved this by
  137. putting mlocked pages back on the lru list before attempting to isolate them,
  138. thus abandoning the count of VM_LOCKED vmas. When Nick's patch was integrated
  139. with the Unevictable LRU work, the count was replaced by walking the reverse
  140. map to determine whether any VM_LOCKED vmas mapped the page. More on this
  141. below.
  142. Mlocked Pages: Basic Management
  143. Mlocked pages--pages mapped into a VM_LOCKED vma--represent one class of
  144. unevictable pages. When such a page has been "noticed" by the memory
  145. management subsystem, the page is marked with the PG_mlocked [PageMlocked()]
  146. flag. A PageMlocked() page will be placed on the unevictable LRU list when
  147. it is added to the LRU. Pages can be "noticed" by memory management in
  148. several places:
  149. 1) in the mlock()/mlockall() system call handlers.
  150. 2) in the mmap() system call handler when mmap()ing a region with the
  151. MAP_LOCKED flag, or mmap()ing a region in a task that has called
  152. mlockall() with the MCL_FUTURE flag. Both of these conditions result
  153. in the VM_LOCKED flag being set for the vma.
  154. 3) in the fault path, if mlocked pages are "culled" in the fault path,
  155. and when a VM_LOCKED stack segment is expanded.
  156. 4) as mentioned above, in vmscan:shrink_page_list() with attempting to
  157. reclaim a page in a VM_LOCKED vma--via try_to_unmap() or try_to_munlock().
  158. Mlocked pages become unlocked and rescued from the unevictable list when:
  159. 1) mapped in a range unlocked via the munlock()/munlockall() system calls.
  160. 2) munmapped() out of the last VM_LOCKED vma that maps the page, including
  161. unmapping at task exit.
  162. 3) when the page is truncated from the last VM_LOCKED vma of an mmap()ed file.
  163. 4) before a page is COWed in a VM_LOCKED vma.
  164. Mlocked Pages: mlock()/mlockall() System Call Handling
  165. Both [do_]mlock() and [do_]mlockall() system call handlers call mlock_fixup()
  166. for each vma in the range specified by the call. In the case of mlockall(),
  167. this is the entire active address space of the task. Note that mlock_fixup()
  168. is used for both mlock()ing and munlock()ing a range of memory. A call to
  169. mlock() an already VM_LOCKED vma, or to munlock() a vma that is not VM_LOCKED
  170. is treated as a no-op--mlock_fixup() simply returns.
  171. If the vma passes some filtering described in "Mlocked Pages: Filtering Vmas"
  172. below, mlock_fixup() will attempt to merge the vma with its neighbors or split
  173. off a subset of the vma if the range does not cover the entire vma. Once the
  174. vma has been merged or split or neither, mlock_fixup() will call
  175. __mlock_vma_pages_range() to fault in the pages via get_user_pages() and
  176. to mark the pages as mlocked via mlock_vma_page().
  177. Note that the vma being mlocked might be mapped with PROT_NONE. In this case,
  178. get_user_pages() will be unable to fault in the pages. That's OK. If pages
  179. do end up getting faulted into this VM_LOCKED vma, we'll handle them in the
  180. fault path or in vmscan.
  181. Also note that a page returned by get_user_pages() could be truncated or
  182. migrated out from under us, while we're trying to mlock it. To detect
  183. this, __mlock_vma_pages_range() tests the page_mapping after acquiring
  184. the page lock. If the page is still associated with its mapping, we'll
  185. go ahead and call mlock_vma_page(). If the mapping is gone, we just
  186. unlock the page and move on. Worse case, this results in page mapped
  187. in a VM_LOCKED vma remaining on a normal LRU list without being
  188. PageMlocked(). Again, vmscan will detect and cull such pages.
  189. mlock_vma_page(), called with the page locked [N.B., not "mlocked"], will
  190. TestSetPageMlocked() for each page returned by get_user_pages(). We use
  191. TestSetPageMlocked() because the page might already be mlocked by another
  192. task/vma and we don't want to do extra work. We especially do not want to
  193. count an mlocked page more than once in the statistics. If the page was
  194. already mlocked, mlock_vma_page() is done.
  195. If the page was NOT already mlocked, mlock_vma_page() attempts to isolate the
  196. page from the LRU, as it is likely on the appropriate active or inactive list
  197. at that time. If the isolate_lru_page() succeeds, mlock_vma_page() will
  198. putback the page--putback_lru_page()--which will notice that the page is now
  199. mlocked and divert the page to the zone's unevictable LRU list. If
  200. mlock_vma_page() is unable to isolate the page from the LRU, vmscan will handle
  201. it later if/when it attempts to reclaim the page.
  202. Mlocked Pages: Filtering Special Vmas
  203. mlock_fixup() filters several classes of "special" vmas:
  204. 1) vmas with VM_IO|VM_PFNMAP set are skipped entirely. The pages behind
  205. these mappings are inherently pinned, so we don't need to mark them as
  206. mlocked. In any case, most of the pages have no struct page in which to
  207. so mark the page. Because of this, get_user_pages() will fail for these
  208. vmas, so there is no sense in attempting to visit them.
  209. 2) vmas mapping hugetlbfs page are already effectively pinned into memory.
  210. We don't need nor want to mlock() these pages. However, to preserve the
  211. prior behavior of mlock()--before the unevictable/mlock changes--mlock_fixup()
  212. will call make_pages_present() in the hugetlbfs vma range to allocate the
  213. huge pages and populate the ptes.
  214. 3) vmas with VM_DONTEXPAND|VM_RESERVED are generally user space mappings of
  215. kernel pages, such as the vdso page, relay channel pages, etc. These pages
  216. are inherently unevictable and are not managed on the LRU lists.
  217. mlock_fixup() treats these vmas the same as hugetlbfs vmas. It calls
  218. make_pages_present() to populate the ptes.
  219. Note that for all of these special vmas, mlock_fixup() does not set the
  220. VM_LOCKED flag. Therefore, we won't have to deal with them later during
  221. munlock() or munmap()--for example, at task exit. Neither does mlock_fixup()
  222. account these vmas against the task's "locked_vm".
  223. Mlocked Pages: Downgrading the Mmap Semaphore.
  224. mlock_fixup() must be called with the mmap semaphore held for write, because
  225. it may have to merge or split vmas. However, mlocking a large region of
  226. memory can take a long time--especially if vmscan must reclaim pages to
  227. satisfy the regions requirements. Faulting in a large region with the mmap
  228. semaphore held for write can hold off other faults on the address space, in
  229. the case of a multi-threaded task. It can also hold off scans of the task's
  230. address space via /proc. While testing under heavy load, it was observed that
  231. the ps(1) command could be held off for many minutes while a large segment was
  232. mlock()ed down.
  233. To address this issue, and to make the system more responsive during mlock()ing
  234. of large segments, mlock_fixup() downgrades the mmap semaphore to read mode
  235. during the call to __mlock_vma_pages_range(). This works fine. However, the
  236. callers of mlock_fixup() expect the semaphore to be returned in write mode.
  237. So, mlock_fixup() "upgrades" the semphore to write mode. Linux does not
  238. support an atomic upgrade_sem() call, so mlock_fixup() must drop the semaphore
  239. and reacquire it in write mode. In a multi-threaded task, it is possible for
  240. the task memory map to change while the semaphore is dropped. Therefore,
  241. mlock_fixup() looks up the vma at the range start address after reacquiring
  242. the semaphore in write mode and verifies that it still covers the original
  243. range. If not, mlock_fixup() returns an error [-EAGAIN]. All callers of
  244. mlock_fixup() have been changed to deal with this new error condition.
  245. Note: when munlocking a region, all of the pages should already be resident--
  246. unless we have racing threads mlocking() and munlocking() regions. So,
  247. unlocking should not have to wait for page allocations nor faults of any kind.
  248. Therefore mlock_fixup() does not downgrade the semaphore for munlock().
  249. Mlocked Pages: munlock()/munlockall() System Call Handling
  250. The munlock() and munlockall() system calls are handled by the same functions--
  251. do_mlock[all]()--as the mlock() and mlockall() system calls with the unlock
  252. vs lock operation indicated by an argument. So, these system calls are also
  253. handled by mlock_fixup(). Again, if called for an already munlock()ed vma,
  254. mlock_fixup() simply returns. Because of the vma filtering discussed above,
  255. VM_LOCKED will not be set in any "special" vmas. So, these vmas will be
  256. ignored for munlock.
  257. If the vma is VM_LOCKED, mlock_fixup() again attempts to merge or split off
  258. the specified range. The range is then munlocked via the function
  259. __mlock_vma_pages_range()--the same function used to mlock a vma range--
  260. passing a flag to indicate that munlock() is being performed.
  261. Because the vma access protections could have been changed to PROT_NONE after
  262. faulting in and mlocking some pages, get_user_pages() was unreliable for visiting
  263. these pages for munlocking. Because we don't want to leave pages mlocked(),
  264. get_user_pages() was enhanced to accept a flag to ignore the permissions when
  265. fetching the pages--all of which should be resident as a result of previous
  266. mlock()ing.
  267. For munlock(), __mlock_vma_pages_range() unlocks individual pages by calling
  268. munlock_vma_page(). munlock_vma_page() unconditionally clears the PG_mlocked
  269. flag using TestClearPageMlocked(). As with mlock_vma_page(), munlock_vma_page()
  270. use the Test*PageMlocked() function to handle the case where the page might
  271. have already been unlocked by another task. If the page was mlocked,
  272. munlock_vma_page() updates that zone statistics for the number of mlocked
  273. pages. Note, however, that at this point we haven't checked whether the page
  274. is mapped by other VM_LOCKED vmas.
  275. We can't call try_to_munlock(), the function that walks the reverse map to check
  276. for other VM_LOCKED vmas, without first isolating the page from the LRU.
  277. try_to_munlock() is a variant of try_to_unmap() and thus requires that the page
  278. not be on an lru list. [More on these below.] However, the call to
  279. isolate_lru_page() could fail, in which case we couldn't try_to_munlock().
  280. So, we go ahead and clear PG_mlocked up front, as this might be the only chance
  281. we have. If we can successfully isolate the page, we go ahead and
  282. try_to_munlock(), which will restore the PG_mlocked flag and update the zone
  283. page statistics if it finds another vma holding the page mlocked. If we fail
  284. to isolate the page, we'll have left a potentially mlocked page on the LRU.
  285. This is fine, because we'll catch it later when/if vmscan tries to reclaim the
  286. page. This should be relatively rare.
  287. Mlocked Pages: Migrating Them...
  288. A page that is being migrated has been isolated from the lru lists and is
  289. held locked across unmapping of the page, updating the page's mapping
  290. [address_space] entry and copying the contents and state, until the
  291. page table entry has been replaced with an entry that refers to the new
  292. page. Linux supports migration of mlocked pages and other unevictable
  293. pages. This involves simply moving the PageMlocked and PageUnevictable states
  294. from the old page to the new page.
  295. Note that page migration can race with mlocking or munlocking of the same
  296. page. This has been discussed from the mlock/munlock perspective in the
  297. respective sections above. Both processes [migration, m[un]locking], hold
  298. the page locked. This provides the first level of synchronization. Page
  299. migration zeros out the page_mapping of the old page before unlocking it,
  300. so m[un]lock can skip these pages by testing the page mapping under page
  301. lock.
  302. When completing page migration, we place the new and old pages back onto the
  303. lru after dropping the page lock. The "unneeded" page--old page on success,
  304. new page on failure--will be freed when the reference count held by the
  305. migration process is released. To ensure that we don't strand pages on the
  306. unevictable list because of a race between munlock and migration, page
  307. migration uses the putback_lru_page() function to add migrated pages back to
  308. the lru.
  309. Mlocked Pages: mmap(MAP_LOCKED) System Call Handling
  310. In addition the the mlock()/mlockall() system calls, an application can request
  311. that a region of memory be mlocked using the MAP_LOCKED flag with the mmap()
  312. call. Furthermore, any mmap() call or brk() call that expands the heap by a
  313. task that has previously called mlockall() with the MCL_FUTURE flag will result
  314. in the newly mapped memory being mlocked. Before the unevictable/mlock changes,
  315. the kernel simply called make_pages_present() to allocate pages and populate
  316. the page table.
  317. To mlock a range of memory under the unevictable/mlock infrastructure, the
  318. mmap() handler and task address space expansion functions call
  319. mlock_vma_pages_range() specifying the vma and the address range to mlock.
  320. mlock_vma_pages_range() filters vmas like mlock_fixup(), as described above in
  321. "Mlocked Pages: Filtering Vmas". It will clear the VM_LOCKED flag, which will
  322. have already been set by the caller, in filtered vmas. Thus these vma's need
  323. not be visited for munlock when the region is unmapped.
  324. For "normal" vmas, mlock_vma_pages_range() calls __mlock_vma_pages_range() to
  325. fault/allocate the pages and mlock them. Again, like mlock_fixup(),
  326. mlock_vma_pages_range() downgrades the mmap semaphore to read mode before
  327. attempting to fault/allocate and mlock the pages; and "upgrades" the semaphore
  328. back to write mode before returning.
  329. The callers of mlock_vma_pages_range() will have already added the memory
  330. range to be mlocked to the task's "locked_vm". To account for filtered vmas,
  331. mlock_vma_pages_range() returns the number of pages NOT mlocked. All of the
  332. callers then subtract a non-negative return value from the task's locked_vm.
  333. A negative return value represent an error--for example, from get_user_pages()
  334. attempting to fault in a vma with PROT_NONE access. In this case, we leave
  335. the memory range accounted as locked_vm, as the protections could be changed
  336. later and pages allocated into that region.
  337. Mlocked Pages: munmap()/exit()/exec() System Call Handling
  338. When unmapping an mlocked region of memory, whether by an explicit call to
  339. munmap() or via an internal unmap from exit() or exec() processing, we must
  340. munlock the pages if we're removing the last VM_LOCKED vma that maps the pages.
  341. Before the unevictable/mlock changes, mlocking did not mark the pages in any way,
  342. so unmapping them required no processing.
  343. To munlock a range of memory under the unevictable/mlock infrastructure, the
  344. munmap() hander and task address space tear down function call
  345. munlock_vma_pages_all(). The name reflects the observation that one always
  346. specifies the entire vma range when munlock()ing during unmap of a region.
  347. Because of the vma filtering when mlocking() regions, only "normal" vmas that
  348. actually contain mlocked pages will be passed to munlock_vma_pages_all().
  349. munlock_vma_pages_all() clears the VM_LOCKED vma flag and, like mlock_fixup()
  350. for the munlock case, calls __munlock_vma_pages_range() to walk the page table
  351. for the vma's memory range and munlock_vma_page() each resident page mapped by
  352. the vma. This effectively munlocks the page, only if this is the last
  353. VM_LOCKED vma that maps the page.
  354. Mlocked Page: try_to_unmap()
  355. [Note: the code changes represented by this section are really quite small
  356. compared to the text to describe what happening and why, and to discuss the
  357. implications.]
  358. Pages can, of course, be mapped into multiple vmas. Some of these vmas may
  359. have VM_LOCKED flag set. It is possible for a page mapped into one or more
  360. VM_LOCKED vmas not to have the PG_mlocked flag set and therefore reside on one
  361. of the active or inactive LRU lists. This could happen if, for example, a
  362. task in the process of munlock()ing the page could not isolate the page from
  363. the LRU. As a result, vmscan/shrink_page_list() might encounter such a page
  364. as described in "Unevictable Pages and Vmscan [shrink_*_list()]". To
  365. handle this situation, try_to_unmap() has been enhanced to check for VM_LOCKED
  366. vmas while it is walking a page's reverse map.
  367. try_to_unmap() is always called, by either vmscan for reclaim or for page
  368. migration, with the argument page locked and isolated from the LRU. BUG_ON()
  369. assertions enforce this requirement. Separate functions handle anonymous and
  370. mapped file pages, as these types of pages have different reverse map
  371. mechanisms.
  372. try_to_unmap_anon()
  373. To unmap anonymous pages, each vma in the list anchored in the anon_vma must be
  374. visited--at least until a VM_LOCKED vma is encountered. If the page is being
  375. unmapped for migration, VM_LOCKED vmas do not stop the process because mlocked
  376. pages are migratable. However, for reclaim, if the page is mapped into a
  377. VM_LOCKED vma, the scan stops. try_to_unmap() attempts to acquire the mmap
  378. semphore of the mm_struct to which the vma belongs in read mode. If this is
  379. successful, try_to_unmap() will mlock the page via mlock_vma_page()--we
  380. wouldn't have gotten to try_to_unmap() if the page were already mlocked--and
  381. will return SWAP_MLOCK, indicating that the page is unevictable. If the
  382. mmap semaphore cannot be acquired, we are not sure whether the page is really
  383. unevictable or not. In this case, try_to_unmap() will return SWAP_AGAIN.
  384. try_to_unmap_file() -- linear mappings
  385. Unmapping of a mapped file page works the same, except that the scan visits
  386. all vmas that maps the page's index/page offset in the page's mapping's
  387. reverse map priority search tree. It must also visit each vma in the page's
  388. mapping's non-linear list, if the list is non-empty. As for anonymous pages,
  389. on encountering a VM_LOCKED vma for a mapped file page, try_to_unmap() will
  390. attempt to acquire the associated mm_struct's mmap semaphore to mlock the page,
  391. returning SWAP_MLOCK if this is successful, and SWAP_AGAIN, if not.
  392. try_to_unmap_file() -- non-linear mappings
  393. If a page's mapping contains a non-empty non-linear mapping vma list, then
  394. try_to_un{map|lock}() must also visit each vma in that list to determine
  395. whether the page is mapped in a VM_LOCKED vma. Again, the scan must visit
  396. all vmas in the non-linear list to ensure that the pages is not/should not be
  397. mlocked. If a VM_LOCKED vma is found in the list, the scan could terminate.
  398. However, there is no easy way to determine whether the page is actually mapped
  399. in a given vma--either for unmapping or testing whether the VM_LOCKED vma
  400. actually pins the page.
  401. So, try_to_unmap_file() handles non-linear mappings by scanning a certain
  402. number of pages--a "cluster"--in each non-linear vma associated with the page's
  403. mapping, for each file mapped page that vmscan tries to unmap. If this happens
  404. to unmap the page we're trying to unmap, try_to_unmap() will notice this on
  405. return--(page_mapcount(page) == 0)--and return SWAP_SUCCESS. Otherwise, it
  406. will return SWAP_AGAIN, causing vmscan to recirculate this page. We take
  407. advantage of the cluster scan in try_to_unmap_cluster() as follows:
  408. For each non-linear vma, try_to_unmap_cluster() attempts to acquire the mmap
  409. semaphore of the associated mm_struct for read without blocking. If this
  410. attempt is successful and the vma is VM_LOCKED, try_to_unmap_cluster() will
  411. retain the mmap semaphore for the scan; otherwise it drops it here. Then,
  412. for each page in the cluster, if we're holding the mmap semaphore for a locked
  413. vma, try_to_unmap_cluster() calls mlock_vma_page() to mlock the page. This
  414. call is a no-op if the page is already locked, but will mlock any pages in
  415. the non-linear mapping that happen to be unlocked. If one of the pages so
  416. mlocked is the page passed in to try_to_unmap(), try_to_unmap_cluster() will
  417. return SWAP_MLOCK, rather than the default SWAP_AGAIN. This will allow vmscan
  418. to cull the page, rather than recirculating it on the inactive list. Again,
  419. if try_to_unmap_cluster() cannot acquire the vma's mmap sem, it returns
  420. SWAP_AGAIN, indicating that the page is mapped by a VM_LOCKED vma, but
  421. couldn't be mlocked.
  422. Mlocked pages: try_to_munlock() Reverse Map Scan
  423. TODO/FIXME: a better name might be page_mlocked()--analogous to the
  424. page_referenced() reverse map walker--especially if we continue to call this
  425. from shrink_page_list(). See related TODO/FIXME below.
  426. When munlock_vma_page()--see "Mlocked Pages: munlock()/munlockall() System
  427. Call Handling" above--tries to munlock a page, or when shrink_page_list()
  428. encounters an anonymous page that is not yet in the swap cache, they need to
  429. determine whether or not the page is mapped by any VM_LOCKED vma, without
  430. actually attempting to unmap all ptes from the page. For this purpose, the
  431. unevictable/mlock infrastructure introduced a variant of try_to_unmap() called
  432. try_to_munlock().
  433. try_to_munlock() calls the same functions as try_to_unmap() for anonymous and
  434. mapped file pages with an additional argument specifing unlock versus unmap
  435. processing. Again, these functions walk the respective reverse maps looking
  436. for VM_LOCKED vmas. When such a vma is found for anonymous pages and file
  437. pages mapped in linear VMAs, as in the try_to_unmap() case, the functions
  438. attempt to acquire the associated mmap semphore, mlock the page via
  439. mlock_vma_page() and return SWAP_MLOCK. This effectively undoes the
  440. pre-clearing of the page's PG_mlocked done by munlock_vma_page() and informs
  441. shrink_page_list() that the anonymous page should be culled rather than added
  442. to the swap cache in preparation for a try_to_unmap() that will almost
  443. certainly fail.
  444. If try_to_unmap() is unable to acquire a VM_LOCKED vma's associated mmap
  445. semaphore, it will return SWAP_AGAIN. This will allow shrink_page_list()
  446. to recycle the page on the inactive list and hope that it has better luck
  447. with the page next time.
  448. For file pages mapped into non-linear vmas, the try_to_munlock() logic works
  449. slightly differently. On encountering a VM_LOCKED non-linear vma that might
  450. map the page, try_to_munlock() returns SWAP_AGAIN without actually mlocking
  451. the page. munlock_vma_page() will just leave the page unlocked and let
  452. vmscan deal with it--the usual fallback position.
  453. Note that try_to_munlock()'s reverse map walk must visit every vma in a pages'
  454. reverse map to determine that a page is NOT mapped into any VM_LOCKED vma.
  455. However, the scan can terminate when it encounters a VM_LOCKED vma and can
  456. successfully acquire the vma's mmap semphore for read and mlock the page.
  457. Although try_to_munlock() can be called many [very many!] times when
  458. munlock()ing a large region or tearing down a large address space that has been
  459. mlocked via mlockall(), overall this is a fairly rare event. In addition,
  460. although shrink_page_list() calls try_to_munlock() for every anonymous page that
  461. it handles that is not yet in the swap cache, on average anonymous pages will
  462. have very short reverse map lists.
  463. Mlocked Page: Page Reclaim in shrink_*_list()
  464. shrink_active_list() culls any obviously unevictable pages--i.e.,
  465. !page_evictable(page, NULL)--diverting these to the unevictable lru
  466. list. However, shrink_active_list() only sees unevictable pages that
  467. made it onto the active/inactive lru lists. Note that these pages do not
  468. have PageUnevictable set--otherwise, they would be on the unevictable list and
  469. shrink_active_list would never see them.
  470. Some examples of these unevictable pages on the LRU lists are:
  471. 1) ramfs pages that have been placed on the lru lists when first allocated.
  472. 2) SHM_LOCKed shared memory pages. shmctl(SHM_LOCK) does not attempt to
  473. allocate or fault in the pages in the shared memory region. This happens
  474. when an application accesses the page the first time after SHM_LOCKing
  475. the segment.
  476. 3) Mlocked pages that could not be isolated from the lru and moved to the
  477. unevictable list in mlock_vma_page().
  478. 3) Pages mapped into multiple VM_LOCKED vmas, but try_to_munlock() couldn't
  479. acquire the vma's mmap semaphore to test the flags and set PageMlocked.
  480. munlock_vma_page() was forced to let the page back on to the normal
  481. LRU list for vmscan to handle.
  482. shrink_inactive_list() also culls any unevictable pages that it finds
  483. on the inactive lists, again diverting them to the appropriate zone's unevictable
  484. lru list. shrink_inactive_list() should only see SHM_LOCKed pages that became
  485. SHM_LOCKed after shrink_active_list() had moved them to the inactive list, or
  486. pages mapped into VM_LOCKED vmas that munlock_vma_page() couldn't isolate from
  487. the lru to recheck via try_to_munlock(). shrink_inactive_list() won't notice
  488. the latter, but will pass on to shrink_page_list().
  489. shrink_page_list() again culls obviously unevictable pages that it could
  490. encounter for similar reason to shrink_inactive_list(). As already discussed,
  491. shrink_page_list() proactively looks for anonymous pages that should have
  492. PG_mlocked set but don't--these would not be detected by page_evictable()--to
  493. avoid adding them to the swap cache unnecessarily. File pages mapped into
  494. VM_LOCKED vmas but without PG_mlocked set will make it all the way to
  495. try_to_unmap(). shrink_page_list() will divert them to the unevictable list when
  496. try_to_unmap() returns SWAP_MLOCK, as discussed above.
  497. TODO/FIXME: If we can enhance the swap cache to reliably remove entries
  498. with page_count(page) > 2, as long as all ptes are mapped to the page and
  499. not the swap entry, we can probably remove the call to try_to_munlock() in
  500. shrink_page_list() and just remove the page from the swap cache when
  501. try_to_unmap() returns SWAP_MLOCK. Currently, remove_exclusive_swap_page()
  502. doesn't seem to allow that.