2006-09-27 02:50:40 -06:00
|
|
|
/*
|
2007-10-16 02:27:00 -06:00
|
|
|
* Copyright (C) 2000 - 2007 Jeff Dike (jdike@{addtoit,linux.intel}.com)
|
2005-04-16 16:20:36 -06:00
|
|
|
* Copyright 2003 PathScale, Inc.
|
|
|
|
* Licensed under the GPL
|
|
|
|
*/
|
|
|
|
|
2008-02-04 23:31:14 -07:00
|
|
|
#include <linux/stddef.h>
|
|
|
|
#include <linux/err.h>
|
|
|
|
#include <linux/hardirq.h>
|
|
|
|
#include <linux/mm.h>
|
2009-12-14 19:00:11 -07:00
|
|
|
#include <linux/module.h>
|
2008-02-04 23:31:14 -07:00
|
|
|
#include <linux/personality.h>
|
|
|
|
#include <linux/proc_fs.h>
|
|
|
|
#include <linux/ptrace.h>
|
|
|
|
#include <linux/random.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 02:04:11 -06:00
|
|
|
#include <linux/slab.h>
|
2008-02-04 23:31:14 -07:00
|
|
|
#include <linux/sched.h>
|
2009-12-14 19:00:11 -07:00
|
|
|
#include <linux/seq_file.h>
|
2008-02-04 23:31:14 -07:00
|
|
|
#include <linux/tick.h>
|
|
|
|
#include <linux/threads.h>
|
2012-04-24 00:37:07 -06:00
|
|
|
#include <linux/tracehook.h>
|
2008-02-04 23:31:14 -07:00
|
|
|
#include <asm/current.h>
|
|
|
|
#include <asm/pgtable.h>
|
2011-08-18 13:07:59 -06:00
|
|
|
#include <asm/mmu_context.h>
|
2008-02-04 23:31:14 -07:00
|
|
|
#include <asm/uaccess.h>
|
2007-05-06 15:51:08 -06:00
|
|
|
#include "as-layout.h"
|
2007-10-16 02:27:00 -06:00
|
|
|
#include "kern_util.h"
|
2005-04-16 16:20:36 -06:00
|
|
|
#include "os.h"
|
2007-10-16 02:26:58 -06:00
|
|
|
#include "skas.h"
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-10-16 02:27:00 -06:00
|
|
|
/*
|
|
|
|
* This is a per-cpu array. A processor only modifies its entry and it only
|
2005-04-16 16:20:36 -06:00
|
|
|
* cares about its entry, so it's OK if another processor is modifying its
|
|
|
|
* entry.
|
|
|
|
*/
|
|
|
|
struct cpu_task cpu_tasks[NR_CPUS] = { [0 ... NR_CPUS - 1] = { -1, NULL } };
|
|
|
|
|
2008-02-04 23:31:03 -07:00
|
|
|
static inline int external_pid(void)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2007-10-16 02:26:58 -06:00
|
|
|
/* FIXME: Need to look up userspace_pid by cpu */
|
2007-10-16 02:27:00 -06:00
|
|
|
return userspace_pid[0];
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
int pid_to_processor_id(int pid)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2008-02-04 23:31:14 -07:00
|
|
|
for (i = 0; i < ncpus; i++) {
|
2007-10-16 02:27:00 -06:00
|
|
|
if (cpu_tasks[i].pid == pid)
|
2007-05-06 15:51:21 -06:00
|
|
|
return i;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2007-05-06 15:51:21 -06:00
|
|
|
return -1;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
void free_stack(unsigned long stack, int order)
|
|
|
|
{
|
|
|
|
free_pages(stack, order);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned long alloc_stack(int order, int atomic)
|
|
|
|
{
|
|
|
|
unsigned long page;
|
2005-10-21 01:22:24 -06:00
|
|
|
gfp_t flags = GFP_KERNEL;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2005-09-22 22:44:20 -06:00
|
|
|
if (atomic)
|
|
|
|
flags = GFP_ATOMIC;
|
2005-04-16 16:20:36 -06:00
|
|
|
page = __get_free_pages(flags, order);
|
2007-10-16 02:26:46 -06:00
|
|
|
|
2007-05-06 15:51:21 -06:00
|
|
|
return page;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
int kernel_thread(int (*fn)(void *), void * arg, unsigned long flags)
|
|
|
|
{
|
|
|
|
int pid;
|
|
|
|
|
|
|
|
current->thread.request.u.thread.proc = fn;
|
|
|
|
current->thread.request.u.thread.arg = arg;
|
2005-06-25 15:55:21 -06:00
|
|
|
pid = do_fork(CLONE_VM | CLONE_UNTRACED | flags, 0,
|
|
|
|
¤t->thread.regs, 0, NULL, NULL);
|
2007-05-06 15:51:21 -06:00
|
|
|
return pid;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2011-08-18 13:14:10 -06:00
|
|
|
EXPORT_SYMBOL(kernel_thread);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2007-05-06 15:51:21 -06:00
|
|
|
static inline void set_current(struct task_struct *task)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2006-01-12 02:05:48 -07:00
|
|
|
cpu_tasks[task_thread_info(task)->cpu] = ((struct cpu_task)
|
2008-02-04 23:31:03 -07:00
|
|
|
{ external_pid(), task });
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2008-02-04 23:30:49 -07:00
|
|
|
extern void arch_switch_to(struct task_struct *to);
|
2007-10-16 02:26:58 -06:00
|
|
|
|
2012-03-29 11:10:42 -06:00
|
|
|
void *__switch_to(struct task_struct *from, struct task_struct *to)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2006-09-27 02:50:40 -06:00
|
|
|
to->thread.prev_sched = from;
|
|
|
|
set_current(to);
|
2005-09-16 20:27:43 -06:00
|
|
|
|
[PATCH] uml: breakpoint an arbitrary thread
This patch implements a stack trace for a thread, not unlike sysrq-t does.
The advantage to this is that a break point can be placed on showreqs, so that
upon showing the stack, you jump immediately into the debugger. While sysrq-t
does the same thing, sysrq-t shows *all* threads stacks. It also doesn't work
right now. In the future, I thought it might be acceptable to make this show
all pids stacks, but perhaps leaving well enough alone and just using sysrq-t
would be okay. For now, upon receiving the stack command, UML switches
context to that thread, dumps its registers, and then switches context back to
the original thread. Since UML compacts all threads into one of 4 host
threads, this sort of mechanism could be expanded in the future to include
other debugging helpers that sysrq does not cover.
Note by jdike - The main benefit to this is that it brings an arbitrary thread
back into context, where it can be examined by gdb. The fact that it dumps it
stack is secondary. This provides the capability to examine a sleeping
thread, which has existed in tt mode, but not in skas mode until now.
Also, the other threads, that sysrq doesn't cover, can be gdb-ed directly
anyway.
Signed-off-by: Allan Graves<allan.graves@gmail.com>
Signed-off-by: Jeff Dike <jdike@addtoit.com>
Cc: Paolo Giarrusso <blaisorblade@yahoo.it>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-09-16 20:27:46 -06:00
|
|
|
do {
|
2007-10-16 02:26:56 -06:00
|
|
|
current->thread.saved_task = NULL;
|
2007-10-16 02:26:58 -06:00
|
|
|
|
2008-02-04 23:31:14 -07:00
|
|
|
switch_threads(&from->thread.switch_buf,
|
|
|
|
&to->thread.switch_buf);
|
2007-10-16 02:26:58 -06:00
|
|
|
|
2008-02-04 23:30:49 -07:00
|
|
|
arch_switch_to(current);
|
2007-10-16 02:26:58 -06:00
|
|
|
|
2007-10-16 02:27:00 -06:00
|
|
|
if (current->thread.saved_task)
|
[PATCH] uml: breakpoint an arbitrary thread
This patch implements a stack trace for a thread, not unlike sysrq-t does.
The advantage to this is that a break point can be placed on showreqs, so that
upon showing the stack, you jump immediately into the debugger. While sysrq-t
does the same thing, sysrq-t shows *all* threads stacks. It also doesn't work
right now. In the future, I thought it might be acceptable to make this show
all pids stacks, but perhaps leaving well enough alone and just using sysrq-t
would be okay. For now, upon receiving the stack command, UML switches
context to that thread, dumps its registers, and then switches context back to
the original thread. Since UML compacts all threads into one of 4 host
threads, this sort of mechanism could be expanded in the future to include
other debugging helpers that sysrq does not cover.
Note by jdike - The main benefit to this is that it brings an arbitrary thread
back into context, where it can be examined by gdb. The fact that it dumps it
stack is secondary. This provides the capability to examine a sleeping
thread, which has existed in tt mode, but not in skas mode until now.
Also, the other threads, that sysrq doesn't cover, can be gdb-ed directly
anyway.
Signed-off-by: Allan Graves<allan.graves@gmail.com>
Signed-off-by: Jeff Dike <jdike@addtoit.com>
Cc: Paolo Giarrusso <blaisorblade@yahoo.it>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-09-16 20:27:46 -06:00
|
|
|
show_regs(&(current->thread.regs));
|
2008-02-04 23:31:14 -07:00
|
|
|
to = current->thread.saved_task;
|
|
|
|
from = current;
|
2008-02-04 23:30:49 -07:00
|
|
|
} while (current->thread.saved_task);
|
2005-09-16 20:27:43 -06:00
|
|
|
|
2007-05-06 15:51:21 -06:00
|
|
|
return current->thread.prev_sched;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
void interrupt_end(void)
|
|
|
|
{
|
2007-10-16 02:27:00 -06:00
|
|
|
if (need_resched())
|
2007-05-06 15:51:21 -06:00
|
|
|
schedule();
|
2012-04-24 00:37:07 -06:00
|
|
|
if (test_thread_flag(TIF_SIGPENDING))
|
2007-05-06 15:51:21 -06:00
|
|
|
do_signal();
|
2012-05-23 12:44:37 -06:00
|
|
|
if (test_and_clear_thread_flag(TIF_NOTIFY_RESUME))
|
2012-04-24 00:37:07 -06:00
|
|
|
tracehook_notify_resume(¤t->thread.regs);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
void exit_thread(void)
|
|
|
|
{
|
|
|
|
}
|
2006-09-27 02:50:40 -06:00
|
|
|
|
2012-01-30 14:30:48 -07:00
|
|
|
int get_current_pid(void)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2012-01-30 14:30:48 -07:00
|
|
|
return task_pid_nr(current);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2007-10-16 02:27:00 -06:00
|
|
|
/*
|
|
|
|
* This is called magically, by its address being stuffed in a jmp_buf
|
2007-10-16 02:26:58 -06:00
|
|
|
* and being longjmp-d to.
|
|
|
|
*/
|
|
|
|
void new_thread_handler(void)
|
|
|
|
{
|
|
|
|
int (*fn)(void *), n;
|
|
|
|
void *arg;
|
|
|
|
|
2007-10-16 02:27:00 -06:00
|
|
|
if (current->thread.prev_sched != NULL)
|
2007-10-16 02:26:58 -06:00
|
|
|
schedule_tail(current->thread.prev_sched);
|
|
|
|
current->thread.prev_sched = NULL;
|
|
|
|
|
|
|
|
fn = current->thread.request.u.thread.proc;
|
|
|
|
arg = current->thread.request.u.thread.arg;
|
|
|
|
|
2007-10-16 02:27:00 -06:00
|
|
|
/*
|
|
|
|
* The return value is 1 if the kernel thread execs a process,
|
2007-10-16 02:26:58 -06:00
|
|
|
* 0 if it just exits
|
|
|
|
*/
|
|
|
|
n = run_kernel_thread(fn, arg, ¤t->thread.exec_buf);
|
2012-05-22 22:25:15 -06:00
|
|
|
if (n == 1)
|
2007-10-16 02:26:58 -06:00
|
|
|
userspace(¤t->thread.regs.regs);
|
2012-05-22 22:25:15 -06:00
|
|
|
else
|
|
|
|
do_exit(0);
|
2007-10-16 02:26:58 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Called magically, see new_thread_handler above */
|
|
|
|
void fork_handler(void)
|
|
|
|
{
|
|
|
|
force_flush_all();
|
|
|
|
|
|
|
|
schedule_tail(current->thread.prev_sched);
|
|
|
|
|
2007-10-16 02:27:00 -06:00
|
|
|
/*
|
|
|
|
* XXX: if interrupt_end() calls schedule, this call to
|
2007-10-16 02:26:58 -06:00
|
|
|
* arch_switch_to isn't needed. We could want to apply this to
|
2007-10-16 02:27:00 -06:00
|
|
|
* improve performance. -bb
|
|
|
|
*/
|
2008-02-04 23:30:49 -07:00
|
|
|
arch_switch_to(current);
|
2007-10-16 02:26:58 -06:00
|
|
|
|
|
|
|
current->thread.prev_sched = NULL;
|
|
|
|
|
|
|
|
userspace(¤t->thread.regs.regs);
|
|
|
|
}
|
|
|
|
|
2009-04-02 17:56:59 -06:00
|
|
|
int copy_thread(unsigned long clone_flags, unsigned long sp,
|
2006-09-27 02:50:40 -06:00
|
|
|
unsigned long stack_top, struct task_struct * p,
|
2005-04-16 16:20:36 -06:00
|
|
|
struct pt_regs *regs)
|
|
|
|
{
|
2007-10-16 02:26:58 -06:00
|
|
|
void (*handler)(void);
|
|
|
|
int ret = 0;
|
2006-03-31 03:30:22 -07:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
p->thread = (struct thread_struct) INIT_THREAD;
|
2006-03-31 03:30:22 -07:00
|
|
|
|
2007-10-16 02:27:00 -06:00
|
|
|
if (current->thread.forking) {
|
2007-10-16 02:26:58 -06:00
|
|
|
memcpy(&p->thread.regs.regs, ®s->regs,
|
|
|
|
sizeof(p->thread.regs.regs));
|
2012-05-22 19:16:35 -06:00
|
|
|
PT_REGS_SET_SYSCALL_RETURN(&p->thread.regs, 0);
|
2007-10-16 02:27:00 -06:00
|
|
|
if (sp != 0)
|
2007-10-16 02:27:07 -06:00
|
|
|
REGS_SP(p->thread.regs.regs.gp) = sp;
|
2006-03-31 03:30:22 -07:00
|
|
|
|
2007-10-16 02:26:58 -06:00
|
|
|
handler = fork_handler;
|
2006-03-31 03:30:22 -07:00
|
|
|
|
2007-10-16 02:26:58 -06:00
|
|
|
arch_copy_thread(¤t->thread.arch, &p->thread.arch);
|
|
|
|
}
|
|
|
|
else {
|
2011-09-14 17:21:23 -06:00
|
|
|
get_safe_registers(p->thread.regs.regs.gp, p->thread.regs.regs.fp);
|
2007-10-16 02:26:58 -06:00
|
|
|
p->thread.request.u.thread = current->thread.request.u.thread;
|
|
|
|
handler = new_thread_handler;
|
|
|
|
}
|
|
|
|
|
|
|
|
new_thread(task_stack_page(p), &p->thread.switch_buf, handler);
|
|
|
|
|
|
|
|
if (current->thread.forking) {
|
|
|
|
clear_flushed_tls(p);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set a new TLS for the child thread?
|
|
|
|
*/
|
|
|
|
if (clone_flags & CLONE_SETTLS)
|
|
|
|
ret = arch_copy_tls(p);
|
|
|
|
}
|
2006-03-31 03:30:22 -07:00
|
|
|
|
|
|
|
return ret;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
void initial_thread_cb(void (*proc)(void *), void *arg)
|
|
|
|
{
|
|
|
|
int save_kmalloc_ok = kmalloc_ok;
|
|
|
|
|
|
|
|
kmalloc_ok = 0;
|
2007-10-16 02:26:56 -06:00
|
|
|
initial_thread_cb_skas(proc, arg);
|
2005-04-16 16:20:36 -06:00
|
|
|
kmalloc_ok = save_kmalloc_ok;
|
|
|
|
}
|
2006-09-27 02:50:40 -06:00
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
void default_idle(void)
|
|
|
|
{
|
2007-10-16 02:27:26 -06:00
|
|
|
unsigned long long nsecs;
|
|
|
|
|
2008-02-04 23:31:14 -07:00
|
|
|
while (1) {
|
2005-04-16 16:20:36 -06:00
|
|
|
/* endless idle loop with no priority at all */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* although we are an idle CPU, we do not want to
|
|
|
|
* get into the scheduler unnecessarily.
|
|
|
|
*/
|
2007-10-16 02:27:00 -06:00
|
|
|
if (need_resched())
|
2005-04-16 16:20:36 -06:00
|
|
|
schedule();
|
2006-09-27 02:50:40 -06:00
|
|
|
|
2011-11-17 10:48:14 -07:00
|
|
|
tick_nohz_idle_enter();
|
|
|
|
rcu_idle_enter();
|
2007-10-16 02:27:26 -06:00
|
|
|
nsecs = disable_timer();
|
|
|
|
idle_sleep(nsecs);
|
2011-11-17 10:48:14 -07:00
|
|
|
rcu_idle_exit();
|
|
|
|
tick_nohz_idle_exit();
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void cpu_idle(void)
|
|
|
|
{
|
2008-02-04 23:30:54 -07:00
|
|
|
cpu_tasks[current_thread_info()->cpu].pid = os_getpid();
|
2007-10-16 02:26:58 -06:00
|
|
|
default_idle();
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2006-01-18 18:42:58 -07:00
|
|
|
int __cant_sleep(void) {
|
|
|
|
return in_atomic() || irqs_disabled() || in_interrupt();
|
|
|
|
/* Is in_interrupt() really needed? */
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
int user_context(unsigned long sp)
|
|
|
|
{
|
|
|
|
unsigned long stack;
|
|
|
|
|
|
|
|
stack = sp & (PAGE_MASK << CONFIG_KERNEL_STACK_ORDER);
|
2008-02-04 23:30:54 -07:00
|
|
|
return stack != (unsigned long) current_thread_info();
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
extern exitcall_t __uml_exitcall_begin, __uml_exitcall_end;
|
|
|
|
|
|
|
|
void do_uml_exitcalls(void)
|
|
|
|
{
|
|
|
|
exitcall_t *call;
|
|
|
|
|
|
|
|
call = &__uml_exitcall_end;
|
|
|
|
while (--call >= &__uml_exitcall_begin)
|
|
|
|
(*call)();
|
|
|
|
}
|
|
|
|
|
2008-02-04 23:30:41 -07:00
|
|
|
char *uml_strdup(const char *string)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2005-06-23 01:09:04 -06:00
|
|
|
return kstrdup(string, GFP_KERNEL);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
2011-08-18 13:14:10 -06:00
|
|
|
EXPORT_SYMBOL(uml_strdup);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
int copy_to_user_proc(void __user *to, void *from, int size)
|
|
|
|
{
|
2007-05-06 15:51:21 -06:00
|
|
|
return copy_to_user(to, from, size);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
int copy_from_user_proc(void *to, void __user *from, int size)
|
|
|
|
{
|
2007-05-06 15:51:21 -06:00
|
|
|
return copy_from_user(to, from, size);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
int clear_user_proc(void __user *buf, int size)
|
|
|
|
{
|
2007-05-06 15:51:21 -06:00
|
|
|
return clear_user(buf, size);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
int strlen_user_proc(char __user *str)
|
|
|
|
{
|
2007-05-06 15:51:21 -06:00
|
|
|
return strlen_user(str);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
int smp_sigio_handler(void)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_SMP
|
2008-02-04 23:30:54 -07:00
|
|
|
int cpu = current_thread_info()->cpu;
|
2005-04-16 16:20:36 -06:00
|
|
|
IPI_handler(cpu);
|
2007-10-16 02:27:00 -06:00
|
|
|
if (cpu != 0)
|
2007-05-06 15:51:21 -06:00
|
|
|
return 1;
|
2005-04-16 16:20:36 -06:00
|
|
|
#endif
|
2007-05-06 15:51:21 -06:00
|
|
|
return 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
int cpu(void)
|
|
|
|
{
|
2008-02-04 23:30:54 -07:00
|
|
|
return current_thread_info()->cpu;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
static atomic_t using_sysemu = ATOMIC_INIT(0);
|
|
|
|
int sysemu_supported;
|
|
|
|
|
|
|
|
void set_using_sysemu(int value)
|
|
|
|
{
|
|
|
|
if (value > sysemu_supported)
|
|
|
|
return;
|
|
|
|
atomic_set(&using_sysemu, value);
|
|
|
|
}
|
|
|
|
|
|
|
|
int get_using_sysemu(void)
|
|
|
|
{
|
|
|
|
return atomic_read(&using_sysemu);
|
|
|
|
}
|
|
|
|
|
2009-12-14 19:00:11 -07:00
|
|
|
static int sysemu_proc_show(struct seq_file *m, void *v)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
2009-12-14 19:00:11 -07:00
|
|
|
seq_printf(m, "%d\n", get_using_sysemu());
|
|
|
|
return 0;
|
|
|
|
}
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2009-12-14 19:00:11 -07:00
|
|
|
static int sysemu_proc_open(struct inode *inode, struct file *file)
|
|
|
|
{
|
|
|
|
return single_open(file, sysemu_proc_show, NULL);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2009-12-14 19:00:11 -07:00
|
|
|
static ssize_t sysemu_proc_write(struct file *file, const char __user *buf,
|
|
|
|
size_t count, loff_t *pos)
|
2005-04-16 16:20:36 -06:00
|
|
|
{
|
|
|
|
char tmp[2];
|
|
|
|
|
|
|
|
if (copy_from_user(tmp, buf, 1))
|
|
|
|
return -EFAULT;
|
|
|
|
|
|
|
|
if (tmp[0] >= '0' && tmp[0] <= '2')
|
|
|
|
set_using_sysemu(tmp[0] - '0');
|
2007-10-16 02:27:00 -06:00
|
|
|
/* We use the first char, but pretend to write everything */
|
|
|
|
return count;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2009-12-14 19:00:11 -07:00
|
|
|
static const struct file_operations sysemu_proc_fops = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.open = sysemu_proc_open,
|
|
|
|
.read = seq_read,
|
|
|
|
.llseek = seq_lseek,
|
|
|
|
.release = single_release,
|
|
|
|
.write = sysemu_proc_write,
|
|
|
|
};
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
int __init make_proc_sysemu(void)
|
|
|
|
{
|
|
|
|
struct proc_dir_entry *ent;
|
|
|
|
if (!sysemu_supported)
|
|
|
|
return 0;
|
|
|
|
|
2009-12-14 19:00:11 -07:00
|
|
|
ent = proc_create("sysemu", 0600, NULL, &sysemu_proc_fops);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
if (ent == NULL)
|
|
|
|
{
|
2005-07-28 22:16:12 -06:00
|
|
|
printk(KERN_WARNING "Failed to register /proc/sysemu\n");
|
2007-05-06 15:51:21 -06:00
|
|
|
return 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
late_initcall(make_proc_sysemu);
|
|
|
|
|
|
|
|
int singlestepping(void * t)
|
|
|
|
{
|
|
|
|
struct task_struct *task = t ? t : current;
|
|
|
|
|
2008-02-04 23:31:14 -07:00
|
|
|
if (!(task->ptrace & PT_DTRACE))
|
2007-10-16 02:27:00 -06:00
|
|
|
return 0;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
if (task->thread.singlestep_syscall)
|
2007-10-16 02:27:00 -06:00
|
|
|
return 1;
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
return 2;
|
|
|
|
}
|
|
|
|
|
2005-05-06 22:30:53 -06:00
|
|
|
/*
|
|
|
|
* Only x86 and x86_64 have an arch_align_stack().
|
|
|
|
* All other arches have "#define arch_align_stack(x) (x)"
|
|
|
|
* in their asm/system.h
|
|
|
|
* As this is included in UML from asm-um/system-generic.h,
|
|
|
|
* we can use it to behave as the subarch does.
|
|
|
|
*/
|
|
|
|
#ifndef arch_align_stack
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned long arch_align_stack(unsigned long sp)
|
|
|
|
{
|
2006-09-26 00:33:01 -06:00
|
|
|
if (!(current->personality & ADDR_NO_RANDOMIZE) && randomize_va_space)
|
2005-04-16 16:20:36 -06:00
|
|
|
sp -= get_random_int() % 8192;
|
|
|
|
return sp & ~0xf;
|
|
|
|
}
|
2005-05-06 22:30:53 -06:00
|
|
|
#endif
|
2008-02-04 23:30:36 -07:00
|
|
|
|
|
|
|
unsigned long get_wchan(struct task_struct *p)
|
|
|
|
{
|
|
|
|
unsigned long stack_page, sp, ip;
|
|
|
|
bool seen_sched = 0;
|
|
|
|
|
|
|
|
if ((p == NULL) || (p == current) || (p->state == TASK_RUNNING))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
stack_page = (unsigned long) task_stack_page(p);
|
|
|
|
/* Bail if the process has no kernel stack for some reason */
|
|
|
|
if (stack_page == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
sp = p->thread.switch_buf->JB_SP;
|
|
|
|
/*
|
|
|
|
* Bail if the stack pointer is below the bottom of the kernel
|
|
|
|
* stack for some reason
|
|
|
|
*/
|
|
|
|
if (sp < stack_page)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
while (sp < stack_page + THREAD_SIZE) {
|
|
|
|
ip = *((unsigned long *) sp);
|
|
|
|
if (in_sched_functions(ip))
|
|
|
|
/* Ignore everything until we're above the scheduler */
|
|
|
|
seen_sched = 1;
|
|
|
|
else if (kernel_text_address(ip) && seen_sched)
|
|
|
|
return ip;
|
|
|
|
|
|
|
|
sp += sizeof(unsigned long);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
uml: header untangling
Untangle UML headers somewhat and add some includes where they were
needed explicitly, but gotten accidentally via some other header.
arch/um/include/um_uaccess.h loses asm/fixmap.h because it uses no
fixmap stuff and gains elf.h, because it needs FIXADDR_USER_*, and
archsetjmp.h, because it needs jmp_buf.
pmd_alloc_one is uninlined because it needs mm_struct, and that's
inconvenient to provide in asm-um/pgtable-3level.h.
elf_core_copy_fpregs is also uninlined from elf-i386.h and
elf-x86_64.h, which duplicated the code anyway, to
arch/um/kernel/process.c, so that the reference to current_thread
doesn't pull sched.h or anything related into asm/elf.h.
arch/um/sys-i386/ldt.c, arch/um/kernel/tlb.c and
arch/um/kernel/skas/uaccess.c got sched.h because they dereference
task_structs. Its includes of linux and asm headers got turned from
"" to <>.
arch/um/sys-i386/bug.c gets asm/errno.h because it needs errno
constants.
asm/elf-i386 gets asm/user.h because it needs user_regs_struct.
asm/fixmap.h gets page.h because it needs PAGE_SIZE and PAGE_MASK and
system.h for BUG_ON.
asm/pgtable doesn't need sched.h.
asm/processor-generic.h defined mm_segment_t, but didn't use it. So,
that definition is moved to uaccess.h, which defines a bunch of
mm_segment_t-related stuff. thread_info.h uses mm_segment_t, and
includes uaccess.h, which causes a recursion. So, the definition is
placed above the include of thread_info. in uaccess.h. thread_info.h
also gets page.h because it needs PAGE_SIZE.
ObCheckpatchViolationJustification - I'm not adding a typedef; I'm
moving mm_segment_t from one place to another.
Signed-off-by: Jeff Dike <jdike@linux.intel.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-02-04 23:30:53 -07:00
|
|
|
|
|
|
|
int elf_core_copy_fpregs(struct task_struct *t, elf_fpregset_t *fpu)
|
|
|
|
{
|
|
|
|
int cpu = current_thread_info()->cpu;
|
|
|
|
|
|
|
|
return save_fp_registers(userspace_pid[cpu], (unsigned long *) fpu);
|
|
|
|
}
|
|
|
|
|