process.c 10.7 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6
/*
 * This file is subject to the terms and conditions of the GNU General Public
 * License.  See the file "COPYING" in the main directory of this archive
 * for more details.
 *
 * Copyright (C) 1994 - 1999, 2000 by Ralf Baechle and others.
7
 * Copyright (C) 2005, 2006 by Ralf Baechle (ralf@linux-mips.org)
L
Linus Torvalds 已提交
8 9 10 11 12 13
 * Copyright (C) 1999, 2000 Silicon Graphics, Inc.
 * Copyright (C) 2004 Thiemo Seufer
 */
#include <linux/errno.h>
#include <linux/module.h>
#include <linux/sched.h>
14
#include <linux/tick.h>
L
Linus Torvalds 已提交
15 16 17 18 19 20 21 22 23 24 25 26
#include <linux/kernel.h>
#include <linux/mm.h>
#include <linux/stddef.h>
#include <linux/unistd.h>
#include <linux/ptrace.h>
#include <linux/slab.h>
#include <linux/mman.h>
#include <linux/personality.h>
#include <linux/sys.h>
#include <linux/user.h>
#include <linux/init.h>
#include <linux/completion.h>
27
#include <linux/kallsyms.h>
28
#include <linux/random.h>
L
Linus Torvalds 已提交
29

30
#include <asm/asm.h>
L
Linus Torvalds 已提交
31 32
#include <asm/bootinfo.h>
#include <asm/cpu.h>
33
#include <asm/dsp.h>
L
Linus Torvalds 已提交
34 35 36 37 38 39 40 41 42 43
#include <asm/fpu.h>
#include <asm/pgtable.h>
#include <asm/system.h>
#include <asm/mipsregs.h>
#include <asm/processor.h>
#include <asm/uaccess.h>
#include <asm/io.h>
#include <asm/elf.h>
#include <asm/isadep.h>
#include <asm/inst.h>
44
#include <asm/stacktrace.h>
L
Linus Torvalds 已提交
45 46 47 48 49 50

/*
 * The idle thread. There's no useful work to be done, so just try to conserve
 * power and have a low exit latency (ie sit in a loop waiting for somebody to
 * say that they'd like to reschedule)
 */
51
void __noreturn cpu_idle(void)
L
Linus Torvalds 已提交
52 53 54
{
	/* endless idle loop with no priority at all */
	while (1) {
55
		tick_nohz_stop_sched_tick(1);
56
		while (!need_resched()) {
57
#ifdef CONFIG_MIPS_MT_SMTC
58 59
			extern void smtc_idle_loop_hook(void);

60
			smtc_idle_loop_hook();
61
#endif
L
Linus Torvalds 已提交
62 63
			if (cpu_wait)
				(*cpu_wait)();
64
		}
65
		tick_nohz_restart_sched_tick();
66
		preempt_enable_no_resched();
L
Linus Torvalds 已提交
67
		schedule();
68
		preempt_disable();
L
Linus Torvalds 已提交
69 70 71 72 73 74 75 76 77 78
	}
}

asmlinkage void ret_from_fork(void);

void start_thread(struct pt_regs * regs, unsigned long pc, unsigned long sp)
{
	unsigned long status;

	/* New thread loses kernel privileges. */
79
	status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|ST0_FR|KU_MASK);
80
#ifdef CONFIG_64BIT
81
	status |= test_thread_flag(TIF_32BIT_REGS) ? 0 : ST0_FR;
L
Linus Torvalds 已提交
82 83 84 85
#endif
	status |= KU_USER;
	regs->cp0_status = status;
	clear_used_math();
86
	clear_fpu_owner();
87 88
	if (cpu_has_dsp)
		__init_dsp();
L
Linus Torvalds 已提交
89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104
	regs->cp0_epc = pc;
	regs->regs[29] = sp;
	current_thread_info()->addr_limit = USER_DS;
}

void exit_thread(void)
{
}

void flush_thread(void)
{
}

int copy_thread(int nr, unsigned long clone_flags, unsigned long usp,
	unsigned long unused, struct task_struct *p, struct pt_regs *regs)
{
A
Al Viro 已提交
105
	struct thread_info *ti = task_thread_info(p);
L
Linus Torvalds 已提交
106 107
	struct pt_regs *childregs;
	long childksp;
R
Ralf Baechle 已提交
108
	p->set_child_tid = p->clear_child_tid = NULL;
L
Linus Torvalds 已提交
109

A
Al Viro 已提交
110
	childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
L
Linus Torvalds 已提交
111 112 113

	preempt_disable();

114
	if (is_fpu_owner())
L
Linus Torvalds 已提交
115
		save_fp(p);
116 117 118

	if (cpu_has_dsp)
		save_dsp(p);
L
Linus Torvalds 已提交
119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147

	preempt_enable();

	/* set up new TSS. */
	childregs = (struct pt_regs *) childksp - 1;
	*childregs = *regs;
	childregs->regs[7] = 0;	/* Clear error flag */

	childregs->regs[2] = 0;	/* Child gets zero as return value */
	regs->regs[2] = p->pid;

	if (childregs->cp0_status & ST0_CU0) {
		childregs->regs[28] = (unsigned long) ti;
		childregs->regs[29] = childksp;
		ti->addr_limit = KERNEL_DS;
	} else {
		childregs->regs[29] = usp;
		ti->addr_limit = USER_DS;
	}
	p->thread.reg29 = (unsigned long) childregs;
	p->thread.reg31 = (unsigned long) ret_from_fork;

	/*
	 * New tasks lose permission to use the fpu. This accelerates context
	 * switching for most programs since they don't use the fpu.
	 */
	p->thread.cp0_status = read_c0_status() & ~(ST0_CU2|ST0_CU1);
	childregs->cp0_status &= ~(ST0_CU2|ST0_CU1);

148
#ifdef CONFIG_MIPS_MT_SMTC
R
Ralf Baechle 已提交
149
	/*
150 151
	 * SMTC restores TCStatus after Status, and the CU bits
	 * are aliased there.
R
Ralf Baechle 已提交
152
	 */
153 154
	childregs->cp0_tcstatus &= ~(ST0_CU2|ST0_CU1);
#endif
L
Linus Torvalds 已提交
155 156
	clear_tsk_thread_flag(p, TIF_USEDFPU);

R
Ralf Baechle 已提交
157
#ifdef CONFIG_MIPS_MT_FPAFF
158
	clear_tsk_thread_flag(p, TIF_FPUBOUND);
R
Ralf Baechle 已提交
159 160
#endif /* CONFIG_MIPS_MT_FPAFF */

R
Ralf Baechle 已提交
161 162 163
	if (clone_flags & CLONE_SETTLS)
		ti->tp_value = regs->regs[7];

L
Linus Torvalds 已提交
164 165 166 167 168 169 170 171 172 173 174
	return 0;
}

/* Fill in the fpu structure for a core dump.. */
int dump_fpu(struct pt_regs *regs, elf_fpregset_t *r)
{
	memcpy(r, &current->thread.fpu, sizeof(current->thread.fpu));

	return 1;
}

175
void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs)
L
Linus Torvalds 已提交
176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196
{
	int i;

	for (i = 0; i < EF_R0; i++)
		gp[i] = 0;
	gp[EF_R0] = 0;
	for (i = 1; i <= 31; i++)
		gp[EF_R0 + i] = regs->regs[i];
	gp[EF_R26] = 0;
	gp[EF_R27] = 0;
	gp[EF_LO] = regs->lo;
	gp[EF_HI] = regs->hi;
	gp[EF_CP0_EPC] = regs->cp0_epc;
	gp[EF_CP0_BADVADDR] = regs->cp0_badvaddr;
	gp[EF_CP0_STATUS] = regs->cp0_status;
	gp[EF_CP0_CAUSE] = regs->cp0_cause;
#ifdef EF_UNUSED0
	gp[EF_UNUSED0] = 0;
#endif
}

197
int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
R
Ralf Baechle 已提交
198
{
A
Al Viro 已提交
199
	elf_dump_regs(*regs, task_pt_regs(tsk));
R
Ralf Baechle 已提交
200 201 202
	return 1;
}

203
int dump_task_fpu(struct task_struct *t, elf_fpregset_t *fpr)
L
Linus Torvalds 已提交
204 205 206 207 208 209 210 211 212
{
	memcpy(fpr, &t->thread.fpu, sizeof(current->thread.fpu));

	return 1;
}

/*
 * Create a kernel thread
 */
213
static void __noreturn kernel_thread_helper(void *arg, int (*fn)(void *))
L
Linus Torvalds 已提交
214 215 216 217 218 219 220 221 222 223 224 225 226 227 228
{
	do_exit(fn(arg));
}

long kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
{
	struct pt_regs regs;

	memset(&regs, 0, sizeof(regs));

	regs.regs[4] = (unsigned long) arg;
	regs.regs[5] = (unsigned long) fn;
	regs.cp0_epc = (unsigned long) kernel_thread_helper;
	regs.cp0_status = read_c0_status();
#if defined(CONFIG_CPU_R3000) || defined(CONFIG_CPU_TX39XX)
229 230
	regs.cp0_status = (regs.cp0_status & ~(ST0_KUP | ST0_IEP | ST0_IEC)) |
			  ((regs.cp0_status & (ST0_KUC | ST0_IEC)) << 2);
L
Linus Torvalds 已提交
231 232 233 234 235 236 237 238
#else
	regs.cp0_status |= ST0_EXL;
#endif

	/* Ok, create the new process.. */
	return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
}

239 240 241 242 243 244 245 246 247
/*
 *
 */
struct mips_frame_info {
	void		*func;
	unsigned long	func_size;
	int		frame_size;
	int		pc_offset;
};
248

249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275
static inline int is_ra_save_ins(union mips_instruction *ip)
{
	/* sw / sd $ra, offset($sp) */
	return (ip->i_format.opcode == sw_op || ip->i_format.opcode == sd_op) &&
		ip->i_format.rs == 29 &&
		ip->i_format.rt == 31;
}

static inline int is_jal_jalr_jr_ins(union mips_instruction *ip)
{
	if (ip->j_format.opcode == jal_op)
		return 1;
	if (ip->r_format.opcode != spec_op)
		return 0;
	return ip->r_format.func == jalr_op || ip->r_format.func == jr_op;
}

static inline int is_sp_move_ins(union mips_instruction *ip)
{
	/* addiu/daddiu sp,sp,-imm */
	if (ip->i_format.rs != 29 || ip->i_format.rt != 29)
		return 0;
	if (ip->i_format.opcode == addiu_op || ip->i_format.opcode == daddiu_op)
		return 1;
	return 0;
}

276
static int get_frame_info(struct mips_frame_info *info)
L
Linus Torvalds 已提交
277
{
278
	union mips_instruction *ip = info->func;
279 280
	unsigned max_insns = info->func_size / sizeof(union mips_instruction);
	unsigned i;
281

L
Linus Torvalds 已提交
282
	info->pc_offset = -1;
283
	info->frame_size = 0;
L
Linus Torvalds 已提交
284

285 286 287 288 289 290 291
	if (!ip)
		goto err;

	if (max_insns == 0)
		max_insns = 128U;	/* unknown function size */
	max_insns = min(128U, max_insns);

292 293 294
	for (i = 0; i < max_insns; i++, ip++) {

		if (is_jal_jalr_jr_ins(ip))
295
			break;
296 297 298 299
		if (!info->frame_size) {
			if (is_sp_move_ins(ip))
				info->frame_size = - ip->i_format.simmediate;
			continue;
300
		}
301
		if (info->pc_offset == -1 && is_ra_save_ins(ip)) {
302 303
			info->pc_offset =
				ip->i_format.simmediate / sizeof(long);
304
			break;
L
Linus Torvalds 已提交
305 306
		}
	}
307 308 309 310 311
	if (info->frame_size && info->pc_offset >= 0) /* nested */
		return 0;
	if (info->pc_offset < 0) /* leaf */
		return 1;
	/* prologue seems boggus... */
312
err:
313
	return -1;
L
Linus Torvalds 已提交
314 315
}

316 317
static struct mips_frame_info schedule_mfi __read_mostly;

L
Linus Torvalds 已提交
318 319
static int __init frame_info_init(void)
{
320
	unsigned long size = 0;
321
#ifdef CONFIG_KALLSYMS
322 323
	unsigned long ofs;

324
	kallsyms_lookup_size_offset((unsigned long)schedule, &size, &ofs);
325
#endif
326 327 328 329
	schedule_mfi.func = schedule;
	schedule_mfi.func_size = size;

	get_frame_info(&schedule_mfi);
330 331 332 333 334

	/*
	 * Without schedule() frame info, result given by
	 * thread_saved_pc() and get_wchan() are not reliable.
	 */
335
	if (schedule_mfi.pc_offset < 0)
336
		printk("Can't analyze schedule() prologue at %p\n", schedule);
337

L
Linus Torvalds 已提交
338 339 340 341 342 343 344 345 346 347 348 349 350 351 352
	return 0;
}

arch_initcall(frame_info_init);

/*
 * Return saved PC of a blocked thread.
 */
unsigned long thread_saved_pc(struct task_struct *tsk)
{
	struct thread_struct *t = &tsk->thread;

	/* New born processes are a special case */
	if (t->reg31 == (unsigned long) ret_from_fork)
		return t->reg31;
353
	if (schedule_mfi.pc_offset < 0)
L
Linus Torvalds 已提交
354
		return 0;
355
	return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
L
Linus Torvalds 已提交
356 357 358
}


359
#ifdef CONFIG_KALLSYMS
F
Franck Bui-Huu 已提交
360 361
/* used by show_backtrace() */
unsigned long unwind_stack(struct task_struct *task, unsigned long *sp,
362
			   unsigned long pc, unsigned long *ra)
363 364 365 366
{
	unsigned long stack_page;
	struct mips_frame_info info;
	unsigned long size, ofs;
F
Franck Bui-Huu 已提交
367
	int leaf;
368 369
	extern void ret_from_irq(void);
	extern void ret_from_exception(void);
370 371 372 373 374

	stack_page = (unsigned long)task_stack_page(task);
	if (!stack_page)
		return 0;

375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393
	/*
	 * If we reached the bottom of interrupt context,
	 * return saved pc in pt_regs.
	 */
	if (pc == (unsigned long)ret_from_irq ||
	    pc == (unsigned long)ret_from_exception) {
		struct pt_regs *regs;
		if (*sp >= stack_page &&
		    *sp + sizeof(*regs) <= stack_page + THREAD_SIZE - 32) {
			regs = (struct pt_regs *)*sp;
			pc = regs->cp0_epc;
			if (__kernel_text_address(pc)) {
				*sp = regs->regs[29];
				*ra = regs->regs[31];
				return pc;
			}
		}
		return 0;
	}
394
	if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
395
		return 0;
396 397 398
	/*
	 * Return ra if an exception occured at the first instruction
	 */
399 400 401 402 403
	if (unlikely(ofs == 0)) {
		pc = *ra;
		*ra = 0;
		return pc;
	}
404 405 406

	info.func = (void *)(pc - ofs);
	info.func_size = ofs;	/* analyze from start to ofs */
F
Franck Bui-Huu 已提交
407 408
	leaf = get_frame_info(&info);
	if (leaf < 0)
409
		return 0;
F
Franck Bui-Huu 已提交
410 411 412

	if (*sp < stack_page ||
	    *sp + info.frame_size > stack_page + THREAD_SIZE - 32)
413 414
		return 0;

F
Franck Bui-Huu 已提交
415 416 417 418 419 420 421
	if (leaf)
		/*
		 * For some extreme cases, get_frame_info() can
		 * consider wrongly a nested function as a leaf
		 * one. In that cases avoid to return always the
		 * same value.
		 */
422
		pc = pc != *ra ? *ra : 0;
F
Franck Bui-Huu 已提交
423 424 425 426
	else
		pc = ((unsigned long *)(*sp))[info.pc_offset];

	*sp += info.frame_size;
427
	*ra = 0;
F
Franck Bui-Huu 已提交
428
	return __kernel_text_address(pc) ? pc : 0;
429 430
}
#endif
431 432 433 434 435 436 437 438 439

/*
 * get_wchan - a maintenance nightmare^W^Wpain in the ass ...
 */
unsigned long get_wchan(struct task_struct *task)
{
	unsigned long pc = 0;
#ifdef CONFIG_KALLSYMS
	unsigned long sp;
440
	unsigned long ra = 0;
441 442 443 444 445 446 447 448 449 450 451 452 453
#endif

	if (!task || task == current || task->state == TASK_RUNNING)
		goto out;
	if (!task_stack_page(task))
		goto out;

	pc = thread_saved_pc(task);

#ifdef CONFIG_KALLSYMS
	sp = task->thread.reg29 + schedule_mfi.frame_size;

	while (in_sched_functions(pc))
454
		pc = unwind_stack(task, &sp, pc, &ra);
455 456 457 458 459
#endif

out:
	return pc;
}
460 461 462 463 464 465 466 467 468 469 470 471

/*
 * Don't forget that the stack pointer must be aligned on a 8 bytes
 * boundary for 32-bits ABI and 16 bytes for 64-bits ABI.
 */
unsigned long arch_align_stack(unsigned long sp)
{
	if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
		sp -= get_random_int() & ~PAGE_MASK;

	return sp & ALMASK;
}