nommu.c 53 KB

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