sys_ia32.c 69 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765
  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 (flags & MAP_HUGETLB)
  755. return -ENOMEM;
  756. #if PAGE_SHIFT > IA32_PAGE_SHIFT
  757. mutex_lock(&ia32_mmap_mutex);
  758. {
  759. addr = emulate_mmap(file, addr, len, prot, flags, offset);
  760. }
  761. mutex_unlock(&ia32_mmap_mutex);
  762. #else
  763. down_write(&current->mm->mmap_sem);
  764. {
  765. addr = do_mmap(file, addr, len, prot, flags, offset);
  766. }
  767. up_write(&current->mm->mmap_sem);
  768. #endif
  769. DBG("ia32_do_mmap: returning 0x%lx\n", addr);
  770. return addr;
  771. }
  772. /*
  773. * Linux/i386 didn't use to be able to handle more than 4 system call parameters, so these
  774. * system calls used a memory block for parameter passing..
  775. */
  776. struct mmap_arg_struct {
  777. unsigned int addr;
  778. unsigned int len;
  779. unsigned int prot;
  780. unsigned int flags;
  781. unsigned int fd;
  782. unsigned int offset;
  783. };
  784. asmlinkage long
  785. sys32_mmap (struct mmap_arg_struct __user *arg)
  786. {
  787. struct mmap_arg_struct a;
  788. struct file *file = NULL;
  789. unsigned long addr;
  790. int flags;
  791. if (copy_from_user(&a, arg, sizeof(a)))
  792. return -EFAULT;
  793. if (OFFSET4K(a.offset))
  794. return -EINVAL;
  795. flags = a.flags;
  796. flags &= ~(MAP_EXECUTABLE | MAP_DENYWRITE);
  797. if (!(flags & MAP_ANONYMOUS)) {
  798. file = fget(a.fd);
  799. if (!file)
  800. return -EBADF;
  801. }
  802. addr = ia32_do_mmap(file, a.addr, a.len, a.prot, flags, a.offset);
  803. if (file)
  804. fput(file);
  805. return addr;
  806. }
  807. asmlinkage long
  808. sys32_mmap2 (unsigned int addr, unsigned int len, unsigned int prot, unsigned int flags,
  809. unsigned int fd, unsigned int pgoff)
  810. {
  811. struct file *file = NULL;
  812. unsigned long retval;
  813. flags &= ~(MAP_EXECUTABLE | MAP_DENYWRITE);
  814. if (!(flags & MAP_ANONYMOUS)) {
  815. file = fget(fd);
  816. if (!file)
  817. return -EBADF;
  818. }
  819. retval = ia32_do_mmap(file, addr, len, prot, flags,
  820. (unsigned long) pgoff << IA32_PAGE_SHIFT);
  821. if (file)
  822. fput(file);
  823. return retval;
  824. }
  825. asmlinkage long
  826. sys32_munmap (unsigned int start, unsigned int len)
  827. {
  828. unsigned int end = start + len;
  829. long ret;
  830. #if PAGE_SHIFT <= IA32_PAGE_SHIFT
  831. ret = sys_munmap(start, end - start);
  832. #else
  833. if (OFFSET4K(start))
  834. return -EINVAL;
  835. end = IA32_PAGE_ALIGN(end);
  836. if (start >= end)
  837. return -EINVAL;
  838. ret = ia32_unset_pp(&start, &end);
  839. if (ret < 0)
  840. return ret;
  841. if (start >= end)
  842. return 0;
  843. mutex_lock(&ia32_mmap_mutex);
  844. ret = sys_munmap(start, end - start);
  845. mutex_unlock(&ia32_mmap_mutex);
  846. #endif
  847. return ret;
  848. }
  849. #if PAGE_SHIFT > IA32_PAGE_SHIFT
  850. /*
  851. * When mprotect()ing a partial page, we set the permission to the union of the old
  852. * settings and the new settings. In other words, it's only possible to make access to a
  853. * partial page less restrictive.
  854. */
  855. static long
  856. mprotect_subpage (unsigned long address, int new_prot)
  857. {
  858. int old_prot;
  859. struct vm_area_struct *vma;
  860. if (new_prot == PROT_NONE)
  861. return 0; /* optimize case where nothing changes... */
  862. vma = find_vma(current->mm, address);
  863. old_prot = get_page_prot(vma, address);
  864. return sys_mprotect(address, PAGE_SIZE, new_prot | old_prot);
  865. }
  866. #endif /* PAGE_SHIFT > IA32_PAGE_SHIFT */
  867. asmlinkage long
  868. sys32_mprotect (unsigned int start, unsigned int len, int prot)
  869. {
  870. unsigned int end = start + len;
  871. #if PAGE_SHIFT > IA32_PAGE_SHIFT
  872. long retval = 0;
  873. #endif
  874. prot = get_prot32(prot);
  875. #if PAGE_SHIFT <= IA32_PAGE_SHIFT
  876. return sys_mprotect(start, end - start, prot);
  877. #else
  878. if (OFFSET4K(start))
  879. return -EINVAL;
  880. end = IA32_PAGE_ALIGN(end);
  881. if (end < start)
  882. return -EINVAL;
  883. retval = ia32_compare_pp(&start, &end);
  884. if (retval < 0)
  885. return retval;
  886. mutex_lock(&ia32_mmap_mutex);
  887. {
  888. if (offset_in_page(start)) {
  889. /* start address is 4KB aligned but not page aligned. */
  890. retval = mprotect_subpage(PAGE_START(start), prot);
  891. if (retval < 0)
  892. goto out;
  893. start = PAGE_ALIGN(start);
  894. if (start >= end)
  895. goto out; /* retval is already zero... */
  896. }
  897. if (offset_in_page(end)) {
  898. /* end address is 4KB aligned but not page aligned. */
  899. retval = mprotect_subpage(PAGE_START(end), prot);
  900. if (retval < 0)
  901. goto out;
  902. end = PAGE_START(end);
  903. }
  904. retval = sys_mprotect(start, end - start, prot);
  905. }
  906. out:
  907. mutex_unlock(&ia32_mmap_mutex);
  908. return retval;
  909. #endif
  910. }
  911. asmlinkage long
  912. sys32_mremap (unsigned int addr, unsigned int old_len, unsigned int new_len,
  913. unsigned int flags, unsigned int new_addr)
  914. {
  915. long ret;
  916. #if PAGE_SHIFT <= IA32_PAGE_SHIFT
  917. ret = sys_mremap(addr, old_len, new_len, flags, new_addr);
  918. #else
  919. unsigned int old_end, new_end;
  920. if (OFFSET4K(addr))
  921. return -EINVAL;
  922. old_len = IA32_PAGE_ALIGN(old_len);
  923. new_len = IA32_PAGE_ALIGN(new_len);
  924. old_end = addr + old_len;
  925. new_end = addr + new_len;
  926. if (!new_len)
  927. return -EINVAL;
  928. if ((flags & MREMAP_FIXED) && (OFFSET4K(new_addr)))
  929. return -EINVAL;
  930. if (old_len >= new_len) {
  931. ret = sys32_munmap(addr + new_len, old_len - new_len);
  932. if (ret && old_len != new_len)
  933. return ret;
  934. ret = addr;
  935. if (!(flags & MREMAP_FIXED) || (new_addr == addr))
  936. return ret;
  937. old_len = new_len;
  938. }
  939. addr = PAGE_START(addr);
  940. old_len = PAGE_ALIGN(old_end) - addr;
  941. new_len = PAGE_ALIGN(new_end) - addr;
  942. mutex_lock(&ia32_mmap_mutex);
  943. ret = sys_mremap(addr, old_len, new_len, flags, new_addr);
  944. mutex_unlock(&ia32_mmap_mutex);
  945. if ((ret >= 0) && (old_len < new_len)) {
  946. /* mremap expanded successfully */
  947. ia32_set_pp(old_end, new_end, flags);
  948. }
  949. #endif
  950. return ret;
  951. }
  952. asmlinkage unsigned long
  953. sys32_alarm (unsigned int seconds)
  954. {
  955. return alarm_setitimer(seconds);
  956. }
  957. struct sel_arg_struct {
  958. unsigned int n;
  959. unsigned int inp;
  960. unsigned int outp;
  961. unsigned int exp;
  962. unsigned int tvp;
  963. };
  964. asmlinkage long
  965. sys32_old_select (struct sel_arg_struct __user *arg)
  966. {
  967. struct sel_arg_struct a;
  968. if (copy_from_user(&a, arg, sizeof(a)))
  969. return -EFAULT;
  970. return compat_sys_select(a.n, compat_ptr(a.inp), compat_ptr(a.outp),
  971. compat_ptr(a.exp), compat_ptr(a.tvp));
  972. }
  973. #define SEMOP 1
  974. #define SEMGET 2
  975. #define SEMCTL 3
  976. #define SEMTIMEDOP 4
  977. #define MSGSND 11
  978. #define MSGRCV 12
  979. #define MSGGET 13
  980. #define MSGCTL 14
  981. #define SHMAT 21
  982. #define SHMDT 22
  983. #define SHMGET 23
  984. #define SHMCTL 24
  985. asmlinkage long
  986. sys32_ipc(u32 call, int first, int second, int third, u32 ptr, u32 fifth)
  987. {
  988. int version;
  989. version = call >> 16; /* hack for backward compatibility */
  990. call &= 0xffff;
  991. switch (call) {
  992. case SEMTIMEDOP:
  993. if (fifth)
  994. return compat_sys_semtimedop(first, compat_ptr(ptr),
  995. second, compat_ptr(fifth));
  996. /* else fall through for normal semop() */
  997. case SEMOP:
  998. /* struct sembuf is the same on 32 and 64bit :)) */
  999. return sys_semtimedop(first, compat_ptr(ptr), second,
  1000. NULL);
  1001. case SEMGET:
  1002. return sys_semget(first, second, third);
  1003. case SEMCTL:
  1004. return compat_sys_semctl(first, second, third, compat_ptr(ptr));
  1005. case MSGSND:
  1006. return compat_sys_msgsnd(first, second, third, compat_ptr(ptr));
  1007. case MSGRCV:
  1008. return compat_sys_msgrcv(first, second, fifth, third, version, compat_ptr(ptr));
  1009. case MSGGET:
  1010. return sys_msgget((key_t) first, second);
  1011. case MSGCTL:
  1012. return compat_sys_msgctl(first, second, compat_ptr(ptr));
  1013. case SHMAT:
  1014. return compat_sys_shmat(first, second, third, version, compat_ptr(ptr));
  1015. break;
  1016. case SHMDT:
  1017. return sys_shmdt(compat_ptr(ptr));
  1018. case SHMGET:
  1019. return sys_shmget(first, (unsigned)second, third);
  1020. case SHMCTL:
  1021. return compat_sys_shmctl(first, second, compat_ptr(ptr));
  1022. default:
  1023. return -ENOSYS;
  1024. }
  1025. return -EINVAL;
  1026. }
  1027. asmlinkage long
  1028. compat_sys_wait4 (compat_pid_t pid, compat_uint_t * stat_addr, int options,
  1029. struct compat_rusage *ru);
  1030. asmlinkage long
  1031. sys32_waitpid (int pid, unsigned int *stat_addr, int options)
  1032. {
  1033. return compat_sys_wait4(pid, stat_addr, options, NULL);
  1034. }
  1035. /*
  1036. * The order in which registers are stored in the ptrace regs structure
  1037. */
  1038. #define PT_EBX 0
  1039. #define PT_ECX 1
  1040. #define PT_EDX 2
  1041. #define PT_ESI 3
  1042. #define PT_EDI 4
  1043. #define PT_EBP 5
  1044. #define PT_EAX 6
  1045. #define PT_DS 7
  1046. #define PT_ES 8
  1047. #define PT_FS 9
  1048. #define PT_GS 10
  1049. #define PT_ORIG_EAX 11
  1050. #define PT_EIP 12
  1051. #define PT_CS 13
  1052. #define PT_EFL 14
  1053. #define PT_UESP 15
  1054. #define PT_SS 16
  1055. static unsigned int
  1056. getreg (struct task_struct *child, int regno)
  1057. {
  1058. struct pt_regs *child_regs;
  1059. child_regs = task_pt_regs(child);
  1060. switch (regno / sizeof(int)) {
  1061. case PT_EBX: return child_regs->r11;
  1062. case PT_ECX: return child_regs->r9;
  1063. case PT_EDX: return child_regs->r10;
  1064. case PT_ESI: return child_regs->r14;
  1065. case PT_EDI: return child_regs->r15;
  1066. case PT_EBP: return child_regs->r13;
  1067. case PT_EAX: return child_regs->r8;
  1068. case PT_ORIG_EAX: return child_regs->r1; /* see dispatch_to_ia32_handler() */
  1069. case PT_EIP: return child_regs->cr_iip;
  1070. case PT_UESP: return child_regs->r12;
  1071. case PT_EFL: return child->thread.eflag;
  1072. case PT_DS: case PT_ES: case PT_FS: case PT_GS: case PT_SS:
  1073. return __USER_DS;
  1074. case PT_CS: return __USER_CS;
  1075. default:
  1076. printk(KERN_ERR "ia32.getreg(): unknown register %d\n", regno);
  1077. break;
  1078. }
  1079. return 0;
  1080. }
  1081. static void
  1082. putreg (struct task_struct *child, int regno, unsigned int value)
  1083. {
  1084. struct pt_regs *child_regs;
  1085. child_regs = task_pt_regs(child);
  1086. switch (regno / sizeof(int)) {
  1087. case PT_EBX: child_regs->r11 = value; break;
  1088. case PT_ECX: child_regs->r9 = value; break;
  1089. case PT_EDX: child_regs->r10 = value; break;
  1090. case PT_ESI: child_regs->r14 = value; break;
  1091. case PT_EDI: child_regs->r15 = value; break;
  1092. case PT_EBP: child_regs->r13 = value; break;
  1093. case PT_EAX: child_regs->r8 = value; break;
  1094. case PT_ORIG_EAX: child_regs->r1 = value; break;
  1095. case PT_EIP: child_regs->cr_iip = value; break;
  1096. case PT_UESP: child_regs->r12 = value; break;
  1097. case PT_EFL: child->thread.eflag = value; break;
  1098. case PT_DS: case PT_ES: case PT_FS: case PT_GS: case PT_SS:
  1099. if (value != __USER_DS)
  1100. printk(KERN_ERR
  1101. "ia32.putreg: attempt to set invalid segment register %d = %x\n",
  1102. regno, value);
  1103. break;
  1104. case PT_CS:
  1105. if (value != __USER_CS)
  1106. printk(KERN_ERR
  1107. "ia32.putreg: attempt to set invalid segment register %d = %x\n",
  1108. regno, value);
  1109. break;
  1110. default:
  1111. printk(KERN_ERR "ia32.putreg: unknown register %d\n", regno);
  1112. break;
  1113. }
  1114. }
  1115. static void
  1116. put_fpreg (int regno, struct _fpreg_ia32 __user *reg, struct pt_regs *ptp,
  1117. struct switch_stack *swp, int tos)
  1118. {
  1119. struct _fpreg_ia32 *f;
  1120. char buf[32];
  1121. f = (struct _fpreg_ia32 *)(((unsigned long)buf + 15) & ~15);
  1122. if ((regno += tos) >= 8)
  1123. regno -= 8;
  1124. switch (regno) {
  1125. case 0:
  1126. ia64f2ia32f(f, &ptp->f8);
  1127. break;
  1128. case 1:
  1129. ia64f2ia32f(f, &ptp->f9);
  1130. break;
  1131. case 2:
  1132. ia64f2ia32f(f, &ptp->f10);
  1133. break;
  1134. case 3:
  1135. ia64f2ia32f(f, &ptp->f11);
  1136. break;
  1137. case 4:
  1138. case 5:
  1139. case 6:
  1140. case 7:
  1141. ia64f2ia32f(f, &swp->f12 + (regno - 4));
  1142. break;
  1143. }
  1144. copy_to_user(reg, f, sizeof(*reg));
  1145. }
  1146. static void
  1147. get_fpreg (int regno, struct _fpreg_ia32 __user *reg, struct pt_regs *ptp,
  1148. struct switch_stack *swp, int tos)
  1149. {
  1150. if ((regno += tos) >= 8)
  1151. regno -= 8;
  1152. switch (regno) {
  1153. case 0:
  1154. copy_from_user(&ptp->f8, reg, sizeof(*reg));
  1155. break;
  1156. case 1:
  1157. copy_from_user(&ptp->f9, reg, sizeof(*reg));
  1158. break;
  1159. case 2:
  1160. copy_from_user(&ptp->f10, reg, sizeof(*reg));
  1161. break;
  1162. case 3:
  1163. copy_from_user(&ptp->f11, reg, sizeof(*reg));
  1164. break;
  1165. case 4:
  1166. case 5:
  1167. case 6:
  1168. case 7:
  1169. copy_from_user(&swp->f12 + (regno - 4), reg, sizeof(*reg));
  1170. break;
  1171. }
  1172. return;
  1173. }
  1174. int
  1175. save_ia32_fpstate (struct task_struct *tsk, struct ia32_user_i387_struct __user *save)
  1176. {
  1177. struct switch_stack *swp;
  1178. struct pt_regs *ptp;
  1179. int i, tos;
  1180. if (!access_ok(VERIFY_WRITE, save, sizeof(*save)))
  1181. return -EFAULT;
  1182. __put_user(tsk->thread.fcr & 0xffff, &save->cwd);
  1183. __put_user(tsk->thread.fsr & 0xffff, &save->swd);
  1184. __put_user((tsk->thread.fsr>>16) & 0xffff, &save->twd);
  1185. __put_user(tsk->thread.fir, &save->fip);
  1186. __put_user((tsk->thread.fir>>32) & 0xffff, &save->fcs);
  1187. __put_user(tsk->thread.fdr, &save->foo);
  1188. __put_user((tsk->thread.fdr>>32) & 0xffff, &save->fos);
  1189. /*
  1190. * Stack frames start with 16-bytes of temp space
  1191. */
  1192. swp = (struct switch_stack *)(tsk->thread.ksp + 16);
  1193. ptp = task_pt_regs(tsk);
  1194. tos = (tsk->thread.fsr >> 11) & 7;
  1195. for (i = 0; i < 8; i++)
  1196. put_fpreg(i, &save->st_space[i], ptp, swp, tos);
  1197. return 0;
  1198. }
  1199. static int
  1200. restore_ia32_fpstate (struct task_struct *tsk, struct ia32_user_i387_struct __user *save)
  1201. {
  1202. struct switch_stack *swp;
  1203. struct pt_regs *ptp;
  1204. int i, tos;
  1205. unsigned int fsrlo, fsrhi, num32;
  1206. if (!access_ok(VERIFY_READ, save, sizeof(*save)))
  1207. return(-EFAULT);
  1208. __get_user(num32, (unsigned int __user *)&save->cwd);
  1209. tsk->thread.fcr = (tsk->thread.fcr & (~0x1f3f)) | (num32 & 0x1f3f);
  1210. __get_user(fsrlo, (unsigned int __user *)&save->swd);
  1211. __get_user(fsrhi, (unsigned int __user *)&save->twd);
  1212. num32 = (fsrhi << 16) | fsrlo;
  1213. tsk->thread.fsr = (tsk->thread.fsr & (~0xffffffff)) | num32;
  1214. __get_user(num32, (unsigned int __user *)&save->fip);
  1215. tsk->thread.fir = (tsk->thread.fir & (~0xffffffff)) | num32;
  1216. __get_user(num32, (unsigned int __user *)&save->foo);
  1217. tsk->thread.fdr = (tsk->thread.fdr & (~0xffffffff)) | num32;
  1218. /*
  1219. * Stack frames start with 16-bytes of temp space
  1220. */
  1221. swp = (struct switch_stack *)(tsk->thread.ksp + 16);
  1222. ptp = task_pt_regs(tsk);
  1223. tos = (tsk->thread.fsr >> 11) & 7;
  1224. for (i = 0; i < 8; i++)
  1225. get_fpreg(i, &save->st_space[i], ptp, swp, tos);
  1226. return 0;
  1227. }
  1228. int
  1229. save_ia32_fpxstate (struct task_struct *tsk, struct ia32_user_fxsr_struct __user *save)
  1230. {
  1231. struct switch_stack *swp;
  1232. struct pt_regs *ptp;
  1233. int i, tos;
  1234. unsigned long mxcsr=0;
  1235. unsigned long num128[2];
  1236. if (!access_ok(VERIFY_WRITE, save, sizeof(*save)))
  1237. return -EFAULT;
  1238. __put_user(tsk->thread.fcr & 0xffff, &save->cwd);
  1239. __put_user(tsk->thread.fsr & 0xffff, &save->swd);
  1240. __put_user((tsk->thread.fsr>>16) & 0xffff, &save->twd);
  1241. __put_user(tsk->thread.fir, &save->fip);
  1242. __put_user((tsk->thread.fir>>32) & 0xffff, &save->fcs);
  1243. __put_user(tsk->thread.fdr, &save->foo);
  1244. __put_user((tsk->thread.fdr>>32) & 0xffff, &save->fos);
  1245. /*
  1246. * Stack frames start with 16-bytes of temp space
  1247. */
  1248. swp = (struct switch_stack *)(tsk->thread.ksp + 16);
  1249. ptp = task_pt_regs(tsk);
  1250. tos = (tsk->thread.fsr >> 11) & 7;
  1251. for (i = 0; i < 8; i++)
  1252. put_fpreg(i, (struct _fpreg_ia32 __user *)&save->st_space[4*i], ptp, swp, tos);
  1253. mxcsr = ((tsk->thread.fcr>>32) & 0xff80) | ((tsk->thread.fsr>>32) & 0x3f);
  1254. __put_user(mxcsr & 0xffff, &save->mxcsr);
  1255. for (i = 0; i < 8; i++) {
  1256. memcpy(&(num128[0]), &(swp->f16) + i*2, sizeof(unsigned long));
  1257. memcpy(&(num128[1]), &(swp->f17) + i*2, sizeof(unsigned long));
  1258. copy_to_user(&save->xmm_space[0] + 4*i, num128, sizeof(struct _xmmreg_ia32));
  1259. }
  1260. return 0;
  1261. }
  1262. static int
  1263. restore_ia32_fpxstate (struct task_struct *tsk, struct ia32_user_fxsr_struct __user *save)
  1264. {
  1265. struct switch_stack *swp;
  1266. struct pt_regs *ptp;
  1267. int i, tos;
  1268. unsigned int fsrlo, fsrhi, num32;
  1269. int mxcsr;
  1270. unsigned long num64;
  1271. unsigned long num128[2];
  1272. if (!access_ok(VERIFY_READ, save, sizeof(*save)))
  1273. return(-EFAULT);
  1274. __get_user(num32, (unsigned int __user *)&save->cwd);
  1275. tsk->thread.fcr = (tsk->thread.fcr & (~0x1f3f)) | (num32 & 0x1f3f);
  1276. __get_user(fsrlo, (unsigned int __user *)&save->swd);
  1277. __get_user(fsrhi, (unsigned int __user *)&save->twd);
  1278. num32 = (fsrhi << 16) | fsrlo;
  1279. tsk->thread.fsr = (tsk->thread.fsr & (~0xffffffff)) | num32;
  1280. __get_user(num32, (unsigned int __user *)&save->fip);
  1281. tsk->thread.fir = (tsk->thread.fir & (~0xffffffff)) | num32;
  1282. __get_user(num32, (unsigned int __user *)&save->foo);
  1283. tsk->thread.fdr = (tsk->thread.fdr & (~0xffffffff)) | num32;
  1284. /*
  1285. * Stack frames start with 16-bytes of temp space
  1286. */
  1287. swp = (struct switch_stack *)(tsk->thread.ksp + 16);
  1288. ptp = task_pt_regs(tsk);
  1289. tos = (tsk->thread.fsr >> 11) & 7;
  1290. for (i = 0; i < 8; i++)
  1291. get_fpreg(i, (struct _fpreg_ia32 __user *)&save->st_space[4*i], ptp, swp, tos);
  1292. __get_user(mxcsr, (unsigned int __user *)&save->mxcsr);
  1293. num64 = mxcsr & 0xff10;
  1294. tsk->thread.fcr = (tsk->thread.fcr & (~0xff1000000000UL)) | (num64<<32);
  1295. num64 = mxcsr & 0x3f;
  1296. tsk->thread.fsr = (tsk->thread.fsr & (~0x3f00000000UL)) | (num64<<32);
  1297. for (i = 0; i < 8; i++) {
  1298. copy_from_user(num128, &save->xmm_space[0] + 4*i, sizeof(struct _xmmreg_ia32));
  1299. memcpy(&(swp->f16) + i*2, &(num128[0]), sizeof(unsigned long));
  1300. memcpy(&(swp->f17) + i*2, &(num128[1]), sizeof(unsigned long));
  1301. }
  1302. return 0;
  1303. }
  1304. long compat_arch_ptrace(struct task_struct *child, compat_long_t request,
  1305. compat_ulong_t caddr, compat_ulong_t cdata)
  1306. {
  1307. unsigned long addr = caddr;
  1308. unsigned long data = cdata;
  1309. unsigned int tmp;
  1310. long i, ret;
  1311. switch (request) {
  1312. case PTRACE_PEEKUSR: /* read word at addr in USER area */
  1313. ret = -EIO;
  1314. if ((addr & 3) || addr > 17*sizeof(int))
  1315. break;
  1316. tmp = getreg(child, addr);
  1317. if (!put_user(tmp, (unsigned int __user *) compat_ptr(data)))
  1318. ret = 0;
  1319. break;
  1320. case PTRACE_POKEUSR: /* write word at addr in USER area */
  1321. ret = -EIO;
  1322. if ((addr & 3) || addr > 17*sizeof(int))
  1323. break;
  1324. putreg(child, addr, data);
  1325. ret = 0;
  1326. break;
  1327. case IA32_PTRACE_GETREGS:
  1328. if (!access_ok(VERIFY_WRITE, compat_ptr(data), 17*sizeof(int))) {
  1329. ret = -EIO;
  1330. break;
  1331. }
  1332. for (i = 0; i < (int) (17*sizeof(int)); i += sizeof(int) ) {
  1333. put_user(getreg(child, i), (unsigned int __user *) compat_ptr(data));
  1334. data += sizeof(int);
  1335. }
  1336. ret = 0;
  1337. break;
  1338. case IA32_PTRACE_SETREGS:
  1339. if (!access_ok(VERIFY_READ, compat_ptr(data), 17*sizeof(int))) {
  1340. ret = -EIO;
  1341. break;
  1342. }
  1343. for (i = 0; i < (int) (17*sizeof(int)); i += sizeof(int) ) {
  1344. get_user(tmp, (unsigned int __user *) compat_ptr(data));
  1345. putreg(child, i, tmp);
  1346. data += sizeof(int);
  1347. }
  1348. ret = 0;
  1349. break;
  1350. case IA32_PTRACE_GETFPREGS:
  1351. ret = save_ia32_fpstate(child, (struct ia32_user_i387_struct __user *)
  1352. compat_ptr(data));
  1353. break;
  1354. case IA32_PTRACE_GETFPXREGS:
  1355. ret = save_ia32_fpxstate(child, (struct ia32_user_fxsr_struct __user *)
  1356. compat_ptr(data));
  1357. break;
  1358. case IA32_PTRACE_SETFPREGS:
  1359. ret = restore_ia32_fpstate(child, (struct ia32_user_i387_struct __user *)
  1360. compat_ptr(data));
  1361. break;
  1362. case IA32_PTRACE_SETFPXREGS:
  1363. ret = restore_ia32_fpxstate(child, (struct ia32_user_fxsr_struct __user *)
  1364. compat_ptr(data));
  1365. break;
  1366. default:
  1367. return compat_ptrace_request(child, request, caddr, cdata);
  1368. }
  1369. return ret;
  1370. }
  1371. typedef struct {
  1372. unsigned int ss_sp;
  1373. unsigned int ss_flags;
  1374. unsigned int ss_size;
  1375. } ia32_stack_t;
  1376. asmlinkage long
  1377. sys32_sigaltstack (ia32_stack_t __user *uss32, ia32_stack_t __user *uoss32,
  1378. long arg2, long arg3, long arg4, long arg5, long arg6,
  1379. long arg7, struct pt_regs pt)
  1380. {
  1381. stack_t uss, uoss;
  1382. ia32_stack_t buf32;
  1383. int ret;
  1384. mm_segment_t old_fs = get_fs();
  1385. if (uss32) {
  1386. if (copy_from_user(&buf32, uss32, sizeof(ia32_stack_t)))
  1387. return -EFAULT;
  1388. uss.ss_sp = (void __user *) (long) buf32.ss_sp;
  1389. uss.ss_flags = buf32.ss_flags;
  1390. /* MINSIGSTKSZ is different for ia32 vs ia64. We lie here to pass the
  1391. check and set it to the user requested value later */
  1392. if ((buf32.ss_flags != SS_DISABLE) && (buf32.ss_size < MINSIGSTKSZ_IA32)) {
  1393. ret = -ENOMEM;
  1394. goto out;
  1395. }
  1396. uss.ss_size = MINSIGSTKSZ;
  1397. }
  1398. set_fs(KERNEL_DS);
  1399. ret = do_sigaltstack(uss32 ? (stack_t __user *) &uss : NULL,
  1400. (stack_t __user *) &uoss, pt.r12);
  1401. current->sas_ss_size = buf32.ss_size;
  1402. set_fs(old_fs);
  1403. out:
  1404. if (ret < 0)
  1405. return(ret);
  1406. if (uoss32) {
  1407. buf32.ss_sp = (long __user) uoss.ss_sp;
  1408. buf32.ss_flags = uoss.ss_flags;
  1409. buf32.ss_size = uoss.ss_size;
  1410. if (copy_to_user(uoss32, &buf32, sizeof(ia32_stack_t)))
  1411. return -EFAULT;
  1412. }
  1413. return ret;
  1414. }
  1415. asmlinkage int
  1416. sys32_msync (unsigned int start, unsigned int len, int flags)
  1417. {
  1418. unsigned int addr;
  1419. if (OFFSET4K(start))
  1420. return -EINVAL;
  1421. addr = PAGE_START(start);
  1422. return sys_msync(addr, len + (start - addr), flags);
  1423. }
  1424. asmlinkage long
  1425. sys32_newuname (struct new_utsname __user *name)
  1426. {
  1427. int ret = sys_newuname(name);
  1428. if (!ret)
  1429. if (copy_to_user(name->machine, "i686\0\0\0", 8))
  1430. ret = -EFAULT;
  1431. return ret;
  1432. }
  1433. asmlinkage long
  1434. sys32_getresuid16 (u16 __user *ruid, u16 __user *euid, u16 __user *suid)
  1435. {
  1436. uid_t a, b, c;
  1437. int ret;
  1438. mm_segment_t old_fs = get_fs();
  1439. set_fs(KERNEL_DS);
  1440. ret = sys_getresuid((uid_t __user *) &a, (uid_t __user *) &b, (uid_t __user *) &c);
  1441. set_fs(old_fs);
  1442. if (put_user(a, ruid) || put_user(b, euid) || put_user(c, suid))
  1443. return -EFAULT;
  1444. return ret;
  1445. }
  1446. asmlinkage long
  1447. sys32_getresgid16 (u16 __user *rgid, u16 __user *egid, u16 __user *sgid)
  1448. {
  1449. gid_t a, b, c;
  1450. int ret;
  1451. mm_segment_t old_fs = get_fs();
  1452. set_fs(KERNEL_DS);
  1453. ret = sys_getresgid((gid_t __user *) &a, (gid_t __user *) &b, (gid_t __user *) &c);
  1454. set_fs(old_fs);
  1455. if (ret)
  1456. return ret;
  1457. return put_user(a, rgid) | put_user(b, egid) | put_user(c, sgid);
  1458. }
  1459. asmlinkage long
  1460. sys32_lseek (unsigned int fd, int offset, unsigned int whence)
  1461. {
  1462. /* Sign-extension of "offset" is important here... */
  1463. return sys_lseek(fd, offset, whence);
  1464. }
  1465. static int
  1466. groups16_to_user(short __user *grouplist, struct group_info *group_info)
  1467. {
  1468. int i;
  1469. short group;
  1470. for (i = 0; i < group_info->ngroups; i++) {
  1471. group = (short)GROUP_AT(group_info, i);
  1472. if (put_user(group, grouplist+i))
  1473. return -EFAULT;
  1474. }
  1475. return 0;
  1476. }
  1477. static int
  1478. groups16_from_user(struct group_info *group_info, short __user *grouplist)
  1479. {
  1480. int i;
  1481. short group;
  1482. for (i = 0; i < group_info->ngroups; i++) {
  1483. if (get_user(group, grouplist+i))
  1484. return -EFAULT;
  1485. GROUP_AT(group_info, i) = (gid_t)group;
  1486. }
  1487. return 0;
  1488. }
  1489. asmlinkage long
  1490. sys32_getgroups16 (int gidsetsize, short __user *grouplist)
  1491. {
  1492. const struct cred *cred = current_cred();
  1493. int i;
  1494. if (gidsetsize < 0)
  1495. return -EINVAL;
  1496. i = cred->group_info->ngroups;
  1497. if (gidsetsize) {
  1498. if (i > gidsetsize) {
  1499. i = -EINVAL;
  1500. goto out;
  1501. }
  1502. if (groups16_to_user(grouplist, cred->group_info)) {
  1503. i = -EFAULT;
  1504. goto out;
  1505. }
  1506. }
  1507. out:
  1508. return i;
  1509. }
  1510. asmlinkage long
  1511. sys32_setgroups16 (int gidsetsize, short __user *grouplist)
  1512. {
  1513. struct group_info *group_info;
  1514. int retval;
  1515. if (!capable(CAP_SETGID))
  1516. return -EPERM;
  1517. if ((unsigned)gidsetsize > NGROUPS_MAX)
  1518. return -EINVAL;
  1519. group_info = groups_alloc(gidsetsize);
  1520. if (!group_info)
  1521. return -ENOMEM;
  1522. retval = groups16_from_user(group_info, grouplist);
  1523. if (retval) {
  1524. put_group_info(group_info);
  1525. return retval;
  1526. }
  1527. retval = set_current_groups(group_info);
  1528. put_group_info(group_info);
  1529. return retval;
  1530. }
  1531. asmlinkage long
  1532. sys32_truncate64 (unsigned int path, unsigned int len_lo, unsigned int len_hi)
  1533. {
  1534. return sys_truncate(compat_ptr(path), ((unsigned long) len_hi << 32) | len_lo);
  1535. }
  1536. asmlinkage long
  1537. sys32_ftruncate64 (int fd, unsigned int len_lo, unsigned int len_hi)
  1538. {
  1539. return sys_ftruncate(fd, ((unsigned long) len_hi << 32) | len_lo);
  1540. }
  1541. static int
  1542. putstat64 (struct stat64 __user *ubuf, struct kstat *kbuf)
  1543. {
  1544. int err;
  1545. u64 hdev;
  1546. if (clear_user(ubuf, sizeof(*ubuf)))
  1547. return -EFAULT;
  1548. hdev = huge_encode_dev(kbuf->dev);
  1549. err = __put_user(hdev, (u32 __user*)&ubuf->st_dev);
  1550. err |= __put_user(hdev >> 32, ((u32 __user*)&ubuf->st_dev) + 1);
  1551. err |= __put_user(kbuf->ino, &ubuf->__st_ino);
  1552. err |= __put_user(kbuf->ino, &ubuf->st_ino_lo);
  1553. err |= __put_user(kbuf->ino >> 32, &ubuf->st_ino_hi);
  1554. err |= __put_user(kbuf->mode, &ubuf->st_mode);
  1555. err |= __put_user(kbuf->nlink, &ubuf->st_nlink);
  1556. err |= __put_user(kbuf->uid, &ubuf->st_uid);
  1557. err |= __put_user(kbuf->gid, &ubuf->st_gid);
  1558. hdev = huge_encode_dev(kbuf->rdev);
  1559. err = __put_user(hdev, (u32 __user*)&ubuf->st_rdev);
  1560. err |= __put_user(hdev >> 32, ((u32 __user*)&ubuf->st_rdev) + 1);
  1561. err |= __put_user(kbuf->size, &ubuf->st_size_lo);
  1562. err |= __put_user((kbuf->size >> 32), &ubuf->st_size_hi);
  1563. err |= __put_user(kbuf->atime.tv_sec, &ubuf->st_atime);
  1564. err |= __put_user(kbuf->atime.tv_nsec, &ubuf->st_atime_nsec);
  1565. err |= __put_user(kbuf->mtime.tv_sec, &ubuf->st_mtime);
  1566. err |= __put_user(kbuf->mtime.tv_nsec, &ubuf->st_mtime_nsec);
  1567. err |= __put_user(kbuf->ctime.tv_sec, &ubuf->st_ctime);
  1568. err |= __put_user(kbuf->ctime.tv_nsec, &ubuf->st_ctime_nsec);
  1569. err |= __put_user(kbuf->blksize, &ubuf->st_blksize);
  1570. err |= __put_user(kbuf->blocks, &ubuf->st_blocks);
  1571. return err;
  1572. }
  1573. asmlinkage long
  1574. sys32_stat64 (char __user *filename, struct stat64 __user *statbuf)
  1575. {
  1576. struct kstat s;
  1577. long ret = vfs_stat(filename, &s);
  1578. if (!ret)
  1579. ret = putstat64(statbuf, &s);
  1580. return ret;
  1581. }
  1582. asmlinkage long
  1583. sys32_lstat64 (char __user *filename, struct stat64 __user *statbuf)
  1584. {
  1585. struct kstat s;
  1586. long ret = vfs_lstat(filename, &s);
  1587. if (!ret)
  1588. ret = putstat64(statbuf, &s);
  1589. return ret;
  1590. }
  1591. asmlinkage long
  1592. sys32_fstat64 (unsigned int fd, struct stat64 __user *statbuf)
  1593. {
  1594. struct kstat s;
  1595. long ret = vfs_fstat(fd, &s);
  1596. if (!ret)
  1597. ret = putstat64(statbuf, &s);
  1598. return ret;
  1599. }
  1600. asmlinkage long
  1601. sys32_sched_rr_get_interval (pid_t pid, struct compat_timespec __user *interval)
  1602. {
  1603. mm_segment_t old_fs = get_fs();
  1604. struct timespec t;
  1605. long ret;
  1606. set_fs(KERNEL_DS);
  1607. ret = sys_sched_rr_get_interval(pid, (struct timespec __user *) &t);
  1608. set_fs(old_fs);
  1609. if (put_compat_timespec(&t, interval))
  1610. return -EFAULT;
  1611. return ret;
  1612. }
  1613. asmlinkage long
  1614. sys32_pread (unsigned int fd, void __user *buf, unsigned int count, u32 pos_lo, u32 pos_hi)
  1615. {
  1616. return sys_pread64(fd, buf, count, ((unsigned long) pos_hi << 32) | pos_lo);
  1617. }
  1618. asmlinkage long
  1619. sys32_pwrite (unsigned int fd, void __user *buf, unsigned int count, u32 pos_lo, u32 pos_hi)
  1620. {
  1621. return sys_pwrite64(fd, buf, count, ((unsigned long) pos_hi << 32) | pos_lo);
  1622. }
  1623. asmlinkage long
  1624. sys32_sendfile (int out_fd, int in_fd, int __user *offset, unsigned int count)
  1625. {
  1626. mm_segment_t old_fs = get_fs();
  1627. long ret;
  1628. off_t of;
  1629. if (offset && get_user(of, offset))
  1630. return -EFAULT;
  1631. set_fs(KERNEL_DS);
  1632. ret = sys_sendfile(out_fd, in_fd, offset ? (off_t __user *) &of : NULL, count);
  1633. set_fs(old_fs);
  1634. if (offset && put_user(of, offset))
  1635. return -EFAULT;
  1636. return ret;
  1637. }
  1638. asmlinkage long
  1639. sys32_personality (unsigned int personality)
  1640. {
  1641. long ret;
  1642. if (current->personality == PER_LINUX32 && personality == PER_LINUX)
  1643. personality = PER_LINUX32;
  1644. ret = sys_personality(personality);
  1645. if (ret == PER_LINUX32)
  1646. ret = PER_LINUX;
  1647. return ret;
  1648. }
  1649. asmlinkage unsigned long
  1650. sys32_brk (unsigned int brk)
  1651. {
  1652. unsigned long ret, obrk;
  1653. struct mm_struct *mm = current->mm;
  1654. obrk = mm->brk;
  1655. ret = sys_brk(brk);
  1656. if (ret < obrk)
  1657. clear_user(compat_ptr(ret), PAGE_ALIGN(ret) - ret);
  1658. return ret;
  1659. }
  1660. /* Structure for ia32 emulation on ia64 */
  1661. struct epoll_event32
  1662. {
  1663. u32 events;
  1664. u32 data[2];
  1665. };
  1666. asmlinkage long
  1667. sys32_epoll_ctl(int epfd, int op, int fd, struct epoll_event32 __user *event)
  1668. {
  1669. mm_segment_t old_fs = get_fs();
  1670. struct epoll_event event64;
  1671. int error;
  1672. u32 data_halfword;
  1673. if (!access_ok(VERIFY_READ, event, sizeof(struct epoll_event32)))
  1674. return -EFAULT;
  1675. __get_user(event64.events, &event->events);
  1676. __get_user(data_halfword, &event->data[0]);
  1677. event64.data = data_halfword;
  1678. __get_user(data_halfword, &event->data[1]);
  1679. event64.data |= (u64)data_halfword << 32;
  1680. set_fs(KERNEL_DS);
  1681. error = sys_epoll_ctl(epfd, op, fd, (struct epoll_event __user *) &event64);
  1682. set_fs(old_fs);
  1683. return error;
  1684. }
  1685. asmlinkage long
  1686. sys32_epoll_wait(int epfd, struct epoll_event32 __user * events, int maxevents,
  1687. int timeout)
  1688. {
  1689. struct epoll_event *events64 = NULL;
  1690. mm_segment_t old_fs = get_fs();
  1691. int numevents, size;
  1692. int evt_idx;
  1693. int do_free_pages = 0;
  1694. if (maxevents <= 0) {
  1695. return -EINVAL;
  1696. }
  1697. /* Verify that the area passed by the user is writeable */
  1698. if (!access_ok(VERIFY_WRITE, events, maxevents * sizeof(struct epoll_event32)))
  1699. return -EFAULT;
  1700. /*
  1701. * Allocate space for the intermediate copy. If the space needed
  1702. * is large enough to cause kmalloc to fail, then try again with
  1703. * __get_free_pages.
  1704. */
  1705. size = maxevents * sizeof(struct epoll_event);
  1706. events64 = kmalloc(size, GFP_KERNEL);
  1707. if (events64 == NULL) {
  1708. events64 = (struct epoll_event *)
  1709. __get_free_pages(GFP_KERNEL, get_order(size));
  1710. if (events64 == NULL)
  1711. return -ENOMEM;
  1712. do_free_pages = 1;
  1713. }
  1714. /* Do the system call */
  1715. set_fs(KERNEL_DS); /* copy_to/from_user should work on kernel mem*/
  1716. numevents = sys_epoll_wait(epfd, (struct epoll_event __user *) events64,
  1717. maxevents, timeout);
  1718. set_fs(old_fs);
  1719. /* Don't modify userspace memory if we're returning an error */
  1720. if (numevents > 0) {
  1721. /* Translate the 64-bit structures back into the 32-bit
  1722. structures */
  1723. for (evt_idx = 0; evt_idx < numevents; evt_idx++) {
  1724. __put_user(events64[evt_idx].events,
  1725. &events[evt_idx].events);
  1726. __put_user((u32)events64[evt_idx].data,
  1727. &events[evt_idx].data[0]);
  1728. __put_user((u32)(events64[evt_idx].data >> 32),
  1729. &events[evt_idx].data[1]);
  1730. }
  1731. }
  1732. if (do_free_pages)
  1733. free_pages((unsigned long) events64, get_order(size));
  1734. else
  1735. kfree(events64);
  1736. return numevents;
  1737. }
  1738. /*
  1739. * Get a yet unused TLS descriptor index.
  1740. */
  1741. static int
  1742. get_free_idx (void)
  1743. {
  1744. struct thread_struct *t = &current->thread;
  1745. int idx;
  1746. for (idx = 0; idx < GDT_ENTRY_TLS_ENTRIES; idx++)
  1747. if (desc_empty(t->tls_array + idx))
  1748. return idx + GDT_ENTRY_TLS_MIN;
  1749. return -ESRCH;
  1750. }
  1751. static void set_tls_desc(struct task_struct *p, int idx,
  1752. const struct ia32_user_desc *info, int n)
  1753. {
  1754. struct thread_struct *t = &p->thread;
  1755. struct desc_struct *desc = &t->tls_array[idx - GDT_ENTRY_TLS_MIN];
  1756. int cpu;
  1757. /*
  1758. * We must not get preempted while modifying the TLS.
  1759. */
  1760. cpu = get_cpu();
  1761. while (n-- > 0) {
  1762. if (LDT_empty(info)) {
  1763. desc->a = 0;
  1764. desc->b = 0;
  1765. } else {
  1766. desc->a = LDT_entry_a(info);
  1767. desc->b = LDT_entry_b(info);
  1768. }
  1769. ++info;
  1770. ++desc;
  1771. }
  1772. if (t == &current->thread)
  1773. load_TLS(t, cpu);
  1774. put_cpu();
  1775. }
  1776. /*
  1777. * Set a given TLS descriptor:
  1778. */
  1779. asmlinkage int
  1780. sys32_set_thread_area (struct ia32_user_desc __user *u_info)
  1781. {
  1782. struct ia32_user_desc info;
  1783. int idx;
  1784. if (copy_from_user(&info, u_info, sizeof(info)))
  1785. return -EFAULT;
  1786. idx = info.entry_number;
  1787. /*
  1788. * index -1 means the kernel should try to find and allocate an empty descriptor:
  1789. */
  1790. if (idx == -1) {
  1791. idx = get_free_idx();
  1792. if (idx < 0)
  1793. return idx;
  1794. if (put_user(idx, &u_info->entry_number))
  1795. return -EFAULT;
  1796. }
  1797. if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
  1798. return -EINVAL;
  1799. set_tls_desc(current, idx, &info, 1);
  1800. return 0;
  1801. }
  1802. /*
  1803. * Get the current Thread-Local Storage area:
  1804. */
  1805. #define GET_BASE(desc) ( \
  1806. (((desc)->a >> 16) & 0x0000ffff) | \
  1807. (((desc)->b << 16) & 0x00ff0000) | \
  1808. ( (desc)->b & 0xff000000) )
  1809. #define GET_LIMIT(desc) ( \
  1810. ((desc)->a & 0x0ffff) | \
  1811. ((desc)->b & 0xf0000) )
  1812. #define GET_32BIT(desc) (((desc)->b >> 22) & 1)
  1813. #define GET_CONTENTS(desc) (((desc)->b >> 10) & 3)
  1814. #define GET_WRITABLE(desc) (((desc)->b >> 9) & 1)
  1815. #define GET_LIMIT_PAGES(desc) (((desc)->b >> 23) & 1)
  1816. #define GET_PRESENT(desc) (((desc)->b >> 15) & 1)
  1817. #define GET_USEABLE(desc) (((desc)->b >> 20) & 1)
  1818. static void fill_user_desc(struct ia32_user_desc *info, int idx,
  1819. const struct desc_struct *desc)
  1820. {
  1821. info->entry_number = idx;
  1822. info->base_addr = GET_BASE(desc);
  1823. info->limit = GET_LIMIT(desc);
  1824. info->seg_32bit = GET_32BIT(desc);
  1825. info->contents = GET_CONTENTS(desc);
  1826. info->read_exec_only = !GET_WRITABLE(desc);
  1827. info->limit_in_pages = GET_LIMIT_PAGES(desc);
  1828. info->seg_not_present = !GET_PRESENT(desc);
  1829. info->useable = GET_USEABLE(desc);
  1830. }
  1831. asmlinkage int
  1832. sys32_get_thread_area (struct ia32_user_desc __user *u_info)
  1833. {
  1834. struct ia32_user_desc info;
  1835. struct desc_struct *desc;
  1836. int idx;
  1837. if (get_user(idx, &u_info->entry_number))
  1838. return -EFAULT;
  1839. if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
  1840. return -EINVAL;
  1841. desc = current->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
  1842. fill_user_desc(&info, idx, desc);
  1843. if (copy_to_user(u_info, &info, sizeof(info)))
  1844. return -EFAULT;
  1845. return 0;
  1846. }
  1847. struct regset_get {
  1848. void *kbuf;
  1849. void __user *ubuf;
  1850. };
  1851. struct regset_set {
  1852. const void *kbuf;
  1853. const void __user *ubuf;
  1854. };
  1855. struct regset_getset {
  1856. struct task_struct *target;
  1857. const struct user_regset *regset;
  1858. union {
  1859. struct regset_get get;
  1860. struct regset_set set;
  1861. } u;
  1862. unsigned int pos;
  1863. unsigned int count;
  1864. int ret;
  1865. };
  1866. static void getfpreg(struct task_struct *task, int regno, int *val)
  1867. {
  1868. switch (regno / sizeof(int)) {
  1869. case 0:
  1870. *val = task->thread.fcr & 0xffff;
  1871. break;
  1872. case 1:
  1873. *val = task->thread.fsr & 0xffff;
  1874. break;
  1875. case 2:
  1876. *val = (task->thread.fsr>>16) & 0xffff;
  1877. break;
  1878. case 3:
  1879. *val = task->thread.fir;
  1880. break;
  1881. case 4:
  1882. *val = (task->thread.fir>>32) & 0xffff;
  1883. break;
  1884. case 5:
  1885. *val = task->thread.fdr;
  1886. break;
  1887. case 6:
  1888. *val = (task->thread.fdr >> 32) & 0xffff;
  1889. break;
  1890. }
  1891. }
  1892. static void setfpreg(struct task_struct *task, int regno, int val)
  1893. {
  1894. switch (regno / sizeof(int)) {
  1895. case 0:
  1896. task->thread.fcr = (task->thread.fcr & (~0x1f3f))
  1897. | (val & 0x1f3f);
  1898. break;
  1899. case 1:
  1900. task->thread.fsr = (task->thread.fsr & (~0xffff)) | val;
  1901. break;
  1902. case 2:
  1903. task->thread.fsr = (task->thread.fsr & (~0xffff0000))
  1904. | (val << 16);
  1905. break;
  1906. case 3:
  1907. task->thread.fir = (task->thread.fir & (~0xffffffff)) | val;
  1908. break;
  1909. case 5:
  1910. task->thread.fdr = (task->thread.fdr & (~0xffffffff)) | val;
  1911. break;
  1912. }
  1913. }
  1914. static void access_fpreg_ia32(int regno, void *reg,
  1915. struct pt_regs *pt, struct switch_stack *sw,
  1916. int tos, int write)
  1917. {
  1918. void *f;
  1919. if ((regno += tos) >= 8)
  1920. regno -= 8;
  1921. if (regno < 4)
  1922. f = &pt->f8 + regno;
  1923. else if (regno <= 7)
  1924. f = &sw->f12 + (regno - 4);
  1925. else {
  1926. printk(KERN_ERR "regno must be less than 7 \n");
  1927. return;
  1928. }
  1929. if (write)
  1930. memcpy(f, reg, sizeof(struct _fpreg_ia32));
  1931. else
  1932. memcpy(reg, f, sizeof(struct _fpreg_ia32));
  1933. }
  1934. static void do_fpregs_get(struct unw_frame_info *info, void *arg)
  1935. {
  1936. struct regset_getset *dst = arg;
  1937. struct task_struct *task = dst->target;
  1938. struct pt_regs *pt;
  1939. int start, end, tos;
  1940. char buf[80];
  1941. if (dst->count == 0 || unw_unwind_to_user(info) < 0)
  1942. return;
  1943. if (dst->pos < 7 * sizeof(int)) {
  1944. end = min((dst->pos + dst->count),
  1945. (unsigned int)(7 * sizeof(int)));
  1946. for (start = dst->pos; start < end; start += sizeof(int))
  1947. getfpreg(task, start, (int *)(buf + start));
  1948. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  1949. &dst->u.get.kbuf, &dst->u.get.ubuf, buf,
  1950. 0, 7 * sizeof(int));
  1951. if (dst->ret || dst->count == 0)
  1952. return;
  1953. }
  1954. if (dst->pos < sizeof(struct ia32_user_i387_struct)) {
  1955. pt = task_pt_regs(task);
  1956. tos = (task->thread.fsr >> 11) & 7;
  1957. end = min(dst->pos + dst->count,
  1958. (unsigned int)(sizeof(struct ia32_user_i387_struct)));
  1959. start = (dst->pos - 7 * sizeof(int)) /
  1960. sizeof(struct _fpreg_ia32);
  1961. end = (end - 7 * sizeof(int)) / sizeof(struct _fpreg_ia32);
  1962. for (; start < end; start++)
  1963. access_fpreg_ia32(start,
  1964. (struct _fpreg_ia32 *)buf + start,
  1965. pt, info->sw, tos, 0);
  1966. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  1967. &dst->u.get.kbuf, &dst->u.get.ubuf,
  1968. buf, 7 * sizeof(int),
  1969. sizeof(struct ia32_user_i387_struct));
  1970. if (dst->ret || dst->count == 0)
  1971. return;
  1972. }
  1973. }
  1974. static void do_fpregs_set(struct unw_frame_info *info, void *arg)
  1975. {
  1976. struct regset_getset *dst = arg;
  1977. struct task_struct *task = dst->target;
  1978. struct pt_regs *pt;
  1979. char buf[80];
  1980. int end, start, tos;
  1981. if (dst->count == 0 || unw_unwind_to_user(info) < 0)
  1982. return;
  1983. if (dst->pos < 7 * sizeof(int)) {
  1984. start = dst->pos;
  1985. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  1986. &dst->u.set.kbuf, &dst->u.set.ubuf, buf,
  1987. 0, 7 * sizeof(int));
  1988. if (dst->ret)
  1989. return;
  1990. for (; start < dst->pos; start += sizeof(int))
  1991. setfpreg(task, start, *((int *)(buf + start)));
  1992. if (dst->count == 0)
  1993. return;
  1994. }
  1995. if (dst->pos < sizeof(struct ia32_user_i387_struct)) {
  1996. start = (dst->pos - 7 * sizeof(int)) /
  1997. sizeof(struct _fpreg_ia32);
  1998. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  1999. &dst->u.set.kbuf, &dst->u.set.ubuf,
  2000. buf, 7 * sizeof(int),
  2001. sizeof(struct ia32_user_i387_struct));
  2002. if (dst->ret)
  2003. return;
  2004. pt = task_pt_regs(task);
  2005. tos = (task->thread.fsr >> 11) & 7;
  2006. end = (dst->pos - 7 * sizeof(int)) / sizeof(struct _fpreg_ia32);
  2007. for (; start < end; start++)
  2008. access_fpreg_ia32(start,
  2009. (struct _fpreg_ia32 *)buf + start,
  2010. pt, info->sw, tos, 1);
  2011. if (dst->count == 0)
  2012. return;
  2013. }
  2014. }
  2015. #define OFFSET(member) ((int)(offsetof(struct ia32_user_fxsr_struct, member)))
  2016. static void getfpxreg(struct task_struct *task, int start, int end, char *buf)
  2017. {
  2018. int min_val;
  2019. min_val = min(end, OFFSET(fop));
  2020. while (start < min_val) {
  2021. if (start == OFFSET(cwd))
  2022. *((short *)buf) = task->thread.fcr & 0xffff;
  2023. else if (start == OFFSET(swd))
  2024. *((short *)buf) = task->thread.fsr & 0xffff;
  2025. else if (start == OFFSET(twd))
  2026. *((short *)buf) = (task->thread.fsr>>16) & 0xffff;
  2027. buf += 2;
  2028. start += 2;
  2029. }
  2030. /* skip fop element */
  2031. if (start == OFFSET(fop)) {
  2032. start += 2;
  2033. buf += 2;
  2034. }
  2035. while (start < end) {
  2036. if (start == OFFSET(fip))
  2037. *((int *)buf) = task->thread.fir;
  2038. else if (start == OFFSET(fcs))
  2039. *((int *)buf) = (task->thread.fir>>32) & 0xffff;
  2040. else if (start == OFFSET(foo))
  2041. *((int *)buf) = task->thread.fdr;
  2042. else if (start == OFFSET(fos))
  2043. *((int *)buf) = (task->thread.fdr>>32) & 0xffff;
  2044. else if (start == OFFSET(mxcsr))
  2045. *((int *)buf) = ((task->thread.fcr>>32) & 0xff80)
  2046. | ((task->thread.fsr>>32) & 0x3f);
  2047. buf += 4;
  2048. start += 4;
  2049. }
  2050. }
  2051. static void setfpxreg(struct task_struct *task, int start, int end, char *buf)
  2052. {
  2053. int min_val, num32;
  2054. short num;
  2055. unsigned long num64;
  2056. min_val = min(end, OFFSET(fop));
  2057. while (start < min_val) {
  2058. num = *((short *)buf);
  2059. if (start == OFFSET(cwd)) {
  2060. task->thread.fcr = (task->thread.fcr & (~0x1f3f))
  2061. | (num & 0x1f3f);
  2062. } else if (start == OFFSET(swd)) {
  2063. task->thread.fsr = (task->thread.fsr & (~0xffff)) | num;
  2064. } else if (start == OFFSET(twd)) {
  2065. task->thread.fsr = (task->thread.fsr & (~0xffff0000))
  2066. | (((int)num) << 16);
  2067. }
  2068. buf += 2;
  2069. start += 2;
  2070. }
  2071. /* skip fop element */
  2072. if (start == OFFSET(fop)) {
  2073. start += 2;
  2074. buf += 2;
  2075. }
  2076. while (start < end) {
  2077. num32 = *((int *)buf);
  2078. if (start == OFFSET(fip))
  2079. task->thread.fir = (task->thread.fir & (~0xffffffff))
  2080. | num32;
  2081. else if (start == OFFSET(foo))
  2082. task->thread.fdr = (task->thread.fdr & (~0xffffffff))
  2083. | num32;
  2084. else if (start == OFFSET(mxcsr)) {
  2085. num64 = num32 & 0xff10;
  2086. task->thread.fcr = (task->thread.fcr &
  2087. (~0xff1000000000UL)) | (num64<<32);
  2088. num64 = num32 & 0x3f;
  2089. task->thread.fsr = (task->thread.fsr &
  2090. (~0x3f00000000UL)) | (num64<<32);
  2091. }
  2092. buf += 4;
  2093. start += 4;
  2094. }
  2095. }
  2096. static void do_fpxregs_get(struct unw_frame_info *info, void *arg)
  2097. {
  2098. struct regset_getset *dst = arg;
  2099. struct task_struct *task = dst->target;
  2100. struct pt_regs *pt;
  2101. char buf[128];
  2102. int start, end, tos;
  2103. if (dst->count == 0 || unw_unwind_to_user(info) < 0)
  2104. return;
  2105. if (dst->pos < OFFSET(st_space[0])) {
  2106. end = min(dst->pos + dst->count, (unsigned int)32);
  2107. getfpxreg(task, dst->pos, end, buf);
  2108. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  2109. &dst->u.get.kbuf, &dst->u.get.ubuf, buf,
  2110. 0, OFFSET(st_space[0]));
  2111. if (dst->ret || dst->count == 0)
  2112. return;
  2113. }
  2114. if (dst->pos < OFFSET(xmm_space[0])) {
  2115. pt = task_pt_regs(task);
  2116. tos = (task->thread.fsr >> 11) & 7;
  2117. end = min(dst->pos + dst->count,
  2118. (unsigned int)OFFSET(xmm_space[0]));
  2119. start = (dst->pos - OFFSET(st_space[0])) / 16;
  2120. end = (end - OFFSET(st_space[0])) / 16;
  2121. for (; start < end; start++)
  2122. access_fpreg_ia32(start, buf + 16 * start, pt,
  2123. info->sw, tos, 0);
  2124. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  2125. &dst->u.get.kbuf, &dst->u.get.ubuf,
  2126. buf, OFFSET(st_space[0]), OFFSET(xmm_space[0]));
  2127. if (dst->ret || dst->count == 0)
  2128. return;
  2129. }
  2130. if (dst->pos < OFFSET(padding[0]))
  2131. dst->ret = user_regset_copyout(&dst->pos, &dst->count,
  2132. &dst->u.get.kbuf, &dst->u.get.ubuf,
  2133. &info->sw->f16, OFFSET(xmm_space[0]),
  2134. OFFSET(padding[0]));
  2135. }
  2136. static void do_fpxregs_set(struct unw_frame_info *info, void *arg)
  2137. {
  2138. struct regset_getset *dst = arg;
  2139. struct task_struct *task = dst->target;
  2140. char buf[128];
  2141. int start, end;
  2142. if (dst->count == 0 || unw_unwind_to_user(info) < 0)
  2143. return;
  2144. if (dst->pos < OFFSET(st_space[0])) {
  2145. start = dst->pos;
  2146. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  2147. &dst->u.set.kbuf, &dst->u.set.ubuf,
  2148. buf, 0, OFFSET(st_space[0]));
  2149. if (dst->ret)
  2150. return;
  2151. setfpxreg(task, start, dst->pos, buf);
  2152. if (dst->count == 0)
  2153. return;
  2154. }
  2155. if (dst->pos < OFFSET(xmm_space[0])) {
  2156. struct pt_regs *pt;
  2157. int tos;
  2158. pt = task_pt_regs(task);
  2159. tos = (task->thread.fsr >> 11) & 7;
  2160. start = (dst->pos - OFFSET(st_space[0])) / 16;
  2161. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  2162. &dst->u.set.kbuf, &dst->u.set.ubuf,
  2163. buf, OFFSET(st_space[0]), OFFSET(xmm_space[0]));
  2164. if (dst->ret)
  2165. return;
  2166. end = (dst->pos - OFFSET(st_space[0])) / 16;
  2167. for (; start < end; start++)
  2168. access_fpreg_ia32(start, buf + 16 * start, pt, info->sw,
  2169. tos, 1);
  2170. if (dst->count == 0)
  2171. return;
  2172. }
  2173. if (dst->pos < OFFSET(padding[0]))
  2174. dst->ret = user_regset_copyin(&dst->pos, &dst->count,
  2175. &dst->u.set.kbuf, &dst->u.set.ubuf,
  2176. &info->sw->f16, OFFSET(xmm_space[0]),
  2177. OFFSET(padding[0]));
  2178. }
  2179. #undef OFFSET
  2180. static int do_regset_call(void (*call)(struct unw_frame_info *, void *),
  2181. struct task_struct *target,
  2182. const struct user_regset *regset,
  2183. unsigned int pos, unsigned int count,
  2184. const void *kbuf, const void __user *ubuf)
  2185. {
  2186. struct regset_getset info = { .target = target, .regset = regset,
  2187. .pos = pos, .count = count,
  2188. .u.set = { .kbuf = kbuf, .ubuf = ubuf },
  2189. .ret = 0 };
  2190. if (target == current)
  2191. unw_init_running(call, &info);
  2192. else {
  2193. struct unw_frame_info ufi;
  2194. memset(&ufi, 0, sizeof(ufi));
  2195. unw_init_from_blocked_task(&ufi, target);
  2196. (*call)(&ufi, &info);
  2197. }
  2198. return info.ret;
  2199. }
  2200. static int ia32_fpregs_get(struct task_struct *target,
  2201. const struct user_regset *regset,
  2202. unsigned int pos, unsigned int count,
  2203. void *kbuf, void __user *ubuf)
  2204. {
  2205. return do_regset_call(do_fpregs_get, target, regset, pos, count,
  2206. kbuf, ubuf);
  2207. }
  2208. static int ia32_fpregs_set(struct task_struct *target,
  2209. const struct user_regset *regset,
  2210. unsigned int pos, unsigned int count,
  2211. const void *kbuf, const void __user *ubuf)
  2212. {
  2213. return do_regset_call(do_fpregs_set, target, regset, pos, count,
  2214. kbuf, ubuf);
  2215. }
  2216. static int ia32_fpxregs_get(struct task_struct *target,
  2217. const struct user_regset *regset,
  2218. unsigned int pos, unsigned int count,
  2219. void *kbuf, void __user *ubuf)
  2220. {
  2221. return do_regset_call(do_fpxregs_get, target, regset, pos, count,
  2222. kbuf, ubuf);
  2223. }
  2224. static int ia32_fpxregs_set(struct task_struct *target,
  2225. const struct user_regset *regset,
  2226. unsigned int pos, unsigned int count,
  2227. const void *kbuf, const void __user *ubuf)
  2228. {
  2229. return do_regset_call(do_fpxregs_set, target, regset, pos, count,
  2230. kbuf, ubuf);
  2231. }
  2232. static int ia32_genregs_get(struct task_struct *target,
  2233. const struct user_regset *regset,
  2234. unsigned int pos, unsigned int count,
  2235. void *kbuf, void __user *ubuf)
  2236. {
  2237. if (kbuf) {
  2238. u32 *kp = kbuf;
  2239. while (count > 0) {
  2240. *kp++ = getreg(target, pos);
  2241. pos += 4;
  2242. count -= 4;
  2243. }
  2244. } else {
  2245. u32 __user *up = ubuf;
  2246. while (count > 0) {
  2247. if (__put_user(getreg(target, pos), up++))
  2248. return -EFAULT;
  2249. pos += 4;
  2250. count -= 4;
  2251. }
  2252. }
  2253. return 0;
  2254. }
  2255. static int ia32_genregs_set(struct task_struct *target,
  2256. const struct user_regset *regset,
  2257. unsigned int pos, unsigned int count,
  2258. const void *kbuf, const void __user *ubuf)
  2259. {
  2260. int ret = 0;
  2261. if (kbuf) {
  2262. const u32 *kp = kbuf;
  2263. while (!ret && count > 0) {
  2264. putreg(target, pos, *kp++);
  2265. pos += 4;
  2266. count -= 4;
  2267. }
  2268. } else {
  2269. const u32 __user *up = ubuf;
  2270. u32 val;
  2271. while (!ret && count > 0) {
  2272. ret = __get_user(val, up++);
  2273. if (!ret)
  2274. putreg(target, pos, val);
  2275. pos += 4;
  2276. count -= 4;
  2277. }
  2278. }
  2279. return ret;
  2280. }
  2281. static int ia32_tls_active(struct task_struct *target,
  2282. const struct user_regset *regset)
  2283. {
  2284. struct thread_struct *t = &target->thread;
  2285. int n = GDT_ENTRY_TLS_ENTRIES;
  2286. while (n > 0 && desc_empty(&t->tls_array[n -1]))
  2287. --n;
  2288. return n;
  2289. }
  2290. static int ia32_tls_get(struct task_struct *target,
  2291. const struct user_regset *regset, unsigned int pos,
  2292. unsigned int count, void *kbuf, void __user *ubuf)
  2293. {
  2294. const struct desc_struct *tls;
  2295. if (pos > GDT_ENTRY_TLS_ENTRIES * sizeof(struct ia32_user_desc) ||
  2296. (pos % sizeof(struct ia32_user_desc)) != 0 ||
  2297. (count % sizeof(struct ia32_user_desc)) != 0)
  2298. return -EINVAL;
  2299. pos /= sizeof(struct ia32_user_desc);
  2300. count /= sizeof(struct ia32_user_desc);
  2301. tls = &target->thread.tls_array[pos];
  2302. if (kbuf) {
  2303. struct ia32_user_desc *info = kbuf;
  2304. while (count-- > 0)
  2305. fill_user_desc(info++, GDT_ENTRY_TLS_MIN + pos++,
  2306. tls++);
  2307. } else {
  2308. struct ia32_user_desc __user *u_info = ubuf;
  2309. while (count-- > 0) {
  2310. struct ia32_user_desc info;
  2311. fill_user_desc(&info, GDT_ENTRY_TLS_MIN + pos++, tls++);
  2312. if (__copy_to_user(u_info++, &info, sizeof(info)))
  2313. return -EFAULT;
  2314. }
  2315. }
  2316. return 0;
  2317. }
  2318. static int ia32_tls_set(struct task_struct *target,
  2319. const struct user_regset *regset, unsigned int pos,
  2320. unsigned int count, const void *kbuf, const void __user *ubuf)
  2321. {
  2322. struct ia32_user_desc infobuf[GDT_ENTRY_TLS_ENTRIES];
  2323. const struct ia32_user_desc *info;
  2324. if (pos > GDT_ENTRY_TLS_ENTRIES * sizeof(struct ia32_user_desc) ||
  2325. (pos % sizeof(struct ia32_user_desc)) != 0 ||
  2326. (count % sizeof(struct ia32_user_desc)) != 0)
  2327. return -EINVAL;
  2328. if (kbuf)
  2329. info = kbuf;
  2330. else if (__copy_from_user(infobuf, ubuf, count))
  2331. return -EFAULT;
  2332. else
  2333. info = infobuf;
  2334. set_tls_desc(target,
  2335. GDT_ENTRY_TLS_MIN + (pos / sizeof(struct ia32_user_desc)),
  2336. info, count / sizeof(struct ia32_user_desc));
  2337. return 0;
  2338. }
  2339. /*
  2340. * This should match arch/i386/kernel/ptrace.c:native_regsets.
  2341. * XXX ioperm? vm86?
  2342. */
  2343. static const struct user_regset ia32_regsets[] = {
  2344. {
  2345. .core_note_type = NT_PRSTATUS,
  2346. .n = sizeof(struct user_regs_struct32)/4,
  2347. .size = 4, .align = 4,
  2348. .get = ia32_genregs_get, .set = ia32_genregs_set
  2349. },
  2350. {
  2351. .core_note_type = NT_PRFPREG,
  2352. .n = sizeof(struct ia32_user_i387_struct) / 4,
  2353. .size = 4, .align = 4,
  2354. .get = ia32_fpregs_get, .set = ia32_fpregs_set
  2355. },
  2356. {
  2357. .core_note_type = NT_PRXFPREG,
  2358. .n = sizeof(struct ia32_user_fxsr_struct) / 4,
  2359. .size = 4, .align = 4,
  2360. .get = ia32_fpxregs_get, .set = ia32_fpxregs_set
  2361. },
  2362. {
  2363. .core_note_type = NT_386_TLS,
  2364. .n = GDT_ENTRY_TLS_ENTRIES,
  2365. .bias = GDT_ENTRY_TLS_MIN,
  2366. .size = sizeof(struct ia32_user_desc),
  2367. .align = sizeof(struct ia32_user_desc),
  2368. .active = ia32_tls_active,
  2369. .get = ia32_tls_get, .set = ia32_tls_set,
  2370. },
  2371. };
  2372. const struct user_regset_view user_ia32_view = {
  2373. .name = "i386", .e_machine = EM_386,
  2374. .regsets = ia32_regsets, .n = ARRAY_SIZE(ia32_regsets)
  2375. };
  2376. long sys32_fadvise64_64(int fd, __u32 offset_low, __u32 offset_high,
  2377. __u32 len_low, __u32 len_high, int advice)
  2378. {
  2379. return sys_fadvise64_64(fd,
  2380. (((u64)offset_high)<<32) | offset_low,
  2381. (((u64)len_high)<<32) | len_low,
  2382. advice);
  2383. }
  2384. #ifdef NOTYET /* UNTESTED FOR IA64 FROM HERE DOWN */
  2385. asmlinkage long sys32_setreuid(compat_uid_t ruid, compat_uid_t euid)
  2386. {
  2387. uid_t sruid, seuid;
  2388. sruid = (ruid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)ruid);
  2389. seuid = (euid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)euid);
  2390. return sys_setreuid(sruid, seuid);
  2391. }
  2392. asmlinkage long
  2393. sys32_setresuid(compat_uid_t ruid, compat_uid_t euid,
  2394. compat_uid_t suid)
  2395. {
  2396. uid_t sruid, seuid, ssuid;
  2397. sruid = (ruid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)ruid);
  2398. seuid = (euid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)euid);
  2399. ssuid = (suid == (compat_uid_t)-1) ? ((uid_t)-1) : ((uid_t)suid);
  2400. return sys_setresuid(sruid, seuid, ssuid);
  2401. }
  2402. asmlinkage long
  2403. sys32_setregid(compat_gid_t rgid, compat_gid_t egid)
  2404. {
  2405. gid_t srgid, segid;
  2406. srgid = (rgid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)rgid);
  2407. segid = (egid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)egid);
  2408. return sys_setregid(srgid, segid);
  2409. }
  2410. asmlinkage long
  2411. sys32_setresgid(compat_gid_t rgid, compat_gid_t egid,
  2412. compat_gid_t sgid)
  2413. {
  2414. gid_t srgid, segid, ssgid;
  2415. srgid = (rgid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)rgid);
  2416. segid = (egid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)egid);
  2417. ssgid = (sgid == (compat_gid_t)-1) ? ((gid_t)-1) : ((gid_t)sgid);
  2418. return sys_setresgid(srgid, segid, ssgid);
  2419. }
  2420. #endif /* NOTYET */