]>
Commit | Line | Data |
---|---|---|
b2441318 | 1 | // SPDX-License-Identifier: GPL-2.0 |
a520110e | 2 | #include <linux/pagewalk.h> |
e6473092 MM |
3 | #include <linux/highmem.h> |
4 | #include <linux/sched.h> | |
d33b9f45 | 5 | #include <linux/hugetlb.h> |
e6473092 | 6 | |
b7a16c7a SP |
7 | /* |
8 | * We want to know the real level where a entry is located ignoring any | |
9 | * folding of levels which may be happening. For example if p4d is folded then | |
10 | * a missing entry found at level 1 (p4d) is actually at level 0 (pgd). | |
11 | */ | |
12 | static int real_depth(int depth) | |
13 | { | |
14 | if (depth == 3 && PTRS_PER_PMD == 1) | |
15 | depth = 2; | |
16 | if (depth == 2 && PTRS_PER_PUD == 1) | |
17 | depth = 1; | |
18 | if (depth == 1 && PTRS_PER_P4D == 1) | |
19 | depth = 0; | |
20 | return depth; | |
21 | } | |
22 | ||
fbf56346 SP |
23 | static int walk_pte_range_inner(pte_t *pte, unsigned long addr, |
24 | unsigned long end, struct mm_walk *walk) | |
e6473092 | 25 | { |
7b86ac33 | 26 | const struct mm_walk_ops *ops = walk->ops; |
fbf56346 | 27 | int err = 0; |
e6473092 | 28 | |
556637cd | 29 | for (;;) { |
7b86ac33 | 30 | err = ops->pte_entry(pte, addr, addr + PAGE_SIZE, walk); |
e6473092 MM |
31 | if (err) |
32 | break; | |
c02a9875 | 33 | if (addr >= end - PAGE_SIZE) |
556637cd | 34 | break; |
c02a9875 | 35 | addr += PAGE_SIZE; |
556637cd JW |
36 | pte++; |
37 | } | |
fbf56346 SP |
38 | return err; |
39 | } | |
40 | ||
41 | static int walk_pte_range(pmd_t *pmd, unsigned long addr, unsigned long end, | |
42 | struct mm_walk *walk) | |
43 | { | |
44 | pte_t *pte; | |
45 | int err = 0; | |
46 | spinlock_t *ptl; | |
47 | ||
48 | if (walk->no_vma) { | |
49 | pte = pte_offset_map(pmd, addr); | |
50 | err = walk_pte_range_inner(pte, addr, end, walk); | |
51 | pte_unmap(pte); | |
52 | } else { | |
53 | pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl); | |
54 | err = walk_pte_range_inner(pte, addr, end, walk); | |
55 | pte_unmap_unlock(pte, ptl); | |
56 | } | |
e6473092 | 57 | |
e6473092 MM |
58 | return err; |
59 | } | |
60 | ||
61 | static int walk_pmd_range(pud_t *pud, unsigned long addr, unsigned long end, | |
2165009b | 62 | struct mm_walk *walk) |
e6473092 MM |
63 | { |
64 | pmd_t *pmd; | |
65 | unsigned long next; | |
7b86ac33 | 66 | const struct mm_walk_ops *ops = walk->ops; |
e6473092 | 67 | int err = 0; |
b7a16c7a | 68 | int depth = real_depth(3); |
e6473092 MM |
69 | |
70 | pmd = pmd_offset(pud, addr); | |
71 | do { | |
03319327 | 72 | again: |
e6473092 | 73 | next = pmd_addr_end(addr, end); |
488ae6a2 | 74 | if (pmd_none(*pmd) || (!walk->vma && !walk->no_vma)) { |
7b86ac33 | 75 | if (ops->pte_hole) |
b7a16c7a | 76 | err = ops->pte_hole(addr, next, depth, walk); |
e6473092 MM |
77 | if (err) |
78 | break; | |
79 | continue; | |
80 | } | |
3afc4236 SP |
81 | |
82 | walk->action = ACTION_SUBTREE; | |
83 | ||
03319327 DH |
84 | /* |
85 | * This implies that each ->pmd_entry() handler | |
86 | * needs to know about pmd_trans_huge() pmds | |
87 | */ | |
7b86ac33 CH |
88 | if (ops->pmd_entry) |
89 | err = ops->pmd_entry(pmd, addr, next, walk); | |
03319327 DH |
90 | if (err) |
91 | break; | |
92 | ||
3afc4236 SP |
93 | if (walk->action == ACTION_AGAIN) |
94 | goto again; | |
95 | ||
03319327 DH |
96 | /* |
97 | * Check this here so we only break down trans_huge | |
98 | * pages when we _need_ to | |
99 | */ | |
488ae6a2 SP |
100 | if ((!walk->vma && (pmd_leaf(*pmd) || !pmd_present(*pmd))) || |
101 | walk->action == ACTION_CONTINUE || | |
3afc4236 | 102 | !(ops->pte_entry)) |
03319327 DH |
103 | continue; |
104 | ||
488ae6a2 SP |
105 | if (walk->vma) { |
106 | split_huge_pmd(walk->vma, pmd, addr); | |
107 | if (pmd_trans_unstable(pmd)) | |
108 | goto again; | |
109 | } | |
3afc4236 | 110 | |
03319327 | 111 | err = walk_pte_range(pmd, addr, next, walk); |
e6473092 MM |
112 | if (err) |
113 | break; | |
114 | } while (pmd++, addr = next, addr != end); | |
115 | ||
116 | return err; | |
117 | } | |
118 | ||
c2febafc | 119 | static int walk_pud_range(p4d_t *p4d, unsigned long addr, unsigned long end, |
2165009b | 120 | struct mm_walk *walk) |
e6473092 MM |
121 | { |
122 | pud_t *pud; | |
123 | unsigned long next; | |
7b86ac33 | 124 | const struct mm_walk_ops *ops = walk->ops; |
e6473092 | 125 | int err = 0; |
b7a16c7a | 126 | int depth = real_depth(2); |
e6473092 | 127 | |
c2febafc | 128 | pud = pud_offset(p4d, addr); |
e6473092 | 129 | do { |
a00cc7d9 | 130 | again: |
e6473092 | 131 | next = pud_addr_end(addr, end); |
488ae6a2 | 132 | if (pud_none(*pud) || (!walk->vma && !walk->no_vma)) { |
7b86ac33 | 133 | if (ops->pte_hole) |
b7a16c7a | 134 | err = ops->pte_hole(addr, next, depth, walk); |
e6473092 MM |
135 | if (err) |
136 | break; | |
137 | continue; | |
138 | } | |
a00cc7d9 | 139 | |
3afc4236 | 140 | walk->action = ACTION_SUBTREE; |
a00cc7d9 | 141 | |
3afc4236 SP |
142 | if (ops->pud_entry) |
143 | err = ops->pud_entry(pud, addr, next, walk); | |
144 | if (err) | |
145 | break; | |
146 | ||
147 | if (walk->action == ACTION_AGAIN) | |
148 | goto again; | |
149 | ||
488ae6a2 SP |
150 | if ((!walk->vma && (pud_leaf(*pud) || !pud_present(*pud))) || |
151 | walk->action == ACTION_CONTINUE || | |
3afc4236 SP |
152 | !(ops->pmd_entry || ops->pte_entry)) |
153 | continue; | |
a00cc7d9 | 154 | |
488ae6a2 SP |
155 | if (walk->vma) |
156 | split_huge_pud(walk->vma, pud, addr); | |
a00cc7d9 MW |
157 | if (pud_none(*pud)) |
158 | goto again; | |
159 | ||
3afc4236 | 160 | err = walk_pmd_range(pud, addr, next, walk); |
e6473092 MM |
161 | if (err) |
162 | break; | |
163 | } while (pud++, addr = next, addr != end); | |
164 | ||
165 | return err; | |
166 | } | |
167 | ||
c2febafc KS |
168 | static int walk_p4d_range(pgd_t *pgd, unsigned long addr, unsigned long end, |
169 | struct mm_walk *walk) | |
170 | { | |
171 | p4d_t *p4d; | |
172 | unsigned long next; | |
7b86ac33 | 173 | const struct mm_walk_ops *ops = walk->ops; |
c2febafc | 174 | int err = 0; |
b7a16c7a | 175 | int depth = real_depth(1); |
c2febafc KS |
176 | |
177 | p4d = p4d_offset(pgd, addr); | |
178 | do { | |
179 | next = p4d_addr_end(addr, end); | |
180 | if (p4d_none_or_clear_bad(p4d)) { | |
7b86ac33 | 181 | if (ops->pte_hole) |
b7a16c7a | 182 | err = ops->pte_hole(addr, next, depth, walk); |
c2febafc KS |
183 | if (err) |
184 | break; | |
185 | continue; | |
186 | } | |
3afc4236 SP |
187 | if (ops->p4d_entry) { |
188 | err = ops->p4d_entry(p4d, addr, next, walk); | |
189 | if (err) | |
190 | break; | |
191 | } | |
192 | if (ops->pud_entry || ops->pmd_entry || ops->pte_entry) | |
c2febafc KS |
193 | err = walk_pud_range(p4d, addr, next, walk); |
194 | if (err) | |
195 | break; | |
196 | } while (p4d++, addr = next, addr != end); | |
197 | ||
198 | return err; | |
199 | } | |
200 | ||
fafaa426 NH |
201 | static int walk_pgd_range(unsigned long addr, unsigned long end, |
202 | struct mm_walk *walk) | |
203 | { | |
204 | pgd_t *pgd; | |
205 | unsigned long next; | |
7b86ac33 | 206 | const struct mm_walk_ops *ops = walk->ops; |
fafaa426 NH |
207 | int err = 0; |
208 | ||
e47690d7 SP |
209 | if (walk->pgd) |
210 | pgd = walk->pgd + pgd_index(addr); | |
211 | else | |
212 | pgd = pgd_offset(walk->mm, addr); | |
fafaa426 NH |
213 | do { |
214 | next = pgd_addr_end(addr, end); | |
215 | if (pgd_none_or_clear_bad(pgd)) { | |
7b86ac33 | 216 | if (ops->pte_hole) |
b7a16c7a | 217 | err = ops->pte_hole(addr, next, 0, walk); |
fafaa426 NH |
218 | if (err) |
219 | break; | |
220 | continue; | |
221 | } | |
3afc4236 SP |
222 | if (ops->pgd_entry) { |
223 | err = ops->pgd_entry(pgd, addr, next, walk); | |
224 | if (err) | |
225 | break; | |
226 | } | |
227 | if (ops->p4d_entry || ops->pud_entry || ops->pmd_entry || | |
228 | ops->pte_entry) | |
c2febafc | 229 | err = walk_p4d_range(pgd, addr, next, walk); |
fafaa426 NH |
230 | if (err) |
231 | break; | |
232 | } while (pgd++, addr = next, addr != end); | |
233 | ||
234 | return err; | |
235 | } | |
236 | ||
116354d1 NH |
237 | #ifdef CONFIG_HUGETLB_PAGE |
238 | static unsigned long hugetlb_entry_end(struct hstate *h, unsigned long addr, | |
239 | unsigned long end) | |
240 | { | |
241 | unsigned long boundary = (addr & huge_page_mask(h)) + huge_page_size(h); | |
242 | return boundary < end ? boundary : end; | |
243 | } | |
244 | ||
fafaa426 | 245 | static int walk_hugetlb_range(unsigned long addr, unsigned long end, |
116354d1 NH |
246 | struct mm_walk *walk) |
247 | { | |
fafaa426 | 248 | struct vm_area_struct *vma = walk->vma; |
116354d1 NH |
249 | struct hstate *h = hstate_vma(vma); |
250 | unsigned long next; | |
251 | unsigned long hmask = huge_page_mask(h); | |
7868a208 | 252 | unsigned long sz = huge_page_size(h); |
116354d1 | 253 | pte_t *pte; |
7b86ac33 | 254 | const struct mm_walk_ops *ops = walk->ops; |
116354d1 NH |
255 | int err = 0; |
256 | ||
257 | do { | |
258 | next = hugetlb_entry_end(h, addr, end); | |
7868a208 | 259 | pte = huge_pte_offset(walk->mm, addr & hmask, sz); |
373c4557 JH |
260 | |
261 | if (pte) | |
7b86ac33 CH |
262 | err = ops->hugetlb_entry(pte, hmask, addr, next, walk); |
263 | else if (ops->pte_hole) | |
b7a16c7a | 264 | err = ops->pte_hole(addr, next, -1, walk); |
373c4557 | 265 | |
116354d1 | 266 | if (err) |
fafaa426 | 267 | break; |
116354d1 NH |
268 | } while (addr = next, addr != end); |
269 | ||
fafaa426 | 270 | return err; |
116354d1 | 271 | } |
6c6d5280 | 272 | |
6c6d5280 | 273 | #else /* CONFIG_HUGETLB_PAGE */ |
fafaa426 | 274 | static int walk_hugetlb_range(unsigned long addr, unsigned long end, |
6c6d5280 KM |
275 | struct mm_walk *walk) |
276 | { | |
277 | return 0; | |
278 | } | |
279 | ||
280 | #endif /* CONFIG_HUGETLB_PAGE */ | |
281 | ||
fafaa426 NH |
282 | /* |
283 | * Decide whether we really walk over the current vma on [@start, @end) | |
284 | * or skip it via the returned value. Return 0 if we do walk over the | |
285 | * current vma, and return 1 if we skip the vma. Negative values means | |
286 | * error, where we abort the current walk. | |
fafaa426 NH |
287 | */ |
288 | static int walk_page_test(unsigned long start, unsigned long end, | |
289 | struct mm_walk *walk) | |
290 | { | |
291 | struct vm_area_struct *vma = walk->vma; | |
7b86ac33 | 292 | const struct mm_walk_ops *ops = walk->ops; |
6c6d5280 | 293 | |
7b86ac33 CH |
294 | if (ops->test_walk) |
295 | return ops->test_walk(start, end, walk); | |
fafaa426 NH |
296 | |
297 | /* | |
48684a65 NH |
298 | * vma(VM_PFNMAP) doesn't have any valid struct pages behind VM_PFNMAP |
299 | * range, so we don't walk over it as we do for normal vmas. However, | |
300 | * Some callers are interested in handling hole range and they don't | |
301 | * want to just ignore any single address range. Such users certainly | |
302 | * define their ->pte_hole() callbacks, so let's delegate them to handle | |
303 | * vma(VM_PFNMAP). | |
fafaa426 | 304 | */ |
48684a65 NH |
305 | if (vma->vm_flags & VM_PFNMAP) { |
306 | int err = 1; | |
7b86ac33 | 307 | if (ops->pte_hole) |
b7a16c7a | 308 | err = ops->pte_hole(start, end, -1, walk); |
48684a65 NH |
309 | return err ? err : 1; |
310 | } | |
fafaa426 NH |
311 | return 0; |
312 | } | |
313 | ||
314 | static int __walk_page_range(unsigned long start, unsigned long end, | |
315 | struct mm_walk *walk) | |
316 | { | |
317 | int err = 0; | |
318 | struct vm_area_struct *vma = walk->vma; | |
ecaad8ac TH |
319 | const struct mm_walk_ops *ops = walk->ops; |
320 | ||
321 | if (vma && ops->pre_vma) { | |
322 | err = ops->pre_vma(start, end, walk); | |
323 | if (err) | |
324 | return err; | |
325 | } | |
fafaa426 NH |
326 | |
327 | if (vma && is_vm_hugetlb_page(vma)) { | |
ecaad8ac | 328 | if (ops->hugetlb_entry) |
fafaa426 NH |
329 | err = walk_hugetlb_range(start, end, walk); |
330 | } else | |
331 | err = walk_pgd_range(start, end, walk); | |
332 | ||
ecaad8ac TH |
333 | if (vma && ops->post_vma) |
334 | ops->post_vma(walk); | |
335 | ||
fafaa426 NH |
336 | return err; |
337 | } | |
116354d1 | 338 | |
e6473092 | 339 | /** |
fafaa426 | 340 | * walk_page_range - walk page table with caller specific callbacks |
7b86ac33 CH |
341 | * @mm: mm_struct representing the target process of page table walk |
342 | * @start: start address of the virtual address range | |
343 | * @end: end address of the virtual address range | |
344 | * @ops: operation to call during the walk | |
345 | * @private: private data for callbacks' usage | |
e6473092 | 346 | * |
7b86ac33 | 347 | * Recursively walk the page table tree of the process represented by @mm |
fafaa426 NH |
348 | * within the virtual address range [@start, @end). During walking, we can do |
349 | * some caller-specific works for each entry, by setting up pmd_entry(), | |
350 | * pte_entry(), and/or hugetlb_entry(). If you don't set up for some of these | |
351 | * callbacks, the associated entries/pages are just ignored. | |
352 | * The return values of these callbacks are commonly defined like below: | |
a5d09bed | 353 | * |
fafaa426 NH |
354 | * - 0 : succeeded to handle the current entry, and if you don't reach the |
355 | * end address yet, continue to walk. | |
356 | * - >0 : succeeded to handle the current entry, and return to the caller | |
357 | * with caller specific value. | |
358 | * - <0 : failed to handle the current entry, and return to the caller | |
359 | * with error code. | |
e6473092 | 360 | * |
fafaa426 NH |
361 | * Before starting to walk page table, some callers want to check whether |
362 | * they really want to walk over the current vma, typically by checking | |
7b86ac33 | 363 | * its vm_flags. walk_page_test() and @ops->test_walk() are used for this |
fafaa426 | 364 | * purpose. |
e6473092 | 365 | * |
ecaad8ac TH |
366 | * If operations need to be staged before and committed after a vma is walked, |
367 | * there are two callbacks, pre_vma() and post_vma(). Note that post_vma(), | |
368 | * since it is intended to handle commit-type operations, can't return any | |
369 | * errors. | |
370 | * | |
fafaa426 NH |
371 | * struct mm_walk keeps current values of some common data like vma and pmd, |
372 | * which are useful for the access from callbacks. If you want to pass some | |
7b86ac33 | 373 | * caller-specific data to callbacks, @private should be helpful. |
c27fe4c8 | 374 | * |
fafaa426 | 375 | * Locking: |
7b86ac33 CH |
376 | * Callers of walk_page_range() and walk_page_vma() should hold @mm->mmap_sem, |
377 | * because these function traverse vma list and/or access to vma's data. | |
e6473092 | 378 | */ |
7b86ac33 CH |
379 | int walk_page_range(struct mm_struct *mm, unsigned long start, |
380 | unsigned long end, const struct mm_walk_ops *ops, | |
381 | void *private) | |
e6473092 | 382 | { |
e6473092 | 383 | int err = 0; |
fafaa426 NH |
384 | unsigned long next; |
385 | struct vm_area_struct *vma; | |
7b86ac33 CH |
386 | struct mm_walk walk = { |
387 | .ops = ops, | |
388 | .mm = mm, | |
389 | .private = private, | |
390 | }; | |
e6473092 | 391 | |
fafaa426 NH |
392 | if (start >= end) |
393 | return -EINVAL; | |
e6473092 | 394 | |
7b86ac33 | 395 | if (!walk.mm) |
2165009b DH |
396 | return -EINVAL; |
397 | ||
b4bc7817 | 398 | lockdep_assert_held(&walk.mm->mmap_sem); |
a9ff785e | 399 | |
7b86ac33 | 400 | vma = find_vma(walk.mm, start); |
e6473092 | 401 | do { |
fafaa426 | 402 | if (!vma) { /* after the last vma */ |
7b86ac33 | 403 | walk.vma = NULL; |
fafaa426 NH |
404 | next = end; |
405 | } else if (start < vma->vm_start) { /* outside vma */ | |
7b86ac33 | 406 | walk.vma = NULL; |
fafaa426 NH |
407 | next = min(end, vma->vm_start); |
408 | } else { /* inside vma */ | |
7b86ac33 | 409 | walk.vma = vma; |
fafaa426 NH |
410 | next = min(end, vma->vm_end); |
411 | vma = vma->vm_next; | |
5f0af70a | 412 | |
7b86ac33 | 413 | err = walk_page_test(start, next, &walk); |
f6837395 NH |
414 | if (err > 0) { |
415 | /* | |
416 | * positive return values are purely for | |
417 | * controlling the pagewalk, so should never | |
418 | * be passed to the callers. | |
419 | */ | |
420 | err = 0; | |
a9ff785e | 421 | continue; |
f6837395 | 422 | } |
fafaa426 | 423 | if (err < 0) |
e6473092 | 424 | break; |
e6473092 | 425 | } |
7b86ac33 CH |
426 | if (walk.vma || walk.ops->pte_hole) |
427 | err = __walk_page_range(start, next, &walk); | |
e6473092 MM |
428 | if (err) |
429 | break; | |
fafaa426 | 430 | } while (start = next, start < end); |
e6473092 MM |
431 | return err; |
432 | } | |
900fc5f1 | 433 | |
fbf56346 SP |
434 | /* |
435 | * Similar to walk_page_range() but can walk any page tables even if they are | |
436 | * not backed by VMAs. Because 'unusual' entries may be walked this function | |
437 | * will also not lock the PTEs for the pte_entry() callback. This is useful for | |
438 | * walking the kernel pages tables or page tables for firmware. | |
439 | */ | |
488ae6a2 SP |
440 | int walk_page_range_novma(struct mm_struct *mm, unsigned long start, |
441 | unsigned long end, const struct mm_walk_ops *ops, | |
e47690d7 | 442 | pgd_t *pgd, |
488ae6a2 SP |
443 | void *private) |
444 | { | |
445 | struct mm_walk walk = { | |
446 | .ops = ops, | |
447 | .mm = mm, | |
e47690d7 | 448 | .pgd = pgd, |
488ae6a2 SP |
449 | .private = private, |
450 | .no_vma = true | |
451 | }; | |
452 | ||
453 | if (start >= end || !walk.mm) | |
454 | return -EINVAL; | |
455 | ||
456 | lockdep_assert_held(&walk.mm->mmap_sem); | |
457 | ||
458 | return __walk_page_range(start, end, &walk); | |
459 | } | |
460 | ||
7b86ac33 CH |
461 | int walk_page_vma(struct vm_area_struct *vma, const struct mm_walk_ops *ops, |
462 | void *private) | |
900fc5f1 | 463 | { |
7b86ac33 CH |
464 | struct mm_walk walk = { |
465 | .ops = ops, | |
466 | .mm = vma->vm_mm, | |
467 | .vma = vma, | |
468 | .private = private, | |
469 | }; | |
900fc5f1 NH |
470 | int err; |
471 | ||
7b86ac33 | 472 | if (!walk.mm) |
900fc5f1 NH |
473 | return -EINVAL; |
474 | ||
b4bc7817 | 475 | lockdep_assert_held(&walk.mm->mmap_sem); |
7b86ac33 CH |
476 | |
477 | err = walk_page_test(vma->vm_start, vma->vm_end, &walk); | |
900fc5f1 NH |
478 | if (err > 0) |
479 | return 0; | |
480 | if (err < 0) | |
481 | return err; | |
7b86ac33 | 482 | return __walk_page_range(vma->vm_start, vma->vm_end, &walk); |
900fc5f1 | 483 | } |
ecaad8ac TH |
484 | |
485 | /** | |
486 | * walk_page_mapping - walk all memory areas mapped into a struct address_space. | |
487 | * @mapping: Pointer to the struct address_space | |
488 | * @first_index: First page offset in the address_space | |
489 | * @nr: Number of incremental page offsets to cover | |
490 | * @ops: operation to call during the walk | |
491 | * @private: private data for callbacks' usage | |
492 | * | |
493 | * This function walks all memory areas mapped into a struct address_space. | |
494 | * The walk is limited to only the given page-size index range, but if | |
495 | * the index boundaries cross a huge page-table entry, that entry will be | |
496 | * included. | |
497 | * | |
498 | * Also see walk_page_range() for additional information. | |
499 | * | |
500 | * Locking: | |
501 | * This function can't require that the struct mm_struct::mmap_sem is held, | |
502 | * since @mapping may be mapped by multiple processes. Instead | |
503 | * @mapping->i_mmap_rwsem must be held. This might have implications in the | |
504 | * callbacks, and it's up tho the caller to ensure that the | |
505 | * struct mm_struct::mmap_sem is not needed. | |
506 | * | |
507 | * Also this means that a caller can't rely on the struct | |
508 | * vm_area_struct::vm_flags to be constant across a call, | |
509 | * except for immutable flags. Callers requiring this shouldn't use | |
510 | * this function. | |
511 | * | |
512 | * Return: 0 on success, negative error code on failure, positive number on | |
513 | * caller defined premature termination. | |
514 | */ | |
515 | int walk_page_mapping(struct address_space *mapping, pgoff_t first_index, | |
516 | pgoff_t nr, const struct mm_walk_ops *ops, | |
517 | void *private) | |
518 | { | |
519 | struct mm_walk walk = { | |
520 | .ops = ops, | |
521 | .private = private, | |
522 | }; | |
523 | struct vm_area_struct *vma; | |
524 | pgoff_t vba, vea, cba, cea; | |
525 | unsigned long start_addr, end_addr; | |
526 | int err = 0; | |
527 | ||
528 | lockdep_assert_held(&mapping->i_mmap_rwsem); | |
529 | vma_interval_tree_foreach(vma, &mapping->i_mmap, first_index, | |
530 | first_index + nr - 1) { | |
531 | /* Clip to the vma */ | |
532 | vba = vma->vm_pgoff; | |
533 | vea = vba + vma_pages(vma); | |
534 | cba = first_index; | |
535 | cba = max(cba, vba); | |
536 | cea = first_index + nr; | |
537 | cea = min(cea, vea); | |
538 | ||
539 | start_addr = ((cba - vba) << PAGE_SHIFT) + vma->vm_start; | |
540 | end_addr = ((cea - vba) << PAGE_SHIFT) + vma->vm_start; | |
541 | if (start_addr >= end_addr) | |
542 | continue; | |
543 | ||
544 | walk.vma = vma; | |
545 | walk.mm = vma->vm_mm; | |
546 | ||
547 | err = walk_page_test(vma->vm_start, vma->vm_end, &walk); | |
548 | if (err > 0) { | |
549 | err = 0; | |
550 | break; | |
551 | } else if (err < 0) | |
552 | break; | |
553 | ||
554 | err = __walk_page_range(start_addr, end_addr, &walk); | |
555 | if (err) | |
556 | break; | |
557 | } | |
558 | ||
559 | return err; | |
560 | } |