rmap.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929
  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 <hugh@veritas.com> 2003, 2004
  18. */
  19. /*
  20. * Lock ordering in mm:
  21. *
  22. * inode->i_mutex (while writing or truncating, not reading or faulting)
  23. * inode->i_alloc_sem
  24. *
  25. * When a page fault occurs in writing from user to file, down_read
  26. * of mmap_sem nests within i_mutex; in sys_msync, i_mutex nests within
  27. * down_read of mmap_sem; i_mutex and down_write of mmap_sem are never
  28. * taken together; in truncation, i_mutex is taken outermost.
  29. *
  30. * mm->mmap_sem
  31. * page->flags PG_locked (lock_page)
  32. * mapping->i_mmap_lock
  33. * anon_vma->lock
  34. * mm->page_table_lock or pte_lock
  35. * zone->lru_lock (in mark_page_accessed, isolate_lru_page)
  36. * swap_lock (in swap_duplicate, swap_info_get)
  37. * mmlist_lock (in mmput, drain_mmlist and others)
  38. * mapping->private_lock (in __set_page_dirty_buffers)
  39. * inode_lock (in set_page_dirty's __mark_inode_dirty)
  40. * sb_lock (within inode_lock in fs/fs-writeback.c)
  41. * mapping->tree_lock (widely used, in set_page_dirty,
  42. * in arch-dependent flush_dcache_mmap_lock,
  43. * within inode_lock in __sync_single_inode)
  44. */
  45. #include <linux/mm.h>
  46. #include <linux/pagemap.h>
  47. #include <linux/swap.h>
  48. #include <linux/swapops.h>
  49. #include <linux/slab.h>
  50. #include <linux/init.h>
  51. #include <linux/rmap.h>
  52. #include <linux/rcupdate.h>
  53. #include <linux/module.h>
  54. #include <asm/tlbflush.h>
  55. struct kmem_cache *anon_vma_cachep;
  56. static inline void validate_anon_vma(struct vm_area_struct *find_vma)
  57. {
  58. #ifdef CONFIG_DEBUG_VM
  59. struct anon_vma *anon_vma = find_vma->anon_vma;
  60. struct vm_area_struct *vma;
  61. unsigned int mapcount = 0;
  62. int found = 0;
  63. list_for_each_entry(vma, &anon_vma->head, anon_vma_node) {
  64. mapcount++;
  65. BUG_ON(mapcount > 100000);
  66. if (vma == find_vma)
  67. found = 1;
  68. }
  69. BUG_ON(!found);
  70. #endif
  71. }
  72. /* This must be called under the mmap_sem. */
  73. int anon_vma_prepare(struct vm_area_struct *vma)
  74. {
  75. struct anon_vma *anon_vma = vma->anon_vma;
  76. might_sleep();
  77. if (unlikely(!anon_vma)) {
  78. struct mm_struct *mm = vma->vm_mm;
  79. struct anon_vma *allocated, *locked;
  80. anon_vma = find_mergeable_anon_vma(vma);
  81. if (anon_vma) {
  82. allocated = NULL;
  83. locked = anon_vma;
  84. spin_lock(&locked->lock);
  85. } else {
  86. anon_vma = anon_vma_alloc();
  87. if (unlikely(!anon_vma))
  88. return -ENOMEM;
  89. allocated = anon_vma;
  90. locked = NULL;
  91. }
  92. /* page_table_lock to protect against threads */
  93. spin_lock(&mm->page_table_lock);
  94. if (likely(!vma->anon_vma)) {
  95. vma->anon_vma = anon_vma;
  96. list_add_tail(&vma->anon_vma_node, &anon_vma->head);
  97. allocated = NULL;
  98. }
  99. spin_unlock(&mm->page_table_lock);
  100. if (locked)
  101. spin_unlock(&locked->lock);
  102. if (unlikely(allocated))
  103. anon_vma_free(allocated);
  104. }
  105. return 0;
  106. }
  107. void __anon_vma_merge(struct vm_area_struct *vma, struct vm_area_struct *next)
  108. {
  109. BUG_ON(vma->anon_vma != next->anon_vma);
  110. list_del(&next->anon_vma_node);
  111. }
  112. void __anon_vma_link(struct vm_area_struct *vma)
  113. {
  114. struct anon_vma *anon_vma = vma->anon_vma;
  115. if (anon_vma) {
  116. list_add_tail(&vma->anon_vma_node, &anon_vma->head);
  117. validate_anon_vma(vma);
  118. }
  119. }
  120. void anon_vma_link(struct vm_area_struct *vma)
  121. {
  122. struct anon_vma *anon_vma = vma->anon_vma;
  123. if (anon_vma) {
  124. spin_lock(&anon_vma->lock);
  125. list_add_tail(&vma->anon_vma_node, &anon_vma->head);
  126. validate_anon_vma(vma);
  127. spin_unlock(&anon_vma->lock);
  128. }
  129. }
  130. void anon_vma_unlink(struct vm_area_struct *vma)
  131. {
  132. struct anon_vma *anon_vma = vma->anon_vma;
  133. int empty;
  134. if (!anon_vma)
  135. return;
  136. spin_lock(&anon_vma->lock);
  137. validate_anon_vma(vma);
  138. list_del(&vma->anon_vma_node);
  139. /* We must garbage collect the anon_vma if it's empty */
  140. empty = list_empty(&anon_vma->head);
  141. spin_unlock(&anon_vma->lock);
  142. if (empty)
  143. anon_vma_free(anon_vma);
  144. }
  145. static void anon_vma_ctor(void *data, struct kmem_cache *cachep,
  146. unsigned long flags)
  147. {
  148. if ((flags & (SLAB_CTOR_VERIFY|SLAB_CTOR_CONSTRUCTOR)) ==
  149. SLAB_CTOR_CONSTRUCTOR) {
  150. struct anon_vma *anon_vma = data;
  151. spin_lock_init(&anon_vma->lock);
  152. INIT_LIST_HEAD(&anon_vma->head);
  153. }
  154. }
  155. void __init anon_vma_init(void)
  156. {
  157. anon_vma_cachep = kmem_cache_create("anon_vma", sizeof(struct anon_vma),
  158. 0, SLAB_DESTROY_BY_RCU|SLAB_PANIC, anon_vma_ctor, NULL);
  159. }
  160. /*
  161. * Getting a lock on a stable anon_vma from a page off the LRU is
  162. * tricky: page_lock_anon_vma rely on RCU to guard against the races.
  163. */
  164. static struct anon_vma *page_lock_anon_vma(struct page *page)
  165. {
  166. struct anon_vma *anon_vma = NULL;
  167. unsigned long anon_mapping;
  168. rcu_read_lock();
  169. anon_mapping = (unsigned long) page->mapping;
  170. if (!(anon_mapping & PAGE_MAPPING_ANON))
  171. goto out;
  172. if (!page_mapped(page))
  173. goto out;
  174. anon_vma = (struct anon_vma *) (anon_mapping - PAGE_MAPPING_ANON);
  175. spin_lock(&anon_vma->lock);
  176. out:
  177. rcu_read_unlock();
  178. return anon_vma;
  179. }
  180. /*
  181. * At what user virtual address is page expected in vma?
  182. */
  183. static inline unsigned long
  184. vma_address(struct page *page, struct vm_area_struct *vma)
  185. {
  186. pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
  187. unsigned long address;
  188. address = vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
  189. if (unlikely(address < vma->vm_start || address >= vma->vm_end)) {
  190. /* page should be within any vma from prio_tree_next */
  191. BUG_ON(!PageAnon(page));
  192. return -EFAULT;
  193. }
  194. return address;
  195. }
  196. /*
  197. * At what user virtual address is page expected in vma? checking that the
  198. * page matches the vma: currently only used on anon pages, by unuse_vma;
  199. */
  200. unsigned long page_address_in_vma(struct page *page, struct vm_area_struct *vma)
  201. {
  202. if (PageAnon(page)) {
  203. if ((void *)vma->anon_vma !=
  204. (void *)page->mapping - PAGE_MAPPING_ANON)
  205. return -EFAULT;
  206. } else if (page->mapping && !(vma->vm_flags & VM_NONLINEAR)) {
  207. if (!vma->vm_file ||
  208. vma->vm_file->f_mapping != page->mapping)
  209. return -EFAULT;
  210. } else
  211. return -EFAULT;
  212. return vma_address(page, vma);
  213. }
  214. /*
  215. * Check that @page is mapped at @address into @mm.
  216. *
  217. * On success returns with pte mapped and locked.
  218. */
  219. pte_t *page_check_address(struct page *page, struct mm_struct *mm,
  220. unsigned long address, spinlock_t **ptlp)
  221. {
  222. pgd_t *pgd;
  223. pud_t *pud;
  224. pmd_t *pmd;
  225. pte_t *pte;
  226. spinlock_t *ptl;
  227. pgd = pgd_offset(mm, address);
  228. if (!pgd_present(*pgd))
  229. return NULL;
  230. pud = pud_offset(pgd, address);
  231. if (!pud_present(*pud))
  232. return NULL;
  233. pmd = pmd_offset(pud, address);
  234. if (!pmd_present(*pmd))
  235. return NULL;
  236. pte = pte_offset_map(pmd, address);
  237. /* Make a quick check before getting the lock */
  238. if (!pte_present(*pte)) {
  239. pte_unmap(pte);
  240. return NULL;
  241. }
  242. ptl = pte_lockptr(mm, pmd);
  243. spin_lock(ptl);
  244. if (pte_present(*pte) && page_to_pfn(page) == pte_pfn(*pte)) {
  245. *ptlp = ptl;
  246. return pte;
  247. }
  248. pte_unmap_unlock(pte, ptl);
  249. return NULL;
  250. }
  251. /*
  252. * Subfunctions of page_referenced: page_referenced_one called
  253. * repeatedly from either page_referenced_anon or page_referenced_file.
  254. */
  255. static int page_referenced_one(struct page *page,
  256. struct vm_area_struct *vma, unsigned int *mapcount)
  257. {
  258. struct mm_struct *mm = vma->vm_mm;
  259. unsigned long address;
  260. pte_t *pte;
  261. spinlock_t *ptl;
  262. int referenced = 0;
  263. address = vma_address(page, vma);
  264. if (address == -EFAULT)
  265. goto out;
  266. pte = page_check_address(page, mm, address, &ptl);
  267. if (!pte)
  268. goto out;
  269. if (ptep_clear_flush_young(vma, address, pte))
  270. referenced++;
  271. /* Pretend the page is referenced if the task has the
  272. swap token and is in the middle of a page fault. */
  273. if (mm != current->mm && has_swap_token(mm) &&
  274. rwsem_is_locked(&mm->mmap_sem))
  275. referenced++;
  276. (*mapcount)--;
  277. pte_unmap_unlock(pte, ptl);
  278. out:
  279. return referenced;
  280. }
  281. static int page_referenced_anon(struct page *page)
  282. {
  283. unsigned int mapcount;
  284. struct anon_vma *anon_vma;
  285. struct vm_area_struct *vma;
  286. int referenced = 0;
  287. anon_vma = page_lock_anon_vma(page);
  288. if (!anon_vma)
  289. return referenced;
  290. mapcount = page_mapcount(page);
  291. list_for_each_entry(vma, &anon_vma->head, anon_vma_node) {
  292. referenced += page_referenced_one(page, vma, &mapcount);
  293. if (!mapcount)
  294. break;
  295. }
  296. spin_unlock(&anon_vma->lock);
  297. return referenced;
  298. }
  299. /**
  300. * page_referenced_file - referenced check for object-based rmap
  301. * @page: the page we're checking references on.
  302. *
  303. * For an object-based mapped page, find all the places it is mapped and
  304. * check/clear the referenced flag. This is done by following the page->mapping
  305. * pointer, then walking the chain of vmas it holds. It returns the number
  306. * of references it found.
  307. *
  308. * This function is only called from page_referenced for object-based pages.
  309. */
  310. static int page_referenced_file(struct page *page)
  311. {
  312. unsigned int mapcount;
  313. struct address_space *mapping = page->mapping;
  314. pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
  315. struct vm_area_struct *vma;
  316. struct prio_tree_iter iter;
  317. int referenced = 0;
  318. /*
  319. * The caller's checks on page->mapping and !PageAnon have made
  320. * sure that this is a file page: the check for page->mapping
  321. * excludes the case just before it gets set on an anon page.
  322. */
  323. BUG_ON(PageAnon(page));
  324. /*
  325. * The page lock not only makes sure that page->mapping cannot
  326. * suddenly be NULLified by truncation, it makes sure that the
  327. * structure at mapping cannot be freed and reused yet,
  328. * so we can safely take mapping->i_mmap_lock.
  329. */
  330. BUG_ON(!PageLocked(page));
  331. spin_lock(&mapping->i_mmap_lock);
  332. /*
  333. * i_mmap_lock does not stabilize mapcount at all, but mapcount
  334. * is more likely to be accurate if we note it after spinning.
  335. */
  336. mapcount = page_mapcount(page);
  337. vma_prio_tree_foreach(vma, &iter, &mapping->i_mmap, pgoff, pgoff) {
  338. if ((vma->vm_flags & (VM_LOCKED|VM_MAYSHARE))
  339. == (VM_LOCKED|VM_MAYSHARE)) {
  340. referenced++;
  341. break;
  342. }
  343. referenced += page_referenced_one(page, vma, &mapcount);
  344. if (!mapcount)
  345. break;
  346. }
  347. spin_unlock(&mapping->i_mmap_lock);
  348. return referenced;
  349. }
  350. /**
  351. * page_referenced - test if the page was referenced
  352. * @page: the page to test
  353. * @is_locked: caller holds lock on the page
  354. *
  355. * Quick test_and_clear_referenced for all mappings to a page,
  356. * returns the number of ptes which referenced the page.
  357. */
  358. int page_referenced(struct page *page, int is_locked)
  359. {
  360. int referenced = 0;
  361. if (page_test_and_clear_young(page))
  362. referenced++;
  363. if (TestClearPageReferenced(page))
  364. referenced++;
  365. if (page_mapped(page) && page->mapping) {
  366. if (PageAnon(page))
  367. referenced += page_referenced_anon(page);
  368. else if (is_locked)
  369. referenced += page_referenced_file(page);
  370. else if (TestSetPageLocked(page))
  371. referenced++;
  372. else {
  373. if (page->mapping)
  374. referenced += page_referenced_file(page);
  375. unlock_page(page);
  376. }
  377. }
  378. return referenced;
  379. }
  380. static int page_mkclean_one(struct page *page, struct vm_area_struct *vma)
  381. {
  382. struct mm_struct *mm = vma->vm_mm;
  383. unsigned long address;
  384. pte_t *pte, entry;
  385. spinlock_t *ptl;
  386. int ret = 0;
  387. address = vma_address(page, vma);
  388. if (address == -EFAULT)
  389. goto out;
  390. pte = page_check_address(page, mm, address, &ptl);
  391. if (!pte)
  392. goto out;
  393. if (!pte_dirty(*pte) && !pte_write(*pte))
  394. goto unlock;
  395. entry = ptep_get_and_clear(mm, address, pte);
  396. entry = pte_mkclean(entry);
  397. entry = pte_wrprotect(entry);
  398. ptep_establish(vma, address, pte, entry);
  399. lazy_mmu_prot_update(entry);
  400. ret = 1;
  401. unlock:
  402. pte_unmap_unlock(pte, ptl);
  403. out:
  404. return ret;
  405. }
  406. static int page_mkclean_file(struct address_space *mapping, struct page *page)
  407. {
  408. pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
  409. struct vm_area_struct *vma;
  410. struct prio_tree_iter iter;
  411. int ret = 0;
  412. BUG_ON(PageAnon(page));
  413. spin_lock(&mapping->i_mmap_lock);
  414. vma_prio_tree_foreach(vma, &iter, &mapping->i_mmap, pgoff, pgoff) {
  415. if (vma->vm_flags & VM_SHARED)
  416. ret += page_mkclean_one(page, vma);
  417. }
  418. spin_unlock(&mapping->i_mmap_lock);
  419. return ret;
  420. }
  421. int page_mkclean(struct page *page)
  422. {
  423. int ret = 0;
  424. BUG_ON(!PageLocked(page));
  425. if (page_mapped(page)) {
  426. struct address_space *mapping = page_mapping(page);
  427. if (mapping)
  428. ret = page_mkclean_file(mapping, page);
  429. }
  430. return ret;
  431. }
  432. /**
  433. * page_set_anon_rmap - setup new anonymous rmap
  434. * @page: the page to add the mapping to
  435. * @vma: the vm area in which the mapping is added
  436. * @address: the user virtual address mapped
  437. */
  438. static void __page_set_anon_rmap(struct page *page,
  439. struct vm_area_struct *vma, unsigned long address)
  440. {
  441. struct anon_vma *anon_vma = vma->anon_vma;
  442. BUG_ON(!anon_vma);
  443. anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
  444. page->mapping = (struct address_space *) anon_vma;
  445. page->index = linear_page_index(vma, address);
  446. /*
  447. * nr_mapped state can be updated without turning off
  448. * interrupts because it is not modified via interrupt.
  449. */
  450. __inc_zone_page_state(page, NR_ANON_PAGES);
  451. }
  452. /**
  453. * page_add_anon_rmap - add pte mapping to an anonymous page
  454. * @page: the page to add the mapping to
  455. * @vma: the vm area in which the mapping is added
  456. * @address: the user virtual address mapped
  457. *
  458. * The caller needs to hold the pte lock.
  459. */
  460. void page_add_anon_rmap(struct page *page,
  461. struct vm_area_struct *vma, unsigned long address)
  462. {
  463. if (atomic_inc_and_test(&page->_mapcount))
  464. __page_set_anon_rmap(page, vma, address);
  465. /* else checking page index and mapping is racy */
  466. }
  467. /*
  468. * page_add_new_anon_rmap - add pte mapping to a new anonymous page
  469. * @page: the page to add the mapping to
  470. * @vma: the vm area in which the mapping is added
  471. * @address: the user virtual address mapped
  472. *
  473. * Same as page_add_anon_rmap but must only be called on *new* pages.
  474. * This means the inc-and-test can be bypassed.
  475. */
  476. void page_add_new_anon_rmap(struct page *page,
  477. struct vm_area_struct *vma, unsigned long address)
  478. {
  479. atomic_set(&page->_mapcount, 0); /* elevate count by 1 (starts at -1) */
  480. __page_set_anon_rmap(page, vma, address);
  481. }
  482. /**
  483. * page_add_file_rmap - add pte mapping to a file page
  484. * @page: the page to add the mapping to
  485. *
  486. * The caller needs to hold the pte lock.
  487. */
  488. void page_add_file_rmap(struct page *page)
  489. {
  490. if (atomic_inc_and_test(&page->_mapcount))
  491. __inc_zone_page_state(page, NR_FILE_MAPPED);
  492. }
  493. /**
  494. * page_remove_rmap - take down pte mapping from a page
  495. * @page: page to remove mapping from
  496. *
  497. * The caller needs to hold the pte lock.
  498. */
  499. void page_remove_rmap(struct page *page)
  500. {
  501. if (atomic_add_negative(-1, &page->_mapcount)) {
  502. #ifdef CONFIG_DEBUG_VM
  503. if (unlikely(page_mapcount(page) < 0)) {
  504. printk (KERN_EMERG "Eeek! page_mapcount(page) went negative! (%d)\n", page_mapcount(page));
  505. printk (KERN_EMERG " page->flags = %lx\n", page->flags);
  506. printk (KERN_EMERG " page->count = %x\n", page_count(page));
  507. printk (KERN_EMERG " page->mapping = %p\n", page->mapping);
  508. }
  509. #endif
  510. BUG_ON(page_mapcount(page) < 0);
  511. /*
  512. * It would be tidy to reset the PageAnon mapping here,
  513. * but that might overwrite a racing page_add_anon_rmap
  514. * which increments mapcount after us but sets mapping
  515. * before us: so leave the reset to free_hot_cold_page,
  516. * and remember that it's only reliable while mapped.
  517. * Leaving it set also helps swapoff to reinstate ptes
  518. * faster for those pages still in swapcache.
  519. */
  520. if (page_test_and_clear_dirty(page))
  521. set_page_dirty(page);
  522. __dec_zone_page_state(page,
  523. PageAnon(page) ? NR_ANON_PAGES : NR_FILE_MAPPED);
  524. }
  525. }
  526. /*
  527. * Subfunctions of try_to_unmap: try_to_unmap_one called
  528. * repeatedly from either try_to_unmap_anon or try_to_unmap_file.
  529. */
  530. static int try_to_unmap_one(struct page *page, struct vm_area_struct *vma,
  531. int migration)
  532. {
  533. struct mm_struct *mm = vma->vm_mm;
  534. unsigned long address;
  535. pte_t *pte;
  536. pte_t pteval;
  537. spinlock_t *ptl;
  538. int ret = SWAP_AGAIN;
  539. address = vma_address(page, vma);
  540. if (address == -EFAULT)
  541. goto out;
  542. pte = page_check_address(page, mm, address, &ptl);
  543. if (!pte)
  544. goto out;
  545. /*
  546. * If the page is mlock()d, we cannot swap it out.
  547. * If it's recently referenced (perhaps page_referenced
  548. * skipped over this mm) then we should reactivate it.
  549. */
  550. if (!migration && ((vma->vm_flags & VM_LOCKED) ||
  551. (ptep_clear_flush_young(vma, address, pte)))) {
  552. ret = SWAP_FAIL;
  553. goto out_unmap;
  554. }
  555. /* Nuke the page table entry. */
  556. flush_cache_page(vma, address, page_to_pfn(page));
  557. pteval = ptep_clear_flush(vma, address, pte);
  558. /* Move the dirty bit to the physical page now the pte is gone. */
  559. if (pte_dirty(pteval))
  560. set_page_dirty(page);
  561. /* Update high watermark before we lower rss */
  562. update_hiwater_rss(mm);
  563. if (PageAnon(page)) {
  564. swp_entry_t entry = { .val = page_private(page) };
  565. if (PageSwapCache(page)) {
  566. /*
  567. * Store the swap location in the pte.
  568. * See handle_pte_fault() ...
  569. */
  570. swap_duplicate(entry);
  571. if (list_empty(&mm->mmlist)) {
  572. spin_lock(&mmlist_lock);
  573. if (list_empty(&mm->mmlist))
  574. list_add(&mm->mmlist, &init_mm.mmlist);
  575. spin_unlock(&mmlist_lock);
  576. }
  577. dec_mm_counter(mm, anon_rss);
  578. #ifdef CONFIG_MIGRATION
  579. } else {
  580. /*
  581. * Store the pfn of the page in a special migration
  582. * pte. do_swap_page() will wait until the migration
  583. * pte is removed and then restart fault handling.
  584. */
  585. BUG_ON(!migration);
  586. entry = make_migration_entry(page, pte_write(pteval));
  587. #endif
  588. }
  589. set_pte_at(mm, address, pte, swp_entry_to_pte(entry));
  590. BUG_ON(pte_file(*pte));
  591. } else
  592. #ifdef CONFIG_MIGRATION
  593. if (migration) {
  594. /* Establish migration entry for a file page */
  595. swp_entry_t entry;
  596. entry = make_migration_entry(page, pte_write(pteval));
  597. set_pte_at(mm, address, pte, swp_entry_to_pte(entry));
  598. } else
  599. #endif
  600. dec_mm_counter(mm, file_rss);
  601. page_remove_rmap(page);
  602. page_cache_release(page);
  603. out_unmap:
  604. pte_unmap_unlock(pte, ptl);
  605. out:
  606. return ret;
  607. }
  608. /*
  609. * objrmap doesn't work for nonlinear VMAs because the assumption that
  610. * offset-into-file correlates with offset-into-virtual-addresses does not hold.
  611. * Consequently, given a particular page and its ->index, we cannot locate the
  612. * ptes which are mapping that page without an exhaustive linear search.
  613. *
  614. * So what this code does is a mini "virtual scan" of each nonlinear VMA which
  615. * maps the file to which the target page belongs. The ->vm_private_data field
  616. * holds the current cursor into that scan. Successive searches will circulate
  617. * around the vma's virtual address space.
  618. *
  619. * So as more replacement pressure is applied to the pages in a nonlinear VMA,
  620. * more scanning pressure is placed against them as well. Eventually pages
  621. * will become fully unmapped and are eligible for eviction.
  622. *
  623. * For very sparsely populated VMAs this is a little inefficient - chances are
  624. * there there won't be many ptes located within the scan cluster. In this case
  625. * maybe we could scan further - to the end of the pte page, perhaps.
  626. */
  627. #define CLUSTER_SIZE min(32*PAGE_SIZE, PMD_SIZE)
  628. #define CLUSTER_MASK (~(CLUSTER_SIZE - 1))
  629. static void try_to_unmap_cluster(unsigned long cursor,
  630. unsigned int *mapcount, struct vm_area_struct *vma)
  631. {
  632. struct mm_struct *mm = vma->vm_mm;
  633. pgd_t *pgd;
  634. pud_t *pud;
  635. pmd_t *pmd;
  636. pte_t *pte;
  637. pte_t pteval;
  638. spinlock_t *ptl;
  639. struct page *page;
  640. unsigned long address;
  641. unsigned long end;
  642. address = (vma->vm_start + cursor) & CLUSTER_MASK;
  643. end = address + CLUSTER_SIZE;
  644. if (address < vma->vm_start)
  645. address = vma->vm_start;
  646. if (end > vma->vm_end)
  647. end = vma->vm_end;
  648. pgd = pgd_offset(mm, address);
  649. if (!pgd_present(*pgd))
  650. return;
  651. pud = pud_offset(pgd, address);
  652. if (!pud_present(*pud))
  653. return;
  654. pmd = pmd_offset(pud, address);
  655. if (!pmd_present(*pmd))
  656. return;
  657. pte = pte_offset_map_lock(mm, pmd, address, &ptl);
  658. /* Update high watermark before we lower rss */
  659. update_hiwater_rss(mm);
  660. for (; address < end; pte++, address += PAGE_SIZE) {
  661. if (!pte_present(*pte))
  662. continue;
  663. page = vm_normal_page(vma, address, *pte);
  664. BUG_ON(!page || PageAnon(page));
  665. if (ptep_clear_flush_young(vma, address, pte))
  666. continue;
  667. /* Nuke the page table entry. */
  668. flush_cache_page(vma, address, pte_pfn(*pte));
  669. pteval = ptep_clear_flush(vma, address, pte);
  670. /* If nonlinear, store the file page offset in the pte. */
  671. if (page->index != linear_page_index(vma, address))
  672. set_pte_at(mm, address, pte, pgoff_to_pte(page->index));
  673. /* Move the dirty bit to the physical page now the pte is gone. */
  674. if (pte_dirty(pteval))
  675. set_page_dirty(page);
  676. page_remove_rmap(page);
  677. page_cache_release(page);
  678. dec_mm_counter(mm, file_rss);
  679. (*mapcount)--;
  680. }
  681. pte_unmap_unlock(pte - 1, ptl);
  682. }
  683. static int try_to_unmap_anon(struct page *page, int migration)
  684. {
  685. struct anon_vma *anon_vma;
  686. struct vm_area_struct *vma;
  687. int ret = SWAP_AGAIN;
  688. anon_vma = page_lock_anon_vma(page);
  689. if (!anon_vma)
  690. return ret;
  691. list_for_each_entry(vma, &anon_vma->head, anon_vma_node) {
  692. ret = try_to_unmap_one(page, vma, migration);
  693. if (ret == SWAP_FAIL || !page_mapped(page))
  694. break;
  695. }
  696. spin_unlock(&anon_vma->lock);
  697. return ret;
  698. }
  699. /**
  700. * try_to_unmap_file - unmap file page using the object-based rmap method
  701. * @page: the page to unmap
  702. *
  703. * Find all the mappings of a page using the mapping pointer and the vma chains
  704. * contained in the address_space struct it points to.
  705. *
  706. * This function is only called from try_to_unmap for object-based pages.
  707. */
  708. static int try_to_unmap_file(struct page *page, int migration)
  709. {
  710. struct address_space *mapping = page->mapping;
  711. pgoff_t pgoff = page->index << (PAGE_CACHE_SHIFT - PAGE_SHIFT);
  712. struct vm_area_struct *vma;
  713. struct prio_tree_iter iter;
  714. int ret = SWAP_AGAIN;
  715. unsigned long cursor;
  716. unsigned long max_nl_cursor = 0;
  717. unsigned long max_nl_size = 0;
  718. unsigned int mapcount;
  719. spin_lock(&mapping->i_mmap_lock);
  720. vma_prio_tree_foreach(vma, &iter, &mapping->i_mmap, pgoff, pgoff) {
  721. ret = try_to_unmap_one(page, vma, migration);
  722. if (ret == SWAP_FAIL || !page_mapped(page))
  723. goto out;
  724. }
  725. if (list_empty(&mapping->i_mmap_nonlinear))
  726. goto out;
  727. list_for_each_entry(vma, &mapping->i_mmap_nonlinear,
  728. shared.vm_set.list) {
  729. if ((vma->vm_flags & VM_LOCKED) && !migration)
  730. continue;
  731. cursor = (unsigned long) vma->vm_private_data;
  732. if (cursor > max_nl_cursor)
  733. max_nl_cursor = cursor;
  734. cursor = vma->vm_end - vma->vm_start;
  735. if (cursor > max_nl_size)
  736. max_nl_size = cursor;
  737. }
  738. if (max_nl_size == 0) { /* any nonlinears locked or reserved */
  739. ret = SWAP_FAIL;
  740. goto out;
  741. }
  742. /*
  743. * We don't try to search for this page in the nonlinear vmas,
  744. * and page_referenced wouldn't have found it anyway. Instead
  745. * just walk the nonlinear vmas trying to age and unmap some.
  746. * The mapcount of the page we came in with is irrelevant,
  747. * but even so use it as a guide to how hard we should try?
  748. */
  749. mapcount = page_mapcount(page);
  750. if (!mapcount)
  751. goto out;
  752. cond_resched_lock(&mapping->i_mmap_lock);
  753. max_nl_size = (max_nl_size + CLUSTER_SIZE - 1) & CLUSTER_MASK;
  754. if (max_nl_cursor == 0)
  755. max_nl_cursor = CLUSTER_SIZE;
  756. do {
  757. list_for_each_entry(vma, &mapping->i_mmap_nonlinear,
  758. shared.vm_set.list) {
  759. if ((vma->vm_flags & VM_LOCKED) && !migration)
  760. continue;
  761. cursor = (unsigned long) vma->vm_private_data;
  762. while ( cursor < max_nl_cursor &&
  763. cursor < vma->vm_end - vma->vm_start) {
  764. try_to_unmap_cluster(cursor, &mapcount, vma);
  765. cursor += CLUSTER_SIZE;
  766. vma->vm_private_data = (void *) cursor;
  767. if ((int)mapcount <= 0)
  768. goto out;
  769. }
  770. vma->vm_private_data = (void *) max_nl_cursor;
  771. }
  772. cond_resched_lock(&mapping->i_mmap_lock);
  773. max_nl_cursor += CLUSTER_SIZE;
  774. } while (max_nl_cursor <= max_nl_size);
  775. /*
  776. * Don't loop forever (perhaps all the remaining pages are
  777. * in locked vmas). Reset cursor on all unreserved nonlinear
  778. * vmas, now forgetting on which ones it had fallen behind.
  779. */
  780. list_for_each_entry(vma, &mapping->i_mmap_nonlinear, shared.vm_set.list)
  781. vma->vm_private_data = NULL;
  782. out:
  783. spin_unlock(&mapping->i_mmap_lock);
  784. return ret;
  785. }
  786. /**
  787. * try_to_unmap - try to remove all page table mappings to a page
  788. * @page: the page to get unmapped
  789. *
  790. * Tries to remove all the page table entries which are mapping this
  791. * page, used in the pageout path. Caller must hold the page lock.
  792. * Return values are:
  793. *
  794. * SWAP_SUCCESS - we succeeded in removing all mappings
  795. * SWAP_AGAIN - we missed a mapping, try again later
  796. * SWAP_FAIL - the page is unswappable
  797. */
  798. int try_to_unmap(struct page *page, int migration)
  799. {
  800. int ret;
  801. BUG_ON(!PageLocked(page));
  802. if (PageAnon(page))
  803. ret = try_to_unmap_anon(page, migration);
  804. else
  805. ret = try_to_unmap_file(page, migration);
  806. if (!page_mapped(page))
  807. ret = SWAP_SUCCESS;
  808. return ret;
  809. }