]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/mm/mincore.c | |
3 | * | |
2f77d107 | 4 | * Copyright (C) 1994-2006 Linus Torvalds |
1da177e4 LT |
5 | */ |
6 | ||
7 | /* | |
8 | * The mincore() system call. | |
9 | */ | |
1da177e4 | 10 | #include <linux/pagemap.h> |
5a0e3ad6 | 11 | #include <linux/gfp.h> |
1da177e4 LT |
12 | #include <linux/mm.h> |
13 | #include <linux/mman.h> | |
14 | #include <linux/syscalls.h> | |
42da9cbd NP |
15 | #include <linux/swap.h> |
16 | #include <linux/swapops.h> | |
4f16fc10 | 17 | #include <linux/hugetlb.h> |
1da177e4 LT |
18 | |
19 | #include <asm/uaccess.h> | |
20 | #include <asm/pgtable.h> | |
21 | ||
f4884010 | 22 | static void mincore_hugetlb_page_range(struct vm_area_struct *vma, |
25ef0e50 | 23 | unsigned long addr, unsigned long end, |
f4884010 JW |
24 | unsigned char *vec) |
25 | { | |
26 | #ifdef CONFIG_HUGETLB_PAGE | |
27 | struct hstate *h; | |
f4884010 | 28 | |
f4884010 JW |
29 | h = hstate_vma(vma); |
30 | while (1) { | |
31 | unsigned char present; | |
32 | pte_t *ptep; | |
33 | /* | |
34 | * Huge pages are always in RAM for now, but | |
35 | * theoretically it needs to be checked. | |
36 | */ | |
37 | ptep = huge_pte_offset(current->mm, | |
38 | addr & huge_page_mask(h)); | |
39 | present = ptep && !huge_pte_none(huge_ptep_get(ptep)); | |
40 | while (1) { | |
25ef0e50 JW |
41 | *vec = present; |
42 | vec++; | |
f4884010 | 43 | addr += PAGE_SIZE; |
25ef0e50 | 44 | if (addr == end) |
f4884010 JW |
45 | return; |
46 | /* check hugepage border */ | |
47 | if (!(addr & ~huge_page_mask(h))) | |
48 | break; | |
49 | } | |
50 | } | |
51 | #else | |
52 | BUG(); | |
53 | #endif | |
54 | } | |
55 | ||
1da177e4 LT |
56 | /* |
57 | * Later we can get more picky about what "in core" means precisely. | |
58 | * For now, simply check to see if the page is in the page cache, | |
59 | * and is up to date; i.e. that no page-in operation would be required | |
60 | * at this time if an application were to map and access this page. | |
61 | */ | |
42da9cbd | 62 | static unsigned char mincore_page(struct address_space *mapping, pgoff_t pgoff) |
1da177e4 LT |
63 | { |
64 | unsigned char present = 0; | |
42da9cbd | 65 | struct page *page; |
1da177e4 | 66 | |
42da9cbd NP |
67 | /* |
68 | * When tmpfs swaps out a page from a file, any process mapping that | |
69 | * file will not get a swp_entry_t in its pte, but rather it is like | |
70 | * any other file mapping (ie. marked !present and faulted in with | |
3c18ddd1 | 71 | * tmpfs's .fault). So swapped out tmpfs mappings are tested here. |
42da9cbd NP |
72 | */ |
73 | page = find_get_page(mapping, pgoff); | |
31475dd6 | 74 | #ifdef CONFIG_SWAP |
8079b1c8 | 75 | /* shmem/tmpfs may return swap: account for swapcache page too. */ |
31475dd6 HD |
76 | if (radix_tree_exceptional_entry(page)) { |
77 | swp_entry_t swap = radix_to_swp_entry(page); | |
33806f06 | 78 | page = find_get_page(swap_address_space(swap), swap.val); |
31475dd6 HD |
79 | } |
80 | #endif | |
1da177e4 LT |
81 | if (page) { |
82 | present = PageUptodate(page); | |
83 | page_cache_release(page); | |
84 | } | |
85 | ||
86 | return present; | |
87 | } | |
88 | ||
f4884010 | 89 | static void mincore_unmapped_range(struct vm_area_struct *vma, |
25ef0e50 | 90 | unsigned long addr, unsigned long end, |
f4884010 JW |
91 | unsigned char *vec) |
92 | { | |
25ef0e50 | 93 | unsigned long nr = (end - addr) >> PAGE_SHIFT; |
f4884010 JW |
94 | int i; |
95 | ||
96 | if (vma->vm_file) { | |
97 | pgoff_t pgoff; | |
98 | ||
99 | pgoff = linear_page_index(vma, addr); | |
100 | for (i = 0; i < nr; i++, pgoff++) | |
101 | vec[i] = mincore_page(vma->vm_file->f_mapping, pgoff); | |
102 | } else { | |
103 | for (i = 0; i < nr; i++) | |
104 | vec[i] = 0; | |
105 | } | |
106 | } | |
107 | ||
108 | static void mincore_pte_range(struct vm_area_struct *vma, pmd_t *pmd, | |
25ef0e50 | 109 | unsigned long addr, unsigned long end, |
f4884010 JW |
110 | unsigned char *vec) |
111 | { | |
25ef0e50 | 112 | unsigned long next; |
f4884010 JW |
113 | spinlock_t *ptl; |
114 | pte_t *ptep; | |
f4884010 JW |
115 | |
116 | ptep = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); | |
25ef0e50 | 117 | do { |
f4884010 JW |
118 | pte_t pte = *ptep; |
119 | pgoff_t pgoff; | |
120 | ||
25ef0e50 | 121 | next = addr + PAGE_SIZE; |
f4884010 | 122 | if (pte_none(pte)) |
25ef0e50 | 123 | mincore_unmapped_range(vma, addr, next, vec); |
f4884010 | 124 | else if (pte_present(pte)) |
25ef0e50 | 125 | *vec = 1; |
f4884010 JW |
126 | else if (pte_file(pte)) { |
127 | pgoff = pte_to_pgoff(pte); | |
25ef0e50 | 128 | *vec = mincore_page(vma->vm_file->f_mapping, pgoff); |
f4884010 JW |
129 | } else { /* pte is a swap entry */ |
130 | swp_entry_t entry = pte_to_swp_entry(pte); | |
131 | ||
132 | if (is_migration_entry(entry)) { | |
133 | /* migration entries are always uptodate */ | |
25ef0e50 | 134 | *vec = 1; |
f4884010 JW |
135 | } else { |
136 | #ifdef CONFIG_SWAP | |
137 | pgoff = entry.val; | |
33806f06 SL |
138 | *vec = mincore_page(swap_address_space(entry), |
139 | pgoff); | |
f4884010 JW |
140 | #else |
141 | WARN_ON(1); | |
25ef0e50 | 142 | *vec = 1; |
f4884010 JW |
143 | #endif |
144 | } | |
145 | } | |
25ef0e50 JW |
146 | vec++; |
147 | } while (ptep++, addr = next, addr != end); | |
f4884010 JW |
148 | pte_unmap_unlock(ptep - 1, ptl); |
149 | } | |
150 | ||
e48293fd JW |
151 | static void mincore_pmd_range(struct vm_area_struct *vma, pud_t *pud, |
152 | unsigned long addr, unsigned long end, | |
153 | unsigned char *vec) | |
154 | { | |
155 | unsigned long next; | |
156 | pmd_t *pmd; | |
157 | ||
158 | pmd = pmd_offset(pud, addr); | |
159 | do { | |
160 | next = pmd_addr_end(addr, end); | |
0ca1634d JW |
161 | if (pmd_trans_huge(*pmd)) { |
162 | if (mincore_huge_pmd(vma, pmd, addr, next, vec)) { | |
163 | vec += (next - addr) >> PAGE_SHIFT; | |
164 | continue; | |
165 | } | |
166 | /* fall through */ | |
167 | } | |
1a5a9906 | 168 | if (pmd_none_or_trans_huge_or_clear_bad(pmd)) |
e48293fd JW |
169 | mincore_unmapped_range(vma, addr, next, vec); |
170 | else | |
171 | mincore_pte_range(vma, pmd, addr, next, vec); | |
172 | vec += (next - addr) >> PAGE_SHIFT; | |
173 | } while (pmd++, addr = next, addr != end); | |
174 | } | |
175 | ||
176 | static void mincore_pud_range(struct vm_area_struct *vma, pgd_t *pgd, | |
177 | unsigned long addr, unsigned long end, | |
178 | unsigned char *vec) | |
179 | { | |
180 | unsigned long next; | |
181 | pud_t *pud; | |
182 | ||
183 | pud = pud_offset(pgd, addr); | |
184 | do { | |
185 | next = pud_addr_end(addr, end); | |
186 | if (pud_none_or_clear_bad(pud)) | |
187 | mincore_unmapped_range(vma, addr, next, vec); | |
188 | else | |
189 | mincore_pmd_range(vma, pud, addr, next, vec); | |
190 | vec += (next - addr) >> PAGE_SHIFT; | |
191 | } while (pud++, addr = next, addr != end); | |
192 | } | |
193 | ||
194 | static void mincore_page_range(struct vm_area_struct *vma, | |
195 | unsigned long addr, unsigned long end, | |
196 | unsigned char *vec) | |
197 | { | |
198 | unsigned long next; | |
199 | pgd_t *pgd; | |
200 | ||
201 | pgd = pgd_offset(vma->vm_mm, addr); | |
202 | do { | |
203 | next = pgd_addr_end(addr, end); | |
204 | if (pgd_none_or_clear_bad(pgd)) | |
205 | mincore_unmapped_range(vma, addr, next, vec); | |
206 | else | |
207 | mincore_pud_range(vma, pgd, addr, next, vec); | |
208 | vec += (next - addr) >> PAGE_SHIFT; | |
209 | } while (pgd++, addr = next, addr != end); | |
210 | } | |
211 | ||
2f77d107 LT |
212 | /* |
213 | * Do a chunk of "sys_mincore()". We've already checked | |
214 | * all the arguments, we hold the mmap semaphore: we should | |
215 | * just return the amount of info we're asked for. | |
216 | */ | |
6a60f1b3 | 217 | static long do_mincore(unsigned long addr, unsigned long pages, unsigned char *vec) |
1da177e4 | 218 | { |
6a60f1b3 | 219 | struct vm_area_struct *vma; |
25ef0e50 | 220 | unsigned long end; |
1da177e4 | 221 | |
6a60f1b3 | 222 | vma = find_vma(current->mm, addr); |
4fb23e43 LT |
223 | if (!vma || addr < vma->vm_start) |
224 | return -ENOMEM; | |
1da177e4 | 225 | |
25ef0e50 | 226 | end = min(vma->vm_end, addr + (pages << PAGE_SHIFT)); |
6a60f1b3 | 227 | |
4f16fc10 | 228 | if (is_vm_hugetlb_page(vma)) { |
25ef0e50 JW |
229 | mincore_hugetlb_page_range(vma, addr, end, vec); |
230 | return (end - addr) >> PAGE_SHIFT; | |
4f16fc10 | 231 | } |
4f16fc10 | 232 | |
25ef0e50 | 233 | end = pmd_addr_end(addr, end); |
1da177e4 | 234 | |
e48293fd JW |
235 | if (is_vm_hugetlb_page(vma)) |
236 | mincore_hugetlb_page_range(vma, addr, end, vec); | |
237 | else | |
238 | mincore_page_range(vma, addr, end, vec); | |
42da9cbd | 239 | |
25ef0e50 | 240 | return (end - addr) >> PAGE_SHIFT; |
1da177e4 LT |
241 | } |
242 | ||
243 | /* | |
244 | * The mincore(2) system call. | |
245 | * | |
246 | * mincore() returns the memory residency status of the pages in the | |
247 | * current process's address space specified by [addr, addr + len). | |
248 | * The status is returned in a vector of bytes. The least significant | |
249 | * bit of each byte is 1 if the referenced page is in memory, otherwise | |
250 | * it is zero. | |
251 | * | |
252 | * Because the status of a page can change after mincore() checks it | |
253 | * but before it returns to the application, the returned vector may | |
254 | * contain stale information. Only locked pages are guaranteed to | |
255 | * remain in memory. | |
256 | * | |
257 | * return values: | |
258 | * zero - success | |
259 | * -EFAULT - vec points to an illegal address | |
260 | * -EINVAL - addr is not a multiple of PAGE_CACHE_SIZE | |
261 | * -ENOMEM - Addresses in the range [addr, addr + len] are | |
262 | * invalid for the address space of this process, or | |
263 | * specify one or more pages which are not currently | |
264 | * mapped | |
265 | * -EAGAIN - A kernel resource was temporarily unavailable. | |
266 | */ | |
3480b257 HC |
267 | SYSCALL_DEFINE3(mincore, unsigned long, start, size_t, len, |
268 | unsigned char __user *, vec) | |
1da177e4 | 269 | { |
2f77d107 LT |
270 | long retval; |
271 | unsigned long pages; | |
272 | unsigned char *tmp; | |
1da177e4 | 273 | |
2f77d107 LT |
274 | /* Check the start address: needs to be page-aligned.. */ |
275 | if (start & ~PAGE_CACHE_MASK) | |
276 | return -EINVAL; | |
1da177e4 | 277 | |
2f77d107 LT |
278 | /* ..and we need to be passed a valid user-space range */ |
279 | if (!access_ok(VERIFY_READ, (void __user *) start, len)) | |
280 | return -ENOMEM; | |
1da177e4 | 281 | |
2f77d107 LT |
282 | /* This also avoids any overflows on PAGE_CACHE_ALIGN */ |
283 | pages = len >> PAGE_SHIFT; | |
284 | pages += (len & ~PAGE_MASK) != 0; | |
1da177e4 | 285 | |
2f77d107 LT |
286 | if (!access_ok(VERIFY_WRITE, vec, pages)) |
287 | return -EFAULT; | |
1da177e4 | 288 | |
2f77d107 LT |
289 | tmp = (void *) __get_free_page(GFP_USER); |
290 | if (!tmp) | |
4fb23e43 | 291 | return -EAGAIN; |
2f77d107 LT |
292 | |
293 | retval = 0; | |
294 | while (pages) { | |
295 | /* | |
296 | * Do at most PAGE_SIZE entries per iteration, due to | |
297 | * the temporary buffer size. | |
298 | */ | |
299 | down_read(¤t->mm->mmap_sem); | |
6a60f1b3 | 300 | retval = do_mincore(start, min(pages, PAGE_SIZE), tmp); |
2f77d107 LT |
301 | up_read(¤t->mm->mmap_sem); |
302 | ||
303 | if (retval <= 0) | |
304 | break; | |
305 | if (copy_to_user(vec, tmp, retval)) { | |
306 | retval = -EFAULT; | |
307 | break; | |
1da177e4 | 308 | } |
2f77d107 LT |
309 | pages -= retval; |
310 | vec += retval; | |
311 | start += retval << PAGE_SHIFT; | |
312 | retval = 0; | |
1da177e4 | 313 | } |
2f77d107 LT |
314 | free_page((unsigned long) tmp); |
315 | return retval; | |
1da177e4 | 316 | } |