nommu.c 46 KB

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