blob: a0c4c10bbab7bec64ea525d6e57f51da5aa879c1 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * linux/mm/mincore.c
3 *
Linus Torvalds2f77d102006-12-16 09:44:32 -08004 * Copyright (C) 1994-2006 Linus Torvalds
Linus Torvalds1da177e2005-04-16 15:20:36 -07005 */
6
7/*
8 * The mincore() system call.
9 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070010#include <linux/pagemap.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090011#include <linux/gfp.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070012#include <linux/mm.h>
13#include <linux/mman.h>
14#include <linux/syscalls.h>
Nick Piggin42da9cb2007-02-12 00:51:39 -080015#include <linux/swap.h>
16#include <linux/swapops.h>
Naoya Horiguchi4f16fc12009-12-14 17:59:58 -080017#include <linux/hugetlb.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070018
19#include <asm/uaccess.h>
20#include <asm/pgtable.h>
21
Johannes Weinerf4884012010-05-24 14:32:10 -070022static void mincore_hugetlb_page_range(struct vm_area_struct *vma,
23 unsigned long addr, unsigned long nr,
24 unsigned char *vec)
25{
26#ifdef CONFIG_HUGETLB_PAGE
27 struct hstate *h;
28 int i;
29
30 i = 0;
31 h = hstate_vma(vma);
32 while (1) {
33 unsigned char present;
34 pte_t *ptep;
35 /*
36 * Huge pages are always in RAM for now, but
37 * theoretically it needs to be checked.
38 */
39 ptep = huge_pte_offset(current->mm,
40 addr & huge_page_mask(h));
41 present = ptep && !huge_pte_none(huge_ptep_get(ptep));
42 while (1) {
43 vec[i++] = present;
44 addr += PAGE_SIZE;
45 /* reach buffer limit */
46 if (i == nr)
47 return;
48 /* check hugepage border */
49 if (!(addr & ~huge_page_mask(h)))
50 break;
51 }
52 }
53#else
54 BUG();
55#endif
56}
57
Linus Torvalds1da177e2005-04-16 15:20:36 -070058/*
59 * Later we can get more picky about what "in core" means precisely.
60 * For now, simply check to see if the page is in the page cache,
61 * and is up to date; i.e. that no page-in operation would be required
62 * at this time if an application were to map and access this page.
63 */
Nick Piggin42da9cb2007-02-12 00:51:39 -080064static unsigned char mincore_page(struct address_space *mapping, pgoff_t pgoff)
Linus Torvalds1da177e2005-04-16 15:20:36 -070065{
66 unsigned char present = 0;
Nick Piggin42da9cb2007-02-12 00:51:39 -080067 struct page *page;
Linus Torvalds1da177e2005-04-16 15:20:36 -070068
Nick Piggin42da9cb2007-02-12 00:51:39 -080069 /*
70 * When tmpfs swaps out a page from a file, any process mapping that
71 * file will not get a swp_entry_t in its pte, but rather it is like
72 * any other file mapping (ie. marked !present and faulted in with
Nick Piggin3c18ddd2008-04-28 02:12:10 -070073 * tmpfs's .fault). So swapped out tmpfs mappings are tested here.
Nick Piggin42da9cb2007-02-12 00:51:39 -080074 *
75 * However when tmpfs moves the page from pagecache and into swapcache,
76 * it is still in core, but the find_get_page below won't find it.
77 * No big deal, but make a note of it.
78 */
79 page = find_get_page(mapping, pgoff);
Linus Torvalds1da177e2005-04-16 15:20:36 -070080 if (page) {
81 present = PageUptodate(page);
82 page_cache_release(page);
83 }
84
85 return present;
86}
87
Johannes Weinerf4884012010-05-24 14:32:10 -070088static void mincore_unmapped_range(struct vm_area_struct *vma,
89 unsigned long addr, unsigned long nr,
90 unsigned char *vec)
Linus Torvalds1da177e2005-04-16 15:20:36 -070091{
Nick Piggin42da9cb2007-02-12 00:51:39 -080092 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -070093
Johannes Weinerf4884012010-05-24 14:32:10 -070094 if (vma->vm_file) {
95 pgoff_t pgoff;
Linus Torvalds2f77d102006-12-16 09:44:32 -080096
Johannes Weinerf4884012010-05-24 14:32:10 -070097 pgoff = linear_page_index(vma, addr);
98 for (i = 0; i < nr; i++, pgoff++)
99 vec[i] = mincore_page(vma->vm_file->f_mapping, pgoff);
100 } else {
101 for (i = 0; i < nr; i++)
102 vec[i] = 0;
Naoya Horiguchi4f16fc12009-12-14 17:59:58 -0800103 }
Johannes Weinerf4884012010-05-24 14:32:10 -0700104}
Naoya Horiguchi4f16fc12009-12-14 17:59:58 -0800105
Johannes Weinerf4884012010-05-24 14:32:10 -0700106static void mincore_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
107 unsigned long addr, unsigned long nr,
108 unsigned char *vec)
109{
110 spinlock_t *ptl;
111 pte_t *ptep;
112 int i;
Linus Torvalds2f77d102006-12-16 09:44:32 -0800113
Nick Piggin42da9cb2007-02-12 00:51:39 -0800114 ptep = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
115 for (i = 0; i < nr; i++, ptep++, addr += PAGE_SIZE) {
Nick Piggin42da9cb2007-02-12 00:51:39 -0800116 pte_t pte = *ptep;
Johannes Weinerf4884012010-05-24 14:32:10 -0700117 pgoff_t pgoff;
Nick Piggin42da9cb2007-02-12 00:51:39 -0800118
Johannes Weinerf4884012010-05-24 14:32:10 -0700119 if (pte_none(pte))
120 mincore_unmapped_range(vma, addr, 1, vec);
121 else if (pte_present(pte))
Johannes Weiner6a60f1b2010-05-24 14:32:09 -0700122 vec[i] = 1;
123 else if (pte_file(pte)) {
Nick Piggin42da9cb2007-02-12 00:51:39 -0800124 pgoff = pte_to_pgoff(pte);
Johannes Weiner6a60f1b2010-05-24 14:32:09 -0700125 vec[i] = mincore_page(vma->vm_file->f_mapping, pgoff);
Nick Piggin42da9cb2007-02-12 00:51:39 -0800126 } else { /* pte is a swap entry */
127 swp_entry_t entry = pte_to_swp_entry(pte);
Johannes Weiner6a60f1b2010-05-24 14:32:09 -0700128
Nick Piggin42da9cb2007-02-12 00:51:39 -0800129 if (is_migration_entry(entry)) {
130 /* migration entries are always uptodate */
Johannes Weiner6a60f1b2010-05-24 14:32:09 -0700131 vec[i] = 1;
Nick Piggin42da9cb2007-02-12 00:51:39 -0800132 } else {
Nick Piggin30fcffe2007-02-14 12:35:02 +0100133#ifdef CONFIG_SWAP
Nick Piggin42da9cb2007-02-12 00:51:39 -0800134 pgoff = entry.val;
Johannes Weiner6a60f1b2010-05-24 14:32:09 -0700135 vec[i] = mincore_page(&swapper_space, pgoff);
Nick Piggin30fcffe2007-02-14 12:35:02 +0100136#else
137 WARN_ON(1);
Johannes Weiner6a60f1b2010-05-24 14:32:09 -0700138 vec[i] = 1;
Nick Piggin30fcffe2007-02-14 12:35:02 +0100139#endif
Nick Piggin42da9cb2007-02-12 00:51:39 -0800140 }
141 }
142 }
Johannes Weiner6a60f1b2010-05-24 14:32:09 -0700143 pte_unmap_unlock(ptep - 1, ptl);
Johannes Weinerf4884012010-05-24 14:32:10 -0700144}
Nick Piggin42da9cb2007-02-12 00:51:39 -0800145
Johannes Weinerf4884012010-05-24 14:32:10 -0700146/*
147 * Do a chunk of "sys_mincore()". We've already checked
148 * all the arguments, we hold the mmap semaphore: we should
149 * just return the amount of info we're asked for.
150 */
151static long do_mincore(unsigned long addr, unsigned long pages, unsigned char *vec)
152{
153 pgd_t *pgd;
154 pud_t *pud;
155 pmd_t *pmd;
156 unsigned long nr;
157 struct vm_area_struct *vma;
158
159 vma = find_vma(current->mm, addr);
160 if (!vma || addr < vma->vm_start)
161 return -ENOMEM;
162
163 nr = min(pages, (vma->vm_end - addr) >> PAGE_SHIFT);
164
165 if (is_vm_hugetlb_page(vma)) {
166 mincore_hugetlb_page_range(vma, addr, nr, vec);
167 return nr;
168 }
169
170 /*
171 * Calculate how many pages there are left in the last level of the
172 * PTE array for our address.
173 */
174 nr = min(nr, PTRS_PER_PTE - ((addr >> PAGE_SHIFT) & (PTRS_PER_PTE-1)));
175
176 pgd = pgd_offset(vma->vm_mm, addr);
177 if (pgd_none_or_clear_bad(pgd))
178 goto none_mapped;
179 pud = pud_offset(pgd, addr);
180 if (pud_none_or_clear_bad(pud))
181 goto none_mapped;
182 pmd = pmd_offset(pud, addr);
183 if (pmd_none_or_clear_bad(pmd))
184 goto none_mapped;
185
186 mincore_pte_range(vma, pmd, addr, nr, vec);
Nick Piggin42da9cb2007-02-12 00:51:39 -0800187 return nr;
188
189none_mapped:
Johannes Weinerf4884012010-05-24 14:32:10 -0700190 mincore_unmapped_range(vma, addr, nr, vec);
Linus Torvalds2f77d102006-12-16 09:44:32 -0800191 return nr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700192}
193
194/*
195 * The mincore(2) system call.
196 *
197 * mincore() returns the memory residency status of the pages in the
198 * current process's address space specified by [addr, addr + len).
199 * The status is returned in a vector of bytes. The least significant
200 * bit of each byte is 1 if the referenced page is in memory, otherwise
201 * it is zero.
202 *
203 * Because the status of a page can change after mincore() checks it
204 * but before it returns to the application, the returned vector may
205 * contain stale information. Only locked pages are guaranteed to
206 * remain in memory.
207 *
208 * return values:
209 * zero - success
210 * -EFAULT - vec points to an illegal address
211 * -EINVAL - addr is not a multiple of PAGE_CACHE_SIZE
212 * -ENOMEM - Addresses in the range [addr, addr + len] are
213 * invalid for the address space of this process, or
214 * specify one or more pages which are not currently
215 * mapped
216 * -EAGAIN - A kernel resource was temporarily unavailable.
217 */
Heiko Carstens3480b252009-01-14 14:14:16 +0100218SYSCALL_DEFINE3(mincore, unsigned long, start, size_t, len,
219 unsigned char __user *, vec)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220{
Linus Torvalds2f77d102006-12-16 09:44:32 -0800221 long retval;
222 unsigned long pages;
223 unsigned char *tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700224
Linus Torvalds2f77d102006-12-16 09:44:32 -0800225 /* Check the start address: needs to be page-aligned.. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 if (start & ~PAGE_CACHE_MASK)
Linus Torvalds2f77d102006-12-16 09:44:32 -0800227 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228
Linus Torvalds2f77d102006-12-16 09:44:32 -0800229 /* ..and we need to be passed a valid user-space range */
230 if (!access_ok(VERIFY_READ, (void __user *) start, len))
231 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700232
Linus Torvalds2f77d102006-12-16 09:44:32 -0800233 /* This also avoids any overflows on PAGE_CACHE_ALIGN */
234 pages = len >> PAGE_SHIFT;
235 pages += (len & ~PAGE_MASK) != 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236
Linus Torvalds2f77d102006-12-16 09:44:32 -0800237 if (!access_ok(VERIFY_WRITE, vec, pages))
238 return -EFAULT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700239
Linus Torvalds2f77d102006-12-16 09:44:32 -0800240 tmp = (void *) __get_free_page(GFP_USER);
241 if (!tmp)
Linus Torvalds4fb23e42006-12-16 16:01:50 -0800242 return -EAGAIN;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700243
Linus Torvalds2f77d102006-12-16 09:44:32 -0800244 retval = 0;
245 while (pages) {
246 /*
247 * Do at most PAGE_SIZE entries per iteration, due to
248 * the temporary buffer size.
249 */
250 down_read(&current->mm->mmap_sem);
Johannes Weiner6a60f1b2010-05-24 14:32:09 -0700251 retval = do_mincore(start, min(pages, PAGE_SIZE), tmp);
Linus Torvalds2f77d102006-12-16 09:44:32 -0800252 up_read(&current->mm->mmap_sem);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700253
Linus Torvalds2f77d102006-12-16 09:44:32 -0800254 if (retval <= 0)
255 break;
256 if (copy_to_user(vec, tmp, retval)) {
257 retval = -EFAULT;
258 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700259 }
Linus Torvalds2f77d102006-12-16 09:44:32 -0800260 pages -= retval;
261 vec += retval;
262 start += retval << PAGE_SHIFT;
263 retval = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 }
Linus Torvalds2f77d102006-12-16 09:44:32 -0800265 free_page((unsigned long) tmp);
266 return retval;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267}