nommu.c 53 KB

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