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