mremap.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532
  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/highmem.h>
  18. #include <linux/security.h>
  19. #include <linux/syscalls.h>
  20. #include <linux/mmu_notifier.h>
  21. #include <asm/uaccess.h>
  22. #include <asm/cacheflush.h>
  23. #include <asm/tlbflush.h>
  24. #include "internal.h"
  25. static pmd_t *get_old_pmd(struct mm_struct *mm, unsigned long addr)
  26. {
  27. pgd_t *pgd;
  28. pud_t *pud;
  29. pmd_t *pmd;
  30. pgd = pgd_offset(mm, addr);
  31. if (pgd_none_or_clear_bad(pgd))
  32. return NULL;
  33. pud = pud_offset(pgd, addr);
  34. if (pud_none_or_clear_bad(pud))
  35. return NULL;
  36. pmd = pmd_offset(pud, addr);
  37. if (pmd_none(*pmd))
  38. return NULL;
  39. return pmd;
  40. }
  41. static pmd_t *alloc_new_pmd(struct mm_struct *mm, struct vm_area_struct *vma,
  42. unsigned long addr)
  43. {
  44. pgd_t *pgd;
  45. pud_t *pud;
  46. pmd_t *pmd;
  47. pgd = pgd_offset(mm, addr);
  48. pud = pud_alloc(mm, pgd, addr);
  49. if (!pud)
  50. return NULL;
  51. pmd = pmd_alloc(mm, pud, addr);
  52. if (!pmd)
  53. return NULL;
  54. VM_BUG_ON(pmd_trans_huge(*pmd));
  55. return pmd;
  56. }
  57. static void move_ptes(struct vm_area_struct *vma, pmd_t *old_pmd,
  58. unsigned long old_addr, unsigned long old_end,
  59. struct vm_area_struct *new_vma, pmd_t *new_pmd,
  60. unsigned long new_addr)
  61. {
  62. struct address_space *mapping = NULL;
  63. struct anon_vma *anon_vma = vma->anon_vma;
  64. struct mm_struct *mm = vma->vm_mm;
  65. pte_t *old_pte, *new_pte, pte;
  66. spinlock_t *old_ptl, *new_ptl;
  67. if (vma->vm_file) {
  68. /*
  69. * Subtle point from Rajesh Venkatasubramanian: before
  70. * moving file-based ptes, we must lock truncate_pagecache
  71. * out, since it might clean the dst vma before the src vma,
  72. * and we propagate stale pages into the dst afterward.
  73. */
  74. mapping = vma->vm_file->f_mapping;
  75. mutex_lock(&mapping->i_mmap_mutex);
  76. }
  77. if (anon_vma)
  78. anon_vma_lock(anon_vma);
  79. /*
  80. * We don't have to worry about the ordering of src and dst
  81. * pte locks because exclusive mmap_sem prevents deadlock.
  82. */
  83. old_pte = pte_offset_map_lock(mm, old_pmd, old_addr, &old_ptl);
  84. new_pte = pte_offset_map(new_pmd, new_addr);
  85. new_ptl = pte_lockptr(mm, new_pmd);
  86. if (new_ptl != old_ptl)
  87. spin_lock_nested(new_ptl, SINGLE_DEPTH_NESTING);
  88. arch_enter_lazy_mmu_mode();
  89. for (; old_addr < old_end; old_pte++, old_addr += PAGE_SIZE,
  90. new_pte++, new_addr += PAGE_SIZE) {
  91. if (pte_none(*old_pte))
  92. continue;
  93. pte = ptep_get_and_clear(mm, old_addr, old_pte);
  94. pte = move_pte(pte, new_vma->vm_page_prot, old_addr, new_addr);
  95. set_pte_at(mm, new_addr, new_pte, pte);
  96. }
  97. arch_leave_lazy_mmu_mode();
  98. if (new_ptl != old_ptl)
  99. spin_unlock(new_ptl);
  100. pte_unmap(new_pte - 1);
  101. pte_unmap_unlock(old_pte - 1, old_ptl);
  102. if (anon_vma)
  103. anon_vma_unlock(anon_vma);
  104. if (mapping)
  105. mutex_unlock(&mapping->i_mmap_mutex);
  106. }
  107. #define LATENCY_LIMIT (64 * PAGE_SIZE)
  108. unsigned long move_page_tables(struct vm_area_struct *vma,
  109. unsigned long old_addr, struct vm_area_struct *new_vma,
  110. unsigned long new_addr, unsigned long len)
  111. {
  112. unsigned long extent, next, old_end;
  113. pmd_t *old_pmd, *new_pmd;
  114. bool need_flush = false;
  115. old_end = old_addr + len;
  116. flush_cache_range(vma, old_addr, old_end);
  117. mmu_notifier_invalidate_range_start(vma->vm_mm, old_addr, old_end);
  118. for (; old_addr < old_end; old_addr += extent, new_addr += extent) {
  119. cond_resched();
  120. next = (old_addr + PMD_SIZE) & PMD_MASK;
  121. /* even if next overflowed, extent below will be ok */
  122. extent = next - old_addr;
  123. if (extent > old_end - old_addr)
  124. extent = old_end - old_addr;
  125. old_pmd = get_old_pmd(vma->vm_mm, old_addr);
  126. if (!old_pmd)
  127. continue;
  128. new_pmd = alloc_new_pmd(vma->vm_mm, vma, new_addr);
  129. if (!new_pmd)
  130. break;
  131. if (pmd_trans_huge(*old_pmd)) {
  132. int err = 0;
  133. if (extent == HPAGE_PMD_SIZE)
  134. err = move_huge_pmd(vma, new_vma, old_addr,
  135. new_addr, old_end,
  136. old_pmd, new_pmd);
  137. if (err > 0) {
  138. need_flush = true;
  139. continue;
  140. } else if (!err) {
  141. split_huge_page_pmd(vma->vm_mm, old_pmd);
  142. }
  143. VM_BUG_ON(pmd_trans_huge(*old_pmd));
  144. }
  145. if (pmd_none(*new_pmd) && __pte_alloc(new_vma->vm_mm, new_vma,
  146. new_pmd, new_addr))
  147. break;
  148. next = (new_addr + PMD_SIZE) & PMD_MASK;
  149. if (extent > next - new_addr)
  150. extent = next - new_addr;
  151. if (extent > LATENCY_LIMIT)
  152. extent = LATENCY_LIMIT;
  153. move_ptes(vma, old_pmd, old_addr, old_addr + extent,
  154. new_vma, new_pmd, new_addr);
  155. need_flush = true;
  156. }
  157. if (likely(need_flush))
  158. flush_tlb_range(vma, old_end-len, old_addr);
  159. mmu_notifier_invalidate_range_end(vma->vm_mm, old_end-len, old_end);
  160. return len + old_addr - old_end; /* how much done */
  161. }
  162. static unsigned long move_vma(struct vm_area_struct *vma,
  163. unsigned long old_addr, unsigned long old_len,
  164. unsigned long new_len, unsigned long new_addr)
  165. {
  166. struct mm_struct *mm = vma->vm_mm;
  167. struct vm_area_struct *new_vma;
  168. unsigned long vm_flags = vma->vm_flags;
  169. unsigned long new_pgoff;
  170. unsigned long moved_len;
  171. unsigned long excess = 0;
  172. unsigned long hiwater_vm;
  173. int split = 0;
  174. int err;
  175. /*
  176. * We'd prefer to avoid failure later on in do_munmap:
  177. * which may split one vma into three before unmapping.
  178. */
  179. if (mm->map_count >= sysctl_max_map_count - 3)
  180. return -ENOMEM;
  181. /*
  182. * Advise KSM to break any KSM pages in the area to be moved:
  183. * it would be confusing if they were to turn up at the new
  184. * location, where they happen to coincide with different KSM
  185. * pages recently unmapped. But leave vma->vm_flags as it was,
  186. * so KSM can come around to merge on vma and new_vma afterwards.
  187. */
  188. err = ksm_madvise(vma, old_addr, old_addr + old_len,
  189. MADV_UNMERGEABLE, &vm_flags);
  190. if (err)
  191. return err;
  192. new_pgoff = vma->vm_pgoff + ((old_addr - vma->vm_start) >> PAGE_SHIFT);
  193. new_vma = copy_vma(&vma, new_addr, new_len, new_pgoff);
  194. if (!new_vma)
  195. return -ENOMEM;
  196. moved_len = move_page_tables(vma, old_addr, new_vma, new_addr, old_len);
  197. if (moved_len < old_len) {
  198. /*
  199. * On error, move entries back from new area to old,
  200. * which will succeed since page tables still there,
  201. * and then proceed to unmap new area instead of old.
  202. */
  203. move_page_tables(new_vma, new_addr, vma, old_addr, moved_len);
  204. vma = new_vma;
  205. old_len = new_len;
  206. old_addr = new_addr;
  207. new_addr = -ENOMEM;
  208. }
  209. /* Conceal VM_ACCOUNT so old reservation is not undone */
  210. if (vm_flags & VM_ACCOUNT) {
  211. vma->vm_flags &= ~VM_ACCOUNT;
  212. excess = vma->vm_end - vma->vm_start - old_len;
  213. if (old_addr > vma->vm_start &&
  214. old_addr + old_len < vma->vm_end)
  215. split = 1;
  216. }
  217. /*
  218. * If we failed to move page tables we still do total_vm increment
  219. * since do_munmap() will decrement it by old_len == new_len.
  220. *
  221. * Since total_vm is about to be raised artificially high for a
  222. * moment, we need to restore high watermark afterwards: if stats
  223. * are taken meanwhile, total_vm and hiwater_vm appear too high.
  224. * If this were a serious issue, we'd add a flag to do_munmap().
  225. */
  226. hiwater_vm = mm->hiwater_vm;
  227. vm_stat_account(mm, vma->vm_flags, vma->vm_file, new_len>>PAGE_SHIFT);
  228. if (do_munmap(mm, old_addr, old_len) < 0) {
  229. /* OOM: unable to split vma, just get accounts right */
  230. vm_unacct_memory(excess >> PAGE_SHIFT);
  231. excess = 0;
  232. }
  233. mm->hiwater_vm = hiwater_vm;
  234. /* Restore VM_ACCOUNT if one or two pieces of vma left */
  235. if (excess) {
  236. vma->vm_flags |= VM_ACCOUNT;
  237. if (split)
  238. vma->vm_next->vm_flags |= VM_ACCOUNT;
  239. }
  240. if (vm_flags & VM_LOCKED) {
  241. mm->locked_vm += new_len >> PAGE_SHIFT;
  242. if (new_len > old_len)
  243. mlock_vma_pages_range(new_vma, new_addr + old_len,
  244. new_addr + new_len);
  245. }
  246. return new_addr;
  247. }
  248. static struct vm_area_struct *vma_to_resize(unsigned long addr,
  249. unsigned long old_len, unsigned long new_len, unsigned long *p)
  250. {
  251. struct mm_struct *mm = current->mm;
  252. struct vm_area_struct *vma = find_vma(mm, addr);
  253. if (!vma || vma->vm_start > addr)
  254. goto Efault;
  255. if (is_vm_hugetlb_page(vma))
  256. goto Einval;
  257. /* We can't remap across vm area boundaries */
  258. if (old_len > vma->vm_end - addr)
  259. goto Efault;
  260. /* Need to be careful about a growing mapping */
  261. if (new_len > old_len) {
  262. unsigned long pgoff;
  263. if (vma->vm_flags & (VM_DONTEXPAND | VM_PFNMAP))
  264. goto Efault;
  265. pgoff = (addr - vma->vm_start) >> PAGE_SHIFT;
  266. pgoff += vma->vm_pgoff;
  267. if (pgoff + (new_len >> PAGE_SHIFT) < pgoff)
  268. goto Einval;
  269. }
  270. if (vma->vm_flags & VM_LOCKED) {
  271. unsigned long locked, lock_limit;
  272. locked = mm->locked_vm << PAGE_SHIFT;
  273. lock_limit = rlimit(RLIMIT_MEMLOCK);
  274. locked += new_len - old_len;
  275. if (locked > lock_limit && !capable(CAP_IPC_LOCK))
  276. goto Eagain;
  277. }
  278. if (!may_expand_vm(mm, (new_len - old_len) >> PAGE_SHIFT))
  279. goto Enomem;
  280. if (vma->vm_flags & VM_ACCOUNT) {
  281. unsigned long charged = (new_len - old_len) >> PAGE_SHIFT;
  282. if (security_vm_enough_memory_mm(mm, charged))
  283. goto Efault;
  284. *p = charged;
  285. }
  286. return vma;
  287. Efault: /* very odd choice for most of the cases, but... */
  288. return ERR_PTR(-EFAULT);
  289. Einval:
  290. return ERR_PTR(-EINVAL);
  291. Enomem:
  292. return ERR_PTR(-ENOMEM);
  293. Eagain:
  294. return ERR_PTR(-EAGAIN);
  295. }
  296. static unsigned long mremap_to(unsigned long addr,
  297. unsigned long old_len, unsigned long new_addr,
  298. unsigned long new_len)
  299. {
  300. struct mm_struct *mm = current->mm;
  301. struct vm_area_struct *vma;
  302. unsigned long ret = -EINVAL;
  303. unsigned long charged = 0;
  304. unsigned long map_flags;
  305. if (new_addr & ~PAGE_MASK)
  306. goto out;
  307. if (new_len > TASK_SIZE || new_addr > TASK_SIZE - new_len)
  308. goto out;
  309. /* Check if the location we're moving into overlaps the
  310. * old location at all, and fail if it does.
  311. */
  312. if ((new_addr <= addr) && (new_addr+new_len) > addr)
  313. goto out;
  314. if ((addr <= new_addr) && (addr+old_len) > new_addr)
  315. goto out;
  316. ret = do_munmap(mm, new_addr, new_len);
  317. if (ret)
  318. goto out;
  319. if (old_len >= new_len) {
  320. ret = do_munmap(mm, addr+new_len, old_len - new_len);
  321. if (ret && old_len != new_len)
  322. goto out;
  323. old_len = new_len;
  324. }
  325. vma = vma_to_resize(addr, old_len, new_len, &charged);
  326. if (IS_ERR(vma)) {
  327. ret = PTR_ERR(vma);
  328. goto out;
  329. }
  330. map_flags = MAP_FIXED;
  331. if (vma->vm_flags & VM_MAYSHARE)
  332. map_flags |= MAP_SHARED;
  333. ret = get_unmapped_area(vma->vm_file, new_addr, new_len, vma->vm_pgoff +
  334. ((addr - vma->vm_start) >> PAGE_SHIFT),
  335. map_flags);
  336. if (ret & ~PAGE_MASK)
  337. goto out1;
  338. ret = move_vma(vma, addr, old_len, new_len, new_addr);
  339. if (!(ret & ~PAGE_MASK))
  340. goto out;
  341. out1:
  342. vm_unacct_memory(charged);
  343. out:
  344. return ret;
  345. }
  346. static int vma_expandable(struct vm_area_struct *vma, unsigned long delta)
  347. {
  348. unsigned long end = vma->vm_end + delta;
  349. if (end < vma->vm_end) /* overflow */
  350. return 0;
  351. if (vma->vm_next && vma->vm_next->vm_start < end) /* intersection */
  352. return 0;
  353. if (get_unmapped_area(NULL, vma->vm_start, end - vma->vm_start,
  354. 0, MAP_FIXED) & ~PAGE_MASK)
  355. return 0;
  356. return 1;
  357. }
  358. /*
  359. * Expand (or shrink) an existing mapping, potentially moving it at the
  360. * same time (controlled by the MREMAP_MAYMOVE flag and available VM space)
  361. *
  362. * MREMAP_FIXED option added 5-Dec-1999 by Benjamin LaHaise
  363. * This option implies MREMAP_MAYMOVE.
  364. */
  365. SYSCALL_DEFINE5(mremap, unsigned long, addr, unsigned long, old_len,
  366. unsigned long, new_len, unsigned long, flags,
  367. unsigned long, new_addr)
  368. {
  369. struct mm_struct *mm = current->mm;
  370. struct vm_area_struct *vma;
  371. unsigned long ret = -EINVAL;
  372. unsigned long charged = 0;
  373. down_write(&current->mm->mmap_sem);
  374. if (flags & ~(MREMAP_FIXED | MREMAP_MAYMOVE))
  375. goto out;
  376. if (addr & ~PAGE_MASK)
  377. goto out;
  378. old_len = PAGE_ALIGN(old_len);
  379. new_len = PAGE_ALIGN(new_len);
  380. /*
  381. * We allow a zero old-len as a special case
  382. * for DOS-emu "duplicate shm area" thing. But
  383. * a zero new-len is nonsensical.
  384. */
  385. if (!new_len)
  386. goto out;
  387. if (flags & MREMAP_FIXED) {
  388. if (flags & MREMAP_MAYMOVE)
  389. ret = mremap_to(addr, old_len, new_addr, new_len);
  390. goto out;
  391. }
  392. /*
  393. * Always allow a shrinking remap: that just unmaps
  394. * the unnecessary pages..
  395. * do_munmap does all the needed commit accounting
  396. */
  397. if (old_len >= new_len) {
  398. ret = do_munmap(mm, addr+new_len, old_len - new_len);
  399. if (ret && old_len != new_len)
  400. goto out;
  401. ret = addr;
  402. goto out;
  403. }
  404. /*
  405. * Ok, we need to grow..
  406. */
  407. vma = vma_to_resize(addr, old_len, new_len, &charged);
  408. if (IS_ERR(vma)) {
  409. ret = PTR_ERR(vma);
  410. goto out;
  411. }
  412. /* old_len exactly to the end of the area..
  413. */
  414. if (old_len == vma->vm_end - addr) {
  415. /* can we just expand the current mapping? */
  416. if (vma_expandable(vma, new_len - old_len)) {
  417. int pages = (new_len - old_len) >> PAGE_SHIFT;
  418. if (vma_adjust(vma, vma->vm_start, addr + new_len,
  419. vma->vm_pgoff, NULL)) {
  420. ret = -ENOMEM;
  421. goto out;
  422. }
  423. vm_stat_account(mm, vma->vm_flags, vma->vm_file, pages);
  424. if (vma->vm_flags & VM_LOCKED) {
  425. mm->locked_vm += pages;
  426. mlock_vma_pages_range(vma, addr + old_len,
  427. addr + new_len);
  428. }
  429. ret = addr;
  430. goto out;
  431. }
  432. }
  433. /*
  434. * We weren't able to just expand or shrink the area,
  435. * we need to create a new one and move it..
  436. */
  437. ret = -ENOMEM;
  438. if (flags & MREMAP_MAYMOVE) {
  439. unsigned long map_flags = 0;
  440. if (vma->vm_flags & VM_MAYSHARE)
  441. map_flags |= MAP_SHARED;
  442. new_addr = get_unmapped_area(vma->vm_file, 0, new_len,
  443. vma->vm_pgoff +
  444. ((addr - vma->vm_start) >> PAGE_SHIFT),
  445. map_flags);
  446. if (new_addr & ~PAGE_MASK) {
  447. ret = new_addr;
  448. goto out;
  449. }
  450. ret = move_vma(vma, addr, old_len, new_len, new_addr);
  451. }
  452. out:
  453. if (ret & ~PAGE_MASK)
  454. vm_unacct_memory(charged);
  455. up_write(&current->mm->mmap_sem);
  456. return ret;
  457. }