nommu.c 51 KB

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