fremap.c 6.1 KB

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