rmap.c 49 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774
  1. /*
  2. * mm/rmap.c - physical to virtual reverse mappings
  3. *
  4. * Copyright 2001, Rik van Riel <riel@conectiva.com.br>
  5. * Released under the General Public License (GPL).
  6. *
  7. * Simple, low overhead reverse mapping scheme.
  8. * Please try to keep this thing as modular as possible.
  9. *
  10. * Provides methods for unmapping each kind of mapped page:
  11. * the anon methods track anonymous pages, and
  12. * the file methods track pages belonging to an inode.
  13. *
  14. * Original design by Rik van Riel <riel@conectiva.com.br> 2001
  15. * File methods by Dave McCracken <dmccr@us.ibm.com> 2003, 2004
  16. * Anonymous methods by Andrea Arcangeli <andrea@suse.de> 2004
  17. * Contributions by Hugh Dickins 2003, 2004
  18. */
  19. /*
  20. * Lock ordering in mm:
  21. *
  22. * inode->i_mutex (while writing or truncating, not reading or faulting)
  23. * mm->mmap_sem
  24. * page->flags PG_locked (lock_page)
  25. * mapping->i_mmap_mutex
  26. * anon_vma->rwsem
  27. * mm->page_table_lock or pte_lock
  28. * zone->lru_lock (in mark_page_accessed, isolate_lru_page)
  29. * swap_lock (in swap_duplicate, swap_info_get)
  30. * mmlist_lock (in mmput, drain_mmlist and others)
  31. * mapping->private_lock (in __set_page_dirty_buffers)
  32. * inode->i_lock (in set_page_dirty's __mark_inode_dirty)
  33. * bdi.wb->list_lock (in set_page_dirty's __mark_inode_dirty)
  34. * sb_lock (within inode_lock in fs/fs-writeback.c)
  35. * mapping->tree_lock (widely used, in set_page_dirty,
  36. * in arch-dependent flush_dcache_mmap_lock,
  37. * within bdi.wb->list_lock in __sync_single_inode)
  38. *
  39. * anon_vma->rwsem,mapping->i_mutex (memory_failure, collect_procs_anon)
  40. * ->tasklist_lock
  41. * pte map lock
  42. */
  43. #include <linux/mm.h>
  44. #include <linux/pagemap.h>
  45. #include <linux/swap.h>
  46. #include <linux/swapops.h>
  47. #include <linux/slab.h>
  48. #include <linux/init.h>
  49. #include <linux/ksm.h>
  50. #include <linux/rmap.h>
  51. #include <linux/rcupdate.h>
  52. #include <linux/export.h>
  53. #include <linux/memcontrol.h>
  54. #include <linux/mmu_notifier.h>
  55. #include <linux/migrate.h>
  56. #include <linux/hugetlb.h>
  57. #include <linux/backing-dev.h>
  58. #include <asm/tlbflush.h>
  59. #include "internal.h"
  60. static struct kmem_cache *anon_vma_cachep;
  61. static struct kmem_cache *anon_vma_chain_cachep;
  62. static inline struct anon_vma *anon_vma_alloc(void)
  63. {
  64. struct anon_vma *anon_vma;
  65. anon_vma = kmem_cache_alloc(anon_vma_cachep, GFP_KERNEL);
  66. if (anon_vma) {
  67. atomic_set(&anon_vma->refcount, 1);
  68. /*
  69. * Initialise the anon_vma root to point to itself. If called
  70. * from fork, the root will be reset to the parents anon_vma.
  71. */
  72. anon_vma->root = anon_vma;
  73. }
  74. return anon_vma;
  75. }
  76. static inline void anon_vma_free(struct anon_vma *anon_vma)
  77. {
  78. VM_BUG_ON(atomic_read(&anon_vma->refcount));
  79. /*
  80. * Synchronize against page_lock_anon_vma_read() such that
  81. * we can safely hold the lock without the anon_vma getting
  82. * freed.
  83. *
  84. * Relies on the full mb implied by the atomic_dec_and_test() from
  85. * put_anon_vma() against the acquire barrier implied by
  86. * down_read_trylock() from page_lock_anon_vma_read(). This orders:
  87. *
  88. * page_lock_anon_vma_read() VS put_anon_vma()
  89. * down_read_trylock() atomic_dec_and_test()
  90. * LOCK MB
  91. * atomic_read() rwsem_is_locked()
  92. *
  93. * LOCK should suffice since the actual taking of the lock must
  94. * happen _before_ what follows.
  95. */
  96. might_sleep();
  97. if (rwsem_is_locked(&anon_vma->root->rwsem)) {
  98. anon_vma_lock_write(anon_vma);
  99. anon_vma_unlock_write(anon_vma);
  100. }
  101. kmem_cache_free(anon_vma_cachep, anon_vma);
  102. }
  103. static inline struct anon_vma_chain *anon_vma_chain_alloc(gfp_t gfp)
  104. {
  105. return kmem_cache_alloc(anon_vma_chain_cachep, gfp);
  106. }
  107. static void anon_vma_chain_free(struct anon_vma_chain *anon_vma_chain)
  108. {
  109. kmem_cache_free(anon_vma_chain_cachep, anon_vma_chain);
  110. }
  111. static void anon_vma_chain_link(struct vm_area_struct *vma,
  112. struct anon_vma_chain *avc,
  113. struct anon_vma *anon_vma)
  114. {
  115. avc->vma = vma;
  116. avc->anon_vma = anon_vma;
  117. list_add(&avc->same_vma, &vma->anon_vma_chain);
  118. anon_vma_interval_tree_insert(avc, &anon_vma->rb_root);
  119. }
  120. /**
  121. * anon_vma_prepare - attach an anon_vma to a memory region
  122. * @vma: the memory region in question
  123. *
  124. * This makes sure the memory mapping described by 'vma' has
  125. * an 'anon_vma' attached to it, so that we can associate the
  126. * anonymous pages mapped into it with that anon_vma.
  127. *
  128. * The common case will be that we already have one, but if
  129. * not we either need to find an adjacent mapping that we
  130. * can re-use the anon_vma from (very common when the only
  131. * reason for splitting a vma has been mprotect()), or we
  132. * allocate a new one.
  133. *
  134. * Anon-vma allocations are very subtle, because we may have
  135. * optimistically looked up an anon_vma in page_lock_anon_vma_read()
  136. * and that may actually touch the spinlock even in the newly
  137. * allocated vma (it depends on RCU to make sure that the
  138. * anon_vma isn't actually destroyed).
  139. *
  140. * As a result, we need to do proper anon_vma locking even
  141. * for the new allocation. At the same time, we do not want
  142. * to do any locking for the common case of already having
  143. * an anon_vma.
  144. *
  145. * This must be called with the mmap_sem held for reading.
  146. */
  147. int anon_vma_prepare(struct vm_area_struct *vma)
  148. {
  149. struct anon_vma *anon_vma = vma->anon_vma;
  150. struct anon_vma_chain *avc;
  151. might_sleep();
  152. if (unlikely(!anon_vma)) {
  153. struct mm_struct *mm = vma->vm_mm;
  154. struct anon_vma *allocated;
  155. avc = anon_vma_chain_alloc(GFP_KERNEL);
  156. if (!avc)
  157. goto out_enomem;
  158. anon_vma = find_mergeable_anon_vma(vma);
  159. allocated = NULL;
  160. if (!anon_vma) {
  161. anon_vma = anon_vma_alloc();
  162. if (unlikely(!anon_vma))
  163. goto out_enomem_free_avc;
  164. allocated = anon_vma;
  165. }
  166. anon_vma_lock_write(anon_vma);
  167. /* page_table_lock to protect against threads */
  168. spin_lock(&mm->page_table_lock);
  169. if (likely(!vma->anon_vma)) {
  170. vma->anon_vma = anon_vma;
  171. anon_vma_chain_link(vma, avc, anon_vma);
  172. allocated = NULL;
  173. avc = NULL;
  174. }
  175. spin_unlock(&mm->page_table_lock);
  176. anon_vma_unlock_write(anon_vma);
  177. if (unlikely(allocated))
  178. put_anon_vma(allocated);
  179. if (unlikely(avc))
  180. anon_vma_chain_free(avc);
  181. }
  182. return 0;
  183. out_enomem_free_avc:
  184. anon_vma_chain_free(avc);
  185. out_enomem:
  186. return -ENOMEM;
  187. }
  188. /*
  189. * This is a useful helper function for locking the anon_vma root as
  190. * we traverse the vma->anon_vma_chain, looping over anon_vma's that
  191. * have the same vma.
  192. *
  193. * Such anon_vma's should have the same root, so you'd expect to see
  194. * just a single mutex_lock for the whole traversal.
  195. */
  196. static inline struct anon_vma *lock_anon_vma_root(struct anon_vma *root, struct anon_vma *anon_vma)
  197. {
  198. struct anon_vma *new_root = anon_vma->root;
  199. if (new_root != root) {
  200. if (WARN_ON_ONCE(root))
  201. up_write(&root->rwsem);
  202. root = new_root;
  203. down_write(&root->rwsem);
  204. }
  205. return root;
  206. }
  207. static inline void unlock_anon_vma_root(struct anon_vma *root)
  208. {
  209. if (root)
  210. up_write(&root->rwsem);
  211. }
  212. /*
  213. * Attach the anon_vmas from src to dst.
  214. * Returns 0 on success, -ENOMEM on failure.
  215. */
  216. int anon_vma_clone(struct vm_area_struct *dst, struct vm_area_struct *src)
  217. {
  218. struct anon_vma_chain *avc, *pavc;
  219. struct anon_vma *root = NULL;
  220. list_for_each_entry_reverse(pavc, &src->anon_vma_chain, same_vma) {
  221. struct anon_vma *anon_vma;
  222. avc = anon_vma_chain_alloc(GFP_NOWAIT | __GFP_NOWARN);
  223. if (unlikely(!avc)) {
  224. unlock_anon_vma_root(root);
  225. root = NULL;
  226. avc = anon_vma_chain_alloc(GFP_KERNEL);
  227. if (!avc)
  228. goto enomem_failure;
  229. }
  230. anon_vma = pavc->anon_vma;
  231. root = lock_anon_vma_root(root, anon_vma);
  232. anon_vma_chain_link(dst, avc, anon_vma);
  233. }
  234. unlock_anon_vma_root(root);
  235. return 0;
  236. enomem_failure:
  237. unlink_anon_vmas(dst);
  238. return -ENOMEM;
  239. }
  240. /*
  241. * Attach vma to its own anon_vma, as well as to the anon_vmas that
  242. * the corresponding VMA in the parent process is attached to.
  243. * Returns 0 on success, non-zero on failure.
  244. */
  245. int anon_vma_fork(struct vm_area_struct *vma, struct vm_area_struct *pvma)
  246. {
  247. struct anon_vma_chain *avc;
  248. struct anon_vma *anon_vma;
  249. /* Don't bother if the parent process has no anon_vma here. */
  250. if (!pvma->anon_vma)
  251. return 0;
  252. /*
  253. * First, attach the new VMA to the parent VMA's anon_vmas,
  254. * so rmap can find non-COWed pages in child processes.
  255. */
  256. if (anon_vma_clone(vma, pvma))
  257. return -ENOMEM;
  258. /* Then add our own anon_vma. */
  259. anon_vma = anon_vma_alloc();
  260. if (!anon_vma)
  261. goto out_error;
  262. avc = anon_vma_chain_alloc(GFP_KERNEL);
  263. if (!avc)
  264. goto out_error_free_anon_vma;
  265. /*
  266. * The root anon_vma's spinlock is the lock actually used when we
  267. * lock any of the anon_vmas in this anon_vma tree.
  268. */
  269. anon_vma->root = pvma->anon_vma->root;
  270. /*
  271. * With refcounts, an anon_vma can stay around longer than the
  272. * process it belongs to. The root anon_vma needs to be pinned until
  273. * this anon_vma is freed, because the lock lives in the root.
  274. */
  275. get_anon_vma(anon_vma->root);
  276. /* Mark this anon_vma as the one where our new (COWed) pages go. */
  277. vma->anon_vma = anon_vma;
  278. anon_vma_lock_write(anon_vma);
  279. anon_vma_chain_link(vma, avc, anon_vma);
  280. anon_vma_unlock_write(anon_vma);
  281. return 0;
  282. out_error_free_anon_vma:
  283. put_anon_vma(anon_vma);
  284. out_error:
  285. unlink_anon_vmas(vma);
  286. return -ENOMEM;
  287. }
  288. void unlink_anon_vmas(struct vm_area_struct *vma)
  289. {
  290. struct anon_vma_chain *avc, *next;
  291. struct anon_vma *root = NULL;
  292. /*
  293. * Unlink each anon_vma chained to the VMA. This list is ordered
  294. * from newest to oldest, ensuring the root anon_vma gets freed last.
  295. */
  296. list_for_each_entry_safe(avc, next, &vma->anon_vma_chain, same_vma) {
  297. struct anon_vma *anon_vma = avc->anon_vma;
  298. root = lock_anon_vma_root(root, anon_vma);
  299. anon_vma_interval_tree_remove(avc, &anon_vma->rb_root);
  300. /*
  301. * Leave empty anon_vmas on the list - we'll need
  302. * to free them outside the lock.
  303. */
  304. if (RB_EMPTY_ROOT(&anon_vma->rb_root))
  305. continue;
  306. list_del(&avc->same_vma);
  307. anon_vma_chain_free(avc);
  308. }
  309. unlock_anon_vma_root(root);
  310. /*
  311. * Iterate the list once more, it now only contains empty and unlinked
  312. * anon_vmas, destroy them. Could not do before due to __put_anon_vma()
  313. * needing to write-acquire the anon_vma->root->rwsem.
  314. */
  315. list_for_each_entry_safe(avc, next, &vma->anon_vma_chain, same_vma) {
  316. struct anon_vma *anon_vma = avc->anon_vma;
  317. put_anon_vma(anon_vma);
  318. list_del(&avc->same_vma);
  319. anon_vma_chain_free(avc);
  320. }
  321. }
  322. static void anon_vma_ctor(void *data)
  323. {
  324. struct anon_vma *anon_vma = data;
  325. init_rwsem(&anon_vma->rwsem);
  326. atomic_set(&anon_vma->refcount, 0);
  327. anon_vma->rb_root = RB_ROOT;
  328. }
  329. void __init anon_vma_init(void)
  330. {
  331. anon_vma_cachep = kmem_cache_create("anon_vma", sizeof(struct anon_vma),
  332. 0, SLAB_DESTROY_BY_RCU|SLAB_PANIC, anon_vma_ctor);
  333. anon_vma_chain_cachep = KMEM_CACHE(anon_vma_chain, SLAB_PANIC);
  334. }
  335. /*
  336. * Getting a lock on a stable anon_vma from a page off the LRU is tricky!
  337. *
  338. * Since there is no serialization what so ever against page_remove_rmap()
  339. * the best this function can do is return a locked anon_vma that might
  340. * have been relevant to this page.
  341. *
  342. * The page might have been remapped to a different anon_vma or the anon_vma
  343. * returned may already be freed (and even reused).
  344. *
  345. * In case it was remapped to a different anon_vma, the new anon_vma will be a
  346. * child of the old anon_vma, and the anon_vma lifetime rules will therefore
  347. * ensure that any anon_vma obtained from the page will still be valid for as
  348. * long as we observe page_mapped() [ hence all those page_mapped() tests ].
  349. *
  350. * All users of this function must be very careful when walking the anon_vma
  351. * chain and verify that the page in question is indeed mapped in it
  352. * [ something equivalent to page_mapped_in_vma() ].
  353. *
  354. * Since anon_vma's slab is DESTROY_BY_RCU and we know from page_remove_rmap()
  355. * that the anon_vma pointer from page->mapping is valid if there is a
  356. * mapcount, we can dereference the anon_vma after observing those.
  357. */
  358. struct anon_vma *page_get_anon_vma(struct page *page)
  359. {
  360. struct anon_vma *anon_vma = NULL;
  361. unsigned long anon_mapping;
  362. rcu_read_lock();
  363. anon_mapping = (unsigned long) ACCESS_ONCE(page->mapping);
  364. if ((anon_mapping & PAGE_MAPPING_FLAGS) != PAGE_MAPPING_ANON)
  365. goto out;
  366. if (!page_mapped(page))
  367. goto out;
  368. anon_vma = (struct anon_vma *) (anon_mapping - PAGE_MAPPING_ANON);
  369. if (!atomic_inc_not_zero(&anon_vma->refcount)) {
  370. anon_vma = NULL;
  371. goto out;
  372. }
  373. /*
  374. * If this page is still mapped, then its anon_vma cannot have been
  375. * freed. But if it has been unmapped, we have no security against the
  376. * anon_vma structure being freed and reused (for another anon_vma:
  377. * SLAB_DESTROY_BY_RCU guarantees that - so the atomic_inc_not_zero()
  378. * above cannot corrupt).
  379. */
  380. if (!page_mapped(page)) {
  381. rcu_read_unlock();
  382. put_anon_vma(anon_vma);
  383. return NULL;
  384. }
  385. out:
  386. rcu_read_unlock();
  387. return anon_vma;
  388. }
  389. /*
  390. * Similar to page_get_anon_vma() except it locks the anon_vma.
  391. *
  392. * Its a little more complex as it tries to keep the fast path to a single
  393. * atomic op -- the trylock. If we fail the trylock, we fall back to getting a
  394. * reference like with page_get_anon_vma() and then block on the mutex.
  395. */
  396. struct anon_vma *page_lock_anon_vma_read(struct page *page)
  397. {
  398. struct anon_vma *anon_vma = NULL;
  399. struct anon_vma *root_anon_vma;
  400. unsigned long anon_mapping;
  401. rcu_read_lock();
  402. anon_mapping = (unsigned long) ACCESS_ONCE(page->mapping);
  403. if ((anon_mapping & PAGE_MAPPING_FLAGS) != PAGE_MAPPING_ANON)
  404. goto out;
  405. if (!page_mapped(page))
  406. goto out;
  407. anon_vma = (struct anon_vma *) (anon_mapping - PAGE_MAPPING_ANON);
  408. root_anon_vma = ACCESS_ONCE(anon_vma->root);
  409. if (down_read_trylock(&root_anon_vma->rwsem)) {
  410. /*
  411. * If the page is still mapped, then this anon_vma is still
  412. * its anon_vma, and holding the mutex ensures that it will
  413. * not go away, see anon_vma_free().
  414. */
  415. if (!page_mapped(page)) {
  416. up_read(&root_anon_vma->rwsem);
  417. anon_vma = NULL;
  418. }
  419. goto out;
  420. }
  421. /* trylock failed, we got to sleep */
  422. if (!atomic_inc_not_zero(&anon_vma->refcount)) {
  423. anon_vma = NULL;
  424. goto out;
  425. }
  426. if (!page_mapped(page)) {
  427. rcu_read_unlock();
  428. put_anon_vma(anon_vma);
  429. return NULL;
  430. }
  431. /* we pinned the anon_vma, its safe to sleep */
  432. rcu_read_unlock();
  433. anon_vma_lock_read(anon_vma);
  434. if (atomic_dec_and_test(&anon_vma->refcount)) {
  435. /*
  436. * Oops, we held the last refcount, release the lock
  437. * and bail -- can't simply use put_anon_vma() because
  438. * we'll deadlock on the anon_vma_lock_write() recursion.
  439. */
  440. anon_vma_unlock_read(anon_vma);
  441. __put_anon_vma(anon_vma);
  442. anon_vma = NULL;
  443. }
  444. return anon_vma;
  445. out:
  446. rcu_read_unlock();
  447. return anon_vma;
  448. }
  449. void page_unlock_anon_vma_read(struct anon_vma *anon_vma)
  450. {
  451. anon_vma_unlock_read(anon_vma);
  452. }
  453. /*
  454. * At what user virtual address is page expected in @vma?
  455. */
  456. static inline unsigned long
  457. __vma_address(struct page *page, struct vm_area_struct *vma)
  458. {
  459. pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
  460. if (unlikely(is_vm_hugetlb_page(vma)))
  461. pgoff = page->index << huge_page_order(page_hstate(page));
  462. return vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
  463. }
  464. inline unsigned long
  465. vma_address(struct page *page, struct vm_area_struct *vma)
  466. {
  467. unsigned long address = __vma_address(page, vma);
  468. /* page should be within @vma mapping range */
  469. VM_BUG_ON(address < vma->vm_start || address >= vma->vm_end);
  470. return address;
  471. }
  472. /*
  473. * At what user virtual address is page expected in vma?
  474. * Caller should check the page is actually part of the vma.
  475. */
  476. unsigned long page_address_in_vma(struct page *page, struct vm_area_struct *vma)
  477. {
  478. unsigned long address;
  479. if (PageAnon(page)) {
  480. struct anon_vma *page__anon_vma = page_anon_vma(page);
  481. /*
  482. * Note: swapoff's unuse_vma() is more efficient with this
  483. * check, and needs it to match anon_vma when KSM is active.
  484. */
  485. if (!vma->anon_vma || !page__anon_vma ||
  486. vma->anon_vma->root != page__anon_vma->root)
  487. return -EFAULT;
  488. } else if (page->mapping && !(vma->vm_flags & VM_NONLINEAR)) {
  489. if (!vma->vm_file ||
  490. vma->vm_file->f_mapping != page->mapping)
  491. return -EFAULT;
  492. } else
  493. return -EFAULT;
  494. address = __vma_address(page, vma);
  495. if (unlikely(address < vma->vm_start || address >= vma->vm_end))
  496. return -EFAULT;
  497. return address;
  498. }
  499. pmd_t *mm_find_pmd(struct mm_struct *mm, unsigned long address)
  500. {
  501. pgd_t *pgd;
  502. pud_t *pud;
  503. pmd_t *pmd = NULL;
  504. pgd = pgd_offset(mm, address);
  505. if (!pgd_present(*pgd))
  506. goto out;
  507. pud = pud_offset(pgd, address);
  508. if (!pud_present(*pud))
  509. goto out;
  510. pmd = pmd_offset(pud, address);
  511. if (!pmd_present(*pmd))
  512. pmd = NULL;
  513. out:
  514. return pmd;
  515. }
  516. /*
  517. * Check that @page is mapped at @address into @mm.
  518. *
  519. * If @sync is false, page_check_address may perform a racy check to avoid
  520. * the page table lock when the pte is not present (helpful when reclaiming
  521. * highly shared pages).
  522. *
  523. * On success returns with pte mapped and locked.
  524. */
  525. pte_t *__page_check_address(struct page *page, struct mm_struct *mm,
  526. unsigned long address, spinlock_t **ptlp, int sync)
  527. {
  528. pmd_t *pmd;
  529. pte_t *pte;
  530. spinlock_t *ptl;
  531. if (unlikely(PageHuge(page))) {
  532. /* when pud is not present, pte will be NULL */
  533. pte = huge_pte_offset(mm, address);
  534. if (!pte)
  535. return NULL;
  536. ptl = huge_pte_lockptr(page_hstate(page), mm, pte);
  537. goto check;
  538. }
  539. pmd = mm_find_pmd(mm, address);
  540. if (!pmd)
  541. return NULL;
  542. if (pmd_trans_huge(*pmd))
  543. return NULL;
  544. pte = pte_offset_map(pmd, address);
  545. /* Make a quick check before getting the lock */
  546. if (!sync && !pte_present(*pte)) {
  547. pte_unmap(pte);
  548. return NULL;
  549. }
  550. ptl = pte_lockptr(mm, pmd);
  551. check:
  552. spin_lock(ptl);
  553. if (pte_present(*pte) && page_to_pfn(page) == pte_pfn(*pte)) {
  554. *ptlp = ptl;
  555. return pte;
  556. }
  557. pte_unmap_unlock(pte, ptl);
  558. return NULL;
  559. }
  560. /**
  561. * page_mapped_in_vma - check whether a page is really mapped in a VMA
  562. * @page: the page to test
  563. * @vma: the VMA to test
  564. *
  565. * Returns 1 if the page is mapped into the page tables of the VMA, 0
  566. * if the page is not mapped into the page tables of this VMA. Only
  567. * valid for normal file or anonymous VMAs.
  568. */
  569. int page_mapped_in_vma(struct page *page, struct vm_area_struct *vma)
  570. {
  571. unsigned long address;
  572. pte_t *pte;
  573. spinlock_t *ptl;
  574. address = __vma_address(page, vma);
  575. if (unlikely(address < vma->vm_start || address >= vma->vm_end))
  576. return 0;
  577. pte = page_check_address(page, vma->vm_mm, address, &ptl, 1);
  578. if (!pte) /* the page is not in this mm */
  579. return 0;
  580. pte_unmap_unlock(pte, ptl);
  581. return 1;
  582. }
  583. struct page_referenced_arg {
  584. int mapcount;
  585. int referenced;
  586. unsigned long vm_flags;
  587. struct mem_cgroup *memcg;
  588. };
  589. /*
  590. * arg: page_referenced_arg will be passed
  591. */
  592. static int page_referenced_one(struct page *page, struct vm_area_struct *vma,
  593. unsigned long address, void *arg)
  594. {
  595. struct mm_struct *mm = vma->vm_mm;
  596. spinlock_t *ptl;
  597. int referenced = 0;
  598. struct page_referenced_arg *pra = arg;
  599. if (unlikely(PageTransHuge(page))) {
  600. pmd_t *pmd;
  601. /*
  602. * rmap might return false positives; we must filter
  603. * these out using page_check_address_pmd().
  604. */
  605. pmd = page_check_address_pmd(page, mm, address,
  606. PAGE_CHECK_ADDRESS_PMD_FLAG, &ptl);
  607. if (!pmd)
  608. return SWAP_AGAIN;
  609. if (vma->vm_flags & VM_LOCKED) {
  610. spin_unlock(ptl);
  611. pra->vm_flags |= VM_LOCKED;
  612. return SWAP_FAIL; /* To break the loop */
  613. }
  614. /* go ahead even if the pmd is pmd_trans_splitting() */
  615. if (pmdp_clear_flush_young_notify(vma, address, pmd))
  616. referenced++;
  617. spin_unlock(ptl);
  618. } else {
  619. pte_t *pte;
  620. /*
  621. * rmap might return false positives; we must filter
  622. * these out using page_check_address().
  623. */
  624. pte = page_check_address(page, mm, address, &ptl, 0);
  625. if (!pte)
  626. return SWAP_AGAIN;
  627. if (vma->vm_flags & VM_LOCKED) {
  628. pte_unmap_unlock(pte, ptl);
  629. pra->vm_flags |= VM_LOCKED;
  630. return SWAP_FAIL; /* To break the loop */
  631. }
  632. if (ptep_clear_flush_young_notify(vma, address, pte)) {
  633. /*
  634. * Don't treat a reference through a sequentially read
  635. * mapping as such. If the page has been used in
  636. * another mapping, we will catch it; if this other
  637. * mapping is already gone, the unmap path will have
  638. * set PG_referenced or activated the page.
  639. */
  640. if (likely(!(vma->vm_flags & VM_SEQ_READ)))
  641. referenced++;
  642. }
  643. pte_unmap_unlock(pte, ptl);
  644. }
  645. if (referenced) {
  646. pra->referenced++;
  647. pra->vm_flags |= vma->vm_flags;
  648. }
  649. pra->mapcount--;
  650. if (!pra->mapcount)
  651. return SWAP_SUCCESS; /* To break the loop */
  652. return SWAP_AGAIN;
  653. }
  654. static bool invalid_page_referenced_vma(struct vm_area_struct *vma, void *arg)
  655. {
  656. struct page_referenced_arg *pra = arg;
  657. struct mem_cgroup *memcg = pra->memcg;
  658. if (!mm_match_cgroup(vma->vm_mm, memcg))
  659. return true;
  660. return false;
  661. }
  662. /**
  663. * page_referenced - test if the page was referenced
  664. * @page: the page to test
  665. * @is_locked: caller holds lock on the page
  666. * @memcg: target memory cgroup
  667. * @vm_flags: collect encountered vma->vm_flags who actually referenced the page
  668. *
  669. * Quick test_and_clear_referenced for all mappings to a page,
  670. * returns the number of ptes which referenced the page.
  671. */
  672. int page_referenced(struct page *page,
  673. int is_locked,
  674. struct mem_cgroup *memcg,
  675. unsigned long *vm_flags)
  676. {
  677. int ret;
  678. int we_locked = 0;
  679. struct page_referenced_arg pra = {
  680. .mapcount = page_mapcount(page),
  681. .memcg = memcg,
  682. };
  683. struct rmap_walk_control rwc = {
  684. .rmap_one = page_referenced_one,
  685. .arg = (void *)&pra,
  686. .anon_lock = page_lock_anon_vma_read,
  687. };
  688. *vm_flags = 0;
  689. if (!page_mapped(page))
  690. return 0;
  691. if (!page_rmapping(page))
  692. return 0;
  693. if (!is_locked && (!PageAnon(page) || PageKsm(page))) {
  694. we_locked = trylock_page(page);
  695. if (!we_locked)
  696. return 1;
  697. }
  698. /*
  699. * If we are reclaiming on behalf of a cgroup, skip
  700. * counting on behalf of references from different
  701. * cgroups
  702. */
  703. if (memcg) {
  704. rwc.invalid_vma = invalid_page_referenced_vma;
  705. }
  706. ret = rmap_walk(page, &rwc);
  707. *vm_flags = pra.vm_flags;
  708. if (we_locked)
  709. unlock_page(page);
  710. return pra.referenced;
  711. }
  712. static int page_mkclean_one(struct page *page, struct vm_area_struct *vma,
  713. unsigned long address, void *arg)
  714. {
  715. struct mm_struct *mm = vma->vm_mm;
  716. pte_t *pte;
  717. spinlock_t *ptl;
  718. int ret = 0;
  719. int *cleaned = arg;
  720. pte = page_check_address(page, mm, address, &ptl, 1);
  721. if (!pte)
  722. goto out;
  723. if (pte_dirty(*pte) || pte_write(*pte)) {
  724. pte_t entry;
  725. flush_cache_page(vma, address, pte_pfn(*pte));
  726. entry = ptep_clear_flush(vma, address, pte);
  727. entry = pte_wrprotect(entry);
  728. entry = pte_mkclean(entry);
  729. set_pte_at(mm, address, pte, entry);
  730. ret = 1;
  731. }
  732. pte_unmap_unlock(pte, ptl);
  733. if (ret) {
  734. mmu_notifier_invalidate_page(mm, address);
  735. (*cleaned)++;
  736. }
  737. out:
  738. return SWAP_AGAIN;
  739. }
  740. static bool invalid_mkclean_vma(struct vm_area_struct *vma, void *arg)
  741. {
  742. if (vma->vm_flags & VM_SHARED)
  743. return false;
  744. return true;
  745. }
  746. int page_mkclean(struct page *page)
  747. {
  748. int cleaned = 0;
  749. struct address_space *mapping;
  750. struct rmap_walk_control rwc = {
  751. .arg = (void *)&cleaned,
  752. .rmap_one = page_mkclean_one,
  753. .invalid_vma = invalid_mkclean_vma,
  754. };
  755. BUG_ON(!PageLocked(page));
  756. if (!page_mapped(page))
  757. return 0;
  758. mapping = page_mapping(page);
  759. if (!mapping)
  760. return 0;
  761. rmap_walk(page, &rwc);
  762. return cleaned;
  763. }
  764. EXPORT_SYMBOL_GPL(page_mkclean);
  765. /**
  766. * page_move_anon_rmap - move a page to our anon_vma
  767. * @page: the page to move to our anon_vma
  768. * @vma: the vma the page belongs to
  769. * @address: the user virtual address mapped
  770. *
  771. * When a page belongs exclusively to one process after a COW event,
  772. * that page can be moved into the anon_vma that belongs to just that
  773. * process, so the rmap code will not search the parent or sibling
  774. * processes.
  775. */
  776. void page_move_anon_rmap(struct page *page,
  777. struct vm_area_struct *vma, unsigned long address)
  778. {
  779. struct anon_vma *anon_vma = vma->anon_vma;
  780. VM_BUG_ON_PAGE(!PageLocked(page), page);
  781. VM_BUG_ON(!anon_vma);
  782. VM_BUG_ON_PAGE(page->index != linear_page_index(vma, address), page);
  783. anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
  784. page->mapping = (struct address_space *) anon_vma;
  785. }
  786. /**
  787. * __page_set_anon_rmap - set up new anonymous rmap
  788. * @page: Page to add to rmap
  789. * @vma: VM area to add page to.
  790. * @address: User virtual address of the mapping
  791. * @exclusive: the page is exclusively owned by the current process
  792. */
  793. static void __page_set_anon_rmap(struct page *page,
  794. struct vm_area_struct *vma, unsigned long address, int exclusive)
  795. {
  796. struct anon_vma *anon_vma = vma->anon_vma;
  797. BUG_ON(!anon_vma);
  798. if (PageAnon(page))
  799. return;
  800. /*
  801. * If the page isn't exclusively mapped into this vma,
  802. * we must use the _oldest_ possible anon_vma for the
  803. * page mapping!
  804. */
  805. if (!exclusive)
  806. anon_vma = anon_vma->root;
  807. anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
  808. page->mapping = (struct address_space *) anon_vma;
  809. page->index = linear_page_index(vma, address);
  810. }
  811. /**
  812. * __page_check_anon_rmap - sanity check anonymous rmap addition
  813. * @page: the page to add the mapping to
  814. * @vma: the vm area in which the mapping is added
  815. * @address: the user virtual address mapped
  816. */
  817. static void __page_check_anon_rmap(struct page *page,
  818. struct vm_area_struct *vma, unsigned long address)
  819. {
  820. #ifdef CONFIG_DEBUG_VM
  821. /*
  822. * The page's anon-rmap details (mapping and index) are guaranteed to
  823. * be set up correctly at this point.
  824. *
  825. * We have exclusion against page_add_anon_rmap because the caller
  826. * always holds the page locked, except if called from page_dup_rmap,
  827. * in which case the page is already known to be setup.
  828. *
  829. * We have exclusion against page_add_new_anon_rmap because those pages
  830. * are initially only visible via the pagetables, and the pte is locked
  831. * over the call to page_add_new_anon_rmap.
  832. */
  833. BUG_ON(page_anon_vma(page)->root != vma->anon_vma->root);
  834. BUG_ON(page->index != linear_page_index(vma, address));
  835. #endif
  836. }
  837. /**
  838. * page_add_anon_rmap - add pte mapping to an anonymous page
  839. * @page: the page to add the mapping to
  840. * @vma: the vm area in which the mapping is added
  841. * @address: the user virtual address mapped
  842. *
  843. * The caller needs to hold the pte lock, and the page must be locked in
  844. * the anon_vma case: to serialize mapping,index checking after setting,
  845. * and to ensure that PageAnon is not being upgraded racily to PageKsm
  846. * (but PageKsm is never downgraded to PageAnon).
  847. */
  848. void page_add_anon_rmap(struct page *page,
  849. struct vm_area_struct *vma, unsigned long address)
  850. {
  851. do_page_add_anon_rmap(page, vma, address, 0);
  852. }
  853. /*
  854. * Special version of the above for do_swap_page, which often runs
  855. * into pages that are exclusively owned by the current process.
  856. * Everybody else should continue to use page_add_anon_rmap above.
  857. */
  858. void do_page_add_anon_rmap(struct page *page,
  859. struct vm_area_struct *vma, unsigned long address, int exclusive)
  860. {
  861. int first = atomic_inc_and_test(&page->_mapcount);
  862. if (first) {
  863. /*
  864. * We use the irq-unsafe __{inc|mod}_zone_page_stat because
  865. * these counters are not modified in interrupt context, and
  866. * pte lock(a spinlock) is held, which implies preemption
  867. * disabled.
  868. */
  869. if (PageTransHuge(page))
  870. __inc_zone_page_state(page,
  871. NR_ANON_TRANSPARENT_HUGEPAGES);
  872. __mod_zone_page_state(page_zone(page), NR_ANON_PAGES,
  873. hpage_nr_pages(page));
  874. }
  875. if (unlikely(PageKsm(page)))
  876. return;
  877. VM_BUG_ON_PAGE(!PageLocked(page), page);
  878. /* address might be in next vma when migration races vma_adjust */
  879. if (first)
  880. __page_set_anon_rmap(page, vma, address, exclusive);
  881. else
  882. __page_check_anon_rmap(page, vma, address);
  883. }
  884. /**
  885. * page_add_new_anon_rmap - add pte mapping to a new anonymous page
  886. * @page: the page to add the mapping to
  887. * @vma: the vm area in which the mapping is added
  888. * @address: the user virtual address mapped
  889. *
  890. * Same as page_add_anon_rmap but must only be called on *new* pages.
  891. * This means the inc-and-test can be bypassed.
  892. * Page does not have to be locked.
  893. */
  894. void page_add_new_anon_rmap(struct page *page,
  895. struct vm_area_struct *vma, unsigned long address)
  896. {
  897. VM_BUG_ON(address < vma->vm_start || address >= vma->vm_end);
  898. SetPageSwapBacked(page);
  899. atomic_set(&page->_mapcount, 0); /* increment count (starts at -1) */
  900. if (PageTransHuge(page))
  901. __inc_zone_page_state(page, NR_ANON_TRANSPARENT_HUGEPAGES);
  902. __mod_zone_page_state(page_zone(page), NR_ANON_PAGES,
  903. hpage_nr_pages(page));
  904. __page_set_anon_rmap(page, vma, address, 1);
  905. VM_BUG_ON_PAGE(PageLRU(page), page);
  906. if (likely((vma->vm_flags & (VM_LOCKED | VM_SPECIAL)) != VM_LOCKED)) {
  907. SetPageActive(page);
  908. lru_cache_add(page);
  909. return;
  910. }
  911. if (!TestSetPageMlocked(page)) {
  912. /*
  913. * We use the irq-unsafe __mod_zone_page_stat because this
  914. * counter is not modified from interrupt context, and the pte
  915. * lock is held(spinlock), which implies preemption disabled.
  916. */
  917. __mod_zone_page_state(page_zone(page), NR_MLOCK,
  918. hpage_nr_pages(page));
  919. count_vm_event(UNEVICTABLE_PGMLOCKED);
  920. }
  921. add_page_to_unevictable_list(page);
  922. }
  923. /**
  924. * page_add_file_rmap - add pte mapping to a file page
  925. * @page: the page to add the mapping to
  926. *
  927. * The caller needs to hold the pte lock.
  928. */
  929. void page_add_file_rmap(struct page *page)
  930. {
  931. bool locked;
  932. unsigned long flags;
  933. mem_cgroup_begin_update_page_stat(page, &locked, &flags);
  934. if (atomic_inc_and_test(&page->_mapcount)) {
  935. __inc_zone_page_state(page, NR_FILE_MAPPED);
  936. mem_cgroup_inc_page_stat(page, MEM_CGROUP_STAT_FILE_MAPPED);
  937. }
  938. mem_cgroup_end_update_page_stat(page, &locked, &flags);
  939. }
  940. /**
  941. * page_remove_rmap - take down pte mapping from a page
  942. * @page: page to remove mapping from
  943. *
  944. * The caller needs to hold the pte lock.
  945. */
  946. void page_remove_rmap(struct page *page)
  947. {
  948. bool anon = PageAnon(page);
  949. bool locked;
  950. unsigned long flags;
  951. /*
  952. * The anon case has no mem_cgroup page_stat to update; but may
  953. * uncharge_page() below, where the lock ordering can deadlock if
  954. * we hold the lock against page_stat move: so avoid it on anon.
  955. */
  956. if (!anon)
  957. mem_cgroup_begin_update_page_stat(page, &locked, &flags);
  958. /* page still mapped by someone else? */
  959. if (!atomic_add_negative(-1, &page->_mapcount))
  960. goto out;
  961. /*
  962. * Hugepages are not counted in NR_ANON_PAGES nor NR_FILE_MAPPED
  963. * and not charged by memcg for now.
  964. *
  965. * We use the irq-unsafe __{inc|mod}_zone_page_stat because
  966. * these counters are not modified in interrupt context, and
  967. * these counters are not modified in interrupt context, and
  968. * pte lock(a spinlock) is held, which implies preemption disabled.
  969. */
  970. if (unlikely(PageHuge(page)))
  971. goto out;
  972. if (anon) {
  973. mem_cgroup_uncharge_page(page);
  974. if (PageTransHuge(page))
  975. __dec_zone_page_state(page,
  976. NR_ANON_TRANSPARENT_HUGEPAGES);
  977. __mod_zone_page_state(page_zone(page), NR_ANON_PAGES,
  978. -hpage_nr_pages(page));
  979. } else {
  980. __dec_zone_page_state(page, NR_FILE_MAPPED);
  981. mem_cgroup_dec_page_stat(page, MEM_CGROUP_STAT_FILE_MAPPED);
  982. mem_cgroup_end_update_page_stat(page, &locked, &flags);
  983. }
  984. if (unlikely(PageMlocked(page)))
  985. clear_page_mlock(page);
  986. /*
  987. * It would be tidy to reset the PageAnon mapping here,
  988. * but that might overwrite a racing page_add_anon_rmap
  989. * which increments mapcount after us but sets mapping
  990. * before us: so leave the reset to free_hot_cold_page,
  991. * and remember that it's only reliable while mapped.
  992. * Leaving it set also helps swapoff to reinstate ptes
  993. * faster for those pages still in swapcache.
  994. */
  995. return;
  996. out:
  997. if (!anon)
  998. mem_cgroup_end_update_page_stat(page, &locked, &flags);
  999. }
  1000. /*
  1001. * @arg: enum ttu_flags will be passed to this argument
  1002. */
  1003. static int try_to_unmap_one(struct page *page, struct vm_area_struct *vma,
  1004. unsigned long address, void *arg)
  1005. {
  1006. struct mm_struct *mm = vma->vm_mm;
  1007. pte_t *pte;
  1008. pte_t pteval;
  1009. spinlock_t *ptl;
  1010. int ret = SWAP_AGAIN;
  1011. enum ttu_flags flags = (enum ttu_flags)arg;
  1012. pte = page_check_address(page, mm, address, &ptl, 0);
  1013. if (!pte)
  1014. goto out;
  1015. /*
  1016. * If the page is mlock()d, we cannot swap it out.
  1017. * If it's recently referenced (perhaps page_referenced
  1018. * skipped over this mm) then we should reactivate it.
  1019. */
  1020. if (!(flags & TTU_IGNORE_MLOCK)) {
  1021. if (vma->vm_flags & VM_LOCKED)
  1022. goto out_mlock;
  1023. if (flags & TTU_MUNLOCK)
  1024. goto out_unmap;
  1025. }
  1026. if (!(flags & TTU_IGNORE_ACCESS)) {
  1027. if (ptep_clear_flush_young_notify(vma, address, pte)) {
  1028. ret = SWAP_FAIL;
  1029. goto out_unmap;
  1030. }
  1031. }
  1032. /* Nuke the page table entry. */
  1033. flush_cache_page(vma, address, page_to_pfn(page));
  1034. pteval = ptep_clear_flush(vma, address, pte);
  1035. /* Move the dirty bit to the physical page now the pte is gone. */
  1036. if (pte_dirty(pteval))
  1037. set_page_dirty(page);
  1038. /* Update high watermark before we lower rss */
  1039. update_hiwater_rss(mm);
  1040. if (PageHWPoison(page) && !(flags & TTU_IGNORE_HWPOISON)) {
  1041. if (!PageHuge(page)) {
  1042. if (PageAnon(page))
  1043. dec_mm_counter(mm, MM_ANONPAGES);
  1044. else
  1045. dec_mm_counter(mm, MM_FILEPAGES);
  1046. }
  1047. set_pte_at(mm, address, pte,
  1048. swp_entry_to_pte(make_hwpoison_entry(page)));
  1049. } else if (pte_unused(pteval)) {
  1050. /*
  1051. * The guest indicated that the page content is of no
  1052. * interest anymore. Simply discard the pte, vmscan
  1053. * will take care of the rest.
  1054. */
  1055. if (PageAnon(page))
  1056. dec_mm_counter(mm, MM_ANONPAGES);
  1057. else
  1058. dec_mm_counter(mm, MM_FILEPAGES);
  1059. } else if (PageAnon(page)) {
  1060. swp_entry_t entry = { .val = page_private(page) };
  1061. pte_t swp_pte;
  1062. if (PageSwapCache(page)) {
  1063. /*
  1064. * Store the swap location in the pte.
  1065. * See handle_pte_fault() ...
  1066. */
  1067. if (swap_duplicate(entry) < 0) {
  1068. set_pte_at(mm, address, pte, pteval);
  1069. ret = SWAP_FAIL;
  1070. goto out_unmap;
  1071. }
  1072. if (list_empty(&mm->mmlist)) {
  1073. spin_lock(&mmlist_lock);
  1074. if (list_empty(&mm->mmlist))
  1075. list_add(&mm->mmlist, &init_mm.mmlist);
  1076. spin_unlock(&mmlist_lock);
  1077. }
  1078. dec_mm_counter(mm, MM_ANONPAGES);
  1079. inc_mm_counter(mm, MM_SWAPENTS);
  1080. } else if (IS_ENABLED(CONFIG_MIGRATION)) {
  1081. /*
  1082. * Store the pfn of the page in a special migration
  1083. * pte. do_swap_page() will wait until the migration
  1084. * pte is removed and then restart fault handling.
  1085. */
  1086. BUG_ON(!(flags & TTU_MIGRATION));
  1087. entry = make_migration_entry(page, pte_write(pteval));
  1088. }
  1089. swp_pte = swp_entry_to_pte(entry);
  1090. if (pte_soft_dirty(pteval))
  1091. swp_pte = pte_swp_mksoft_dirty(swp_pte);
  1092. set_pte_at(mm, address, pte, swp_pte);
  1093. BUG_ON(pte_file(*pte));
  1094. } else if (IS_ENABLED(CONFIG_MIGRATION) &&
  1095. (flags & TTU_MIGRATION)) {
  1096. /* Establish migration entry for a file page */
  1097. swp_entry_t entry;
  1098. entry = make_migration_entry(page, pte_write(pteval));
  1099. set_pte_at(mm, address, pte, swp_entry_to_pte(entry));
  1100. } else
  1101. dec_mm_counter(mm, MM_FILEPAGES);
  1102. page_remove_rmap(page);
  1103. page_cache_release(page);
  1104. out_unmap:
  1105. pte_unmap_unlock(pte, ptl);
  1106. if (ret != SWAP_FAIL && !(flags & TTU_MUNLOCK))
  1107. mmu_notifier_invalidate_page(mm, address);
  1108. out:
  1109. return ret;
  1110. out_mlock:
  1111. pte_unmap_unlock(pte, ptl);
  1112. /*
  1113. * We need mmap_sem locking, Otherwise VM_LOCKED check makes
  1114. * unstable result and race. Plus, We can't wait here because
  1115. * we now hold anon_vma->rwsem or mapping->i_mmap_mutex.
  1116. * if trylock failed, the page remain in evictable lru and later
  1117. * vmscan could retry to move the page to unevictable lru if the
  1118. * page is actually mlocked.
  1119. */
  1120. if (down_read_trylock(&vma->vm_mm->mmap_sem)) {
  1121. if (vma->vm_flags & VM_LOCKED) {
  1122. mlock_vma_page(page);
  1123. ret = SWAP_MLOCK;
  1124. }
  1125. up_read(&vma->vm_mm->mmap_sem);
  1126. }
  1127. return ret;
  1128. }
  1129. /*
  1130. * objrmap doesn't work for nonlinear VMAs because the assumption that
  1131. * offset-into-file correlates with offset-into-virtual-addresses does not hold.
  1132. * Consequently, given a particular page and its ->index, we cannot locate the
  1133. * ptes which are mapping that page without an exhaustive linear search.
  1134. *
  1135. * So what this code does is a mini "virtual scan" of each nonlinear VMA which
  1136. * maps the file to which the target page belongs. The ->vm_private_data field
  1137. * holds the current cursor into that scan. Successive searches will circulate
  1138. * around the vma's virtual address space.
  1139. *
  1140. * So as more replacement pressure is applied to the pages in a nonlinear VMA,
  1141. * more scanning pressure is placed against them as well. Eventually pages
  1142. * will become fully unmapped and are eligible for eviction.
  1143. *
  1144. * For very sparsely populated VMAs this is a little inefficient - chances are
  1145. * there there won't be many ptes located within the scan cluster. In this case
  1146. * maybe we could scan further - to the end of the pte page, perhaps.
  1147. *
  1148. * Mlocked pages: check VM_LOCKED under mmap_sem held for read, if we can
  1149. * acquire it without blocking. If vma locked, mlock the pages in the cluster,
  1150. * rather than unmapping them. If we encounter the "check_page" that vmscan is
  1151. * trying to unmap, return SWAP_MLOCK, else default SWAP_AGAIN.
  1152. */
  1153. #define CLUSTER_SIZE min(32*PAGE_SIZE, PMD_SIZE)
  1154. #define CLUSTER_MASK (~(CLUSTER_SIZE - 1))
  1155. static int try_to_unmap_cluster(unsigned long cursor, unsigned int *mapcount,
  1156. struct vm_area_struct *vma, struct page *check_page)
  1157. {
  1158. struct mm_struct *mm = vma->vm_mm;
  1159. pmd_t *pmd;
  1160. pte_t *pte;
  1161. pte_t pteval;
  1162. spinlock_t *ptl;
  1163. struct page *page;
  1164. unsigned long address;
  1165. unsigned long mmun_start; /* For mmu_notifiers */
  1166. unsigned long mmun_end; /* For mmu_notifiers */
  1167. unsigned long end;
  1168. int ret = SWAP_AGAIN;
  1169. int locked_vma = 0;
  1170. address = (vma->vm_start + cursor) & CLUSTER_MASK;
  1171. end = address + CLUSTER_SIZE;
  1172. if (address < vma->vm_start)
  1173. address = vma->vm_start;
  1174. if (end > vma->vm_end)
  1175. end = vma->vm_end;
  1176. pmd = mm_find_pmd(mm, address);
  1177. if (!pmd)
  1178. return ret;
  1179. mmun_start = address;
  1180. mmun_end = end;
  1181. mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end);
  1182. /*
  1183. * If we can acquire the mmap_sem for read, and vma is VM_LOCKED,
  1184. * keep the sem while scanning the cluster for mlocking pages.
  1185. */
  1186. if (down_read_trylock(&vma->vm_mm->mmap_sem)) {
  1187. locked_vma = (vma->vm_flags & VM_LOCKED);
  1188. if (!locked_vma)
  1189. up_read(&vma->vm_mm->mmap_sem); /* don't need it */
  1190. }
  1191. pte = pte_offset_map_lock(mm, pmd, address, &ptl);
  1192. /* Update high watermark before we lower rss */
  1193. update_hiwater_rss(mm);
  1194. for (; address < end; pte++, address += PAGE_SIZE) {
  1195. if (!pte_present(*pte))
  1196. continue;
  1197. page = vm_normal_page(vma, address, *pte);
  1198. BUG_ON(!page || PageAnon(page));
  1199. if (locked_vma) {
  1200. if (page == check_page) {
  1201. /* we know we have check_page locked */
  1202. mlock_vma_page(page);
  1203. ret = SWAP_MLOCK;
  1204. } else if (trylock_page(page)) {
  1205. /*
  1206. * If we can lock the page, perform mlock.
  1207. * Otherwise leave the page alone, it will be
  1208. * eventually encountered again later.
  1209. */
  1210. mlock_vma_page(page);
  1211. unlock_page(page);
  1212. }
  1213. continue; /* don't unmap */
  1214. }
  1215. if (ptep_clear_flush_young_notify(vma, address, pte))
  1216. continue;
  1217. /* Nuke the page table entry. */
  1218. flush_cache_page(vma, address, pte_pfn(*pte));
  1219. pteval = ptep_clear_flush(vma, address, pte);
  1220. /* If nonlinear, store the file page offset in the pte. */
  1221. if (page->index != linear_page_index(vma, address)) {
  1222. pte_t ptfile = pgoff_to_pte(page->index);
  1223. if (pte_soft_dirty(pteval))
  1224. ptfile = pte_file_mksoft_dirty(ptfile);
  1225. set_pte_at(mm, address, pte, ptfile);
  1226. }
  1227. /* Move the dirty bit to the physical page now the pte is gone. */
  1228. if (pte_dirty(pteval))
  1229. set_page_dirty(page);
  1230. page_remove_rmap(page);
  1231. page_cache_release(page);
  1232. dec_mm_counter(mm, MM_FILEPAGES);
  1233. (*mapcount)--;
  1234. }
  1235. pte_unmap_unlock(pte - 1, ptl);
  1236. mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end);
  1237. if (locked_vma)
  1238. up_read(&vma->vm_mm->mmap_sem);
  1239. return ret;
  1240. }
  1241. static int try_to_unmap_nonlinear(struct page *page,
  1242. struct address_space *mapping, void *arg)
  1243. {
  1244. struct vm_area_struct *vma;
  1245. int ret = SWAP_AGAIN;
  1246. unsigned long cursor;
  1247. unsigned long max_nl_cursor = 0;
  1248. unsigned long max_nl_size = 0;
  1249. unsigned int mapcount;
  1250. list_for_each_entry(vma,
  1251. &mapping->i_mmap_nonlinear, shared.nonlinear) {
  1252. cursor = (unsigned long) vma->vm_private_data;
  1253. if (cursor > max_nl_cursor)
  1254. max_nl_cursor = cursor;
  1255. cursor = vma->vm_end - vma->vm_start;
  1256. if (cursor > max_nl_size)
  1257. max_nl_size = cursor;
  1258. }
  1259. if (max_nl_size == 0) { /* all nonlinears locked or reserved ? */
  1260. return SWAP_FAIL;
  1261. }
  1262. /*
  1263. * We don't try to search for this page in the nonlinear vmas,
  1264. * and page_referenced wouldn't have found it anyway. Instead
  1265. * just walk the nonlinear vmas trying to age and unmap some.
  1266. * The mapcount of the page we came in with is irrelevant,
  1267. * but even so use it as a guide to how hard we should try?
  1268. */
  1269. mapcount = page_mapcount(page);
  1270. if (!mapcount)
  1271. return ret;
  1272. cond_resched();
  1273. max_nl_size = (max_nl_size + CLUSTER_SIZE - 1) & CLUSTER_MASK;
  1274. if (max_nl_cursor == 0)
  1275. max_nl_cursor = CLUSTER_SIZE;
  1276. do {
  1277. list_for_each_entry(vma,
  1278. &mapping->i_mmap_nonlinear, shared.nonlinear) {
  1279. cursor = (unsigned long) vma->vm_private_data;
  1280. while (cursor < max_nl_cursor &&
  1281. cursor < vma->vm_end - vma->vm_start) {
  1282. if (try_to_unmap_cluster(cursor, &mapcount,
  1283. vma, page) == SWAP_MLOCK)
  1284. ret = SWAP_MLOCK;
  1285. cursor += CLUSTER_SIZE;
  1286. vma->vm_private_data = (void *) cursor;
  1287. if ((int)mapcount <= 0)
  1288. return ret;
  1289. }
  1290. vma->vm_private_data = (void *) max_nl_cursor;
  1291. }
  1292. cond_resched();
  1293. max_nl_cursor += CLUSTER_SIZE;
  1294. } while (max_nl_cursor <= max_nl_size);
  1295. /*
  1296. * Don't loop forever (perhaps all the remaining pages are
  1297. * in locked vmas). Reset cursor on all unreserved nonlinear
  1298. * vmas, now forgetting on which ones it had fallen behind.
  1299. */
  1300. list_for_each_entry(vma, &mapping->i_mmap_nonlinear, shared.nonlinear)
  1301. vma->vm_private_data = NULL;
  1302. return ret;
  1303. }
  1304. bool is_vma_temporary_stack(struct vm_area_struct *vma)
  1305. {
  1306. int maybe_stack = vma->vm_flags & (VM_GROWSDOWN | VM_GROWSUP);
  1307. if (!maybe_stack)
  1308. return false;
  1309. if ((vma->vm_flags & VM_STACK_INCOMPLETE_SETUP) ==
  1310. VM_STACK_INCOMPLETE_SETUP)
  1311. return true;
  1312. return false;
  1313. }
  1314. static bool invalid_migration_vma(struct vm_area_struct *vma, void *arg)
  1315. {
  1316. return is_vma_temporary_stack(vma);
  1317. }
  1318. static int page_not_mapped(struct page *page)
  1319. {
  1320. return !page_mapped(page);
  1321. };
  1322. /**
  1323. * try_to_unmap - try to remove all page table mappings to a page
  1324. * @page: the page to get unmapped
  1325. * @flags: action and flags
  1326. *
  1327. * Tries to remove all the page table entries which are mapping this
  1328. * page, used in the pageout path. Caller must hold the page lock.
  1329. * Return values are:
  1330. *
  1331. * SWAP_SUCCESS - we succeeded in removing all mappings
  1332. * SWAP_AGAIN - we missed a mapping, try again later
  1333. * SWAP_FAIL - the page is unswappable
  1334. * SWAP_MLOCK - page is mlocked.
  1335. */
  1336. int try_to_unmap(struct page *page, enum ttu_flags flags)
  1337. {
  1338. int ret;
  1339. struct rmap_walk_control rwc = {
  1340. .rmap_one = try_to_unmap_one,
  1341. .arg = (void *)flags,
  1342. .done = page_not_mapped,
  1343. .file_nonlinear = try_to_unmap_nonlinear,
  1344. .anon_lock = page_lock_anon_vma_read,
  1345. };
  1346. VM_BUG_ON_PAGE(!PageHuge(page) && PageTransHuge(page), page);
  1347. /*
  1348. * During exec, a temporary VMA is setup and later moved.
  1349. * The VMA is moved under the anon_vma lock but not the
  1350. * page tables leading to a race where migration cannot
  1351. * find the migration ptes. Rather than increasing the
  1352. * locking requirements of exec(), migration skips
  1353. * temporary VMAs until after exec() completes.
  1354. */
  1355. if ((flags & TTU_MIGRATION) && !PageKsm(page) && PageAnon(page))
  1356. rwc.invalid_vma = invalid_migration_vma;
  1357. ret = rmap_walk(page, &rwc);
  1358. if (ret != SWAP_MLOCK && !page_mapped(page))
  1359. ret = SWAP_SUCCESS;
  1360. return ret;
  1361. }
  1362. /**
  1363. * try_to_munlock - try to munlock a page
  1364. * @page: the page to be munlocked
  1365. *
  1366. * Called from munlock code. Checks all of the VMAs mapping the page
  1367. * to make sure nobody else has this page mlocked. The page will be
  1368. * returned with PG_mlocked cleared if no other vmas have it mlocked.
  1369. *
  1370. * Return values are:
  1371. *
  1372. * SWAP_AGAIN - no vma is holding page mlocked, or,
  1373. * SWAP_AGAIN - page mapped in mlocked vma -- couldn't acquire mmap sem
  1374. * SWAP_FAIL - page cannot be located at present
  1375. * SWAP_MLOCK - page is now mlocked.
  1376. */
  1377. int try_to_munlock(struct page *page)
  1378. {
  1379. int ret;
  1380. struct rmap_walk_control rwc = {
  1381. .rmap_one = try_to_unmap_one,
  1382. .arg = (void *)TTU_MUNLOCK,
  1383. .done = page_not_mapped,
  1384. /*
  1385. * We don't bother to try to find the munlocked page in
  1386. * nonlinears. It's costly. Instead, later, page reclaim logic
  1387. * may call try_to_unmap() and recover PG_mlocked lazily.
  1388. */
  1389. .file_nonlinear = NULL,
  1390. .anon_lock = page_lock_anon_vma_read,
  1391. };
  1392. VM_BUG_ON_PAGE(!PageLocked(page) || PageLRU(page), page);
  1393. ret = rmap_walk(page, &rwc);
  1394. return ret;
  1395. }
  1396. void __put_anon_vma(struct anon_vma *anon_vma)
  1397. {
  1398. struct anon_vma *root = anon_vma->root;
  1399. anon_vma_free(anon_vma);
  1400. if (root != anon_vma && atomic_dec_and_test(&root->refcount))
  1401. anon_vma_free(root);
  1402. }
  1403. static struct anon_vma *rmap_walk_anon_lock(struct page *page,
  1404. struct rmap_walk_control *rwc)
  1405. {
  1406. struct anon_vma *anon_vma;
  1407. if (rwc->anon_lock)
  1408. return rwc->anon_lock(page);
  1409. /*
  1410. * Note: remove_migration_ptes() cannot use page_lock_anon_vma_read()
  1411. * because that depends on page_mapped(); but not all its usages
  1412. * are holding mmap_sem. Users without mmap_sem are required to
  1413. * take a reference count to prevent the anon_vma disappearing
  1414. */
  1415. anon_vma = page_anon_vma(page);
  1416. if (!anon_vma)
  1417. return NULL;
  1418. anon_vma_lock_read(anon_vma);
  1419. return anon_vma;
  1420. }
  1421. /*
  1422. * rmap_walk_anon - do something to anonymous page using the object-based
  1423. * rmap method
  1424. * @page: the page to be handled
  1425. * @rwc: control variable according to each walk type
  1426. *
  1427. * Find all the mappings of a page using the mapping pointer and the vma chains
  1428. * contained in the anon_vma struct it points to.
  1429. *
  1430. * When called from try_to_munlock(), the mmap_sem of the mm containing the vma
  1431. * where the page was found will be held for write. So, we won't recheck
  1432. * vm_flags for that VMA. That should be OK, because that vma shouldn't be
  1433. * LOCKED.
  1434. */
  1435. static int rmap_walk_anon(struct page *page, struct rmap_walk_control *rwc)
  1436. {
  1437. struct anon_vma *anon_vma;
  1438. pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
  1439. struct anon_vma_chain *avc;
  1440. int ret = SWAP_AGAIN;
  1441. anon_vma = rmap_walk_anon_lock(page, rwc);
  1442. if (!anon_vma)
  1443. return ret;
  1444. anon_vma_interval_tree_foreach(avc, &anon_vma->rb_root, pgoff, pgoff) {
  1445. struct vm_area_struct *vma = avc->vma;
  1446. unsigned long address = vma_address(page, vma);
  1447. if (rwc->invalid_vma && rwc->invalid_vma(vma, rwc->arg))
  1448. continue;
  1449. ret = rwc->rmap_one(page, vma, address, rwc->arg);
  1450. if (ret != SWAP_AGAIN)
  1451. break;
  1452. if (rwc->done && rwc->done(page))
  1453. break;
  1454. }
  1455. anon_vma_unlock_read(anon_vma);
  1456. return ret;
  1457. }
  1458. /*
  1459. * rmap_walk_file - do something to file page using the object-based rmap method
  1460. * @page: the page to be handled
  1461. * @rwc: control variable according to each walk type
  1462. *
  1463. * Find all the mappings of a page using the mapping pointer and the vma chains
  1464. * contained in the address_space struct it points to.
  1465. *
  1466. * When called from try_to_munlock(), the mmap_sem of the mm containing the vma
  1467. * where the page was found will be held for write. So, we won't recheck
  1468. * vm_flags for that VMA. That should be OK, because that vma shouldn't be
  1469. * LOCKED.
  1470. */
  1471. static int rmap_walk_file(struct page *page, struct rmap_walk_control *rwc)
  1472. {
  1473. struct address_space *mapping = page->mapping;
  1474. pgoff_t pgoff = page->index << compound_order(page);
  1475. struct vm_area_struct *vma;
  1476. int ret = SWAP_AGAIN;
  1477. /*
  1478. * The page lock not only makes sure that page->mapping cannot
  1479. * suddenly be NULLified by truncation, it makes sure that the
  1480. * structure at mapping cannot be freed and reused yet,
  1481. * so we can safely take mapping->i_mmap_mutex.
  1482. */
  1483. VM_BUG_ON(!PageLocked(page));
  1484. if (!mapping)
  1485. return ret;
  1486. mutex_lock(&mapping->i_mmap_mutex);
  1487. vma_interval_tree_foreach(vma, &mapping->i_mmap, pgoff, pgoff) {
  1488. unsigned long address = vma_address(page, vma);
  1489. if (rwc->invalid_vma && rwc->invalid_vma(vma, rwc->arg))
  1490. continue;
  1491. ret = rwc->rmap_one(page, vma, address, rwc->arg);
  1492. if (ret != SWAP_AGAIN)
  1493. goto done;
  1494. if (rwc->done && rwc->done(page))
  1495. goto done;
  1496. }
  1497. if (!rwc->file_nonlinear)
  1498. goto done;
  1499. if (list_empty(&mapping->i_mmap_nonlinear))
  1500. goto done;
  1501. ret = rwc->file_nonlinear(page, mapping, rwc->arg);
  1502. done:
  1503. mutex_unlock(&mapping->i_mmap_mutex);
  1504. return ret;
  1505. }
  1506. int rmap_walk(struct page *page, struct rmap_walk_control *rwc)
  1507. {
  1508. if (unlikely(PageKsm(page)))
  1509. return rmap_walk_ksm(page, rwc);
  1510. else if (PageAnon(page))
  1511. return rmap_walk_anon(page, rwc);
  1512. else
  1513. return rmap_walk_file(page, rwc);
  1514. }
  1515. #ifdef CONFIG_HUGETLB_PAGE
  1516. /*
  1517. * The following three functions are for anonymous (private mapped) hugepages.
  1518. * Unlike common anonymous pages, anonymous hugepages have no accounting code
  1519. * and no lru code, because we handle hugepages differently from common pages.
  1520. */
  1521. static void __hugepage_set_anon_rmap(struct page *page,
  1522. struct vm_area_struct *vma, unsigned long address, int exclusive)
  1523. {
  1524. struct anon_vma *anon_vma = vma->anon_vma;
  1525. BUG_ON(!anon_vma);
  1526. if (PageAnon(page))
  1527. return;
  1528. if (!exclusive)
  1529. anon_vma = anon_vma->root;
  1530. anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
  1531. page->mapping = (struct address_space *) anon_vma;
  1532. page->index = linear_page_index(vma, address);
  1533. }
  1534. void hugepage_add_anon_rmap(struct page *page,
  1535. struct vm_area_struct *vma, unsigned long address)
  1536. {
  1537. struct anon_vma *anon_vma = vma->anon_vma;
  1538. int first;
  1539. BUG_ON(!PageLocked(page));
  1540. BUG_ON(!anon_vma);
  1541. /* address might be in next vma when migration races vma_adjust */
  1542. first = atomic_inc_and_test(&page->_mapcount);
  1543. if (first)
  1544. __hugepage_set_anon_rmap(page, vma, address, 0);
  1545. }
  1546. void hugepage_add_new_anon_rmap(struct page *page,
  1547. struct vm_area_struct *vma, unsigned long address)
  1548. {
  1549. BUG_ON(address < vma->vm_start || address >= vma->vm_end);
  1550. atomic_set(&page->_mapcount, 0);
  1551. __hugepage_set_anon_rmap(page, vma, address, 1);
  1552. }
  1553. #endif /* CONFIG_HUGETLB_PAGE */