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/tick.h>
15 #include <linux/kernel.h>
17 #include <linux/stddef.h>
18 #include <linux/unistd.h>
19 #include <linux/ptrace.h>
20 #include <linux/slab.h>
21 #include <linux/mman.h>
22 #include <linux/personality.h>
23 #include <linux/sys.h>
24 #include <linux/user.h>
25 #include <linux/init.h>
26 #include <linux/completion.h>
27 #include <linux/kallsyms.h>
28 #include <linux/random.h>
31 #include <asm/bootinfo.h>
35 #include <asm/pgtable.h>
36 #include <asm/system.h>
37 #include <asm/mipsregs.h>
38 #include <asm/processor.h>
39 #include <asm/uaccess.h>
42 #include <asm/isadep.h>
44 #include <asm/stacktrace.h>
47 * The idle thread. There's no useful work to be done, so just try to conserve
48 * power and have a low exit latency (ie sit in a loop waiting for somebody to
49 * say that they'd like to reschedule)
51 void __noreturn cpu_idle(void)
55 /* CPU is going idle. */
56 cpu = smp_processor_id();
58 /* endless idle loop with no priority at all */
60 tick_nohz_stop_sched_tick(1);
61 while (!need_resched() && cpu_online(cpu)) {
62 #ifdef CONFIG_MIPS_MT_SMTC
63 extern void smtc_idle_loop_hook(void);
65 smtc_idle_loop_hook();
70 #ifdef CONFIG_HOTPLUG_CPU
71 if (!cpu_online(cpu) && !cpu_isset(cpu, cpu_callin_map) &&
72 (system_state == SYSTEM_RUNNING ||
73 system_state == SYSTEM_BOOTING))
76 tick_nohz_restart_sched_tick();
77 preempt_enable_no_resched();
83 asmlinkage void ret_from_fork(void);
85 void start_thread(struct pt_regs * regs, unsigned long pc, unsigned long sp)
89 /* New thread loses kernel privileges. */
90 status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|ST0_FR|KU_MASK);
92 status |= test_thread_flag(TIF_32BIT_REGS) ? 0 : ST0_FR;
95 regs->cp0_status = status;
102 current_thread_info()->addr_limit = USER_DS;
105 void exit_thread(void)
109 void flush_thread(void)
113 int copy_thread(unsigned long clone_flags, unsigned long usp,
114 unsigned long unused, struct task_struct *p, struct pt_regs *regs)
116 struct thread_info *ti = task_thread_info(p);
117 struct pt_regs *childregs;
119 p->set_child_tid = p->clear_child_tid = NULL;
121 childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
133 /* set up new TSS. */
134 childregs = (struct pt_regs *) childksp - 1;
136 childregs->regs[7] = 0; /* Clear error flag */
138 childregs->regs[2] = 0; /* Child gets zero as return value */
139 regs->regs[2] = p->pid;
141 if (childregs->cp0_status & ST0_CU0) {
142 childregs->regs[28] = (unsigned long) ti;
143 childregs->regs[29] = childksp;
144 ti->addr_limit = KERNEL_DS;
146 childregs->regs[29] = usp;
147 ti->addr_limit = USER_DS;
149 p->thread.reg29 = (unsigned long) childregs;
150 p->thread.reg31 = (unsigned long) ret_from_fork;
153 * New tasks lose permission to use the fpu. This accelerates context
154 * switching for most programs since they don't use the fpu.
156 p->thread.cp0_status = read_c0_status() & ~(ST0_CU2|ST0_CU1);
157 childregs->cp0_status &= ~(ST0_CU2|ST0_CU1);
159 #ifdef CONFIG_MIPS_MT_SMTC
161 * SMTC restores TCStatus after Status, and the CU bits
164 childregs->cp0_tcstatus &= ~(ST0_CU2|ST0_CU1);
166 clear_tsk_thread_flag(p, TIF_USEDFPU);
168 #ifdef CONFIG_MIPS_MT_FPAFF
169 clear_tsk_thread_flag(p, TIF_FPUBOUND);
170 #endif /* CONFIG_MIPS_MT_FPAFF */
172 if (clone_flags & CLONE_SETTLS)
173 ti->tp_value = regs->regs[7];
178 /* Fill in the fpu structure for a core dump.. */
179 int dump_fpu(struct pt_regs *regs, elf_fpregset_t *r)
181 memcpy(r, ¤t->thread.fpu, sizeof(current->thread.fpu));
186 void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs)
190 for (i = 0; i < EF_R0; i++)
193 for (i = 1; i <= 31; i++)
194 gp[EF_R0 + i] = regs->regs[i];
197 gp[EF_LO] = regs->lo;
198 gp[EF_HI] = regs->hi;
199 gp[EF_CP0_EPC] = regs->cp0_epc;
200 gp[EF_CP0_BADVADDR] = regs->cp0_badvaddr;
201 gp[EF_CP0_STATUS] = regs->cp0_status;
202 gp[EF_CP0_CAUSE] = regs->cp0_cause;
208 int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
210 elf_dump_regs(*regs, task_pt_regs(tsk));
214 int dump_task_fpu(struct task_struct *t, elf_fpregset_t *fpr)
216 memcpy(fpr, &t->thread.fpu, sizeof(current->thread.fpu));
222 * Create a kernel thread
224 static void __noreturn kernel_thread_helper(void *arg, int (*fn)(void *))
229 long kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
233 memset(®s, 0, sizeof(regs));
235 regs.regs[4] = (unsigned long) arg;
236 regs.regs[5] = (unsigned long) fn;
237 regs.cp0_epc = (unsigned long) kernel_thread_helper;
238 regs.cp0_status = read_c0_status();
239 #if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX)
240 regs.cp0_status = (regs.cp0_status & ~(ST0_KUP | ST0_IEP | ST0_IEC)) |
241 ((regs.cp0_status & (ST0_KUC | ST0_IEC)) << 2);
243 regs.cp0_status |= ST0_EXL;
246 /* Ok, create the new process.. */
247 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, ®s, 0, NULL, NULL);
253 struct mips_frame_info {
255 unsigned long func_size;
260 static inline int is_ra_save_ins(union mips_instruction *ip)
262 /* sw / sd $ra, offset($sp) */
263 return (ip->i_format.opcode == sw_op || ip->i_format.opcode == sd_op) &&
264 ip->i_format.rs == 29 &&
265 ip->i_format.rt == 31;
268 static inline int is_jal_jalr_jr_ins(union mips_instruction *ip)
270 if (ip->j_format.opcode == jal_op)
272 if (ip->r_format.opcode != spec_op)
274 return ip->r_format.func == jalr_op || ip->r_format.func == jr_op;
277 static inline int is_sp_move_ins(union mips_instruction *ip)
279 /* addiu/daddiu sp,sp,-imm */
280 if (ip->i_format.rs != 29 || ip->i_format.rt != 29)
282 if (ip->i_format.opcode == addiu_op || ip->i_format.opcode == daddiu_op)
287 static int get_frame_info(struct mips_frame_info *info)
289 union mips_instruction *ip = info->func;
290 unsigned max_insns = info->func_size / sizeof(union mips_instruction);
293 info->pc_offset = -1;
294 info->frame_size = 0;
300 max_insns = 128U; /* unknown function size */
301 max_insns = min(128U, max_insns);
303 for (i = 0; i < max_insns; i++, ip++) {
305 if (is_jal_jalr_jr_ins(ip))
307 if (!info->frame_size) {
308 if (is_sp_move_ins(ip))
309 info->frame_size = - ip->i_format.simmediate;
312 if (info->pc_offset == -1 && is_ra_save_ins(ip)) {
314 ip->i_format.simmediate / sizeof(long);
318 if (info->frame_size && info->pc_offset >= 0) /* nested */
320 if (info->pc_offset < 0) /* leaf */
322 /* prologue seems boggus... */
327 static struct mips_frame_info schedule_mfi __read_mostly;
329 static int __init frame_info_init(void)
331 unsigned long size = 0;
332 #ifdef CONFIG_KALLSYMS
335 kallsyms_lookup_size_offset((unsigned long)schedule, &size, &ofs);
337 schedule_mfi.func = schedule;
338 schedule_mfi.func_size = size;
340 get_frame_info(&schedule_mfi);
343 * Without schedule() frame info, result given by
344 * thread_saved_pc() and get_wchan() are not reliable.
346 if (schedule_mfi.pc_offset < 0)
347 printk("Can't analyze schedule() prologue at %p\n", schedule);
352 arch_initcall(frame_info_init);
355 * Return saved PC of a blocked thread.
357 unsigned long thread_saved_pc(struct task_struct *tsk)
359 struct thread_struct *t = &tsk->thread;
361 /* New born processes are a special case */
362 if (t->reg31 == (unsigned long) ret_from_fork)
364 if (schedule_mfi.pc_offset < 0)
366 return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
370 #ifdef CONFIG_KALLSYMS
371 /* used by show_backtrace() */
372 unsigned long unwind_stack(struct task_struct *task, unsigned long *sp,
373 unsigned long pc, unsigned long *ra)
375 unsigned long stack_page;
376 struct mips_frame_info info;
377 unsigned long size, ofs;
379 extern void ret_from_irq(void);
380 extern void ret_from_exception(void);
382 stack_page = (unsigned long)task_stack_page(task);
387 * If we reached the bottom of interrupt context,
388 * return saved pc in pt_regs.
390 if (pc == (unsigned long)ret_from_irq ||
391 pc == (unsigned long)ret_from_exception) {
392 struct pt_regs *regs;
393 if (*sp >= stack_page &&
394 *sp + sizeof(*regs) <= stack_page + THREAD_SIZE - 32) {
395 regs = (struct pt_regs *)*sp;
397 if (__kernel_text_address(pc)) {
398 *sp = regs->regs[29];
399 *ra = regs->regs[31];
405 if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
408 * Return ra if an exception occured at the first instruction
410 if (unlikely(ofs == 0)) {
416 info.func = (void *)(pc - ofs);
417 info.func_size = ofs; /* analyze from start to ofs */
418 leaf = get_frame_info(&info);
422 if (*sp < stack_page ||
423 *sp + info.frame_size > stack_page + THREAD_SIZE - 32)
428 * For some extreme cases, get_frame_info() can
429 * consider wrongly a nested function as a leaf
430 * one. In that cases avoid to return always the
433 pc = pc != *ra ? *ra : 0;
435 pc = ((unsigned long *)(*sp))[info.pc_offset];
437 *sp += info.frame_size;
439 return __kernel_text_address(pc) ? pc : 0;
444 * get_wchan - a maintenance nightmare^W^Wpain in the ass ...
446 unsigned long get_wchan(struct task_struct *task)
448 unsigned long pc = 0;
449 #ifdef CONFIG_KALLSYMS
451 unsigned long ra = 0;
454 if (!task || task == current || task->state == TASK_RUNNING)
456 if (!task_stack_page(task))
459 pc = thread_saved_pc(task);
461 #ifdef CONFIG_KALLSYMS
462 sp = task->thread.reg29 + schedule_mfi.frame_size;
464 while (in_sched_functions(pc))
465 pc = unwind_stack(task, &sp, pc, &ra);
473 * Don't forget that the stack pointer must be aligned on a 8 bytes
474 * boundary for 32-bits ABI and 16 bytes for 64-bits ABI.
476 unsigned long arch_align_stack(unsigned long sp)
478 if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
479 sp -= get_random_int() & ~PAGE_MASK;