blob: 631af167bc51c376c38571518799a38d0e77c6bf [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * Copyright (C) 1995 Linus Torvalds
3 *
4 * Pentium III FXSR, SSE support
5 * Gareth Hughes <gareth@valinux.com>, May 2000
6 */
7
8/*
9 * This file handles the architecture-dependent parts of process handling..
10 */
11
12#include <stdarg.h>
13
Zwane Mwaikambof3705132005-06-25 14:54:50 -070014#include <linux/cpu.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070015#include <linux/errno.h>
16#include <linux/sched.h>
17#include <linux/fs.h>
18#include <linux/kernel.h>
19#include <linux/mm.h>
20#include <linux/elfcore.h>
21#include <linux/smp.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include <linux/stddef.h>
23#include <linux/slab.h>
24#include <linux/vmalloc.h>
25#include <linux/user.h>
26#include <linux/a.out.h>
27#include <linux/interrupt.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070028#include <linux/utsname.h>
29#include <linux/delay.h>
30#include <linux/reboot.h>
31#include <linux/init.h>
32#include <linux/mc146818rtc.h>
33#include <linux/module.h>
34#include <linux/kallsyms.h>
35#include <linux/ptrace.h>
36#include <linux/random.h>
Andi Kleenc16b63e2006-09-26 10:52:28 +020037#include <linux/personality.h>
Ingo Molnar74167342007-02-16 01:28:07 -080038#include <linux/tick.h>
Jeremy Fitzhardinge7c3576d2007-05-02 19:27:16 +020039#include <linux/percpu.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070040
41#include <asm/uaccess.h>
42#include <asm/pgtable.h>
43#include <asm/system.h>
44#include <asm/io.h>
45#include <asm/ldt.h>
46#include <asm/processor.h>
47#include <asm/i387.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070048#include <asm/desc.h>
Matt Mackall64ca9002006-01-08 01:05:26 -080049#include <asm/vm86.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070050#ifdef CONFIG_MATH_EMULATION
51#include <asm/math_emu.h>
52#endif
53
Linus Torvalds1da177e2005-04-16 15:20:36 -070054#include <linux/err.h>
55
Zwane Mwaikambof3705132005-06-25 14:54:50 -070056#include <asm/tlbflush.h>
57#include <asm/cpu.h>
Thomas Gleixner718fc132008-01-30 13:30:17 +010058#include <asm/kdebug.h>
Zwane Mwaikambof3705132005-06-25 14:54:50 -070059
Linus Torvalds1da177e2005-04-16 15:20:36 -070060asmlinkage void ret_from_fork(void) __asm__("ret_from_fork");
61
62static int hlt_counter;
63
64unsigned long boot_option_idle_override = 0;
65EXPORT_SYMBOL(boot_option_idle_override);
66
Jeremy Fitzhardinge7c3576d2007-05-02 19:27:16 +020067DEFINE_PER_CPU(struct task_struct *, current_task) = &init_task;
68EXPORT_PER_CPU_SYMBOL(current_task);
69
70DEFINE_PER_CPU(int, cpu_number);
71EXPORT_PER_CPU_SYMBOL(cpu_number);
72
Linus Torvalds1da177e2005-04-16 15:20:36 -070073/*
74 * Return saved PC of a blocked thread.
75 */
76unsigned long thread_saved_pc(struct task_struct *tsk)
77{
78 return ((unsigned long *)tsk->thread.esp)[3];
79}
80
81/*
82 * Powermanagement idle function, if any..
83 */
84void (*pm_idle)(void);
Alexey Dobriyan129f6942005-06-23 00:08:33 -070085EXPORT_SYMBOL(pm_idle);
Linus Torvalds1da177e2005-04-16 15:20:36 -070086static DEFINE_PER_CPU(unsigned int, cpu_idle_state);
87
88void disable_hlt(void)
89{
90 hlt_counter++;
91}
92
93EXPORT_SYMBOL(disable_hlt);
94
95void enable_hlt(void)
96{
97 hlt_counter--;
98}
99
100EXPORT_SYMBOL(enable_hlt);
101
102/*
103 * We use this if we don't have any better
104 * idle routine..
105 */
106void default_idle(void)
107{
108 if (!hlt_counter && boot_cpu_data.hlt_works_ok) {
Andi Kleen495ab9c2006-06-26 13:59:11 +0200109 current_thread_info()->status &= ~TS_POLLING;
Ingo Molnar0888f062006-12-22 01:11:56 -0800110 /*
111 * TS_POLLING-cleared state must be visible before we
112 * test NEED_RESCHED:
113 */
114 smp_mb();
115
Andi Kleen72690a22006-12-07 02:14:03 +0100116 local_irq_disable();
Ingo Molnar5ee613b2008-01-30 13:30:06 +0100117 if (!need_resched()) {
118 ktime_t t0, t1;
119 u64 t0n, t1n;
120
121 t0 = ktime_get();
122 t0n = ktime_to_ns(t0);
Andi Kleen72690a22006-12-07 02:14:03 +0100123 safe_halt(); /* enables interrupts racelessly */
Ingo Molnar5ee613b2008-01-30 13:30:06 +0100124 local_irq_disable();
125 t1 = ktime_get();
126 t1n = ktime_to_ns(t1);
127 sched_clock_idle_wakeup_event(t1n - t0n);
128 }
129 local_irq_enable();
Andi Kleen495ab9c2006-06-26 13:59:11 +0200130 current_thread_info()->status |= TS_POLLING;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131 } else {
Andi Kleen72690a22006-12-07 02:14:03 +0100132 /* loop is done by the caller */
133 cpu_relax();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700134 }
135}
Alexey Dobriyan129f6942005-06-23 00:08:33 -0700136#ifdef CONFIG_APM_MODULE
137EXPORT_SYMBOL(default_idle);
138#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139
140/*
141 * On SMP it's slightly faster (but much more power-consuming!)
142 * to poll the ->work.need_resched flag instead of waiting for the
143 * cross-CPU IPI to arrive. Use this option with caution.
144 */
145static void poll_idle (void)
146{
Andi Kleen72690a22006-12-07 02:14:03 +0100147 cpu_relax();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148}
149
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700150#ifdef CONFIG_HOTPLUG_CPU
151#include <asm/nmi.h>
152/* We don't actually take CPU down, just spin without interrupts. */
153static inline void play_dead(void)
154{
Li Shaohuae1367da2005-06-25 14:54:56 -0700155 /* This must be done before dead CPU ack */
156 cpu_exit_clear();
157 wbinvd();
158 mb();
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700159 /* Ack it */
160 __get_cpu_var(cpu_state) = CPU_DEAD;
161
Li Shaohuae1367da2005-06-25 14:54:56 -0700162 /*
163 * With physical CPU hotplug, we should halt the cpu
164 */
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700165 local_irq_disable();
Li Shaohuae1367da2005-06-25 14:54:56 -0700166 while (1)
Zachary Amsdenf2ab4462005-09-03 15:56:42 -0700167 halt();
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700168}
169#else
170static inline void play_dead(void)
171{
172 BUG();
173}
174#endif /* CONFIG_HOTPLUG_CPU */
175
Linus Torvalds1da177e2005-04-16 15:20:36 -0700176/*
177 * The idle thread. There's no useful work to be
178 * done, so just try to conserve power and have a
179 * low exit latency (ie sit in a loop waiting for
180 * somebody to say that they'd like to reschedule)
181 */
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700182void cpu_idle(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183{
Nick Piggin5bfb5d62005-11-08 21:39:01 -0800184 int cpu = smp_processor_id();
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700185
Andi Kleen495ab9c2006-06-26 13:59:11 +0200186 current_thread_info()->status |= TS_POLLING;
Nick Piggin64c7c8f2005-11-08 21:39:04 -0800187
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188 /* endless idle loop with no priority at all */
189 while (1) {
Ingo Molnar74167342007-02-16 01:28:07 -0800190 tick_nohz_stop_sched_tick();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700191 while (!need_resched()) {
192 void (*idle)(void);
193
194 if (__get_cpu_var(cpu_idle_state))
195 __get_cpu_var(cpu_idle_state) = 0;
196
Christoph Lameterf1d1a842007-05-12 11:15:24 -0700197 check_pgt_cache();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700198 rmb();
199 idle = pm_idle;
200
201 if (!idle)
202 idle = default_idle;
203
Zwane Mwaikambof3705132005-06-25 14:54:50 -0700204 if (cpu_is_offline(cpu))
205 play_dead();
206
Linus Torvalds1da177e2005-04-16 15:20:36 -0700207 __get_cpu_var(irq_stat).idle_timestamp = jiffies;
208 idle();
209 }
Ingo Molnar74167342007-02-16 01:28:07 -0800210 tick_nohz_restart_sched_tick();
Nick Piggin5bfb5d62005-11-08 21:39:01 -0800211 preempt_enable_no_resched();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212 schedule();
Nick Piggin5bfb5d62005-11-08 21:39:01 -0800213 preempt_disable();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214 }
215}
216
Steven Rostedt40d6a142008-01-14 00:55:10 -0800217static void do_nothing(void *unused)
218{
219}
220
Linus Torvalds1da177e2005-04-16 15:20:36 -0700221void cpu_idle_wait(void)
222{
223 unsigned int cpu, this_cpu = get_cpu();
Ingo Molnardc1829a2006-11-17 14:26:18 +0100224 cpumask_t map, tmp = current->cpus_allowed;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700225
226 set_cpus_allowed(current, cpumask_of_cpu(this_cpu));
227 put_cpu();
228
229 cpus_clear(map);
230 for_each_online_cpu(cpu) {
231 per_cpu(cpu_idle_state, cpu) = 1;
232 cpu_set(cpu, map);
233 }
234
235 __get_cpu_var(cpu_idle_state) = 0;
236
237 wmb();
238 do {
239 ssleep(1);
240 for_each_online_cpu(cpu) {
241 if (cpu_isset(cpu, map) && !per_cpu(cpu_idle_state, cpu))
242 cpu_clear(cpu, map);
243 }
244 cpus_and(map, map, cpu_online_map);
Steven Rostedt40d6a142008-01-14 00:55:10 -0800245 /*
246 * We waited 1 sec, if a CPU still did not call idle
247 * it may be because it is in idle and not waking up
248 * because it has nothing to do.
249 * Give all the remaining CPUS a kick.
250 */
251 smp_call_function_mask(map, do_nothing, 0, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700252 } while (!cpus_empty(map));
Ingo Molnardc1829a2006-11-17 14:26:18 +0100253
254 set_cpus_allowed(current, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700255}
256EXPORT_SYMBOL_GPL(cpu_idle_wait);
257
258/*
259 * This uses new MONITOR/MWAIT instructions on P4 processors with PNI,
260 * which can obviate IPI to trigger checking of need_resched.
261 * We execute MONITOR against need_resched and enter optimized wait state
262 * through MWAIT. Whenever someone changes need_resched, we would be woken
263 * up from MWAIT (without an IPI).
Venkatesh Pallipadi991528d2006-09-25 16:28:13 -0700264 *
265 * New with Core Duo processors, MWAIT can take some hints based on CPU
266 * capability.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267 */
Venkatesh Pallipadi991528d2006-09-25 16:28:13 -0700268void mwait_idle_with_hints(unsigned long eax, unsigned long ecx)
269{
270 if (!need_resched()) {
271 __monitor((void *)&current_thread_info()->flags, 0, 0);
272 smp_mb();
273 if (!need_resched())
Linus Torvaldsea3d5222007-02-26 09:21:46 -0800274 __mwait(eax, ecx);
Venkatesh Pallipadi991528d2006-09-25 16:28:13 -0700275 }
276}
277
278/* Default MONITOR/MWAIT with no hints, used for default C1 state */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279static void mwait_idle(void)
280{
281 local_irq_enable();
Andi Kleen72690a22006-12-07 02:14:03 +0100282 mwait_idle_with_hints(0, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700283}
284
Adrian Bunk3446fa02007-12-19 23:20:18 +0100285void __cpuinit select_idle_routine(const struct cpuinfo_x86 *c)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286{
287 if (cpu_has(c, X86_FEATURE_MWAIT)) {
288 printk("monitor/mwait feature present.\n");
289 /*
290 * Skip, if setup has overridden idle.
291 * One CPU supports mwait => All CPUs supports mwait
292 */
293 if (!pm_idle) {
294 printk("using mwait in idle threads.\n");
295 pm_idle = mwait_idle;
296 }
297 }
298}
299
Andi Kleenf039b752007-05-02 19:27:12 +0200300static int __init idle_setup(char *str)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301{
Andi Kleenf039b752007-05-02 19:27:12 +0200302 if (!strcmp(str, "poll")) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700303 printk("using polling idle threads.\n");
304 pm_idle = poll_idle;
305#ifdef CONFIG_X86_SMP
306 if (smp_num_siblings > 1)
307 printk("WARNING: polling idle and HT enabled, performance may degrade.\n");
308#endif
Andi Kleenf039b752007-05-02 19:27:12 +0200309 } else if (!strcmp(str, "mwait"))
310 force_mwait = 1;
311 else
312 return -1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313
314 boot_option_idle_override = 1;
Andi Kleenf039b752007-05-02 19:27:12 +0200315 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316}
Andi Kleenf039b752007-05-02 19:27:12 +0200317early_param("idle", idle_setup);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318
Pavel Emelyanov9d975eb2007-10-19 20:35:03 +0200319void __show_registers(struct pt_regs *regs, int all)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700320{
321 unsigned long cr0 = 0L, cr2 = 0L, cr3 = 0L, cr4 = 0L;
Alan Sternbb1995d2007-07-21 17:10:42 +0200322 unsigned long d0, d1, d2, d3, d6, d7;
Pavel Emelyanov9d975eb2007-10-19 20:35:03 +0200323 unsigned long esp;
324 unsigned short ss, gs;
325
326 if (user_mode_vm(regs)) {
327 esp = regs->esp;
328 ss = regs->xss & 0xffff;
329 savesegment(gs, gs);
330 } else {
331 esp = (unsigned long) (&regs->esp);
332 savesegment(ss, ss);
333 savesegment(gs, gs);
334 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700335
336 printk("\n");
Linus Torvalds60812a42007-10-19 15:06:00 -0700337 printk("Pid: %d, comm: %s %s (%s %.*s)\n",
338 task_pid_nr(current), current->comm,
Pavel Emelyanov9d975eb2007-10-19 20:35:03 +0200339 print_tainted(), init_utsname()->release,
340 (int)strcspn(init_utsname()->version, " "),
341 init_utsname()->version);
342
343 printk("EIP: %04x:[<%08lx>] EFLAGS: %08lx CPU: %d\n",
344 0xffff & regs->xcs, regs->eip, regs->eflags,
345 smp_processor_id());
Linus Torvalds1da177e2005-04-16 15:20:36 -0700346 print_symbol("EIP is at %s\n", regs->eip);
347
Linus Torvalds1da177e2005-04-16 15:20:36 -0700348 printk("EAX: %08lx EBX: %08lx ECX: %08lx EDX: %08lx\n",
Pavel Emelyanov9d975eb2007-10-19 20:35:03 +0200349 regs->eax, regs->ebx, regs->ecx, regs->edx);
350 printk("ESI: %08lx EDI: %08lx EBP: %08lx ESP: %08lx\n",
351 regs->esi, regs->edi, regs->ebp, esp);
352 printk(" DS: %04x ES: %04x FS: %04x GS: %04x SS: %04x\n",
353 regs->xds & 0xffff, regs->xes & 0xffff,
354 regs->xfs & 0xffff, gs, ss);
355
356 if (!all)
357 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700358
Zachary Amsden4bb0d3e2005-09-03 15:56:36 -0700359 cr0 = read_cr0();
360 cr2 = read_cr2();
361 cr3 = read_cr3();
Zachary Amsdenff6e8c02006-01-06 00:11:50 -0800362 cr4 = read_cr4_safe();
Pavel Emelyanov9d975eb2007-10-19 20:35:03 +0200363 printk("CR0: %08lx CR2: %08lx CR3: %08lx CR4: %08lx\n",
364 cr0, cr2, cr3, cr4);
Alan Sternbb1995d2007-07-21 17:10:42 +0200365
366 get_debugreg(d0, 0);
367 get_debugreg(d1, 1);
368 get_debugreg(d2, 2);
369 get_debugreg(d3, 3);
370 printk("DR0: %08lx DR1: %08lx DR2: %08lx DR3: %08lx\n",
371 d0, d1, d2, d3);
Pavel Emelyanov9d975eb2007-10-19 20:35:03 +0200372
Alan Sternbb1995d2007-07-21 17:10:42 +0200373 get_debugreg(d6, 6);
374 get_debugreg(d7, 7);
Pavel Emelyanov9d975eb2007-10-19 20:35:03 +0200375 printk("DR6: %08lx DR7: %08lx\n",
376 d6, d7);
377}
Alan Sternbb1995d2007-07-21 17:10:42 +0200378
Pavel Emelyanov9d975eb2007-10-19 20:35:03 +0200379void show_regs(struct pt_regs *regs)
380{
381 __show_registers(regs, 1);
Jan Beulich176a2712006-06-26 13:57:41 +0200382 show_trace(NULL, regs, &regs->esp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700383}
384
385/*
386 * This gets run with %ebx containing the
387 * function to call, and %edx containing
388 * the "args".
389 */
390extern void kernel_thread_helper(void);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391
392/*
393 * Create a kernel thread
394 */
395int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
396{
397 struct pt_regs regs;
398
399 memset(&regs, 0, sizeof(regs));
400
401 regs.ebx = (unsigned long) fn;
402 regs.edx = (unsigned long) arg;
403
404 regs.xds = __USER_DS;
405 regs.xes = __USER_DS;
Jeremy Fitzhardinge7c3576d2007-05-02 19:27:16 +0200406 regs.xfs = __KERNEL_PERCPU;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407 regs.orig_eax = -1;
408 regs.eip = (unsigned long) kernel_thread_helper;
Rusty Russell78be3702006-09-26 10:52:39 +0200409 regs.xcs = __KERNEL_CS | get_kernel_rpl();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700410 regs.eflags = X86_EFLAGS_IF | X86_EFLAGS_SF | X86_EFLAGS_PF | 0x2;
411
412 /* Ok, create the new process.. */
Andi Kleen8cf2c512006-10-21 18:37:02 +0200413 return do_fork(flags | CLONE_VM | CLONE_UNTRACED, 0, &regs, 0, NULL, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414}
Alexey Dobriyan129f6942005-06-23 00:08:33 -0700415EXPORT_SYMBOL(kernel_thread);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416
417/*
418 * Free current thread data structures etc..
419 */
420void exit_thread(void)
421{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700422 /* The process may have allocated an io port bitmap... nuke it. */
Stephane Eranianb3cf2572006-07-09 21:12:39 -0400423 if (unlikely(test_thread_flag(TIF_IO_BITMAP))) {
424 struct task_struct *tsk = current;
425 struct thread_struct *t = &tsk->thread;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426 int cpu = get_cpu();
427 struct tss_struct *tss = &per_cpu(init_tss, cpu);
428
429 kfree(t->io_bitmap_ptr);
430 t->io_bitmap_ptr = NULL;
Stephane Eranianb3cf2572006-07-09 21:12:39 -0400431 clear_thread_flag(TIF_IO_BITMAP);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700432 /*
433 * Careful, clear this in the TSS too:
434 */
435 memset(tss->io_bitmap, 0xff, tss->io_bitmap_max);
436 t->io_bitmap_max = 0;
437 tss->io_bitmap_owner = NULL;
438 tss->io_bitmap_max = 0;
Rusty Russella75c54f2007-05-02 19:27:13 +0200439 tss->x86_tss.io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700440 put_cpu();
441 }
442}
443
444void flush_thread(void)
445{
446 struct task_struct *tsk = current;
447
448 memset(tsk->thread.debugreg, 0, sizeof(unsigned long)*8);
449 memset(tsk->thread.tls_array, 0, sizeof(tsk->thread.tls_array));
Stephane Eranianb3cf2572006-07-09 21:12:39 -0400450 clear_tsk_thread_flag(tsk, TIF_DEBUG);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700451 /*
452 * Forget coprocessor state..
453 */
454 clear_fpu(tsk);
455 clear_used_math();
456}
457
458void release_thread(struct task_struct *dead_task)
459{
Zachary Amsden26849272006-01-06 00:11:59 -0800460 BUG_ON(dead_task->mm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700461 release_vm86_irqs(dead_task);
462}
463
464/*
465 * This gets called before we allocate a new thread and copy
466 * the current task into it.
467 */
468void prepare_to_copy(struct task_struct *tsk)
469{
470 unlazy_fpu(tsk);
471}
472
473int copy_thread(int nr, unsigned long clone_flags, unsigned long esp,
474 unsigned long unused,
475 struct task_struct * p, struct pt_regs * regs)
476{
477 struct pt_regs * childregs;
478 struct task_struct *tsk;
479 int err;
480
akpm@osdl.org07b047f2006-01-12 01:05:41 -0800481 childregs = task_pt_regs(p);
Alexander Nybergf48d9662005-05-05 16:15:03 -0700482 *childregs = *regs;
483 childregs->eax = 0;
484 childregs->esp = esp;
485
486 p->thread.esp = (unsigned long) childregs;
487 p->thread.esp0 = (unsigned long) (childregs+1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488
489 p->thread.eip = (unsigned long) ret_from_fork;
490
Jeremy Fitzhardinge464d1a72007-02-13 13:26:20 +0100491 savesegment(gs,p->thread.gs);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700492
493 tsk = current;
Stephane Eranianb3cf2572006-07-09 21:12:39 -0400494 if (unlikely(test_tsk_thread_flag(tsk, TIF_IO_BITMAP))) {
Alexey Dobriyan52978be2006-09-30 23:27:21 -0700495 p->thread.io_bitmap_ptr = kmemdup(tsk->thread.io_bitmap_ptr,
496 IO_BITMAP_BYTES, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497 if (!p->thread.io_bitmap_ptr) {
498 p->thread.io_bitmap_max = 0;
499 return -ENOMEM;
500 }
Stephane Eranianb3cf2572006-07-09 21:12:39 -0400501 set_tsk_thread_flag(p, TIF_IO_BITMAP);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502 }
503
504 /*
505 * Set a new TLS for the child thread?
506 */
507 if (clone_flags & CLONE_SETTLS) {
508 struct desc_struct *desc;
509 struct user_desc info;
510 int idx;
511
512 err = -EFAULT;
513 if (copy_from_user(&info, (void __user *)childregs->esi, sizeof(info)))
514 goto out;
515 err = -EINVAL;
516 if (LDT_empty(&info))
517 goto out;
518
519 idx = info.entry_number;
520 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
521 goto out;
522
523 desc = p->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
524 desc->a = LDT_entry_a(&info);
525 desc->b = LDT_entry_b(&info);
526 }
527
528 err = 0;
529 out:
530 if (err && p->thread.io_bitmap_ptr) {
531 kfree(p->thread.io_bitmap_ptr);
532 p->thread.io_bitmap_max = 0;
533 }
534 return err;
535}
536
537/*
538 * fill in the user structure for a core dump..
539 */
540void dump_thread(struct pt_regs * regs, struct user * dump)
541{
542 int i;
543
544/* changed the size calculations - should hopefully work better. lbt */
545 dump->magic = CMAGIC;
546 dump->start_code = 0;
547 dump->start_stack = regs->esp & ~(PAGE_SIZE - 1);
548 dump->u_tsize = ((unsigned long) current->mm->end_code) >> PAGE_SHIFT;
549 dump->u_dsize = ((unsigned long) (current->mm->brk + (PAGE_SIZE-1))) >> PAGE_SHIFT;
550 dump->u_dsize -= dump->u_tsize;
551 dump->u_ssize = 0;
552 for (i = 0; i < 8; i++)
553 dump->u_debugreg[i] = current->thread.debugreg[i];
554
555 if (dump->start_stack < TASK_SIZE)
556 dump->u_ssize = ((unsigned long) (TASK_SIZE - dump->start_stack)) >> PAGE_SHIFT;
557
558 dump->regs.ebx = regs->ebx;
559 dump->regs.ecx = regs->ecx;
560 dump->regs.edx = regs->edx;
561 dump->regs.esi = regs->esi;
562 dump->regs.edi = regs->edi;
563 dump->regs.ebp = regs->ebp;
564 dump->regs.eax = regs->eax;
565 dump->regs.ds = regs->xds;
566 dump->regs.es = regs->xes;
Jeremy Fitzhardinge464d1a72007-02-13 13:26:20 +0100567 dump->regs.fs = regs->xfs;
568 savesegment(gs,dump->regs.gs);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569 dump->regs.orig_eax = regs->orig_eax;
570 dump->regs.eip = regs->eip;
571 dump->regs.cs = regs->xcs;
572 dump->regs.eflags = regs->eflags;
573 dump->regs.esp = regs->esp;
574 dump->regs.ss = regs->xss;
575
576 dump->u_fpvalid = dump_fpu (regs, &dump->i387);
577}
Alexey Dobriyan129f6942005-06-23 00:08:33 -0700578EXPORT_SYMBOL(dump_thread);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700579
580/*
581 * Capture the user space registers if the task is not running (in user space)
582 */
583int dump_task_regs(struct task_struct *tsk, elf_gregset_t *regs)
584{
akpm@osdl.org07b047f2006-01-12 01:05:41 -0800585 struct pt_regs ptregs = *task_pt_regs(tsk);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700586 ptregs.xcs &= 0xffff;
587 ptregs.xds &= 0xffff;
588 ptregs.xes &= 0xffff;
589 ptregs.xss &= 0xffff;
590
591 elf_core_copy_regs(regs, &ptregs);
592
593 return 1;
594}
595
Andrea Arcangelicf99aba2007-07-15 23:41:33 -0700596#ifdef CONFIG_SECCOMP
597void hard_disable_TSC(void)
598{
599 write_cr4(read_cr4() | X86_CR4_TSD);
600}
601void disable_TSC(void)
602{
603 preempt_disable();
604 if (!test_and_set_thread_flag(TIF_NOTSC))
605 /*
606 * Must flip the CPU state synchronously with
607 * TIF_NOTSC in the current running context.
608 */
609 hard_disable_TSC();
610 preempt_enable();
611}
612void hard_enable_TSC(void)
613{
614 write_cr4(read_cr4() & ~X86_CR4_TSD);
615}
616#endif /* CONFIG_SECCOMP */
617
618static noinline void
619__switch_to_xtra(struct task_struct *prev_p, struct task_struct *next_p,
620 struct tss_struct *tss)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700621{
Stephane Eranianb3cf2572006-07-09 21:12:39 -0400622 struct thread_struct *next;
623
624 next = &next_p->thread;
625
626 if (test_tsk_thread_flag(next_p, TIF_DEBUG)) {
627 set_debugreg(next->debugreg[0], 0);
628 set_debugreg(next->debugreg[1], 1);
629 set_debugreg(next->debugreg[2], 2);
630 set_debugreg(next->debugreg[3], 3);
631 /* no 4 and 5 */
632 set_debugreg(next->debugreg[6], 6);
633 set_debugreg(next->debugreg[7], 7);
634 }
635
Andrea Arcangelicf99aba2007-07-15 23:41:33 -0700636#ifdef CONFIG_SECCOMP
637 if (test_tsk_thread_flag(prev_p, TIF_NOTSC) ^
638 test_tsk_thread_flag(next_p, TIF_NOTSC)) {
639 /* prev and next are different */
640 if (test_tsk_thread_flag(next_p, TIF_NOTSC))
641 hard_disable_TSC();
642 else
643 hard_enable_TSC();
644 }
645#endif
646
Stephane Eranianb3cf2572006-07-09 21:12:39 -0400647 if (!test_tsk_thread_flag(next_p, TIF_IO_BITMAP)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700648 /*
649 * Disable the bitmap via an invalid offset. We still cache
650 * the previous bitmap owner and the IO bitmap contents:
651 */
Rusty Russella75c54f2007-05-02 19:27:13 +0200652 tss->x86_tss.io_bitmap_base = INVALID_IO_BITMAP_OFFSET;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700653 return;
654 }
Stephane Eranianb3cf2572006-07-09 21:12:39 -0400655
Linus Torvalds1da177e2005-04-16 15:20:36 -0700656 if (likely(next == tss->io_bitmap_owner)) {
657 /*
658 * Previous owner of the bitmap (hence the bitmap content)
659 * matches the next task, we dont have to do anything but
660 * to set a valid offset in the TSS:
661 */
Rusty Russella75c54f2007-05-02 19:27:13 +0200662 tss->x86_tss.io_bitmap_base = IO_BITMAP_OFFSET;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700663 return;
664 }
665 /*
666 * Lazy TSS's I/O bitmap copy. We set an invalid offset here
667 * and we let the task to get a GPF in case an I/O instruction
668 * is performed. The handler of the GPF will verify that the
669 * faulting task has a valid I/O bitmap and, it true, does the
670 * real copy and restart the instruction. This will save us
671 * redundant copies when the currently switched task does not
672 * perform any I/O during its timeslice.
673 */
Rusty Russella75c54f2007-05-02 19:27:13 +0200674 tss->x86_tss.io_bitmap_base = INVALID_IO_BITMAP_OFFSET_LAZY;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700676
677/*
678 * switch_to(x,yn) should switch tasks from x to y.
679 *
680 * We fsave/fwait so that an exception goes off at the right time
681 * (as a call from the fsave or fwait in effect) rather than to
682 * the wrong process. Lazy FP saving no longer makes any sense
683 * with modern CPU's, and this simplifies a lot of things (SMP
684 * and UP become the same).
685 *
686 * NOTE! We used to use the x86 hardware context switching. The
687 * reason for not using it any more becomes apparent when you
688 * try to recover gracefully from saved state that is no longer
689 * valid (stale segment register values in particular). With the
690 * hardware task-switch, there is no way to fix up bad state in
691 * a reasonable manner.
692 *
693 * The fact that Intel documents the hardware task-switching to
694 * be slow is a fairly red herring - this code is not noticeably
695 * faster. However, there _is_ some room for improvement here,
696 * so the performance issues may eventually be a valid point.
697 * More important, however, is the fact that this allows us much
698 * more flexibility.
699 *
700 * The return value (in %eax) will be the "prev" task after
701 * the task-switch, and shows up in ret_from_fork in entry.S,
702 * for example.
703 */
704struct task_struct fastcall * __switch_to(struct task_struct *prev_p, struct task_struct *next_p)
705{
706 struct thread_struct *prev = &prev_p->thread,
707 *next = &next_p->thread;
708 int cpu = smp_processor_id();
709 struct tss_struct *tss = &per_cpu(init_tss, cpu);
710
711 /* never put a printk in __switch_to... printk() calls wake_up*() indirectly */
712
713 __unlazy_fpu(prev_p);
714
Chuck Ebbertacc20762006-12-07 02:14:01 +0100715
716 /* we're going to use this soon, after a few expensive things */
717 if (next_p->fpu_counter > 5)
718 prefetch(&next->i387.fxsave);
719
Linus Torvalds1da177e2005-04-16 15:20:36 -0700720 /*
Zachary Amsdene7a2ff52005-09-03 15:56:39 -0700721 * Reload esp0.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722 */
723 load_esp0(tss, next);
724
725 /*
Jeremy Fitzhardinge464d1a72007-02-13 13:26:20 +0100726 * Save away %gs. No need to save %fs, as it was saved on the
Jeremy Fitzhardingef95d47c2006-12-07 02:14:02 +0100727 * stack on entry. No need to save %es and %ds, as those are
728 * always kernel segments while inside the kernel. Doing this
729 * before setting the new TLS descriptors avoids the situation
730 * where we temporarily have non-reloadable segments in %fs
731 * and %gs. This could be an issue if the NMI handler ever
732 * used %fs or %gs (it does not today), or if the kernel is
733 * running inside of a hypervisor layer.
Zachary Amsdene7a2ff52005-09-03 15:56:39 -0700734 */
Jeremy Fitzhardinge464d1a72007-02-13 13:26:20 +0100735 savesegment(gs, prev->gs);
Zachary Amsdene7a2ff52005-09-03 15:56:39 -0700736
737 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700738 * Load the per-thread Thread-Local Storage descriptor.
739 */
740 load_TLS(next, cpu);
741
742 /*
Zachary Amsden8b151142007-02-13 13:26:21 +0100743 * Restore IOPL if needed. In normal use, the flags restore
744 * in the switch assembly will handle this. But if the kernel
745 * is running virtualized at a non-zero CPL, the popf will
746 * not restore flags, so it must be done in a separate step.
747 */
748 if (get_kernel_rpl() && unlikely(prev->iopl != next->iopl))
749 set_iopl_mask(next->iopl);
750
751 /*
Stephane Eranianb3cf2572006-07-09 21:12:39 -0400752 * Now maybe handle debug registers and/or IO bitmaps
Linus Torvalds1da177e2005-04-16 15:20:36 -0700753 */
Andrea Arcangelicf99aba2007-07-15 23:41:33 -0700754 if (unlikely(task_thread_info(prev_p)->flags & _TIF_WORK_CTXSW_PREV ||
755 task_thread_info(next_p)->flags & _TIF_WORK_CTXSW_NEXT))
756 __switch_to_xtra(prev_p, next_p, tss);
Andrea Arcangeliffaa8bd2005-06-27 14:36:36 -0700757
Zachary Amsden9226d122007-02-13 13:26:21 +0100758 /*
759 * Leave lazy mode, flushing any hypercalls made here.
760 * This must be done before restoring TLS segments so
761 * the GDT and LDT are properly updated, and must be
762 * done before math_state_restore, so the TS bit is up
763 * to date.
764 */
765 arch_leave_lazy_cpu_mode();
766
Chuck Ebbertacc20762006-12-07 02:14:01 +0100767 /* If the task has used fpu the last 5 timeslices, just do a full
768 * restore of the math state immediately to avoid the trap; the
769 * chances of needing FPU soon are obviously high now
770 */
771 if (next_p->fpu_counter > 5)
772 math_state_restore();
773
Zachary Amsden9226d122007-02-13 13:26:21 +0100774 /*
775 * Restore %gs if needed (which is common)
776 */
777 if (prev->gs | next->gs)
778 loadsegment(gs, next->gs);
779
Jeremy Fitzhardinge7c3576d2007-05-02 19:27:16 +0200780 x86_write_percpu(current_task, next_p);
Zachary Amsden9226d122007-02-13 13:26:21 +0100781
Linus Torvalds1da177e2005-04-16 15:20:36 -0700782 return prev_p;
783}
784
785asmlinkage int sys_fork(struct pt_regs regs)
786{
787 return do_fork(SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
788}
789
790asmlinkage int sys_clone(struct pt_regs regs)
791{
792 unsigned long clone_flags;
793 unsigned long newsp;
794 int __user *parent_tidptr, *child_tidptr;
795
796 clone_flags = regs.ebx;
797 newsp = regs.ecx;
798 parent_tidptr = (int __user *)regs.edx;
799 child_tidptr = (int __user *)regs.edi;
800 if (!newsp)
801 newsp = regs.esp;
802 return do_fork(clone_flags, newsp, &regs, 0, parent_tidptr, child_tidptr);
803}
804
805/*
806 * This is trivial, and on the face of it looks like it
807 * could equally well be done in user mode.
808 *
809 * Not so, for quite unobvious reasons - register pressure.
810 * In user mode vfork() cannot have a stack frame, and if
811 * done by calling the "clone()" system call directly, you
812 * do not have enough call-clobbered registers to hold all
813 * the information you need.
814 */
815asmlinkage int sys_vfork(struct pt_regs regs)
816{
817 return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, regs.esp, &regs, 0, NULL, NULL);
818}
819
820/*
821 * sys_execve() executes a new program.
822 */
823asmlinkage int sys_execve(struct pt_regs regs)
824{
825 int error;
826 char * filename;
827
828 filename = getname((char __user *) regs.ebx);
829 error = PTR_ERR(filename);
830 if (IS_ERR(filename))
831 goto out;
832 error = do_execve(filename,
833 (char __user * __user *) regs.ecx,
834 (char __user * __user *) regs.edx,
835 &regs);
836 if (error == 0) {
837 task_lock(current);
838 current->ptrace &= ~PT_DTRACE;
839 task_unlock(current);
840 /* Make sure we don't return using sysenter.. */
841 set_thread_flag(TIF_IRET);
842 }
843 putname(filename);
844out:
845 return error;
846}
847
848#define top_esp (THREAD_SIZE - sizeof(unsigned long))
849#define top_ebp (THREAD_SIZE - 2*sizeof(unsigned long))
850
851unsigned long get_wchan(struct task_struct *p)
852{
853 unsigned long ebp, esp, eip;
854 unsigned long stack_page;
855 int count = 0;
856 if (!p || p == current || p->state == TASK_RUNNING)
857 return 0;
Al Viro65e0fdf2006-01-12 01:05:41 -0800858 stack_page = (unsigned long)task_stack_page(p);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700859 esp = p->thread.esp;
860 if (!stack_page || esp < stack_page || esp > top_esp+stack_page)
861 return 0;
862 /* include/asm-i386/system.h:switch_to() pushes ebp last. */
863 ebp = *(unsigned long *) esp;
864 do {
865 if (ebp < stack_page || ebp > top_ebp+stack_page)
866 return 0;
867 eip = *(unsigned long *) (ebp+4);
868 if (!in_sched_functions(eip))
869 return eip;
870 ebp = *(unsigned long *) ebp;
871 } while (count++ < 16);
872 return 0;
873}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700874
875/*
876 * sys_alloc_thread_area: get a yet unused TLS descriptor index.
877 */
878static int get_free_idx(void)
879{
880 struct thread_struct *t = &current->thread;
881 int idx;
882
883 for (idx = 0; idx < GDT_ENTRY_TLS_ENTRIES; idx++)
884 if (desc_empty(t->tls_array + idx))
885 return idx + GDT_ENTRY_TLS_MIN;
886 return -ESRCH;
887}
888
889/*
890 * Set a given TLS descriptor:
891 */
892asmlinkage int sys_set_thread_area(struct user_desc __user *u_info)
893{
894 struct thread_struct *t = &current->thread;
895 struct user_desc info;
896 struct desc_struct *desc;
897 int cpu, idx;
898
899 if (copy_from_user(&info, u_info, sizeof(info)))
900 return -EFAULT;
901 idx = info.entry_number;
902
903 /*
904 * index -1 means the kernel should try to find and
905 * allocate an empty descriptor:
906 */
907 if (idx == -1) {
908 idx = get_free_idx();
909 if (idx < 0)
910 return idx;
911 if (put_user(idx, &u_info->entry_number))
912 return -EFAULT;
913 }
914
915 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
916 return -EINVAL;
917
918 desc = t->tls_array + idx - GDT_ENTRY_TLS_MIN;
919
920 /*
921 * We must not get preempted while modifying the TLS.
922 */
923 cpu = get_cpu();
924
925 if (LDT_empty(&info)) {
926 desc->a = 0;
927 desc->b = 0;
928 } else {
929 desc->a = LDT_entry_a(&info);
930 desc->b = LDT_entry_b(&info);
931 }
932 load_TLS(t, cpu);
933
934 put_cpu();
935
936 return 0;
937}
938
939/*
940 * Get the current Thread-Local Storage area:
941 */
942
943#define GET_BASE(desc) ( \
944 (((desc)->a >> 16) & 0x0000ffff) | \
945 (((desc)->b << 16) & 0x00ff0000) | \
946 ( (desc)->b & 0xff000000) )
947
948#define GET_LIMIT(desc) ( \
949 ((desc)->a & 0x0ffff) | \
950 ((desc)->b & 0xf0000) )
951
952#define GET_32BIT(desc) (((desc)->b >> 22) & 1)
953#define GET_CONTENTS(desc) (((desc)->b >> 10) & 3)
954#define GET_WRITABLE(desc) (((desc)->b >> 9) & 1)
955#define GET_LIMIT_PAGES(desc) (((desc)->b >> 23) & 1)
956#define GET_PRESENT(desc) (((desc)->b >> 15) & 1)
957#define GET_USEABLE(desc) (((desc)->b >> 20) & 1)
958
959asmlinkage int sys_get_thread_area(struct user_desc __user *u_info)
960{
961 struct user_desc info;
962 struct desc_struct *desc;
963 int idx;
964
965 if (get_user(idx, &u_info->entry_number))
966 return -EFAULT;
967 if (idx < GDT_ENTRY_TLS_MIN || idx > GDT_ENTRY_TLS_MAX)
968 return -EINVAL;
969
Blaisorblade71ae18e2005-07-27 11:45:18 -0700970 memset(&info, 0, sizeof(info));
971
Linus Torvalds1da177e2005-04-16 15:20:36 -0700972 desc = current->thread.tls_array + idx - GDT_ENTRY_TLS_MIN;
973
974 info.entry_number = idx;
975 info.base_addr = GET_BASE(desc);
976 info.limit = GET_LIMIT(desc);
977 info.seg_32bit = GET_32BIT(desc);
978 info.contents = GET_CONTENTS(desc);
979 info.read_exec_only = !GET_WRITABLE(desc);
980 info.limit_in_pages = GET_LIMIT_PAGES(desc);
981 info.seg_not_present = !GET_PRESENT(desc);
982 info.useable = GET_USEABLE(desc);
983
984 if (copy_to_user(u_info, &info, sizeof(info)))
985 return -EFAULT;
986 return 0;
987}
988
989unsigned long arch_align_stack(unsigned long sp)
990{
Andi Kleenc16b63e2006-09-26 10:52:28 +0200991 if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700992 sp -= get_random_int() % 8192;
993 return sp & ~0xf;
994}
Jiri Kosinac1d171a2008-01-30 13:30:40 +0100995
996unsigned long arch_randomize_brk(struct mm_struct *mm)
997{
998 unsigned long range_end = mm->brk + 0x02000000;
999 return randomize_range(mm->brk, range_end, 0) ? : mm->brk;
1000}
1001