unevictable-lru.txt 33 KB

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