process_64.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809
  1. /* arch/sparc64/kernel/process.c
  2. *
  3. * Copyright (C) 1995, 1996, 2008 David S. Miller (davem@davemloft.net)
  4. * Copyright (C) 1996 Eddie C. Dost (ecd@skynet.be)
  5. * Copyright (C) 1997, 1998 Jakub Jelinek (jj@sunsite.mff.cuni.cz)
  6. */
  7. /*
  8. * This file handles the architecture-dependent parts of process handling..
  9. */
  10. #include <stdarg.h>
  11. #include <linux/errno.h>
  12. #include <linux/module.h>
  13. #include <linux/sched.h>
  14. #include <linux/kernel.h>
  15. #include <linux/mm.h>
  16. #include <linux/fs.h>
  17. #include <linux/smp.h>
  18. #include <linux/stddef.h>
  19. #include <linux/ptrace.h>
  20. #include <linux/slab.h>
  21. #include <linux/user.h>
  22. #include <linux/delay.h>
  23. #include <linux/compat.h>
  24. #include <linux/tick.h>
  25. #include <linux/init.h>
  26. #include <linux/cpu.h>
  27. #include <linux/elfcore.h>
  28. #include <linux/sysrq.h>
  29. #include <linux/nmi.h>
  30. #include <asm/uaccess.h>
  31. #include <asm/system.h>
  32. #include <asm/page.h>
  33. #include <asm/pgalloc.h>
  34. #include <asm/pgtable.h>
  35. #include <asm/processor.h>
  36. #include <asm/pstate.h>
  37. #include <asm/elf.h>
  38. #include <asm/fpumacro.h>
  39. #include <asm/head.h>
  40. #include <asm/cpudata.h>
  41. #include <asm/mmu_context.h>
  42. #include <asm/unistd.h>
  43. #include <asm/hypervisor.h>
  44. #include <asm/syscalls.h>
  45. #include <asm/irq_regs.h>
  46. #include <asm/smp.h>
  47. #include "kstack.h"
  48. static void sparc64_yield(int cpu)
  49. {
  50. if (tlb_type != hypervisor) {
  51. touch_nmi_watchdog();
  52. return;
  53. }
  54. clear_thread_flag(TIF_POLLING_NRFLAG);
  55. smp_mb__after_clear_bit();
  56. while (!need_resched() && !cpu_is_offline(cpu)) {
  57. unsigned long pstate;
  58. /* Disable interrupts. */
  59. __asm__ __volatile__(
  60. "rdpr %%pstate, %0\n\t"
  61. "andn %0, %1, %0\n\t"
  62. "wrpr %0, %%g0, %%pstate"
  63. : "=&r" (pstate)
  64. : "i" (PSTATE_IE));
  65. if (!need_resched() && !cpu_is_offline(cpu))
  66. sun4v_cpu_yield();
  67. /* Re-enable interrupts. */
  68. __asm__ __volatile__(
  69. "rdpr %%pstate, %0\n\t"
  70. "or %0, %1, %0\n\t"
  71. "wrpr %0, %%g0, %%pstate"
  72. : "=&r" (pstate)
  73. : "i" (PSTATE_IE));
  74. }
  75. set_thread_flag(TIF_POLLING_NRFLAG);
  76. }
  77. /* The idle loop on sparc64. */
  78. void cpu_idle(void)
  79. {
  80. int cpu = smp_processor_id();
  81. set_thread_flag(TIF_POLLING_NRFLAG);
  82. while(1) {
  83. tick_nohz_stop_sched_tick(1);
  84. while (!need_resched() && !cpu_is_offline(cpu))
  85. sparc64_yield(cpu);
  86. tick_nohz_restart_sched_tick();
  87. preempt_enable_no_resched();
  88. #ifdef CONFIG_HOTPLUG_CPU
  89. if (cpu_is_offline(cpu))
  90. cpu_play_dead();
  91. #endif
  92. schedule();
  93. preempt_disable();
  94. }
  95. }
  96. #ifdef CONFIG_COMPAT
  97. static void show_regwindow32(struct pt_regs *regs)
  98. {
  99. struct reg_window32 __user *rw;
  100. struct reg_window32 r_w;
  101. mm_segment_t old_fs;
  102. __asm__ __volatile__ ("flushw");
  103. rw = compat_ptr((unsigned)regs->u_regs[14]);
  104. old_fs = get_fs();
  105. set_fs (USER_DS);
  106. if (copy_from_user (&r_w, rw, sizeof(r_w))) {
  107. set_fs (old_fs);
  108. return;
  109. }
  110. set_fs (old_fs);
  111. printk("l0: %08x l1: %08x l2: %08x l3: %08x "
  112. "l4: %08x l5: %08x l6: %08x l7: %08x\n",
  113. r_w.locals[0], r_w.locals[1], r_w.locals[2], r_w.locals[3],
  114. r_w.locals[4], r_w.locals[5], r_w.locals[6], r_w.locals[7]);
  115. printk("i0: %08x i1: %08x i2: %08x i3: %08x "
  116. "i4: %08x i5: %08x i6: %08x i7: %08x\n",
  117. r_w.ins[0], r_w.ins[1], r_w.ins[2], r_w.ins[3],
  118. r_w.ins[4], r_w.ins[5], r_w.ins[6], r_w.ins[7]);
  119. }
  120. #else
  121. #define show_regwindow32(regs) do { } while (0)
  122. #endif
  123. static void show_regwindow(struct pt_regs *regs)
  124. {
  125. struct reg_window __user *rw;
  126. struct reg_window *rwk;
  127. struct reg_window r_w;
  128. mm_segment_t old_fs;
  129. if ((regs->tstate & TSTATE_PRIV) || !(test_thread_flag(TIF_32BIT))) {
  130. __asm__ __volatile__ ("flushw");
  131. rw = (struct reg_window __user *)
  132. (regs->u_regs[14] + STACK_BIAS);
  133. rwk = (struct reg_window *)
  134. (regs->u_regs[14] + STACK_BIAS);
  135. if (!(regs->tstate & TSTATE_PRIV)) {
  136. old_fs = get_fs();
  137. set_fs (USER_DS);
  138. if (copy_from_user (&r_w, rw, sizeof(r_w))) {
  139. set_fs (old_fs);
  140. return;
  141. }
  142. rwk = &r_w;
  143. set_fs (old_fs);
  144. }
  145. } else {
  146. show_regwindow32(regs);
  147. return;
  148. }
  149. printk("l0: %016lx l1: %016lx l2: %016lx l3: %016lx\n",
  150. rwk->locals[0], rwk->locals[1], rwk->locals[2], rwk->locals[3]);
  151. printk("l4: %016lx l5: %016lx l6: %016lx l7: %016lx\n",
  152. rwk->locals[4], rwk->locals[5], rwk->locals[6], rwk->locals[7]);
  153. printk("i0: %016lx i1: %016lx i2: %016lx i3: %016lx\n",
  154. rwk->ins[0], rwk->ins[1], rwk->ins[2], rwk->ins[3]);
  155. printk("i4: %016lx i5: %016lx i6: %016lx i7: %016lx\n",
  156. rwk->ins[4], rwk->ins[5], rwk->ins[6], rwk->ins[7]);
  157. if (regs->tstate & TSTATE_PRIV)
  158. printk("I7: <%pS>\n", (void *) rwk->ins[7]);
  159. }
  160. void show_regs(struct pt_regs *regs)
  161. {
  162. printk("TSTATE: %016lx TPC: %016lx TNPC: %016lx Y: %08x %s\n", regs->tstate,
  163. regs->tpc, regs->tnpc, regs->y, print_tainted());
  164. printk("TPC: <%pS>\n", (void *) regs->tpc);
  165. printk("g0: %016lx g1: %016lx g2: %016lx g3: %016lx\n",
  166. regs->u_regs[0], regs->u_regs[1], regs->u_regs[2],
  167. regs->u_regs[3]);
  168. printk("g4: %016lx g5: %016lx g6: %016lx g7: %016lx\n",
  169. regs->u_regs[4], regs->u_regs[5], regs->u_regs[6],
  170. regs->u_regs[7]);
  171. printk("o0: %016lx o1: %016lx o2: %016lx o3: %016lx\n",
  172. regs->u_regs[8], regs->u_regs[9], regs->u_regs[10],
  173. regs->u_regs[11]);
  174. printk("o4: %016lx o5: %016lx sp: %016lx ret_pc: %016lx\n",
  175. regs->u_regs[12], regs->u_regs[13], regs->u_regs[14],
  176. regs->u_regs[15]);
  177. printk("RPC: <%pS>\n", (void *) regs->u_regs[15]);
  178. show_regwindow(regs);
  179. }
  180. struct global_reg_snapshot global_reg_snapshot[NR_CPUS];
  181. static DEFINE_SPINLOCK(global_reg_snapshot_lock);
  182. static void __global_reg_self(struct thread_info *tp, struct pt_regs *regs,
  183. int this_cpu)
  184. {
  185. flushw_all();
  186. global_reg_snapshot[this_cpu].tstate = regs->tstate;
  187. global_reg_snapshot[this_cpu].tpc = regs->tpc;
  188. global_reg_snapshot[this_cpu].tnpc = regs->tnpc;
  189. global_reg_snapshot[this_cpu].o7 = regs->u_regs[UREG_I7];
  190. if (regs->tstate & TSTATE_PRIV) {
  191. struct reg_window *rw;
  192. rw = (struct reg_window *)
  193. (regs->u_regs[UREG_FP] + STACK_BIAS);
  194. if (kstack_valid(tp, (unsigned long) rw)) {
  195. global_reg_snapshot[this_cpu].i7 = rw->ins[7];
  196. rw = (struct reg_window *)
  197. (rw->ins[6] + STACK_BIAS);
  198. if (kstack_valid(tp, (unsigned long) rw))
  199. global_reg_snapshot[this_cpu].rpc = rw->ins[7];
  200. }
  201. } else {
  202. global_reg_snapshot[this_cpu].i7 = 0;
  203. global_reg_snapshot[this_cpu].rpc = 0;
  204. }
  205. global_reg_snapshot[this_cpu].thread = tp;
  206. }
  207. /* In order to avoid hangs we do not try to synchronize with the
  208. * global register dump client cpus. The last store they make is to
  209. * the thread pointer, so do a short poll waiting for that to become
  210. * non-NULL.
  211. */
  212. static void __global_reg_poll(struct global_reg_snapshot *gp)
  213. {
  214. int limit = 0;
  215. while (!gp->thread && ++limit < 100) {
  216. barrier();
  217. udelay(1);
  218. }
  219. }
  220. void arch_trigger_all_cpu_backtrace(void)
  221. {
  222. struct thread_info *tp = current_thread_info();
  223. struct pt_regs *regs = get_irq_regs();
  224. unsigned long flags;
  225. int this_cpu, cpu;
  226. if (!regs)
  227. regs = tp->kregs;
  228. spin_lock_irqsave(&global_reg_snapshot_lock, flags);
  229. memset(global_reg_snapshot, 0, sizeof(global_reg_snapshot));
  230. this_cpu = raw_smp_processor_id();
  231. __global_reg_self(tp, regs, this_cpu);
  232. smp_fetch_global_regs();
  233. for_each_online_cpu(cpu) {
  234. struct global_reg_snapshot *gp = &global_reg_snapshot[cpu];
  235. __global_reg_poll(gp);
  236. tp = gp->thread;
  237. printk("%c CPU[%3d]: TSTATE[%016lx] TPC[%016lx] TNPC[%016lx] TASK[%s:%d]\n",
  238. (cpu == this_cpu ? '*' : ' '), cpu,
  239. gp->tstate, gp->tpc, gp->tnpc,
  240. ((tp && tp->task) ? tp->task->comm : "NULL"),
  241. ((tp && tp->task) ? tp->task->pid : -1));
  242. if (gp->tstate & TSTATE_PRIV) {
  243. printk(" TPC[%pS] O7[%pS] I7[%pS] RPC[%pS]\n",
  244. (void *) gp->tpc,
  245. (void *) gp->o7,
  246. (void *) gp->i7,
  247. (void *) gp->rpc);
  248. } else {
  249. printk(" TPC[%lx] O7[%lx] I7[%lx] RPC[%lx]\n",
  250. gp->tpc, gp->o7, gp->i7, gp->rpc);
  251. }
  252. }
  253. memset(global_reg_snapshot, 0, sizeof(global_reg_snapshot));
  254. spin_unlock_irqrestore(&global_reg_snapshot_lock, flags);
  255. }
  256. #ifdef CONFIG_MAGIC_SYSRQ
  257. static void sysrq_handle_globreg(int key, struct tty_struct *tty)
  258. {
  259. arch_trigger_all_cpu_backtrace();
  260. }
  261. static struct sysrq_key_op sparc_globalreg_op = {
  262. .handler = sysrq_handle_globreg,
  263. .help_msg = "Globalregs",
  264. .action_msg = "Show Global CPU Regs",
  265. };
  266. static int __init sparc_globreg_init(void)
  267. {
  268. return register_sysrq_key('y', &sparc_globalreg_op);
  269. }
  270. core_initcall(sparc_globreg_init);
  271. #endif
  272. unsigned long thread_saved_pc(struct task_struct *tsk)
  273. {
  274. struct thread_info *ti = task_thread_info(tsk);
  275. unsigned long ret = 0xdeadbeefUL;
  276. if (ti && ti->ksp) {
  277. unsigned long *sp;
  278. sp = (unsigned long *)(ti->ksp + STACK_BIAS);
  279. if (((unsigned long)sp & (sizeof(long) - 1)) == 0UL &&
  280. sp[14]) {
  281. unsigned long *fp;
  282. fp = (unsigned long *)(sp[14] + STACK_BIAS);
  283. if (((unsigned long)fp & (sizeof(long) - 1)) == 0UL)
  284. ret = fp[15];
  285. }
  286. }
  287. return ret;
  288. }
  289. /* Free current thread data structures etc.. */
  290. void exit_thread(void)
  291. {
  292. struct thread_info *t = current_thread_info();
  293. if (t->utraps) {
  294. if (t->utraps[0] < 2)
  295. kfree (t->utraps);
  296. else
  297. t->utraps[0]--;
  298. }
  299. if (test_and_clear_thread_flag(TIF_PERFCTR)) {
  300. t->user_cntd0 = t->user_cntd1 = NULL;
  301. t->pcr_reg = 0;
  302. write_pcr(0);
  303. }
  304. }
  305. void flush_thread(void)
  306. {
  307. struct thread_info *t = current_thread_info();
  308. struct mm_struct *mm;
  309. mm = t->task->mm;
  310. if (mm)
  311. tsb_context_switch(mm);
  312. set_thread_wsaved(0);
  313. /* Turn off performance counters if on. */
  314. if (test_and_clear_thread_flag(TIF_PERFCTR)) {
  315. t->user_cntd0 = t->user_cntd1 = NULL;
  316. t->pcr_reg = 0;
  317. write_pcr(0);
  318. }
  319. /* Clear FPU register state. */
  320. t->fpsaved[0] = 0;
  321. if (get_thread_current_ds() != ASI_AIUS)
  322. set_fs(USER_DS);
  323. }
  324. /* It's a bit more tricky when 64-bit tasks are involved... */
  325. static unsigned long clone_stackframe(unsigned long csp, unsigned long psp)
  326. {
  327. unsigned long fp, distance, rval;
  328. if (!(test_thread_flag(TIF_32BIT))) {
  329. csp += STACK_BIAS;
  330. psp += STACK_BIAS;
  331. __get_user(fp, &(((struct reg_window __user *)psp)->ins[6]));
  332. fp += STACK_BIAS;
  333. } else
  334. __get_user(fp, &(((struct reg_window32 __user *)psp)->ins[6]));
  335. /* Now align the stack as this is mandatory in the Sparc ABI
  336. * due to how register windows work. This hides the
  337. * restriction from thread libraries etc.
  338. */
  339. csp &= ~15UL;
  340. distance = fp - psp;
  341. rval = (csp - distance);
  342. if (copy_in_user((void __user *) rval, (void __user *) psp, distance))
  343. rval = 0;
  344. else if (test_thread_flag(TIF_32BIT)) {
  345. if (put_user(((u32)csp),
  346. &(((struct reg_window32 __user *)rval)->ins[6])))
  347. rval = 0;
  348. } else {
  349. if (put_user(((u64)csp - STACK_BIAS),
  350. &(((struct reg_window __user *)rval)->ins[6])))
  351. rval = 0;
  352. else
  353. rval = rval - STACK_BIAS;
  354. }
  355. return rval;
  356. }
  357. /* Standard stuff. */
  358. static inline void shift_window_buffer(int first_win, int last_win,
  359. struct thread_info *t)
  360. {
  361. int i;
  362. for (i = first_win; i < last_win; i++) {
  363. t->rwbuf_stkptrs[i] = t->rwbuf_stkptrs[i+1];
  364. memcpy(&t->reg_window[i], &t->reg_window[i+1],
  365. sizeof(struct reg_window));
  366. }
  367. }
  368. void synchronize_user_stack(void)
  369. {
  370. struct thread_info *t = current_thread_info();
  371. unsigned long window;
  372. flush_user_windows();
  373. if ((window = get_thread_wsaved()) != 0) {
  374. int winsize = sizeof(struct reg_window);
  375. int bias = 0;
  376. if (test_thread_flag(TIF_32BIT))
  377. winsize = sizeof(struct reg_window32);
  378. else
  379. bias = STACK_BIAS;
  380. window -= 1;
  381. do {
  382. unsigned long sp = (t->rwbuf_stkptrs[window] + bias);
  383. struct reg_window *rwin = &t->reg_window[window];
  384. if (!copy_to_user((char __user *)sp, rwin, winsize)) {
  385. shift_window_buffer(window, get_thread_wsaved() - 1, t);
  386. set_thread_wsaved(get_thread_wsaved() - 1);
  387. }
  388. } while (window--);
  389. }
  390. }
  391. static void stack_unaligned(unsigned long sp)
  392. {
  393. siginfo_t info;
  394. info.si_signo = SIGBUS;
  395. info.si_errno = 0;
  396. info.si_code = BUS_ADRALN;
  397. info.si_addr = (void __user *) sp;
  398. info.si_trapno = 0;
  399. force_sig_info(SIGBUS, &info, current);
  400. }
  401. void fault_in_user_windows(void)
  402. {
  403. struct thread_info *t = current_thread_info();
  404. unsigned long window;
  405. int winsize = sizeof(struct reg_window);
  406. int bias = 0;
  407. if (test_thread_flag(TIF_32BIT))
  408. winsize = sizeof(struct reg_window32);
  409. else
  410. bias = STACK_BIAS;
  411. flush_user_windows();
  412. window = get_thread_wsaved();
  413. if (likely(window != 0)) {
  414. window -= 1;
  415. do {
  416. unsigned long sp = (t->rwbuf_stkptrs[window] + bias);
  417. struct reg_window *rwin = &t->reg_window[window];
  418. if (unlikely(sp & 0x7UL))
  419. stack_unaligned(sp);
  420. if (unlikely(copy_to_user((char __user *)sp,
  421. rwin, winsize)))
  422. goto barf;
  423. } while (window--);
  424. }
  425. set_thread_wsaved(0);
  426. return;
  427. barf:
  428. set_thread_wsaved(window + 1);
  429. do_exit(SIGILL);
  430. }
  431. asmlinkage long sparc_do_fork(unsigned long clone_flags,
  432. unsigned long stack_start,
  433. struct pt_regs *regs,
  434. unsigned long stack_size)
  435. {
  436. int __user *parent_tid_ptr, *child_tid_ptr;
  437. unsigned long orig_i1 = regs->u_regs[UREG_I1];
  438. long ret;
  439. #ifdef CONFIG_COMPAT
  440. if (test_thread_flag(TIF_32BIT)) {
  441. parent_tid_ptr = compat_ptr(regs->u_regs[UREG_I2]);
  442. child_tid_ptr = compat_ptr(regs->u_regs[UREG_I4]);
  443. } else
  444. #endif
  445. {
  446. parent_tid_ptr = (int __user *) regs->u_regs[UREG_I2];
  447. child_tid_ptr = (int __user *) regs->u_regs[UREG_I4];
  448. }
  449. ret = do_fork(clone_flags, stack_start,
  450. regs, stack_size,
  451. parent_tid_ptr, child_tid_ptr);
  452. /* If we get an error and potentially restart the system
  453. * call, we're screwed because copy_thread() clobbered
  454. * the parent's %o1. So detect that case and restore it
  455. * here.
  456. */
  457. if ((unsigned long)ret >= -ERESTART_RESTARTBLOCK)
  458. regs->u_regs[UREG_I1] = orig_i1;
  459. return ret;
  460. }
  461. /* Copy a Sparc thread. The fork() return value conventions
  462. * under SunOS are nothing short of bletcherous:
  463. * Parent --> %o0 == childs pid, %o1 == 0
  464. * Child --> %o0 == parents pid, %o1 == 1
  465. */
  466. int copy_thread(unsigned long clone_flags, unsigned long sp,
  467. unsigned long unused,
  468. struct task_struct *p, struct pt_regs *regs)
  469. {
  470. struct thread_info *t = task_thread_info(p);
  471. struct sparc_stackf *parent_sf;
  472. unsigned long child_stack_sz;
  473. char *child_trap_frame;
  474. int kernel_thread;
  475. kernel_thread = (regs->tstate & TSTATE_PRIV) ? 1 : 0;
  476. parent_sf = ((struct sparc_stackf *) regs) - 1;
  477. /* Calculate offset to stack_frame & pt_regs */
  478. child_stack_sz = ((STACKFRAME_SZ + TRACEREG_SZ) +
  479. (kernel_thread ? STACKFRAME_SZ : 0));
  480. child_trap_frame = (task_stack_page(p) +
  481. (THREAD_SIZE - child_stack_sz));
  482. memcpy(child_trap_frame, parent_sf, child_stack_sz);
  483. t->flags = (t->flags & ~((0xffUL << TI_FLAG_CWP_SHIFT) |
  484. (0xffUL << TI_FLAG_CURRENT_DS_SHIFT))) |
  485. (((regs->tstate + 1) & TSTATE_CWP) << TI_FLAG_CWP_SHIFT);
  486. t->new_child = 1;
  487. t->ksp = ((unsigned long) child_trap_frame) - STACK_BIAS;
  488. t->kregs = (struct pt_regs *) (child_trap_frame +
  489. sizeof(struct sparc_stackf));
  490. t->fpsaved[0] = 0;
  491. if (kernel_thread) {
  492. struct sparc_stackf *child_sf = (struct sparc_stackf *)
  493. (child_trap_frame + (STACKFRAME_SZ + TRACEREG_SZ));
  494. /* Zero terminate the stack backtrace. */
  495. child_sf->fp = NULL;
  496. t->kregs->u_regs[UREG_FP] =
  497. ((unsigned long) child_sf) - STACK_BIAS;
  498. /* Special case, if we are spawning a kernel thread from
  499. * a userspace task (usermode helper, NFS or similar), we
  500. * must disable performance counters in the child because
  501. * the address space and protection realm are changing.
  502. */
  503. if (t->flags & _TIF_PERFCTR) {
  504. t->user_cntd0 = t->user_cntd1 = NULL;
  505. t->pcr_reg = 0;
  506. t->flags &= ~_TIF_PERFCTR;
  507. }
  508. t->flags |= ((long)ASI_P << TI_FLAG_CURRENT_DS_SHIFT);
  509. t->kregs->u_regs[UREG_G6] = (unsigned long) t;
  510. t->kregs->u_regs[UREG_G4] = (unsigned long) t->task;
  511. } else {
  512. if (t->flags & _TIF_32BIT) {
  513. sp &= 0x00000000ffffffffUL;
  514. regs->u_regs[UREG_FP] &= 0x00000000ffffffffUL;
  515. }
  516. t->kregs->u_regs[UREG_FP] = sp;
  517. t->flags |= ((long)ASI_AIUS << TI_FLAG_CURRENT_DS_SHIFT);
  518. if (sp != regs->u_regs[UREG_FP]) {
  519. unsigned long csp;
  520. csp = clone_stackframe(sp, regs->u_regs[UREG_FP]);
  521. if (!csp)
  522. return -EFAULT;
  523. t->kregs->u_regs[UREG_FP] = csp;
  524. }
  525. if (t->utraps)
  526. t->utraps[0]++;
  527. }
  528. /* Set the return value for the child. */
  529. t->kregs->u_regs[UREG_I0] = current->pid;
  530. t->kregs->u_regs[UREG_I1] = 1;
  531. /* Set the second return value for the parent. */
  532. regs->u_regs[UREG_I1] = 0;
  533. if (clone_flags & CLONE_SETTLS)
  534. t->kregs->u_regs[UREG_G7] = regs->u_regs[UREG_I3];
  535. return 0;
  536. }
  537. /*
  538. * This is the mechanism for creating a new kernel thread.
  539. *
  540. * NOTE! Only a kernel-only process(ie the swapper or direct descendants
  541. * who haven't done an "execve()") should use this: it will work within
  542. * a system call from a "real" process, but the process memory space will
  543. * not be freed until both the parent and the child have exited.
  544. */
  545. pid_t kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
  546. {
  547. long retval;
  548. /* If the parent runs before fn(arg) is called by the child,
  549. * the input registers of this function can be clobbered.
  550. * So we stash 'fn' and 'arg' into global registers which
  551. * will not be modified by the parent.
  552. */
  553. __asm__ __volatile__("mov %4, %%g2\n\t" /* Save FN into global */
  554. "mov %5, %%g3\n\t" /* Save ARG into global */
  555. "mov %1, %%g1\n\t" /* Clone syscall nr. */
  556. "mov %2, %%o0\n\t" /* Clone flags. */
  557. "mov 0, %%o1\n\t" /* usp arg == 0 */
  558. "t 0x6d\n\t" /* Linux/Sparc clone(). */
  559. "brz,a,pn %%o1, 1f\n\t" /* Parent, just return. */
  560. " mov %%o0, %0\n\t"
  561. "jmpl %%g2, %%o7\n\t" /* Call the function. */
  562. " mov %%g3, %%o0\n\t" /* Set arg in delay. */
  563. "mov %3, %%g1\n\t"
  564. "t 0x6d\n\t" /* Linux/Sparc exit(). */
  565. /* Notreached by child. */
  566. "1:" :
  567. "=r" (retval) :
  568. "i" (__NR_clone), "r" (flags | CLONE_VM | CLONE_UNTRACED),
  569. "i" (__NR_exit), "r" (fn), "r" (arg) :
  570. "g1", "g2", "g3", "o0", "o1", "memory", "cc");
  571. return retval;
  572. }
  573. EXPORT_SYMBOL(kernel_thread);
  574. typedef struct {
  575. union {
  576. unsigned int pr_regs[32];
  577. unsigned long pr_dregs[16];
  578. } pr_fr;
  579. unsigned int __unused;
  580. unsigned int pr_fsr;
  581. unsigned char pr_qcnt;
  582. unsigned char pr_q_entrysize;
  583. unsigned char pr_en;
  584. unsigned int pr_q[64];
  585. } elf_fpregset_t32;
  586. /*
  587. * fill in the fpu structure for a core dump.
  588. */
  589. int dump_fpu (struct pt_regs * regs, elf_fpregset_t * fpregs)
  590. {
  591. unsigned long *kfpregs = current_thread_info()->fpregs;
  592. unsigned long fprs = current_thread_info()->fpsaved[0];
  593. if (test_thread_flag(TIF_32BIT)) {
  594. elf_fpregset_t32 *fpregs32 = (elf_fpregset_t32 *)fpregs;
  595. if (fprs & FPRS_DL)
  596. memcpy(&fpregs32->pr_fr.pr_regs[0], kfpregs,
  597. sizeof(unsigned int) * 32);
  598. else
  599. memset(&fpregs32->pr_fr.pr_regs[0], 0,
  600. sizeof(unsigned int) * 32);
  601. fpregs32->pr_qcnt = 0;
  602. fpregs32->pr_q_entrysize = 8;
  603. memset(&fpregs32->pr_q[0], 0,
  604. (sizeof(unsigned int) * 64));
  605. if (fprs & FPRS_FEF) {
  606. fpregs32->pr_fsr = (unsigned int) current_thread_info()->xfsr[0];
  607. fpregs32->pr_en = 1;
  608. } else {
  609. fpregs32->pr_fsr = 0;
  610. fpregs32->pr_en = 0;
  611. }
  612. } else {
  613. if(fprs & FPRS_DL)
  614. memcpy(&fpregs->pr_regs[0], kfpregs,
  615. sizeof(unsigned int) * 32);
  616. else
  617. memset(&fpregs->pr_regs[0], 0,
  618. sizeof(unsigned int) * 32);
  619. if(fprs & FPRS_DU)
  620. memcpy(&fpregs->pr_regs[16], kfpregs+16,
  621. sizeof(unsigned int) * 32);
  622. else
  623. memset(&fpregs->pr_regs[16], 0,
  624. sizeof(unsigned int) * 32);
  625. if(fprs & FPRS_FEF) {
  626. fpregs->pr_fsr = current_thread_info()->xfsr[0];
  627. fpregs->pr_gsr = current_thread_info()->gsr[0];
  628. } else {
  629. fpregs->pr_fsr = fpregs->pr_gsr = 0;
  630. }
  631. fpregs->pr_fprs = fprs;
  632. }
  633. return 1;
  634. }
  635. EXPORT_SYMBOL(dump_fpu);
  636. /*
  637. * sparc_execve() executes a new program after the asm stub has set
  638. * things up for us. This should basically do what I want it to.
  639. */
  640. asmlinkage int sparc_execve(struct pt_regs *regs)
  641. {
  642. int error, base = 0;
  643. char *filename;
  644. /* User register window flush is done by entry.S */
  645. /* Check for indirect call. */
  646. if (regs->u_regs[UREG_G1] == 0)
  647. base = 1;
  648. filename = getname((char __user *)regs->u_regs[base + UREG_I0]);
  649. error = PTR_ERR(filename);
  650. if (IS_ERR(filename))
  651. goto out;
  652. error = do_execve(filename,
  653. (char __user * __user *)
  654. regs->u_regs[base + UREG_I1],
  655. (char __user * __user *)
  656. regs->u_regs[base + UREG_I2], regs);
  657. putname(filename);
  658. if (!error) {
  659. fprs_write(0);
  660. current_thread_info()->xfsr[0] = 0;
  661. current_thread_info()->fpsaved[0] = 0;
  662. regs->tstate &= ~TSTATE_PEF;
  663. }
  664. out:
  665. return error;
  666. }
  667. unsigned long get_wchan(struct task_struct *task)
  668. {
  669. unsigned long pc, fp, bias = 0;
  670. struct thread_info *tp;
  671. struct reg_window *rw;
  672. unsigned long ret = 0;
  673. int count = 0;
  674. if (!task || task == current ||
  675. task->state == TASK_RUNNING)
  676. goto out;
  677. tp = task_thread_info(task);
  678. bias = STACK_BIAS;
  679. fp = task_thread_info(task)->ksp + bias;
  680. do {
  681. if (!kstack_valid(tp, fp))
  682. break;
  683. rw = (struct reg_window *) fp;
  684. pc = rw->ins[7];
  685. if (!in_sched_functions(pc)) {
  686. ret = pc;
  687. goto out;
  688. }
  689. fp = rw->ins[6] + bias;
  690. } while (++count < 16);
  691. out:
  692. return ret;
  693. }