nommu.c 51 KB

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