nommu.c 46 KB

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