mm: rework mapcount accounting to enable 4k mapping of THPs
[deliverable/linux.git] / mm / rmap.c
1 /*
2 * mm/rmap.c - physical to virtual reverse mappings
3 *
4 * Copyright 2001, Rik van Riel <riel@conectiva.com.br>
5 * Released under the General Public License (GPL).
6 *
7 * Simple, low overhead reverse mapping scheme.
8 * Please try to keep this thing as modular as possible.
9 *
10 * Provides methods for unmapping each kind of mapped page:
11 * the anon methods track anonymous pages, and
12 * the file methods track pages belonging to an inode.
13 *
14 * Original design by Rik van Riel <riel@conectiva.com.br> 2001
15 * File methods by Dave McCracken <dmccr@us.ibm.com> 2003, 2004
16 * Anonymous methods by Andrea Arcangeli <andrea@suse.de> 2004
17 * Contributions by Hugh Dickins 2003, 2004
18 */
19
20 /*
21 * Lock ordering in mm:
22 *
23 * inode->i_mutex (while writing or truncating, not reading or faulting)
24 * mm->mmap_sem
25 * page->flags PG_locked (lock_page)
26 * mapping->i_mmap_rwsem
27 * anon_vma->rwsem
28 * mm->page_table_lock or pte_lock
29 * zone->lru_lock (in mark_page_accessed, isolate_lru_page)
30 * swap_lock (in swap_duplicate, swap_info_get)
31 * mmlist_lock (in mmput, drain_mmlist and others)
32 * mapping->private_lock (in __set_page_dirty_buffers)
33 * mem_cgroup_{begin,end}_page_stat (memcg->move_lock)
34 * mapping->tree_lock (widely used)
35 * inode->i_lock (in set_page_dirty's __mark_inode_dirty)
36 * bdi.wb->list_lock (in set_page_dirty's __mark_inode_dirty)
37 * sb_lock (within inode_lock in fs/fs-writeback.c)
38 * mapping->tree_lock (widely used, in set_page_dirty,
39 * in arch-dependent flush_dcache_mmap_lock,
40 * within bdi.wb->list_lock in __sync_single_inode)
41 *
42 * anon_vma->rwsem,mapping->i_mutex (memory_failure, collect_procs_anon)
43 * ->tasklist_lock
44 * pte map lock
45 */
46
47 #include <linux/mm.h>
48 #include <linux/pagemap.h>
49 #include <linux/swap.h>
50 #include <linux/swapops.h>
51 #include <linux/slab.h>
52 #include <linux/init.h>
53 #include <linux/ksm.h>
54 #include <linux/rmap.h>
55 #include <linux/rcupdate.h>
56 #include <linux/export.h>
57 #include <linux/memcontrol.h>
58 #include <linux/mmu_notifier.h>
59 #include <linux/migrate.h>
60 #include <linux/hugetlb.h>
61 #include <linux/backing-dev.h>
62 #include <linux/page_idle.h>
63
64 #include <asm/tlbflush.h>
65
66 #include <trace/events/tlb.h>
67
68 #include "internal.h"
69
70 static struct kmem_cache *anon_vma_cachep;
71 static struct kmem_cache *anon_vma_chain_cachep;
72
73 static inline struct anon_vma *anon_vma_alloc(void)
74 {
75 struct anon_vma *anon_vma;
76
77 anon_vma = kmem_cache_alloc(anon_vma_cachep, GFP_KERNEL);
78 if (anon_vma) {
79 atomic_set(&anon_vma->refcount, 1);
80 anon_vma->degree = 1; /* Reference for first vma */
81 anon_vma->parent = anon_vma;
82 /*
83 * Initialise the anon_vma root to point to itself. If called
84 * from fork, the root will be reset to the parents anon_vma.
85 */
86 anon_vma->root = anon_vma;
87 }
88
89 return anon_vma;
90 }
91
92 static inline void anon_vma_free(struct anon_vma *anon_vma)
93 {
94 VM_BUG_ON(atomic_read(&anon_vma->refcount));
95
96 /*
97 * Synchronize against page_lock_anon_vma_read() such that
98 * we can safely hold the lock without the anon_vma getting
99 * freed.
100 *
101 * Relies on the full mb implied by the atomic_dec_and_test() from
102 * put_anon_vma() against the acquire barrier implied by
103 * down_read_trylock() from page_lock_anon_vma_read(). This orders:
104 *
105 * page_lock_anon_vma_read() VS put_anon_vma()
106 * down_read_trylock() atomic_dec_and_test()
107 * LOCK MB
108 * atomic_read() rwsem_is_locked()
109 *
110 * LOCK should suffice since the actual taking of the lock must
111 * happen _before_ what follows.
112 */
113 might_sleep();
114 if (rwsem_is_locked(&anon_vma->root->rwsem)) {
115 anon_vma_lock_write(anon_vma);
116 anon_vma_unlock_write(anon_vma);
117 }
118
119 kmem_cache_free(anon_vma_cachep, anon_vma);
120 }
121
122 static inline struct anon_vma_chain *anon_vma_chain_alloc(gfp_t gfp)
123 {
124 return kmem_cache_alloc(anon_vma_chain_cachep, gfp);
125 }
126
127 static void anon_vma_chain_free(struct anon_vma_chain *anon_vma_chain)
128 {
129 kmem_cache_free(anon_vma_chain_cachep, anon_vma_chain);
130 }
131
132 static void anon_vma_chain_link(struct vm_area_struct *vma,
133 struct anon_vma_chain *avc,
134 struct anon_vma *anon_vma)
135 {
136 avc->vma = vma;
137 avc->anon_vma = anon_vma;
138 list_add(&avc->same_vma, &vma->anon_vma_chain);
139 anon_vma_interval_tree_insert(avc, &anon_vma->rb_root);
140 }
141
142 /**
143 * anon_vma_prepare - attach an anon_vma to a memory region
144 * @vma: the memory region in question
145 *
146 * This makes sure the memory mapping described by 'vma' has
147 * an 'anon_vma' attached to it, so that we can associate the
148 * anonymous pages mapped into it with that anon_vma.
149 *
150 * The common case will be that we already have one, but if
151 * not we either need to find an adjacent mapping that we
152 * can re-use the anon_vma from (very common when the only
153 * reason for splitting a vma has been mprotect()), or we
154 * allocate a new one.
155 *
156 * Anon-vma allocations are very subtle, because we may have
157 * optimistically looked up an anon_vma in page_lock_anon_vma_read()
158 * and that may actually touch the spinlock even in the newly
159 * allocated vma (it depends on RCU to make sure that the
160 * anon_vma isn't actually destroyed).
161 *
162 * As a result, we need to do proper anon_vma locking even
163 * for the new allocation. At the same time, we do not want
164 * to do any locking for the common case of already having
165 * an anon_vma.
166 *
167 * This must be called with the mmap_sem held for reading.
168 */
169 int anon_vma_prepare(struct vm_area_struct *vma)
170 {
171 struct anon_vma *anon_vma = vma->anon_vma;
172 struct anon_vma_chain *avc;
173
174 might_sleep();
175 if (unlikely(!anon_vma)) {
176 struct mm_struct *mm = vma->vm_mm;
177 struct anon_vma *allocated;
178
179 avc = anon_vma_chain_alloc(GFP_KERNEL);
180 if (!avc)
181 goto out_enomem;
182
183 anon_vma = find_mergeable_anon_vma(vma);
184 allocated = NULL;
185 if (!anon_vma) {
186 anon_vma = anon_vma_alloc();
187 if (unlikely(!anon_vma))
188 goto out_enomem_free_avc;
189 allocated = anon_vma;
190 }
191
192 anon_vma_lock_write(anon_vma);
193 /* page_table_lock to protect against threads */
194 spin_lock(&mm->page_table_lock);
195 if (likely(!vma->anon_vma)) {
196 vma->anon_vma = anon_vma;
197 anon_vma_chain_link(vma, avc, anon_vma);
198 /* vma reference or self-parent link for new root */
199 anon_vma->degree++;
200 allocated = NULL;
201 avc = NULL;
202 }
203 spin_unlock(&mm->page_table_lock);
204 anon_vma_unlock_write(anon_vma);
205
206 if (unlikely(allocated))
207 put_anon_vma(allocated);
208 if (unlikely(avc))
209 anon_vma_chain_free(avc);
210 }
211 return 0;
212
213 out_enomem_free_avc:
214 anon_vma_chain_free(avc);
215 out_enomem:
216 return -ENOMEM;
217 }
218
219 /*
220 * This is a useful helper function for locking the anon_vma root as
221 * we traverse the vma->anon_vma_chain, looping over anon_vma's that
222 * have the same vma.
223 *
224 * Such anon_vma's should have the same root, so you'd expect to see
225 * just a single mutex_lock for the whole traversal.
226 */
227 static inline struct anon_vma *lock_anon_vma_root(struct anon_vma *root, struct anon_vma *anon_vma)
228 {
229 struct anon_vma *new_root = anon_vma->root;
230 if (new_root != root) {
231 if (WARN_ON_ONCE(root))
232 up_write(&root->rwsem);
233 root = new_root;
234 down_write(&root->rwsem);
235 }
236 return root;
237 }
238
239 static inline void unlock_anon_vma_root(struct anon_vma *root)
240 {
241 if (root)
242 up_write(&root->rwsem);
243 }
244
245 /*
246 * Attach the anon_vmas from src to dst.
247 * Returns 0 on success, -ENOMEM on failure.
248 *
249 * If dst->anon_vma is NULL this function tries to find and reuse existing
250 * anon_vma which has no vmas and only one child anon_vma. This prevents
251 * degradation of anon_vma hierarchy to endless linear chain in case of
252 * constantly forking task. On the other hand, an anon_vma with more than one
253 * child isn't reused even if there was no alive vma, thus rmap walker has a
254 * good chance of avoiding scanning the whole hierarchy when it searches where
255 * page is mapped.
256 */
257 int anon_vma_clone(struct vm_area_struct *dst, struct vm_area_struct *src)
258 {
259 struct anon_vma_chain *avc, *pavc;
260 struct anon_vma *root = NULL;
261
262 list_for_each_entry_reverse(pavc, &src->anon_vma_chain, same_vma) {
263 struct anon_vma *anon_vma;
264
265 avc = anon_vma_chain_alloc(GFP_NOWAIT | __GFP_NOWARN);
266 if (unlikely(!avc)) {
267 unlock_anon_vma_root(root);
268 root = NULL;
269 avc = anon_vma_chain_alloc(GFP_KERNEL);
270 if (!avc)
271 goto enomem_failure;
272 }
273 anon_vma = pavc->anon_vma;
274 root = lock_anon_vma_root(root, anon_vma);
275 anon_vma_chain_link(dst, avc, anon_vma);
276
277 /*
278 * Reuse existing anon_vma if its degree lower than two,
279 * that means it has no vma and only one anon_vma child.
280 *
281 * Do not chose parent anon_vma, otherwise first child
282 * will always reuse it. Root anon_vma is never reused:
283 * it has self-parent reference and at least one child.
284 */
285 if (!dst->anon_vma && anon_vma != src->anon_vma &&
286 anon_vma->degree < 2)
287 dst->anon_vma = anon_vma;
288 }
289 if (dst->anon_vma)
290 dst->anon_vma->degree++;
291 unlock_anon_vma_root(root);
292 return 0;
293
294 enomem_failure:
295 /*
296 * dst->anon_vma is dropped here otherwise its degree can be incorrectly
297 * decremented in unlink_anon_vmas().
298 * We can safely do this because callers of anon_vma_clone() don't care
299 * about dst->anon_vma if anon_vma_clone() failed.
300 */
301 dst->anon_vma = NULL;
302 unlink_anon_vmas(dst);
303 return -ENOMEM;
304 }
305
306 /*
307 * Attach vma to its own anon_vma, as well as to the anon_vmas that
308 * the corresponding VMA in the parent process is attached to.
309 * Returns 0 on success, non-zero on failure.
310 */
311 int anon_vma_fork(struct vm_area_struct *vma, struct vm_area_struct *pvma)
312 {
313 struct anon_vma_chain *avc;
314 struct anon_vma *anon_vma;
315 int error;
316
317 /* Don't bother if the parent process has no anon_vma here. */
318 if (!pvma->anon_vma)
319 return 0;
320
321 /* Drop inherited anon_vma, we'll reuse existing or allocate new. */
322 vma->anon_vma = NULL;
323
324 /*
325 * First, attach the new VMA to the parent VMA's anon_vmas,
326 * so rmap can find non-COWed pages in child processes.
327 */
328 error = anon_vma_clone(vma, pvma);
329 if (error)
330 return error;
331
332 /* An existing anon_vma has been reused, all done then. */
333 if (vma->anon_vma)
334 return 0;
335
336 /* Then add our own anon_vma. */
337 anon_vma = anon_vma_alloc();
338 if (!anon_vma)
339 goto out_error;
340 avc = anon_vma_chain_alloc(GFP_KERNEL);
341 if (!avc)
342 goto out_error_free_anon_vma;
343
344 /*
345 * The root anon_vma's spinlock is the lock actually used when we
346 * lock any of the anon_vmas in this anon_vma tree.
347 */
348 anon_vma->root = pvma->anon_vma->root;
349 anon_vma->parent = pvma->anon_vma;
350 /*
351 * With refcounts, an anon_vma can stay around longer than the
352 * process it belongs to. The root anon_vma needs to be pinned until
353 * this anon_vma is freed, because the lock lives in the root.
354 */
355 get_anon_vma(anon_vma->root);
356 /* Mark this anon_vma as the one where our new (COWed) pages go. */
357 vma->anon_vma = anon_vma;
358 anon_vma_lock_write(anon_vma);
359 anon_vma_chain_link(vma, avc, anon_vma);
360 anon_vma->parent->degree++;
361 anon_vma_unlock_write(anon_vma);
362
363 return 0;
364
365 out_error_free_anon_vma:
366 put_anon_vma(anon_vma);
367 out_error:
368 unlink_anon_vmas(vma);
369 return -ENOMEM;
370 }
371
372 void unlink_anon_vmas(struct vm_area_struct *vma)
373 {
374 struct anon_vma_chain *avc, *next;
375 struct anon_vma *root = NULL;
376
377 /*
378 * Unlink each anon_vma chained to the VMA. This list is ordered
379 * from newest to oldest, ensuring the root anon_vma gets freed last.
380 */
381 list_for_each_entry_safe(avc, next, &vma->anon_vma_chain, same_vma) {
382 struct anon_vma *anon_vma = avc->anon_vma;
383
384 root = lock_anon_vma_root(root, anon_vma);
385 anon_vma_interval_tree_remove(avc, &anon_vma->rb_root);
386
387 /*
388 * Leave empty anon_vmas on the list - we'll need
389 * to free them outside the lock.
390 */
391 if (RB_EMPTY_ROOT(&anon_vma->rb_root)) {
392 anon_vma->parent->degree--;
393 continue;
394 }
395
396 list_del(&avc->same_vma);
397 anon_vma_chain_free(avc);
398 }
399 if (vma->anon_vma)
400 vma->anon_vma->degree--;
401 unlock_anon_vma_root(root);
402
403 /*
404 * Iterate the list once more, it now only contains empty and unlinked
405 * anon_vmas, destroy them. Could not do before due to __put_anon_vma()
406 * needing to write-acquire the anon_vma->root->rwsem.
407 */
408 list_for_each_entry_safe(avc, next, &vma->anon_vma_chain, same_vma) {
409 struct anon_vma *anon_vma = avc->anon_vma;
410
411 BUG_ON(anon_vma->degree);
412 put_anon_vma(anon_vma);
413
414 list_del(&avc->same_vma);
415 anon_vma_chain_free(avc);
416 }
417 }
418
419 static void anon_vma_ctor(void *data)
420 {
421 struct anon_vma *anon_vma = data;
422
423 init_rwsem(&anon_vma->rwsem);
424 atomic_set(&anon_vma->refcount, 0);
425 anon_vma->rb_root = RB_ROOT;
426 }
427
428 void __init anon_vma_init(void)
429 {
430 anon_vma_cachep = kmem_cache_create("anon_vma", sizeof(struct anon_vma),
431 0, SLAB_DESTROY_BY_RCU|SLAB_PANIC|SLAB_ACCOUNT,
432 anon_vma_ctor);
433 anon_vma_chain_cachep = KMEM_CACHE(anon_vma_chain,
434 SLAB_PANIC|SLAB_ACCOUNT);
435 }
436
437 /*
438 * Getting a lock on a stable anon_vma from a page off the LRU is tricky!
439 *
440 * Since there is no serialization what so ever against page_remove_rmap()
441 * the best this function can do is return a locked anon_vma that might
442 * have been relevant to this page.
443 *
444 * The page might have been remapped to a different anon_vma or the anon_vma
445 * returned may already be freed (and even reused).
446 *
447 * In case it was remapped to a different anon_vma, the new anon_vma will be a
448 * child of the old anon_vma, and the anon_vma lifetime rules will therefore
449 * ensure that any anon_vma obtained from the page will still be valid for as
450 * long as we observe page_mapped() [ hence all those page_mapped() tests ].
451 *
452 * All users of this function must be very careful when walking the anon_vma
453 * chain and verify that the page in question is indeed mapped in it
454 * [ something equivalent to page_mapped_in_vma() ].
455 *
456 * Since anon_vma's slab is DESTROY_BY_RCU and we know from page_remove_rmap()
457 * that the anon_vma pointer from page->mapping is valid if there is a
458 * mapcount, we can dereference the anon_vma after observing those.
459 */
460 struct anon_vma *page_get_anon_vma(struct page *page)
461 {
462 struct anon_vma *anon_vma = NULL;
463 unsigned long anon_mapping;
464
465 rcu_read_lock();
466 anon_mapping = (unsigned long)READ_ONCE(page->mapping);
467 if ((anon_mapping & PAGE_MAPPING_FLAGS) != PAGE_MAPPING_ANON)
468 goto out;
469 if (!page_mapped(page))
470 goto out;
471
472 anon_vma = (struct anon_vma *) (anon_mapping - PAGE_MAPPING_ANON);
473 if (!atomic_inc_not_zero(&anon_vma->refcount)) {
474 anon_vma = NULL;
475 goto out;
476 }
477
478 /*
479 * If this page is still mapped, then its anon_vma cannot have been
480 * freed. But if it has been unmapped, we have no security against the
481 * anon_vma structure being freed and reused (for another anon_vma:
482 * SLAB_DESTROY_BY_RCU guarantees that - so the atomic_inc_not_zero()
483 * above cannot corrupt).
484 */
485 if (!page_mapped(page)) {
486 rcu_read_unlock();
487 put_anon_vma(anon_vma);
488 return NULL;
489 }
490 out:
491 rcu_read_unlock();
492
493 return anon_vma;
494 }
495
496 /*
497 * Similar to page_get_anon_vma() except it locks the anon_vma.
498 *
499 * Its a little more complex as it tries to keep the fast path to a single
500 * atomic op -- the trylock. If we fail the trylock, we fall back to getting a
501 * reference like with page_get_anon_vma() and then block on the mutex.
502 */
503 struct anon_vma *page_lock_anon_vma_read(struct page *page)
504 {
505 struct anon_vma *anon_vma = NULL;
506 struct anon_vma *root_anon_vma;
507 unsigned long anon_mapping;
508
509 rcu_read_lock();
510 anon_mapping = (unsigned long)READ_ONCE(page->mapping);
511 if ((anon_mapping & PAGE_MAPPING_FLAGS) != PAGE_MAPPING_ANON)
512 goto out;
513 if (!page_mapped(page))
514 goto out;
515
516 anon_vma = (struct anon_vma *) (anon_mapping - PAGE_MAPPING_ANON);
517 root_anon_vma = READ_ONCE(anon_vma->root);
518 if (down_read_trylock(&root_anon_vma->rwsem)) {
519 /*
520 * If the page is still mapped, then this anon_vma is still
521 * its anon_vma, and holding the mutex ensures that it will
522 * not go away, see anon_vma_free().
523 */
524 if (!page_mapped(page)) {
525 up_read(&root_anon_vma->rwsem);
526 anon_vma = NULL;
527 }
528 goto out;
529 }
530
531 /* trylock failed, we got to sleep */
532 if (!atomic_inc_not_zero(&anon_vma->refcount)) {
533 anon_vma = NULL;
534 goto out;
535 }
536
537 if (!page_mapped(page)) {
538 rcu_read_unlock();
539 put_anon_vma(anon_vma);
540 return NULL;
541 }
542
543 /* we pinned the anon_vma, its safe to sleep */
544 rcu_read_unlock();
545 anon_vma_lock_read(anon_vma);
546
547 if (atomic_dec_and_test(&anon_vma->refcount)) {
548 /*
549 * Oops, we held the last refcount, release the lock
550 * and bail -- can't simply use put_anon_vma() because
551 * we'll deadlock on the anon_vma_lock_write() recursion.
552 */
553 anon_vma_unlock_read(anon_vma);
554 __put_anon_vma(anon_vma);
555 anon_vma = NULL;
556 }
557
558 return anon_vma;
559
560 out:
561 rcu_read_unlock();
562 return anon_vma;
563 }
564
565 void page_unlock_anon_vma_read(struct anon_vma *anon_vma)
566 {
567 anon_vma_unlock_read(anon_vma);
568 }
569
570 /*
571 * At what user virtual address is page expected in @vma?
572 */
573 static inline unsigned long
574 __vma_address(struct page *page, struct vm_area_struct *vma)
575 {
576 pgoff_t pgoff = page_to_pgoff(page);
577 return vma->vm_start + ((pgoff - vma->vm_pgoff) << PAGE_SHIFT);
578 }
579
580 inline unsigned long
581 vma_address(struct page *page, struct vm_area_struct *vma)
582 {
583 unsigned long address = __vma_address(page, vma);
584
585 /* page should be within @vma mapping range */
586 VM_BUG_ON_VMA(address < vma->vm_start || address >= vma->vm_end, vma);
587
588 return address;
589 }
590
591 #ifdef CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH
592 static void percpu_flush_tlb_batch_pages(void *data)
593 {
594 /*
595 * All TLB entries are flushed on the assumption that it is
596 * cheaper to flush all TLBs and let them be refilled than
597 * flushing individual PFNs. Note that we do not track mm's
598 * to flush as that might simply be multiple full TLB flushes
599 * for no gain.
600 */
601 count_vm_tlb_event(NR_TLB_REMOTE_FLUSH_RECEIVED);
602 flush_tlb_local();
603 }
604
605 /*
606 * Flush TLB entries for recently unmapped pages from remote CPUs. It is
607 * important if a PTE was dirty when it was unmapped that it's flushed
608 * before any IO is initiated on the page to prevent lost writes. Similarly,
609 * it must be flushed before freeing to prevent data leakage.
610 */
611 void try_to_unmap_flush(void)
612 {
613 struct tlbflush_unmap_batch *tlb_ubc = &current->tlb_ubc;
614 int cpu;
615
616 if (!tlb_ubc->flush_required)
617 return;
618
619 cpu = get_cpu();
620
621 trace_tlb_flush(TLB_REMOTE_SHOOTDOWN, -1UL);
622
623 if (cpumask_test_cpu(cpu, &tlb_ubc->cpumask))
624 percpu_flush_tlb_batch_pages(&tlb_ubc->cpumask);
625
626 if (cpumask_any_but(&tlb_ubc->cpumask, cpu) < nr_cpu_ids) {
627 smp_call_function_many(&tlb_ubc->cpumask,
628 percpu_flush_tlb_batch_pages, (void *)tlb_ubc, true);
629 }
630 cpumask_clear(&tlb_ubc->cpumask);
631 tlb_ubc->flush_required = false;
632 tlb_ubc->writable = false;
633 put_cpu();
634 }
635
636 /* Flush iff there are potentially writable TLB entries that can race with IO */
637 void try_to_unmap_flush_dirty(void)
638 {
639 struct tlbflush_unmap_batch *tlb_ubc = &current->tlb_ubc;
640
641 if (tlb_ubc->writable)
642 try_to_unmap_flush();
643 }
644
645 static void set_tlb_ubc_flush_pending(struct mm_struct *mm,
646 struct page *page, bool writable)
647 {
648 struct tlbflush_unmap_batch *tlb_ubc = &current->tlb_ubc;
649
650 cpumask_or(&tlb_ubc->cpumask, &tlb_ubc->cpumask, mm_cpumask(mm));
651 tlb_ubc->flush_required = true;
652
653 /*
654 * If the PTE was dirty then it's best to assume it's writable. The
655 * caller must use try_to_unmap_flush_dirty() or try_to_unmap_flush()
656 * before the page is queued for IO.
657 */
658 if (writable)
659 tlb_ubc->writable = true;
660 }
661
662 /*
663 * Returns true if the TLB flush should be deferred to the end of a batch of
664 * unmap operations to reduce IPIs.
665 */
666 static bool should_defer_flush(struct mm_struct *mm, enum ttu_flags flags)
667 {
668 bool should_defer = false;
669
670 if (!(flags & TTU_BATCH_FLUSH))
671 return false;
672
673 /* If remote CPUs need to be flushed then defer batch the flush */
674 if (cpumask_any_but(mm_cpumask(mm), get_cpu()) < nr_cpu_ids)
675 should_defer = true;
676 put_cpu();
677
678 return should_defer;
679 }
680 #else
681 static void set_tlb_ubc_flush_pending(struct mm_struct *mm,
682 struct page *page, bool writable)
683 {
684 }
685
686 static bool should_defer_flush(struct mm_struct *mm, enum ttu_flags flags)
687 {
688 return false;
689 }
690 #endif /* CONFIG_ARCH_WANT_BATCHED_UNMAP_TLB_FLUSH */
691
692 /*
693 * At what user virtual address is page expected in vma?
694 * Caller should check the page is actually part of the vma.
695 */
696 unsigned long page_address_in_vma(struct page *page, struct vm_area_struct *vma)
697 {
698 unsigned long address;
699 if (PageAnon(page)) {
700 struct anon_vma *page__anon_vma = page_anon_vma(page);
701 /*
702 * Note: swapoff's unuse_vma() is more efficient with this
703 * check, and needs it to match anon_vma when KSM is active.
704 */
705 if (!vma->anon_vma || !page__anon_vma ||
706 vma->anon_vma->root != page__anon_vma->root)
707 return -EFAULT;
708 } else if (page->mapping) {
709 if (!vma->vm_file || vma->vm_file->f_mapping != page->mapping)
710 return -EFAULT;
711 } else
712 return -EFAULT;
713 address = __vma_address(page, vma);
714 if (unlikely(address < vma->vm_start || address >= vma->vm_end))
715 return -EFAULT;
716 return address;
717 }
718
719 pmd_t *mm_find_pmd(struct mm_struct *mm, unsigned long address)
720 {
721 pgd_t *pgd;
722 pud_t *pud;
723 pmd_t *pmd = NULL;
724 pmd_t pmde;
725
726 pgd = pgd_offset(mm, address);
727 if (!pgd_present(*pgd))
728 goto out;
729
730 pud = pud_offset(pgd, address);
731 if (!pud_present(*pud))
732 goto out;
733
734 pmd = pmd_offset(pud, address);
735 /*
736 * Some THP functions use the sequence pmdp_huge_clear_flush(), set_pmd_at()
737 * without holding anon_vma lock for write. So when looking for a
738 * genuine pmde (in which to find pte), test present and !THP together.
739 */
740 pmde = *pmd;
741 barrier();
742 if (!pmd_present(pmde) || pmd_trans_huge(pmde))
743 pmd = NULL;
744 out:
745 return pmd;
746 }
747
748 /*
749 * Check that @page is mapped at @address into @mm.
750 *
751 * If @sync is false, page_check_address may perform a racy check to avoid
752 * the page table lock when the pte is not present (helpful when reclaiming
753 * highly shared pages).
754 *
755 * On success returns with pte mapped and locked.
756 */
757 pte_t *__page_check_address(struct page *page, struct mm_struct *mm,
758 unsigned long address, spinlock_t **ptlp, int sync)
759 {
760 pmd_t *pmd;
761 pte_t *pte;
762 spinlock_t *ptl;
763
764 if (unlikely(PageHuge(page))) {
765 /* when pud is not present, pte will be NULL */
766 pte = huge_pte_offset(mm, address);
767 if (!pte)
768 return NULL;
769
770 ptl = huge_pte_lockptr(page_hstate(page), mm, pte);
771 goto check;
772 }
773
774 pmd = mm_find_pmd(mm, address);
775 if (!pmd)
776 return NULL;
777
778 pte = pte_offset_map(pmd, address);
779 /* Make a quick check before getting the lock */
780 if (!sync && !pte_present(*pte)) {
781 pte_unmap(pte);
782 return NULL;
783 }
784
785 ptl = pte_lockptr(mm, pmd);
786 check:
787 spin_lock(ptl);
788 if (pte_present(*pte) && page_to_pfn(page) == pte_pfn(*pte)) {
789 *ptlp = ptl;
790 return pte;
791 }
792 pte_unmap_unlock(pte, ptl);
793 return NULL;
794 }
795
796 /**
797 * page_mapped_in_vma - check whether a page is really mapped in a VMA
798 * @page: the page to test
799 * @vma: the VMA to test
800 *
801 * Returns 1 if the page is mapped into the page tables of the VMA, 0
802 * if the page is not mapped into the page tables of this VMA. Only
803 * valid for normal file or anonymous VMAs.
804 */
805 int page_mapped_in_vma(struct page *page, struct vm_area_struct *vma)
806 {
807 unsigned long address;
808 pte_t *pte;
809 spinlock_t *ptl;
810
811 address = __vma_address(page, vma);
812 if (unlikely(address < vma->vm_start || address >= vma->vm_end))
813 return 0;
814 pte = page_check_address(page, vma->vm_mm, address, &ptl, 1);
815 if (!pte) /* the page is not in this mm */
816 return 0;
817 pte_unmap_unlock(pte, ptl);
818
819 return 1;
820 }
821
822 struct page_referenced_arg {
823 int mapcount;
824 int referenced;
825 unsigned long vm_flags;
826 struct mem_cgroup *memcg;
827 };
828 /*
829 * arg: page_referenced_arg will be passed
830 */
831 static int page_referenced_one(struct page *page, struct vm_area_struct *vma,
832 unsigned long address, void *arg)
833 {
834 struct mm_struct *mm = vma->vm_mm;
835 spinlock_t *ptl;
836 int referenced = 0;
837 struct page_referenced_arg *pra = arg;
838
839 if (unlikely(PageTransHuge(page))) {
840 pmd_t *pmd;
841
842 /*
843 * rmap might return false positives; we must filter
844 * these out using page_check_address_pmd().
845 */
846 pmd = page_check_address_pmd(page, mm, address, &ptl);
847 if (!pmd)
848 return SWAP_AGAIN;
849
850 if (vma->vm_flags & VM_LOCKED) {
851 spin_unlock(ptl);
852 pra->vm_flags |= VM_LOCKED;
853 return SWAP_FAIL; /* To break the loop */
854 }
855
856 if (pmdp_clear_flush_young_notify(vma, address, pmd))
857 referenced++;
858 spin_unlock(ptl);
859 } else {
860 pte_t *pte;
861
862 /*
863 * rmap might return false positives; we must filter
864 * these out using page_check_address().
865 */
866 pte = page_check_address(page, mm, address, &ptl, 0);
867 if (!pte)
868 return SWAP_AGAIN;
869
870 if (vma->vm_flags & VM_LOCKED) {
871 pte_unmap_unlock(pte, ptl);
872 pra->vm_flags |= VM_LOCKED;
873 return SWAP_FAIL; /* To break the loop */
874 }
875
876 if (ptep_clear_flush_young_notify(vma, address, pte)) {
877 /*
878 * Don't treat a reference through a sequentially read
879 * mapping as such. If the page has been used in
880 * another mapping, we will catch it; if this other
881 * mapping is already gone, the unmap path will have
882 * set PG_referenced or activated the page.
883 */
884 if (likely(!(vma->vm_flags & VM_SEQ_READ)))
885 referenced++;
886 }
887 pte_unmap_unlock(pte, ptl);
888 }
889
890 if (referenced)
891 clear_page_idle(page);
892 if (test_and_clear_page_young(page))
893 referenced++;
894
895 if (referenced) {
896 pra->referenced++;
897 pra->vm_flags |= vma->vm_flags;
898 }
899
900 pra->mapcount--;
901 if (!pra->mapcount)
902 return SWAP_SUCCESS; /* To break the loop */
903
904 return SWAP_AGAIN;
905 }
906
907 static bool invalid_page_referenced_vma(struct vm_area_struct *vma, void *arg)
908 {
909 struct page_referenced_arg *pra = arg;
910 struct mem_cgroup *memcg = pra->memcg;
911
912 if (!mm_match_cgroup(vma->vm_mm, memcg))
913 return true;
914
915 return false;
916 }
917
918 /**
919 * page_referenced - test if the page was referenced
920 * @page: the page to test
921 * @is_locked: caller holds lock on the page
922 * @memcg: target memory cgroup
923 * @vm_flags: collect encountered vma->vm_flags who actually referenced the page
924 *
925 * Quick test_and_clear_referenced for all mappings to a page,
926 * returns the number of ptes which referenced the page.
927 */
928 int page_referenced(struct page *page,
929 int is_locked,
930 struct mem_cgroup *memcg,
931 unsigned long *vm_flags)
932 {
933 int ret;
934 int we_locked = 0;
935 struct page_referenced_arg pra = {
936 .mapcount = page_mapcount(page),
937 .memcg = memcg,
938 };
939 struct rmap_walk_control rwc = {
940 .rmap_one = page_referenced_one,
941 .arg = (void *)&pra,
942 .anon_lock = page_lock_anon_vma_read,
943 };
944
945 *vm_flags = 0;
946 if (!page_mapped(page))
947 return 0;
948
949 if (!page_rmapping(page))
950 return 0;
951
952 if (!is_locked && (!PageAnon(page) || PageKsm(page))) {
953 we_locked = trylock_page(page);
954 if (!we_locked)
955 return 1;
956 }
957
958 /*
959 * If we are reclaiming on behalf of a cgroup, skip
960 * counting on behalf of references from different
961 * cgroups
962 */
963 if (memcg) {
964 rwc.invalid_vma = invalid_page_referenced_vma;
965 }
966
967 ret = rmap_walk(page, &rwc);
968 *vm_flags = pra.vm_flags;
969
970 if (we_locked)
971 unlock_page(page);
972
973 return pra.referenced;
974 }
975
976 static int page_mkclean_one(struct page *page, struct vm_area_struct *vma,
977 unsigned long address, void *arg)
978 {
979 struct mm_struct *mm = vma->vm_mm;
980 pte_t *pte;
981 spinlock_t *ptl;
982 int ret = 0;
983 int *cleaned = arg;
984
985 pte = page_check_address(page, mm, address, &ptl, 1);
986 if (!pte)
987 goto out;
988
989 if (pte_dirty(*pte) || pte_write(*pte)) {
990 pte_t entry;
991
992 flush_cache_page(vma, address, pte_pfn(*pte));
993 entry = ptep_clear_flush(vma, address, pte);
994 entry = pte_wrprotect(entry);
995 entry = pte_mkclean(entry);
996 set_pte_at(mm, address, pte, entry);
997 ret = 1;
998 }
999
1000 pte_unmap_unlock(pte, ptl);
1001
1002 if (ret) {
1003 mmu_notifier_invalidate_page(mm, address);
1004 (*cleaned)++;
1005 }
1006 out:
1007 return SWAP_AGAIN;
1008 }
1009
1010 static bool invalid_mkclean_vma(struct vm_area_struct *vma, void *arg)
1011 {
1012 if (vma->vm_flags & VM_SHARED)
1013 return false;
1014
1015 return true;
1016 }
1017
1018 int page_mkclean(struct page *page)
1019 {
1020 int cleaned = 0;
1021 struct address_space *mapping;
1022 struct rmap_walk_control rwc = {
1023 .arg = (void *)&cleaned,
1024 .rmap_one = page_mkclean_one,
1025 .invalid_vma = invalid_mkclean_vma,
1026 };
1027
1028 BUG_ON(!PageLocked(page));
1029
1030 if (!page_mapped(page))
1031 return 0;
1032
1033 mapping = page_mapping(page);
1034 if (!mapping)
1035 return 0;
1036
1037 rmap_walk(page, &rwc);
1038
1039 return cleaned;
1040 }
1041 EXPORT_SYMBOL_GPL(page_mkclean);
1042
1043 /**
1044 * page_move_anon_rmap - move a page to our anon_vma
1045 * @page: the page to move to our anon_vma
1046 * @vma: the vma the page belongs to
1047 * @address: the user virtual address mapped
1048 *
1049 * When a page belongs exclusively to one process after a COW event,
1050 * that page can be moved into the anon_vma that belongs to just that
1051 * process, so the rmap code will not search the parent or sibling
1052 * processes.
1053 */
1054 void page_move_anon_rmap(struct page *page,
1055 struct vm_area_struct *vma, unsigned long address)
1056 {
1057 struct anon_vma *anon_vma = vma->anon_vma;
1058
1059 VM_BUG_ON_PAGE(!PageLocked(page), page);
1060 VM_BUG_ON_VMA(!anon_vma, vma);
1061 VM_BUG_ON_PAGE(page->index != linear_page_index(vma, address), page);
1062
1063 anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
1064 /*
1065 * Ensure that anon_vma and the PAGE_MAPPING_ANON bit are written
1066 * simultaneously, so a concurrent reader (eg page_referenced()'s
1067 * PageAnon()) will not see one without the other.
1068 */
1069 WRITE_ONCE(page->mapping, (struct address_space *) anon_vma);
1070 }
1071
1072 /**
1073 * __page_set_anon_rmap - set up new anonymous rmap
1074 * @page: Page to add to rmap
1075 * @vma: VM area to add page to.
1076 * @address: User virtual address of the mapping
1077 * @exclusive: the page is exclusively owned by the current process
1078 */
1079 static void __page_set_anon_rmap(struct page *page,
1080 struct vm_area_struct *vma, unsigned long address, int exclusive)
1081 {
1082 struct anon_vma *anon_vma = vma->anon_vma;
1083
1084 BUG_ON(!anon_vma);
1085
1086 if (PageAnon(page))
1087 return;
1088
1089 /*
1090 * If the page isn't exclusively mapped into this vma,
1091 * we must use the _oldest_ possible anon_vma for the
1092 * page mapping!
1093 */
1094 if (!exclusive)
1095 anon_vma = anon_vma->root;
1096
1097 anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
1098 page->mapping = (struct address_space *) anon_vma;
1099 page->index = linear_page_index(vma, address);
1100 }
1101
1102 /**
1103 * __page_check_anon_rmap - sanity check anonymous rmap addition
1104 * @page: the page to add the mapping to
1105 * @vma: the vm area in which the mapping is added
1106 * @address: the user virtual address mapped
1107 */
1108 static void __page_check_anon_rmap(struct page *page,
1109 struct vm_area_struct *vma, unsigned long address)
1110 {
1111 #ifdef CONFIG_DEBUG_VM
1112 /*
1113 * The page's anon-rmap details (mapping and index) are guaranteed to
1114 * be set up correctly at this point.
1115 *
1116 * We have exclusion against page_add_anon_rmap because the caller
1117 * always holds the page locked, except if called from page_dup_rmap,
1118 * in which case the page is already known to be setup.
1119 *
1120 * We have exclusion against page_add_new_anon_rmap because those pages
1121 * are initially only visible via the pagetables, and the pte is locked
1122 * over the call to page_add_new_anon_rmap.
1123 */
1124 BUG_ON(page_anon_vma(page)->root != vma->anon_vma->root);
1125 BUG_ON(page_to_pgoff(page) != linear_page_index(vma, address));
1126 #endif
1127 }
1128
1129 /**
1130 * page_add_anon_rmap - add pte mapping to an anonymous page
1131 * @page: the page to add the mapping to
1132 * @vma: the vm area in which the mapping is added
1133 * @address: the user virtual address mapped
1134 * @compound: charge the page as compound or small page
1135 *
1136 * The caller needs to hold the pte lock, and the page must be locked in
1137 * the anon_vma case: to serialize mapping,index checking after setting,
1138 * and to ensure that PageAnon is not being upgraded racily to PageKsm
1139 * (but PageKsm is never downgraded to PageAnon).
1140 */
1141 void page_add_anon_rmap(struct page *page,
1142 struct vm_area_struct *vma, unsigned long address, bool compound)
1143 {
1144 do_page_add_anon_rmap(page, vma, address, compound ? RMAP_COMPOUND : 0);
1145 }
1146
1147 /*
1148 * Special version of the above for do_swap_page, which often runs
1149 * into pages that are exclusively owned by the current process.
1150 * Everybody else should continue to use page_add_anon_rmap above.
1151 */
1152 void do_page_add_anon_rmap(struct page *page,
1153 struct vm_area_struct *vma, unsigned long address, int flags)
1154 {
1155 bool compound = flags & RMAP_COMPOUND;
1156 bool first;
1157
1158 if (PageTransCompound(page)) {
1159 VM_BUG_ON_PAGE(!PageLocked(page), page);
1160 if (compound) {
1161 atomic_t *mapcount;
1162
1163 VM_BUG_ON_PAGE(!PageTransHuge(page), page);
1164 mapcount = compound_mapcount_ptr(page);
1165 first = atomic_inc_and_test(mapcount);
1166 } else {
1167 /* Anon THP always mapped first with PMD */
1168 first = 0;
1169 VM_BUG_ON_PAGE(!page_mapcount(page), page);
1170 atomic_inc(&page->_mapcount);
1171 }
1172 } else {
1173 first = atomic_inc_and_test(&page->_mapcount);
1174 }
1175
1176 if (first) {
1177 int nr = compound ? hpage_nr_pages(page) : 1;
1178 /*
1179 * We use the irq-unsafe __{inc|mod}_zone_page_stat because
1180 * these counters are not modified in interrupt context, and
1181 * pte lock(a spinlock) is held, which implies preemption
1182 * disabled.
1183 */
1184 if (compound) {
1185 VM_BUG_ON_PAGE(!PageTransHuge(page), page);
1186 __inc_zone_page_state(page,
1187 NR_ANON_TRANSPARENT_HUGEPAGES);
1188 }
1189 __mod_zone_page_state(page_zone(page), NR_ANON_PAGES, nr);
1190 }
1191 if (unlikely(PageKsm(page)))
1192 return;
1193
1194 VM_BUG_ON_PAGE(!PageLocked(page), page);
1195
1196 /* address might be in next vma when migration races vma_adjust */
1197 if (first)
1198 __page_set_anon_rmap(page, vma, address,
1199 flags & RMAP_EXCLUSIVE);
1200 else
1201 __page_check_anon_rmap(page, vma, address);
1202 }
1203
1204 /**
1205 * page_add_new_anon_rmap - add pte mapping to a new anonymous page
1206 * @page: the page to add the mapping to
1207 * @vma: the vm area in which the mapping is added
1208 * @address: the user virtual address mapped
1209 * @compound: charge the page as compound or small page
1210 *
1211 * Same as page_add_anon_rmap but must only be called on *new* pages.
1212 * This means the inc-and-test can be bypassed.
1213 * Page does not have to be locked.
1214 */
1215 void page_add_new_anon_rmap(struct page *page,
1216 struct vm_area_struct *vma, unsigned long address, bool compound)
1217 {
1218 int nr = compound ? hpage_nr_pages(page) : 1;
1219
1220 VM_BUG_ON_VMA(address < vma->vm_start || address >= vma->vm_end, vma);
1221 SetPageSwapBacked(page);
1222 if (compound) {
1223 VM_BUG_ON_PAGE(!PageTransHuge(page), page);
1224 /* increment count (starts at -1) */
1225 atomic_set(compound_mapcount_ptr(page), 0);
1226 __inc_zone_page_state(page, NR_ANON_TRANSPARENT_HUGEPAGES);
1227 } else {
1228 /* Anon THP always mapped first with PMD */
1229 VM_BUG_ON_PAGE(PageTransCompound(page), page);
1230 /* increment count (starts at -1) */
1231 atomic_set(&page->_mapcount, 0);
1232 }
1233 __mod_zone_page_state(page_zone(page), NR_ANON_PAGES, nr);
1234 __page_set_anon_rmap(page, vma, address, 1);
1235 }
1236
1237 /**
1238 * page_add_file_rmap - add pte mapping to a file page
1239 * @page: the page to add the mapping to
1240 *
1241 * The caller needs to hold the pte lock.
1242 */
1243 void page_add_file_rmap(struct page *page)
1244 {
1245 struct mem_cgroup *memcg;
1246
1247 memcg = mem_cgroup_begin_page_stat(page);
1248 if (atomic_inc_and_test(&page->_mapcount)) {
1249 __inc_zone_page_state(page, NR_FILE_MAPPED);
1250 mem_cgroup_inc_page_stat(memcg, MEM_CGROUP_STAT_FILE_MAPPED);
1251 }
1252 mem_cgroup_end_page_stat(memcg);
1253 }
1254
1255 static void page_remove_file_rmap(struct page *page)
1256 {
1257 struct mem_cgroup *memcg;
1258
1259 memcg = mem_cgroup_begin_page_stat(page);
1260
1261 /* Hugepages are not counted in NR_FILE_MAPPED for now. */
1262 if (unlikely(PageHuge(page))) {
1263 /* hugetlb pages are always mapped with pmds */
1264 atomic_dec(compound_mapcount_ptr(page));
1265 goto out;
1266 }
1267
1268 /* page still mapped by someone else? */
1269 if (!atomic_add_negative(-1, &page->_mapcount))
1270 goto out;
1271
1272 /*
1273 * We use the irq-unsafe __{inc|mod}_zone_page_stat because
1274 * these counters are not modified in interrupt context, and
1275 * pte lock(a spinlock) is held, which implies preemption disabled.
1276 */
1277 __dec_zone_page_state(page, NR_FILE_MAPPED);
1278 mem_cgroup_dec_page_stat(memcg, MEM_CGROUP_STAT_FILE_MAPPED);
1279
1280 if (unlikely(PageMlocked(page)))
1281 clear_page_mlock(page);
1282 out:
1283 mem_cgroup_end_page_stat(memcg);
1284 }
1285
1286 static void page_remove_anon_compound_rmap(struct page *page)
1287 {
1288 int i, nr;
1289
1290 if (!atomic_add_negative(-1, compound_mapcount_ptr(page)))
1291 return;
1292
1293 /* Hugepages are not counted in NR_ANON_PAGES for now. */
1294 if (unlikely(PageHuge(page)))
1295 return;
1296
1297 if (!IS_ENABLED(CONFIG_TRANSPARENT_HUGEPAGE))
1298 return;
1299
1300 __dec_zone_page_state(page, NR_ANON_TRANSPARENT_HUGEPAGES);
1301
1302 if (TestClearPageDoubleMap(page)) {
1303 /*
1304 * Subpages can be mapped with PTEs too. Check how many of
1305 * themi are still mapped.
1306 */
1307 for (i = 0, nr = 0; i < HPAGE_PMD_NR; i++) {
1308 if (atomic_add_negative(-1, &page[i]._mapcount))
1309 nr++;
1310 }
1311 } else {
1312 nr = HPAGE_PMD_NR;
1313 }
1314
1315 if (nr)
1316 __mod_zone_page_state(page_zone(page), NR_ANON_PAGES, -nr);
1317 }
1318
1319 /**
1320 * page_remove_rmap - take down pte mapping from a page
1321 * @page: page to remove mapping from
1322 * @compound: uncharge the page as compound or small page
1323 *
1324 * The caller needs to hold the pte lock.
1325 */
1326 void page_remove_rmap(struct page *page, bool compound)
1327 {
1328 if (!PageAnon(page)) {
1329 VM_BUG_ON_PAGE(compound && !PageHuge(page), page);
1330 page_remove_file_rmap(page);
1331 return;
1332 }
1333
1334 if (compound)
1335 return page_remove_anon_compound_rmap(page);
1336
1337 /* page still mapped by someone else? */
1338 if (!atomic_add_negative(-1, &page->_mapcount))
1339 return;
1340
1341 /*
1342 * We use the irq-unsafe __{inc|mod}_zone_page_stat because
1343 * these counters are not modified in interrupt context, and
1344 * pte lock(a spinlock) is held, which implies preemption disabled.
1345 */
1346 __dec_zone_page_state(page, NR_ANON_PAGES);
1347
1348 if (unlikely(PageMlocked(page)))
1349 clear_page_mlock(page);
1350
1351 /*
1352 * It would be tidy to reset the PageAnon mapping here,
1353 * but that might overwrite a racing page_add_anon_rmap
1354 * which increments mapcount after us but sets mapping
1355 * before us: so leave the reset to free_hot_cold_page,
1356 * and remember that it's only reliable while mapped.
1357 * Leaving it set also helps swapoff to reinstate ptes
1358 * faster for those pages still in swapcache.
1359 */
1360 }
1361
1362 /*
1363 * @arg: enum ttu_flags will be passed to this argument
1364 */
1365 static int try_to_unmap_one(struct page *page, struct vm_area_struct *vma,
1366 unsigned long address, void *arg)
1367 {
1368 struct mm_struct *mm = vma->vm_mm;
1369 pte_t *pte;
1370 pte_t pteval;
1371 spinlock_t *ptl;
1372 int ret = SWAP_AGAIN;
1373 enum ttu_flags flags = (enum ttu_flags)arg;
1374
1375 /* munlock has nothing to gain from examining un-locked vmas */
1376 if ((flags & TTU_MUNLOCK) && !(vma->vm_flags & VM_LOCKED))
1377 goto out;
1378
1379 pte = page_check_address(page, mm, address, &ptl, 0);
1380 if (!pte)
1381 goto out;
1382
1383 /*
1384 * If the page is mlock()d, we cannot swap it out.
1385 * If it's recently referenced (perhaps page_referenced
1386 * skipped over this mm) then we should reactivate it.
1387 */
1388 if (!(flags & TTU_IGNORE_MLOCK)) {
1389 if (vma->vm_flags & VM_LOCKED) {
1390 /* Holding pte lock, we do *not* need mmap_sem here */
1391 mlock_vma_page(page);
1392 ret = SWAP_MLOCK;
1393 goto out_unmap;
1394 }
1395 if (flags & TTU_MUNLOCK)
1396 goto out_unmap;
1397 }
1398 if (!(flags & TTU_IGNORE_ACCESS)) {
1399 if (ptep_clear_flush_young_notify(vma, address, pte)) {
1400 ret = SWAP_FAIL;
1401 goto out_unmap;
1402 }
1403 }
1404
1405 /* Nuke the page table entry. */
1406 flush_cache_page(vma, address, page_to_pfn(page));
1407 if (should_defer_flush(mm, flags)) {
1408 /*
1409 * We clear the PTE but do not flush so potentially a remote
1410 * CPU could still be writing to the page. If the entry was
1411 * previously clean then the architecture must guarantee that
1412 * a clear->dirty transition on a cached TLB entry is written
1413 * through and traps if the PTE is unmapped.
1414 */
1415 pteval = ptep_get_and_clear(mm, address, pte);
1416
1417 set_tlb_ubc_flush_pending(mm, page, pte_dirty(pteval));
1418 } else {
1419 pteval = ptep_clear_flush(vma, address, pte);
1420 }
1421
1422 /* Move the dirty bit to the physical page now the pte is gone. */
1423 if (pte_dirty(pteval))
1424 set_page_dirty(page);
1425
1426 /* Update high watermark before we lower rss */
1427 update_hiwater_rss(mm);
1428
1429 if (PageHWPoison(page) && !(flags & TTU_IGNORE_HWPOISON)) {
1430 if (PageHuge(page)) {
1431 hugetlb_count_sub(1 << compound_order(page), mm);
1432 } else {
1433 dec_mm_counter(mm, mm_counter(page));
1434 }
1435 set_pte_at(mm, address, pte,
1436 swp_entry_to_pte(make_hwpoison_entry(page)));
1437 } else if (pte_unused(pteval)) {
1438 /*
1439 * The guest indicated that the page content is of no
1440 * interest anymore. Simply discard the pte, vmscan
1441 * will take care of the rest.
1442 */
1443 dec_mm_counter(mm, mm_counter(page));
1444 } else if (IS_ENABLED(CONFIG_MIGRATION) && (flags & TTU_MIGRATION)) {
1445 swp_entry_t entry;
1446 pte_t swp_pte;
1447 /*
1448 * Store the pfn of the page in a special migration
1449 * pte. do_swap_page() will wait until the migration
1450 * pte is removed and then restart fault handling.
1451 */
1452 entry = make_migration_entry(page, pte_write(pteval));
1453 swp_pte = swp_entry_to_pte(entry);
1454 if (pte_soft_dirty(pteval))
1455 swp_pte = pte_swp_mksoft_dirty(swp_pte);
1456 set_pte_at(mm, address, pte, swp_pte);
1457 } else if (PageAnon(page)) {
1458 swp_entry_t entry = { .val = page_private(page) };
1459 pte_t swp_pte;
1460 /*
1461 * Store the swap location in the pte.
1462 * See handle_pte_fault() ...
1463 */
1464 VM_BUG_ON_PAGE(!PageSwapCache(page), page);
1465 if (swap_duplicate(entry) < 0) {
1466 set_pte_at(mm, address, pte, pteval);
1467 ret = SWAP_FAIL;
1468 goto out_unmap;
1469 }
1470 if (list_empty(&mm->mmlist)) {
1471 spin_lock(&mmlist_lock);
1472 if (list_empty(&mm->mmlist))
1473 list_add(&mm->mmlist, &init_mm.mmlist);
1474 spin_unlock(&mmlist_lock);
1475 }
1476 dec_mm_counter(mm, MM_ANONPAGES);
1477 inc_mm_counter(mm, MM_SWAPENTS);
1478 swp_pte = swp_entry_to_pte(entry);
1479 if (pte_soft_dirty(pteval))
1480 swp_pte = pte_swp_mksoft_dirty(swp_pte);
1481 set_pte_at(mm, address, pte, swp_pte);
1482 } else
1483 dec_mm_counter(mm, mm_counter_file(page));
1484
1485 page_remove_rmap(page, PageHuge(page));
1486 page_cache_release(page);
1487
1488 out_unmap:
1489 pte_unmap_unlock(pte, ptl);
1490 if (ret != SWAP_FAIL && ret != SWAP_MLOCK && !(flags & TTU_MUNLOCK))
1491 mmu_notifier_invalidate_page(mm, address);
1492 out:
1493 return ret;
1494 }
1495
1496 bool is_vma_temporary_stack(struct vm_area_struct *vma)
1497 {
1498 int maybe_stack = vma->vm_flags & (VM_GROWSDOWN | VM_GROWSUP);
1499
1500 if (!maybe_stack)
1501 return false;
1502
1503 if ((vma->vm_flags & VM_STACK_INCOMPLETE_SETUP) ==
1504 VM_STACK_INCOMPLETE_SETUP)
1505 return true;
1506
1507 return false;
1508 }
1509
1510 static bool invalid_migration_vma(struct vm_area_struct *vma, void *arg)
1511 {
1512 return is_vma_temporary_stack(vma);
1513 }
1514
1515 static int page_not_mapped(struct page *page)
1516 {
1517 return !page_mapped(page);
1518 };
1519
1520 /**
1521 * try_to_unmap - try to remove all page table mappings to a page
1522 * @page: the page to get unmapped
1523 * @flags: action and flags
1524 *
1525 * Tries to remove all the page table entries which are mapping this
1526 * page, used in the pageout path. Caller must hold the page lock.
1527 * Return values are:
1528 *
1529 * SWAP_SUCCESS - we succeeded in removing all mappings
1530 * SWAP_AGAIN - we missed a mapping, try again later
1531 * SWAP_FAIL - the page is unswappable
1532 * SWAP_MLOCK - page is mlocked.
1533 */
1534 int try_to_unmap(struct page *page, enum ttu_flags flags)
1535 {
1536 int ret;
1537 struct rmap_walk_control rwc = {
1538 .rmap_one = try_to_unmap_one,
1539 .arg = (void *)flags,
1540 .done = page_not_mapped,
1541 .anon_lock = page_lock_anon_vma_read,
1542 };
1543
1544 VM_BUG_ON_PAGE(!PageHuge(page) && PageTransHuge(page), page);
1545
1546 /*
1547 * During exec, a temporary VMA is setup and later moved.
1548 * The VMA is moved under the anon_vma lock but not the
1549 * page tables leading to a race where migration cannot
1550 * find the migration ptes. Rather than increasing the
1551 * locking requirements of exec(), migration skips
1552 * temporary VMAs until after exec() completes.
1553 */
1554 if ((flags & TTU_MIGRATION) && !PageKsm(page) && PageAnon(page))
1555 rwc.invalid_vma = invalid_migration_vma;
1556
1557 ret = rmap_walk(page, &rwc);
1558
1559 if (ret != SWAP_MLOCK && !page_mapped(page))
1560 ret = SWAP_SUCCESS;
1561 return ret;
1562 }
1563
1564 /**
1565 * try_to_munlock - try to munlock a page
1566 * @page: the page to be munlocked
1567 *
1568 * Called from munlock code. Checks all of the VMAs mapping the page
1569 * to make sure nobody else has this page mlocked. The page will be
1570 * returned with PG_mlocked cleared if no other vmas have it mlocked.
1571 *
1572 * Return values are:
1573 *
1574 * SWAP_AGAIN - no vma is holding page mlocked, or,
1575 * SWAP_AGAIN - page mapped in mlocked vma -- couldn't acquire mmap sem
1576 * SWAP_FAIL - page cannot be located at present
1577 * SWAP_MLOCK - page is now mlocked.
1578 */
1579 int try_to_munlock(struct page *page)
1580 {
1581 int ret;
1582 struct rmap_walk_control rwc = {
1583 .rmap_one = try_to_unmap_one,
1584 .arg = (void *)TTU_MUNLOCK,
1585 .done = page_not_mapped,
1586 .anon_lock = page_lock_anon_vma_read,
1587
1588 };
1589
1590 VM_BUG_ON_PAGE(!PageLocked(page) || PageLRU(page), page);
1591
1592 ret = rmap_walk(page, &rwc);
1593 return ret;
1594 }
1595
1596 void __put_anon_vma(struct anon_vma *anon_vma)
1597 {
1598 struct anon_vma *root = anon_vma->root;
1599
1600 anon_vma_free(anon_vma);
1601 if (root != anon_vma && atomic_dec_and_test(&root->refcount))
1602 anon_vma_free(root);
1603 }
1604
1605 static struct anon_vma *rmap_walk_anon_lock(struct page *page,
1606 struct rmap_walk_control *rwc)
1607 {
1608 struct anon_vma *anon_vma;
1609
1610 if (rwc->anon_lock)
1611 return rwc->anon_lock(page);
1612
1613 /*
1614 * Note: remove_migration_ptes() cannot use page_lock_anon_vma_read()
1615 * because that depends on page_mapped(); but not all its usages
1616 * are holding mmap_sem. Users without mmap_sem are required to
1617 * take a reference count to prevent the anon_vma disappearing
1618 */
1619 anon_vma = page_anon_vma(page);
1620 if (!anon_vma)
1621 return NULL;
1622
1623 anon_vma_lock_read(anon_vma);
1624 return anon_vma;
1625 }
1626
1627 /*
1628 * rmap_walk_anon - do something to anonymous page using the object-based
1629 * rmap method
1630 * @page: the page to be handled
1631 * @rwc: control variable according to each walk type
1632 *
1633 * Find all the mappings of a page using the mapping pointer and the vma chains
1634 * contained in the anon_vma struct it points to.
1635 *
1636 * When called from try_to_munlock(), the mmap_sem of the mm containing the vma
1637 * where the page was found will be held for write. So, we won't recheck
1638 * vm_flags for that VMA. That should be OK, because that vma shouldn't be
1639 * LOCKED.
1640 */
1641 static int rmap_walk_anon(struct page *page, struct rmap_walk_control *rwc)
1642 {
1643 struct anon_vma *anon_vma;
1644 pgoff_t pgoff;
1645 struct anon_vma_chain *avc;
1646 int ret = SWAP_AGAIN;
1647
1648 anon_vma = rmap_walk_anon_lock(page, rwc);
1649 if (!anon_vma)
1650 return ret;
1651
1652 pgoff = page_to_pgoff(page);
1653 anon_vma_interval_tree_foreach(avc, &anon_vma->rb_root, pgoff, pgoff) {
1654 struct vm_area_struct *vma = avc->vma;
1655 unsigned long address = vma_address(page, vma);
1656
1657 cond_resched();
1658
1659 if (rwc->invalid_vma && rwc->invalid_vma(vma, rwc->arg))
1660 continue;
1661
1662 ret = rwc->rmap_one(page, vma, address, rwc->arg);
1663 if (ret != SWAP_AGAIN)
1664 break;
1665 if (rwc->done && rwc->done(page))
1666 break;
1667 }
1668 anon_vma_unlock_read(anon_vma);
1669 return ret;
1670 }
1671
1672 /*
1673 * rmap_walk_file - do something to file page using the object-based rmap method
1674 * @page: the page to be handled
1675 * @rwc: control variable according to each walk type
1676 *
1677 * Find all the mappings of a page using the mapping pointer and the vma chains
1678 * contained in the address_space struct it points to.
1679 *
1680 * When called from try_to_munlock(), the mmap_sem of the mm containing the vma
1681 * where the page was found will be held for write. So, we won't recheck
1682 * vm_flags for that VMA. That should be OK, because that vma shouldn't be
1683 * LOCKED.
1684 */
1685 static int rmap_walk_file(struct page *page, struct rmap_walk_control *rwc)
1686 {
1687 struct address_space *mapping = page->mapping;
1688 pgoff_t pgoff;
1689 struct vm_area_struct *vma;
1690 int ret = SWAP_AGAIN;
1691
1692 /*
1693 * The page lock not only makes sure that page->mapping cannot
1694 * suddenly be NULLified by truncation, it makes sure that the
1695 * structure at mapping cannot be freed and reused yet,
1696 * so we can safely take mapping->i_mmap_rwsem.
1697 */
1698 VM_BUG_ON_PAGE(!PageLocked(page), page);
1699
1700 if (!mapping)
1701 return ret;
1702
1703 pgoff = page_to_pgoff(page);
1704 i_mmap_lock_read(mapping);
1705 vma_interval_tree_foreach(vma, &mapping->i_mmap, pgoff, pgoff) {
1706 unsigned long address = vma_address(page, vma);
1707
1708 cond_resched();
1709
1710 if (rwc->invalid_vma && rwc->invalid_vma(vma, rwc->arg))
1711 continue;
1712
1713 ret = rwc->rmap_one(page, vma, address, rwc->arg);
1714 if (ret != SWAP_AGAIN)
1715 goto done;
1716 if (rwc->done && rwc->done(page))
1717 goto done;
1718 }
1719
1720 done:
1721 i_mmap_unlock_read(mapping);
1722 return ret;
1723 }
1724
1725 int rmap_walk(struct page *page, struct rmap_walk_control *rwc)
1726 {
1727 if (unlikely(PageKsm(page)))
1728 return rmap_walk_ksm(page, rwc);
1729 else if (PageAnon(page))
1730 return rmap_walk_anon(page, rwc);
1731 else
1732 return rmap_walk_file(page, rwc);
1733 }
1734
1735 #ifdef CONFIG_HUGETLB_PAGE
1736 /*
1737 * The following three functions are for anonymous (private mapped) hugepages.
1738 * Unlike common anonymous pages, anonymous hugepages have no accounting code
1739 * and no lru code, because we handle hugepages differently from common pages.
1740 */
1741 static void __hugepage_set_anon_rmap(struct page *page,
1742 struct vm_area_struct *vma, unsigned long address, int exclusive)
1743 {
1744 struct anon_vma *anon_vma = vma->anon_vma;
1745
1746 BUG_ON(!anon_vma);
1747
1748 if (PageAnon(page))
1749 return;
1750 if (!exclusive)
1751 anon_vma = anon_vma->root;
1752
1753 anon_vma = (void *) anon_vma + PAGE_MAPPING_ANON;
1754 page->mapping = (struct address_space *) anon_vma;
1755 page->index = linear_page_index(vma, address);
1756 }
1757
1758 void hugepage_add_anon_rmap(struct page *page,
1759 struct vm_area_struct *vma, unsigned long address)
1760 {
1761 struct anon_vma *anon_vma = vma->anon_vma;
1762 int first;
1763
1764 BUG_ON(!PageLocked(page));
1765 BUG_ON(!anon_vma);
1766 /* address might be in next vma when migration races vma_adjust */
1767 first = atomic_inc_and_test(compound_mapcount_ptr(page));
1768 if (first)
1769 __hugepage_set_anon_rmap(page, vma, address, 0);
1770 }
1771
1772 void hugepage_add_new_anon_rmap(struct page *page,
1773 struct vm_area_struct *vma, unsigned long address)
1774 {
1775 BUG_ON(address < vma->vm_start || address >= vma->vm_end);
1776 atomic_set(compound_mapcount_ptr(page), 0);
1777 __hugepage_set_anon_rmap(page, vma, address, 1);
1778 }
1779 #endif /* CONFIG_HUGETLB_PAGE */
This page took 0.065083 seconds and 6 git commands to generate.