mremap.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603
  1. /*
  2. * mm/mremap.c
  3. *
  4. * (C) Copyright 1996 Linus Torvalds
  5. *
  6. * Address space accounting code <[email protected]>
  7. * (C) Copyright 2002 Red Hat Inc, All Rights Reserved
  8. */
  9. #include <linux/mm.h>
  10. #include <linux/hugetlb.h>
  11. #include <linux/shm.h>
  12. #include <linux/ksm.h>
  13. #include <linux/mman.h>
  14. #include <linux/swap.h>
  15. #include <linux/capability.h>
  16. #include <linux/fs.h>
  17. #include <linux/swapops.h>
  18. #include <linux/highmem.h>
  19. #include <linux/security.h>
  20. #include <linux/syscalls.h>
  21. #include <linux/mmu_notifier.h>
  22. #include <linux/uaccess.h>
  23. #include <linux/mm-arch-hooks.h>
  24. #include <asm/cacheflush.h>
  25. #include <asm/tlbflush.h>
  26. #include "internal.h"
  27. static pmd_t *get_old_pmd(struct mm_struct *mm, unsigned long addr)
  28. {
  29. pgd_t *pgd;
  30. pud_t *pud;
  31. pmd_t *pmd;
  32. pgd = pgd_offset(mm, addr);
  33. if (pgd_none_or_clear_bad(pgd))
  34. return NULL;
  35. pud = pud_offset(pgd, addr);
  36. if (pud_none_or_clear_bad(pud))
  37. return NULL;
  38. pmd = pmd_offset(pud, addr);
  39. if (pmd_none(*pmd))
  40. return NULL;
  41. return pmd;
  42. }
  43. static pmd_t *alloc_new_pmd(struct mm_struct *mm, struct vm_area_struct *vma,
  44. unsigned long addr)
  45. {
  46. pgd_t *pgd;
  47. pud_t *pud;
  48. pmd_t *pmd;
  49. pgd = pgd_offset(mm, addr);
  50. pud = pud_alloc(mm, pgd, addr);
  51. if (!pud)
  52. return NULL;
  53. pmd = pmd_alloc(mm, pud, addr);
  54. if (!pmd)
  55. return NULL;
  56. VM_BUG_ON(pmd_trans_huge(*pmd));
  57. return pmd;
  58. }
  59. static void take_rmap_locks(struct vm_area_struct *vma)
  60. {
  61. if (vma->vm_file)
  62. i_mmap_lock_write(vma->vm_file->f_mapping);
  63. if (vma->anon_vma)
  64. anon_vma_lock_write(vma->anon_vma);
  65. }
  66. static void drop_rmap_locks(struct vm_area_struct *vma)
  67. {
  68. if (vma->anon_vma)
  69. anon_vma_unlock_write(vma->anon_vma);
  70. if (vma->vm_file)
  71. i_mmap_unlock_write(vma->vm_file->f_mapping);
  72. }
  73. static pte_t move_soft_dirty_pte(pte_t pte)
  74. {
  75. /*
  76. * Set soft dirty bit so we can notice
  77. * in userspace the ptes were moved.
  78. */
  79. #ifdef CONFIG_MEM_SOFT_DIRTY
  80. if (pte_present(pte))
  81. pte = pte_mksoft_dirty(pte);
  82. else if (is_swap_pte(pte))
  83. pte = pte_swp_mksoft_dirty(pte);
  84. #endif
  85. return pte;
  86. }
  87. static void move_ptes(struct vm_area_struct *vma, pmd_t *old_pmd,
  88. unsigned long old_addr, unsigned long old_end,
  89. struct vm_area_struct *new_vma, pmd_t *new_pmd,
  90. unsigned long new_addr, bool need_rmap_locks)
  91. {
  92. struct mm_struct *mm = vma->vm_mm;
  93. pte_t *old_pte, *new_pte, pte;
  94. spinlock_t *old_ptl, *new_ptl;
  95. bool force_flush = false;
  96. unsigned long len = old_end - old_addr;
  97. /*
  98. * When need_rmap_locks is true, we take the i_mmap_rwsem and anon_vma
  99. * locks to ensure that rmap will always observe either the old or the
  100. * new ptes. This is the easiest way to avoid races with
  101. * truncate_pagecache(), page migration, etc...
  102. *
  103. * When need_rmap_locks is false, we use other ways to avoid
  104. * such races:
  105. *
  106. * - During exec() shift_arg_pages(), we use a specially tagged vma
  107. * which rmap call sites look for using is_vma_temporary_stack().
  108. *
  109. * - During mremap(), new_vma is often known to be placed after vma
  110. * in rmap traversal order. This ensures rmap will always observe
  111. * either the old pte, or the new pte, or both (the page table locks
  112. * serialize access to individual ptes, but only rmap traversal
  113. * order guarantees that we won't miss both the old and new ptes).
  114. */
  115. if (need_rmap_locks)
  116. take_rmap_locks(vma);
  117. /*
  118. * We don't have to worry about the ordering of src and dst
  119. * pte locks because exclusive mmap_sem prevents deadlock.
  120. */
  121. old_pte = pte_offset_map_lock(mm, old_pmd, old_addr, &old_ptl);
  122. new_pte = pte_offset_map(new_pmd, new_addr);
  123. new_ptl = pte_lockptr(mm, new_pmd);
  124. if (new_ptl != old_ptl)
  125. spin_lock_nested(new_ptl, SINGLE_DEPTH_NESTING);
  126. flush_tlb_batched_pending(vma->vm_mm);
  127. arch_enter_lazy_mmu_mode();
  128. for (; old_addr < old_end; old_pte++, old_addr += PAGE_SIZE,
  129. new_pte++, new_addr += PAGE_SIZE) {
  130. if (pte_none(*old_pte))
  131. continue;
  132. pte = ptep_get_and_clear(mm, old_addr, old_pte);
  133. /*
  134. * If we are remapping a valid PTE, make sure
  135. * to flush TLB before we drop the PTL for the
  136. * PTE.
  137. *
  138. * NOTE! Both old and new PTL matter: the old one
  139. * for racing with page_mkclean(), the new one to
  140. * make sure the physical page stays valid until
  141. * the TLB entry for the old mapping has been
  142. * flushed.
  143. */
  144. if (pte_present(pte))
  145. force_flush = true;
  146. pte = move_pte(pte, new_vma->vm_page_prot, old_addr, new_addr);
  147. pte = move_soft_dirty_pte(pte);
  148. set_pte_at(mm, new_addr, new_pte, pte);
  149. }
  150. arch_leave_lazy_mmu_mode();
  151. if (force_flush)
  152. flush_tlb_range(vma, old_end - len, old_end);
  153. if (new_ptl != old_ptl)
  154. spin_unlock(new_ptl);
  155. pte_unmap(new_pte - 1);
  156. pte_unmap_unlock(old_pte - 1, old_ptl);
  157. if (need_rmap_locks)
  158. drop_rmap_locks(vma);
  159. }
  160. #define LATENCY_LIMIT (64 * PAGE_SIZE)
  161. unsigned long move_page_tables(struct vm_area_struct *vma,
  162. unsigned long old_addr, struct vm_area_struct *new_vma,
  163. unsigned long new_addr, unsigned long len,
  164. bool need_rmap_locks)
  165. {
  166. unsigned long extent, next, old_end;
  167. pmd_t *old_pmd, *new_pmd;
  168. unsigned long mmun_start; /* For mmu_notifiers */
  169. unsigned long mmun_end; /* For mmu_notifiers */
  170. old_end = old_addr + len;
  171. flush_cache_range(vma, old_addr, old_end);
  172. mmun_start = old_addr;
  173. mmun_end = old_end;
  174. mmu_notifier_invalidate_range_start(vma->vm_mm, mmun_start, mmun_end);
  175. for (; old_addr < old_end; old_addr += extent, new_addr += extent) {
  176. cond_resched();
  177. next = (old_addr + PMD_SIZE) & PMD_MASK;
  178. /* even if next overflowed, extent below will be ok */
  179. extent = next - old_addr;
  180. if (extent > old_end - old_addr)
  181. extent = old_end - old_addr;
  182. old_pmd = get_old_pmd(vma->vm_mm, old_addr);
  183. if (!old_pmd)
  184. continue;
  185. new_pmd = alloc_new_pmd(vma->vm_mm, vma, new_addr);
  186. if (!new_pmd)
  187. break;
  188. if (pmd_trans_huge(*old_pmd)) {
  189. if (extent == HPAGE_PMD_SIZE) {
  190. bool moved;
  191. /* See comment in move_ptes() */
  192. if (need_rmap_locks)
  193. take_rmap_locks(vma);
  194. moved = move_huge_pmd(vma, old_addr, new_addr,
  195. old_end, old_pmd, new_pmd);
  196. if (need_rmap_locks)
  197. drop_rmap_locks(vma);
  198. if (moved)
  199. continue;
  200. }
  201. split_huge_pmd(vma, old_pmd, old_addr);
  202. if (pmd_trans_unstable(old_pmd))
  203. continue;
  204. }
  205. if (pte_alloc(new_vma->vm_mm, new_pmd, new_addr))
  206. break;
  207. next = (new_addr + PMD_SIZE) & PMD_MASK;
  208. if (extent > next - new_addr)
  209. extent = next - new_addr;
  210. if (extent > LATENCY_LIMIT)
  211. extent = LATENCY_LIMIT;
  212. move_ptes(vma, old_pmd, old_addr, old_addr + extent, new_vma,
  213. new_pmd, new_addr, need_rmap_locks);
  214. }
  215. mmu_notifier_invalidate_range_end(vma->vm_mm, mmun_start, mmun_end);
  216. return len + old_addr - old_end; /* how much done */
  217. }
  218. static unsigned long move_vma(struct vm_area_struct *vma,
  219. unsigned long old_addr, unsigned long old_len,
  220. unsigned long new_len, unsigned long new_addr, bool *locked)
  221. {
  222. struct mm_struct *mm = vma->vm_mm;
  223. struct vm_area_struct *new_vma;
  224. unsigned long vm_flags = vma->vm_flags;
  225. unsigned long new_pgoff;
  226. unsigned long moved_len;
  227. unsigned long excess = 0;
  228. unsigned long hiwater_vm;
  229. int split = 0;
  230. int err;
  231. bool need_rmap_locks;
  232. /*
  233. * We'd prefer to avoid failure later on in do_munmap:
  234. * which may split one vma into three before unmapping.
  235. */
  236. if (mm->map_count >= sysctl_max_map_count - 3)
  237. return -ENOMEM;
  238. /*
  239. * Advise KSM to break any KSM pages in the area to be moved:
  240. * it would be confusing if they were to turn up at the new
  241. * location, where they happen to coincide with different KSM
  242. * pages recently unmapped. But leave vma->vm_flags as it was,
  243. * so KSM can come around to merge on vma and new_vma afterwards.
  244. */
  245. err = ksm_madvise(vma, old_addr, old_addr + old_len,
  246. MADV_UNMERGEABLE, &vm_flags);
  247. if (err)
  248. return err;
  249. new_pgoff = vma->vm_pgoff + ((old_addr - vma->vm_start) >> PAGE_SHIFT);
  250. new_vma = copy_vma(&vma, new_addr, new_len, new_pgoff,
  251. &need_rmap_locks);
  252. if (!new_vma)
  253. return -ENOMEM;
  254. moved_len = move_page_tables(vma, old_addr, new_vma, new_addr, old_len,
  255. need_rmap_locks);
  256. if (moved_len < old_len) {
  257. err = -ENOMEM;
  258. } else if (vma->vm_ops && vma->vm_ops->mremap) {
  259. err = vma->vm_ops->mremap(new_vma);
  260. }
  261. if (unlikely(err)) {
  262. /*
  263. * On error, move entries back from new area to old,
  264. * which will succeed since page tables still there,
  265. * and then proceed to unmap new area instead of old.
  266. */
  267. move_page_tables(new_vma, new_addr, vma, old_addr, moved_len,
  268. true);
  269. vma = new_vma;
  270. old_len = new_len;
  271. old_addr = new_addr;
  272. new_addr = err;
  273. } else {
  274. arch_remap(mm, old_addr, old_addr + old_len,
  275. new_addr, new_addr + new_len);
  276. }
  277. /* Conceal VM_ACCOUNT so old reservation is not undone */
  278. if (vm_flags & VM_ACCOUNT) {
  279. vma->vm_flags &= ~VM_ACCOUNT;
  280. excess = vma->vm_end - vma->vm_start - old_len;
  281. if (old_addr > vma->vm_start &&
  282. old_addr + old_len < vma->vm_end)
  283. split = 1;
  284. }
  285. /*
  286. * If we failed to move page tables we still do total_vm increment
  287. * since do_munmap() will decrement it by old_len == new_len.
  288. *
  289. * Since total_vm is about to be raised artificially high for a
  290. * moment, we need to restore high watermark afterwards: if stats
  291. * are taken meanwhile, total_vm and hiwater_vm appear too high.
  292. * If this were a serious issue, we'd add a flag to do_munmap().
  293. */
  294. hiwater_vm = mm->hiwater_vm;
  295. vm_stat_account(mm, vma->vm_flags, new_len >> PAGE_SHIFT);
  296. /* Tell pfnmap has moved from this vma */
  297. if (unlikely(vma->vm_flags & VM_PFNMAP))
  298. untrack_pfn_moved(vma);
  299. if (do_munmap(mm, old_addr, old_len) < 0) {
  300. /* OOM: unable to split vma, just get accounts right */
  301. vm_unacct_memory(excess >> PAGE_SHIFT);
  302. excess = 0;
  303. }
  304. mm->hiwater_vm = hiwater_vm;
  305. /* Restore VM_ACCOUNT if one or two pieces of vma left */
  306. if (excess) {
  307. vma->vm_flags |= VM_ACCOUNT;
  308. if (split)
  309. vma->vm_next->vm_flags |= VM_ACCOUNT;
  310. }
  311. if (vm_flags & VM_LOCKED) {
  312. mm->locked_vm += new_len >> PAGE_SHIFT;
  313. *locked = true;
  314. }
  315. return new_addr;
  316. }
  317. static struct vm_area_struct *vma_to_resize(unsigned long addr,
  318. unsigned long old_len, unsigned long new_len, unsigned long *p)
  319. {
  320. struct mm_struct *mm = current->mm;
  321. struct vm_area_struct *vma = find_vma(mm, addr);
  322. unsigned long pgoff;
  323. if (!vma || vma->vm_start > addr)
  324. return ERR_PTR(-EFAULT);
  325. if (is_vm_hugetlb_page(vma))
  326. return ERR_PTR(-EINVAL);
  327. /* We can't remap across vm area boundaries */
  328. if (old_len > vma->vm_end - addr)
  329. return ERR_PTR(-EFAULT);
  330. if (new_len == old_len)
  331. return vma;
  332. /* Need to be careful about a growing mapping */
  333. pgoff = (addr - vma->vm_start) >> PAGE_SHIFT;
  334. pgoff += vma->vm_pgoff;
  335. if (pgoff + (new_len >> PAGE_SHIFT) < pgoff)
  336. return ERR_PTR(-EINVAL);
  337. if (vma->vm_flags & (VM_DONTEXPAND | VM_PFNMAP))
  338. return ERR_PTR(-EFAULT);
  339. if (vma->vm_flags & VM_LOCKED) {
  340. unsigned long locked, lock_limit;
  341. locked = mm->locked_vm << PAGE_SHIFT;
  342. lock_limit = rlimit(RLIMIT_MEMLOCK);
  343. locked += new_len - old_len;
  344. if (locked > lock_limit && !capable(CAP_IPC_LOCK))
  345. return ERR_PTR(-EAGAIN);
  346. }
  347. if (!may_expand_vm(mm, vma->vm_flags,
  348. (new_len - old_len) >> PAGE_SHIFT))
  349. return ERR_PTR(-ENOMEM);
  350. if (vma->vm_flags & VM_ACCOUNT) {
  351. unsigned long charged = (new_len - old_len) >> PAGE_SHIFT;
  352. if (security_vm_enough_memory_mm(mm, charged))
  353. return ERR_PTR(-ENOMEM);
  354. *p = charged;
  355. }
  356. return vma;
  357. }
  358. static unsigned long mremap_to(unsigned long addr, unsigned long old_len,
  359. unsigned long new_addr, unsigned long new_len, bool *locked)
  360. {
  361. struct mm_struct *mm = current->mm;
  362. struct vm_area_struct *vma;
  363. unsigned long ret = -EINVAL;
  364. unsigned long charged = 0;
  365. unsigned long map_flags;
  366. if (offset_in_page(new_addr))
  367. goto out;
  368. if (new_len > TASK_SIZE || new_addr > TASK_SIZE - new_len)
  369. goto out;
  370. /* Ensure the old/new locations do not overlap */
  371. if (addr + old_len > new_addr && new_addr + new_len > addr)
  372. goto out;
  373. ret = do_munmap(mm, new_addr, new_len);
  374. if (ret)
  375. goto out;
  376. if (old_len >= new_len) {
  377. ret = do_munmap(mm, addr+new_len, old_len - new_len);
  378. if (ret && old_len != new_len)
  379. goto out;
  380. old_len = new_len;
  381. }
  382. vma = vma_to_resize(addr, old_len, new_len, &charged);
  383. if (IS_ERR(vma)) {
  384. ret = PTR_ERR(vma);
  385. goto out;
  386. }
  387. map_flags = MAP_FIXED;
  388. if (vma->vm_flags & VM_MAYSHARE)
  389. map_flags |= MAP_SHARED;
  390. ret = get_unmapped_area(vma->vm_file, new_addr, new_len, vma->vm_pgoff +
  391. ((addr - vma->vm_start) >> PAGE_SHIFT),
  392. map_flags);
  393. if (offset_in_page(ret))
  394. goto out1;
  395. ret = move_vma(vma, addr, old_len, new_len, new_addr, locked);
  396. if (!(offset_in_page(ret)))
  397. goto out;
  398. out1:
  399. vm_unacct_memory(charged);
  400. out:
  401. return ret;
  402. }
  403. static int vma_expandable(struct vm_area_struct *vma, unsigned long delta)
  404. {
  405. unsigned long end = vma->vm_end + delta;
  406. if (end < vma->vm_end) /* overflow */
  407. return 0;
  408. if (vma->vm_next && vma->vm_next->vm_start < end) /* intersection */
  409. return 0;
  410. if (get_unmapped_area(NULL, vma->vm_start, end - vma->vm_start,
  411. 0, MAP_FIXED) & ~PAGE_MASK)
  412. return 0;
  413. return 1;
  414. }
  415. /*
  416. * Expand (or shrink) an existing mapping, potentially moving it at the
  417. * same time (controlled by the MREMAP_MAYMOVE flag and available VM space)
  418. *
  419. * MREMAP_FIXED option added 5-Dec-1999 by Benjamin LaHaise
  420. * This option implies MREMAP_MAYMOVE.
  421. */
  422. SYSCALL_DEFINE5(mremap, unsigned long, addr, unsigned long, old_len,
  423. unsigned long, new_len, unsigned long, flags,
  424. unsigned long, new_addr)
  425. {
  426. struct mm_struct *mm = current->mm;
  427. struct vm_area_struct *vma;
  428. unsigned long ret = -EINVAL;
  429. unsigned long charged = 0;
  430. bool locked = false;
  431. if (flags & ~(MREMAP_FIXED | MREMAP_MAYMOVE))
  432. return ret;
  433. if (flags & MREMAP_FIXED && !(flags & MREMAP_MAYMOVE))
  434. return ret;
  435. if (offset_in_page(addr))
  436. return ret;
  437. old_len = PAGE_ALIGN(old_len);
  438. new_len = PAGE_ALIGN(new_len);
  439. /*
  440. * We allow a zero old-len as a special case
  441. * for DOS-emu "duplicate shm area" thing. But
  442. * a zero new-len is nonsensical.
  443. */
  444. if (!new_len)
  445. return ret;
  446. if (down_write_killable(&current->mm->mmap_sem))
  447. return -EINTR;
  448. if (flags & MREMAP_FIXED) {
  449. ret = mremap_to(addr, old_len, new_addr, new_len,
  450. &locked);
  451. goto out;
  452. }
  453. /*
  454. * Always allow a shrinking remap: that just unmaps
  455. * the unnecessary pages..
  456. * do_munmap does all the needed commit accounting
  457. */
  458. if (old_len >= new_len) {
  459. ret = do_munmap(mm, addr+new_len, old_len - new_len);
  460. if (ret && old_len != new_len)
  461. goto out;
  462. ret = addr;
  463. goto out;
  464. }
  465. /*
  466. * Ok, we need to grow..
  467. */
  468. vma = vma_to_resize(addr, old_len, new_len, &charged);
  469. if (IS_ERR(vma)) {
  470. ret = PTR_ERR(vma);
  471. goto out;
  472. }
  473. /* old_len exactly to the end of the area..
  474. */
  475. if (old_len == vma->vm_end - addr) {
  476. /* can we just expand the current mapping? */
  477. if (vma_expandable(vma, new_len - old_len)) {
  478. int pages = (new_len - old_len) >> PAGE_SHIFT;
  479. if (vma_adjust(vma, vma->vm_start, addr + new_len,
  480. vma->vm_pgoff, NULL)) {
  481. ret = -ENOMEM;
  482. goto out;
  483. }
  484. vm_stat_account(mm, vma->vm_flags, pages);
  485. if (vma->vm_flags & VM_LOCKED) {
  486. mm->locked_vm += pages;
  487. locked = true;
  488. new_addr = addr;
  489. }
  490. ret = addr;
  491. goto out;
  492. }
  493. }
  494. /*
  495. * We weren't able to just expand or shrink the area,
  496. * we need to create a new one and move it..
  497. */
  498. ret = -ENOMEM;
  499. if (flags & MREMAP_MAYMOVE) {
  500. unsigned long map_flags = 0;
  501. if (vma->vm_flags & VM_MAYSHARE)
  502. map_flags |= MAP_SHARED;
  503. new_addr = get_unmapped_area(vma->vm_file, 0, new_len,
  504. vma->vm_pgoff +
  505. ((addr - vma->vm_start) >> PAGE_SHIFT),
  506. map_flags);
  507. if (offset_in_page(new_addr)) {
  508. ret = new_addr;
  509. goto out;
  510. }
  511. ret = move_vma(vma, addr, old_len, new_len, new_addr, &locked);
  512. }
  513. out:
  514. if (offset_in_page(ret)) {
  515. vm_unacct_memory(charged);
  516. locked = 0;
  517. }
  518. up_write(&current->mm->mmap_sem);
  519. if (locked && new_len > old_len)
  520. mm_populate(new_addr + old_len, new_len - old_len);
  521. return ret;
  522. }