1 // SPDX-License-Identifier: GPL-2.0 2 /* 3 * mm/mremap.c 4 * 5 * (C) Copyright 1996 Linus Torvalds 6 * 7 * Address space accounting code <alan@lxorguk.ukuu.org.uk> 8 * (C) Copyright 2002 Red Hat Inc, All Rights Reserved 9 */ 10 11 #include <linux/mm.h> 12 #include <linux/hugetlb.h> 13 #include <linux/shm.h> 14 #include <linux/ksm.h> 15 #include <linux/mman.h> 16 #include <linux/swap.h> 17 #include <linux/capability.h> 18 #include <linux/fs.h> 19 #include <linux/swapops.h> 20 #include <linux/highmem.h> 21 #include <linux/security.h> 22 #include <linux/syscalls.h> 23 #include <linux/mmu_notifier.h> 24 #include <linux/uaccess.h> 25 #include <linux/mm-arch-hooks.h> 26 #include <linux/userfaultfd_k.h> 27 28 #include <asm/cacheflush.h> 29 #include <asm/tlbflush.h> 30 31 #include "internal.h" 32 33 static pud_t *get_old_pud(struct mm_struct *mm, unsigned long addr) 34 { 35 pgd_t *pgd; 36 p4d_t *p4d; 37 pud_t *pud; 38 39 pgd = pgd_offset(mm, addr); 40 if (pgd_none_or_clear_bad(pgd)) 41 return NULL; 42 43 p4d = p4d_offset(pgd, addr); 44 if (p4d_none_or_clear_bad(p4d)) 45 return NULL; 46 47 pud = pud_offset(p4d, addr); 48 if (pud_none_or_clear_bad(pud)) 49 return NULL; 50 51 return pud; 52 } 53 54 static pmd_t *get_old_pmd(struct mm_struct *mm, unsigned long addr) 55 { 56 pud_t *pud; 57 pmd_t *pmd; 58 59 pud = get_old_pud(mm, addr); 60 if (!pud) 61 return NULL; 62 63 pmd = pmd_offset(pud, addr); 64 if (pmd_none(*pmd)) 65 return NULL; 66 67 return pmd; 68 } 69 70 static pud_t *alloc_new_pud(struct mm_struct *mm, struct vm_area_struct *vma, 71 unsigned long addr) 72 { 73 pgd_t *pgd; 74 p4d_t *p4d; 75 76 pgd = pgd_offset(mm, addr); 77 p4d = p4d_alloc(mm, pgd, addr); 78 if (!p4d) 79 return NULL; 80 81 return pud_alloc(mm, p4d, addr); 82 } 83 84 static pmd_t *alloc_new_pmd(struct mm_struct *mm, struct vm_area_struct *vma, 85 unsigned long addr) 86 { 87 pud_t *pud; 88 pmd_t *pmd; 89 90 pud = alloc_new_pud(mm, vma, addr); 91 if (!pud) 92 return NULL; 93 94 pmd = pmd_alloc(mm, pud, addr); 95 if (!pmd) 96 return NULL; 97 98 VM_BUG_ON(pmd_trans_huge(*pmd)); 99 100 return pmd; 101 } 102 103 static void take_rmap_locks(struct vm_area_struct *vma) 104 { 105 if (vma->vm_file) 106 i_mmap_lock_write(vma->vm_file->f_mapping); 107 if (vma->anon_vma) 108 anon_vma_lock_write(vma->anon_vma); 109 } 110 111 static void drop_rmap_locks(struct vm_area_struct *vma) 112 { 113 if (vma->anon_vma) 114 anon_vma_unlock_write(vma->anon_vma); 115 if (vma->vm_file) 116 i_mmap_unlock_write(vma->vm_file->f_mapping); 117 } 118 119 static pte_t move_soft_dirty_pte(pte_t pte) 120 { 121 /* 122 * Set soft dirty bit so we can notice 123 * in userspace the ptes were moved. 124 */ 125 #ifdef CONFIG_MEM_SOFT_DIRTY 126 if (pte_present(pte)) 127 pte = pte_mksoft_dirty(pte); 128 else if (is_swap_pte(pte)) 129 pte = pte_swp_mksoft_dirty(pte); 130 #endif 131 return pte; 132 } 133 134 static void move_ptes(struct vm_area_struct *vma, pmd_t *old_pmd, 135 unsigned long old_addr, unsigned long old_end, 136 struct vm_area_struct *new_vma, pmd_t *new_pmd, 137 unsigned long new_addr, bool need_rmap_locks) 138 { 139 struct mm_struct *mm = vma->vm_mm; 140 pte_t *old_pte, *new_pte, pte; 141 spinlock_t *old_ptl, *new_ptl; 142 bool force_flush = false; 143 unsigned long len = old_end - old_addr; 144 145 /* 146 * When need_rmap_locks is true, we take the i_mmap_rwsem and anon_vma 147 * locks to ensure that rmap will always observe either the old or the 148 * new ptes. This is the easiest way to avoid races with 149 * truncate_pagecache(), page migration, etc... 150 * 151 * When need_rmap_locks is false, we use other ways to avoid 152 * such races: 153 * 154 * - During exec() shift_arg_pages(), we use a specially tagged vma 155 * which rmap call sites look for using vma_is_temporary_stack(). 156 * 157 * - During mremap(), new_vma is often known to be placed after vma 158 * in rmap traversal order. This ensures rmap will always observe 159 * either the old pte, or the new pte, or both (the page table locks 160 * serialize access to individual ptes, but only rmap traversal 161 * order guarantees that we won't miss both the old and new ptes). 162 */ 163 if (need_rmap_locks) 164 take_rmap_locks(vma); 165 166 /* 167 * We don't have to worry about the ordering of src and dst 168 * pte locks because exclusive mmap_lock prevents deadlock. 169 */ 170 old_pte = pte_offset_map_lock(mm, old_pmd, old_addr, &old_ptl); 171 new_pte = pte_offset_map(new_pmd, new_addr); 172 new_ptl = pte_lockptr(mm, new_pmd); 173 if (new_ptl != old_ptl) 174 spin_lock_nested(new_ptl, SINGLE_DEPTH_NESTING); 175 flush_tlb_batched_pending(vma->vm_mm); 176 arch_enter_lazy_mmu_mode(); 177 178 for (; old_addr < old_end; old_pte++, old_addr += PAGE_SIZE, 179 new_pte++, new_addr += PAGE_SIZE) { 180 if (pte_none(*old_pte)) 181 continue; 182 183 pte = ptep_get_and_clear(mm, old_addr, old_pte); 184 /* 185 * If we are remapping a valid PTE, make sure 186 * to flush TLB before we drop the PTL for the 187 * PTE. 188 * 189 * NOTE! Both old and new PTL matter: the old one 190 * for racing with page_mkclean(), the new one to 191 * make sure the physical page stays valid until 192 * the TLB entry for the old mapping has been 193 * flushed. 194 */ 195 if (pte_present(pte)) 196 force_flush = true; 197 pte = move_pte(pte, new_vma->vm_page_prot, old_addr, new_addr); 198 pte = move_soft_dirty_pte(pte); 199 set_pte_at(mm, new_addr, new_pte, pte); 200 } 201 202 arch_leave_lazy_mmu_mode(); 203 if (force_flush) 204 flush_tlb_range(vma, old_end - len, old_end); 205 if (new_ptl != old_ptl) 206 spin_unlock(new_ptl); 207 pte_unmap(new_pte - 1); 208 pte_unmap_unlock(old_pte - 1, old_ptl); 209 if (need_rmap_locks) 210 drop_rmap_locks(vma); 211 } 212 213 #ifdef CONFIG_HAVE_MOVE_PMD 214 static bool move_normal_pmd(struct vm_area_struct *vma, unsigned long old_addr, 215 unsigned long new_addr, pmd_t *old_pmd, pmd_t *new_pmd) 216 { 217 spinlock_t *old_ptl, *new_ptl; 218 struct mm_struct *mm = vma->vm_mm; 219 pmd_t pmd; 220 221 /* 222 * The destination pmd shouldn't be established, free_pgtables() 223 * should have released it. 224 * 225 * However, there's a case during execve() where we use mremap 226 * to move the initial stack, and in that case the target area 227 * may overlap the source area (always moving down). 228 * 229 * If everything is PMD-aligned, that works fine, as moving 230 * each pmd down will clear the source pmd. But if we first 231 * have a few 4kB-only pages that get moved down, and then 232 * hit the "now the rest is PMD-aligned, let's do everything 233 * one pmd at a time", we will still have the old (now empty 234 * of any 4kB pages, but still there) PMD in the page table 235 * tree. 236 * 237 * Warn on it once - because we really should try to figure 238 * out how to do this better - but then say "I won't move 239 * this pmd". 240 * 241 * One alternative might be to just unmap the target pmd at 242 * this point, and verify that it really is empty. We'll see. 243 */ 244 if (WARN_ON_ONCE(!pmd_none(*new_pmd))) 245 return false; 246 247 /* 248 * We don't have to worry about the ordering of src and dst 249 * ptlocks because exclusive mmap_lock prevents deadlock. 250 */ 251 old_ptl = pmd_lock(vma->vm_mm, old_pmd); 252 new_ptl = pmd_lockptr(mm, new_pmd); 253 if (new_ptl != old_ptl) 254 spin_lock_nested(new_ptl, SINGLE_DEPTH_NESTING); 255 256 /* Clear the pmd */ 257 pmd = *old_pmd; 258 pmd_clear(old_pmd); 259 260 VM_BUG_ON(!pmd_none(*new_pmd)); 261 262 /* Set the new pmd */ 263 set_pmd_at(mm, new_addr, new_pmd, pmd); 264 flush_tlb_range(vma, old_addr, old_addr + PMD_SIZE); 265 if (new_ptl != old_ptl) 266 spin_unlock(new_ptl); 267 spin_unlock(old_ptl); 268 269 return true; 270 } 271 #else 272 static inline bool move_normal_pmd(struct vm_area_struct *vma, 273 unsigned long old_addr, unsigned long new_addr, pmd_t *old_pmd, 274 pmd_t *new_pmd) 275 { 276 return false; 277 } 278 #endif 279 280 #ifdef CONFIG_HAVE_MOVE_PUD 281 static bool move_normal_pud(struct vm_area_struct *vma, unsigned long old_addr, 282 unsigned long new_addr, pud_t *old_pud, pud_t *new_pud) 283 { 284 spinlock_t *old_ptl, *new_ptl; 285 struct mm_struct *mm = vma->vm_mm; 286 pud_t pud; 287 288 /* 289 * The destination pud shouldn't be established, free_pgtables() 290 * should have released it. 291 */ 292 if (WARN_ON_ONCE(!pud_none(*new_pud))) 293 return false; 294 295 /* 296 * We don't have to worry about the ordering of src and dst 297 * ptlocks because exclusive mmap_lock prevents deadlock. 298 */ 299 old_ptl = pud_lock(vma->vm_mm, old_pud); 300 new_ptl = pud_lockptr(mm, new_pud); 301 if (new_ptl != old_ptl) 302 spin_lock_nested(new_ptl, SINGLE_DEPTH_NESTING); 303 304 /* Clear the pud */ 305 pud = *old_pud; 306 pud_clear(old_pud); 307 308 VM_BUG_ON(!pud_none(*new_pud)); 309 310 /* Set the new pud */ 311 set_pud_at(mm, new_addr, new_pud, pud); 312 flush_tlb_range(vma, old_addr, old_addr + PUD_SIZE); 313 if (new_ptl != old_ptl) 314 spin_unlock(new_ptl); 315 spin_unlock(old_ptl); 316 317 return true; 318 } 319 #else 320 static inline bool move_normal_pud(struct vm_area_struct *vma, 321 unsigned long old_addr, unsigned long new_addr, pud_t *old_pud, 322 pud_t *new_pud) 323 { 324 return false; 325 } 326 #endif 327 328 enum pgt_entry { 329 NORMAL_PMD, 330 HPAGE_PMD, 331 NORMAL_PUD, 332 }; 333 334 /* 335 * Returns an extent of the corresponding size for the pgt_entry specified if 336 * valid. Else returns a smaller extent bounded by the end of the source and 337 * destination pgt_entry. 338 */ 339 static unsigned long get_extent(enum pgt_entry entry, unsigned long old_addr, 340 unsigned long old_end, unsigned long new_addr) 341 { 342 unsigned long next, extent, mask, size; 343 344 switch (entry) { 345 case HPAGE_PMD: 346 case NORMAL_PMD: 347 mask = PMD_MASK; 348 size = PMD_SIZE; 349 break; 350 case NORMAL_PUD: 351 mask = PUD_MASK; 352 size = PUD_SIZE; 353 break; 354 default: 355 BUILD_BUG(); 356 break; 357 } 358 359 next = (old_addr + size) & mask; 360 /* even if next overflowed, extent below will be ok */ 361 extent = next - old_addr; 362 if (extent > old_end - old_addr) 363 extent = old_end - old_addr; 364 next = (new_addr + size) & mask; 365 if (extent > next - new_addr) 366 extent = next - new_addr; 367 return extent; 368 } 369 370 /* 371 * Attempts to speedup the move by moving entry at the level corresponding to 372 * pgt_entry. Returns true if the move was successful, else false. 373 */ 374 static bool move_pgt_entry(enum pgt_entry entry, struct vm_area_struct *vma, 375 unsigned long old_addr, unsigned long new_addr, 376 void *old_entry, void *new_entry, bool need_rmap_locks) 377 { 378 bool moved = false; 379 380 /* See comment in move_ptes() */ 381 if (need_rmap_locks) 382 take_rmap_locks(vma); 383 384 switch (entry) { 385 case NORMAL_PMD: 386 moved = move_normal_pmd(vma, old_addr, new_addr, old_entry, 387 new_entry); 388 break; 389 case NORMAL_PUD: 390 moved = move_normal_pud(vma, old_addr, new_addr, old_entry, 391 new_entry); 392 break; 393 case HPAGE_PMD: 394 moved = IS_ENABLED(CONFIG_TRANSPARENT_HUGEPAGE) && 395 move_huge_pmd(vma, old_addr, new_addr, old_entry, 396 new_entry); 397 break; 398 default: 399 WARN_ON_ONCE(1); 400 break; 401 } 402 403 if (need_rmap_locks) 404 drop_rmap_locks(vma); 405 406 return moved; 407 } 408 409 unsigned long move_page_tables(struct vm_area_struct *vma, 410 unsigned long old_addr, struct vm_area_struct *new_vma, 411 unsigned long new_addr, unsigned long len, 412 bool need_rmap_locks) 413 { 414 unsigned long extent, old_end; 415 struct mmu_notifier_range range; 416 pmd_t *old_pmd, *new_pmd; 417 418 old_end = old_addr + len; 419 flush_cache_range(vma, old_addr, old_end); 420 421 mmu_notifier_range_init(&range, MMU_NOTIFY_UNMAP, 0, vma, vma->vm_mm, 422 old_addr, old_end); 423 mmu_notifier_invalidate_range_start(&range); 424 425 for (; old_addr < old_end; old_addr += extent, new_addr += extent) { 426 cond_resched(); 427 /* 428 * If extent is PUD-sized try to speed up the move by moving at the 429 * PUD level if possible. 430 */ 431 extent = get_extent(NORMAL_PUD, old_addr, old_end, new_addr); 432 if (IS_ENABLED(CONFIG_HAVE_MOVE_PUD) && extent == PUD_SIZE) { 433 pud_t *old_pud, *new_pud; 434 435 old_pud = get_old_pud(vma->vm_mm, old_addr); 436 if (!old_pud) 437 continue; 438 new_pud = alloc_new_pud(vma->vm_mm, vma, new_addr); 439 if (!new_pud) 440 break; 441 if (move_pgt_entry(NORMAL_PUD, vma, old_addr, new_addr, 442 old_pud, new_pud, need_rmap_locks)) 443 continue; 444 } 445 446 extent = get_extent(NORMAL_PMD, old_addr, old_end, new_addr); 447 old_pmd = get_old_pmd(vma->vm_mm, old_addr); 448 if (!old_pmd) 449 continue; 450 new_pmd = alloc_new_pmd(vma->vm_mm, vma, new_addr); 451 if (!new_pmd) 452 break; 453 if (is_swap_pmd(*old_pmd) || pmd_trans_huge(*old_pmd) || 454 pmd_devmap(*old_pmd)) { 455 if (extent == HPAGE_PMD_SIZE && 456 move_pgt_entry(HPAGE_PMD, vma, old_addr, new_addr, 457 old_pmd, new_pmd, need_rmap_locks)) 458 continue; 459 split_huge_pmd(vma, old_pmd, old_addr); 460 if (pmd_trans_unstable(old_pmd)) 461 continue; 462 } else if (IS_ENABLED(CONFIG_HAVE_MOVE_PMD) && 463 extent == PMD_SIZE) { 464 /* 465 * If the extent is PMD-sized, try to speed the move by 466 * moving at the PMD level if possible. 467 */ 468 if (move_pgt_entry(NORMAL_PMD, vma, old_addr, new_addr, 469 old_pmd, new_pmd, need_rmap_locks)) 470 continue; 471 } 472 473 if (pte_alloc(new_vma->vm_mm, new_pmd)) 474 break; 475 move_ptes(vma, old_pmd, old_addr, old_addr + extent, new_vma, 476 new_pmd, new_addr, need_rmap_locks); 477 } 478 479 mmu_notifier_invalidate_range_end(&range); 480 481 return len + old_addr - old_end; /* how much done */ 482 } 483 484 static unsigned long move_vma(struct vm_area_struct *vma, 485 unsigned long old_addr, unsigned long old_len, 486 unsigned long new_len, unsigned long new_addr, 487 bool *locked, unsigned long flags, 488 struct vm_userfaultfd_ctx *uf, struct list_head *uf_unmap) 489 { 490 struct mm_struct *mm = vma->vm_mm; 491 struct vm_area_struct *new_vma; 492 unsigned long vm_flags = vma->vm_flags; 493 unsigned long new_pgoff; 494 unsigned long moved_len; 495 unsigned long excess = 0; 496 unsigned long hiwater_vm; 497 int split = 0; 498 int err = 0; 499 bool need_rmap_locks; 500 501 /* 502 * We'd prefer to avoid failure later on in do_munmap: 503 * which may split one vma into three before unmapping. 504 */ 505 if (mm->map_count >= sysctl_max_map_count - 3) 506 return -ENOMEM; 507 508 if (vma->vm_ops && vma->vm_ops->may_split) { 509 if (vma->vm_start != old_addr) 510 err = vma->vm_ops->may_split(vma, old_addr); 511 if (!err && vma->vm_end != old_addr + old_len) 512 err = vma->vm_ops->may_split(vma, old_addr + old_len); 513 if (err) 514 return err; 515 } 516 517 /* 518 * Advise KSM to break any KSM pages in the area to be moved: 519 * it would be confusing if they were to turn up at the new 520 * location, where they happen to coincide with different KSM 521 * pages recently unmapped. But leave vma->vm_flags as it was, 522 * so KSM can come around to merge on vma and new_vma afterwards. 523 */ 524 err = ksm_madvise(vma, old_addr, old_addr + old_len, 525 MADV_UNMERGEABLE, &vm_flags); 526 if (err) 527 return err; 528 529 if (unlikely(flags & MREMAP_DONTUNMAP && vm_flags & VM_ACCOUNT)) { 530 if (security_vm_enough_memory_mm(mm, new_len >> PAGE_SHIFT)) 531 return -ENOMEM; 532 } 533 534 new_pgoff = vma->vm_pgoff + ((old_addr - vma->vm_start) >> PAGE_SHIFT); 535 new_vma = copy_vma(&vma, new_addr, new_len, new_pgoff, 536 &need_rmap_locks); 537 if (!new_vma) { 538 if (unlikely(flags & MREMAP_DONTUNMAP && vm_flags & VM_ACCOUNT)) 539 vm_unacct_memory(new_len >> PAGE_SHIFT); 540 return -ENOMEM; 541 } 542 543 moved_len = move_page_tables(vma, old_addr, new_vma, new_addr, old_len, 544 need_rmap_locks); 545 if (moved_len < old_len) { 546 err = -ENOMEM; 547 } else if (vma->vm_ops && vma->vm_ops->mremap) { 548 err = vma->vm_ops->mremap(new_vma, flags); 549 } 550 551 if (unlikely(err)) { 552 /* 553 * On error, move entries back from new area to old, 554 * which will succeed since page tables still there, 555 * and then proceed to unmap new area instead of old. 556 */ 557 move_page_tables(new_vma, new_addr, vma, old_addr, moved_len, 558 true); 559 vma = new_vma; 560 old_len = new_len; 561 old_addr = new_addr; 562 new_addr = err; 563 } else { 564 mremap_userfaultfd_prep(new_vma, uf); 565 arch_remap(mm, old_addr, old_addr + old_len, 566 new_addr, new_addr + new_len); 567 } 568 569 /* Conceal VM_ACCOUNT so old reservation is not undone */ 570 if (vm_flags & VM_ACCOUNT && !(flags & MREMAP_DONTUNMAP)) { 571 vma->vm_flags &= ~VM_ACCOUNT; 572 excess = vma->vm_end - vma->vm_start - old_len; 573 if (old_addr > vma->vm_start && 574 old_addr + old_len < vma->vm_end) 575 split = 1; 576 } 577 578 /* 579 * If we failed to move page tables we still do total_vm increment 580 * since do_munmap() will decrement it by old_len == new_len. 581 * 582 * Since total_vm is about to be raised artificially high for a 583 * moment, we need to restore high watermark afterwards: if stats 584 * are taken meanwhile, total_vm and hiwater_vm appear too high. 585 * If this were a serious issue, we'd add a flag to do_munmap(). 586 */ 587 hiwater_vm = mm->hiwater_vm; 588 vm_stat_account(mm, vma->vm_flags, new_len >> PAGE_SHIFT); 589 590 /* Tell pfnmap has moved from this vma */ 591 if (unlikely(vma->vm_flags & VM_PFNMAP)) 592 untrack_pfn_moved(vma); 593 594 if (unlikely(!err && (flags & MREMAP_DONTUNMAP))) { 595 /* We always clear VM_LOCKED[ONFAULT] on the old vma */ 596 vma->vm_flags &= VM_LOCKED_CLEAR_MASK; 597 598 /* Because we won't unmap we don't need to touch locked_vm */ 599 return new_addr; 600 } 601 602 if (do_munmap(mm, old_addr, old_len, uf_unmap) < 0) { 603 /* OOM: unable to split vma, just get accounts right */ 604 if (vm_flags & VM_ACCOUNT && !(flags & MREMAP_DONTUNMAP)) 605 vm_acct_memory(new_len >> PAGE_SHIFT); 606 excess = 0; 607 } 608 609 if (vm_flags & VM_LOCKED) { 610 mm->locked_vm += new_len >> PAGE_SHIFT; 611 *locked = true; 612 } 613 614 mm->hiwater_vm = hiwater_vm; 615 616 /* Restore VM_ACCOUNT if one or two pieces of vma left */ 617 if (excess) { 618 vma->vm_flags |= VM_ACCOUNT; 619 if (split) 620 vma->vm_next->vm_flags |= VM_ACCOUNT; 621 } 622 623 return new_addr; 624 } 625 626 static struct vm_area_struct *vma_to_resize(unsigned long addr, 627 unsigned long old_len, unsigned long new_len, unsigned long flags, 628 unsigned long *p) 629 { 630 struct mm_struct *mm = current->mm; 631 struct vm_area_struct *vma = find_vma(mm, addr); 632 unsigned long pgoff; 633 634 if (!vma || vma->vm_start > addr) 635 return ERR_PTR(-EFAULT); 636 637 /* 638 * !old_len is a special case where an attempt is made to 'duplicate' 639 * a mapping. This makes no sense for private mappings as it will 640 * instead create a fresh/new mapping unrelated to the original. This 641 * is contrary to the basic idea of mremap which creates new mappings 642 * based on the original. There are no known use cases for this 643 * behavior. As a result, fail such attempts. 644 */ 645 if (!old_len && !(vma->vm_flags & (VM_SHARED | VM_MAYSHARE))) { 646 pr_warn_once("%s (%d): attempted to duplicate a private mapping with mremap. This is not supported.\n", current->comm, current->pid); 647 return ERR_PTR(-EINVAL); 648 } 649 650 if (flags & MREMAP_DONTUNMAP && (!vma_is_anonymous(vma) || 651 vma->vm_flags & VM_SHARED)) 652 return ERR_PTR(-EINVAL); 653 654 if (is_vm_hugetlb_page(vma)) 655 return ERR_PTR(-EINVAL); 656 657 /* We can't remap across vm area boundaries */ 658 if (old_len > vma->vm_end - addr) 659 return ERR_PTR(-EFAULT); 660 661 if (new_len == old_len) 662 return vma; 663 664 /* Need to be careful about a growing mapping */ 665 pgoff = (addr - vma->vm_start) >> PAGE_SHIFT; 666 pgoff += vma->vm_pgoff; 667 if (pgoff + (new_len >> PAGE_SHIFT) < pgoff) 668 return ERR_PTR(-EINVAL); 669 670 if (vma->vm_flags & (VM_DONTEXPAND | VM_PFNMAP)) 671 return ERR_PTR(-EFAULT); 672 673 if (vma->vm_flags & VM_LOCKED) { 674 unsigned long locked, lock_limit; 675 locked = mm->locked_vm << PAGE_SHIFT; 676 lock_limit = rlimit(RLIMIT_MEMLOCK); 677 locked += new_len - old_len; 678 if (locked > lock_limit && !capable(CAP_IPC_LOCK)) 679 return ERR_PTR(-EAGAIN); 680 } 681 682 if (!may_expand_vm(mm, vma->vm_flags, 683 (new_len - old_len) >> PAGE_SHIFT)) 684 return ERR_PTR(-ENOMEM); 685 686 if (vma->vm_flags & VM_ACCOUNT) { 687 unsigned long charged = (new_len - old_len) >> PAGE_SHIFT; 688 if (security_vm_enough_memory_mm(mm, charged)) 689 return ERR_PTR(-ENOMEM); 690 *p = charged; 691 } 692 693 return vma; 694 } 695 696 static unsigned long mremap_to(unsigned long addr, unsigned long old_len, 697 unsigned long new_addr, unsigned long new_len, bool *locked, 698 unsigned long flags, struct vm_userfaultfd_ctx *uf, 699 struct list_head *uf_unmap_early, 700 struct list_head *uf_unmap) 701 { 702 struct mm_struct *mm = current->mm; 703 struct vm_area_struct *vma; 704 unsigned long ret = -EINVAL; 705 unsigned long charged = 0; 706 unsigned long map_flags = 0; 707 708 if (offset_in_page(new_addr)) 709 goto out; 710 711 if (new_len > TASK_SIZE || new_addr > TASK_SIZE - new_len) 712 goto out; 713 714 /* Ensure the old/new locations do not overlap */ 715 if (addr + old_len > new_addr && new_addr + new_len > addr) 716 goto out; 717 718 /* 719 * move_vma() need us to stay 4 maps below the threshold, otherwise 720 * it will bail out at the very beginning. 721 * That is a problem if we have already unmaped the regions here 722 * (new_addr, and old_addr), because userspace will not know the 723 * state of the vma's after it gets -ENOMEM. 724 * So, to avoid such scenario we can pre-compute if the whole 725 * operation has high chances to success map-wise. 726 * Worst-scenario case is when both vma's (new_addr and old_addr) get 727 * split in 3 before unmaping it. 728 * That means 2 more maps (1 for each) to the ones we already hold. 729 * Check whether current map count plus 2 still leads us to 4 maps below 730 * the threshold, otherwise return -ENOMEM here to be more safe. 731 */ 732 if ((mm->map_count + 2) >= sysctl_max_map_count - 3) 733 return -ENOMEM; 734 735 if (flags & MREMAP_FIXED) { 736 ret = do_munmap(mm, new_addr, new_len, uf_unmap_early); 737 if (ret) 738 goto out; 739 } 740 741 if (old_len >= new_len) { 742 ret = do_munmap(mm, addr+new_len, old_len - new_len, uf_unmap); 743 if (ret && old_len != new_len) 744 goto out; 745 old_len = new_len; 746 } 747 748 vma = vma_to_resize(addr, old_len, new_len, flags, &charged); 749 if (IS_ERR(vma)) { 750 ret = PTR_ERR(vma); 751 goto out; 752 } 753 754 /* MREMAP_DONTUNMAP expands by old_len since old_len == new_len */ 755 if (flags & MREMAP_DONTUNMAP && 756 !may_expand_vm(mm, vma->vm_flags, old_len >> PAGE_SHIFT)) { 757 ret = -ENOMEM; 758 goto out; 759 } 760 761 if (flags & MREMAP_FIXED) 762 map_flags |= MAP_FIXED; 763 764 if (vma->vm_flags & VM_MAYSHARE) 765 map_flags |= MAP_SHARED; 766 767 ret = get_unmapped_area(vma->vm_file, new_addr, new_len, vma->vm_pgoff + 768 ((addr - vma->vm_start) >> PAGE_SHIFT), 769 map_flags); 770 if (IS_ERR_VALUE(ret)) 771 goto out1; 772 773 /* We got a new mapping */ 774 if (!(flags & MREMAP_FIXED)) 775 new_addr = ret; 776 777 ret = move_vma(vma, addr, old_len, new_len, new_addr, locked, flags, uf, 778 uf_unmap); 779 780 if (!(offset_in_page(ret))) 781 goto out; 782 783 out1: 784 vm_unacct_memory(charged); 785 786 out: 787 return ret; 788 } 789 790 static int vma_expandable(struct vm_area_struct *vma, unsigned long delta) 791 { 792 unsigned long end = vma->vm_end + delta; 793 if (end < vma->vm_end) /* overflow */ 794 return 0; 795 if (vma->vm_next && vma->vm_next->vm_start < end) /* intersection */ 796 return 0; 797 if (get_unmapped_area(NULL, vma->vm_start, end - vma->vm_start, 798 0, MAP_FIXED) & ~PAGE_MASK) 799 return 0; 800 return 1; 801 } 802 803 /* 804 * Expand (or shrink) an existing mapping, potentially moving it at the 805 * same time (controlled by the MREMAP_MAYMOVE flag and available VM space) 806 * 807 * MREMAP_FIXED option added 5-Dec-1999 by Benjamin LaHaise 808 * This option implies MREMAP_MAYMOVE. 809 */ 810 SYSCALL_DEFINE5(mremap, unsigned long, addr, unsigned long, old_len, 811 unsigned long, new_len, unsigned long, flags, 812 unsigned long, new_addr) 813 { 814 struct mm_struct *mm = current->mm; 815 struct vm_area_struct *vma; 816 unsigned long ret = -EINVAL; 817 unsigned long charged = 0; 818 bool locked = false; 819 bool downgraded = false; 820 struct vm_userfaultfd_ctx uf = NULL_VM_UFFD_CTX; 821 LIST_HEAD(uf_unmap_early); 822 LIST_HEAD(uf_unmap); 823 824 /* 825 * There is a deliberate asymmetry here: we strip the pointer tag 826 * from the old address but leave the new address alone. This is 827 * for consistency with mmap(), where we prevent the creation of 828 * aliasing mappings in userspace by leaving the tag bits of the 829 * mapping address intact. A non-zero tag will cause the subsequent 830 * range checks to reject the address as invalid. 831 * 832 * See Documentation/arm64/tagged-address-abi.rst for more information. 833 */ 834 addr = untagged_addr(addr); 835 836 if (flags & ~(MREMAP_FIXED | MREMAP_MAYMOVE | MREMAP_DONTUNMAP)) 837 return ret; 838 839 if (flags & MREMAP_FIXED && !(flags & MREMAP_MAYMOVE)) 840 return ret; 841 842 /* 843 * MREMAP_DONTUNMAP is always a move and it does not allow resizing 844 * in the process. 845 */ 846 if (flags & MREMAP_DONTUNMAP && 847 (!(flags & MREMAP_MAYMOVE) || old_len != new_len)) 848 return ret; 849 850 851 if (offset_in_page(addr)) 852 return ret; 853 854 old_len = PAGE_ALIGN(old_len); 855 new_len = PAGE_ALIGN(new_len); 856 857 /* 858 * We allow a zero old-len as a special case 859 * for DOS-emu "duplicate shm area" thing. But 860 * a zero new-len is nonsensical. 861 */ 862 if (!new_len) 863 return ret; 864 865 if (mmap_write_lock_killable(current->mm)) 866 return -EINTR; 867 868 if (flags & (MREMAP_FIXED | MREMAP_DONTUNMAP)) { 869 ret = mremap_to(addr, old_len, new_addr, new_len, 870 &locked, flags, &uf, &uf_unmap_early, 871 &uf_unmap); 872 goto out; 873 } 874 875 /* 876 * Always allow a shrinking remap: that just unmaps 877 * the unnecessary pages.. 878 * __do_munmap does all the needed commit accounting, and 879 * downgrades mmap_lock to read if so directed. 880 */ 881 if (old_len >= new_len) { 882 int retval; 883 884 retval = __do_munmap(mm, addr+new_len, old_len - new_len, 885 &uf_unmap, true); 886 if (retval < 0 && old_len != new_len) { 887 ret = retval; 888 goto out; 889 /* Returning 1 indicates mmap_lock is downgraded to read. */ 890 } else if (retval == 1) 891 downgraded = true; 892 ret = addr; 893 goto out; 894 } 895 896 /* 897 * Ok, we need to grow.. 898 */ 899 vma = vma_to_resize(addr, old_len, new_len, flags, &charged); 900 if (IS_ERR(vma)) { 901 ret = PTR_ERR(vma); 902 goto out; 903 } 904 905 /* old_len exactly to the end of the area.. 906 */ 907 if (old_len == vma->vm_end - addr) { 908 /* can we just expand the current mapping? */ 909 if (vma_expandable(vma, new_len - old_len)) { 910 int pages = (new_len - old_len) >> PAGE_SHIFT; 911 912 if (vma_adjust(vma, vma->vm_start, addr + new_len, 913 vma->vm_pgoff, NULL)) { 914 ret = -ENOMEM; 915 goto out; 916 } 917 918 vm_stat_account(mm, vma->vm_flags, pages); 919 if (vma->vm_flags & VM_LOCKED) { 920 mm->locked_vm += pages; 921 locked = true; 922 new_addr = addr; 923 } 924 ret = addr; 925 goto out; 926 } 927 } 928 929 /* 930 * We weren't able to just expand or shrink the area, 931 * we need to create a new one and move it.. 932 */ 933 ret = -ENOMEM; 934 if (flags & MREMAP_MAYMOVE) { 935 unsigned long map_flags = 0; 936 if (vma->vm_flags & VM_MAYSHARE) 937 map_flags |= MAP_SHARED; 938 939 new_addr = get_unmapped_area(vma->vm_file, 0, new_len, 940 vma->vm_pgoff + 941 ((addr - vma->vm_start) >> PAGE_SHIFT), 942 map_flags); 943 if (IS_ERR_VALUE(new_addr)) { 944 ret = new_addr; 945 goto out; 946 } 947 948 ret = move_vma(vma, addr, old_len, new_len, new_addr, 949 &locked, flags, &uf, &uf_unmap); 950 } 951 out: 952 if (offset_in_page(ret)) { 953 vm_unacct_memory(charged); 954 locked = false; 955 } 956 if (downgraded) 957 mmap_read_unlock(current->mm); 958 else 959 mmap_write_unlock(current->mm); 960 if (locked && new_len > old_len) 961 mm_populate(new_addr + old_len, new_len - old_len); 962 userfaultfd_unmap_complete(mm, &uf_unmap_early); 963 mremap_userfaultfd_complete(&uf, addr, ret, old_len); 964 userfaultfd_unmap_complete(mm, &uf_unmap); 965 return ret; 966 } 967