2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* PARISC Architecture-dependent parts of process handling
|
|
|
|
* based on the work for i386
|
|
|
|
*
|
|
|
|
* Copyright (C) 1999-2003 Matthew Wilcox <willy at parisc-linux.org>
|
|
|
|
* Copyright (C) 2000 Martin K Petersen <mkp at mkp.net>
|
|
|
|
* Copyright (C) 2000 John Marvin <jsm at parisc-linux.org>
|
|
|
|
* Copyright (C) 2000 David Huggins-Daines <dhd with pobox.org>
|
|
|
|
* Copyright (C) 2000-2003 Paul Bame <bame at parisc-linux.org>
|
|
|
|
* Copyright (C) 2000 Philipp Rumpf <prumpf with tux.org>
|
|
|
|
* Copyright (C) 2000 David Kennedy <dkennedy with linuxcare.com>
|
2005-10-21 20:53:04 -06:00
|
|
|
* Copyright (C) 2000 Richard Hirst <rhirst with parisc-linux.org>
|
2005-04-16 16:20:36 -06:00
|
|
|
* Copyright (C) 2000 Grant Grundler <grundler with parisc-linux.org>
|
|
|
|
* Copyright (C) 2001 Alan Modra <amodra at parisc-linux.org>
|
|
|
|
* Copyright (C) 2001-2002 Ryan Bradetich <rbrad at parisc-linux.org>
|
2007-01-28 06:58:52 -07:00
|
|
|
* Copyright (C) 2001-2007 Helge Deller <deller at parisc-linux.org>
|
2005-04-16 16:20:36 -06:00
|
|
|
* Copyright (C) 2002 Randolph Chung <tausq with parisc-linux.org>
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU General Public License as published by
|
|
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with this program; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdarg.h>
|
|
|
|
|
|
|
|
#include <linux/elf.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/mm.h>
|
2007-07-29 16:36:13 -06:00
|
|
|
#include <linux/fs.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/personality.h>
|
|
|
|
#include <linux/ptrace.h>
|
|
|
|
#include <linux/sched.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>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <linux/stddef.h>
|
|
|
|
#include <linux/unistd.h>
|
|
|
|
#include <linux/kallsyms.h>
|
2009-03-15 14:49:55 -06:00
|
|
|
#include <linux/uaccess.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
#include <asm/io.h>
|
2005-09-09 12:57:26 -06:00
|
|
|
#include <asm/asm-offsets.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
#include <asm/pdc.h>
|
|
|
|
#include <asm/pdc_chassis.h>
|
|
|
|
#include <asm/pgalloc.h>
|
|
|
|
#include <asm/unwind.h>
|
2009-03-15 14:49:55 -06:00
|
|
|
#include <asm/sections.h>
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* 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)
|
|
|
|
*/
|
|
|
|
void cpu_idle(void)
|
|
|
|
{
|
[PATCH] sched: resched and cpu_idle rework
Make some changes to the NEED_RESCHED and POLLING_NRFLAG to reduce
confusion, and make their semantics rigid. Improves efficiency of
resched_task and some cpu_idle routines.
* In resched_task:
- TIF_NEED_RESCHED is only cleared with the task's runqueue lock held,
and as we hold it during resched_task, then there is no need for an
atomic test and set there. The only other time this should be set is
when the task's quantum expires, in the timer interrupt - this is
protected against because the rq lock is irq-safe.
- If TIF_NEED_RESCHED is set, then we don't need to do anything. It
won't get unset until the task get's schedule()d off.
- If we are running on the same CPU as the task we resched, then set
TIF_NEED_RESCHED and no further action is required.
- If we are running on another CPU, and TIF_POLLING_NRFLAG is *not* set
after TIF_NEED_RESCHED has been set, then we need to send an IPI.
Using these rules, we are able to remove the test and set operation in
resched_task, and make clear the previously vague semantics of
POLLING_NRFLAG.
* In idle routines:
- Enter cpu_idle with preempt disabled. When the need_resched() condition
becomes true, explicitly call schedule(). This makes things a bit clearer
(IMO), but haven't updated all architectures yet.
- Many do a test and clear of TIF_NEED_RESCHED for some reason. According
to the resched_task rules, this isn't needed (and actually breaks the
assumption that TIF_NEED_RESCHED is only cleared with the runqueue lock
held). So remove that. Generally one less locked memory op when switching
to the idle thread.
- Many idle routines clear TIF_POLLING_NRFLAG, and only set it in the inner
most polling idle loops. The above resched_task semantics allow it to be
set until before the last time need_resched() is checked before going into
a halt requiring interrupt wakeup.
Many idle routines simply never enter such a halt, and so POLLING_NRFLAG
can be always left set, completely eliminating resched IPIs when rescheduling
the idle task.
POLLING_NRFLAG width can be increased, to reduce the chance of resched IPIs.
Signed-off-by: Nick Piggin <npiggin@suse.de>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: Con Kolivas <kernel@kolivas.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-11-08 22:39:04 -07:00
|
|
|
set_thread_flag(TIF_POLLING_NRFLAG);
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/* endless idle loop with no priority at all */
|
|
|
|
while (1) {
|
|
|
|
while (!need_resched())
|
|
|
|
barrier();
|
2005-11-08 22:39:01 -07:00
|
|
|
preempt_enable_no_resched();
|
2005-04-16 16:20:36 -06:00
|
|
|
schedule();
|
2005-11-08 22:39:01 -07:00
|
|
|
preempt_disable();
|
2005-04-16 16:20:36 -06:00
|
|
|
check_pgt_cache();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-01-13 22:05:21 -07:00
|
|
|
#define COMMAND_GLOBAL F_EXTEND(0xfffe0030)
|
2005-04-16 16:20:36 -06:00
|
|
|
#define CMD_RESET 5 /* reset any module */
|
|
|
|
|
|
|
|
/*
|
|
|
|
** The Wright Brothers and Gecko systems have a H/W problem
|
|
|
|
** (Lasi...'nuf said) may cause a broadcast reset to lockup
|
|
|
|
** the system. An HVERSION dependent PDC call was developed
|
|
|
|
** to perform a "safe", platform specific broadcast reset instead
|
|
|
|
** of kludging up all the code.
|
|
|
|
**
|
|
|
|
** Older machines which do not implement PDC_BROADCAST_RESET will
|
|
|
|
** return (with an error) and the regular broadcast reset can be
|
|
|
|
** issued. Obviously, if the PDC does implement PDC_BROADCAST_RESET
|
|
|
|
** the PDC call will not return (the system will be reset).
|
|
|
|
*/
|
|
|
|
void machine_restart(char *cmd)
|
|
|
|
{
|
|
|
|
#ifdef FASTBOOT_SELFTEST_SUPPORT
|
|
|
|
/*
|
|
|
|
** If user has modified the Firmware Selftest Bitmap,
|
|
|
|
** run the tests specified in the bitmap after the
|
|
|
|
** system is rebooted w/PDC_DO_RESET.
|
|
|
|
**
|
|
|
|
** ftc_bitmap = 0x1AUL "Skip destructive memory tests"
|
|
|
|
**
|
|
|
|
** Using "directed resets" at each processor with the MEM_TOC
|
|
|
|
** vector cleared will also avoid running destructive
|
|
|
|
** memory self tests. (Not implemented yet)
|
|
|
|
*/
|
|
|
|
if (ftc_bitmap) {
|
|
|
|
pdc_do_firm_test_reset(ftc_bitmap);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
/* set up a new led state on systems shipped with a LED State panel */
|
|
|
|
pdc_chassis_send_status(PDC_CHASSIS_DIRECT_SHUTDOWN);
|
|
|
|
|
|
|
|
/* "Normal" system reset */
|
|
|
|
pdc_do_reset();
|
|
|
|
|
|
|
|
/* Nope...box should reset with just CMD_RESET now */
|
|
|
|
gsc_writel(CMD_RESET, COMMAND_GLOBAL);
|
|
|
|
|
|
|
|
/* Wait for RESET to lay us to rest. */
|
|
|
|
while (1) ;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
void machine_halt(void)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
** The LED/ChassisCodes are updated by the led_halt()
|
|
|
|
** function, called by the reboot notifier chain.
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
|
2006-01-17 22:33:32 -07:00
|
|
|
void (*chassis_power_off)(void);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* This routine is called from sys_reboot to actually turn off the
|
|
|
|
* machine
|
|
|
|
*/
|
|
|
|
void machine_power_off(void)
|
|
|
|
{
|
|
|
|
/* If there is a registered power off handler, call it. */
|
2006-01-17 22:33:32 -07:00
|
|
|
if (chassis_power_off)
|
|
|
|
chassis_power_off();
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* Put the soft power button back under hardware control.
|
|
|
|
* If the user had already pressed the power button, the
|
|
|
|
* following call will immediately power off. */
|
|
|
|
pdc_soft_power_button(0);
|
|
|
|
|
|
|
|
pdc_chassis_send_status(PDC_CHASSIS_DIRECT_SHUTDOWN);
|
|
|
|
|
|
|
|
/* It seems we have no way to power the system off via
|
|
|
|
* software. The user has to press the button himself. */
|
|
|
|
|
|
|
|
printk(KERN_EMERG "System shut down completed.\n"
|
2009-07-06 14:05:40 -06:00
|
|
|
"Please power this system off now.");
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
2006-01-17 22:33:32 -07:00
|
|
|
void (*pm_power_off)(void) = machine_power_off;
|
|
|
|
EXPORT_SYMBOL(pm_power_off);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Create a kernel thread
|
|
|
|
*/
|
|
|
|
|
|
|
|
extern pid_t __kernel_thread(int (*fn)(void *), void *arg, unsigned long flags);
|
|
|
|
pid_t kernel_thread(int (*fn)(void *), void *arg, unsigned long flags)
|
|
|
|
{
|
|
|
|
|
|
|
|
/*
|
|
|
|
* FIXME: Once we are sure we don't need any debug here,
|
|
|
|
* kernel_thread can become a #define.
|
|
|
|
*/
|
|
|
|
|
|
|
|
return __kernel_thread(fn, arg, flags);
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(kernel_thread);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free current thread data structures etc..
|
|
|
|
*/
|
|
|
|
void exit_thread(void)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void flush_thread(void)
|
|
|
|
{
|
|
|
|
/* Only needs to handle fpu stuff or perf monitors.
|
|
|
|
** REVISIT: several arches implement a "lazy fpu state".
|
|
|
|
*/
|
|
|
|
set_fs(USER_DS);
|
|
|
|
}
|
|
|
|
|
|
|
|
void release_thread(struct task_struct *dead_task)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Fill in the FPU structure for a core dump.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int dump_fpu (struct pt_regs * regs, elf_fpregset_t *r)
|
|
|
|
{
|
|
|
|
if (regs == NULL)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
memcpy(r, regs->fr, sizeof *r);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int dump_task_fpu (struct task_struct *tsk, elf_fpregset_t *r)
|
|
|
|
{
|
|
|
|
memcpy(r, tsk->thread.regs.fr, sizeof(*r));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Note that "fork()" is implemented in terms of clone, with
|
|
|
|
parameters (SIGCHLD, regs->gr[30], regs). */
|
|
|
|
int
|
|
|
|
sys_clone(unsigned long clone_flags, unsigned long usp,
|
|
|
|
struct pt_regs *regs)
|
|
|
|
{
|
2005-10-21 20:53:04 -06:00
|
|
|
/* Arugments from userspace are:
|
|
|
|
r26 = Clone flags.
|
|
|
|
r25 = Child stack.
|
|
|
|
r24 = parent_tidptr.
|
|
|
|
r23 = Is the TLS storage descriptor
|
|
|
|
r22 = child_tidptr
|
|
|
|
|
|
|
|
However, these last 3 args are only examined
|
|
|
|
if the proper flags are set. */
|
2009-02-13 15:58:29 -07:00
|
|
|
int __user *parent_tidptr = (int __user *)regs->gr[24];
|
|
|
|
int __user *child_tidptr = (int __user *)regs->gr[22];
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* usp must be word aligned. This also prevents users from
|
|
|
|
* passing in the value 1 (which is the signal for a special
|
|
|
|
* return for a kernel thread) */
|
|
|
|
usp = ALIGN(usp, 4);
|
|
|
|
|
|
|
|
/* A zero value for usp means use the current stack */
|
2005-10-21 20:53:04 -06:00
|
|
|
if (usp == 0)
|
|
|
|
usp = regs->gr[30];
|
2005-04-16 16:20:36 -06:00
|
|
|
|
2005-10-21 20:53:04 -06:00
|
|
|
return do_fork(clone_flags, usp, regs, 0, parent_tidptr, child_tidptr);
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
sys_vfork(struct pt_regs *regs)
|
|
|
|
{
|
|
|
|
return do_fork(CLONE_VFORK | CLONE_VM | SIGCHLD, regs->gr[30], regs, 0, NULL, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2009-04-02 17:56:59 -06:00
|
|
|
copy_thread(unsigned long clone_flags, unsigned long usp,
|
2005-04-16 16:20:36 -06:00
|
|
|
unsigned long unused, /* in ia64 this is "user_stack_size" */
|
|
|
|
struct task_struct * p, struct pt_regs * pregs)
|
|
|
|
{
|
|
|
|
struct pt_regs * cregs = &(p->thread.regs);
|
2006-01-12 02:05:55 -07:00
|
|
|
void *stack = task_stack_page(p);
|
2005-04-16 16:20:36 -06:00
|
|
|
|
|
|
|
/* We have to use void * instead of a function pointer, because
|
|
|
|
* function pointers aren't a pointer to the function on 64-bit.
|
|
|
|
* Make them const so the compiler knows they live in .text */
|
|
|
|
extern void * const ret_from_kernel_thread;
|
|
|
|
extern void * const child_return;
|
|
|
|
#ifdef CONFIG_HPUX
|
|
|
|
extern void * const hpux_child_return;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
*cregs = *pregs;
|
|
|
|
|
|
|
|
/* Set the return value for the child. Note that this is not
|
|
|
|
actually restored by the syscall exit path, but we put it
|
|
|
|
here for consistency in case of signals. */
|
|
|
|
cregs->gr[28] = 0; /* child */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We need to differentiate between a user fork and a
|
|
|
|
* kernel fork. We can't use user_mode, because the
|
|
|
|
* the syscall path doesn't save iaoq. Right now
|
|
|
|
* We rely on the fact that kernel_thread passes
|
|
|
|
* in zero for usp.
|
|
|
|
*/
|
|
|
|
if (usp == 1) {
|
|
|
|
/* kernel thread */
|
2006-01-12 02:05:55 -07:00
|
|
|
cregs->ksp = (unsigned long)stack + THREAD_SZ_ALGN;
|
2005-04-16 16:20:36 -06:00
|
|
|
/* Must exit via ret_from_kernel_thread in order
|
|
|
|
* to call schedule_tail()
|
|
|
|
*/
|
|
|
|
cregs->kpc = (unsigned long) &ret_from_kernel_thread;
|
|
|
|
/*
|
|
|
|
* Copy function and argument to be called from
|
|
|
|
* ret_from_kernel_thread.
|
|
|
|
*/
|
2007-01-28 06:58:52 -07:00
|
|
|
#ifdef CONFIG_64BIT
|
2005-04-16 16:20:36 -06:00
|
|
|
cregs->gr[27] = pregs->gr[27];
|
|
|
|
#endif
|
|
|
|
cregs->gr[26] = pregs->gr[26];
|
|
|
|
cregs->gr[25] = pregs->gr[25];
|
|
|
|
} else {
|
|
|
|
/* user thread */
|
|
|
|
/*
|
|
|
|
* Note that the fork wrappers are responsible
|
|
|
|
* for setting gr[21].
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Use same stack depth as parent */
|
2006-01-12 02:05:55 -07:00
|
|
|
cregs->ksp = (unsigned long)stack
|
2005-04-16 16:20:36 -06:00
|
|
|
+ (pregs->gr[21] & (THREAD_SIZE - 1));
|
|
|
|
cregs->gr[30] = usp;
|
|
|
|
if (p->personality == PER_HPUX) {
|
|
|
|
#ifdef CONFIG_HPUX
|
|
|
|
cregs->kpc = (unsigned long) &hpux_child_return;
|
|
|
|
#else
|
|
|
|
BUG();
|
|
|
|
#endif
|
|
|
|
} else {
|
|
|
|
cregs->kpc = (unsigned long) &child_return;
|
|
|
|
}
|
2005-10-21 20:53:04 -06:00
|
|
|
/* Setup thread TLS area from the 4th parameter in clone */
|
|
|
|
if (clone_flags & CLONE_SETTLS)
|
|
|
|
cregs->cr27 = pregs->gr[23];
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned long thread_saved_pc(struct task_struct *t)
|
|
|
|
{
|
|
|
|
return t->thread.regs.kpc;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* sys_execve() executes a new program.
|
|
|
|
*/
|
|
|
|
|
|
|
|
asmlinkage int sys_execve(struct pt_regs *regs)
|
|
|
|
{
|
|
|
|
int error;
|
|
|
|
char *filename;
|
|
|
|
|
|
|
|
filename = getname((const char __user *) regs->gr[26]);
|
|
|
|
error = PTR_ERR(filename);
|
|
|
|
if (IS_ERR(filename))
|
|
|
|
goto out;
|
2006-10-26 10:06:07 -06:00
|
|
|
error = do_execve(filename, (char __user * __user *) regs->gr[25],
|
|
|
|
(char __user * __user *) regs->gr[24], regs);
|
2005-04-16 16:20:36 -06:00
|
|
|
putname(filename);
|
|
|
|
out:
|
|
|
|
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
2006-10-02 03:18:31 -06:00
|
|
|
extern int __execve(const char *filename, char *const argv[],
|
|
|
|
char *const envp[], struct task_struct *task);
|
|
|
|
int kernel_execve(const char *filename, char *const argv[], char *const envp[])
|
|
|
|
{
|
|
|
|
return __execve(filename, argv, envp, current);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned long
|
2005-04-16 16:20:36 -06:00
|
|
|
get_wchan(struct task_struct *p)
|
|
|
|
{
|
|
|
|
struct unwind_frame_info info;
|
|
|
|
unsigned long ip;
|
|
|
|
int count = 0;
|
2007-05-30 00:36:00 -06:00
|
|
|
|
|
|
|
if (!p || p == current || p->state == TASK_RUNNING)
|
|
|
|
return 0;
|
|
|
|
|
2005-04-16 16:20:36 -06:00
|
|
|
/*
|
|
|
|
* These bracket the sleeping functions..
|
|
|
|
*/
|
|
|
|
|
|
|
|
unwind_frame_init_from_blocked_task(&info, p);
|
|
|
|
do {
|
|
|
|
if (unwind_once(&info) < 0)
|
|
|
|
return 0;
|
|
|
|
ip = info.ip;
|
|
|
|
if (!in_sched_functions(ip))
|
|
|
|
return ip;
|
|
|
|
} while (count++ < 16);
|
|
|
|
return 0;
|
|
|
|
}
|
2009-03-15 14:49:55 -06:00
|
|
|
|
|
|
|
#ifdef CONFIG_64BIT
|
|
|
|
void *dereference_function_descriptor(void *ptr)
|
|
|
|
{
|
|
|
|
Elf64_Fdesc *desc = ptr;
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
if (!probe_kernel_address(&desc->addr, p))
|
|
|
|
ptr = p;
|
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
#endif
|