sys_ia32.c 72 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904
  1. /*
  2. * sys_ia32.c: Conversion between 32bit and 64bit native syscalls. Derived from sys_sparc32.c.
  3. *
  4. * Copyright (C) 2000 VA Linux Co
  5. * Copyright (C) 2000 Don Dugger <n0ano@valinux.com>
  6. * Copyright (C) 1999 Arun Sharma <arun.sharma@intel.com>
  7. * Copyright (C) 1997,1998 Jakub Jelinek (jj@sunsite.mff.cuni.cz)
  8. * Copyright (C) 1997 David S. Miller (davem@caip.rutgers.edu)
  9. * Copyright (C) 2000-2003, 2005 Hewlett-Packard Co
  10. * David Mosberger-Tang <davidm@hpl.hp.com>
  11. * Copyright (C) 2004 Gordon Jin <gordon.jin@intel.com>
  12. *
  13. * These routines maintain argument size conversion between 32bit and 64bit
  14. * environment.
  15. */
  16. #include <linux/kernel.h>
  17. #include <linux/syscalls.h>
  18. #include <linux/sysctl.h>
  19. #include <linux/sched.h>
  20. #include <linux/fs.h>
  21. #include <linux/file.h>
  22. #include <linux/signal.h>
  23. #include <linux/resource.h>
  24. #include <linux/times.h>
  25. #include <linux/utsname.h>
  26. #include <linux/smp.h>
  27. #include <linux/smp_lock.h>
  28. #include <linux/sem.h>
  29. #include <linux/msg.h>
  30. #include <linux/mm.h>
  31. #include <linux/shm.h>
  32. #include <linux/slab.h>
  33. #include <linux/uio.h>
  34. #include <linux/socket.h>
  35. #include <linux/quota.h>
  36. #include <linux/poll.h>
  37. #include <linux/eventpoll.h>
  38. #include <linux/personality.h>
  39. #include <linux/ptrace.h>
  40. #include <linux/regset.h>
  41. #include <linux/stat.h>
  42. #include <linux/ipc.h>
  43. #include <linux/capability.h>
  44. #include <linux/compat.h>
  45. #include <linux/vfs.h>
  46. #include <linux/mman.h>
  47. #include <linux/mutex.h>
  48. #include <asm/intrinsics.h>
  49. #include <asm/types.h>
  50. #include <asm/uaccess.h>
  51. #include <asm/unistd.h>
  52. #include "ia32priv.h"
  53. #include <net/scm.h>
  54. #include <net/sock.h>
  55. #define DEBUG 0
  56. #if DEBUG
  57. # define DBG(fmt...) printk(KERN_DEBUG fmt)
  58. #else
  59. # define DBG(fmt...)
  60. #endif
  61. #define ROUND_UP(x,a) ((__typeof__(x))(((unsigned long)(x) + ((a) - 1)) & ~((a) - 1)))
  62. #define OFFSET4K(a) ((a) & 0xfff)
  63. #define PAGE_START(addr) ((addr) & PAGE_MASK)
  64. #define MINSIGSTKSZ_IA32 2048
  65. #define high2lowuid(uid) ((uid) > 65535 ? 65534 : (uid))
  66. #define high2lowgid(gid) ((gid) > 65535 ? 65534 : (gid))
  67. /*
  68. * Anything that modifies or inspects ia32 user virtual memory must hold this semaphore
  69. * while doing so.
  70. */
  71. /* XXX make per-mm: */
  72. static DEFINE_MUTEX(ia32_mmap_mutex);
  73. asmlinkage long
  74. sys32_execve (char __user *name, compat_uptr_t __user *argv, compat_uptr_t __user *envp,
  75. struct pt_regs *regs)
  76. {
  77. long error;
  78. char *filename;
  79. unsigned long old_map_base, old_task_size, tssd;
  80. filename = getname(name);
  81. error = PTR_ERR(filename);
  82. if (IS_ERR(filename))
  83. return error;
  84. old_map_base = current->thread.map_base;
  85. old_task_size = current->thread.task_size;
  86. tssd = ia64_get_kr(IA64_KR_TSSD);
  87. /* we may be exec'ing a 64-bit process: reset map base, task-size, and io-base: */
  88. current->thread.map_base = DEFAULT_MAP_BASE;
  89. current->thread.task_size = DEFAULT_TASK_SIZE;
  90. ia64_set_kr(IA64_KR_IO_BASE, current->thread.old_iob);
  91. ia64_set_kr(IA64_KR_TSSD, current->thread.old_k1);
  92. error = compat_do_execve(filename, argv, envp, regs);
  93. putname(filename);
  94. if (error < 0) {
  95. /* oops, execve failed, switch back to old values... */
  96. ia64_set_kr(IA64_KR_IO_BASE, IA32_IOBASE);
  97. ia64_set_kr(IA64_KR_TSSD, tssd);
  98. current->thread.map_base = old_map_base;
  99. current->thread.task_size = old_task_size;
  100. }
  101. return error;
  102. }
  103. #if PAGE_SHIFT > IA32_PAGE_SHIFT
  104. static int
  105. get_page_prot (struct vm_area_struct *vma, unsigned long addr)
  106. {
  107. int prot = 0;
  108. if (!vma || vma->vm_start > addr)
  109. return 0;
  110. if (vma->vm_flags & VM_READ)
  111. prot |= PROT_READ;
  112. if (vma->vm_flags & VM_WRITE)
  113. prot |= PROT_WRITE;
  114. if (vma->vm_flags & VM_EXEC)
  115. prot |= PROT_EXEC;
  116. return prot;
  117. }
  118. /*
  119. * Map a subpage by creating an anonymous page that contains the union of the old page and
  120. * the subpage.
  121. */
  122. static unsigned long
  123. mmap_subpage (struct file *file, unsigned long start, unsigned long end, int prot, int flags,
  124. loff_t off)
  125. {
  126. void *page = NULL;
  127. struct inode *inode;
  128. unsigned long ret = 0;
  129. struct vm_area_struct *vma = find_vma(current->mm, start);
  130. int old_prot = get_page_prot(vma, start);
  131. DBG("mmap_subpage(file=%p,start=0x%lx,end=0x%lx,prot=%x,flags=%x,off=0x%llx)\n",
  132. file, start, end, prot, flags, off);
  133. /* Optimize the case where the old mmap and the new mmap are both anonymous */
  134. if ((old_prot & PROT_WRITE) && (flags & MAP_ANONYMOUS) && !vma->vm_file) {
  135. if (clear_user((void __user *) start, end - start)) {
  136. ret = -EFAULT;
  137. goto out;
  138. }
  139. goto skip_mmap;
  140. }
  141. page = (void *) get_zeroed_page(GFP_KERNEL);
  142. if (!page)
  143. return -ENOMEM;
  144. if (old_prot)
  145. copy_from_user(page, (void __user *) PAGE_START(start), PAGE_SIZE);
  146. down_write(&current->mm->mmap_sem);
  147. {
  148. ret = do_mmap(NULL, PAGE_START(start), PAGE_SIZE, prot | PROT_WRITE,
  149. flags | MAP_FIXED | MAP_ANONYMOUS, 0);
  150. }
  151. up_write(&current->mm->mmap_sem);
  152. if (IS_ERR((void *) ret))
  153. goto out;
  154. if (old_prot) {
  155. /* copy back the old page contents. */
  156. if (offset_in_page(start))
  157. copy_to_user((void __user *) PAGE_START(start), page,
  158. offset_in_page(start));
  159. if (offset_in_page(end))
  160. copy_to_user((void __user *) end, page + offset_in_page(end),
  161. PAGE_SIZE - offset_in_page(end));
  162. }
  163. if (!(flags & MAP_ANONYMOUS)) {
  164. /* read the file contents */
  165. inode = file->f_path.dentry->d_inode;
  166. if (!inode->i_fop || !file->f_op->read
  167. || ((*file->f_op->read)(file, (char __user *) start, end - start, &off) < 0))
  168. {
  169. ret = -EINVAL;
  170. goto out;
  171. }
  172. }
  173. skip_mmap:
  174. if (!(prot & PROT_WRITE))
  175. ret = sys_mprotect(PAGE_START(start), PAGE_SIZE, prot | old_prot);
  176. out:
  177. if (page)
  178. free_page((unsigned long) page);
  179. return ret;
  180. }
  181. /* SLAB cache for ia64_partial_page structures */
  182. struct kmem_cache *ia64_partial_page_cachep;
  183. /*
  184. * init ia64_partial_page_list.
  185. * return 0 means kmalloc fail.
  186. */
  187. struct ia64_partial_page_list*
  188. ia32_init_pp_list(void)
  189. {
  190. struct ia64_partial_page_list *p;
  191. if ((p = kmalloc(sizeof(*p), GFP_KERNEL)) == NULL)
  192. return p;
  193. p->pp_head = NULL;
  194. p->ppl_rb = RB_ROOT;
  195. p->pp_hint = NULL;
  196. atomic_set(&p->pp_count, 1);
  197. return p;
  198. }
  199. /*
  200. * Search for the partial page with @start in partial page list @ppl.
  201. * If finds the partial page, return the found partial page.
  202. * Else, return 0 and provide @pprev, @rb_link, @rb_parent to
  203. * be used by later __ia32_insert_pp().
  204. */
  205. static struct ia64_partial_page *
  206. __ia32_find_pp(struct ia64_partial_page_list *ppl, unsigned int start,
  207. struct ia64_partial_page **pprev, struct rb_node ***rb_link,
  208. struct rb_node **rb_parent)
  209. {
  210. struct ia64_partial_page *pp;
  211. struct rb_node **__rb_link, *__rb_parent, *rb_prev;
  212. pp = ppl->pp_hint;
  213. if (pp && pp->base == start)
  214. return pp;
  215. __rb_link = &ppl->ppl_rb.rb_node;
  216. rb_prev = __rb_parent = NULL;
  217. while (*__rb_link) {
  218. __rb_parent = *__rb_link;
  219. pp = rb_entry(__rb_parent, struct ia64_partial_page, pp_rb);
  220. if (pp->base == start) {
  221. ppl->pp_hint = pp;
  222. return pp;
  223. } else if (pp->base < start) {
  224. rb_prev = __rb_parent;
  225. __rb_link = &__rb_parent->rb_right;
  226. } else {
  227. __rb_link = &__rb_parent->rb_left;
  228. }
  229. }
  230. *rb_link = __rb_link;
  231. *rb_parent = __rb_parent;
  232. *pprev = NULL;
  233. if (rb_prev)
  234. *pprev = rb_entry(rb_prev, struct ia64_partial_page, pp_rb);
  235. return NULL;
  236. }
  237. /*
  238. * insert @pp into @ppl.
  239. */
  240. static void
  241. __ia32_insert_pp(struct ia64_partial_page_list *ppl,
  242. struct ia64_partial_page *pp, struct ia64_partial_page *prev,
  243. struct rb_node **rb_link, struct rb_node *rb_parent)
  244. {
  245. /* link list */
  246. if (prev) {
  247. pp->next = prev->next;
  248. prev->next = pp;
  249. } else {
  250. ppl->pp_head = pp;
  251. if (rb_parent)
  252. pp->next = rb_entry(rb_parent,
  253. struct ia64_partial_page, pp_rb);
  254. else
  255. pp->next = NULL;
  256. }
  257. /* link rb */
  258. rb_link_node(&pp->pp_rb, rb_parent, rb_link);
  259. rb_insert_color(&pp->pp_rb, &ppl->ppl_rb);
  260. ppl->pp_hint = pp;
  261. }
  262. /*
  263. * delete @pp from partial page list @ppl.
  264. */
  265. static void
  266. __ia32_delete_pp(struct ia64_partial_page_list *ppl,
  267. struct ia64_partial_page *pp, struct ia64_partial_page *prev)
  268. {
  269. if (prev) {
  270. prev->next = pp->next;
  271. if (ppl->pp_hint == pp)
  272. ppl->pp_hint = prev;
  273. } else {
  274. ppl->pp_head = pp->next;
  275. if (ppl->pp_hint == pp)
  276. ppl->pp_hint = pp->next;
  277. }
  278. rb_erase(&pp->pp_rb, &ppl->ppl_rb);
  279. kmem_cache_free(ia64_partial_page_cachep, pp);
  280. }
  281. static struct ia64_partial_page *
  282. __pp_prev(struct ia64_partial_page *pp)
  283. {
  284. struct rb_node *prev = rb_prev(&pp->pp_rb);
  285. if (prev)
  286. return rb_entry(prev, struct ia64_partial_page, pp_rb);
  287. else
  288. return NULL;
  289. }
  290. /*
  291. * Delete partial pages with address between @start and @end.
  292. * @start and @end are page aligned.
  293. */
  294. static void
  295. __ia32_delete_pp_range(unsigned int start, unsigned int end)
  296. {
  297. struct ia64_partial_page *pp, *prev;
  298. struct rb_node **rb_link, *rb_parent;
  299. if (start >= end)
  300. return;
  301. pp = __ia32_find_pp(current->thread.ppl, start, &prev,
  302. &rb_link, &rb_parent);
  303. if (pp)
  304. prev = __pp_prev(pp);
  305. else {
  306. if (prev)
  307. pp = prev->next;
  308. else
  309. pp = current->thread.ppl->pp_head;
  310. }
  311. while (pp && pp->base < end) {
  312. struct ia64_partial_page *tmp = pp->next;
  313. __ia32_delete_pp(current->thread.ppl, pp, prev);
  314. pp = tmp;
  315. }
  316. }
  317. /*
  318. * Set the range between @start and @end in bitmap.
  319. * @start and @end should be IA32 page aligned and in the same IA64 page.
  320. */
  321. static int
  322. __ia32_set_pp(unsigned int start, unsigned int end, int flags)
  323. {
  324. struct ia64_partial_page *pp, *prev;
  325. struct rb_node ** rb_link, *rb_parent;
  326. unsigned int pstart, start_bit, end_bit, i;
  327. pstart = PAGE_START(start);
  328. start_bit = (start % PAGE_SIZE) / IA32_PAGE_SIZE;
  329. end_bit = (end % PAGE_SIZE) / IA32_PAGE_SIZE;
  330. if (end_bit == 0)
  331. end_bit = PAGE_SIZE / IA32_PAGE_SIZE;
  332. pp = __ia32_find_pp(current->thread.ppl, pstart, &prev,
  333. &rb_link, &rb_parent);
  334. if (pp) {
  335. for (i = start_bit; i < end_bit; i++)
  336. set_bit(i, &pp->bitmap);
  337. /*
  338. * Check: if this partial page has been set to a full page,
  339. * then delete it.
  340. */
  341. if (find_first_zero_bit(&pp->bitmap, sizeof(pp->bitmap)*8) >=
  342. PAGE_SIZE/IA32_PAGE_SIZE) {
  343. __ia32_delete_pp(current->thread.ppl, pp, __pp_prev(pp));
  344. }
  345. return 0;
  346. }
  347. /*
  348. * MAP_FIXED may lead to overlapping mmap.
  349. * In this case, the requested mmap area may already mmaped as a full
  350. * page. So check vma before adding a new partial page.
  351. */
  352. if (flags & MAP_FIXED) {
  353. struct vm_area_struct *vma = find_vma(current->mm, pstart);
  354. if (vma && vma->vm_start <= pstart)
  355. return 0;
  356. }
  357. /* new a ia64_partial_page */
  358. pp = kmem_cache_alloc(ia64_partial_page_cachep, GFP_KERNEL);
  359. if (!pp)
  360. return -ENOMEM;
  361. pp->base = pstart;
  362. pp->bitmap = 0;
  363. for (i=start_bit; i<end_bit; i++)
  364. set_bit(i, &(pp->bitmap));
  365. pp->next = NULL;
  366. __ia32_insert_pp(current->thread.ppl, pp, prev, rb_link, rb_parent);
  367. return 0;
  368. }
  369. /*
  370. * @start and @end should be IA32 page aligned, but don't need to be in the
  371. * same IA64 page. Split @start and @end to make sure they're in the same IA64
  372. * page, then call __ia32_set_pp().
  373. */
  374. static void
  375. ia32_set_pp(unsigned int start, unsigned int end, int flags)
  376. {
  377. down_write(&current->mm->mmap_sem);
  378. if (flags & MAP_FIXED) {
  379. /*
  380. * MAP_FIXED may lead to overlapping mmap. When this happens,
  381. * a series of complete IA64 pages results in deletion of
  382. * old partial pages in that range.
  383. */
  384. __ia32_delete_pp_range(PAGE_ALIGN(start), PAGE_START(end));
  385. }
  386. if (end < PAGE_ALIGN(start)) {
  387. __ia32_set_pp(start, end, flags);
  388. } else {
  389. if (offset_in_page(start))
  390. __ia32_set_pp(start, PAGE_ALIGN(start), flags);
  391. if (offset_in_page(end))
  392. __ia32_set_pp(PAGE_START(end), end, flags);
  393. }
  394. up_write(&current->mm->mmap_sem);
  395. }
  396. /*
  397. * Unset the range between @start and @end in bitmap.
  398. * @start and @end should be IA32 page aligned and in the same IA64 page.
  399. * After doing that, if the bitmap is 0, then free the page and return 1,
  400. * else return 0;
  401. * If not find the partial page in the list, then
  402. * If the vma exists, then the full page is set to a partial page;
  403. * Else return -ENOMEM.
  404. */
  405. static int
  406. __ia32_unset_pp(unsigned int start, unsigned int end)
  407. {
  408. struct ia64_partial_page *pp, *prev;
  409. struct rb_node ** rb_link, *rb_parent;
  410. unsigned int pstart, start_bit, end_bit, i;
  411. struct vm_area_struct *vma;
  412. pstart = PAGE_START(start);
  413. start_bit = (start % PAGE_SIZE) / IA32_PAGE_SIZE;
  414. end_bit = (end % PAGE_SIZE) / IA32_PAGE_SIZE;
  415. if (end_bit == 0)
  416. end_bit = PAGE_SIZE / IA32_PAGE_SIZE;
  417. pp = __ia32_find_pp(current->thread.ppl, pstart, &prev,
  418. &rb_link, &rb_parent);
  419. if (pp) {
  420. for (i = start_bit; i < end_bit; i++)
  421. clear_bit(i, &pp->bitmap);
  422. if (pp->bitmap == 0) {
  423. __ia32_delete_pp(current->thread.ppl, pp, __pp_prev(pp));
  424. return 1;
  425. }
  426. return 0;
  427. }
  428. vma = find_vma(current->mm, pstart);
  429. if (!vma || vma->vm_start > pstart) {
  430. return -ENOMEM;
  431. }
  432. /* new a ia64_partial_page */
  433. pp = kmem_cache_alloc(ia64_partial_page_cachep, GFP_KERNEL);
  434. if (!pp)
  435. return -ENOMEM;
  436. pp->base = pstart;
  437. pp->bitmap = 0;
  438. for (i = 0; i < start_bit; i++)
  439. set_bit(i, &(pp->bitmap));
  440. for (i = end_bit; i < PAGE_SIZE / IA32_PAGE_SIZE; i++)
  441. set_bit(i, &(pp->bitmap));
  442. pp->next = NULL;
  443. __ia32_insert_pp(current->thread.ppl, pp, prev, rb_link, rb_parent);
  444. return 0;
  445. }
  446. /*
  447. * Delete pp between PAGE_ALIGN(start) and PAGE_START(end) by calling
  448. * __ia32_delete_pp_range(). Unset possible partial pages by calling
  449. * __ia32_unset_pp().
  450. * The returned value see __ia32_unset_pp().
  451. */
  452. static int
  453. ia32_unset_pp(unsigned int *startp, unsigned int *endp)
  454. {
  455. unsigned int start = *startp, end = *endp;
  456. int ret = 0;
  457. down_write(&current->mm->mmap_sem);
  458. __ia32_delete_pp_range(PAGE_ALIGN(start), PAGE_START(end));
  459. if (end < PAGE_ALIGN(start)) {
  460. ret = __ia32_unset_pp(start, end);
  461. if (ret == 1) {
  462. *startp = PAGE_START(start);
  463. *endp = PAGE_ALIGN(end);
  464. }
  465. if (ret == 0) {
  466. /* to shortcut sys_munmap() in sys32_munmap() */
  467. *startp = PAGE_START(start);
  468. *endp = PAGE_START(end);
  469. }
  470. } else {
  471. if (offset_in_page(start)) {
  472. ret = __ia32_unset_pp(start, PAGE_ALIGN(start));
  473. if (ret == 1)
  474. *startp = PAGE_START(start);
  475. if (ret == 0)
  476. *startp = PAGE_ALIGN(start);
  477. if (ret < 0)
  478. goto out;
  479. }
  480. if (offset_in_page(end)) {
  481. ret = __ia32_unset_pp(PAGE_START(end), end);
  482. if (ret == 1)
  483. *endp = PAGE_ALIGN(end);
  484. if (ret == 0)
  485. *endp = PAGE_START(end);
  486. }
  487. }
  488. out:
  489. up_write(&current->mm->mmap_sem);
  490. return ret;
  491. }
  492. /*
  493. * Compare the range between @start and @end with bitmap in partial page.
  494. * @start and @end should be IA32 page aligned and in the same IA64 page.
  495. */
  496. static int
  497. __ia32_compare_pp(unsigned int start, unsigned int end)
  498. {
  499. struct ia64_partial_page *pp, *prev;
  500. struct rb_node ** rb_link, *rb_parent;
  501. unsigned int pstart, start_bit, end_bit, size;
  502. unsigned int first_bit, next_zero_bit; /* the first range in bitmap */
  503. pstart = PAGE_START(start);
  504. pp = __ia32_find_pp(current->thread.ppl, pstart, &prev,
  505. &rb_link, &rb_parent);
  506. if (!pp)
  507. return 1;
  508. start_bit = (start % PAGE_SIZE) / IA32_PAGE_SIZE;
  509. end_bit = (end % PAGE_SIZE) / IA32_PAGE_SIZE;
  510. size = sizeof(pp->bitmap) * 8;
  511. first_bit = find_first_bit(&pp->bitmap, size);
  512. next_zero_bit = find_next_zero_bit(&pp->bitmap, size, first_bit);
  513. if ((start_bit < first_bit) || (end_bit > next_zero_bit)) {
  514. /* exceeds the first range in bitmap */
  515. return -ENOMEM;
  516. } else if ((start_bit == first_bit) && (end_bit == next_zero_bit)) {
  517. first_bit = find_next_bit(&pp->bitmap, size, next_zero_bit);
  518. if ((next_zero_bit < first_bit) && (first_bit < size))
  519. return 1; /* has next range */
  520. else
  521. return 0; /* no next range */
  522. } else
  523. return 1;
  524. }
  525. /*
  526. * @start and @end should be IA32 page aligned, but don't need to be in the
  527. * same IA64 page. Split @start and @end to make sure they're in the same IA64
  528. * page, then call __ia32_compare_pp().
  529. *
  530. * Take this as example: the range is the 1st and 2nd 4K page.
  531. * Return 0 if they fit bitmap exactly, i.e. bitmap = 00000011;
  532. * Return 1 if the range doesn't cover whole bitmap, e.g. bitmap = 00001111;
  533. * Return -ENOMEM if the range exceeds the bitmap, e.g. bitmap = 00000001 or
  534. * bitmap = 00000101.
  535. */
  536. static int
  537. ia32_compare_pp(unsigned int *startp, unsigned int *endp)
  538. {
  539. unsigned int start = *startp, end = *endp;
  540. int retval = 0;
  541. down_write(&current->mm->mmap_sem);
  542. if (end < PAGE_ALIGN(start)) {
  543. retval = __ia32_compare_pp(start, end);
  544. if (retval == 0) {
  545. *startp = PAGE_START(start);
  546. *endp = PAGE_ALIGN(end);
  547. }
  548. } else {
  549. if (offset_in_page(start)) {
  550. retval = __ia32_compare_pp(start,
  551. PAGE_ALIGN(start));
  552. if (retval == 0)
  553. *startp = PAGE_START(start);
  554. if (retval < 0)
  555. goto out;
  556. }
  557. if (offset_in_page(end)) {
  558. retval = __ia32_compare_pp(PAGE_START(end), end);
  559. if (retval == 0)
  560. *endp = PAGE_ALIGN(end);
  561. }
  562. }
  563. out:
  564. up_write(&current->mm->mmap_sem);
  565. return retval;
  566. }
  567. static void
  568. __ia32_drop_pp_list(struct ia64_partial_page_list *ppl)
  569. {
  570. struct ia64_partial_page *pp = ppl->pp_head;
  571. while (pp) {
  572. struct ia64_partial_page *next = pp->next;
  573. kmem_cache_free(ia64_partial_page_cachep, pp);
  574. pp = next;
  575. }
  576. kfree(ppl);
  577. }
  578. void
  579. ia32_drop_ia64_partial_page_list(struct task_struct *task)
  580. {
  581. struct ia64_partial_page_list* ppl = task->thread.ppl;
  582. if (ppl && atomic_dec_and_test(&ppl->pp_count))
  583. __ia32_drop_pp_list(ppl);
  584. }
  585. /*
  586. * Copy current->thread.ppl to ppl (already initialized).
  587. */
  588. static int
  589. __ia32_copy_pp_list(struct ia64_partial_page_list *ppl)
  590. {
  591. struct ia64_partial_page *pp, *tmp, *prev;
  592. struct rb_node **rb_link, *rb_parent;
  593. ppl->pp_head = NULL;
  594. ppl->pp_hint = NULL;
  595. ppl->ppl_rb = RB_ROOT;
  596. rb_link = &ppl->ppl_rb.rb_node;
  597. rb_parent = NULL;
  598. prev = NULL;
  599. for (pp = current->thread.ppl->pp_head; pp; pp = pp->next) {
  600. tmp = kmem_cache_alloc(ia64_partial_page_cachep, GFP_KERNEL);
  601. if (!tmp)
  602. return -ENOMEM;
  603. *tmp = *pp;
  604. __ia32_insert_pp(ppl, tmp, prev, rb_link, rb_parent);
  605. prev = tmp;
  606. rb_link = &tmp->pp_rb.rb_right;
  607. rb_parent = &tmp->pp_rb;
  608. }
  609. return 0;
  610. }
  611. int
  612. ia32_copy_ia64_partial_page_list(struct task_struct *p,
  613. unsigned long clone_flags)
  614. {
  615. int retval = 0;
  616. if (clone_flags & CLONE_VM) {
  617. atomic_inc(&current->thread.ppl->pp_count);
  618. p->thread.ppl = current->thread.ppl;
  619. } else {
  620. p->thread.ppl = ia32_init_pp_list();
  621. if (!p->thread.ppl)
  622. return -ENOMEM;
  623. down_write(&current->mm->mmap_sem);
  624. {
  625. retval = __ia32_copy_pp_list(p->thread.ppl);
  626. }
  627. up_write(&current->mm->mmap_sem);
  628. }
  629. return retval;
  630. }
  631. static unsigned long
  632. emulate_mmap (struct file *file, unsigned long start, unsigned long len, int prot, int flags,
  633. loff_t off)
  634. {
  635. unsigned long tmp, end, pend, pstart, ret, is_congruent, fudge = 0;
  636. struct inode *inode;
  637. loff_t poff;
  638. end = start + len;
  639. pstart = PAGE_START(start);
  640. pend = PAGE_ALIGN(end);
  641. if (flags & MAP_FIXED) {
  642. ia32_set_pp((unsigned int)start, (unsigned int)end, flags);
  643. if (start > pstart) {
  644. if (flags & MAP_SHARED)
  645. printk(KERN_INFO
  646. "%s(%d): emulate_mmap() can't share head (addr=0x%lx)\n",
  647. current->comm, task_pid_nr(current), start);
  648. ret = mmap_subpage(file, start, min(PAGE_ALIGN(start), end), prot, flags,
  649. off);
  650. if (IS_ERR((void *) ret))
  651. return ret;
  652. pstart += PAGE_SIZE;
  653. if (pstart >= pend)
  654. goto out; /* done */
  655. }
  656. if (end < pend) {
  657. if (flags & MAP_SHARED)
  658. printk(KERN_INFO
  659. "%s(%d): emulate_mmap() can't share tail (end=0x%lx)\n",
  660. current->comm, task_pid_nr(current), end);
  661. ret = mmap_subpage(file, max(start, PAGE_START(end)), end, prot, flags,
  662. (off + len) - offset_in_page(end));
  663. if (IS_ERR((void *) ret))
  664. return ret;
  665. pend -= PAGE_SIZE;
  666. if (pstart >= pend)
  667. goto out; /* done */
  668. }
  669. } else {
  670. /*
  671. * If a start address was specified, use it if the entire rounded out area
  672. * is available.
  673. */
  674. if (start && !pstart)
  675. fudge = 1; /* handle case of mapping to range (0,PAGE_SIZE) */
  676. tmp = arch_get_unmapped_area(file, pstart - fudge, pend - pstart, 0, flags);
  677. if (tmp != pstart) {
  678. pstart = tmp;
  679. start = pstart + offset_in_page(off); /* make start congruent with off */
  680. end = start + len;
  681. pend = PAGE_ALIGN(end);
  682. }
  683. }
  684. poff = off + (pstart - start); /* note: (pstart - start) may be negative */
  685. is_congruent = (flags & MAP_ANONYMOUS) || (offset_in_page(poff) == 0);
  686. if ((flags & MAP_SHARED) && !is_congruent)
  687. printk(KERN_INFO "%s(%d): emulate_mmap() can't share contents of incongruent mmap "
  688. "(addr=0x%lx,off=0x%llx)\n", current->comm, task_pid_nr(current), start, off);
  689. DBG("mmap_body: mapping [0x%lx-0x%lx) %s with poff 0x%llx\n", pstart, pend,
  690. is_congruent ? "congruent" : "not congruent", poff);
  691. down_write(&current->mm->mmap_sem);
  692. {
  693. if (!(flags & MAP_ANONYMOUS) && is_congruent)
  694. ret = do_mmap(file, pstart, pend - pstart, prot, flags | MAP_FIXED, poff);
  695. else
  696. ret = do_mmap(NULL, pstart, pend - pstart,
  697. prot | ((flags & MAP_ANONYMOUS) ? 0 : PROT_WRITE),
  698. flags | MAP_FIXED | MAP_ANONYMOUS, 0);
  699. }
  700. up_write(&current->mm->mmap_sem);
  701. if (IS_ERR((void *) ret))
  702. return ret;
  703. if (!is_congruent) {
  704. /* read the file contents */
  705. inode = file->f_path.dentry->d_inode;
  706. if (!inode->i_fop || !file->f_op->read
  707. || ((*file->f_op->read)(file, (char __user *) pstart, pend - pstart, &poff)
  708. < 0))
  709. {
  710. sys_munmap(pstart, pend - pstart);
  711. return -EINVAL;
  712. }
  713. if (!(prot & PROT_WRITE) && sys_mprotect(pstart, pend - pstart, prot) < 0)
  714. return -EINVAL;
  715. }
  716. if (!(flags & MAP_FIXED))
  717. ia32_set_pp((unsigned int)start, (unsigned int)end, flags);
  718. out:
  719. return start;
  720. }
  721. #endif /* PAGE_SHIFT > IA32_PAGE_SHIFT */
  722. static inline unsigned int
  723. get_prot32 (unsigned int prot)
  724. {
  725. if (prot & PROT_WRITE)
  726. /* on x86, PROT_WRITE implies PROT_READ which implies PROT_EEC */
  727. prot |= PROT_READ | PROT_WRITE | PROT_EXEC;
  728. else if (prot & (PROT_READ | PROT_EXEC))
  729. /* on x86, there is no distinction between PROT_READ and PROT_EXEC */
  730. prot |= (PROT_READ | PROT_EXEC);
  731. return prot;
  732. }
  733. unsigned long
  734. ia32_do_mmap (struct file *file, unsigned long addr, unsigned long len, int prot, int flags,
  735. loff_t offset)
  736. {
  737. DBG("ia32_do_mmap(file=%p,addr=0x%lx,len=0x%lx,prot=%x,flags=%x,offset=0x%llx)\n",
  738. file, addr, len, prot, flags, offset);
  739. if (file && (!file->f_op || !file->f_op->mmap))
  740. return -ENODEV;
  741. len = IA32_PAGE_ALIGN(len);
  742. if (len == 0)
  743. return addr;
  744. if (len > IA32_PAGE_OFFSET || addr > IA32_PAGE_OFFSET - len)
  745. {
  746. if (flags & MAP_FIXED)
  747. return -ENOMEM;
  748. else
  749. return -EINVAL;
  750. }
  751. if (OFFSET4K(offset))
  752. return -EINVAL;
  753. prot = get_prot32(prot);
  754. #if PAGE_SHIFT > IA32_PAGE_SHIFT
  755. mutex_lock(&ia32_mmap_mutex);
  756. {
  757. addr = emulate_mmap(file, addr, len, prot, flags, offset);
  758. }
  759. mutex_unlock(&ia32_mmap_mutex);
  760. #else
  761. down_write(&current->mm->mmap_sem);
  762. {
  763. addr = do_mmap(file, addr, len, prot, flags, offset);
  764. }
  765. up_write(&current->mm->mmap_sem);
  766. #endif
  767. DBG("ia32_do_mmap: returning 0x%lx\n", addr);
  768. return addr;
  769. }
  770. /*
  771. * Linux/i386 didn't use to be able to handle more than 4 system call parameters, so these
  772. * system calls used a memory block for parameter passing..
  773. */
  774. struct mmap_arg_struct {
  775. unsigned int addr;
  776. unsigned int len;
  777. unsigned int prot;
  778. unsigned int flags;
  779. unsigned int fd;
  780. unsigned int offset;
  781. };
  782. asmlinkage long
  783. sys32_mmap (struct mmap_arg_struct __user *arg)
  784. {
  785. struct mmap_arg_struct a;
  786. struct file *file = NULL;
  787. unsigned long addr;
  788. int flags;
  789. if (copy_from_user(&a, arg, sizeof(a)))
  790. return -EFAULT;
  791. if (OFFSET4K(a.offset))
  792. return -EINVAL;
  793. flags = a.flags;
  794. flags &= ~(MAP_EXECUTABLE | MAP_DENYWRITE);
  795. if (!(flags & MAP_ANONYMOUS)) {
  796. file = fget(a.fd);
  797. if (!file)
  798. return -EBADF;
  799. }
  800. addr = ia32_do_mmap(file, a.addr, a.len, a.prot, flags, a.offset);
  801. if (file)
  802. fput(file);
  803. return addr;
  804. }
  805. asmlinkage long
  806. sys32_mmap2 (unsigned int addr, unsigned int len, unsigned int prot, unsigned int flags,
  807. unsigned int fd, unsigned int pgoff)
  808. {
  809. struct file *file = NULL;
  810. unsigned long retval;
  811. flags &= ~(MAP_EXECUTABLE | MAP_DENYWRITE);
  812. if (!(flags & MAP_ANONYMOUS)) {
  813. file = fget(fd);
  814. if (!file)
  815. return -EBADF;
  816. }
  817. retval = ia32_do_mmap(file, addr, len, prot, flags,
  818. (unsigned long) pgoff << IA32_PAGE_SHIFT);
  819. if (file)
  820. fput(file);
  821. return retval;
  822. }
  823. asmlinkage long
  824. sys32_munmap (unsigned int start, unsigned int len)
  825. {
  826. unsigned int end = start + len;
  827. long ret;
  828. #if PAGE_SHIFT <= IA32_PAGE_SHIFT
  829. ret = sys_munmap(start, end - start);
  830. #else
  831. if (OFFSET4K(start))
  832. return -EINVAL;
  833. end = IA32_PAGE_ALIGN(end);
  834. if (start >= end)
  835. return -EINVAL;
  836. ret = ia32_unset_pp(&start, &end);
  837. if (ret < 0)
  838. return ret;
  839. if (start >= end)
  840. return 0;
  841. mutex_lock(&ia32_mmap_mutex);
  842. ret = sys_munmap(start, end - start);
  843. mutex_unlock(&ia32_mmap_mutex);
  844. #endif
  845. return ret;
  846. }
  847. #if PAGE_SHIFT > IA32_PAGE_SHIFT
  848. /*
  849. * When mprotect()ing a partial page, we set the permission to the union of the old
  850. * settings and the new settings. In other words, it's only possible to make access to a
  851. * partial page less restrictive.
  852. */
  853. static long
  854. mprotect_subpage (unsigned long address, int new_prot)
  855. {
  856. int old_prot;
  857. struct vm_area_struct *vma;
  858. if (new_prot == PROT_NONE)
  859. return 0; /* optimize case where nothing changes... */
  860. vma = find_vma(current->mm, address);
  861. old_prot = get_page_prot(vma, address);
  862. return sys_mprotect(address, PAGE_SIZE, new_prot | old_prot);
  863. }
  864. #endif /* PAGE_SHIFT > IA32_PAGE_SHIFT */
  865. asmlinkage long
  866. sys32_mprotect (unsigned int start, unsigned int len, int prot)
  867. {
  868. unsigned int end = start + len;
  869. #if PAGE_SHIFT > IA32_PAGE_SHIFT
  870. long retval = 0;
  871. #endif
  872. prot = get_prot32(prot);
  873. #if PAGE_SHIFT <= IA32_PAGE_SHIFT
  874. return sys_mprotect(start, end - start, prot);
  875. #else
  876. if (OFFSET4K(start))
  877. return -EINVAL;
  878. end = IA32_PAGE_ALIGN(end);
  879. if (end < start)
  880. return -EINVAL;
  881. retval = ia32_compare_pp(&start, &end);
  882. if (retval < 0)
  883. return retval;
  884. mutex_lock(&ia32_mmap_mutex);
  885. {
  886. if (offset_in_page(start)) {
  887. /* start address is 4KB aligned but not page aligned. */
  888. retval = mprotect_subpage(PAGE_START(start), prot);
  889. if (retval < 0)
  890. goto out;
  891. start = PAGE_ALIGN(start);
  892. if (start >= end)
  893. goto out; /* retval is already zero... */
  894. }
  895. if (offset_in_page(end)) {
  896. /* end address is 4KB aligned but not page aligned. */
  897. retval = mprotect_subpage(PAGE_START(end), prot);
  898. if (retval < 0)
  899. goto out;
  900. end = PAGE_START(end);
  901. }
  902. retval = sys_mprotect(start, end - start, prot);
  903. }
  904. out:
  905. mutex_unlock(&ia32_mmap_mutex);
  906. return retval;
  907. #endif
  908. }
  909. asmlinkage long
  910. sys32_mremap (unsigned int addr, unsigned int old_len, unsigned int new_len,
  911. unsigned int flags, unsigned int new_addr)
  912. {
  913. long ret;
  914. #if PAGE_SHIFT <= IA32_PAGE_SHIFT
  915. ret = sys_mremap(addr, old_len, new_len, flags, new_addr);
  916. #else
  917. unsigned int old_end, new_end;
  918. if (OFFSET4K(addr))
  919. return -EINVAL;
  920. old_len = IA32_PAGE_ALIGN(old_len);
  921. new_len = IA32_PAGE_ALIGN(new_len);
  922. old_end = addr + old_len;
  923. new_end = addr + new_len;
  924. if (!new_len)
  925. return -EINVAL;
  926. if ((flags & MREMAP_FIXED) && (OFFSET4K(new_addr)))
  927. return -EINVAL;
  928. if (old_len >= new_len) {
  929. ret = sys32_munmap(addr + new_len, old_len - new_len);
  930. if (ret && old_len != new_len)
  931. return ret;
  932. ret = addr;
  933. if (!(flags & MREMAP_FIXED) || (new_addr == addr))
  934. return ret;
  935. old_len = new_len;
  936. }
  937. addr = PAGE_START(addr);
  938. old_len = PAGE_ALIGN(old_end) - addr;
  939. new_len = PAGE_ALIGN(new_end) - addr;
  940. mutex_lock(&ia32_mmap_mutex);
  941. ret = sys_mremap(addr, old_len, new_len, flags, new_addr);
  942. mutex_unlock(&ia32_mmap_mutex);
  943. if ((ret >= 0) && (old_len < new_len)) {
  944. /* mremap expanded successfully */
  945. ia32_set_pp(old_end, new_end, flags);
  946. }
  947. #endif
  948. return ret;
  949. }
  950. asmlinkage long
  951. sys32_pipe (int __user *fd)
  952. {
  953. int retval;
  954. int fds[2];
  955. retval = do_pipe_flags(fds, 0);
  956. if (retval)
  957. goto out;
  958. if (copy_to_user(fd, fds, sizeof(fds)))
  959. retval = -EFAULT;
  960. out:
  961. return retval;
  962. }
  963. asmlinkage unsigned long
  964. sys32_alarm (unsigned int seconds)
  965. {
  966. return alarm_setitimer(seconds);
  967. }
  968. struct sel_arg_struct {
  969. unsigned int n;
  970. unsigned int inp;
  971. unsigned int outp;
  972. unsigned int exp;
  973. unsigned int tvp;
  974. };
  975. asmlinkage long
  976. sys32_old_select (struct sel_arg_struct __user *arg)
  977. {
  978. struct sel_arg_struct a;
  979. if (copy_from_user(&a, arg, sizeof(a)))
  980. return -EFAULT;
  981. return compat_sys_select(a.n, compat_ptr(a.inp), compat_ptr(a.outp),
  982. compat_ptr(a.exp), compat_ptr(a.tvp));
  983. }
  984. #define SEMOP 1
  985. #define SEMGET 2
  986. #define SEMCTL 3
  987. #define SEMTIMEDOP 4
  988. #define MSGSND 11
  989. #define MSGRCV 12
  990. #define MSGGET 13
  991. #define MSGCTL 14
  992. #define SHMAT 21
  993. #define SHMDT 22
  994. #define SHMGET 23
  995. #define SHMCTL 24
  996. asmlinkage long
  997. sys32_ipc(u32 call, int first, int second, int third, u32 ptr, u32 fifth)
  998. {
  999. int version;
  1000. version = call >> 16; /* hack for backward compatibility */
  1001. call &= 0xffff;
  1002. switch (call) {
  1003. case SEMTIMEDOP:
  1004. if (fifth)
  1005. return compat_sys_semtimedop(first, compat_ptr(ptr),
  1006. second, compat_ptr(fifth));
  1007. /* else fall through for normal semop() */
  1008. case SEMOP:
  1009. /* struct sembuf is the same on 32 and 64bit :)) */
  1010. return sys_semtimedop(first, compat_ptr(ptr), second,
  1011. NULL);
  1012. case SEMGET:
  1013. return sys_semget(first, second, third);
  1014. case SEMCTL:
  1015. return compat_sys_semctl(first, second, third, compat_ptr(ptr));
  1016. case MSGSND:
  1017. return compat_sys_msgsnd(first, second, third, compat_ptr(ptr));
  1018. case MSGRCV:
  1019. return compat_sys_msgrcv(first, second, fifth, third, version, compat_ptr(ptr));
  1020. case MSGGET:
  1021. return sys_msgget((key_t) first, second);
  1022. case MSGCTL:
  1023. return compat_sys_msgctl(first, second, compat_ptr(ptr));
  1024. case SHMAT:
  1025. return compat_sys_shmat(first, second, third, version, compat_ptr(ptr));
  1026. break;
  1027. case SHMDT:
  1028. return sys_shmdt(compat_ptr(ptr));
  1029. case SHMGET:
  1030. return sys_shmget(first, (unsigned)second, third);
  1031. case SHMCTL:
  1032. return compat_sys_shmctl(first, second, compat_ptr(ptr));
  1033. default:
  1034. return -ENOSYS;
  1035. }
  1036. return -EINVAL;
  1037. }
  1038. asmlinkage long
  1039. compat_sys_wait4 (compat_pid_t pid, compat_uint_t * stat_addr, int options,
  1040. struct compat_rusage *ru);
  1041. asmlinkage long
  1042. sys32_waitpid (int pid, unsigned int *stat_addr, int options)
  1043. {
  1044. return compat_sys_wait4(pid, stat_addr, options, NULL);
  1045. }
  1046. static unsigned int
  1047. ia32_peek (struct task_struct *child, unsigned long addr, unsigned int *val)
  1048. {
  1049. size_t copied;
  1050. unsigned int ret;
  1051. copied = access_process_vm(child, addr, val, sizeof(*val), 0);
  1052. return (copied != sizeof(ret)) ? -EIO : 0;
  1053. }
  1054. static unsigned int
  1055. ia32_poke (struct task_struct *child, unsigned long addr, unsigned int val)
  1056. {
  1057. if (access_process_vm(child, addr, &val, sizeof(val), 1) != sizeof(val))
  1058. return -EIO;
  1059. return 0;
  1060. }
  1061. /*
  1062. * The order in which registers are stored in the ptrace regs structure
  1063. */
  1064. #define PT_EBX 0
  1065. #define PT_ECX 1
  1066. #define PT_EDX 2
  1067. #define PT_ESI 3
  1068. #define PT_EDI 4
  1069. #define PT_EBP 5
  1070. #define PT_EAX 6
  1071. #define PT_DS 7
  1072. #define PT_ES 8
  1073. #define PT_FS 9
  1074. #define PT_GS 10
  1075. #define PT_ORIG_EAX 11
  1076. #define PT_EIP 12
  1077. #define PT_CS 13
  1078. #define PT_EFL 14
  1079. #define PT_UESP 15
  1080. #define PT_SS 16
  1081. static unsigned int
  1082. getreg (struct task_struct *child, int regno)
  1083. {
  1084. struct pt_regs *child_regs;
  1085. child_regs = task_pt_regs(child);
  1086. switch (regno / sizeof(int)) {
  1087. case PT_EBX: return child_regs->r11;
  1088. case PT_ECX: return child_regs->r9;
  1089. case PT_EDX: return child_regs->r10;
  1090. case PT_ESI: return child_regs->r14;
  1091. case PT_EDI: return child_regs->r15;
  1092. case PT_EBP: return child_regs->r13;
  1093. case PT_EAX: return child_regs->r8;
  1094. case PT_ORIG_EAX: return child_regs->r1; /* see dispatch_to_ia32_handler() */
  1095. case PT_EIP: return child_regs->cr_iip;
  1096. case PT_UESP: return child_regs->r12;
  1097. case PT_EFL: return child->thread.eflag;
  1098. case PT_DS: case PT_ES: case PT_FS: case PT_GS: case PT_SS:
  1099. return __USER_DS;
  1100. case PT_CS: return __USER_CS;
  1101. default:
  1102. printk(KERN_ERR "ia32.getreg(): unknown register %d\n", regno);
  1103. break;
  1104. }
  1105. return 0;
  1106. }
  1107. static void
  1108. putreg (struct task_struct *child, int regno, unsigned int value)
  1109. {
  1110. struct pt_regs *child_regs;
  1111. child_regs = task_pt_regs(child);
  1112. switch (regno / sizeof(int)) {
  1113. case PT_EBX: child_regs->r11 = value; break;
  1114. case PT_ECX: child_regs->r9 = value; break;
  1115. case PT_EDX: child_regs->r10 = value; break;
  1116. case PT_ESI: child_regs->r14 = value; break;
  1117. case PT_EDI: child_regs->r15 = value; break;
  1118. case PT_EBP: child_regs->r13 = value; break;
  1119. case PT_EAX: child_regs->r8 = value; break;
  1120. case PT_ORIG_EAX: child_regs->r1 = value; break;
  1121. case PT_EIP: child_regs->cr_iip = value; break;
  1122. case PT_UESP: child_regs->r12 = value; break;
  1123. case PT_EFL: child->thread.eflag = value; break;
  1124. case PT_DS: case PT_ES: case PT_FS: case PT_GS: case PT_SS:
  1125. if (value != __USER_DS)
  1126. printk(KERN_ERR
  1127. "ia32.putreg: attempt to set invalid segment register %d = %x\n",
  1128. regno, value);
  1129. break;
  1130. case PT_CS:
  1131. if (value != __USER_CS)
  1132. printk(KERN_ERR
  1133. "ia32.putreg: attempt to to set invalid segment register %d = %x\n",
  1134. regno, value);
  1135. break;
  1136. default:
  1137. printk(KERN_ERR "ia32.putreg: unknown register %d\n", regno);
  1138. break;
  1139. }
  1140. }
  1141. static void
  1142. put_fpreg (int regno, struct _fpreg_ia32 __user *reg, struct pt_regs *ptp,
  1143. struct switch_stack *swp, int tos)
  1144. {
  1145. struct _fpreg_ia32 *f;
  1146. char buf[32];
  1147. f = (struct _fpreg_ia32 *)(((unsigned long)buf + 15) & ~15);
  1148. if ((regno += tos) >= 8)
  1149. regno -= 8;
  1150. switch (regno) {
  1151. case 0:
  1152. ia64f2ia32f(f, &ptp->f8);
  1153. break;
  1154. case 1:
  1155. ia64f2ia32f(f, &ptp->f9);
  1156. break;
  1157. case 2:
  1158. ia64f2ia32f(f, &ptp->f10);
  1159. break;
  1160. case 3:
  1161. ia64f2ia32f(f, &ptp->f11);
  1162. break;
  1163. case 4:
  1164. case 5:
  1165. case 6:
  1166. case 7:
  1167. ia64f2ia32f(f, &swp->f12 + (regno - 4));
  1168. break;
  1169. }
  1170. copy_to_user(reg, f, sizeof(*reg));
  1171. }
  1172. static void
  1173. get_fpreg (int regno, struct _fpreg_ia32 __user *reg, struct pt_regs *ptp,
  1174. struct switch_stack *swp, int tos)
  1175. {
  1176. if ((regno += tos) >= 8)
  1177. regno -= 8;
  1178. switch (regno) {
  1179. case 0:
  1180. copy_from_user(&ptp->f8, reg, sizeof(*reg));
  1181. break;
  1182. case 1:
  1183. copy_from_user(&ptp->f9, reg, sizeof(*reg));
  1184. break;
  1185. case 2:
  1186. copy_from_user(&ptp->f10, reg, sizeof(*reg));
  1187. break;
  1188. case 3:
  1189. copy_from_user(&ptp->f11, reg, sizeof(*reg));
  1190. break;
  1191. case 4:
  1192. case 5:
  1193. case 6:
  1194. case 7:
  1195. copy_from_user(&swp->f12 + (regno - 4), reg, sizeof(*reg));
  1196. break;
  1197. }
  1198. return;
  1199. }
  1200. int
  1201. save_ia32_fpstate (struct task_struct *tsk, struct ia32_user_i387_struct __user *save)
  1202. {
  1203. struct switch_stack *swp;
  1204. struct pt_regs *ptp;
  1205. int i, tos;
  1206. if (!access_ok(VERIFY_WRITE, save, sizeof(*save)))
  1207. return -EFAULT;
  1208. __put_user(tsk->thread.fcr & 0xffff, &save->cwd);
  1209. __put_user(tsk->thread.fsr & 0xffff, &save->swd);
  1210. __put_user((tsk->thread.fsr>>16) & 0xffff, &save->twd);
  1211. __put_user(tsk->thread.fir, &save->fip);
  1212. __put_user((tsk->thread.fir>>32) & 0xffff, &save->fcs);
  1213. __put_user(tsk->thread.fdr, &save->foo);
  1214. __put_user((tsk->thread.fdr>>32) & 0xffff, &save->fos);
  1215. /*
  1216. * Stack frames start with 16-bytes of temp space
  1217. */
  1218. swp = (struct switch_stack *)(tsk->thread.ksp + 16);
  1219. ptp = task_pt_regs(tsk);
  1220. tos = (tsk->thread.fsr >> 11) & 7;
  1221. for (i = 0; i < 8; i++)
  1222. put_fpreg(i, &save->st_space[i], ptp, swp, tos);
  1223. return 0;
  1224. }
  1225. static int
  1226. restore_ia32_fpstate (struct task_struct *tsk, struct ia32_user_i387_struct __user *save)
  1227. {
  1228. struct switch_stack *swp;
  1229. struct pt_regs *ptp;
  1230. int i, tos;
  1231. unsigned int fsrlo, fsrhi, num32;
  1232. if (!access_ok(VERIFY_READ, save, sizeof(*save)))
  1233. return(-EFAULT);
  1234. __get_user(num32, (unsigned int __user *)&save->cwd);
  1235. tsk->thread.fcr = (tsk->thread.fcr & (~0x1f3f)) | (num32 & 0x1f3f);
  1236. __get_user(fsrlo, (unsigned int __user *)&save->swd);
  1237. __get_user(fsrhi, (unsigned int __user *)&save->twd);
  1238. num32 = (fsrhi << 16) | fsrlo;
  1239. tsk->thread.fsr = (tsk->thread.fsr & (~0xffffffff)) | num32;
  1240. __get_user(num32, (unsigned int __user *)&save->fip);
  1241. tsk->thread.fir = (tsk->thread.fir & (~0xffffffff)) | num32;
  1242. __get_user(num32, (unsigned int __user *)&save->foo);
  1243. tsk->thread.fdr = (tsk->thread.fdr & (~0xffffffff)) | num32;
  1244. /*
  1245. * Stack frames start with 16-bytes of temp space
  1246. */
  1247. swp = (struct switch_stack *)(tsk->thread.ksp + 16);
  1248. ptp = task_pt_regs(tsk);
  1249. tos = (tsk->thread.fsr >> 11) & 7;
  1250. for (i = 0; i < 8; i++)
  1251. get_fpreg(i, &save->st_space[i], ptp, swp, tos);
  1252. return 0;
  1253. }
  1254. int
  1255. save_ia32_fpxstate (struct task_struct *tsk, struct ia32_user_fxsr_struct __user *save)
  1256. {
  1257. struct switch_stack *swp;
  1258. struct pt_regs *ptp;
  1259. int i, tos;
  1260. unsigned long mxcsr=0;
  1261. unsigned long num128[2];
  1262. if (!access_ok(VERIFY_WRITE, save, sizeof(*save)))
  1263. return -EFAULT;
  1264. __put_user(tsk->thread.fcr & 0xffff, &save->cwd);
  1265. __put_user(tsk->thread.fsr & 0xffff, &save->swd);
  1266. __put_user((tsk->thread.fsr>>16) & 0xffff, &save->twd);
  1267. __put_user(tsk->thread.fir, &save->fip);
  1268. __put_user((tsk->thread.fir>>32) & 0xffff, &save->fcs);
  1269. __put_user(tsk->thread.fdr, &save->foo);
  1270. __put_user((tsk->thread.fdr>>32) & 0xffff, &save->fos);
  1271. /*
  1272. * Stack frames start with 16-bytes of temp space
  1273. */
  1274. swp = (struct switch_stack *)(tsk->thread.ksp + 16);
  1275. ptp = task_pt_regs(tsk);
  1276. tos = (tsk->thread.fsr >> 11) & 7;
  1277. for (i = 0; i < 8; i++)
  1278. put_fpreg(i, (struct _fpreg_ia32 __user *)&save->st_space[4*i], ptp, swp, tos);
  1279. mxcsr = ((tsk->thread.fcr>>32) & 0xff80) | ((tsk->thread.fsr>>32) & 0x3f);
  1280. __put_user(mxcsr & 0xffff, &save->mxcsr);
  1281. for (i = 0; i < 8; i++) {
  1282. memcpy(&(num128[0]), &(swp->f16) + i*2, sizeof(unsigned long));
  1283. memcpy(&(num128[1]), &(swp->f17) + i*2, sizeof(unsigned long));
  1284. copy_to_user(&save->xmm_space[0] + 4*i, num128, sizeof(struct _xmmreg_ia32));
  1285. }
  1286. return 0;
  1287. }
  1288. static int
  1289. restore_ia32_fpxstate (struct task_struct *tsk, struct ia32_user_fxsr_struct __user *save)
  1290. {
  1291. struct switch_stack *swp;
  1292. struct pt_regs *ptp;
  1293. int i, tos;
  1294. unsigned int fsrlo, fsrhi, num32;
  1295. int mxcsr;
  1296. unsigned long num64;
  1297. unsigned long num128[2];
  1298. if (!access_ok(VERIFY_READ, save, sizeof(*save)))
  1299. return(-EFAULT);
  1300. __get_user(num32, (unsigned int __user *)&save->cwd);
  1301. tsk->thread.fcr = (tsk->thread.fcr & (~0x1f3f)) | (num32 & 0x1f3f);
  1302. __get_user(fsrlo, (unsigned int __user *)&save->swd);
  1303. __get_user(fsrhi, (unsigned int __user *)&save->twd);
  1304. num32 = (fsrhi << 16) | fsrlo;
  1305. tsk->thread.fsr = (tsk->thread.fsr & (~0xffffffff)) | num32;
  1306. __get_user(num32, (unsigned int __user *)&save->fip);
  1307. tsk->thread.fir = (tsk->thread.fir & (~0xffffffff)) | num32;
  1308. __get_user(num32, (unsigned int __user *)&save->foo);
  1309. tsk->thread.fdr = (tsk->thread.fdr & (~0xffffffff)) | num32;
  1310. /*
  1311. * Stack frames start with 16-bytes of temp space
  1312. */
  1313. swp = (struct switch_stack *)(tsk->thread.ksp + 16);
  1314. ptp = task_pt_regs(tsk);
  1315. tos = (tsk->thread.fsr >> 11) & 7;
  1316. for (i = 0; i < 8; i++)
  1317. get_fpreg(i, (struct _fpreg_ia32 __user *)&save->st_space[4*i], ptp, swp, tos);
  1318. __get_user(mxcsr, (unsigned int __user *)&save->mxcsr);
  1319. num64 = mxcsr & 0xff10;
  1320. tsk->thread.fcr = (tsk->thread.fcr & (~0xff1000000000UL)) | (num64<<32);
  1321. num64 = mxcsr & 0x3f;
  1322. tsk->thread.fsr = (tsk->thread.fsr & (~0x3f00000000UL)) | (num64<<32);
  1323. for (i = 0; i < 8; i++) {
  1324. copy_from_user(num128, &save->xmm_space[0] + 4*i, sizeof(struct _xmmreg_ia32));
  1325. memcpy(&(swp->f16) + i*2, &(num128[0]), sizeof(unsigned long));
  1326. memcpy(&(swp->f17) + i*2, &(num128[1]), sizeof(unsigned long));
  1327. }
  1328. return 0;
  1329. }
  1330. asmlinkage long
  1331. sys32_ptrace (int request, pid_t pid, unsigned int addr, unsigned int data)
  1332. {
  1333. struct task_struct *child;
  1334. unsigned int value, tmp;
  1335. long i, ret;
  1336. lock_kernel();
  1337. if (request == PTRACE_TRACEME) {
  1338. ret = ptrace_traceme();
  1339. goto out;
  1340. }
  1341. child = ptrace_get_task_struct(pid);
  1342. if (IS_ERR(child)) {
  1343. ret = PTR_ERR(child);
  1344. goto out;
  1345. }
  1346. if (request == PTRACE_ATTACH) {
  1347. ret = sys_ptrace(request, pid, addr, data);
  1348. goto out_tsk;
  1349. }
  1350. ret = ptrace_check_attach(child, request == PTRACE_KILL);
  1351. if (ret < 0)
  1352. goto out_tsk;
  1353. switch (request) {
  1354. case PTRACE_PEEKTEXT:
  1355. case PTRACE_PEEKDATA: /* read word at location addr */
  1356. ret = ia32_peek(child, addr, &value);
  1357. if (ret == 0)
  1358. ret = put_user(value, (unsigned int __user *) compat_ptr(data));
  1359. else
  1360. ret = -EIO;
  1361. goto out_tsk;
  1362. case PTRACE_POKETEXT:
  1363. case PTRACE_POKEDATA: /* write the word at location addr */
  1364. ret = ia32_poke(child, addr, data);
  1365. goto out_tsk;
  1366. case PTRACE_PEEKUSR: /* read word at addr in USER area */
  1367. ret = -EIO;
  1368. if ((addr & 3) || addr > 17*sizeof(int))
  1369. break;
  1370. tmp = getreg(child, addr);
  1371. if (!put_user(tmp, (unsigned int __user *) compat_ptr(data)))
  1372. ret = 0;
  1373. break;
  1374. case PTRACE_POKEUSR: /* write word at addr in USER area */
  1375. ret = -EIO;
  1376. if ((addr & 3) || addr > 17*sizeof(int))
  1377. break;
  1378. putreg(child, addr, data);
  1379. ret = 0;
  1380. break;
  1381. case IA32_PTRACE_GETREGS:
  1382. if (!access_ok(VERIFY_WRITE, compat_ptr(data), 17*sizeof(int))) {
  1383. ret = -EIO;
  1384. break;
  1385. }
  1386. for (i = 0; i < (int) (17*sizeof(int)); i += sizeof(int) ) {
  1387. put_user(getreg(child, i), (unsigned int __user *) compat_ptr(data));
  1388. data += sizeof(int);
  1389. }
  1390. ret = 0;
  1391. break;
  1392. case IA32_PTRACE_SETREGS:
  1393. if (!access_ok(VERIFY_READ, compat_ptr(data), 17*sizeof(int))) {
  1394. ret = -EIO;
  1395. break;
  1396. }
  1397. for (i = 0; i < (int) (17*sizeof(int)); i += sizeof(int) ) {
  1398. get_user(tmp, (unsigned int __user *) compat_ptr(data));
  1399. putreg(child, i, tmp);
  1400. data += sizeof(int);
  1401. }
  1402. ret = 0;
  1403. break;
  1404. case IA32_PTRACE_GETFPREGS:
  1405. ret = save_ia32_fpstate(child, (struct ia32_user_i387_struct __user *)
  1406. compat_ptr(data));
  1407. break;
  1408. case IA32_PTRACE_GETFPXREGS:
  1409. ret = save_ia32_fpxstate(child, (struct ia32_user_fxsr_struct __user *)
  1410. compat_ptr(data));
  1411. break;
  1412. case IA32_PTRACE_SETFPREGS:
  1413. ret = restore_ia32_fpstate(child, (struct ia32_user_i387_struct __user *)
  1414. compat_ptr(data));
  1415. break;
  1416. case IA32_PTRACE_SETFPXREGS:
  1417. ret = restore_ia32_fpxstate(child, (struct ia32_user_fxsr_struct __user *)
  1418. compat_ptr(data));
  1419. break;
  1420. case PTRACE_GETEVENTMSG:
  1421. ret = put_user(child->ptrace_message, (unsigned int __user *) compat_ptr(data));
  1422. break;
  1423. case PTRACE_SYSCALL: /* continue, stop after next syscall */
  1424. case PTRACE_CONT: /* restart after signal. */
  1425. case PTRACE_KILL:
  1426. case PTRACE_SINGLESTEP: /* execute chile for one instruction */
  1427. case PTRACE_DETACH: /* detach a process */
  1428. ret = sys_ptrace(request, pid, addr, data);
  1429. break;
  1430. default:
  1431. ret = ptrace_request(child, request, addr, data);
  1432. break;
  1433. }
  1434. out_tsk:
  1435. put_task_struct(child);
  1436. out:
  1437. unlock_kernel();
  1438. return ret;
  1439. }
  1440. typedef struct {
  1441. unsigned int ss_sp;
  1442. unsigned int ss_flags;
  1443. unsigned int ss_size;
  1444. } ia32_stack_t;
  1445. asmlinkage long
  1446. sys32_sigaltstack (ia32_stack_t __user *uss32, ia32_stack_t __user *uoss32,
  1447. long arg2, long arg3, long arg4, long arg5, long arg6,
  1448. long arg7, struct pt_regs pt)
  1449. {
  1450. stack_t uss, uoss;
  1451. ia32_stack_t buf32;
  1452. int ret;
  1453. mm_segment_t old_fs = get_fs();
  1454. if (uss32) {
  1455. if (copy_from_user(&buf32, uss32, sizeof(ia32_stack_t)))
  1456. return -EFAULT;
  1457. uss.ss_sp = (void __user *) (long) buf32.ss_sp;
  1458. uss.ss_flags = buf32.ss_flags;
  1459. /* MINSIGSTKSZ is different for ia32 vs ia64. We lie here to pass the
  1460. check and set it to the user requested value later */
  1461. if ((buf32.ss_flags != SS_DISABLE) && (buf32.ss_size < MINSIGSTKSZ_IA32)) {
  1462. ret = -ENOMEM;
  1463. goto out;
  1464. }
  1465. uss.ss_size = MINSIGSTKSZ;
  1466. }
  1467. set_fs(KERNEL_DS);
  1468. ret = do_sigaltstack(uss32 ? (stack_t __user *) &uss : NULL,
  1469. (stack_t __user *) &uoss, pt.r12);
  1470. current->sas_ss_size = buf32.ss_size;
  1471. set_fs(old_fs);
  1472. out:
  1473. if (ret < 0)
  1474. return(ret);
  1475. if (uoss32) {
  1476. buf32.ss_sp = (long __user) uoss.ss_sp;
  1477. buf32.ss_flags = uoss.ss_flags;
  1478. buf32.ss_size = uoss.ss_size;
  1479. if (copy_to_user(uoss32, &buf32, sizeof(ia32_stack_t)))
  1480. return -EFAULT;
  1481. }
  1482. return ret;
  1483. }
  1484. asmlinkage int
  1485. sys32_msync (unsigned int start, unsigned int len, int flags)
  1486. {
  1487. unsigned int addr;
  1488. if (OFFSET4K(start))
  1489. return -EINVAL;
  1490. addr = PAGE_START(start);
  1491. return sys_msync(addr, len + (start - addr), flags);
  1492. }
  1493. struct sysctl32 {
  1494. unsigned int name;
  1495. int nlen;
  1496. unsigned int oldval;
  1497. unsigned int oldlenp;
  1498. unsigned int newval;
  1499. unsigned int newlen;
  1500. unsigned int __unused[4];
  1501. };
  1502. #ifdef CONFIG_SYSCTL_SYSCALL
  1503. asmlinkage long
  1504. sys32_sysctl (struct sysctl32 __user *args)
  1505. {
  1506. struct sysctl32 a32;
  1507. mm_segment_t old_fs = get_fs ();
  1508. void __user *oldvalp, *newvalp;
  1509. size_t oldlen;
  1510. int __user *namep;
  1511. long ret;
  1512. if (copy_from_user(&a32, args, sizeof(a32)))
  1513. return -EFAULT;
  1514. /*
  1515. * We need to pre-validate these because we have to disable address checking
  1516. * before calling do_sysctl() because of OLDLEN but we can't run the risk of the
  1517. * user specifying bad addresses here. Well, since we're dealing with 32 bit
  1518. * addresses, we KNOW that access_ok() will always succeed, so this is an
  1519. * expensive NOP, but so what...
  1520. */
  1521. namep = (int __user *) compat_ptr(a32.name);
  1522. oldvalp = compat_ptr(a32.oldval);
  1523. newvalp = compat_ptr(a32.newval);
  1524. if ((oldvalp && get_user(oldlen, (int __user *) compat_ptr(a32.oldlenp)))
  1525. || !access_ok(VERIFY_WRITE, namep, 0)
  1526. || !access_ok(VERIFY_WRITE, oldvalp, 0)
  1527. || !access_ok(VERIFY_WRITE, newvalp, 0))
  1528. return -EFAULT;
  1529. set_fs(KERNEL_DS);
  1530. lock_kernel();
  1531. ret = do_sysctl(namep, a32.nlen, oldvalp, (size_t __user *) &oldlen,
  1532. newvalp, (size_t) a32.newlen);
  1533. unlock_kernel();
  1534. set_fs(old_fs);
  1535. if (oldvalp && put_user (oldlen, (int __user *) compat_ptr(a32.oldlenp)))
  1536. return -EFAULT;
  1537. return ret;
  1538. }
  1539. #endif
  1540. asmlinkage long
  1541. sys32_newuname (struct new_utsname __user *name)
  1542. {
  1543. int ret = sys_newuname(name);
  1544. if (!ret)
  1545. if (copy_to_user(name->machine, "i686\0\0\0", 8))
  1546. ret = -EFAULT;
  1547. return ret;
  1548. }
  1549. asmlinkage long
  1550. sys32_getresuid16 (u16 __user *ruid, u16 __user *euid, u16 __user *suid)
  1551. {
  1552. uid_t a, b, c;
  1553. int ret;
  1554. mm_segment_t old_fs = get_fs();
  1555. set_fs(KERNEL_DS);
  1556. ret = sys_getresuid((uid_t __user *) &a, (uid_t __user *) &b, (uid_t __user *) &c);
  1557. set_fs(old_fs);
  1558. if (put_user(a, ruid) || put_user(b, euid) || put_user(c, suid))
  1559. return -EFAULT;
  1560. return ret;
  1561. }
  1562. asmlinkage long
  1563. sys32_getresgid16 (u16 __user *rgid, u16 __user *egid, u16 __user *sgid)
  1564. {
  1565. gid_t a, b, c;
  1566. int ret;
  1567. mm_segment_t old_fs = get_fs();
  1568. set_fs(KERNEL_DS);
  1569. ret = sys_getresgid((gid_t __user *) &a, (gid_t __user *) &b, (gid_t __user *) &c);
  1570. set_fs(old_fs);
  1571. if (ret)
  1572. return ret;
  1573. return put_user(a, rgid) | put_user(b, egid) | put_user(c, sgid);
  1574. }
  1575. asmlinkage long
  1576. sys32_lseek (unsigned int fd, int offset, unsigned int whence)
  1577. {
  1578. /* Sign-extension of "offset" is important here... */
  1579. return sys_lseek(fd, offset, whence);
  1580. }
  1581. static int
  1582. groups16_to_user(short __user *grouplist, struct group_info *group_info)
  1583. {
  1584. int i;
  1585. short group;
  1586. for (i = 0; i < group_info->ngroups; i++) {
  1587. group = (short)GROUP_AT(group_info, i);
  1588. if (put_user(group, grouplist+i))
  1589. return -EFAULT;
  1590. }
  1591. return 0;
  1592. }
  1593. static int
  1594. groups16_from_user(struct group_info *group_info, short __user *grouplist)
  1595. {
  1596. int i;
  1597. short group;
  1598. for (i = 0; i < group_info->ngroups; i++) {
  1599. if (get_user(group, grouplist+i))
  1600. return -EFAULT;
  1601. GROUP_AT(group_info, i) = (gid_t)group;
  1602. }
  1603. return 0;
  1604. }
  1605. asmlinkage long
  1606. sys32_getgroups16 (int gidsetsize, short __user *grouplist)
  1607. {
  1608. int i;
  1609. if (gidsetsize < 0)
  1610. return -EINVAL;
  1611. get_group_info(current->group_info);
  1612. i = current->group_info->ngroups;
  1613. if (gidsetsize) {
  1614. if (i > gidsetsize) {
  1615. i = -EINVAL;
  1616. goto out;
  1617. }
  1618. if (groups16_to_user(grouplist, current->group_info)) {
  1619. i = -EFAULT;
  1620. goto out;
  1621. }
  1622. }
  1623. out:
  1624. put_group_info(current->group_info);
  1625. return i;
  1626. }
  1627. asmlinkage long
  1628. sys32_setgroups16 (int gidsetsize, short __user *grouplist)
  1629. {
  1630. struct group_info *group_info;
  1631. int retval;
  1632. if (!capable(CAP_SETGID))
  1633. return -EPERM;
  1634. if ((unsigned)gidsetsize > NGROUPS_MAX)
  1635. return -EINVAL;
  1636. group_info = groups_alloc(gidsetsize);
  1637. if (!group_info)
  1638. return -ENOMEM;
  1639. retval = groups16_from_user(group_info, grouplist);
  1640. if (retval) {
  1641. put_group_info(group_info);
  1642. return retval;
  1643. }
  1644. retval = set_current_groups(group_info);
  1645. put_group_info(group_info);
  1646. return retval;
  1647. }
  1648. asmlinkage long
  1649. sys32_truncate64 (unsigned int path, unsigned int len_lo, unsigned int len_hi)
  1650. {
  1651. return sys_truncate(compat_ptr(path), ((unsigned long) len_hi << 32) | len_lo);
  1652. }
  1653. asmlinkage long
  1654. sys32_ftruncate64 (int fd, unsigned int len_lo, unsigned int len_hi)
  1655. {
  1656. return sys_ftruncate(fd, ((unsigned long) len_hi << 32) | len_lo);
  1657. }
  1658. static int
  1659. putstat64 (struct stat64 __user *ubuf, struct kstat *kbuf)
  1660. {
  1661. int err;
  1662. u64 hdev;
  1663. if (clear_user(ubuf, sizeof(*ubuf)))
  1664. return -EFAULT;
  1665. hdev = huge_encode_dev(kbuf->dev);
  1666. err = __put_user(hdev, (u32 __user*)&ubuf->st_dev);
  1667. err |= __put_user(hdev >> 32, ((u32 __user*)&ubuf->st_dev) + 1);
  1668. err |= __put_user(kbuf->ino, &ubuf->__st_ino);
  1669. err |= __put_user(kbuf->ino, &ubuf->st_ino_lo);
  1670. err |= __put_user(kbuf->ino >> 32, &ubuf->st_ino_hi);
  1671. err |= __put_user(kbuf->mode, &ubuf->st_mode);
  1672. err |= __put_user(kbuf->nlink, &ubuf->st_nlink);
  1673. err |= __put_user(kbuf->uid, &ubuf->st_uid);
  1674. err |= __put_user(kbuf->gid, &ubuf->st_gid);
  1675. hdev = huge_encode_dev(kbuf->rdev);
  1676. err = __put_user(hdev, (u32 __user*)&ubuf->st_rdev);
  1677. err |= __put_user(hdev >> 32, ((u32 __user*)&ubuf->st_rdev) + 1);
  1678. err |= __put_user(kbuf->size, &ubuf->st_size_lo);
  1679. err |= __put_user((kbuf->size >> 32), &ubuf->st_size_hi);
  1680. err |= __put_user(kbuf->atime.tv_sec, &ubuf->st_atime);
  1681. err |= __put_user(kbuf->atime.tv_nsec, &ubuf->st_atime_nsec);
  1682. err |= __put_user(kbuf->mtime.tv_sec, &ubuf->st_mtime);
  1683. err |= __put_user(kbuf->mtime.tv_nsec, &ubuf->st_mtime_nsec);
  1684. err |= __put_user(kbuf->ctime.tv_sec, &ubuf->st_ctime);
  1685. err |= __put_user(kbuf->ctime.tv_nsec, &ubuf->st_ctime_nsec);
  1686. err |= __put_user(kbuf->blksize, &ubuf->st_blksize);
  1687. err |= __put_user(kbuf->blocks, &ubuf->st_blocks);
  1688. return err;
  1689. }
  1690. asmlinkage long
  1691. sys32_stat64 (char __user *filename, struct stat64 __user *statbuf)
  1692. {
  1693. struct kstat s;
  1694. long ret = vfs_stat(filename, &s);
  1695. if (!ret)
  1696. ret = putstat64(statbuf, &s);
  1697. return ret;
  1698. }
  1699. asmlinkage long
  1700. sys32_lstat64 (char __user *filename, struct stat64 __user *statbuf)
  1701. {
  1702. struct kstat s;
  1703. long ret = vfs_lstat(filename, &s);
  1704. if (!ret)
  1705. ret = putstat64(statbuf, &s);
  1706. return ret;
  1707. }
  1708. asmlinkage long
  1709. sys32_fstat64 (unsigned int fd, struct stat64 __user *statbuf)
  1710. {
  1711. struct kstat s;
  1712. long ret = vfs_fstat(fd, &s);
  1713. if (!ret)
  1714. ret = putstat64(statbuf, &s);
  1715. return ret;
  1716. }
  1717. asmlinkage long
  1718. sys32_sched_rr_get_interval (pid_t pid, struct compat_timespec __user *interval)
  1719. {
  1720. mm_segment_t old_fs = get_fs();
  1721. struct timespec t;
  1722. long ret;
  1723. set_fs(KERNEL_DS);
  1724. ret = sys_sched_rr_get_interval(pid, (struct timespec __user *) &t);
  1725. set_fs(old_fs);
  1726. if (put_compat_timespec(&t, interval))
  1727. return -EFAULT;
  1728. return ret;
  1729. }
  1730. asmlinkage long
  1731. sys32_pread (unsigned int fd, void __user *buf, unsigned int count, u32 pos_lo, u32 pos_hi)
  1732. {
  1733. return sys_pread64(fd, buf, count, ((unsigned long) pos_hi << 32) | pos_lo);
  1734. }
  1735. asmlinkage long
  1736. sys32_pwrite (unsigned int fd, void __user *buf, unsigned int count, u32 pos_lo, u32 pos_hi)
  1737. {
  1738. return sys_pwrite64(fd, buf, count, ((unsigned long) pos_hi << 32) | pos_lo);
  1739. }
  1740. asmlinkage long
  1741. sys32_sendfile (int out_fd, int in_fd, int __user *offset, unsigned int count)
  1742. {
  1743. mm_segment_t old_fs = get_fs();
  1744. long ret;
  1745. off_t of;
  1746. if (offset && get_user(of, offset))
  1747. return -EFAULT;
  1748. set_fs(KERNEL_DS);
  1749. ret = sys_sendfile(out_fd, in_fd, offset ? (off_t __user *) &of : NULL, count);
  1750. set_fs(old_fs);
  1751. if (offset && put_user(of, offset))
  1752. return -EFAULT;
  1753. return ret;
  1754. }
  1755. asmlinkage long
  1756. sys32_personality (unsigned int personality)
  1757. {
  1758. long ret;
  1759. if (current->personality == PER_LINUX32 && personality == PER_LINUX)
  1760. personality = PER_LINUX32;
  1761. ret = sys_personality(personality);
  1762. if (ret == PER_LINUX32)
  1763. ret = PER_LINUX;
  1764. return ret;
  1765. }
  1766. asmlinkage unsigned long
  1767. sys32_brk (unsigned int brk)
  1768. {
  1769. unsigned long ret, obrk;
  1770. struct mm_struct *mm = current->mm;
  1771. obrk = mm->brk;
  1772. ret = sys_brk(brk);
  1773. if (ret < obrk)
  1774. clear_user(compat_ptr(ret), PAGE_ALIGN(ret) - ret);
  1775. return ret;
  1776. }
  1777. /* Structure for ia32 emulation on ia64 */
  1778. struct epoll_event32
  1779. {
  1780. u32 events;
  1781. u32 data[2];
  1782. };
  1783. asmlinkage long
  1784. sys32_epoll_ctl(int epfd, int op, int fd, struct epoll_event32 __user *event)
  1785. {
  1786. mm_segment_t old_fs = get_fs();
  1787. struct epoll_event event64;
  1788. int error;
  1789. u32 data_halfword;
  1790. if (!access_ok(VERIFY_READ, event, sizeof(struct epoll_event32)))
  1791. return -EFAULT;
  1792. __get_user(event64.events, &event->events);
  1793. __get_user(data_halfword, &event->data[0]);
  1794. event64.data = data_halfword;
  1795. __get_user(data_halfword, &event->data[1]);
  1796. event64.data |= (u64)data_halfword << 32;
  1797. set_fs(KERNEL_DS);
  1798. error = sys_epoll_ctl(epfd, op, fd, (struct epoll_event __user *) &event64);
  1799. set_fs(old_fs);
  1800. return error;
  1801. }
  1802. asmlinkage long
  1803. sys32_epoll_wait(int epfd, struct epoll_event32 __user * events, int maxevents,
  1804. int timeout)
  1805. {
  1806. struct epoll_event *events64 = NULL;
  1807. mm_segment_t old_fs = get_fs();
  1808. int numevents, size;
  1809. int evt_idx;
  1810. int do_free_pages = 0;
  1811. if (maxevents <= 0) {
  1812. return -EINVAL;
  1813. }
  1814. /* Verify that the area passed by the user is writeable */
  1815. if (!access_ok(VERIFY_WRITE, events, maxevents * sizeof(struct epoll_event32)))
  1816. return -EFAULT;
  1817. /*
  1818. * Allocate space for the intermediate copy. If the space needed
  1819. * is large enough to cause kmalloc to fail, then try again with
  1820. * __get_free_pages.
  1821. */
  1822. size = maxevents * sizeof(struct epoll_event);
  1823. events64 = kmalloc(size, GFP_KERNEL);
  1824. if (events64 == NULL) {
  1825. events64 = (struct epoll_event *)
  1826. __get_free_pages(GFP_KERNEL, get_order(size));
  1827. if (events64 == NULL)
  1828. return -ENOMEM;
  1829. do_free_pages = 1;
  1830. }
  1831. /* Do the system call */
  1832. set_fs(KERNEL_DS); /* copy_to/from_user should work on kernel mem*/
  1833. numevents = sys_epoll_wait(epfd, (struct epoll_event __user *) events64,
  1834. maxevents, timeout);
  1835. set_fs(old_fs);
  1836. /* Don't modify userspace memory if we're returning an error */
  1837. if (numevents > 0) {
  1838. /* Translate the 64-bit structures back into the 32-bit
  1839. structures */
  1840. for (evt_idx = 0; evt_idx < numevents; evt_idx++) {
  1841. __put_user(events64[evt_idx].events,
  1842. &events[evt_idx].events);
  1843. __put_user((u32)events64[evt_idx].data,
  1844. &events[evt_idx].data[0]);
  1845. __put_user((u32)(events64[evt_idx].data >> 32),
  1846. &events[evt_idx].data[1]);
  1847. }
  1848. }
  1849. if (do_free_pages)
  1850. free_pages((unsigned long) events64, get_order(size));
  1851. else
  1852. kfree(events64);
  1853. return numevents;
  1854. }
  1855. /*
  1856. * Get a yet unused TLS descriptor index.
  1857. */
  1858. static int
  1859. get_free_idx (void)
  1860. {
  1861. struct thread_struct *t = &current->thread;
  1862. int idx;
  1863. for (idx = 0; idx < GDT_ENTRY_TLS_ENTRIES; idx++)
  1864. if (desc_empty(t->tls_array + idx))
  1865. return idx + GDT_ENTRY_TLS_MIN;
  1866. return -ESRCH;
  1867. }
  1868. static void set_tls_desc(struct task_struct *p, int idx,
  1869. const struct ia32_user_desc *info, int n)
  1870. {
  1871. struct thread_struct *t = &p->thread;
  1872. struct desc_struct *desc = &t->tls_array[idx - GDT_ENTRY_TLS_MIN];
  1873. int cpu;
  1874. /*
  1875. * We must not get preempted while modifying the TLS.
  1876. */
  1877. cpu = get_cpu();
  1878. while (n-- > 0) {
  1879. if (LDT_empty(info)) {
  1880. desc->a = 0;
  1881. desc->b = 0;
  1882. } else {
  1883. desc->a = LDT_entry_a(info);
  1884. desc->b = LDT_entry_b(info);
  1885. }
  1886. ++info;
  1887. ++desc;
  1888. }
  1889. if (t == &current->thread)
  1890. load_TLS(t, cpu);
  1891. put_cpu();
  1892. }
  1893. /*
  1894. * Set a given TLS descriptor:
  1895. */
  1896. asmlinkage int
  1897. sys32_set_thread_area (struct ia32_user_desc __user *u_info)
  1898. {
  1899. struct ia32_user_desc info;
  1900. int idx;
  1901. if (copy_from_user(&info, u_info, sizeof(info)))
  1902. return -EFAULT;
  1903. idx = info.entry_number;
  1904. /*
  1905. * index -1 means the kernel should try to find and allocate an empty descriptor:
  1906. */
  1907. if (idx == -1) {
  1908. idx = get_free_idx();
  1909. if (idx < 0)
  1910. return idx;
  1911. if (put_user(idx, &u_info->entry_number))
  1912. return -EFAULT;
  1913. }
  1914. if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
  1915. return -EINVAL;
  1916. set_tls_desc(current, idx, &info, 1);
  1917. return 0;
  1918. }
  1919. /*
  1920. * Get the current Thread-Local Storage area:
  1921. */
  1922. #define GET_BASE(desc) ( \
  1923. (((desc)->a >> 16) & 0x0000ffff) | \
  1924. (((desc)->b << 16) & 0x00ff0000) | \
  1925. ( (desc)->b & 0xff000000) )
  1926. #define GET_LIMIT(desc) ( \
  1927. ((desc)->a & 0x0ffff) | \
  1928. ((desc)->b & 0xf0000) )
  1929. #define GET_32BIT(desc) (((desc)->b >> 22) & 1)
  1930. #define GET_CONTENTS(desc) (((desc)->b >> 10) & 3)
  1931. #define GET_WRITABLE(desc) (((desc)->b >> 9) & 1)
  1932. #define GET_LIMIT_PAGES(desc) (((desc)->b >> 23) & 1)
  1933. #define GET_PRESENT(desc) (((desc)->b >> 15) & 1)
  1934. #define GET_USEABLE(desc) (((desc)->b >> 20) & 1)
  1935. static void fill_user_desc(struct ia32_user_desc *info, int idx,
  1936. const struct desc_struct *desc)
  1937. {
  1938. info->entry_number = idx;
  1939. info->base_addr = GET_BASE(desc);
  1940. info->limit = GET_LIMIT(desc);
  1941. info->seg_32bit = GET_32BIT(desc);
  1942. info->contents = GET_CONTENTS(desc);
  1943. info->read_exec_only = !GET_WRITABLE(desc);
  1944. info->limit_in_pages = GET_LIMIT_PAGES(desc);
  1945. info->seg_not_present = !GET_PRESENT(desc);
  1946. info->useable = GET_USEABLE(desc);
  1947. }
  1948. asmlinkage int
  1949. sys32_get_thread_area (struct ia32_user_desc __user *u_info)
  1950. {
  1951. struct ia32_user_desc info;
  1952. struct desc_struct *desc;
  1953. int idx;
  1954. if (get_user(idx, &u_info->entry_number))
  1955. return -EFAULT;
  1956. if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
  1957. return -EINVAL;
  1958. desc = current->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
  1959. fill_user_desc(&info, idx, desc);
  1960. if (copy_to_user(u_info, &info, sizeof(info)))
  1961. return -EFAULT;
  1962. return 0;
  1963. }
  1964. struct regset_get {
  1965. void *kbuf;
  1966. void __user *ubuf;
  1967. };
  1968. struct regset_set {
  1969. const void *kbuf;
  1970. const void __user *ubuf;
  1971. };
  1972. struct regset_getset {
  1973. struct task_struct *target;
  1974. const struct user_regset *regset;
  1975. union {
  1976. struct regset_get get;
  1977. struct regset_set set;
  1978. } u;
  1979. unsigned int pos;
  1980. unsigned int count;
  1981. int ret;
  1982. };
  1983. static void getfpreg(struct task_struct *task, int regno, int *val)
  1984. {
  1985. switch (regno / sizeof(int)) {
  1986. case 0:
  1987. *val = task->thread.fcr & 0xffff;
  1988. break;
  1989. case 1:
  1990. *val = task->thread.fsr & 0xffff;
  1991. break;
  1992. case 2:
  1993. *val = (task->thread.fsr>>16) & 0xffff;
  1994. break;
  1995. case 3:
  1996. *val = task->thread.fir;
  1997. break;
  1998. case 4:
  1999. *val = (task->thread.fir>>32) & 0xffff;
  2000. break;
  2001. case 5:
  2002. *val = task->thread.fdr;
  2003. break;
  2004. case 6:
  2005. *val = (task->thread.fdr >> 32) & 0xffff;
  2006. break;
  2007. }
  2008. }
  2009. static void setfpreg(struct task_struct *task, int regno, int val)
  2010. {
  2011. switch (regno / sizeof(int)) {
  2012. case 0:
  2013. task->thread.fcr = (task->thread.fcr & (~0x1f3f))
  2014. | (val & 0x1f3f);
  2015. break;
  2016. case 1:
  2017. task->thread.fsr = (task->thread.fsr & (~0xffff)) | val;
  2018. break;
  2019. case 2:
  2020. task->thread.fsr = (task->thread.fsr & (~0xffff0000))
  2021. | (val << 16);
  2022. break;
  2023. case 3:
  2024. task->thread.fir = (task->thread.fir & (~0xffffffff)) | val;
  2025. break;
  2026. case 5:
  2027. task->thread.fdr = (task->thread.fdr & (~0xffffffff)) | val;
  2028. break;
  2029. }
  2030. }
  2031. static void access_fpreg_ia32(int regno, void *reg,
  2032. struct pt_regs *pt, struct switch_stack *sw,
  2033. int tos, int write)
  2034. {
  2035. void *f;
  2036. if ((regno += tos) >= 8)
  2037. regno -= 8;
  2038. if (regno < 4)
  2039. f = &pt->f8 + regno;
  2040. else if (regno <= 7)
  2041. f = &sw->f12 + (regno - 4);
  2042. else {
  2043. printk(KERN_ERR "regno must be less than 7 \n");
  2044. return;
  2045. }
  2046. if (write)
  2047. memcpy(f, reg, sizeof(struct _fpreg_ia32));
  2048. else
  2049. memcpy(reg, f, sizeof(struct _fpreg_ia32));
  2050. }
  2051. static void do_fpregs_get(struct unw_frame_info *info, void *arg)
  2052. {
  2053. struct regset_getset *dst = arg;
  2054. struct task_struct *task = dst->target;
  2055. struct pt_regs *pt;
  2056. int start, end, tos;
  2057. char buf[80];
  2058. if (dst->count == 0 || unw_unwind_to_user(info) < 0)
  2059. return;
  2060. if (dst->pos < 7 * sizeof(int)) {
  2061. end = min((dst->pos + dst->count),
  2062. (unsigned int)(7 * sizeof(int)));
  2063. for (start = dst->pos; start < end; start += sizeof(int))
  2064. getfpreg(task, start, (int *)(buf + start));
  2065. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  2066. &dst->u.get.kbuf, &dst->u.get.ubuf, buf,
  2067. 0, 7 * sizeof(int));
  2068. if (dst->ret || dst->count == 0)
  2069. return;
  2070. }
  2071. if (dst->pos < sizeof(struct ia32_user_i387_struct)) {
  2072. pt = task_pt_regs(task);
  2073. tos = (task->thread.fsr >> 11) & 7;
  2074. end = min(dst->pos + dst->count,
  2075. (unsigned int)(sizeof(struct ia32_user_i387_struct)));
  2076. start = (dst->pos - 7 * sizeof(int)) /
  2077. sizeof(struct _fpreg_ia32);
  2078. end = (end - 7 * sizeof(int)) / sizeof(struct _fpreg_ia32);
  2079. for (; start < end; start++)
  2080. access_fpreg_ia32(start,
  2081. (struct _fpreg_ia32 *)buf + start,
  2082. pt, info->sw, tos, 0);
  2083. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  2084. &dst->u.get.kbuf, &dst->u.get.ubuf,
  2085. buf, 7 * sizeof(int),
  2086. sizeof(struct ia32_user_i387_struct));
  2087. if (dst->ret || dst->count == 0)
  2088. return;
  2089. }
  2090. }
  2091. static void do_fpregs_set(struct unw_frame_info *info, void *arg)
  2092. {
  2093. struct regset_getset *dst = arg;
  2094. struct task_struct *task = dst->target;
  2095. struct pt_regs *pt;
  2096. char buf[80];
  2097. int end, start, tos;
  2098. if (dst->count == 0 || unw_unwind_to_user(info) < 0)
  2099. return;
  2100. if (dst->pos < 7 * sizeof(int)) {
  2101. start = dst->pos;
  2102. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  2103. &dst->u.set.kbuf, &dst->u.set.ubuf, buf,
  2104. 0, 7 * sizeof(int));
  2105. if (dst->ret)
  2106. return;
  2107. for (; start < dst->pos; start += sizeof(int))
  2108. setfpreg(task, start, *((int *)(buf + start)));
  2109. if (dst->count == 0)
  2110. return;
  2111. }
  2112. if (dst->pos < sizeof(struct ia32_user_i387_struct)) {
  2113. start = (dst->pos - 7 * sizeof(int)) /
  2114. sizeof(struct _fpreg_ia32);
  2115. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  2116. &dst->u.set.kbuf, &dst->u.set.ubuf,
  2117. buf, 7 * sizeof(int),
  2118. sizeof(struct ia32_user_i387_struct));
  2119. if (dst->ret)
  2120. return;
  2121. pt = task_pt_regs(task);
  2122. tos = (task->thread.fsr >> 11) & 7;
  2123. end = (dst->pos - 7 * sizeof(int)) / sizeof(struct _fpreg_ia32);
  2124. for (; start < end; start++)
  2125. access_fpreg_ia32(start,
  2126. (struct _fpreg_ia32 *)buf + start,
  2127. pt, info->sw, tos, 1);
  2128. if (dst->count == 0)
  2129. return;
  2130. }
  2131. }
  2132. #define OFFSET(member) ((int)(offsetof(struct ia32_user_fxsr_struct, member)))
  2133. static void getfpxreg(struct task_struct *task, int start, int end, char *buf)
  2134. {
  2135. int min_val;
  2136. min_val = min(end, OFFSET(fop));
  2137. while (start < min_val) {
  2138. if (start == OFFSET(cwd))
  2139. *((short *)buf) = task->thread.fcr & 0xffff;
  2140. else if (start == OFFSET(swd))
  2141. *((short *)buf) = task->thread.fsr & 0xffff;
  2142. else if (start == OFFSET(twd))
  2143. *((short *)buf) = (task->thread.fsr>>16) & 0xffff;
  2144. buf += 2;
  2145. start += 2;
  2146. }
  2147. /* skip fop element */
  2148. if (start == OFFSET(fop)) {
  2149. start += 2;
  2150. buf += 2;
  2151. }
  2152. while (start < end) {
  2153. if (start == OFFSET(fip))
  2154. *((int *)buf) = task->thread.fir;
  2155. else if (start == OFFSET(fcs))
  2156. *((int *)buf) = (task->thread.fir>>32) & 0xffff;
  2157. else if (start == OFFSET(foo))
  2158. *((int *)buf) = task->thread.fdr;
  2159. else if (start == OFFSET(fos))
  2160. *((int *)buf) = (task->thread.fdr>>32) & 0xffff;
  2161. else if (start == OFFSET(mxcsr))
  2162. *((int *)buf) = ((task->thread.fcr>>32) & 0xff80)
  2163. | ((task->thread.fsr>>32) & 0x3f);
  2164. buf += 4;
  2165. start += 4;
  2166. }
  2167. }
  2168. static void setfpxreg(struct task_struct *task, int start, int end, char *buf)
  2169. {
  2170. int min_val, num32;
  2171. short num;
  2172. unsigned long num64;
  2173. min_val = min(end, OFFSET(fop));
  2174. while (start < min_val) {
  2175. num = *((short *)buf);
  2176. if (start == OFFSET(cwd)) {
  2177. task->thread.fcr = (task->thread.fcr & (~0x1f3f))
  2178. | (num & 0x1f3f);
  2179. } else if (start == OFFSET(swd)) {
  2180. task->thread.fsr = (task->thread.fsr & (~0xffff)) | num;
  2181. } else if (start == OFFSET(twd)) {
  2182. task->thread.fsr = (task->thread.fsr & (~0xffff0000))
  2183. | (((int)num) << 16);
  2184. }
  2185. buf += 2;
  2186. start += 2;
  2187. }
  2188. /* skip fop element */
  2189. if (start == OFFSET(fop)) {
  2190. start += 2;
  2191. buf += 2;
  2192. }
  2193. while (start < end) {
  2194. num32 = *((int *)buf);
  2195. if (start == OFFSET(fip))
  2196. task->thread.fir = (task->thread.fir & (~0xffffffff))
  2197. | num32;
  2198. else if (start == OFFSET(foo))
  2199. task->thread.fdr = (task->thread.fdr & (~0xffffffff))
  2200. | num32;
  2201. else if (start == OFFSET(mxcsr)) {
  2202. num64 = num32 & 0xff10;
  2203. task->thread.fcr = (task->thread.fcr &
  2204. (~0xff1000000000UL)) | (num64<<32);
  2205. num64 = num32 & 0x3f;
  2206. task->thread.fsr = (task->thread.fsr &
  2207. (~0x3f00000000UL)) | (num64<<32);
  2208. }
  2209. buf += 4;
  2210. start += 4;
  2211. }
  2212. }
  2213. static void do_fpxregs_get(struct unw_frame_info *info, void *arg)
  2214. {
  2215. struct regset_getset *dst = arg;
  2216. struct task_struct *task = dst->target;
  2217. struct pt_regs *pt;
  2218. char buf[128];
  2219. int start, end, tos;
  2220. if (dst->count == 0 || unw_unwind_to_user(info) < 0)
  2221. return;
  2222. if (dst->pos < OFFSET(st_space[0])) {
  2223. end = min(dst->pos + dst->count, (unsigned int)32);
  2224. getfpxreg(task, dst->pos, end, buf);
  2225. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  2226. &dst->u.get.kbuf, &dst->u.get.ubuf, buf,
  2227. 0, OFFSET(st_space[0]));
  2228. if (dst->ret || dst->count == 0)
  2229. return;
  2230. }
  2231. if (dst->pos < OFFSET(xmm_space[0])) {
  2232. pt = task_pt_regs(task);
  2233. tos = (task->thread.fsr >> 11) & 7;
  2234. end = min(dst->pos + dst->count,
  2235. (unsigned int)OFFSET(xmm_space[0]));
  2236. start = (dst->pos - OFFSET(st_space[0])) / 16;
  2237. end = (end - OFFSET(st_space[0])) / 16;
  2238. for (; start < end; start++)
  2239. access_fpreg_ia32(start, buf + 16 * start, pt,
  2240. info->sw, tos, 0);
  2241. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  2242. &dst->u.get.kbuf, &dst->u.get.ubuf,
  2243. buf, OFFSET(st_space[0]), OFFSET(xmm_space[0]));
  2244. if (dst->ret || dst->count == 0)
  2245. return;
  2246. }
  2247. if (dst->pos < OFFSET(padding[0]))
  2248. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  2249. &dst->u.get.kbuf, &dst->u.get.ubuf,
  2250. &info->sw->f16, OFFSET(xmm_space[0]),
  2251. OFFSET(padding[0]));
  2252. }
  2253. static void do_fpxregs_set(struct unw_frame_info *info, void *arg)
  2254. {
  2255. struct regset_getset *dst = arg;
  2256. struct task_struct *task = dst->target;
  2257. char buf[128];
  2258. int start, end;
  2259. if (dst->count == 0 || unw_unwind_to_user(info) < 0)
  2260. return;
  2261. if (dst->pos < OFFSET(st_space[0])) {
  2262. start = dst->pos;
  2263. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  2264. &dst->u.set.kbuf, &dst->u.set.ubuf,
  2265. buf, 0, OFFSET(st_space[0]));
  2266. if (dst->ret)
  2267. return;
  2268. setfpxreg(task, start, dst->pos, buf);
  2269. if (dst->count == 0)
  2270. return;
  2271. }
  2272. if (dst->pos < OFFSET(xmm_space[0])) {
  2273. struct pt_regs *pt;
  2274. int tos;
  2275. pt = task_pt_regs(task);
  2276. tos = (task->thread.fsr >> 11) & 7;
  2277. start = (dst->pos - OFFSET(st_space[0])) / 16;
  2278. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  2279. &dst->u.set.kbuf, &dst->u.set.ubuf,
  2280. buf, OFFSET(st_space[0]), OFFSET(xmm_space[0]));
  2281. if (dst->ret)
  2282. return;
  2283. end = (dst->pos - OFFSET(st_space[0])) / 16;
  2284. for (; start < end; start++)
  2285. access_fpreg_ia32(start, buf + 16 * start, pt, info->sw,
  2286. tos, 1);
  2287. if (dst->count == 0)
  2288. return;
  2289. }
  2290. if (dst->pos < OFFSET(padding[0]))
  2291. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  2292. &dst->u.set.kbuf, &dst->u.set.ubuf,
  2293. &info->sw->f16, OFFSET(xmm_space[0]),
  2294. OFFSET(padding[0]));
  2295. }
  2296. #undef OFFSET
  2297. static int do_regset_call(void (*call)(struct unw_frame_info *, void *),
  2298. struct task_struct *target,
  2299. const struct user_regset *regset,
  2300. unsigned int pos, unsigned int count,
  2301. const void *kbuf, const void __user *ubuf)
  2302. {
  2303. struct regset_getset info = { .target = target, .regset = regset,
  2304. .pos = pos, .count = count,
  2305. .u.set = { .kbuf = kbuf, .ubuf = ubuf },
  2306. .ret = 0 };
  2307. if (target == current)
  2308. unw_init_running(call, &info);
  2309. else {
  2310. struct unw_frame_info ufi;
  2311. memset(&ufi, 0, sizeof(ufi));
  2312. unw_init_from_blocked_task(&ufi, target);
  2313. (*call)(&ufi, &info);
  2314. }
  2315. return info.ret;
  2316. }
  2317. static int ia32_fpregs_get(struct task_struct *target,
  2318. const struct user_regset *regset,
  2319. unsigned int pos, unsigned int count,
  2320. void *kbuf, void __user *ubuf)
  2321. {
  2322. return do_regset_call(do_fpregs_get, target, regset, pos, count,
  2323. kbuf, ubuf);
  2324. }
  2325. static int ia32_fpregs_set(struct task_struct *target,
  2326. const struct user_regset *regset,
  2327. unsigned int pos, unsigned int count,
  2328. const void *kbuf, const void __user *ubuf)
  2329. {
  2330. return do_regset_call(do_fpregs_set, target, regset, pos, count,
  2331. kbuf, ubuf);
  2332. }
  2333. static int ia32_fpxregs_get(struct task_struct *target,
  2334. const struct user_regset *regset,
  2335. unsigned int pos, unsigned int count,
  2336. void *kbuf, void __user *ubuf)
  2337. {
  2338. return do_regset_call(do_fpxregs_get, target, regset, pos, count,
  2339. kbuf, ubuf);
  2340. }
  2341. static int ia32_fpxregs_set(struct task_struct *target,
  2342. const struct user_regset *regset,
  2343. unsigned int pos, unsigned int count,
  2344. const void *kbuf, const void __user *ubuf)
  2345. {
  2346. return do_regset_call(do_fpxregs_set, target, regset, pos, count,
  2347. kbuf, ubuf);
  2348. }
  2349. static int ia32_genregs_get(struct task_struct *target,
  2350. const struct user_regset *regset,
  2351. unsigned int pos, unsigned int count,
  2352. void *kbuf, void __user *ubuf)
  2353. {
  2354. if (kbuf) {
  2355. u32 *kp = kbuf;
  2356. while (count > 0) {
  2357. *kp++ = getreg(target, pos);
  2358. pos += 4;
  2359. count -= 4;
  2360. }
  2361. } else {
  2362. u32 __user *up = ubuf;
  2363. while (count > 0) {
  2364. if (__put_user(getreg(target, pos), up++))
  2365. return -EFAULT;
  2366. pos += 4;
  2367. count -= 4;
  2368. }
  2369. }
  2370. return 0;
  2371. }
  2372. static int ia32_genregs_set(struct task_struct *target,
  2373. const struct user_regset *regset,
  2374. unsigned int pos, unsigned int count,
  2375. const void *kbuf, const void __user *ubuf)
  2376. {
  2377. int ret = 0;
  2378. if (kbuf) {
  2379. const u32 *kp = kbuf;
  2380. while (!ret && count > 0) {
  2381. putreg(target, pos, *kp++);
  2382. pos += 4;
  2383. count -= 4;
  2384. }
  2385. } else {
  2386. const u32 __user *up = ubuf;
  2387. u32 val;
  2388. while (!ret && count > 0) {
  2389. ret = __get_user(val, up++);
  2390. if (!ret)
  2391. putreg(target, pos, val);
  2392. pos += 4;
  2393. count -= 4;
  2394. }
  2395. }
  2396. return ret;
  2397. }
  2398. static int ia32_tls_active(struct task_struct *target,
  2399. const struct user_regset *regset)
  2400. {
  2401. struct thread_struct *t = &target->thread;
  2402. int n = GDT_ENTRY_TLS_ENTRIES;
  2403. while (n > 0 && desc_empty(&t->tls_array[n -1]))
  2404. --n;
  2405. return n;
  2406. }
  2407. static int ia32_tls_get(struct task_struct *target,
  2408. const struct user_regset *regset, unsigned int pos,
  2409. unsigned int count, void *kbuf, void __user *ubuf)
  2410. {
  2411. const struct desc_struct *tls;
  2412. if (pos > GDT_ENTRY_TLS_ENTRIES * sizeof(struct ia32_user_desc) ||
  2413. (pos % sizeof(struct ia32_user_desc)) != 0 ||
  2414. (count % sizeof(struct ia32_user_desc)) != 0)
  2415. return -EINVAL;
  2416. pos /= sizeof(struct ia32_user_desc);
  2417. count /= sizeof(struct ia32_user_desc);
  2418. tls = &target->thread.tls_array[pos];
  2419. if (kbuf) {
  2420. struct ia32_user_desc *info = kbuf;
  2421. while (count-- > 0)
  2422. fill_user_desc(info++, GDT_ENTRY_TLS_MIN + pos++,
  2423. tls++);
  2424. } else {
  2425. struct ia32_user_desc __user *u_info = ubuf;
  2426. while (count-- > 0) {
  2427. struct ia32_user_desc info;
  2428. fill_user_desc(&info, GDT_ENTRY_TLS_MIN + pos++, tls++);
  2429. if (__copy_to_user(u_info++, &info, sizeof(info)))
  2430. return -EFAULT;
  2431. }
  2432. }
  2433. return 0;
  2434. }
  2435. static int ia32_tls_set(struct task_struct *target,
  2436. const struct user_regset *regset, unsigned int pos,
  2437. unsigned int count, const void *kbuf, const void __user *ubuf)
  2438. {
  2439. struct ia32_user_desc infobuf[GDT_ENTRY_TLS_ENTRIES];
  2440. const struct ia32_user_desc *info;
  2441. if (pos > GDT_ENTRY_TLS_ENTRIES * sizeof(struct ia32_user_desc) ||
  2442. (pos % sizeof(struct ia32_user_desc)) != 0 ||
  2443. (count % sizeof(struct ia32_user_desc)) != 0)
  2444. return -EINVAL;
  2445. if (kbuf)
  2446. info = kbuf;
  2447. else if (__copy_from_user(infobuf, ubuf, count))
  2448. return -EFAULT;
  2449. else
  2450. info = infobuf;
  2451. set_tls_desc(target,
  2452. GDT_ENTRY_TLS_MIN + (pos / sizeof(struct ia32_user_desc)),
  2453. info, count / sizeof(struct ia32_user_desc));
  2454. return 0;
  2455. }
  2456. /*
  2457. * This should match arch/i386/kernel/ptrace.c:native_regsets.
  2458. * XXX ioperm? vm86?
  2459. */
  2460. static const struct user_regset ia32_regsets[] = {
  2461. {
  2462. .core_note_type = NT_PRSTATUS,
  2463. .n = sizeof(struct user_regs_struct32)/4,
  2464. .size = 4, .align = 4,
  2465. .get = ia32_genregs_get, .set = ia32_genregs_set
  2466. },
  2467. {
  2468. .core_note_type = NT_PRFPREG,
  2469. .n = sizeof(struct ia32_user_i387_struct) / 4,
  2470. .size = 4, .align = 4,
  2471. .get = ia32_fpregs_get, .set = ia32_fpregs_set
  2472. },
  2473. {
  2474. .core_note_type = NT_PRXFPREG,
  2475. .n = sizeof(struct ia32_user_fxsr_struct) / 4,
  2476. .size = 4, .align = 4,
  2477. .get = ia32_fpxregs_get, .set = ia32_fpxregs_set
  2478. },
  2479. {
  2480. .core_note_type = NT_386_TLS,
  2481. .n = GDT_ENTRY_TLS_ENTRIES,
  2482. .bias = GDT_ENTRY_TLS_MIN,
  2483. .size = sizeof(struct ia32_user_desc),
  2484. .align = sizeof(struct ia32_user_desc),
  2485. .active = ia32_tls_active,
  2486. .get = ia32_tls_get, .set = ia32_tls_set,
  2487. },
  2488. };
  2489. const struct user_regset_view user_ia32_view = {
  2490. .name = "i386", .e_machine = EM_386,
  2491. .regsets = ia32_regsets, .n = ARRAY_SIZE(ia32_regsets)
  2492. };
  2493. long sys32_fadvise64_64(int fd, __u32 offset_low, __u32 offset_high,
  2494. __u32 len_low, __u32 len_high, int advice)
  2495. {
  2496. return sys_fadvise64_64(fd,
  2497. (((u64)offset_high)<<32) | offset_low,
  2498. (((u64)len_high)<<32) | len_low,
  2499. advice);
  2500. }
  2501. #ifdef NOTYET /* UNTESTED FOR IA64 FROM HERE DOWN */
  2502. asmlinkage long sys32_setreuid(compat_uid_t ruid, compat_uid_t euid)
  2503. {
  2504. uid_t sruid, seuid;
  2505. sruid = (ruid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)ruid);
  2506. seuid = (euid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)euid);
  2507. return sys_setreuid(sruid, seuid);
  2508. }
  2509. asmlinkage long
  2510. sys32_setresuid(compat_uid_t ruid, compat_uid_t euid,
  2511. compat_uid_t suid)
  2512. {
  2513. uid_t sruid, seuid, ssuid;
  2514. sruid = (ruid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)ruid);
  2515. seuid = (euid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)euid);
  2516. ssuid = (suid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)suid);
  2517. return sys_setresuid(sruid, seuid, ssuid);
  2518. }
  2519. asmlinkage long
  2520. sys32_setregid(compat_gid_t rgid, compat_gid_t egid)
  2521. {
  2522. gid_t srgid, segid;
  2523. srgid = (rgid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)rgid);
  2524. segid = (egid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)egid);
  2525. return sys_setregid(srgid, segid);
  2526. }
  2527. asmlinkage long
  2528. sys32_setresgid(compat_gid_t rgid, compat_gid_t egid,
  2529. compat_gid_t sgid)
  2530. {
  2531. gid_t srgid, segid, ssgid;
  2532. srgid = (rgid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)rgid);
  2533. segid = (egid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)egid);
  2534. ssgid = (sgid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)sgid);
  2535. return sys_setresgid(srgid, segid, ssgid);
  2536. }
  2537. #endif /* NOTYET */