fremap.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256
  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/mm.h>
  9. #include <linux/swap.h>
  10. #include <linux/file.h>
  11. #include <linux/mman.h>
  12. #include <linux/pagemap.h>
  13. #include <linux/swapops.h>
  14. #include <linux/rmap.h>
  15. #include <linux/module.h>
  16. #include <linux/syscalls.h>
  17. #include <asm/mmu_context.h>
  18. #include <asm/cacheflush.h>
  19. #include <asm/tlbflush.h>
  20. static inline void zap_pte(struct mm_struct *mm, struct vm_area_struct *vma,
  21. unsigned long addr, pte_t *ptep)
  22. {
  23. pte_t pte = *ptep;
  24. if (pte_none(pte))
  25. return;
  26. if (pte_present(pte)) {
  27. unsigned long pfn = pte_pfn(pte);
  28. flush_cache_page(vma, addr, pfn);
  29. pte = ptep_clear_flush(vma, addr, ptep);
  30. if (pfn_valid(pfn)) {
  31. struct page *page = pfn_to_page(pfn);
  32. if (!PageReserved(page)) {
  33. if (pte_dirty(pte))
  34. set_page_dirty(page);
  35. page_remove_rmap(page);
  36. page_cache_release(page);
  37. dec_mm_counter(mm, rss);
  38. }
  39. }
  40. } else {
  41. if (!pte_file(pte))
  42. free_swap_and_cache(pte_to_swp_entry(pte));
  43. pte_clear(mm, addr, ptep);
  44. }
  45. }
  46. /*
  47. * Install a file page to a given virtual memory address, release any
  48. * previously existing mapping.
  49. */
  50. int install_page(struct mm_struct *mm, struct vm_area_struct *vma,
  51. unsigned long addr, struct page *page, pgprot_t prot)
  52. {
  53. struct inode *inode;
  54. pgoff_t size;
  55. int err = -ENOMEM;
  56. pte_t *pte;
  57. pmd_t *pmd;
  58. pud_t *pud;
  59. pgd_t *pgd;
  60. pte_t pte_val;
  61. pgd = pgd_offset(mm, addr);
  62. spin_lock(&mm->page_table_lock);
  63. pud = pud_alloc(mm, pgd, addr);
  64. if (!pud)
  65. goto err_unlock;
  66. pmd = pmd_alloc(mm, pud, addr);
  67. if (!pmd)
  68. goto err_unlock;
  69. pte = pte_alloc_map(mm, pmd, addr);
  70. if (!pte)
  71. goto err_unlock;
  72. /*
  73. * This page may have been truncated. Tell the
  74. * caller about it.
  75. */
  76. err = -EINVAL;
  77. inode = vma->vm_file->f_mapping->host;
  78. size = (i_size_read(inode) + PAGE_CACHE_SIZE - 1) >> PAGE_CACHE_SHIFT;
  79. if (!page->mapping || page->index >= size)
  80. goto err_unlock;
  81. zap_pte(mm, vma, addr, pte);
  82. inc_mm_counter(mm,rss);
  83. flush_icache_page(vma, page);
  84. set_pte_at(mm, addr, pte, mk_pte(page, prot));
  85. page_add_file_rmap(page);
  86. pte_val = *pte;
  87. pte_unmap(pte);
  88. update_mmu_cache(vma, addr, pte_val);
  89. err = 0;
  90. err_unlock:
  91. spin_unlock(&mm->page_table_lock);
  92. return err;
  93. }
  94. EXPORT_SYMBOL(install_page);
  95. /*
  96. * Install a file pte to a given virtual memory address, release any
  97. * previously existing mapping.
  98. */
  99. int install_file_pte(struct mm_struct *mm, struct vm_area_struct *vma,
  100. unsigned long addr, unsigned long pgoff, pgprot_t prot)
  101. {
  102. int err = -ENOMEM;
  103. pte_t *pte;
  104. pmd_t *pmd;
  105. pud_t *pud;
  106. pgd_t *pgd;
  107. pte_t pte_val;
  108. pgd = pgd_offset(mm, addr);
  109. spin_lock(&mm->page_table_lock);
  110. pud = pud_alloc(mm, pgd, addr);
  111. if (!pud)
  112. goto err_unlock;
  113. pmd = pmd_alloc(mm, pud, addr);
  114. if (!pmd)
  115. goto err_unlock;
  116. pte = pte_alloc_map(mm, pmd, addr);
  117. if (!pte)
  118. goto err_unlock;
  119. zap_pte(mm, vma, addr, pte);
  120. set_pte_at(mm, addr, pte, pgoff_to_pte(pgoff));
  121. pte_val = *pte;
  122. pte_unmap(pte);
  123. update_mmu_cache(vma, addr, pte_val);
  124. spin_unlock(&mm->page_table_lock);
  125. return 0;
  126. err_unlock:
  127. spin_unlock(&mm->page_table_lock);
  128. return err;
  129. }
  130. /***
  131. * sys_remap_file_pages - remap arbitrary pages of a shared backing store
  132. * file within an existing vma.
  133. * @start: start of the remapped virtual memory range
  134. * @size: size of the remapped virtual memory range
  135. * @prot: new protection bits of the range
  136. * @pgoff: to be mapped page of the backing store file
  137. * @flags: 0 or MAP_NONBLOCKED - the later will cause no IO.
  138. *
  139. * this syscall works purely via pagetables, so it's the most efficient
  140. * way to map the same (large) file into a given virtual window. Unlike
  141. * mmap()/mremap() it does not create any new vmas. The new mappings are
  142. * also safe across swapout.
  143. *
  144. * NOTE: the 'prot' parameter right now is ignored, and the vma's default
  145. * protection is used. Arbitrary protections might be implemented in the
  146. * future.
  147. */
  148. asmlinkage long sys_remap_file_pages(unsigned long start, unsigned long size,
  149. unsigned long __prot, unsigned long pgoff, unsigned long flags)
  150. {
  151. struct mm_struct *mm = current->mm;
  152. struct address_space *mapping;
  153. unsigned long end = start + size;
  154. struct vm_area_struct *vma;
  155. int err = -EINVAL;
  156. int has_write_lock = 0;
  157. if (__prot)
  158. return err;
  159. /*
  160. * Sanitize the syscall parameters:
  161. */
  162. start = start & PAGE_MASK;
  163. size = size & PAGE_MASK;
  164. /* Does the address range wrap, or is the span zero-sized? */
  165. if (start + size <= start)
  166. return err;
  167. /* Can we represent this offset inside this architecture's pte's? */
  168. #if PTE_FILE_MAX_BITS < BITS_PER_LONG
  169. if (pgoff + (size >> PAGE_SHIFT) >= (1UL << PTE_FILE_MAX_BITS))
  170. return err;
  171. #endif
  172. /* We need down_write() to change vma->vm_flags. */
  173. down_read(&mm->mmap_sem);
  174. retry:
  175. vma = find_vma(mm, start);
  176. /*
  177. * Make sure the vma is shared, that it supports prefaulting,
  178. * and that the remapped range is valid and fully within
  179. * the single existing vma. vm_private_data is used as a
  180. * swapout cursor in a VM_NONLINEAR vma (unless VM_RESERVED
  181. * or VM_LOCKED, but VM_LOCKED could be revoked later on).
  182. */
  183. if (vma && (vma->vm_flags & VM_SHARED) &&
  184. (!vma->vm_private_data ||
  185. (vma->vm_flags & (VM_NONLINEAR|VM_RESERVED))) &&
  186. vma->vm_ops && vma->vm_ops->populate &&
  187. end > start && start >= vma->vm_start &&
  188. end <= vma->vm_end) {
  189. /* Must set VM_NONLINEAR before any pages are populated. */
  190. if (pgoff != linear_page_index(vma, start) &&
  191. !(vma->vm_flags & VM_NONLINEAR)) {
  192. if (!has_write_lock) {
  193. up_read(&mm->mmap_sem);
  194. down_write(&mm->mmap_sem);
  195. has_write_lock = 1;
  196. goto retry;
  197. }
  198. mapping = vma->vm_file->f_mapping;
  199. spin_lock(&mapping->i_mmap_lock);
  200. flush_dcache_mmap_lock(mapping);
  201. vma->vm_flags |= VM_NONLINEAR;
  202. vma_prio_tree_remove(vma, &mapping->i_mmap);
  203. vma_nonlinear_insert(vma, &mapping->i_mmap_nonlinear);
  204. flush_dcache_mmap_unlock(mapping);
  205. spin_unlock(&mapping->i_mmap_lock);
  206. }
  207. err = vma->vm_ops->populate(vma, start, size,
  208. vma->vm_page_prot,
  209. pgoff, flags & MAP_NONBLOCK);
  210. /*
  211. * We can't clear VM_NONLINEAR because we'd have to do
  212. * it after ->populate completes, and that would prevent
  213. * downgrading the lock. (Locks can't be upgraded).
  214. */
  215. }
  216. if (likely(!has_write_lock))
  217. up_read(&mm->mmap_sem);
  218. else
  219. up_write(&mm->mmap_sem);
  220. return err;
  221. }