2 * This file is subject to the terms and conditions of the GNU General Public
3 * License. See the file "COPYING" in the main directory of this archive
6 * Copyright (C) 1994 - 1999, 2000 by Ralf Baechle and others.
7 * Copyright (C) 2005, 2006 by Ralf Baechle (ralf@linux-mips.org)
8 * Copyright (C) 1999, 2000 Silicon Graphics, Inc.
9 * Copyright (C) 2004 Thiemo Seufer
11 #include <linux/errno.h>
12 #include <linux/module.h>
13 #include <linux/sched.h>
14 #include <linux/kernel.h>
16 #include <linux/stddef.h>
17 #include <linux/unistd.h>
18 #include <linux/ptrace.h>
19 #include <linux/slab.h>
20 #include <linux/mman.h>
21 #include <linux/personality.h>
22 #include <linux/sys.h>
23 #include <linux/user.h>
24 #include <linux/a.out.h>
25 #include <linux/init.h>
26 #include <linux/completion.h>
27 #include <linux/kallsyms.h>
30 #include <asm/bootinfo.h>
34 #include <asm/pgtable.h>
35 #include <asm/system.h>
36 #include <asm/mipsregs.h>
37 #include <asm/processor.h>
38 #include <asm/uaccess.h>
41 #include <asm/isadep.h>
43 #include <asm/stacktrace.h>
46 * The idle thread. There's no useful work to be done, so just try to conserve
47 * power and have a low exit latency (ie sit in a loop waiting for somebody to
48 * say that they'd like to reschedule)
50 ATTRIB_NORET void cpu_idle(void)
52 /* endless idle loop with no priority at all */
54 while (!need_resched()) {
55 #ifdef CONFIG_MIPS_MT_SMTC
56 extern void smtc_idle_loop_hook(void);
58 smtc_idle_loop_hook();
59 #endif /* CONFIG_MIPS_MT_SMTC */
63 preempt_enable_no_resched();
70 * Native o32 and N64 ABI without DSP ASE
72 struct mips_abi mips_abi = {
73 .do_signal = do_signal,
74 #ifdef CONFIG_TRAD_SIGNALS
75 .setup_frame = setup_frame,
77 .setup_rt_frame = setup_rt_frame
80 #ifdef CONFIG_MIPS32_O32
82 * o32 compatibility on 64-bit kernels, without DSP ASE
84 struct mips_abi mips_abi_32 = {
85 .do_signal = do_signal32,
86 .setup_frame = setup_frame_32,
87 .setup_rt_frame = setup_rt_frame_32
89 #endif /* CONFIG_MIPS32_O32 */
91 #ifdef CONFIG_MIPS32_N32
93 * N32 on 64-bit kernels, without DSP ASE
95 struct mips_abi mips_abi_n32 = {
96 .do_signal = do_signal,
97 .setup_rt_frame = setup_rt_frame_n32
99 #endif /* CONFIG_MIPS32_N32 */
101 asmlinkage void ret_from_fork(void);
103 void start_thread(struct pt_regs * regs, unsigned long pc, unsigned long sp)
105 unsigned long status;
107 /* New thread loses kernel privileges. */
108 status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|KU_MASK);
111 status |= (current->thread.mflags & MF_32BIT_REGS) ? 0 : ST0_FR;
114 regs->cp0_status = status;
121 current_thread_info()->addr_limit = USER_DS;
124 void exit_thread(void)
128 void flush_thread(void)
132 int copy_thread(int nr, unsigned long clone_flags, unsigned long usp,
133 unsigned long unused, struct task_struct *p, struct pt_regs *regs)
135 struct thread_info *ti = task_thread_info(p);
136 struct pt_regs *childregs;
138 p->set_child_tid = p->clear_child_tid = NULL;
140 childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
152 /* set up new TSS. */
153 childregs = (struct pt_regs *) childksp - 1;
155 childregs->regs[7] = 0; /* Clear error flag */
157 #if defined(CONFIG_BINFMT_IRIX)
158 if (current->personality != PER_LINUX) {
159 /* Under IRIX things are a little different. */
160 childregs->regs[3] = 1;
164 childregs->regs[2] = 0; /* Child gets zero as return value */
165 regs->regs[2] = p->pid;
167 if (childregs->cp0_status & ST0_CU0) {
168 childregs->regs[28] = (unsigned long) ti;
169 childregs->regs[29] = childksp;
170 ti->addr_limit = KERNEL_DS;
172 childregs->regs[29] = usp;
173 ti->addr_limit = USER_DS;
175 p->thread.reg29 = (unsigned long) childregs;
176 p->thread.reg31 = (unsigned long) ret_from_fork;
179 * New tasks lose permission to use the fpu. This accelerates context
180 * switching for most programs since they don't use the fpu.
182 p->thread.cp0_status = read_c0_status() & ~(ST0_CU2|ST0_CU1);
183 childregs->cp0_status &= ~(ST0_CU2|ST0_CU1);
184 clear_tsk_thread_flag(p, TIF_USEDFPU);
186 #ifdef CONFIG_MIPS_MT_FPAFF
188 * FPU affinity support is cleaner if we track the
189 * user-visible CPU affinity from the very beginning.
190 * The generic cpus_allowed mask will already have
191 * been copied from the parent before copy_thread
194 p->thread.user_cpus_allowed = p->cpus_allowed;
195 #endif /* CONFIG_MIPS_MT_FPAFF */
197 if (clone_flags & CLONE_SETTLS)
198 ti->tp_value = regs->regs[7];
203 /* Fill in the fpu structure for a core dump.. */
204 int dump_fpu(struct pt_regs *regs, elf_fpregset_t *r)
206 memcpy(r, ¤t->thread.fpu, sizeof(current->thread.fpu));
211 void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs)
215 for (i = 0; i < EF_R0; i++)
218 for (i = 1; i <= 31; i++)
219 gp[EF_R0 + i] = regs->regs[i];
222 gp[EF_LO] = regs->lo;
223 gp[EF_HI] = regs->hi;
224 gp[EF_CP0_EPC] = regs->cp0_epc;
225 gp[EF_CP0_BADVADDR] = regs->cp0_badvaddr;
226 gp[EF_CP0_STATUS] = regs->cp0_status;
227 gp[EF_CP0_CAUSE] = regs->cp0_cause;
233 int dump_task_regs (struct task_struct *tsk, elf_gregset_t *regs)
235 elf_dump_regs(*regs, task_pt_regs(tsk));
239 int dump_task_fpu (struct task_struct *t, elf_fpregset_t *fpr)
241 memcpy(fpr, &t->thread.fpu, sizeof(current->thread.fpu));
247 * Create a kernel thread
249 ATTRIB_NORET void kernel_thread_helper(void *arg, int (*fn)(void *))
254 long kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
258 memset(®s, 0, sizeof(regs));
260 regs.regs[4] = (unsigned long) arg;
261 regs.regs[5] = (unsigned long) fn;
262 regs.cp0_epc = (unsigned long) kernel_thread_helper;
263 regs.cp0_status = read_c0_status();
264 #if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX)
265 regs.cp0_status &= ~(ST0_KUP | ST0_IEC);
266 regs.cp0_status |= ST0_IEP;
268 regs.cp0_status |= ST0_EXL;
271 /* Ok, create the new process.. */
272 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, ®s, 0, NULL, NULL);
278 struct mips_frame_info {
280 unsigned long func_size;
285 static inline int is_ra_save_ins(union mips_instruction *ip)
287 /* sw / sd $ra, offset($sp) */
288 return (ip->i_format.opcode == sw_op || ip->i_format.opcode == sd_op) &&
289 ip->i_format.rs == 29 &&
290 ip->i_format.rt == 31;
293 static inline int is_jal_jalr_jr_ins(union mips_instruction *ip)
295 if (ip->j_format.opcode == jal_op)
297 if (ip->r_format.opcode != spec_op)
299 return ip->r_format.func == jalr_op || ip->r_format.func == jr_op;
302 static inline int is_sp_move_ins(union mips_instruction *ip)
304 /* addiu/daddiu sp,sp,-imm */
305 if (ip->i_format.rs != 29 || ip->i_format.rt != 29)
307 if (ip->i_format.opcode == addiu_op || ip->i_format.opcode == daddiu_op)
312 static int get_frame_info(struct mips_frame_info *info)
314 union mips_instruction *ip = info->func;
315 unsigned max_insns = info->func_size / sizeof(union mips_instruction);
318 info->pc_offset = -1;
319 info->frame_size = 0;
325 max_insns = 128U; /* unknown function size */
326 max_insns = min(128U, max_insns);
328 for (i = 0; i < max_insns; i++, ip++) {
330 if (is_jal_jalr_jr_ins(ip))
332 if (!info->frame_size) {
333 if (is_sp_move_ins(ip))
334 info->frame_size = - ip->i_format.simmediate;
337 if (info->pc_offset == -1 && is_ra_save_ins(ip)) {
339 ip->i_format.simmediate / sizeof(long);
343 if (info->frame_size && info->pc_offset >= 0) /* nested */
345 if (info->pc_offset < 0) /* leaf */
347 /* prologue seems boggus... */
352 static struct mips_frame_info schedule_mfi __read_mostly;
354 static int __init frame_info_init(void)
356 unsigned long size = 0;
357 #ifdef CONFIG_KALLSYMS
360 kallsyms_lookup_size_offset((unsigned long)schedule, &size, &ofs);
362 schedule_mfi.func = schedule;
363 schedule_mfi.func_size = size;
365 get_frame_info(&schedule_mfi);
368 * Without schedule() frame info, result given by
369 * thread_saved_pc() and get_wchan() are not reliable.
371 if (schedule_mfi.pc_offset < 0)
372 printk("Can't analyze schedule() prologue at %p\n", schedule);
377 arch_initcall(frame_info_init);
380 * Return saved PC of a blocked thread.
382 unsigned long thread_saved_pc(struct task_struct *tsk)
384 struct thread_struct *t = &tsk->thread;
386 /* New born processes are a special case */
387 if (t->reg31 == (unsigned long) ret_from_fork)
389 if (schedule_mfi.pc_offset < 0)
391 return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
395 #ifdef CONFIG_KALLSYMS
396 /* used by show_backtrace() */
397 unsigned long unwind_stack(struct task_struct *task, unsigned long *sp,
398 unsigned long pc, unsigned long *ra)
400 unsigned long stack_page;
401 struct mips_frame_info info;
402 unsigned long size, ofs;
404 extern void ret_from_irq(void);
405 extern void ret_from_exception(void);
407 stack_page = (unsigned long)task_stack_page(task);
412 * If we reached the bottom of interrupt context,
413 * return saved pc in pt_regs.
415 if (pc == (unsigned long)ret_from_irq ||
416 pc == (unsigned long)ret_from_exception) {
417 struct pt_regs *regs;
418 if (*sp >= stack_page &&
419 *sp + sizeof(*regs) <= stack_page + THREAD_SIZE - 32) {
420 regs = (struct pt_regs *)*sp;
422 if (__kernel_text_address(pc)) {
423 *sp = regs->regs[29];
424 *ra = regs->regs[31];
430 if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
433 * Return ra if an exception occured at the first instruction
435 if (unlikely(ofs == 0)) {
441 info.func = (void *)(pc - ofs);
442 info.func_size = ofs; /* analyze from start to ofs */
443 leaf = get_frame_info(&info);
447 if (*sp < stack_page ||
448 *sp + info.frame_size > stack_page + THREAD_SIZE - 32)
453 * For some extreme cases, get_frame_info() can
454 * consider wrongly a nested function as a leaf
455 * one. In that cases avoid to return always the
458 pc = pc != *ra ? *ra : 0;
460 pc = ((unsigned long *)(*sp))[info.pc_offset];
462 *sp += info.frame_size;
464 return __kernel_text_address(pc) ? pc : 0;
469 * get_wchan - a maintenance nightmare^W^Wpain in the ass ...
471 unsigned long get_wchan(struct task_struct *task)
473 unsigned long pc = 0;
474 #ifdef CONFIG_KALLSYMS
476 unsigned long ra = 0;
479 if (!task || task == current || task->state == TASK_RUNNING)
481 if (!task_stack_page(task))
484 pc = thread_saved_pc(task);
486 #ifdef CONFIG_KALLSYMS
487 sp = task->thread.reg29 + schedule_mfi.frame_size;
489 while (in_sched_functions(pc))
490 pc = unwind_stack(task, &sp, pc, &ra);