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/sched.h>
13 #include <linux/tick.h>
14 #include <linux/kernel.h>
16 #include <linux/stddef.h>
17 #include <linux/unistd.h>
18 #include <linux/export.h>
19 #include <linux/ptrace.h>
20 #include <linux/mman.h>
21 #include <linux/personality.h>
22 #include <linux/sys.h>
23 #include <linux/user.h>
24 #include <linux/init.h>
25 #include <linux/completion.h>
26 #include <linux/kallsyms.h>
27 #include <linux/random.h>
30 #include <asm/bootinfo.h>
34 #include <asm/pgtable.h>
35 #include <asm/mipsregs.h>
36 #include <asm/processor.h>
37 #include <asm/uaccess.h>
40 #include <asm/isadep.h>
42 #include <asm/stacktrace.h>
44 #ifdef CONFIG_HOTPLUG_CPU
45 void arch_cpu_idle_dead(void)
47 /* What the heck is this check doing ? */
48 if (!cpu_isset(smp_processor_id(), cpu_callin_map
))
53 void arch_cpu_idle(void)
55 #ifdef CONFIG_MIPS_MT_SMTC
56 extern void smtc_idle_loop_hook(void);
58 smtc_idle_loop_hook();
66 asmlinkage
void ret_from_fork(void);
67 asmlinkage
void ret_from_kernel_thread(void);
69 void start_thread(struct pt_regs
* regs
, unsigned long pc
, unsigned long sp
)
73 /* New thread loses kernel privileges. */
74 status
= regs
->cp0_status
& ~(ST0_CU0
|ST0_CU1
|ST0_FR
|KU_MASK
);
76 status
|= test_thread_flag(TIF_32BIT_REGS
) ? 0 : ST0_FR
;
79 regs
->cp0_status
= status
;
88 void exit_thread(void)
92 void flush_thread(void)
96 int copy_thread(unsigned long clone_flags
, unsigned long usp
,
97 unsigned long arg
, struct task_struct
*p
)
99 struct thread_info
*ti
= task_thread_info(p
);
100 struct pt_regs
*childregs
, *regs
= current_pt_regs();
101 unsigned long childksp
;
102 p
->set_child_tid
= p
->clear_child_tid
= NULL
;
104 childksp
= (unsigned long)task_stack_page(p
) + THREAD_SIZE
- 32;
116 /* set up new TSS. */
117 childregs
= (struct pt_regs
*) childksp
- 1;
118 /* Put the stack after the struct pt_regs. */
119 childksp
= (unsigned long) childregs
;
120 p
->thread
.cp0_status
= read_c0_status() & ~(ST0_CU2
|ST0_CU1
);
121 if (unlikely(p
->flags
& PF_KTHREAD
)) {
122 unsigned long status
= p
->thread
.cp0_status
;
123 memset(childregs
, 0, sizeof(struct pt_regs
));
124 ti
->addr_limit
= KERNEL_DS
;
125 p
->thread
.reg16
= usp
; /* fn */
126 p
->thread
.reg17
= arg
;
127 p
->thread
.reg29
= childksp
;
128 p
->thread
.reg31
= (unsigned long) ret_from_kernel_thread
;
129 #if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX)
130 status
= (status
& ~(ST0_KUP
| ST0_IEP
| ST0_IEC
)) |
131 ((status
& (ST0_KUC
| ST0_IEC
)) << 2);
135 childregs
->cp0_status
= status
;
139 childregs
->regs
[7] = 0; /* Clear error flag */
140 childregs
->regs
[2] = 0; /* Child gets zero as return value */
142 childregs
->regs
[29] = usp
;
143 ti
->addr_limit
= USER_DS
;
145 p
->thread
.reg29
= (unsigned long) childregs
;
146 p
->thread
.reg31
= (unsigned long) ret_from_fork
;
149 * New tasks lose permission to use the fpu. This accelerates context
150 * switching for most programs since they don't use the fpu.
152 childregs
->cp0_status
&= ~(ST0_CU2
|ST0_CU1
);
154 #ifdef CONFIG_MIPS_MT_SMTC
156 * SMTC restores TCStatus after Status, and the CU bits
159 childregs
->cp0_tcstatus
&= ~(ST0_CU2
|ST0_CU1
);
161 clear_tsk_thread_flag(p
, TIF_USEDFPU
);
163 #ifdef CONFIG_MIPS_MT_FPAFF
164 clear_tsk_thread_flag(p
, TIF_FPUBOUND
);
165 #endif /* CONFIG_MIPS_MT_FPAFF */
167 if (clone_flags
& CLONE_SETTLS
)
168 ti
->tp_value
= regs
->regs
[7];
173 /* Fill in the fpu structure for a core dump.. */
174 int dump_fpu(struct pt_regs
*regs
, elf_fpregset_t
*r
)
176 memcpy(r
, ¤t
->thread
.fpu
, sizeof(current
->thread
.fpu
));
181 void elf_dump_regs(elf_greg_t
*gp
, struct pt_regs
*regs
)
185 for (i
= 0; i
< EF_R0
; i
++)
188 for (i
= 1; i
<= 31; i
++)
189 gp
[EF_R0
+ i
] = regs
->regs
[i
];
192 gp
[EF_LO
] = regs
->lo
;
193 gp
[EF_HI
] = regs
->hi
;
194 gp
[EF_CP0_EPC
] = regs
->cp0_epc
;
195 gp
[EF_CP0_BADVADDR
] = regs
->cp0_badvaddr
;
196 gp
[EF_CP0_STATUS
] = regs
->cp0_status
;
197 gp
[EF_CP0_CAUSE
] = regs
->cp0_cause
;
203 int dump_task_regs(struct task_struct
*tsk
, elf_gregset_t
*regs
)
205 elf_dump_regs(*regs
, task_pt_regs(tsk
));
209 int dump_task_fpu(struct task_struct
*t
, elf_fpregset_t
*fpr
)
211 memcpy(fpr
, &t
->thread
.fpu
, sizeof(current
->thread
.fpu
));
219 struct mips_frame_info
{
221 unsigned long func_size
;
226 static inline int is_ra_save_ins(union mips_instruction
*ip
)
228 /* sw / sd $ra, offset($sp) */
229 return (ip
->i_format
.opcode
== sw_op
|| ip
->i_format
.opcode
== sd_op
) &&
230 ip
->i_format
.rs
== 29 &&
231 ip
->i_format
.rt
== 31;
234 static inline int is_jal_jalr_jr_ins(union mips_instruction
*ip
)
236 if (ip
->j_format
.opcode
== jal_op
)
238 if (ip
->r_format
.opcode
!= spec_op
)
240 return ip
->r_format
.func
== jalr_op
|| ip
->r_format
.func
== jr_op
;
243 static inline int is_sp_move_ins(union mips_instruction
*ip
)
245 /* addiu/daddiu sp,sp,-imm */
246 if (ip
->i_format
.rs
!= 29 || ip
->i_format
.rt
!= 29)
248 if (ip
->i_format
.opcode
== addiu_op
|| ip
->i_format
.opcode
== daddiu_op
)
253 static int get_frame_info(struct mips_frame_info
*info
)
255 union mips_instruction
*ip
= info
->func
;
256 unsigned max_insns
= info
->func_size
/ sizeof(union mips_instruction
);
259 info
->pc_offset
= -1;
260 info
->frame_size
= 0;
266 max_insns
= 128U; /* unknown function size */
267 max_insns
= min(128U, max_insns
);
269 for (i
= 0; i
< max_insns
; i
++, ip
++) {
271 if (is_jal_jalr_jr_ins(ip
))
273 if (!info
->frame_size
) {
274 if (is_sp_move_ins(ip
))
275 info
->frame_size
= - ip
->i_format
.simmediate
;
278 if (info
->pc_offset
== -1 && is_ra_save_ins(ip
)) {
280 ip
->i_format
.simmediate
/ sizeof(long);
284 if (info
->frame_size
&& info
->pc_offset
>= 0) /* nested */
286 if (info
->pc_offset
< 0) /* leaf */
288 /* prologue seems boggus... */
293 static struct mips_frame_info schedule_mfi __read_mostly
;
295 static int __init
frame_info_init(void)
297 unsigned long size
= 0;
298 #ifdef CONFIG_KALLSYMS
301 kallsyms_lookup_size_offset((unsigned long)schedule
, &size
, &ofs
);
303 schedule_mfi
.func
= schedule
;
304 schedule_mfi
.func_size
= size
;
306 get_frame_info(&schedule_mfi
);
309 * Without schedule() frame info, result given by
310 * thread_saved_pc() and get_wchan() are not reliable.
312 if (schedule_mfi
.pc_offset
< 0)
313 printk("Can't analyze schedule() prologue at %p\n", schedule
);
318 arch_initcall(frame_info_init
);
321 * Return saved PC of a blocked thread.
323 unsigned long thread_saved_pc(struct task_struct
*tsk
)
325 struct thread_struct
*t
= &tsk
->thread
;
327 /* New born processes are a special case */
328 if (t
->reg31
== (unsigned long) ret_from_fork
)
330 if (schedule_mfi
.pc_offset
< 0)
332 return ((unsigned long *)t
->reg29
)[schedule_mfi
.pc_offset
];
336 #ifdef CONFIG_KALLSYMS
337 /* generic stack unwinding function */
338 unsigned long notrace
unwind_stack_by_address(unsigned long stack_page
,
343 struct mips_frame_info info
;
344 unsigned long size
, ofs
;
346 extern void ret_from_irq(void);
347 extern void ret_from_exception(void);
353 * If we reached the bottom of interrupt context,
354 * return saved pc in pt_regs.
356 if (pc
== (unsigned long)ret_from_irq
||
357 pc
== (unsigned long)ret_from_exception
) {
358 struct pt_regs
*regs
;
359 if (*sp
>= stack_page
&&
360 *sp
+ sizeof(*regs
) <= stack_page
+ THREAD_SIZE
- 32) {
361 regs
= (struct pt_regs
*)*sp
;
363 if (__kernel_text_address(pc
)) {
364 *sp
= regs
->regs
[29];
365 *ra
= regs
->regs
[31];
371 if (!kallsyms_lookup_size_offset(pc
, &size
, &ofs
))
374 * Return ra if an exception occurred at the first instruction
376 if (unlikely(ofs
== 0)) {
382 info
.func
= (void *)(pc
- ofs
);
383 info
.func_size
= ofs
; /* analyze from start to ofs */
384 leaf
= get_frame_info(&info
);
388 if (*sp
< stack_page
||
389 *sp
+ info
.frame_size
> stack_page
+ THREAD_SIZE
- 32)
394 * For some extreme cases, get_frame_info() can
395 * consider wrongly a nested function as a leaf
396 * one. In that cases avoid to return always the
399 pc
= pc
!= *ra
? *ra
: 0;
401 pc
= ((unsigned long *)(*sp
))[info
.pc_offset
];
403 *sp
+= info
.frame_size
;
405 return __kernel_text_address(pc
) ? pc
: 0;
407 EXPORT_SYMBOL(unwind_stack_by_address
);
409 /* used by show_backtrace() */
410 unsigned long unwind_stack(struct task_struct
*task
, unsigned long *sp
,
411 unsigned long pc
, unsigned long *ra
)
413 unsigned long stack_page
= (unsigned long)task_stack_page(task
);
414 return unwind_stack_by_address(stack_page
, sp
, pc
, ra
);
419 * get_wchan - a maintenance nightmare^W^Wpain in the ass ...
421 unsigned long get_wchan(struct task_struct
*task
)
423 unsigned long pc
= 0;
424 #ifdef CONFIG_KALLSYMS
426 unsigned long ra
= 0;
429 if (!task
|| task
== current
|| task
->state
== TASK_RUNNING
)
431 if (!task_stack_page(task
))
434 pc
= thread_saved_pc(task
);
436 #ifdef CONFIG_KALLSYMS
437 sp
= task
->thread
.reg29
+ schedule_mfi
.frame_size
;
439 while (in_sched_functions(pc
))
440 pc
= unwind_stack(task
, &sp
, pc
, &ra
);
448 * Don't forget that the stack pointer must be aligned on a 8 bytes
449 * boundary for 32-bits ABI and 16 bytes for 64-bits ABI.
451 unsigned long arch_align_stack(unsigned long sp
)
453 if (!(current
->personality
& ADDR_NO_RANDOMIZE
) && randomize_va_space
)
454 sp
-= get_random_int() & ~PAGE_MASK
;