rmap.c 26 KB

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