nommu.c 46 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912
  1. /*
  2. * linux/mm/nommu.c
  3. *
  4. * Replacement code for mm functions to support CPU's that don't
  5. * have any form of memory management unit (thus no virtual memory).
  6. *
  7. * See Documentation/nommu-mmap.txt
  8. *
  9. * Copyright (c) 2004-2008 David Howells <dhowells@redhat.com>
  10. * Copyright (c) 2000-2003 David McCullough <davidm@snapgear.com>
  11. * Copyright (c) 2000-2001 D Jeff Dionne <jeff@uClinux.org>
  12. * Copyright (c) 2002 Greg Ungerer <gerg@snapgear.com>
  13. * Copyright (c) 2007-2009 Paul Mundt <lethal@linux-sh.org>
  14. */
  15. #include <linux/module.h>
  16. #include <linux/mm.h>
  17. #include <linux/mman.h>
  18. #include <linux/swap.h>
  19. #include <linux/file.h>
  20. #include <linux/highmem.h>
  21. #include <linux/pagemap.h>
  22. #include <linux/slab.h>
  23. #include <linux/vmalloc.h>
  24. #include <linux/tracehook.h>
  25. #include <linux/blkdev.h>
  26. #include <linux/backing-dev.h>
  27. #include <linux/mount.h>
  28. #include <linux/personality.h>
  29. #include <linux/security.h>
  30. #include <linux/syscalls.h>
  31. #include <asm/uaccess.h>
  32. #include <asm/tlb.h>
  33. #include <asm/tlbflush.h>
  34. #include <asm/mmu_context.h>
  35. #include "internal.h"
  36. static inline __attribute__((format(printf, 1, 2)))
  37. void no_printk(const char *fmt, ...)
  38. {
  39. }
  40. #if 0
  41. #define kenter(FMT, ...) \
  42. printk(KERN_DEBUG "==> %s("FMT")\n", __func__, ##__VA_ARGS__)
  43. #define kleave(FMT, ...) \
  44. printk(KERN_DEBUG "<== %s()"FMT"\n", __func__, ##__VA_ARGS__)
  45. #define kdebug(FMT, ...) \
  46. printk(KERN_DEBUG "xxx" FMT"yyy\n", ##__VA_ARGS__)
  47. #else
  48. #define kenter(FMT, ...) \
  49. no_printk(KERN_DEBUG "==> %s("FMT")\n", __func__, ##__VA_ARGS__)
  50. #define kleave(FMT, ...) \
  51. no_printk(KERN_DEBUG "<== %s()"FMT"\n", __func__, ##__VA_ARGS__)
  52. #define kdebug(FMT, ...) \
  53. no_printk(KERN_DEBUG FMT"\n", ##__VA_ARGS__)
  54. #endif
  55. void *high_memory;
  56. struct page *mem_map;
  57. unsigned long max_mapnr;
  58. unsigned long num_physpages;
  59. unsigned long highest_memmap_pfn;
  60. struct percpu_counter vm_committed_as;
  61. int sysctl_overcommit_memory = OVERCOMMIT_GUESS; /* heuristic overcommit */
  62. int sysctl_overcommit_ratio = 50; /* default is 50% */
  63. int sysctl_max_map_count = DEFAULT_MAX_MAP_COUNT;
  64. int sysctl_nr_trim_pages = CONFIG_NOMMU_INITIAL_TRIM_EXCESS;
  65. int heap_stack_gap = 0;
  66. atomic_long_t mmap_pages_allocated;
  67. EXPORT_SYMBOL(mem_map);
  68. EXPORT_SYMBOL(num_physpages);
  69. /* list of mapped, potentially shareable regions */
  70. static struct kmem_cache *vm_region_jar;
  71. struct rb_root nommu_region_tree = RB_ROOT;
  72. DECLARE_RWSEM(nommu_region_sem);
  73. struct vm_operations_struct generic_file_vm_ops = {
  74. };
  75. /*
  76. * Return the total memory allocated for this pointer, not
  77. * just what the caller asked for.
  78. *
  79. * Doesn't have to be accurate, i.e. may have races.
  80. */
  81. unsigned int kobjsize(const void *objp)
  82. {
  83. struct page *page;
  84. /*
  85. * If the object we have should not have ksize performed on it,
  86. * return size of 0
  87. */
  88. if (!objp || !virt_addr_valid(objp))
  89. return 0;
  90. page = virt_to_head_page(objp);
  91. /*
  92. * If the allocator sets PageSlab, we know the pointer came from
  93. * kmalloc().
  94. */
  95. if (PageSlab(page))
  96. return ksize(objp);
  97. /*
  98. * If it's not a compound page, see if we have a matching VMA
  99. * region. This test is intentionally done in reverse order,
  100. * so if there's no VMA, we still fall through and hand back
  101. * PAGE_SIZE for 0-order pages.
  102. */
  103. if (!PageCompound(page)) {
  104. struct vm_area_struct *vma;
  105. vma = find_vma(current->mm, (unsigned long)objp);
  106. if (vma)
  107. return vma->vm_end - vma->vm_start;
  108. }
  109. /*
  110. * The ksize() function is only guaranteed to work for pointers
  111. * returned by kmalloc(). So handle arbitrary pointers here.
  112. */
  113. return PAGE_SIZE << compound_order(page);
  114. }
  115. int __get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
  116. unsigned long start, int nr_pages, unsigned int foll_flags,
  117. struct page **pages, struct vm_area_struct **vmas)
  118. {
  119. struct vm_area_struct *vma;
  120. unsigned long vm_flags;
  121. int i;
  122. /* calculate required read or write permissions.
  123. * If FOLL_FORCE is set, we only require the "MAY" flags.
  124. */
  125. vm_flags = (foll_flags & FOLL_WRITE) ?
  126. (VM_WRITE | VM_MAYWRITE) : (VM_READ | VM_MAYREAD);
  127. vm_flags &= (foll_flags & FOLL_FORCE) ?
  128. (VM_MAYREAD | VM_MAYWRITE) : (VM_READ | VM_WRITE);
  129. for (i = 0; i < nr_pages; i++) {
  130. vma = find_vma(mm, start);
  131. if (!vma)
  132. goto finish_or_fault;
  133. /* protect what we can, including chardevs */
  134. if ((vma->vm_flags & (VM_IO | VM_PFNMAP)) ||
  135. !(vm_flags & vma->vm_flags))
  136. goto finish_or_fault;
  137. if (pages) {
  138. pages[i] = virt_to_page(start);
  139. if (pages[i])
  140. page_cache_get(pages[i]);
  141. }
  142. if (vmas)
  143. vmas[i] = vma;
  144. start += PAGE_SIZE;
  145. }
  146. return i;
  147. finish_or_fault:
  148. return i ? : -EFAULT;
  149. }
  150. /*
  151. * get a list of pages in an address range belonging to the specified process
  152. * and indicate the VMA that covers each page
  153. * - this is potentially dodgy as we may end incrementing the page count of a
  154. * slab page or a secondary page from a compound page
  155. * - don't permit access to VMAs that don't support it, such as I/O mappings
  156. */
  157. int get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
  158. unsigned long start, int nr_pages, int write, int force,
  159. struct page **pages, struct vm_area_struct **vmas)
  160. {
  161. int flags = 0;
  162. if (write)
  163. flags |= FOLL_WRITE;
  164. if (force)
  165. flags |= FOLL_FORCE;
  166. return __get_user_pages(tsk, mm, start, nr_pages, flags, pages, vmas);
  167. }
  168. EXPORT_SYMBOL(get_user_pages);
  169. /**
  170. * follow_pfn - look up PFN at a user virtual address
  171. * @vma: memory mapping
  172. * @address: user virtual address
  173. * @pfn: location to store found PFN
  174. *
  175. * Only IO mappings and raw PFN mappings are allowed.
  176. *
  177. * Returns zero and the pfn at @pfn on success, -ve otherwise.
  178. */
  179. int follow_pfn(struct vm_area_struct *vma, unsigned long address,
  180. unsigned long *pfn)
  181. {
  182. if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
  183. return -EINVAL;
  184. *pfn = address >> PAGE_SHIFT;
  185. return 0;
  186. }
  187. EXPORT_SYMBOL(follow_pfn);
  188. DEFINE_RWLOCK(vmlist_lock);
  189. struct vm_struct *vmlist;
  190. void vfree(const void *addr)
  191. {
  192. kfree(addr);
  193. }
  194. EXPORT_SYMBOL(vfree);
  195. void *__vmalloc(unsigned long size, gfp_t gfp_mask, pgprot_t prot)
  196. {
  197. /*
  198. * You can't specify __GFP_HIGHMEM with kmalloc() since kmalloc()
  199. * returns only a logical address.
  200. */
  201. return kmalloc(size, (gfp_mask | __GFP_COMP) & ~__GFP_HIGHMEM);
  202. }
  203. EXPORT_SYMBOL(__vmalloc);
  204. void *vmalloc_user(unsigned long size)
  205. {
  206. void *ret;
  207. ret = __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO,
  208. PAGE_KERNEL);
  209. if (ret) {
  210. struct vm_area_struct *vma;
  211. down_write(&current->mm->mmap_sem);
  212. vma = find_vma(current->mm, (unsigned long)ret);
  213. if (vma)
  214. vma->vm_flags |= VM_USERMAP;
  215. up_write(&current->mm->mmap_sem);
  216. }
  217. return ret;
  218. }
  219. EXPORT_SYMBOL(vmalloc_user);
  220. struct page *vmalloc_to_page(const void *addr)
  221. {
  222. return virt_to_page(addr);
  223. }
  224. EXPORT_SYMBOL(vmalloc_to_page);
  225. unsigned long vmalloc_to_pfn(const void *addr)
  226. {
  227. return page_to_pfn(virt_to_page(addr));
  228. }
  229. EXPORT_SYMBOL(vmalloc_to_pfn);
  230. long vread(char *buf, char *addr, unsigned long count)
  231. {
  232. memcpy(buf, addr, count);
  233. return count;
  234. }
  235. long vwrite(char *buf, char *addr, unsigned long count)
  236. {
  237. /* Don't allow overflow */
  238. if ((unsigned long) addr + count < count)
  239. count = -(unsigned long) addr;
  240. memcpy(addr, buf, count);
  241. return(count);
  242. }
  243. /*
  244. * vmalloc - allocate virtually continguos memory
  245. *
  246. * @size: allocation size
  247. *
  248. * Allocate enough pages to cover @size from the page level
  249. * allocator and map them into continguos kernel virtual space.
  250. *
  251. * For tight control over page level allocator and protection flags
  252. * use __vmalloc() instead.
  253. */
  254. void *vmalloc(unsigned long size)
  255. {
  256. return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL);
  257. }
  258. EXPORT_SYMBOL(vmalloc);
  259. void *vmalloc_node(unsigned long size, int node)
  260. {
  261. return vmalloc(size);
  262. }
  263. EXPORT_SYMBOL(vmalloc_node);
  264. #ifndef PAGE_KERNEL_EXEC
  265. # define PAGE_KERNEL_EXEC PAGE_KERNEL
  266. #endif
  267. /**
  268. * vmalloc_exec - allocate virtually contiguous, executable memory
  269. * @size: allocation size
  270. *
  271. * Kernel-internal function to allocate enough pages to cover @size
  272. * the page level allocator and map them into contiguous and
  273. * executable kernel virtual space.
  274. *
  275. * For tight control over page level allocator and protection flags
  276. * use __vmalloc() instead.
  277. */
  278. void *vmalloc_exec(unsigned long size)
  279. {
  280. return __vmalloc(size, GFP_KERNEL | __GFP_HIGHMEM, PAGE_KERNEL_EXEC);
  281. }
  282. /**
  283. * vmalloc_32 - allocate virtually contiguous memory (32bit addressable)
  284. * @size: allocation size
  285. *
  286. * Allocate enough 32bit PA addressable pages to cover @size from the
  287. * page level allocator and map them into continguos kernel virtual space.
  288. */
  289. void *vmalloc_32(unsigned long size)
  290. {
  291. return __vmalloc(size, GFP_KERNEL, PAGE_KERNEL);
  292. }
  293. EXPORT_SYMBOL(vmalloc_32);
  294. /**
  295. * vmalloc_32_user - allocate zeroed virtually contiguous 32bit memory
  296. * @size: allocation size
  297. *
  298. * The resulting memory area is 32bit addressable and zeroed so it can be
  299. * mapped to userspace without leaking data.
  300. *
  301. * VM_USERMAP is set on the corresponding VMA so that subsequent calls to
  302. * remap_vmalloc_range() are permissible.
  303. */
  304. void *vmalloc_32_user(unsigned long size)
  305. {
  306. /*
  307. * We'll have to sort out the ZONE_DMA bits for 64-bit,
  308. * but for now this can simply use vmalloc_user() directly.
  309. */
  310. return vmalloc_user(size);
  311. }
  312. EXPORT_SYMBOL(vmalloc_32_user);
  313. void *vmap(struct page **pages, unsigned int count, unsigned long flags, pgprot_t prot)
  314. {
  315. BUG();
  316. return NULL;
  317. }
  318. EXPORT_SYMBOL(vmap);
  319. void vunmap(const void *addr)
  320. {
  321. BUG();
  322. }
  323. EXPORT_SYMBOL(vunmap);
  324. void *vm_map_ram(struct page **pages, unsigned int count, int node, pgprot_t prot)
  325. {
  326. BUG();
  327. return NULL;
  328. }
  329. EXPORT_SYMBOL(vm_map_ram);
  330. void vm_unmap_ram(const void *mem, unsigned int count)
  331. {
  332. BUG();
  333. }
  334. EXPORT_SYMBOL(vm_unmap_ram);
  335. void vm_unmap_aliases(void)
  336. {
  337. }
  338. EXPORT_SYMBOL_GPL(vm_unmap_aliases);
  339. /*
  340. * Implement a stub for vmalloc_sync_all() if the architecture chose not to
  341. * have one.
  342. */
  343. void __attribute__((weak)) vmalloc_sync_all(void)
  344. {
  345. }
  346. int vm_insert_page(struct vm_area_struct *vma, unsigned long addr,
  347. struct page *page)
  348. {
  349. return -EINVAL;
  350. }
  351. EXPORT_SYMBOL(vm_insert_page);
  352. /*
  353. * sys_brk() for the most part doesn't need the global kernel
  354. * lock, except when an application is doing something nasty
  355. * like trying to un-brk an area that has already been mapped
  356. * to a regular file. in this case, the unmapping will need
  357. * to invoke file system routines that need the global lock.
  358. */
  359. SYSCALL_DEFINE1(brk, unsigned long, brk)
  360. {
  361. struct mm_struct *mm = current->mm;
  362. if (brk < mm->start_brk || brk > mm->context.end_brk)
  363. return mm->brk;
  364. if (mm->brk == brk)
  365. return mm->brk;
  366. /*
  367. * Always allow shrinking brk
  368. */
  369. if (brk <= mm->brk) {
  370. mm->brk = brk;
  371. return brk;
  372. }
  373. /*
  374. * Ok, looks good - let it rip.
  375. */
  376. return mm->brk = brk;
  377. }
  378. /*
  379. * initialise the VMA and region record slabs
  380. */
  381. void __init mmap_init(void)
  382. {
  383. int ret;
  384. ret = percpu_counter_init(&vm_committed_as, 0);
  385. VM_BUG_ON(ret);
  386. vm_region_jar = KMEM_CACHE(vm_region, SLAB_PANIC);
  387. }
  388. /*
  389. * validate the region tree
  390. * - the caller must hold the region lock
  391. */
  392. #ifdef CONFIG_DEBUG_NOMMU_REGIONS
  393. static noinline void validate_nommu_regions(void)
  394. {
  395. struct vm_region *region, *last;
  396. struct rb_node *p, *lastp;
  397. lastp = rb_first(&nommu_region_tree);
  398. if (!lastp)
  399. return;
  400. last = rb_entry(lastp, struct vm_region, vm_rb);
  401. BUG_ON(unlikely(last->vm_end <= last->vm_start));
  402. BUG_ON(unlikely(last->vm_top < last->vm_end));
  403. while ((p = rb_next(lastp))) {
  404. region = rb_entry(p, struct vm_region, vm_rb);
  405. last = rb_entry(lastp, struct vm_region, vm_rb);
  406. BUG_ON(unlikely(region->vm_end <= region->vm_start));
  407. BUG_ON(unlikely(region->vm_top < region->vm_end));
  408. BUG_ON(unlikely(region->vm_start < last->vm_top));
  409. lastp = p;
  410. }
  411. }
  412. #else
  413. static void validate_nommu_regions(void)
  414. {
  415. }
  416. #endif
  417. /*
  418. * add a region into the global tree
  419. */
  420. static void add_nommu_region(struct vm_region *region)
  421. {
  422. struct vm_region *pregion;
  423. struct rb_node **p, *parent;
  424. validate_nommu_regions();
  425. parent = NULL;
  426. p = &nommu_region_tree.rb_node;
  427. while (*p) {
  428. parent = *p;
  429. pregion = rb_entry(parent, struct vm_region, vm_rb);
  430. if (region->vm_start < pregion->vm_start)
  431. p = &(*p)->rb_left;
  432. else if (region->vm_start > pregion->vm_start)
  433. p = &(*p)->rb_right;
  434. else if (pregion == region)
  435. return;
  436. else
  437. BUG();
  438. }
  439. rb_link_node(&region->vm_rb, parent, p);
  440. rb_insert_color(&region->vm_rb, &nommu_region_tree);
  441. validate_nommu_regions();
  442. }
  443. /*
  444. * delete a region from the global tree
  445. */
  446. static void delete_nommu_region(struct vm_region *region)
  447. {
  448. BUG_ON(!nommu_region_tree.rb_node);
  449. validate_nommu_regions();
  450. rb_erase(&region->vm_rb, &nommu_region_tree);
  451. validate_nommu_regions();
  452. }
  453. /*
  454. * free a contiguous series of pages
  455. */
  456. static void free_page_series(unsigned long from, unsigned long to)
  457. {
  458. for (; from < to; from += PAGE_SIZE) {
  459. struct page *page = virt_to_page(from);
  460. kdebug("- free %lx", from);
  461. atomic_long_dec(&mmap_pages_allocated);
  462. if (page_count(page) != 1)
  463. kdebug("free page %p: refcount not one: %d",
  464. page, page_count(page));
  465. put_page(page);
  466. }
  467. }
  468. /*
  469. * release a reference to a region
  470. * - the caller must hold the region semaphore for writing, which this releases
  471. * - the region may not have been added to the tree yet, in which case vm_top
  472. * will equal vm_start
  473. */
  474. static void __put_nommu_region(struct vm_region *region)
  475. __releases(nommu_region_sem)
  476. {
  477. kenter("%p{%d}", region, atomic_read(&region->vm_usage));
  478. BUG_ON(!nommu_region_tree.rb_node);
  479. if (atomic_dec_and_test(&region->vm_usage)) {
  480. if (region->vm_top > region->vm_start)
  481. delete_nommu_region(region);
  482. up_write(&nommu_region_sem);
  483. if (region->vm_file)
  484. fput(region->vm_file);
  485. /* IO memory and memory shared directly out of the pagecache
  486. * from ramfs/tmpfs mustn't be released here */
  487. if (region->vm_flags & VM_MAPPED_COPY) {
  488. kdebug("free series");
  489. free_page_series(region->vm_start, region->vm_top);
  490. }
  491. kmem_cache_free(vm_region_jar, region);
  492. } else {
  493. up_write(&nommu_region_sem);
  494. }
  495. }
  496. /*
  497. * release a reference to a region
  498. */
  499. static void put_nommu_region(struct vm_region *region)
  500. {
  501. down_write(&nommu_region_sem);
  502. __put_nommu_region(region);
  503. }
  504. /*
  505. * update protection on a vma
  506. */
  507. static void protect_vma(struct vm_area_struct *vma, unsigned long flags)
  508. {
  509. #ifdef CONFIG_MPU
  510. struct mm_struct *mm = vma->vm_mm;
  511. long start = vma->vm_start & PAGE_MASK;
  512. while (start < vma->vm_end) {
  513. protect_page(mm, start, flags);
  514. start += PAGE_SIZE;
  515. }
  516. update_protections(mm);
  517. #endif
  518. }
  519. /*
  520. * add a VMA into a process's mm_struct in the appropriate place in the list
  521. * and tree and add to the address space's page tree also if not an anonymous
  522. * page
  523. * - should be called with mm->mmap_sem held writelocked
  524. */
  525. static void add_vma_to_mm(struct mm_struct *mm, struct vm_area_struct *vma)
  526. {
  527. struct vm_area_struct *pvma, **pp;
  528. struct address_space *mapping;
  529. struct rb_node **p, *parent;
  530. kenter(",%p", vma);
  531. BUG_ON(!vma->vm_region);
  532. mm->map_count++;
  533. vma->vm_mm = mm;
  534. protect_vma(vma, vma->vm_flags);
  535. /* add the VMA to the mapping */
  536. if (vma->vm_file) {
  537. mapping = vma->vm_file->f_mapping;
  538. flush_dcache_mmap_lock(mapping);
  539. vma_prio_tree_insert(vma, &mapping->i_mmap);
  540. flush_dcache_mmap_unlock(mapping);
  541. }
  542. /* add the VMA to the tree */
  543. parent = NULL;
  544. p = &mm->mm_rb.rb_node;
  545. while (*p) {
  546. parent = *p;
  547. pvma = rb_entry(parent, struct vm_area_struct, vm_rb);
  548. /* sort by: start addr, end addr, VMA struct addr in that order
  549. * (the latter is necessary as we may get identical VMAs) */
  550. if (vma->vm_start < pvma->vm_start)
  551. p = &(*p)->rb_left;
  552. else if (vma->vm_start > pvma->vm_start)
  553. p = &(*p)->rb_right;
  554. else if (vma->vm_end < pvma->vm_end)
  555. p = &(*p)->rb_left;
  556. else if (vma->vm_end > pvma->vm_end)
  557. p = &(*p)->rb_right;
  558. else if (vma < pvma)
  559. p = &(*p)->rb_left;
  560. else if (vma > pvma)
  561. p = &(*p)->rb_right;
  562. else
  563. BUG();
  564. }
  565. rb_link_node(&vma->vm_rb, parent, p);
  566. rb_insert_color(&vma->vm_rb, &mm->mm_rb);
  567. /* add VMA to the VMA list also */
  568. for (pp = &mm->mmap; (pvma = *pp); pp = &(*pp)->vm_next) {
  569. if (pvma->vm_start > vma->vm_start)
  570. break;
  571. if (pvma->vm_start < vma->vm_start)
  572. continue;
  573. if (pvma->vm_end < vma->vm_end)
  574. break;
  575. }
  576. vma->vm_next = *pp;
  577. *pp = vma;
  578. }
  579. /*
  580. * delete a VMA from its owning mm_struct and address space
  581. */
  582. static void delete_vma_from_mm(struct vm_area_struct *vma)
  583. {
  584. struct vm_area_struct **pp;
  585. struct address_space *mapping;
  586. struct mm_struct *mm = vma->vm_mm;
  587. kenter("%p", vma);
  588. protect_vma(vma, 0);
  589. mm->map_count--;
  590. if (mm->mmap_cache == vma)
  591. mm->mmap_cache = NULL;
  592. /* remove the VMA from the mapping */
  593. if (vma->vm_file) {
  594. mapping = vma->vm_file->f_mapping;
  595. flush_dcache_mmap_lock(mapping);
  596. vma_prio_tree_remove(vma, &mapping->i_mmap);
  597. flush_dcache_mmap_unlock(mapping);
  598. }
  599. /* remove from the MM's tree and list */
  600. rb_erase(&vma->vm_rb, &mm->mm_rb);
  601. for (pp = &mm->mmap; *pp; pp = &(*pp)->vm_next) {
  602. if (*pp == vma) {
  603. *pp = vma->vm_next;
  604. break;
  605. }
  606. }
  607. vma->vm_mm = NULL;
  608. }
  609. /*
  610. * destroy a VMA record
  611. */
  612. static void delete_vma(struct mm_struct *mm, struct vm_area_struct *vma)
  613. {
  614. kenter("%p", vma);
  615. if (vma->vm_ops && vma->vm_ops->close)
  616. vma->vm_ops->close(vma);
  617. if (vma->vm_file) {
  618. fput(vma->vm_file);
  619. if (vma->vm_flags & VM_EXECUTABLE)
  620. removed_exe_file_vma(mm);
  621. }
  622. put_nommu_region(vma->vm_region);
  623. kmem_cache_free(vm_area_cachep, vma);
  624. }
  625. /*
  626. * look up the first VMA in which addr resides, NULL if none
  627. * - should be called with mm->mmap_sem at least held readlocked
  628. */
  629. struct vm_area_struct *find_vma(struct mm_struct *mm, unsigned long addr)
  630. {
  631. struct vm_area_struct *vma;
  632. struct rb_node *n = mm->mm_rb.rb_node;
  633. /* check the cache first */
  634. vma = mm->mmap_cache;
  635. if (vma && vma->vm_start <= addr && vma->vm_end > addr)
  636. return vma;
  637. /* trawl the tree (there may be multiple mappings in which addr
  638. * resides) */
  639. for (n = rb_first(&mm->mm_rb); n; n = rb_next(n)) {
  640. vma = rb_entry(n, struct vm_area_struct, vm_rb);
  641. if (vma->vm_start > addr)
  642. return NULL;
  643. if (vma->vm_end > addr) {
  644. mm->mmap_cache = vma;
  645. return vma;
  646. }
  647. }
  648. return NULL;
  649. }
  650. EXPORT_SYMBOL(find_vma);
  651. /*
  652. * find a VMA
  653. * - we don't extend stack VMAs under NOMMU conditions
  654. */
  655. struct vm_area_struct *find_extend_vma(struct mm_struct *mm, unsigned long addr)
  656. {
  657. return find_vma(mm, addr);
  658. }
  659. /*
  660. * expand a stack to a given address
  661. * - not supported under NOMMU conditions
  662. */
  663. int expand_stack(struct vm_area_struct *vma, unsigned long address)
  664. {
  665. return -ENOMEM;
  666. }
  667. /*
  668. * look up the first VMA exactly that exactly matches addr
  669. * - should be called with mm->mmap_sem at least held readlocked
  670. */
  671. static struct vm_area_struct *find_vma_exact(struct mm_struct *mm,
  672. unsigned long addr,
  673. unsigned long len)
  674. {
  675. struct vm_area_struct *vma;
  676. struct rb_node *n = mm->mm_rb.rb_node;
  677. unsigned long end = addr + len;
  678. /* check the cache first */
  679. vma = mm->mmap_cache;
  680. if (vma && vma->vm_start == addr && vma->vm_end == end)
  681. return vma;
  682. /* trawl the tree (there may be multiple mappings in which addr
  683. * resides) */
  684. for (n = rb_first(&mm->mm_rb); n; n = rb_next(n)) {
  685. vma = rb_entry(n, struct vm_area_struct, vm_rb);
  686. if (vma->vm_start < addr)
  687. continue;
  688. if (vma->vm_start > addr)
  689. return NULL;
  690. if (vma->vm_end == end) {
  691. mm->mmap_cache = vma;
  692. return vma;
  693. }
  694. }
  695. return NULL;
  696. }
  697. /*
  698. * determine whether a mapping should be permitted and, if so, what sort of
  699. * mapping we're capable of supporting
  700. */
  701. static int validate_mmap_request(struct file *file,
  702. unsigned long addr,
  703. unsigned long len,
  704. unsigned long prot,
  705. unsigned long flags,
  706. unsigned long pgoff,
  707. unsigned long *_capabilities)
  708. {
  709. unsigned long capabilities, rlen;
  710. unsigned long reqprot = prot;
  711. int ret;
  712. /* do the simple checks first */
  713. if (flags & MAP_FIXED || addr) {
  714. printk(KERN_DEBUG
  715. "%d: Can't do fixed-address/overlay mmap of RAM\n",
  716. current->pid);
  717. return -EINVAL;
  718. }
  719. if ((flags & MAP_TYPE) != MAP_PRIVATE &&
  720. (flags & MAP_TYPE) != MAP_SHARED)
  721. return -EINVAL;
  722. if (!len)
  723. return -EINVAL;
  724. /* Careful about overflows.. */
  725. rlen = PAGE_ALIGN(len);
  726. if (!rlen || rlen > TASK_SIZE)
  727. return -ENOMEM;
  728. /* offset overflow? */
  729. if ((pgoff + (rlen >> PAGE_SHIFT)) < pgoff)
  730. return -EOVERFLOW;
  731. if (file) {
  732. /* validate file mapping requests */
  733. struct address_space *mapping;
  734. /* files must support mmap */
  735. if (!file->f_op || !file->f_op->mmap)
  736. return -ENODEV;
  737. /* work out if what we've got could possibly be shared
  738. * - we support chardevs that provide their own "memory"
  739. * - we support files/blockdevs that are memory backed
  740. */
  741. mapping = file->f_mapping;
  742. if (!mapping)
  743. mapping = file->f_path.dentry->d_inode->i_mapping;
  744. capabilities = 0;
  745. if (mapping && mapping->backing_dev_info)
  746. capabilities = mapping->backing_dev_info->capabilities;
  747. if (!capabilities) {
  748. /* no explicit capabilities set, so assume some
  749. * defaults */
  750. switch (file->f_path.dentry->d_inode->i_mode & S_IFMT) {
  751. case S_IFREG:
  752. case S_IFBLK:
  753. capabilities = BDI_CAP_MAP_COPY;
  754. break;
  755. case S_IFCHR:
  756. capabilities =
  757. BDI_CAP_MAP_DIRECT |
  758. BDI_CAP_READ_MAP |
  759. BDI_CAP_WRITE_MAP;
  760. break;
  761. default:
  762. return -EINVAL;
  763. }
  764. }
  765. /* eliminate any capabilities that we can't support on this
  766. * device */
  767. if (!file->f_op->get_unmapped_area)
  768. capabilities &= ~BDI_CAP_MAP_DIRECT;
  769. if (!file->f_op->read)
  770. capabilities &= ~BDI_CAP_MAP_COPY;
  771. /* The file shall have been opened with read permission. */
  772. if (!(file->f_mode & FMODE_READ))
  773. return -EACCES;
  774. if (flags & MAP_SHARED) {
  775. /* do checks for writing, appending and locking */
  776. if ((prot & PROT_WRITE) &&
  777. !(file->f_mode & FMODE_WRITE))
  778. return -EACCES;
  779. if (IS_APPEND(file->f_path.dentry->d_inode) &&
  780. (file->f_mode & FMODE_WRITE))
  781. return -EACCES;
  782. if (locks_verify_locked(file->f_path.dentry->d_inode))
  783. return -EAGAIN;
  784. if (!(capabilities & BDI_CAP_MAP_DIRECT))
  785. return -ENODEV;
  786. if (((prot & PROT_READ) && !(capabilities & BDI_CAP_READ_MAP)) ||
  787. ((prot & PROT_WRITE) && !(capabilities & BDI_CAP_WRITE_MAP)) ||
  788. ((prot & PROT_EXEC) && !(capabilities & BDI_CAP_EXEC_MAP))
  789. ) {
  790. printk("MAP_SHARED not completely supported on !MMU\n");
  791. return -EINVAL;
  792. }
  793. /* we mustn't privatise shared mappings */
  794. capabilities &= ~BDI_CAP_MAP_COPY;
  795. }
  796. else {
  797. /* we're going to read the file into private memory we
  798. * allocate */
  799. if (!(capabilities & BDI_CAP_MAP_COPY))
  800. return -ENODEV;
  801. /* we don't permit a private writable mapping to be
  802. * shared with the backing device */
  803. if (prot & PROT_WRITE)
  804. capabilities &= ~BDI_CAP_MAP_DIRECT;
  805. }
  806. /* handle executable mappings and implied executable
  807. * mappings */
  808. if (file->f_path.mnt->mnt_flags & MNT_NOEXEC) {
  809. if (prot & PROT_EXEC)
  810. return -EPERM;
  811. }
  812. else if ((prot & PROT_READ) && !(prot & PROT_EXEC)) {
  813. /* handle implication of PROT_EXEC by PROT_READ */
  814. if (current->personality & READ_IMPLIES_EXEC) {
  815. if (capabilities & BDI_CAP_EXEC_MAP)
  816. prot |= PROT_EXEC;
  817. }
  818. }
  819. else if ((prot & PROT_READ) &&
  820. (prot & PROT_EXEC) &&
  821. !(capabilities & BDI_CAP_EXEC_MAP)
  822. ) {
  823. /* backing file is not executable, try to copy */
  824. capabilities &= ~BDI_CAP_MAP_DIRECT;
  825. }
  826. }
  827. else {
  828. /* anonymous mappings are always memory backed and can be
  829. * privately mapped
  830. */
  831. capabilities = BDI_CAP_MAP_COPY;
  832. /* handle PROT_EXEC implication by PROT_READ */
  833. if ((prot & PROT_READ) &&
  834. (current->personality & READ_IMPLIES_EXEC))
  835. prot |= PROT_EXEC;
  836. }
  837. /* allow the security API to have its say */
  838. ret = security_file_mmap(file, reqprot, prot, flags, addr, 0);
  839. if (ret < 0)
  840. return ret;
  841. /* looks okay */
  842. *_capabilities = capabilities;
  843. return 0;
  844. }
  845. /*
  846. * we've determined that we can make the mapping, now translate what we
  847. * now know into VMA flags
  848. */
  849. static unsigned long determine_vm_flags(struct file *file,
  850. unsigned long prot,
  851. unsigned long flags,
  852. unsigned long capabilities)
  853. {
  854. unsigned long vm_flags;
  855. vm_flags = calc_vm_prot_bits(prot) | calc_vm_flag_bits(flags);
  856. vm_flags |= VM_MAYREAD | VM_MAYWRITE | VM_MAYEXEC;
  857. /* vm_flags |= mm->def_flags; */
  858. if (!(capabilities & BDI_CAP_MAP_DIRECT)) {
  859. /* attempt to share read-only copies of mapped file chunks */
  860. if (file && !(prot & PROT_WRITE))
  861. vm_flags |= VM_MAYSHARE;
  862. }
  863. else {
  864. /* overlay a shareable mapping on the backing device or inode
  865. * if possible - used for chardevs, ramfs/tmpfs/shmfs and
  866. * romfs/cramfs */
  867. if (flags & MAP_SHARED)
  868. vm_flags |= VM_MAYSHARE | VM_SHARED;
  869. else if ((((vm_flags & capabilities) ^ vm_flags) & BDI_CAP_VMFLAGS) == 0)
  870. vm_flags |= VM_MAYSHARE;
  871. }
  872. /* refuse to let anyone share private mappings with this process if
  873. * it's being traced - otherwise breakpoints set in it may interfere
  874. * with another untraced process
  875. */
  876. if ((flags & MAP_PRIVATE) && tracehook_expect_breakpoints(current))
  877. vm_flags &= ~VM_MAYSHARE;
  878. return vm_flags;
  879. }
  880. /*
  881. * set up a shared mapping on a file (the driver or filesystem provides and
  882. * pins the storage)
  883. */
  884. static int do_mmap_shared_file(struct vm_area_struct *vma)
  885. {
  886. int ret;
  887. ret = vma->vm_file->f_op->mmap(vma->vm_file, vma);
  888. if (ret == 0) {
  889. vma->vm_region->vm_top = vma->vm_region->vm_end;
  890. return ret;
  891. }
  892. if (ret != -ENOSYS)
  893. return ret;
  894. /* getting an ENOSYS error indicates that direct mmap isn't
  895. * possible (as opposed to tried but failed) so we'll fall
  896. * through to making a private copy of the data and mapping
  897. * that if we can */
  898. return -ENODEV;
  899. }
  900. /*
  901. * set up a private mapping or an anonymous shared mapping
  902. */
  903. static int do_mmap_private(struct vm_area_struct *vma,
  904. struct vm_region *region,
  905. unsigned long len)
  906. {
  907. struct page *pages;
  908. unsigned long total, point, n, rlen;
  909. void *base;
  910. int ret, order;
  911. /* invoke the file's mapping function so that it can keep track of
  912. * shared mappings on devices or memory
  913. * - VM_MAYSHARE will be set if it may attempt to share
  914. */
  915. if (vma->vm_file) {
  916. ret = vma->vm_file->f_op->mmap(vma->vm_file, vma);
  917. if (ret == 0) {
  918. /* shouldn't return success if we're not sharing */
  919. BUG_ON(!(vma->vm_flags & VM_MAYSHARE));
  920. vma->vm_region->vm_top = vma->vm_region->vm_end;
  921. return ret;
  922. }
  923. if (ret != -ENOSYS)
  924. return ret;
  925. /* getting an ENOSYS error indicates that direct mmap isn't
  926. * possible (as opposed to tried but failed) so we'll try to
  927. * make a private copy of the data and map that instead */
  928. }
  929. rlen = PAGE_ALIGN(len);
  930. /* allocate some memory to hold the mapping
  931. * - note that this may not return a page-aligned address if the object
  932. * we're allocating is smaller than a page
  933. */
  934. order = get_order(rlen);
  935. kdebug("alloc order %d for %lx", order, len);
  936. pages = alloc_pages(GFP_KERNEL, order);
  937. if (!pages)
  938. goto enomem;
  939. total = 1 << order;
  940. atomic_long_add(total, &mmap_pages_allocated);
  941. point = rlen >> PAGE_SHIFT;
  942. /* we allocated a power-of-2 sized page set, so we may want to trim off
  943. * the excess */
  944. if (sysctl_nr_trim_pages && total - point >= sysctl_nr_trim_pages) {
  945. while (total > point) {
  946. order = ilog2(total - point);
  947. n = 1 << order;
  948. kdebug("shave %lu/%lu @%lu", n, total - point, total);
  949. atomic_long_sub(n, &mmap_pages_allocated);
  950. total -= n;
  951. set_page_refcounted(pages + total);
  952. __free_pages(pages + total, order);
  953. }
  954. }
  955. for (point = 1; point < total; point++)
  956. set_page_refcounted(&pages[point]);
  957. base = page_address(pages);
  958. region->vm_flags = vma->vm_flags |= VM_MAPPED_COPY;
  959. region->vm_start = (unsigned long) base;
  960. region->vm_end = region->vm_start + rlen;
  961. region->vm_top = region->vm_start + (total << PAGE_SHIFT);
  962. vma->vm_start = region->vm_start;
  963. vma->vm_end = region->vm_start + len;
  964. if (vma->vm_file) {
  965. /* read the contents of a file into the copy */
  966. mm_segment_t old_fs;
  967. loff_t fpos;
  968. fpos = vma->vm_pgoff;
  969. fpos <<= PAGE_SHIFT;
  970. old_fs = get_fs();
  971. set_fs(KERNEL_DS);
  972. ret = vma->vm_file->f_op->read(vma->vm_file, base, rlen, &fpos);
  973. set_fs(old_fs);
  974. if (ret < 0)
  975. goto error_free;
  976. /* clear the last little bit */
  977. if (ret < rlen)
  978. memset(base + ret, 0, rlen - ret);
  979. } else {
  980. /* if it's an anonymous mapping, then just clear it */
  981. memset(base, 0, rlen);
  982. }
  983. return 0;
  984. error_free:
  985. free_page_series(region->vm_start, region->vm_end);
  986. region->vm_start = vma->vm_start = 0;
  987. region->vm_end = vma->vm_end = 0;
  988. region->vm_top = 0;
  989. return ret;
  990. enomem:
  991. printk("Allocation of length %lu from process %d (%s) failed\n",
  992. len, current->pid, current->comm);
  993. show_free_areas();
  994. return -ENOMEM;
  995. }
  996. /*
  997. * handle mapping creation for uClinux
  998. */
  999. unsigned long do_mmap_pgoff(struct file *file,
  1000. unsigned long addr,
  1001. unsigned long len,
  1002. unsigned long prot,
  1003. unsigned long flags,
  1004. unsigned long pgoff)
  1005. {
  1006. struct vm_area_struct *vma;
  1007. struct vm_region *region;
  1008. struct rb_node *rb;
  1009. unsigned long capabilities, vm_flags, result;
  1010. int ret;
  1011. kenter(",%lx,%lx,%lx,%lx,%lx", addr, len, prot, flags, pgoff);
  1012. if (!(flags & MAP_FIXED))
  1013. addr = round_hint_to_min(addr);
  1014. /* decide whether we should attempt the mapping, and if so what sort of
  1015. * mapping */
  1016. ret = validate_mmap_request(file, addr, len, prot, flags, pgoff,
  1017. &capabilities);
  1018. if (ret < 0) {
  1019. kleave(" = %d [val]", ret);
  1020. return ret;
  1021. }
  1022. /* we've determined that we can make the mapping, now translate what we
  1023. * now know into VMA flags */
  1024. vm_flags = determine_vm_flags(file, prot, flags, capabilities);
  1025. /* we're going to need to record the mapping */
  1026. region = kmem_cache_zalloc(vm_region_jar, GFP_KERNEL);
  1027. if (!region)
  1028. goto error_getting_region;
  1029. vma = kmem_cache_zalloc(vm_area_cachep, GFP_KERNEL);
  1030. if (!vma)
  1031. goto error_getting_vma;
  1032. atomic_set(&region->vm_usage, 1);
  1033. region->vm_flags = vm_flags;
  1034. region->vm_pgoff = pgoff;
  1035. INIT_LIST_HEAD(&vma->anon_vma_node);
  1036. vma->vm_flags = vm_flags;
  1037. vma->vm_pgoff = pgoff;
  1038. if (file) {
  1039. region->vm_file = file;
  1040. get_file(file);
  1041. vma->vm_file = file;
  1042. get_file(file);
  1043. if (vm_flags & VM_EXECUTABLE) {
  1044. added_exe_file_vma(current->mm);
  1045. vma->vm_mm = current->mm;
  1046. }
  1047. }
  1048. down_write(&nommu_region_sem);
  1049. /* if we want to share, we need to check for regions created by other
  1050. * mmap() calls that overlap with our proposed mapping
  1051. * - we can only share with a superset match on most regular files
  1052. * - shared mappings on character devices and memory backed files are
  1053. * permitted to overlap inexactly as far as we are concerned for in
  1054. * these cases, sharing is handled in the driver or filesystem rather
  1055. * than here
  1056. */
  1057. if (vm_flags & VM_MAYSHARE) {
  1058. struct vm_region *pregion;
  1059. unsigned long pglen, rpglen, pgend, rpgend, start;
  1060. pglen = (len + PAGE_SIZE - 1) >> PAGE_SHIFT;
  1061. pgend = pgoff + pglen;
  1062. for (rb = rb_first(&nommu_region_tree); rb; rb = rb_next(rb)) {
  1063. pregion = rb_entry(rb, struct vm_region, vm_rb);
  1064. if (!(pregion->vm_flags & VM_MAYSHARE))
  1065. continue;
  1066. /* search for overlapping mappings on the same file */
  1067. if (pregion->vm_file->f_path.dentry->d_inode !=
  1068. file->f_path.dentry->d_inode)
  1069. continue;
  1070. if (pregion->vm_pgoff >= pgend)
  1071. continue;
  1072. rpglen = pregion->vm_end - pregion->vm_start;
  1073. rpglen = (rpglen + PAGE_SIZE - 1) >> PAGE_SHIFT;
  1074. rpgend = pregion->vm_pgoff + rpglen;
  1075. if (pgoff >= rpgend)
  1076. continue;
  1077. /* handle inexactly overlapping matches between
  1078. * mappings */
  1079. if ((pregion->vm_pgoff != pgoff || rpglen != pglen) &&
  1080. !(pgoff >= pregion->vm_pgoff && pgend <= rpgend)) {
  1081. /* new mapping is not a subset of the region */
  1082. if (!(capabilities & BDI_CAP_MAP_DIRECT))
  1083. goto sharing_violation;
  1084. continue;
  1085. }
  1086. /* we've found a region we can share */
  1087. atomic_inc(&pregion->vm_usage);
  1088. vma->vm_region = pregion;
  1089. start = pregion->vm_start;
  1090. start += (pgoff - pregion->vm_pgoff) << PAGE_SHIFT;
  1091. vma->vm_start = start;
  1092. vma->vm_end = start + len;
  1093. if (pregion->vm_flags & VM_MAPPED_COPY) {
  1094. kdebug("share copy");
  1095. vma->vm_flags |= VM_MAPPED_COPY;
  1096. } else {
  1097. kdebug("share mmap");
  1098. ret = do_mmap_shared_file(vma);
  1099. if (ret < 0) {
  1100. vma->vm_region = NULL;
  1101. vma->vm_start = 0;
  1102. vma->vm_end = 0;
  1103. atomic_dec(&pregion->vm_usage);
  1104. pregion = NULL;
  1105. goto error_just_free;
  1106. }
  1107. }
  1108. fput(region->vm_file);
  1109. kmem_cache_free(vm_region_jar, region);
  1110. region = pregion;
  1111. result = start;
  1112. goto share;
  1113. }
  1114. /* obtain the address at which to make a shared mapping
  1115. * - this is the hook for quasi-memory character devices to
  1116. * tell us the location of a shared mapping
  1117. */
  1118. if (file && file->f_op->get_unmapped_area) {
  1119. addr = file->f_op->get_unmapped_area(file, addr, len,
  1120. pgoff, flags);
  1121. if (IS_ERR((void *) addr)) {
  1122. ret = addr;
  1123. if (ret != (unsigned long) -ENOSYS)
  1124. goto error_just_free;
  1125. /* the driver refused to tell us where to site
  1126. * the mapping so we'll have to attempt to copy
  1127. * it */
  1128. ret = (unsigned long) -ENODEV;
  1129. if (!(capabilities & BDI_CAP_MAP_COPY))
  1130. goto error_just_free;
  1131. capabilities &= ~BDI_CAP_MAP_DIRECT;
  1132. } else {
  1133. vma->vm_start = region->vm_start = addr;
  1134. vma->vm_end = region->vm_end = addr + len;
  1135. }
  1136. }
  1137. }
  1138. vma->vm_region = region;
  1139. add_nommu_region(region);
  1140. /* set up the mapping */
  1141. if (file && vma->vm_flags & VM_SHARED)
  1142. ret = do_mmap_shared_file(vma);
  1143. else
  1144. ret = do_mmap_private(vma, region, len);
  1145. if (ret < 0)
  1146. goto error_put_region;
  1147. /* okay... we have a mapping; now we have to register it */
  1148. result = vma->vm_start;
  1149. current->mm->total_vm += len >> PAGE_SHIFT;
  1150. share:
  1151. add_vma_to_mm(current->mm, vma);
  1152. up_write(&nommu_region_sem);
  1153. if (prot & PROT_EXEC)
  1154. flush_icache_range(result, result + len);
  1155. kleave(" = %lx", result);
  1156. return result;
  1157. error_put_region:
  1158. __put_nommu_region(region);
  1159. if (vma) {
  1160. if (vma->vm_file) {
  1161. fput(vma->vm_file);
  1162. if (vma->vm_flags & VM_EXECUTABLE)
  1163. removed_exe_file_vma(vma->vm_mm);
  1164. }
  1165. kmem_cache_free(vm_area_cachep, vma);
  1166. }
  1167. kleave(" = %d [pr]", ret);
  1168. return ret;
  1169. error_just_free:
  1170. up_write(&nommu_region_sem);
  1171. error:
  1172. fput(region->vm_file);
  1173. kmem_cache_free(vm_region_jar, region);
  1174. fput(vma->vm_file);
  1175. if (vma->vm_flags & VM_EXECUTABLE)
  1176. removed_exe_file_vma(vma->vm_mm);
  1177. kmem_cache_free(vm_area_cachep, vma);
  1178. kleave(" = %d", ret);
  1179. return ret;
  1180. sharing_violation:
  1181. up_write(&nommu_region_sem);
  1182. printk(KERN_WARNING "Attempt to share mismatched mappings\n");
  1183. ret = -EINVAL;
  1184. goto error;
  1185. error_getting_vma:
  1186. kmem_cache_free(vm_region_jar, region);
  1187. printk(KERN_WARNING "Allocation of vma for %lu byte allocation"
  1188. " from process %d failed\n",
  1189. len, current->pid);
  1190. show_free_areas();
  1191. return -ENOMEM;
  1192. error_getting_region:
  1193. printk(KERN_WARNING "Allocation of vm region for %lu byte allocation"
  1194. " from process %d failed\n",
  1195. len, current->pid);
  1196. show_free_areas();
  1197. return -ENOMEM;
  1198. }
  1199. EXPORT_SYMBOL(do_mmap_pgoff);
  1200. /*
  1201. * split a vma into two pieces at address 'addr', a new vma is allocated either
  1202. * for the first part or the tail.
  1203. */
  1204. int split_vma(struct mm_struct *mm, struct vm_area_struct *vma,
  1205. unsigned long addr, int new_below)
  1206. {
  1207. struct vm_area_struct *new;
  1208. struct vm_region *region;
  1209. unsigned long npages;
  1210. kenter("");
  1211. /* we're only permitted to split anonymous regions that have a single
  1212. * owner */
  1213. if (vma->vm_file ||
  1214. atomic_read(&vma->vm_region->vm_usage) != 1)
  1215. return -ENOMEM;
  1216. if (mm->map_count >= sysctl_max_map_count)
  1217. return -ENOMEM;
  1218. region = kmem_cache_alloc(vm_region_jar, GFP_KERNEL);
  1219. if (!region)
  1220. return -ENOMEM;
  1221. new = kmem_cache_alloc(vm_area_cachep, GFP_KERNEL);
  1222. if (!new) {
  1223. kmem_cache_free(vm_region_jar, region);
  1224. return -ENOMEM;
  1225. }
  1226. /* most fields are the same, copy all, and then fixup */
  1227. *new = *vma;
  1228. *region = *vma->vm_region;
  1229. new->vm_region = region;
  1230. npages = (addr - vma->vm_start) >> PAGE_SHIFT;
  1231. if (new_below) {
  1232. region->vm_top = region->vm_end = new->vm_end = addr;
  1233. } else {
  1234. region->vm_start = new->vm_start = addr;
  1235. region->vm_pgoff = new->vm_pgoff += npages;
  1236. }
  1237. if (new->vm_ops && new->vm_ops->open)
  1238. new->vm_ops->open(new);
  1239. delete_vma_from_mm(vma);
  1240. down_write(&nommu_region_sem);
  1241. delete_nommu_region(vma->vm_region);
  1242. if (new_below) {
  1243. vma->vm_region->vm_start = vma->vm_start = addr;
  1244. vma->vm_region->vm_pgoff = vma->vm_pgoff += npages;
  1245. } else {
  1246. vma->vm_region->vm_end = vma->vm_end = addr;
  1247. vma->vm_region->vm_top = addr;
  1248. }
  1249. add_nommu_region(vma->vm_region);
  1250. add_nommu_region(new->vm_region);
  1251. up_write(&nommu_region_sem);
  1252. add_vma_to_mm(mm, vma);
  1253. add_vma_to_mm(mm, new);
  1254. return 0;
  1255. }
  1256. /*
  1257. * shrink a VMA by removing the specified chunk from either the beginning or
  1258. * the end
  1259. */
  1260. static int shrink_vma(struct mm_struct *mm,
  1261. struct vm_area_struct *vma,
  1262. unsigned long from, unsigned long to)
  1263. {
  1264. struct vm_region *region;
  1265. kenter("");
  1266. /* adjust the VMA's pointers, which may reposition it in the MM's tree
  1267. * and list */
  1268. delete_vma_from_mm(vma);
  1269. if (from > vma->vm_start)
  1270. vma->vm_end = from;
  1271. else
  1272. vma->vm_start = to;
  1273. add_vma_to_mm(mm, vma);
  1274. /* cut the backing region down to size */
  1275. region = vma->vm_region;
  1276. BUG_ON(atomic_read(&region->vm_usage) != 1);
  1277. down_write(&nommu_region_sem);
  1278. delete_nommu_region(region);
  1279. if (from > region->vm_start) {
  1280. to = region->vm_top;
  1281. region->vm_top = region->vm_end = from;
  1282. } else {
  1283. region->vm_start = to;
  1284. }
  1285. add_nommu_region(region);
  1286. up_write(&nommu_region_sem);
  1287. free_page_series(from, to);
  1288. return 0;
  1289. }
  1290. /*
  1291. * release a mapping
  1292. * - under NOMMU conditions the chunk to be unmapped must be backed by a single
  1293. * VMA, though it need not cover the whole VMA
  1294. */
  1295. int do_munmap(struct mm_struct *mm, unsigned long start, size_t len)
  1296. {
  1297. struct vm_area_struct *vma;
  1298. struct rb_node *rb;
  1299. unsigned long end = start + len;
  1300. int ret;
  1301. kenter(",%lx,%zx", start, len);
  1302. if (len == 0)
  1303. return -EINVAL;
  1304. /* find the first potentially overlapping VMA */
  1305. vma = find_vma(mm, start);
  1306. if (!vma) {
  1307. static int limit = 0;
  1308. if (limit < 5) {
  1309. printk(KERN_WARNING
  1310. "munmap of memory not mmapped by process %d"
  1311. " (%s): 0x%lx-0x%lx\n",
  1312. current->pid, current->comm,
  1313. start, start + len - 1);
  1314. limit++;
  1315. }
  1316. return -EINVAL;
  1317. }
  1318. /* we're allowed to split an anonymous VMA but not a file-backed one */
  1319. if (vma->vm_file) {
  1320. do {
  1321. if (start > vma->vm_start) {
  1322. kleave(" = -EINVAL [miss]");
  1323. return -EINVAL;
  1324. }
  1325. if (end == vma->vm_end)
  1326. goto erase_whole_vma;
  1327. rb = rb_next(&vma->vm_rb);
  1328. vma = rb_entry(rb, struct vm_area_struct, vm_rb);
  1329. } while (rb);
  1330. kleave(" = -EINVAL [split file]");
  1331. return -EINVAL;
  1332. } else {
  1333. /* the chunk must be a subset of the VMA found */
  1334. if (start == vma->vm_start && end == vma->vm_end)
  1335. goto erase_whole_vma;
  1336. if (start < vma->vm_start || end > vma->vm_end) {
  1337. kleave(" = -EINVAL [superset]");
  1338. return -EINVAL;
  1339. }
  1340. if (start & ~PAGE_MASK) {
  1341. kleave(" = -EINVAL [unaligned start]");
  1342. return -EINVAL;
  1343. }
  1344. if (end != vma->vm_end && end & ~PAGE_MASK) {
  1345. kleave(" = -EINVAL [unaligned split]");
  1346. return -EINVAL;
  1347. }
  1348. if (start != vma->vm_start && end != vma->vm_end) {
  1349. ret = split_vma(mm, vma, start, 1);
  1350. if (ret < 0) {
  1351. kleave(" = %d [split]", ret);
  1352. return ret;
  1353. }
  1354. }
  1355. return shrink_vma(mm, vma, start, end);
  1356. }
  1357. erase_whole_vma:
  1358. delete_vma_from_mm(vma);
  1359. delete_vma(mm, vma);
  1360. kleave(" = 0");
  1361. return 0;
  1362. }
  1363. EXPORT_SYMBOL(do_munmap);
  1364. SYSCALL_DEFINE2(munmap, unsigned long, addr, size_t, len)
  1365. {
  1366. int ret;
  1367. struct mm_struct *mm = current->mm;
  1368. down_write(&mm->mmap_sem);
  1369. ret = do_munmap(mm, addr, len);
  1370. up_write(&mm->mmap_sem);
  1371. return ret;
  1372. }
  1373. /*
  1374. * release all the mappings made in a process's VM space
  1375. */
  1376. void exit_mmap(struct mm_struct *mm)
  1377. {
  1378. struct vm_area_struct *vma;
  1379. if (!mm)
  1380. return;
  1381. kenter("");
  1382. mm->total_vm = 0;
  1383. while ((vma = mm->mmap)) {
  1384. mm->mmap = vma->vm_next;
  1385. delete_vma_from_mm(vma);
  1386. delete_vma(mm, vma);
  1387. }
  1388. kleave("");
  1389. }
  1390. unsigned long do_brk(unsigned long addr, unsigned long len)
  1391. {
  1392. return -ENOMEM;
  1393. }
  1394. /*
  1395. * expand (or shrink) an existing mapping, potentially moving it at the same
  1396. * time (controlled by the MREMAP_MAYMOVE flag and available VM space)
  1397. *
  1398. * under NOMMU conditions, we only permit changing a mapping's size, and only
  1399. * as long as it stays within the region allocated by do_mmap_private() and the
  1400. * block is not shareable
  1401. *
  1402. * MREMAP_FIXED is not supported under NOMMU conditions
  1403. */
  1404. unsigned long do_mremap(unsigned long addr,
  1405. unsigned long old_len, unsigned long new_len,
  1406. unsigned long flags, unsigned long new_addr)
  1407. {
  1408. struct vm_area_struct *vma;
  1409. /* insanity checks first */
  1410. if (old_len == 0 || new_len == 0)
  1411. return (unsigned long) -EINVAL;
  1412. if (addr & ~PAGE_MASK)
  1413. return -EINVAL;
  1414. if (flags & MREMAP_FIXED && new_addr != addr)
  1415. return (unsigned long) -EINVAL;
  1416. vma = find_vma_exact(current->mm, addr, old_len);
  1417. if (!vma)
  1418. return (unsigned long) -EINVAL;
  1419. if (vma->vm_end != vma->vm_start + old_len)
  1420. return (unsigned long) -EFAULT;
  1421. if (vma->vm_flags & VM_MAYSHARE)
  1422. return (unsigned long) -EPERM;
  1423. if (new_len > vma->vm_region->vm_end - vma->vm_region->vm_start)
  1424. return (unsigned long) -ENOMEM;
  1425. /* all checks complete - do it */
  1426. vma->vm_end = vma->vm_start + new_len;
  1427. return vma->vm_start;
  1428. }
  1429. EXPORT_SYMBOL(do_mremap);
  1430. SYSCALL_DEFINE5(mremap, unsigned long, addr, unsigned long, old_len,
  1431. unsigned long, new_len, unsigned long, flags,
  1432. unsigned long, new_addr)
  1433. {
  1434. unsigned long ret;
  1435. down_write(&current->mm->mmap_sem);
  1436. ret = do_mremap(addr, old_len, new_len, flags, new_addr);
  1437. up_write(&current->mm->mmap_sem);
  1438. return ret;
  1439. }
  1440. struct page *follow_page(struct vm_area_struct *vma, unsigned long address,
  1441. unsigned int foll_flags)
  1442. {
  1443. return NULL;
  1444. }
  1445. int remap_pfn_range(struct vm_area_struct *vma, unsigned long from,
  1446. unsigned long to, unsigned long size, pgprot_t prot)
  1447. {
  1448. vma->vm_start = vma->vm_pgoff << PAGE_SHIFT;
  1449. return 0;
  1450. }
  1451. EXPORT_SYMBOL(remap_pfn_range);
  1452. int remap_vmalloc_range(struct vm_area_struct *vma, void *addr,
  1453. unsigned long pgoff)
  1454. {
  1455. unsigned int size = vma->vm_end - vma->vm_start;
  1456. if (!(vma->vm_flags & VM_USERMAP))
  1457. return -EINVAL;
  1458. vma->vm_start = (unsigned long)(addr + (pgoff << PAGE_SHIFT));
  1459. vma->vm_end = vma->vm_start + size;
  1460. return 0;
  1461. }
  1462. EXPORT_SYMBOL(remap_vmalloc_range);
  1463. void swap_unplug_io_fn(struct backing_dev_info *bdi, struct page *page)
  1464. {
  1465. }
  1466. unsigned long arch_get_unmapped_area(struct file *file, unsigned long addr,
  1467. unsigned long len, unsigned long pgoff, unsigned long flags)
  1468. {
  1469. return -ENOMEM;
  1470. }
  1471. void arch_unmap_area(struct mm_struct *mm, unsigned long addr)
  1472. {
  1473. }
  1474. void unmap_mapping_range(struct address_space *mapping,
  1475. loff_t const holebegin, loff_t const holelen,
  1476. int even_cows)
  1477. {
  1478. }
  1479. EXPORT_SYMBOL(unmap_mapping_range);
  1480. /*
  1481. * ask for an unmapped area at which to create a mapping on a file
  1482. */
  1483. unsigned long get_unmapped_area(struct file *file, unsigned long addr,
  1484. unsigned long len, unsigned long pgoff,
  1485. unsigned long flags)
  1486. {
  1487. unsigned long (*get_area)(struct file *, unsigned long, unsigned long,
  1488. unsigned long, unsigned long);
  1489. get_area = current->mm->get_unmapped_area;
  1490. if (file && file->f_op && file->f_op->get_unmapped_area)
  1491. get_area = file->f_op->get_unmapped_area;
  1492. if (!get_area)
  1493. return -ENOSYS;
  1494. return get_area(file, addr, len, pgoff, flags);
  1495. }
  1496. EXPORT_SYMBOL(get_unmapped_area);
  1497. /*
  1498. * Check that a process has enough memory to allocate a new virtual
  1499. * mapping. 0 means there is enough memory for the allocation to
  1500. * succeed and -ENOMEM implies there is not.
  1501. *
  1502. * We currently support three overcommit policies, which are set via the
  1503. * vm.overcommit_memory sysctl. See Documentation/vm/overcommit-accounting
  1504. *
  1505. * Strict overcommit modes added 2002 Feb 26 by Alan Cox.
  1506. * Additional code 2002 Jul 20 by Robert Love.
  1507. *
  1508. * cap_sys_admin is 1 if the process has admin privileges, 0 otherwise.
  1509. *
  1510. * Note this is a helper function intended to be used by LSMs which
  1511. * wish to use this logic.
  1512. */
  1513. int __vm_enough_memory(struct mm_struct *mm, long pages, int cap_sys_admin)
  1514. {
  1515. unsigned long free, allowed;
  1516. vm_acct_memory(pages);
  1517. /*
  1518. * Sometimes we want to use more memory than we have
  1519. */
  1520. if (sysctl_overcommit_memory == OVERCOMMIT_ALWAYS)
  1521. return 0;
  1522. if (sysctl_overcommit_memory == OVERCOMMIT_GUESS) {
  1523. unsigned long n;
  1524. free = global_page_state(NR_FILE_PAGES);
  1525. free += nr_swap_pages;
  1526. /*
  1527. * Any slabs which are created with the
  1528. * SLAB_RECLAIM_ACCOUNT flag claim to have contents
  1529. * which are reclaimable, under pressure. The dentry
  1530. * cache and most inode caches should fall into this
  1531. */
  1532. free += global_page_state(NR_SLAB_RECLAIMABLE);
  1533. /*
  1534. * Leave the last 3% for root
  1535. */
  1536. if (!cap_sys_admin)
  1537. free -= free / 32;
  1538. if (free > pages)
  1539. return 0;
  1540. /*
  1541. * nr_free_pages() is very expensive on large systems,
  1542. * only call if we're about to fail.
  1543. */
  1544. n = nr_free_pages();
  1545. /*
  1546. * Leave reserved pages. The pages are not for anonymous pages.
  1547. */
  1548. if (n <= totalreserve_pages)
  1549. goto error;
  1550. else
  1551. n -= totalreserve_pages;
  1552. /*
  1553. * Leave the last 3% for root
  1554. */
  1555. if (!cap_sys_admin)
  1556. n -= n / 32;
  1557. free += n;
  1558. if (free > pages)
  1559. return 0;
  1560. goto error;
  1561. }
  1562. allowed = totalram_pages * sysctl_overcommit_ratio / 100;
  1563. /*
  1564. * Leave the last 3% for root
  1565. */
  1566. if (!cap_sys_admin)
  1567. allowed -= allowed / 32;
  1568. allowed += total_swap_pages;
  1569. /* Don't let a single process grow too big:
  1570. leave 3% of the size of this process for other processes */
  1571. if (mm)
  1572. allowed -= mm->total_vm / 32;
  1573. if (percpu_counter_read_positive(&vm_committed_as) < allowed)
  1574. return 0;
  1575. error:
  1576. vm_unacct_memory(pages);
  1577. return -ENOMEM;
  1578. }
  1579. int in_gate_area_no_task(unsigned long addr)
  1580. {
  1581. return 0;
  1582. }
  1583. int filemap_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
  1584. {
  1585. BUG();
  1586. return 0;
  1587. }
  1588. EXPORT_SYMBOL(filemap_fault);
  1589. /*
  1590. * Access another process' address space.
  1591. * - source/target buffer must be kernel space
  1592. */
  1593. int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len, int write)
  1594. {
  1595. struct vm_area_struct *vma;
  1596. struct mm_struct *mm;
  1597. if (addr + len < addr)
  1598. return 0;
  1599. mm = get_task_mm(tsk);
  1600. if (!mm)
  1601. return 0;
  1602. down_read(&mm->mmap_sem);
  1603. /* the access must start within one of the target process's mappings */
  1604. vma = find_vma(mm, addr);
  1605. if (vma) {
  1606. /* don't overrun this mapping */
  1607. if (addr + len >= vma->vm_end)
  1608. len = vma->vm_end - addr;
  1609. /* only read or write mappings where it is permitted */
  1610. if (write && vma->vm_flags & VM_MAYWRITE)
  1611. len -= copy_to_user((void *) addr, buf, len);
  1612. else if (!write && vma->vm_flags & VM_MAYREAD)
  1613. len -= copy_from_user(buf, (void *) addr, len);
  1614. else
  1615. len = 0;
  1616. } else {
  1617. len = 0;
  1618. }
  1619. up_read(&mm->mmap_sem);
  1620. mmput(mm);
  1621. return len;
  1622. }