mincore.c 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267
  1. /*
  2. * linux/mm/mincore.c
  3. *
  4. * Copyright (C) 1994-2006 Linus Torvalds
  5. */
  6. /*
  7. * The mincore() system call.
  8. */
  9. #include <linux/pagemap.h>
  10. #include <linux/gfp.h>
  11. #include <linux/mm.h>
  12. #include <linux/mman.h>
  13. #include <linux/syscalls.h>
  14. #include <linux/swap.h>
  15. #include <linux/swapops.h>
  16. #include <linux/hugetlb.h>
  17. #include <asm/uaccess.h>
  18. #include <asm/pgtable.h>
  19. static void mincore_hugetlb_page_range(struct vm_area_struct *vma,
  20. unsigned long addr, unsigned long nr,
  21. unsigned char *vec)
  22. {
  23. #ifdef CONFIG_HUGETLB_PAGE
  24. struct hstate *h;
  25. int i;
  26. i = 0;
  27. h = hstate_vma(vma);
  28. while (1) {
  29. unsigned char present;
  30. pte_t *ptep;
  31. /*
  32. * Huge pages are always in RAM for now, but
  33. * theoretically it needs to be checked.
  34. */
  35. ptep = huge_pte_offset(current->mm,
  36. addr & huge_page_mask(h));
  37. present = ptep && !huge_pte_none(huge_ptep_get(ptep));
  38. while (1) {
  39. vec[i++] = present;
  40. addr += PAGE_SIZE;
  41. /* reach buffer limit */
  42. if (i == nr)
  43. return;
  44. /* check hugepage border */
  45. if (!(addr & ~huge_page_mask(h)))
  46. break;
  47. }
  48. }
  49. #else
  50. BUG();
  51. #endif
  52. }
  53. /*
  54. * Later we can get more picky about what "in core" means precisely.
  55. * For now, simply check to see if the page is in the page cache,
  56. * and is up to date; i.e. that no page-in operation would be required
  57. * at this time if an application were to map and access this page.
  58. */
  59. static unsigned char mincore_page(struct address_space *mapping, pgoff_t pgoff)
  60. {
  61. unsigned char present = 0;
  62. struct page *page;
  63. /*
  64. * When tmpfs swaps out a page from a file, any process mapping that
  65. * file will not get a swp_entry_t in its pte, but rather it is like
  66. * any other file mapping (ie. marked !present and faulted in with
  67. * tmpfs's .fault). So swapped out tmpfs mappings are tested here.
  68. *
  69. * However when tmpfs moves the page from pagecache and into swapcache,
  70. * it is still in core, but the find_get_page below won't find it.
  71. * No big deal, but make a note of it.
  72. */
  73. page = find_get_page(mapping, pgoff);
  74. if (page) {
  75. present = PageUptodate(page);
  76. page_cache_release(page);
  77. }
  78. return present;
  79. }
  80. static void mincore_unmapped_range(struct vm_area_struct *vma,
  81. unsigned long addr, unsigned long nr,
  82. unsigned char *vec)
  83. {
  84. int i;
  85. if (vma->vm_file) {
  86. pgoff_t pgoff;
  87. pgoff = linear_page_index(vma, addr);
  88. for (i = 0; i < nr; i++, pgoff++)
  89. vec[i] = mincore_page(vma->vm_file->f_mapping, pgoff);
  90. } else {
  91. for (i = 0; i < nr; i++)
  92. vec[i] = 0;
  93. }
  94. }
  95. static void mincore_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
  96. unsigned long addr, unsigned long nr,
  97. unsigned char *vec)
  98. {
  99. spinlock_t *ptl;
  100. pte_t *ptep;
  101. int i;
  102. ptep = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
  103. for (i = 0; i < nr; i++, ptep++, addr += PAGE_SIZE) {
  104. pte_t pte = *ptep;
  105. pgoff_t pgoff;
  106. if (pte_none(pte))
  107. mincore_unmapped_range(vma, addr, 1, vec);
  108. else if (pte_present(pte))
  109. vec[i] = 1;
  110. else if (pte_file(pte)) {
  111. pgoff = pte_to_pgoff(pte);
  112. vec[i] = mincore_page(vma->vm_file->f_mapping, pgoff);
  113. } else { /* pte is a swap entry */
  114. swp_entry_t entry = pte_to_swp_entry(pte);
  115. if (is_migration_entry(entry)) {
  116. /* migration entries are always uptodate */
  117. vec[i] = 1;
  118. } else {
  119. #ifdef CONFIG_SWAP
  120. pgoff = entry.val;
  121. vec[i] = mincore_page(&swapper_space, pgoff);
  122. #else
  123. WARN_ON(1);
  124. vec[i] = 1;
  125. #endif
  126. }
  127. }
  128. }
  129. pte_unmap_unlock(ptep - 1, ptl);
  130. }
  131. /*
  132. * Do a chunk of "sys_mincore()". We've already checked
  133. * all the arguments, we hold the mmap semaphore: we should
  134. * just return the amount of info we're asked for.
  135. */
  136. static long do_mincore(unsigned long addr, unsigned long pages, unsigned char *vec)
  137. {
  138. pgd_t *pgd;
  139. pud_t *pud;
  140. pmd_t *pmd;
  141. unsigned long nr;
  142. struct vm_area_struct *vma;
  143. vma = find_vma(current->mm, addr);
  144. if (!vma || addr < vma->vm_start)
  145. return -ENOMEM;
  146. nr = min(pages, (vma->vm_end - addr) >> PAGE_SHIFT);
  147. if (is_vm_hugetlb_page(vma)) {
  148. mincore_hugetlb_page_range(vma, addr, nr, vec);
  149. return nr;
  150. }
  151. /*
  152. * Calculate how many pages there are left in the last level of the
  153. * PTE array for our address.
  154. */
  155. nr = min(nr, PTRS_PER_PTE - ((addr >> PAGE_SHIFT) & (PTRS_PER_PTE-1)));
  156. pgd = pgd_offset(vma->vm_mm, addr);
  157. if (pgd_none_or_clear_bad(pgd))
  158. goto none_mapped;
  159. pud = pud_offset(pgd, addr);
  160. if (pud_none_or_clear_bad(pud))
  161. goto none_mapped;
  162. pmd = pmd_offset(pud, addr);
  163. if (pmd_none_or_clear_bad(pmd))
  164. goto none_mapped;
  165. mincore_pte_range(vma, pmd, addr, nr, vec);
  166. return nr;
  167. none_mapped:
  168. mincore_unmapped_range(vma, addr, nr, vec);
  169. return nr;
  170. }
  171. /*
  172. * The mincore(2) system call.
  173. *
  174. * mincore() returns the memory residency status of the pages in the
  175. * current process's address space specified by [addr, addr + len).
  176. * The status is returned in a vector of bytes. The least significant
  177. * bit of each byte is 1 if the referenced page is in memory, otherwise
  178. * it is zero.
  179. *
  180. * Because the status of a page can change after mincore() checks it
  181. * but before it returns to the application, the returned vector may
  182. * contain stale information. Only locked pages are guaranteed to
  183. * remain in memory.
  184. *
  185. * return values:
  186. * zero - success
  187. * -EFAULT - vec points to an illegal address
  188. * -EINVAL - addr is not a multiple of PAGE_CACHE_SIZE
  189. * -ENOMEM - Addresses in the range [addr, addr + len] are
  190. * invalid for the address space of this process, or
  191. * specify one or more pages which are not currently
  192. * mapped
  193. * -EAGAIN - A kernel resource was temporarily unavailable.
  194. */
  195. SYSCALL_DEFINE3(mincore, unsigned long, start, size_t, len,
  196. unsigned char __user *, vec)
  197. {
  198. long retval;
  199. unsigned long pages;
  200. unsigned char *tmp;
  201. /* Check the start address: needs to be page-aligned.. */
  202. if (start & ~PAGE_CACHE_MASK)
  203. return -EINVAL;
  204. /* ..and we need to be passed a valid user-space range */
  205. if (!access_ok(VERIFY_READ, (void __user *) start, len))
  206. return -ENOMEM;
  207. /* This also avoids any overflows on PAGE_CACHE_ALIGN */
  208. pages = len >> PAGE_SHIFT;
  209. pages += (len & ~PAGE_MASK) != 0;
  210. if (!access_ok(VERIFY_WRITE, vec, pages))
  211. return -EFAULT;
  212. tmp = (void *) __get_free_page(GFP_USER);
  213. if (!tmp)
  214. return -EAGAIN;
  215. retval = 0;
  216. while (pages) {
  217. /*
  218. * Do at most PAGE_SIZE entries per iteration, due to
  219. * the temporary buffer size.
  220. */
  221. down_read(&current->mm->mmap_sem);
  222. retval = do_mincore(start, min(pages, PAGE_SIZE), tmp);
  223. up_read(&current->mm->mmap_sem);
  224. if (retval <= 0)
  225. break;
  226. if (copy_to_user(vec, tmp, retval)) {
  227. retval = -EFAULT;
  228. break;
  229. }
  230. pages -= retval;
  231. vec += retval;
  232. start += retval << PAGE_SHIFT;
  233. retval = 0;
  234. }
  235. free_page((unsigned long) tmp);
  236. return retval;
  237. }