mremap.c 15 KB

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