1 /* 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 4 * for more details. 5 * 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 10 */ 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> 16 #include <linux/mm.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/a.out.h> 26 #include <linux/init.h> 27 #include <linux/completion.h> 28 #include <linux/kallsyms.h> 29 #include <linux/random.h> 30 31 #include <asm/asm.h> 32 #include <asm/bootinfo.h> 33 #include <asm/cpu.h> 34 #include <asm/dsp.h> 35 #include <asm/fpu.h> 36 #include <asm/pgtable.h> 37 #include <asm/system.h> 38 #include <asm/mipsregs.h> 39 #include <asm/processor.h> 40 #include <asm/uaccess.h> 41 #include <asm/io.h> 42 #include <asm/elf.h> 43 #include <asm/isadep.h> 44 #include <asm/inst.h> 45 #include <asm/stacktrace.h> 46 47 /* 48 * The idle thread. There's no useful work to be done, so just try to conserve 49 * power and have a low exit latency (ie sit in a loop waiting for somebody to 50 * say that they'd like to reschedule) 51 */ 52 void __noreturn cpu_idle(void) 53 { 54 /* endless idle loop with no priority at all */ 55 while (1) { 56 tick_nohz_stop_sched_tick(1); 57 while (!need_resched()) { 58 #ifdef CONFIG_SMTC_IDLE_HOOK_DEBUG 59 extern void smtc_idle_loop_hook(void); 60 61 smtc_idle_loop_hook(); 62 #endif 63 if (cpu_wait) 64 (*cpu_wait)(); 65 } 66 tick_nohz_restart_sched_tick(); 67 preempt_enable_no_resched(); 68 schedule(); 69 preempt_disable(); 70 } 71 } 72 73 asmlinkage void ret_from_fork(void); 74 75 void start_thread(struct pt_regs * regs, unsigned long pc, unsigned long sp) 76 { 77 unsigned long status; 78 79 /* New thread loses kernel privileges. */ 80 status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|ST0_FR|KU_MASK); 81 #ifdef CONFIG_64BIT 82 status |= test_thread_flag(TIF_32BIT_REGS) ? 0 : ST0_FR; 83 #endif 84 status |= KU_USER; 85 regs->cp0_status = status; 86 clear_used_math(); 87 clear_fpu_owner(); 88 if (cpu_has_dsp) 89 __init_dsp(); 90 regs->cp0_epc = pc; 91 regs->regs[29] = sp; 92 current_thread_info()->addr_limit = USER_DS; 93 } 94 95 void exit_thread(void) 96 { 97 } 98 99 void flush_thread(void) 100 { 101 } 102 103 int copy_thread(int nr, unsigned long clone_flags, unsigned long usp, 104 unsigned long unused, struct task_struct *p, struct pt_regs *regs) 105 { 106 struct thread_info *ti = task_thread_info(p); 107 struct pt_regs *childregs; 108 long childksp; 109 p->set_child_tid = p->clear_child_tid = NULL; 110 111 childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32; 112 113 preempt_disable(); 114 115 if (is_fpu_owner()) 116 save_fp(p); 117 118 if (cpu_has_dsp) 119 save_dsp(p); 120 121 preempt_enable(); 122 123 /* set up new TSS. */ 124 childregs = (struct pt_regs *) childksp - 1; 125 *childregs = *regs; 126 childregs->regs[7] = 0; /* Clear error flag */ 127 128 childregs->regs[2] = 0; /* Child gets zero as return value */ 129 regs->regs[2] = p->pid; 130 131 if (childregs->cp0_status & ST0_CU0) { 132 childregs->regs[28] = (unsigned long) ti; 133 childregs->regs[29] = childksp; 134 ti->addr_limit = KERNEL_DS; 135 } else { 136 childregs->regs[29] = usp; 137 ti->addr_limit = USER_DS; 138 } 139 p->thread.reg29 = (unsigned long) childregs; 140 p->thread.reg31 = (unsigned long) ret_from_fork; 141 142 /* 143 * New tasks lose permission to use the fpu. This accelerates context 144 * switching for most programs since they don't use the fpu. 145 */ 146 p->thread.cp0_status = read_c0_status() & ~(ST0_CU2|ST0_CU1); 147 childregs->cp0_status &= ~(ST0_CU2|ST0_CU1); 148 clear_tsk_thread_flag(p, TIF_USEDFPU); 149 150 #ifdef CONFIG_MIPS_MT_FPAFF 151 clear_tsk_thread_flag(p, TIF_FPUBOUND); 152 153 /* 154 * FPU affinity support is cleaner if we track the 155 * user-visible CPU affinity from the very beginning. 156 * The generic cpus_allowed mask will already have 157 * been copied from the parent before copy_thread 158 * is invoked. 159 */ 160 p->thread.user_cpus_allowed = p->cpus_allowed; 161 #endif /* CONFIG_MIPS_MT_FPAFF */ 162 163 if (clone_flags & CLONE_SETTLS) 164 ti->tp_value = regs->regs[7]; 165 166 return 0; 167 } 168 169 /* Fill in the fpu structure for a core dump.. */ 170 int dump_fpu(struct pt_regs *regs, elf_fpregset_t *r) 171 { 172 memcpy(r, ¤t->thread.fpu, sizeof(current->thread.fpu)); 173 174 return 1; 175 } 176 177 void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs) 178 { 179 int i; 180 181 for (i = 0; i < EF_R0; i++) 182 gp[i] = 0; 183 gp[EF_R0] = 0; 184 for (i = 1; i <= 31; i++) 185 gp[EF_R0 + i] = regs->regs[i]; 186 gp[EF_R26] = 0; 187 gp[EF_R27] = 0; 188 gp[EF_LO] = regs->lo; 189 gp[EF_HI] = regs->hi; 190 gp[EF_CP0_EPC] = regs->cp0_epc; 191 gp[EF_CP0_BADVADDR] = regs->cp0_badvaddr; 192 gp[EF_CP0_STATUS] = regs->cp0_status; 193 gp[EF_CP0_CAUSE] = regs->cp0_cause; 194 #ifdef EF_UNUSED0 195 gp[EF_UNUSED0] = 0; 196 #endif 197 } 198 199 int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs) 200 { 201 elf_dump_regs(*regs, task_pt_regs(tsk)); 202 return 1; 203 } 204 205 int dump_task_fpu(struct task_struct *t, elf_fpregset_t *fpr) 206 { 207 memcpy(fpr, &t->thread.fpu, sizeof(current->thread.fpu)); 208 209 return 1; 210 } 211 212 /* 213 * Create a kernel thread 214 */ 215 static void __noreturn kernel_thread_helper(void *arg, int (*fn)(void *)) 216 { 217 do_exit(fn(arg)); 218 } 219 220 long kernel_thread(int (*fn)(void *), void *arg, unsigned long flags) 221 { 222 struct pt_regs regs; 223 224 memset(®s, 0, sizeof(regs)); 225 226 regs.regs[4] = (unsigned long) arg; 227 regs.regs[5] = (unsigned long) fn; 228 regs.cp0_epc = (unsigned long) kernel_thread_helper; 229 regs.cp0_status = read_c0_status(); 230 #if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX) 231 regs.cp0_status = (regs.cp0_status & ~(ST0_KUP | ST0_IEP | ST0_IEC)) | 232 ((regs.cp0_status & (ST0_KUC | ST0_IEC)) << 2); 233 #else 234 regs.cp0_status |= ST0_EXL; 235 #endif 236 237 /* Ok, create the new process.. */ 238 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, ®s, 0, NULL, NULL); 239 } 240 241 /* 242 * 243 */ 244 struct mips_frame_info { 245 void *func; 246 unsigned long func_size; 247 int frame_size; 248 int pc_offset; 249 }; 250 251 static inline int is_ra_save_ins(union mips_instruction *ip) 252 { 253 /* sw / sd $ra, offset($sp) */ 254 return (ip->i_format.opcode == sw_op || ip->i_format.opcode == sd_op) && 255 ip->i_format.rs == 29 && 256 ip->i_format.rt == 31; 257 } 258 259 static inline int is_jal_jalr_jr_ins(union mips_instruction *ip) 260 { 261 if (ip->j_format.opcode == jal_op) 262 return 1; 263 if (ip->r_format.opcode != spec_op) 264 return 0; 265 return ip->r_format.func == jalr_op || ip->r_format.func == jr_op; 266 } 267 268 static inline int is_sp_move_ins(union mips_instruction *ip) 269 { 270 /* addiu/daddiu sp,sp,-imm */ 271 if (ip->i_format.rs != 29 || ip->i_format.rt != 29) 272 return 0; 273 if (ip->i_format.opcode == addiu_op || ip->i_format.opcode == daddiu_op) 274 return 1; 275 return 0; 276 } 277 278 static int get_frame_info(struct mips_frame_info *info) 279 { 280 union mips_instruction *ip = info->func; 281 unsigned max_insns = info->func_size / sizeof(union mips_instruction); 282 unsigned i; 283 284 info->pc_offset = -1; 285 info->frame_size = 0; 286 287 if (!ip) 288 goto err; 289 290 if (max_insns == 0) 291 max_insns = 128U; /* unknown function size */ 292 max_insns = min(128U, max_insns); 293 294 for (i = 0; i < max_insns; i++, ip++) { 295 296 if (is_jal_jalr_jr_ins(ip)) 297 break; 298 if (!info->frame_size) { 299 if (is_sp_move_ins(ip)) 300 info->frame_size = - ip->i_format.simmediate; 301 continue; 302 } 303 if (info->pc_offset == -1 && is_ra_save_ins(ip)) { 304 info->pc_offset = 305 ip->i_format.simmediate / sizeof(long); 306 break; 307 } 308 } 309 if (info->frame_size && info->pc_offset >= 0) /* nested */ 310 return 0; 311 if (info->pc_offset < 0) /* leaf */ 312 return 1; 313 /* prologue seems boggus... */ 314 err: 315 return -1; 316 } 317 318 static struct mips_frame_info schedule_mfi __read_mostly; 319 320 static int __init frame_info_init(void) 321 { 322 unsigned long size = 0; 323 #ifdef CONFIG_KALLSYMS 324 unsigned long ofs; 325 326 kallsyms_lookup_size_offset((unsigned long)schedule, &size, &ofs); 327 #endif 328 schedule_mfi.func = schedule; 329 schedule_mfi.func_size = size; 330 331 get_frame_info(&schedule_mfi); 332 333 /* 334 * Without schedule() frame info, result given by 335 * thread_saved_pc() and get_wchan() are not reliable. 336 */ 337 if (schedule_mfi.pc_offset < 0) 338 printk("Can't analyze schedule() prologue at %p\n", schedule); 339 340 return 0; 341 } 342 343 arch_initcall(frame_info_init); 344 345 /* 346 * Return saved PC of a blocked thread. 347 */ 348 unsigned long thread_saved_pc(struct task_struct *tsk) 349 { 350 struct thread_struct *t = &tsk->thread; 351 352 /* New born processes are a special case */ 353 if (t->reg31 == (unsigned long) ret_from_fork) 354 return t->reg31; 355 if (schedule_mfi.pc_offset < 0) 356 return 0; 357 return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset]; 358 } 359 360 361 #ifdef CONFIG_KALLSYMS 362 /* used by show_backtrace() */ 363 unsigned long unwind_stack(struct task_struct *task, unsigned long *sp, 364 unsigned long pc, unsigned long *ra) 365 { 366 unsigned long stack_page; 367 struct mips_frame_info info; 368 unsigned long size, ofs; 369 int leaf; 370 extern void ret_from_irq(void); 371 extern void ret_from_exception(void); 372 373 stack_page = (unsigned long)task_stack_page(task); 374 if (!stack_page) 375 return 0; 376 377 /* 378 * If we reached the bottom of interrupt context, 379 * return saved pc in pt_regs. 380 */ 381 if (pc == (unsigned long)ret_from_irq || 382 pc == (unsigned long)ret_from_exception) { 383 struct pt_regs *regs; 384 if (*sp >= stack_page && 385 *sp + sizeof(*regs) <= stack_page + THREAD_SIZE - 32) { 386 regs = (struct pt_regs *)*sp; 387 pc = regs->cp0_epc; 388 if (__kernel_text_address(pc)) { 389 *sp = regs->regs[29]; 390 *ra = regs->regs[31]; 391 return pc; 392 } 393 } 394 return 0; 395 } 396 if (!kallsyms_lookup_size_offset(pc, &size, &ofs)) 397 return 0; 398 /* 399 * Return ra if an exception occured at the first instruction 400 */ 401 if (unlikely(ofs == 0)) { 402 pc = *ra; 403 *ra = 0; 404 return pc; 405 } 406 407 info.func = (void *)(pc - ofs); 408 info.func_size = ofs; /* analyze from start to ofs */ 409 leaf = get_frame_info(&info); 410 if (leaf < 0) 411 return 0; 412 413 if (*sp < stack_page || 414 *sp + info.frame_size > stack_page + THREAD_SIZE - 32) 415 return 0; 416 417 if (leaf) 418 /* 419 * For some extreme cases, get_frame_info() can 420 * consider wrongly a nested function as a leaf 421 * one. In that cases avoid to return always the 422 * same value. 423 */ 424 pc = pc != *ra ? *ra : 0; 425 else 426 pc = ((unsigned long *)(*sp))[info.pc_offset]; 427 428 *sp += info.frame_size; 429 *ra = 0; 430 return __kernel_text_address(pc) ? pc : 0; 431 } 432 #endif 433 434 /* 435 * get_wchan - a maintenance nightmare^W^Wpain in the ass ... 436 */ 437 unsigned long get_wchan(struct task_struct *task) 438 { 439 unsigned long pc = 0; 440 #ifdef CONFIG_KALLSYMS 441 unsigned long sp; 442 unsigned long ra = 0; 443 #endif 444 445 if (!task || task == current || task->state == TASK_RUNNING) 446 goto out; 447 if (!task_stack_page(task)) 448 goto out; 449 450 pc = thread_saved_pc(task); 451 452 #ifdef CONFIG_KALLSYMS 453 sp = task->thread.reg29 + schedule_mfi.frame_size; 454 455 while (in_sched_functions(pc)) 456 pc = unwind_stack(task, &sp, pc, &ra); 457 #endif 458 459 out: 460 return pc; 461 } 462 463 /* 464 * Don't forget that the stack pointer must be aligned on a 8 bytes 465 * boundary for 32-bits ABI and 16 bytes for 64-bits ABI. 466 */ 467 unsigned long arch_align_stack(unsigned long sp) 468 { 469 if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space) 470 sp -= get_random_int() & ~PAGE_MASK; 471 472 return sp & ALMASK; 473 } 474