fremap.c 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264
  1. /*
  2. * linux/mm/fremap.c
  3. *
  4. * Explicit pagetable population and nonlinear (random) mappings support.
  5. *
  6. * started by Ingo Molnar, Copyright (C) 2002, 2003
  7. */
  8. #include <linux/export.h>
  9. #include <linux/backing-dev.h>
  10. #include <linux/mm.h>
  11. #include <linux/swap.h>
  12. #include <linux/file.h>
  13. #include <linux/mman.h>
  14. #include <linux/pagemap.h>
  15. #include <linux/swapops.h>
  16. #include <linux/rmap.h>
  17. #include <linux/syscalls.h>
  18. #include <linux/mmu_notifier.h>
  19. #include <asm/mmu_context.h>
  20. #include <asm/cacheflush.h>
  21. #include <asm/tlbflush.h>
  22. #include "internal.h"
  23. static void zap_pte(struct mm_struct *mm, struct vm_area_struct *vma,
  24. unsigned long addr, pte_t *ptep)
  25. {
  26. pte_t pte = *ptep;
  27. if (pte_present(pte)) {
  28. struct page *page;
  29. flush_cache_page(vma, addr, pte_pfn(pte));
  30. pte = ptep_clear_flush(vma, addr, ptep);
  31. page = vm_normal_page(vma, addr, pte);
  32. if (page) {
  33. if (pte_dirty(pte))
  34. set_page_dirty(page);
  35. page_remove_rmap(page);
  36. page_cache_release(page);
  37. update_hiwater_rss(mm);
  38. dec_mm_counter(mm, MM_FILEPAGES);
  39. }
  40. } else {
  41. if (!pte_file(pte))
  42. free_swap_and_cache(pte_to_swp_entry(pte));
  43. pte_clear_not_present_full(mm, addr, ptep, 0);
  44. }
  45. }
  46. /*
  47. * Install a file pte to a given virtual memory address, release any
  48. * previously existing mapping.
  49. */
  50. static int install_file_pte(struct mm_struct *mm, struct vm_area_struct *vma,
  51. unsigned long addr, unsigned long pgoff, pgprot_t prot)
  52. {
  53. int err = -ENOMEM;
  54. pte_t *pte;
  55. spinlock_t *ptl;
  56. pte = get_locked_pte(mm, addr, &ptl);
  57. if (!pte)
  58. goto out;
  59. if (!pte_none(*pte))
  60. zap_pte(mm, vma, addr, pte);
  61. set_pte_at(mm, addr, pte, pgoff_to_pte(pgoff));
  62. /*
  63. * We don't need to run update_mmu_cache() here because the "file pte"
  64. * being installed by install_file_pte() is not a real pte - it's a
  65. * non-present entry (like a swap entry), noting what file offset should
  66. * be mapped there when there's a fault (in a non-linear vma where
  67. * that's not obvious).
  68. */
  69. pte_unmap_unlock(pte, ptl);
  70. err = 0;
  71. out:
  72. return err;
  73. }
  74. int generic_file_remap_pages(struct vm_area_struct *vma, unsigned long addr,
  75. unsigned long size, pgoff_t pgoff)
  76. {
  77. struct mm_struct *mm = vma->vm_mm;
  78. int err;
  79. do {
  80. err = install_file_pte(mm, vma, addr, pgoff, vma->vm_page_prot);
  81. if (err)
  82. return err;
  83. size -= PAGE_SIZE;
  84. addr += PAGE_SIZE;
  85. pgoff++;
  86. } while (size);
  87. return 0;
  88. }
  89. EXPORT_SYMBOL(generic_file_remap_pages);
  90. /**
  91. * sys_remap_file_pages - remap arbitrary pages of an existing VM_SHARED vma
  92. * @start: start of the remapped virtual memory range
  93. * @size: size of the remapped virtual memory range
  94. * @prot: new protection bits of the range (see NOTE)
  95. * @pgoff: to-be-mapped page of the backing store file
  96. * @flags: 0 or MAP_NONBLOCKED - the later will cause no IO.
  97. *
  98. * sys_remap_file_pages remaps arbitrary pages of an existing VM_SHARED vma
  99. * (shared backing store file).
  100. *
  101. * This syscall works purely via pagetables, so it's the most efficient
  102. * way to map the same (large) file into a given virtual window. Unlike
  103. * mmap()/mremap() it does not create any new vmas. The new mappings are
  104. * also safe across swapout.
  105. *
  106. * NOTE: the @prot parameter right now is ignored (but must be zero),
  107. * and the vma's default protection is used. Arbitrary protections
  108. * might be implemented in the future.
  109. */
  110. SYSCALL_DEFINE5(remap_file_pages, unsigned long, start, unsigned long, size,
  111. unsigned long, prot, unsigned long, pgoff, unsigned long, flags)
  112. {
  113. struct mm_struct *mm = current->mm;
  114. struct address_space *mapping;
  115. struct vm_area_struct *vma;
  116. int err = -EINVAL;
  117. int has_write_lock = 0;
  118. if (prot)
  119. return err;
  120. /*
  121. * Sanitize the syscall parameters:
  122. */
  123. start = start & PAGE_MASK;
  124. size = size & PAGE_MASK;
  125. /* Does the address range wrap, or is the span zero-sized? */
  126. if (start + size <= start)
  127. return err;
  128. /* Does pgoff wrap? */
  129. if (pgoff + (size >> PAGE_SHIFT) < pgoff)
  130. return err;
  131. /* Can we represent this offset inside this architecture's pte's? */
  132. #if PTE_FILE_MAX_BITS < BITS_PER_LONG
  133. if (pgoff + (size >> PAGE_SHIFT) >= (1UL << PTE_FILE_MAX_BITS))
  134. return err;
  135. #endif
  136. /* We need down_write() to change vma->vm_flags. */
  137. down_read(&mm->mmap_sem);
  138. retry:
  139. vma = find_vma(mm, start);
  140. /*
  141. * Make sure the vma is shared, that it supports prefaulting,
  142. * and that the remapped range is valid and fully within
  143. * the single existing vma. vm_private_data is used as a
  144. * swapout cursor in a VM_NONLINEAR vma.
  145. */
  146. if (!vma || !(vma->vm_flags & VM_SHARED))
  147. goto out;
  148. if (vma->vm_private_data && !(vma->vm_flags & VM_NONLINEAR))
  149. goto out;
  150. if (!vma->vm_ops->remap_pages)
  151. goto out;
  152. if (start < vma->vm_start || start + size > vma->vm_end)
  153. goto out;
  154. /* Must set VM_NONLINEAR before any pages are populated. */
  155. if (!(vma->vm_flags & VM_NONLINEAR)) {
  156. /* Don't need a nonlinear mapping, exit success */
  157. if (pgoff == linear_page_index(vma, start)) {
  158. err = 0;
  159. goto out;
  160. }
  161. if (!has_write_lock) {
  162. up_read(&mm->mmap_sem);
  163. down_write(&mm->mmap_sem);
  164. has_write_lock = 1;
  165. goto retry;
  166. }
  167. mapping = vma->vm_file->f_mapping;
  168. /*
  169. * page_mkclean doesn't work on nonlinear vmas, so if
  170. * dirty pages need to be accounted, emulate with linear
  171. * vmas.
  172. */
  173. if (mapping_cap_account_dirty(mapping)) {
  174. unsigned long addr;
  175. struct file *file = get_file(vma->vm_file);
  176. flags &= MAP_NONBLOCK;
  177. addr = mmap_region(file, start, size,
  178. flags, vma->vm_flags, pgoff);
  179. fput(file);
  180. if (IS_ERR_VALUE(addr)) {
  181. err = addr;
  182. } else {
  183. BUG_ON(addr != start);
  184. err = 0;
  185. }
  186. goto out;
  187. }
  188. mutex_lock(&mapping->i_mmap_mutex);
  189. flush_dcache_mmap_lock(mapping);
  190. vma->vm_flags |= VM_NONLINEAR;
  191. vma_prio_tree_remove(vma, &mapping->i_mmap);
  192. vma_nonlinear_insert(vma, &mapping->i_mmap_nonlinear);
  193. flush_dcache_mmap_unlock(mapping);
  194. mutex_unlock(&mapping->i_mmap_mutex);
  195. }
  196. if (vma->vm_flags & VM_LOCKED) {
  197. /*
  198. * drop PG_Mlocked flag for over-mapped range
  199. */
  200. vm_flags_t saved_flags = vma->vm_flags;
  201. munlock_vma_pages_range(vma, start, start + size);
  202. vma->vm_flags = saved_flags;
  203. }
  204. mmu_notifier_invalidate_range_start(mm, start, start + size);
  205. err = vma->vm_ops->remap_pages(vma, start, size, pgoff);
  206. mmu_notifier_invalidate_range_end(mm, start, start + size);
  207. if (!err && !(flags & MAP_NONBLOCK)) {
  208. if (vma->vm_flags & VM_LOCKED) {
  209. /*
  210. * might be mapping previously unmapped range of file
  211. */
  212. mlock_vma_pages_range(vma, start, start + size);
  213. } else {
  214. if (unlikely(has_write_lock)) {
  215. downgrade_write(&mm->mmap_sem);
  216. has_write_lock = 0;
  217. }
  218. make_pages_present(start, start+size);
  219. }
  220. }
  221. /*
  222. * We can't clear VM_NONLINEAR because we'd have to do
  223. * it after ->populate completes, and that would prevent
  224. * downgrading the lock. (Locks can't be upgraded).
  225. */
  226. out:
  227. if (likely(!has_write_lock))
  228. up_read(&mm->mmap_sem);
  229. else
  230. up_write(&mm->mmap_sem);
  231. return err;
  232. }