process.c 10.6 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 14 15 16 17 18 19 20 21 22 23 24 25 26
 * Copyright (C) 1999, 2000 Silicon Graphics, Inc.
 * Copyright (C) 2004 Thiemo Seufer
 */
#include <linux/errno.h>
#include <linux/module.h>
#include <linux/sched.h>
#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/a.out.h>
#include <linux/init.h>
#include <linux/completion.h>
27
#include <linux/kallsyms.h>
L
Linus Torvalds 已提交
28 29 30

#include <asm/bootinfo.h>
#include <asm/cpu.h>
31
#include <asm/dsp.h>
L
Linus Torvalds 已提交
32 33 34 35 36 37 38 39 40 41
#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>
42
#include <asm/stacktrace.h>
L
Linus Torvalds 已提交
43 44 45 46 47 48 49 50 51 52

/*
 * 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)
 */
ATTRIB_NORET void cpu_idle(void)
{
	/* endless idle loop with no priority at all */
	while (1) {
53 54
		while (!need_resched()) {
#ifdef CONFIG_MIPS_MT_SMTC
55 56
			extern void smtc_idle_loop_hook(void);

57 58
			smtc_idle_loop_hook();
#endif /* CONFIG_MIPS_MT_SMTC */
L
Linus Torvalds 已提交
59 60
			if (cpu_wait)
				(*cpu_wait)();
61
		}
62
		preempt_enable_no_resched();
L
Linus Torvalds 已提交
63
		schedule();
64
		preempt_disable();
L
Linus Torvalds 已提交
65 66 67 68 69 70 71 72 73 74 75
	}
}

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. */
	status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|KU_MASK);
76
#ifdef CONFIG_64BIT
L
Linus Torvalds 已提交
77 78 79 80 81 82
	status &= ~ST0_FR;
	status |= (current->thread.mflags & MF_32BIT_REGS) ? 0 : ST0_FR;
#endif
	status |= KU_USER;
	regs->cp0_status = status;
	clear_used_math();
83
	clear_fpu_owner();
84 85
	if (cpu_has_dsp)
		__init_dsp();
L
Linus Torvalds 已提交
86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101
	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 已提交
102
	struct thread_info *ti = task_thread_info(p);
L
Linus Torvalds 已提交
103 104
	struct pt_regs *childregs;
	long childksp;
R
Ralf Baechle 已提交
105
	p->set_child_tid = p->clear_child_tid = NULL;
L
Linus Torvalds 已提交
106

A
Al Viro 已提交
107
	childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
L
Linus Torvalds 已提交
108 109 110

	preempt_disable();

111
	if (is_fpu_owner())
L
Linus Torvalds 已提交
112
		save_fp(p);
113 114 115

	if (cpu_has_dsp)
		save_dsp(p);
L
Linus Torvalds 已提交
116 117 118 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 148 149 150 151 152

	preempt_enable();

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

#if defined(CONFIG_BINFMT_IRIX)
	if (current->personality != PER_LINUX) {
		/* Under IRIX things are a little different. */
		childregs->regs[3] = 1;
		regs->regs[3] = 0;
	}
#endif
	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);
	clear_tsk_thread_flag(p, TIF_USEDFPU);

R
Ralf Baechle 已提交
153 154 155 156 157 158 159 160 161 162 163
#ifdef CONFIG_MIPS_MT_FPAFF
	/*
	 * FPU affinity support is cleaner if we track the
	 * user-visible CPU affinity from the very beginning.
	 * The generic cpus_allowed mask will already have
	 * been copied from the parent before copy_thread
	 * is invoked.
	 */
	p->thread.user_cpus_allowed = p->cpus_allowed;
#endif /* CONFIG_MIPS_MT_FPAFF */

R
Ralf Baechle 已提交
164 165 166
	if (clone_flags & CLONE_SETTLS)
		ti->tp_value = regs->regs[7];

L
Linus Torvalds 已提交
167 168 169 170 171 172 173 174 175 176 177
	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;
}

178
void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs)
L
Linus Torvalds 已提交
179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199
{
	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
}

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

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

	return 1;
}

/*
 * Create a kernel thread
 */
216
static ATTRIB_NORET void kernel_thread_helper(void *arg, int (*fn)(void *))
L
Linus Torvalds 已提交
217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
{
	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)
	regs.cp0_status &= ~(ST0_KUP | ST0_IEC);
	regs.cp0_status |= ST0_IEP;
#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);
}

242 243 244 245 246 247 248 249 250
/*
 *
 */
struct mips_frame_info {
	void		*func;
	unsigned long	func_size;
	int		frame_size;
	int		pc_offset;
};
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 276 277 278
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;
}

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

L
Linus Torvalds 已提交
285
	info->pc_offset = -1;
286
	info->frame_size = 0;
L
Linus Torvalds 已提交
287

288 289 290 291 292 293 294
	if (!ip)
		goto err;

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

295 296 297
	for (i = 0; i < max_insns; i++, ip++) {

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

319 320
static struct mips_frame_info schedule_mfi __read_mostly;

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

327
	kallsyms_lookup_size_offset((unsigned long)schedule, &size, &ofs);
328
#endif
329 330 331 332
	schedule_mfi.func = schedule;
	schedule_mfi.func_size = size;

	get_frame_info(&schedule_mfi);
333 334 335 336 337

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

L
Linus Torvalds 已提交
341 342 343 344 345 346 347 348 349 350 351 352 353 354 355
	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;
356
	if (schedule_mfi.pc_offset < 0)
L
Linus Torvalds 已提交
357
		return 0;
358
	return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
L
Linus Torvalds 已提交
359 360 361
}


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

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

378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396
	/*
	 * 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;
	}
397
	if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
398
		return 0;
399 400 401
	/*
	 * Return ra if an exception occured at the first instruction
	 */
402 403 404 405 406
	if (unlikely(ofs == 0)) {
		pc = *ra;
		*ra = 0;
		return pc;
	}
407 408 409

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

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

F
Franck Bui-Huu 已提交
418 419 420 421 422 423 424
	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.
		 */
425
		pc = pc != *ra ? *ra : 0;
F
Franck Bui-Huu 已提交
426 427 428 429
	else
		pc = ((unsigned long *)(*sp))[info.pc_offset];

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

/*
 * 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;
443
	unsigned long ra = 0;
444 445 446 447 448 449 450 451 452 453 454 455 456
#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))
457
		pc = unwind_stack(task, &sp, pc, &ra);
458 459 460 461 462
#endif

out:
	return pc;
}