sys_ia32.c 73 KB

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