process.c 11.0 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 55 56 57
	int cpu;

	/* CPU is going idle. */
	cpu = smp_processor_id();

L
Linus Torvalds 已提交
58 59
	/* endless idle loop with no priority at all */
	while (1) {
60
		tick_nohz_stop_sched_tick(1);
61
		while (!need_resched() && cpu_online(cpu)) {
62
#ifdef CONFIG_MIPS_MT_SMTC
63 64
			extern void smtc_idle_loop_hook(void);

65
			smtc_idle_loop_hook();
66
#endif
L
Linus Torvalds 已提交
67 68
			if (cpu_wait)
				(*cpu_wait)();
69
		}
70 71 72 73 74 75
#ifdef CONFIG_HOTPLUG_CPU
		if (!cpu_online(cpu) && !cpu_isset(cpu, cpu_callin_map) &&
		    (system_state == SYSTEM_RUNNING ||
		     system_state == SYSTEM_BOOTING))
			play_dead();
#endif
76
		tick_nohz_restart_sched_tick();
77
		preempt_enable_no_resched();
L
Linus Torvalds 已提交
78
		schedule();
79
		preempt_disable();
L
Linus Torvalds 已提交
80 81 82 83 84 85 86 87 88 89
	}
}

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. */
90
	status = regs->cp0_status & ~(ST0_CU0|ST0_CU1|ST0_FR|KU_MASK);
91
#ifdef CONFIG_64BIT
92
	status |= test_thread_flag(TIF_32BIT_REGS) ? 0 : ST0_FR;
L
Linus Torvalds 已提交
93 94 95 96
#endif
	status |= KU_USER;
	regs->cp0_status = status;
	clear_used_math();
97
	clear_fpu_owner();
98 99
	if (cpu_has_dsp)
		__init_dsp();
L
Linus Torvalds 已提交
100 101 102 103 104 105 106 107 108 109 110 111 112
	regs->cp0_epc = pc;
	regs->regs[29] = sp;
	current_thread_info()->addr_limit = USER_DS;
}

void exit_thread(void)
{
}

void flush_thread(void)
{
}

A
Alexey Dobriyan 已提交
113
int copy_thread(unsigned long clone_flags, unsigned long usp,
L
Linus Torvalds 已提交
114 115
	unsigned long unused, struct task_struct *p, struct pt_regs *regs)
{
A
Al Viro 已提交
116
	struct thread_info *ti = task_thread_info(p);
L
Linus Torvalds 已提交
117 118
	struct pt_regs *childregs;
	long childksp;
R
Ralf Baechle 已提交
119
	p->set_child_tid = p->clear_child_tid = NULL;
L
Linus Torvalds 已提交
120

A
Al Viro 已提交
121
	childksp = (unsigned long)task_stack_page(p) + THREAD_SIZE - 32;
L
Linus Torvalds 已提交
122 123 124

	preempt_disable();

125
	if (is_fpu_owner())
L
Linus Torvalds 已提交
126
		save_fp(p);
127 128 129

	if (cpu_has_dsp)
		save_dsp(p);
L
Linus Torvalds 已提交
130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158

	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);

159
#ifdef CONFIG_MIPS_MT_SMTC
R
Ralf Baechle 已提交
160
	/*
161 162
	 * SMTC restores TCStatus after Status, and the CU bits
	 * are aliased there.
R
Ralf Baechle 已提交
163
	 */
164 165
	childregs->cp0_tcstatus &= ~(ST0_CU2|ST0_CU1);
#endif
L
Linus Torvalds 已提交
166 167
	clear_tsk_thread_flag(p, TIF_USEDFPU);

R
Ralf Baechle 已提交
168
#ifdef CONFIG_MIPS_MT_FPAFF
169
	clear_tsk_thread_flag(p, TIF_FPUBOUND);
R
Ralf Baechle 已提交
170 171
#endif /* CONFIG_MIPS_MT_FPAFF */

R
Ralf Baechle 已提交
172 173 174
	if (clone_flags & CLONE_SETTLS)
		ti->tp_value = regs->regs[7];

L
Linus Torvalds 已提交
175 176 177 178 179 180 181 182 183 184 185
	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;
}

186
void elf_dump_regs(elf_greg_t *gp, struct pt_regs *regs)
L
Linus Torvalds 已提交
187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207
{
	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
}

208
int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
R
Ralf Baechle 已提交
209
{
A
Al Viro 已提交
210
	elf_dump_regs(*regs, task_pt_regs(tsk));
R
Ralf Baechle 已提交
211 212 213
	return 1;
}

214
int dump_task_fpu(struct task_struct *t, elf_fpregset_t *fpr)
L
Linus Torvalds 已提交
215 216 217 218 219 220 221 222 223
{
	memcpy(fpr, &t->thread.fpu, sizeof(current->thread.fpu));

	return 1;
}

/*
 * Create a kernel thread
 */
224
static void __noreturn kernel_thread_helper(void *arg, int (*fn)(void *))
L
Linus Torvalds 已提交
225 226 227 228 229 230 231 232 233 234 235 236 237 238 239
{
	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)
240 241
	regs.cp0_status = (regs.cp0_status & ~(ST0_KUP | ST0_IEP | ST0_IEC)) |
			  ((regs.cp0_status & (ST0_KUC | ST0_IEC)) << 2);
L
Linus Torvalds 已提交
242 243 244 245 246 247 248 249
#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);
}

250 251 252 253 254 255 256 257 258
/*
 *
 */
struct mips_frame_info {
	void		*func;
	unsigned long	func_size;
	int		frame_size;
	int		pc_offset;
};
259

260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286
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;
}

287
static int get_frame_info(struct mips_frame_info *info)
L
Linus Torvalds 已提交
288
{
289
	union mips_instruction *ip = info->func;
290 291
	unsigned max_insns = info->func_size / sizeof(union mips_instruction);
	unsigned i;
292

L
Linus Torvalds 已提交
293
	info->pc_offset = -1;
294
	info->frame_size = 0;
L
Linus Torvalds 已提交
295

296 297 298 299 300 301 302
	if (!ip)
		goto err;

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

303 304 305
	for (i = 0; i < max_insns; i++, ip++) {

		if (is_jal_jalr_jr_ins(ip))
306
			break;
307 308 309 310
		if (!info->frame_size) {
			if (is_sp_move_ins(ip))
				info->frame_size = - ip->i_format.simmediate;
			continue;
311
		}
312
		if (info->pc_offset == -1 && is_ra_save_ins(ip)) {
313 314
			info->pc_offset =
				ip->i_format.simmediate / sizeof(long);
315
			break;
L
Linus Torvalds 已提交
316 317
		}
	}
318 319 320 321 322
	if (info->frame_size && info->pc_offset >= 0) /* nested */
		return 0;
	if (info->pc_offset < 0) /* leaf */
		return 1;
	/* prologue seems boggus... */
323
err:
324
	return -1;
L
Linus Torvalds 已提交
325 326
}

327 328
static struct mips_frame_info schedule_mfi __read_mostly;

L
Linus Torvalds 已提交
329 330
static int __init frame_info_init(void)
{
331
	unsigned long size = 0;
332
#ifdef CONFIG_KALLSYMS
333 334
	unsigned long ofs;

335
	kallsyms_lookup_size_offset((unsigned long)schedule, &size, &ofs);
336
#endif
337 338 339 340
	schedule_mfi.func = schedule;
	schedule_mfi.func_size = size;

	get_frame_info(&schedule_mfi);
341 342 343 344 345

	/*
	 * Without schedule() frame info, result given by
	 * 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);
348

L
Linus Torvalds 已提交
349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
	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;
364
	if (schedule_mfi.pc_offset < 0)
L
Linus Torvalds 已提交
365
		return 0;
366
	return ((unsigned long *)t->reg29)[schedule_mfi.pc_offset];
L
Linus Torvalds 已提交
367 368 369
}


370
#ifdef CONFIG_KALLSYMS
F
Franck Bui-Huu 已提交
371 372
/* used by show_backtrace() */
unsigned long unwind_stack(struct task_struct *task, unsigned long *sp,
373
			   unsigned long pc, unsigned long *ra)
374 375 376 377
{
	unsigned long stack_page;
	struct mips_frame_info info;
	unsigned long size, ofs;
F
Franck Bui-Huu 已提交
378
	int leaf;
379 380
	extern void ret_from_irq(void);
	extern void ret_from_exception(void);
381 382 383 384 385

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

386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404
	/*
	 * 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;
	}
405
	if (!kallsyms_lookup_size_offset(pc, &size, &ofs))
406
		return 0;
407 408 409
	/*
	 * Return ra if an exception occured at the first instruction
	 */
410 411 412 413 414
	if (unlikely(ofs == 0)) {
		pc = *ra;
		*ra = 0;
		return pc;
	}
415 416 417

	info.func = (void *)(pc - ofs);
	info.func_size = ofs;	/* analyze from start to ofs */
F
Franck Bui-Huu 已提交
418 419
	leaf = get_frame_info(&info);
	if (leaf < 0)
420
		return 0;
F
Franck Bui-Huu 已提交
421 422 423

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

F
Franck Bui-Huu 已提交
426 427 428 429 430 431 432
	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.
		 */
433
		pc = pc != *ra ? *ra : 0;
F
Franck Bui-Huu 已提交
434 435 436 437
	else
		pc = ((unsigned long *)(*sp))[info.pc_offset];

	*sp += info.frame_size;
438
	*ra = 0;
F
Franck Bui-Huu 已提交
439
	return __kernel_text_address(pc) ? pc : 0;
440 441
}
#endif
442 443 444 445 446 447 448 449 450

/*
 * 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;
451
	unsigned long ra = 0;
452 453 454 455 456 457 458 459 460 461 462 463 464
#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))
465
		pc = unwind_stack(task, &sp, pc, &ra);
466 467 468 469 470
#endif

out:
	return pc;
}
471 472 473 474 475 476 477 478 479 480 481 482

/*
 * 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;
}