unevictable-lru.txt 32 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588
  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. To "cull" an unevictable page, vmscan simply puts the page back on the lru
  112. list using putback_lru_page()--the inverse operation to isolate_lru_page()--
  113. after dropping the page lock. Because the condition which makes the page
  114. unevictable may change once the page is unlocked, putback_lru_page() will
  115. recheck the unevictable state of a page that it places on the unevictable lru
  116. list. If the page has become unevictable, putback_lru_page() removes it from
  117. the list and retries, including the page_unevictable() test. Because such a
  118. race is a rare event and movement of pages onto the unevictable list should be
  119. rare, these extra evictabilty checks should not occur in the majority of calls
  120. to putback_lru_page().
  121. Mlocked Page: Prior Work
  122. The "Unevictable Mlocked Pages" infrastructure is based on work originally
  123. posted by Nick Piggin in an RFC patch entitled "mm: mlocked pages off LRU".
  124. Nick posted his patch as an alternative to a patch posted by Christoph
  125. Lameter to achieve the same objective--hiding mlocked pages from vmscan.
  126. In Nick's patch, he used one of the struct page lru list link fields as a count
  127. of VM_LOCKED vmas that map the page. This use of the link field for a count
  128. prevented the management of the pages on an LRU list. Thus, mlocked pages were
  129. not migratable as isolate_lru_page() could not find them and the lru list link
  130. field was not available to the migration subsystem. Nick resolved this by
  131. putting mlocked pages back on the lru list before attempting to isolate them,
  132. thus abandoning the count of VM_LOCKED vmas. When Nick's patch was integrated
  133. with the Unevictable LRU work, the count was replaced by walking the reverse
  134. map to determine whether any VM_LOCKED vmas mapped the page. More on this
  135. below.
  136. Mlocked Pages: Basic Management
  137. Mlocked pages--pages mapped into a VM_LOCKED vma--represent one class of
  138. unevictable pages. When such a page has been "noticed" by the memory
  139. management subsystem, the page is marked with the PG_mlocked [PageMlocked()]
  140. flag. A PageMlocked() page will be placed on the unevictable LRU list when
  141. it is added to the LRU. Pages can be "noticed" by memory management in
  142. several places:
  143. 1) in the mlock()/mlockall() system call handlers.
  144. 2) in the mmap() system call handler when mmap()ing a region with the
  145. MAP_LOCKED flag, or mmap()ing a region in a task that has called
  146. mlockall() with the MCL_FUTURE flag. Both of these conditions result
  147. in the VM_LOCKED flag being set for the vma.
  148. 3) in the fault path, if mlocked pages are "culled" in the fault path,
  149. and when a VM_LOCKED stack segment is expanded.
  150. 4) as mentioned above, in vmscan:shrink_page_list() when attempting to
  151. reclaim a page in a VM_LOCKED vma via try_to_unmap().
  152. Mlocked pages become unlocked and rescued from the unevictable list when:
  153. 1) mapped in a range unlocked via the munlock()/munlockall() system calls.
  154. 2) munmapped() out of the last VM_LOCKED vma that maps the page, including
  155. unmapping at task exit.
  156. 3) when the page is truncated from the last VM_LOCKED vma of an mmap()ed file.
  157. 4) before a page is COWed in a VM_LOCKED vma.
  158. Mlocked Pages: mlock()/mlockall() System Call Handling
  159. Both [do_]mlock() and [do_]mlockall() system call handlers call mlock_fixup()
  160. for each vma in the range specified by the call. In the case of mlockall(),
  161. this is the entire active address space of the task. Note that mlock_fixup()
  162. is used for both mlock()ing and munlock()ing a range of memory. A call to
  163. mlock() an already VM_LOCKED vma, or to munlock() a vma that is not VM_LOCKED
  164. is treated as a no-op--mlock_fixup() simply returns.
  165. If the vma passes some filtering described in "Mlocked Pages: Filtering Vmas"
  166. below, mlock_fixup() will attempt to merge the vma with its neighbors or split
  167. off a subset of the vma if the range does not cover the entire vma. Once the
  168. vma has been merged or split or neither, mlock_fixup() will call
  169. __mlock_vma_pages_range() to fault in the pages via get_user_pages() and
  170. to mark the pages as mlocked via mlock_vma_page().
  171. Note that the vma being mlocked might be mapped with PROT_NONE. In this case,
  172. get_user_pages() will be unable to fault in the pages. That's OK. If pages
  173. do end up getting faulted into this VM_LOCKED vma, we'll handle them in the
  174. fault path or in vmscan.
  175. Also note that a page returned by get_user_pages() could be truncated or
  176. migrated out from under us, while we're trying to mlock it. To detect
  177. this, __mlock_vma_pages_range() tests the page_mapping after acquiring
  178. the page lock. If the page is still associated with its mapping, we'll
  179. go ahead and call mlock_vma_page(). If the mapping is gone, we just
  180. unlock the page and move on. Worse case, this results in page mapped
  181. in a VM_LOCKED vma remaining on a normal LRU list without being
  182. PageMlocked(). Again, vmscan will detect and cull such pages.
  183. mlock_vma_page(), called with the page locked [N.B., not "mlocked"], will
  184. TestSetPageMlocked() for each page returned by get_user_pages(). We use
  185. TestSetPageMlocked() because the page might already be mlocked by another
  186. task/vma and we don't want to do extra work. We especially do not want to
  187. count an mlocked page more than once in the statistics. If the page was
  188. already mlocked, mlock_vma_page() is done.
  189. If the page was NOT already mlocked, mlock_vma_page() attempts to isolate the
  190. page from the LRU, as it is likely on the appropriate active or inactive list
  191. at that time. If the isolate_lru_page() succeeds, mlock_vma_page() will
  192. putback the page--putback_lru_page()--which will notice that the page is now
  193. mlocked and divert the page to the zone's unevictable LRU list. If
  194. mlock_vma_page() is unable to isolate the page from the LRU, vmscan will handle
  195. it later if/when it attempts to reclaim the page.
  196. Mlocked Pages: Filtering Special Vmas
  197. mlock_fixup() filters several classes of "special" vmas:
  198. 1) vmas with VM_IO|VM_PFNMAP set are skipped entirely. The pages behind
  199. these mappings are inherently pinned, so we don't need to mark them as
  200. mlocked. In any case, most of the pages have no struct page in which to
  201. so mark the page. Because of this, get_user_pages() will fail for these
  202. vmas, so there is no sense in attempting to visit them.
  203. 2) vmas mapping hugetlbfs page are already effectively pinned into memory.
  204. We don't need nor want to mlock() these pages. However, to preserve the
  205. prior behavior of mlock()--before the unevictable/mlock changes--
  206. mlock_fixup() will call make_pages_present() in the hugetlbfs vma range
  207. to allocate the huge pages and populate the ptes.
  208. 3) vmas with VM_DONTEXPAND|VM_RESERVED are generally user space mappings of
  209. kernel pages, such as the vdso page, relay channel pages, etc. These pages
  210. are inherently unevictable and are not managed on the LRU lists.
  211. mlock_fixup() treats these vmas the same as hugetlbfs vmas. It calls
  212. make_pages_present() to populate the ptes.
  213. Note that for all of these special vmas, mlock_fixup() does not set the
  214. VM_LOCKED flag. Therefore, we won't have to deal with them later during
  215. munlock() or munmap()--for example, at task exit. Neither does mlock_fixup()
  216. account these vmas against the task's "locked_vm".
  217. Mlocked Pages: Downgrading the Mmap Semaphore.
  218. mlock_fixup() must be called with the mmap semaphore held for write, because
  219. it may have to merge or split vmas. However, mlocking a large region of
  220. memory can take a long time--especially if vmscan must reclaim pages to
  221. satisfy the regions requirements. Faulting in a large region with the mmap
  222. semaphore held for write can hold off other faults on the address space, in
  223. the case of a multi-threaded task. It can also hold off scans of the task's
  224. address space via /proc. While testing under heavy load, it was observed that
  225. the ps(1) command could be held off for many minutes while a large segment was
  226. mlock()ed down.
  227. To address this issue, and to make the system more responsive during mlock()ing
  228. of large segments, mlock_fixup() downgrades the mmap semaphore to read mode
  229. during the call to __mlock_vma_pages_range(). This works fine. However, the
  230. callers of mlock_fixup() expect the semaphore to be returned in write mode.
  231. So, mlock_fixup() "upgrades" the semphore to write mode. Linux does not
  232. support an atomic upgrade_sem() call, so mlock_fixup() must drop the semaphore
  233. and reacquire it in write mode. In a multi-threaded task, it is possible for
  234. the task memory map to change while the semaphore is dropped. Therefore,
  235. mlock_fixup() looks up the vma at the range start address after reacquiring
  236. the semaphore in write mode and verifies that it still covers the original
  237. range. If not, mlock_fixup() returns an error [-EAGAIN]. All callers of
  238. mlock_fixup() have been changed to deal with this new error condition.
  239. Note: when munlocking a region, all of the pages should already be resident--
  240. unless we have racing threads mlocking() and munlocking() regions. So,
  241. unlocking should not have to wait for page allocations nor faults of any kind.
  242. Therefore mlock_fixup() does not downgrade the semaphore for munlock().
  243. Mlocked Pages: munlock()/munlockall() System Call Handling
  244. The munlock() and munlockall() system calls are handled by the same functions--
  245. do_mlock[all]()--as the mlock() and mlockall() system calls with the unlock
  246. vs lock operation indicated by an argument. So, these system calls are also
  247. handled by mlock_fixup(). Again, if called for an already munlock()ed vma,
  248. mlock_fixup() simply returns. Because of the vma filtering discussed above,
  249. VM_LOCKED will not be set in any "special" vmas. So, these vmas will be
  250. ignored for munlock.
  251. If the vma is VM_LOCKED, mlock_fixup() again attempts to merge or split off
  252. the specified range. The range is then munlocked via the function
  253. __mlock_vma_pages_range()--the same function used to mlock a vma range--
  254. passing a flag to indicate that munlock() is being performed.
  255. Because the vma access protections could have been changed to PROT_NONE after
  256. faulting in and mlocking pages, get_user_pages() was unreliable for visiting
  257. these pages for munlocking. Because we don't want to leave pages mlocked(),
  258. get_user_pages() was enhanced to accept a flag to ignore the permissions when
  259. fetching the pages--all of which should be resident as a result of previous
  260. mlock()ing.
  261. For munlock(), __mlock_vma_pages_range() unlocks individual pages by calling
  262. munlock_vma_page(). munlock_vma_page() unconditionally clears the PG_mlocked
  263. flag using TestClearPageMlocked(). As with mlock_vma_page(), munlock_vma_page()
  264. use the Test*PageMlocked() function to handle the case where the page might
  265. have already been unlocked by another task. If the page was mlocked,
  266. munlock_vma_page() updates that zone statistics for the number of mlocked
  267. pages. Note, however, that at this point we haven't checked whether the page
  268. is mapped by other VM_LOCKED vmas.
  269. We can't call try_to_munlock(), the function that walks the reverse map to check
  270. for other VM_LOCKED vmas, without first isolating the page from the LRU.
  271. try_to_munlock() is a variant of try_to_unmap() and thus requires that the page
  272. not be on an lru list. [More on these below.] However, the call to
  273. isolate_lru_page() could fail, in which case we couldn't try_to_munlock().
  274. So, we go ahead and clear PG_mlocked up front, as this might be the only chance
  275. we have. If we can successfully isolate the page, we go ahead and
  276. try_to_munlock(), which will restore the PG_mlocked flag and update the zone
  277. page statistics if it finds another vma holding the page mlocked. If we fail
  278. to isolate the page, we'll have left a potentially mlocked page on the LRU.
  279. This is fine, because we'll catch it later when/if vmscan tries to reclaim the
  280. page. This should be relatively rare.
  281. Mlocked Pages: Migrating Them...
  282. A page that is being migrated has been isolated from the lru lists and is
  283. held locked across unmapping of the page, updating the page's mapping
  284. [address_space] entry and copying the contents and state, until the
  285. page table entry has been replaced with an entry that refers to the new
  286. page. Linux supports migration of mlocked pages and other unevictable
  287. pages. This involves simply moving the PageMlocked and PageUnevictable states
  288. from the old page to the new page.
  289. Note that page migration can race with mlocking or munlocking of the same
  290. page. This has been discussed from the mlock/munlock perspective in the
  291. respective sections above. Both processes [migration, m[un]locking], hold
  292. the page locked. This provides the first level of synchronization. Page
  293. migration zeros out the page_mapping of the old page before unlocking it,
  294. so m[un]lock can skip these pages by testing the page mapping under page
  295. lock.
  296. When completing page migration, we place the new and old pages back onto the
  297. lru after dropping the page lock. The "unneeded" page--old page on success,
  298. new page on failure--will be freed when the reference count held by the
  299. migration process is released. To ensure that we don't strand pages on the
  300. unevictable list because of a race between munlock and migration, page
  301. migration uses the putback_lru_page() function to add migrated pages back to
  302. the lru.
  303. Mlocked Pages: mmap(MAP_LOCKED) System Call Handling
  304. In addition the the mlock()/mlockall() system calls, an application can request
  305. that a region of memory be mlocked using the MAP_LOCKED flag with the mmap()
  306. call. Furthermore, any mmap() call or brk() call that expands the heap by a
  307. task that has previously called mlockall() with the MCL_FUTURE flag will result
  308. in the newly mapped memory being mlocked. Before the unevictable/mlock changes,
  309. the kernel simply called make_pages_present() to allocate pages and populate
  310. the page table.
  311. To mlock a range of memory under the unevictable/mlock infrastructure, the
  312. mmap() handler and task address space expansion functions call
  313. mlock_vma_pages_range() specifying the vma and the address range to mlock.
  314. mlock_vma_pages_range() filters vmas like mlock_fixup(), as described above in
  315. "Mlocked Pages: Filtering Vmas". It will clear the VM_LOCKED flag, which will
  316. have already been set by the caller, in filtered vmas. Thus these vma's need
  317. not be visited for munlock when the region is unmapped.
  318. For "normal" vmas, mlock_vma_pages_range() calls __mlock_vma_pages_range() to
  319. fault/allocate the pages and mlock them. Again, like mlock_fixup(),
  320. mlock_vma_pages_range() downgrades the mmap semaphore to read mode before
  321. attempting to fault/allocate and mlock the pages; and "upgrades" the semaphore
  322. back to write mode before returning.
  323. The callers of mlock_vma_pages_range() will have already added the memory
  324. range to be mlocked to the task's "locked_vm". To account for filtered vmas,
  325. mlock_vma_pages_range() returns the number of pages NOT mlocked. All of the
  326. callers then subtract a non-negative return value from the task's locked_vm.
  327. A negative return value represent an error--for example, from get_user_pages()
  328. attempting to fault in a vma with PROT_NONE access. In this case, we leave
  329. the memory range accounted as locked_vm, as the protections could be changed
  330. later and pages allocated into that region.
  331. Mlocked Pages: munmap()/exit()/exec() System Call Handling
  332. When unmapping an mlocked region of memory, whether by an explicit call to
  333. munmap() or via an internal unmap from exit() or exec() processing, we must
  334. munlock the pages if we're removing the last VM_LOCKED vma that maps the pages.
  335. Before the unevictable/mlock changes, mlocking did not mark the pages in any
  336. way, so unmapping them required no processing.
  337. To munlock a range of memory under the unevictable/mlock infrastructure, the
  338. munmap() hander and task address space tear down function call
  339. munlock_vma_pages_all(). The name reflects the observation that one always
  340. specifies the entire vma range when munlock()ing during unmap of a region.
  341. Because of the vma filtering when mlocking() regions, only "normal" vmas that
  342. actually contain mlocked pages will be passed to munlock_vma_pages_all().
  343. munlock_vma_pages_all() clears the VM_LOCKED vma flag and, like mlock_fixup()
  344. for the munlock case, calls __munlock_vma_pages_range() to walk the page table
  345. for the vma's memory range and munlock_vma_page() each resident page mapped by
  346. the vma. This effectively munlocks the page, only if this is the last
  347. VM_LOCKED vma that maps the page.
  348. Mlocked Page: try_to_unmap()
  349. [Note: the code changes represented by this section are really quite small
  350. compared to the text to describe what happening and why, and to discuss the
  351. implications.]
  352. Pages can, of course, be mapped into multiple vmas. Some of these vmas may
  353. have VM_LOCKED flag set. It is possible for a page mapped into one or more
  354. VM_LOCKED vmas not to have the PG_mlocked flag set and therefore reside on one
  355. of the active or inactive LRU lists. This could happen if, for example, a
  356. task in the process of munlock()ing the page could not isolate the page from
  357. the LRU. As a result, vmscan/shrink_page_list() might encounter such a page
  358. as described in "Unevictable Pages and Vmscan [shrink_*_list()]". To
  359. handle this situation, try_to_unmap() has been enhanced to check for VM_LOCKED
  360. vmas while it is walking a page's reverse map.
  361. try_to_unmap() is always called, by either vmscan for reclaim or for page
  362. migration, with the argument page locked and isolated from the LRU. BUG_ON()
  363. assertions enforce this requirement. Separate functions handle anonymous and
  364. mapped file pages, as these types of pages have different reverse map
  365. mechanisms.
  366. try_to_unmap_anon()
  367. To unmap anonymous pages, each vma in the list anchored in the anon_vma must be
  368. visited--at least until a VM_LOCKED vma is encountered. If the page is being
  369. unmapped for migration, VM_LOCKED vmas do not stop the process because mlocked
  370. pages are migratable. However, for reclaim, if the page is mapped into a
  371. VM_LOCKED vma, the scan stops. try_to_unmap() attempts to acquire the mmap
  372. semphore of the mm_struct to which the vma belongs in read mode. If this is
  373. successful, try_to_unmap() will mlock the page via mlock_vma_page()--we
  374. wouldn't have gotten to try_to_unmap() if the page were already mlocked--and
  375. will return SWAP_MLOCK, indicating that the page is unevictable. If the
  376. mmap semaphore cannot be acquired, we are not sure whether the page is really
  377. unevictable or not. In this case, try_to_unmap() will return SWAP_AGAIN.
  378. try_to_unmap_file() -- linear mappings
  379. Unmapping of a mapped file page works the same, except that the scan visits
  380. all vmas that maps the page's index/page offset in the page's mapping's
  381. reverse map priority search tree. It must also visit each vma in the page's
  382. mapping's non-linear list, if the list is non-empty. As for anonymous pages,
  383. on encountering a VM_LOCKED vma for a mapped file page, try_to_unmap() will
  384. attempt to acquire the associated mm_struct's mmap semaphore to mlock the page,
  385. returning SWAP_MLOCK if this is successful, and SWAP_AGAIN, if not.
  386. try_to_unmap_file() -- non-linear mappings
  387. If a page's mapping contains a non-empty non-linear mapping vma list, then
  388. try_to_un{map|lock}() must also visit each vma in that list to determine
  389. whether the page is mapped in a VM_LOCKED vma. Again, the scan must visit
  390. all vmas in the non-linear list to ensure that the pages is not/should not be
  391. mlocked. If a VM_LOCKED vma is found in the list, the scan could terminate.
  392. However, there is no easy way to determine whether the page is actually mapped
  393. in a given vma--either for unmapping or testing whether the VM_LOCKED vma
  394. actually pins the page.
  395. So, try_to_unmap_file() handles non-linear mappings by scanning a certain
  396. number of pages--a "cluster"--in each non-linear vma associated with the page's
  397. mapping, for each file mapped page that vmscan tries to unmap. If this happens
  398. to unmap the page we're trying to unmap, try_to_unmap() will notice this on
  399. return--(page_mapcount(page) == 0)--and return SWAP_SUCCESS. Otherwise, it
  400. will return SWAP_AGAIN, causing vmscan to recirculate this page. We take
  401. advantage of the cluster scan in try_to_unmap_cluster() as follows:
  402. For each non-linear vma, try_to_unmap_cluster() attempts to acquire the mmap
  403. semaphore of the associated mm_struct for read without blocking. If this
  404. attempt is successful and the vma is VM_LOCKED, try_to_unmap_cluster() will
  405. retain the mmap semaphore for the scan; otherwise it drops it here. Then,
  406. for each page in the cluster, if we're holding the mmap semaphore for a locked
  407. vma, try_to_unmap_cluster() calls mlock_vma_page() to mlock the page. This
  408. call is a no-op if the page is already locked, but will mlock any pages in
  409. the non-linear mapping that happen to be unlocked. If one of the pages so
  410. mlocked is the page passed in to try_to_unmap(), try_to_unmap_cluster() will
  411. return SWAP_MLOCK, rather than the default SWAP_AGAIN. This will allow vmscan
  412. to cull the page, rather than recirculating it on the inactive list. Again,
  413. if try_to_unmap_cluster() cannot acquire the vma's mmap sem, it returns
  414. SWAP_AGAIN, indicating that the page is mapped by a VM_LOCKED vma, but
  415. couldn't be mlocked.
  416. Mlocked pages: try_to_munlock() Reverse Map Scan
  417. TODO/FIXME: a better name might be page_mlocked()--analogous to the
  418. page_referenced() reverse map walker.
  419. When munlock_vma_page()--see "Mlocked Pages: munlock()/munlockall()
  420. System Call Handling" above--tries to munlock a page, it needs to
  421. determine whether or not the page is mapped by any VM_LOCKED vma, without
  422. actually attempting to unmap all ptes from the page. For this purpose, the
  423. unevictable/mlock infrastructure introduced a variant of try_to_unmap() called
  424. try_to_munlock().
  425. try_to_munlock() calls the same functions as try_to_unmap() for anonymous and
  426. mapped file pages with an additional argument specifing unlock versus unmap
  427. processing. Again, these functions walk the respective reverse maps looking
  428. for VM_LOCKED vmas. When such a vma is found for anonymous pages and file
  429. pages mapped in linear VMAs, as in the try_to_unmap() case, the functions
  430. attempt to acquire the associated mmap semphore, mlock the page via
  431. mlock_vma_page() and return SWAP_MLOCK. This effectively undoes the
  432. pre-clearing of the page's PG_mlocked done by munlock_vma_page.
  433. If try_to_unmap() is unable to acquire a VM_LOCKED vma's associated mmap
  434. semaphore, it will return SWAP_AGAIN. This will allow shrink_page_list()
  435. to recycle the page on the inactive list and hope that it has better luck
  436. with the page next time.
  437. For file pages mapped into non-linear vmas, the try_to_munlock() logic works
  438. slightly differently. On encountering a VM_LOCKED non-linear vma that might
  439. map the page, try_to_munlock() returns SWAP_AGAIN without actually mlocking
  440. the page. munlock_vma_page() will just leave the page unlocked and let
  441. vmscan deal with it--the usual fallback position.
  442. Note that try_to_munlock()'s reverse map walk must visit every vma in a pages'
  443. reverse map to determine that a page is NOT mapped into any VM_LOCKED vma.
  444. However, the scan can terminate when it encounters a VM_LOCKED vma and can
  445. successfully acquire the vma's mmap semphore for read and mlock the page.
  446. Although try_to_munlock() can be called many [very many!] times when
  447. munlock()ing a large region or tearing down a large address space that has been
  448. mlocked via mlockall(), overall this is a fairly rare event.
  449. Mlocked Page: Page Reclaim in shrink_*_list()
  450. shrink_active_list() culls any obviously unevictable pages--i.e.,
  451. !page_evictable(page, NULL)--diverting these to the unevictable lru
  452. list. However, shrink_active_list() only sees unevictable pages that
  453. made it onto the active/inactive lru lists. Note that these pages do not
  454. have PageUnevictable set--otherwise, they would be on the unevictable list and
  455. shrink_active_list would never see them.
  456. Some examples of these unevictable pages on the LRU lists are:
  457. 1) ramfs pages that have been placed on the lru lists when first allocated.
  458. 2) SHM_LOCKed shared memory pages. shmctl(SHM_LOCK) does not attempt to
  459. allocate or fault in the pages in the shared memory region. This happens
  460. when an application accesses the page the first time after SHM_LOCKing
  461. the segment.
  462. 3) Mlocked pages that could not be isolated from the lru and moved to the
  463. unevictable list in mlock_vma_page().
  464. 3) Pages mapped into multiple VM_LOCKED vmas, but try_to_munlock() couldn't
  465. acquire the vma's mmap semaphore to test the flags and set PageMlocked.
  466. munlock_vma_page() was forced to let the page back on to the normal
  467. LRU list for vmscan to handle.
  468. shrink_inactive_list() also culls any unevictable pages that it finds on
  469. the inactive lists, again diverting them to the appropriate zone's unevictable
  470. lru list. shrink_inactive_list() should only see SHM_LOCKed pages that became
  471. SHM_LOCKed after shrink_active_list() had moved them to the inactive list, or
  472. pages mapped into VM_LOCKED vmas that munlock_vma_page() couldn't isolate from
  473. the lru to recheck via try_to_munlock(). shrink_inactive_list() won't notice
  474. the latter, but will pass on to shrink_page_list().
  475. shrink_page_list() again culls obviously unevictable pages that it could
  476. encounter for similar reason to shrink_inactive_list(). Pages mapped into
  477. VM_LOCKED vmas but without PG_mlocked set will make it all the way to
  478. try_to_unmap(). shrink_page_list() will divert them to the unevictable list
  479. when try_to_unmap() returns SWAP_MLOCK, as discussed above.