2005-06-24 13:01:16 +08:00
|
|
|
/*
|
|
|
|
* arch/xtensa/kernel/process.c
|
|
|
|
*
|
|
|
|
* Xtensa Processor version.
|
|
|
|
*
|
|
|
|
* 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) 2001 - 2005 Tensilica Inc.
|
|
|
|
*
|
|
|
|
* Joe Taylor <joe@tensilica.com, joetylr@yahoo.com>
|
|
|
|
* Chris Zankel <chris@zankel.net>
|
|
|
|
* Marc Gauthier <marc@tensilica.com, marc@alumni.uwaterloo.ca>
|
|
|
|
* Kevin Chea
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/sched.h>
|
2017-02-09 01:51:35 +08:00
|
|
|
#include <linux/sched/debug.h>
|
2017-02-09 01:51:36 +08:00
|
|
|
#include <linux/sched/task.h>
|
2017-02-09 01:51:37 +08:00
|
|
|
#include <linux/sched/task_stack.h>
|
2005-06-24 13:01:16 +08:00
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/smp.h>
|
|
|
|
#include <linux/stddef.h>
|
|
|
|
#include <linux/unistd.h>
|
|
|
|
#include <linux/ptrace.h>
|
|
|
|
#include <linux/elf.h>
|
2016-01-24 15:32:10 +08:00
|
|
|
#include <linux/hw_breakpoint.h>
|
2005-06-24 13:01:16 +08:00
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/prctl.h>
|
|
|
|
#include <linux/init_task.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/mqueue.h>
|
2007-08-05 00:27:30 +08:00
|
|
|
#include <linux/fs.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 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2012-08-22 23:27:34 +08:00
|
|
|
#include <linux/rcupdate.h>
|
2005-06-24 13:01:16 +08:00
|
|
|
|
|
|
|
#include <asm/pgtable.h>
|
2016-12-25 03:46:01 +08:00
|
|
|
#include <linux/uaccess.h>
|
2005-06-24 13:01:16 +08:00
|
|
|
#include <asm/io.h>
|
|
|
|
#include <asm/processor.h>
|
|
|
|
#include <asm/platform.h>
|
|
|
|
#include <asm/mmu.h>
|
|
|
|
#include <asm/irq.h>
|
2011-07-27 07:09:06 +08:00
|
|
|
#include <linux/atomic.h>
|
2005-09-10 02:57:26 +08:00
|
|
|
#include <asm/asm-offsets.h>
|
2006-12-10 18:18:48 +08:00
|
|
|
#include <asm/regs.h>
|
2016-01-24 15:32:10 +08:00
|
|
|
#include <asm/hw_breakpoint.h>
|
2005-06-24 13:01:16 +08:00
|
|
|
|
|
|
|
extern void ret_from_fork(void);
|
2012-10-25 15:10:50 +08:00
|
|
|
extern void ret_from_kernel_thread(void);
|
2005-06-24 13:01:16 +08:00
|
|
|
|
2006-03-07 07:42:47 +08:00
|
|
|
void (*pm_power_off)(void) = NULL;
|
|
|
|
EXPORT_SYMBOL(pm_power_off);
|
|
|
|
|
2005-06-24 13:01:16 +08:00
|
|
|
|
Kbuild: rename CC_STACKPROTECTOR[_STRONG] config variables
The changes to automatically test for working stack protector compiler
support in the Kconfig files removed the special STACKPROTECTOR_AUTO
option that picked the strongest stack protector that the compiler
supported.
That was all a nice cleanup - it makes no sense to have the AUTO case
now that the Kconfig phase can just determine the compiler support
directly.
HOWEVER.
It also meant that doing "make oldconfig" would now _disable_ the strong
stackprotector if you had AUTO enabled, because in a legacy config file,
the sane stack protector configuration would look like
CONFIG_HAVE_CC_STACKPROTECTOR=y
# CONFIG_CC_STACKPROTECTOR_NONE is not set
# CONFIG_CC_STACKPROTECTOR_REGULAR is not set
# CONFIG_CC_STACKPROTECTOR_STRONG is not set
CONFIG_CC_STACKPROTECTOR_AUTO=y
and when you ran this through "make oldconfig" with the Kbuild changes,
it would ask you about the regular CONFIG_CC_STACKPROTECTOR (that had
been renamed from CONFIG_CC_STACKPROTECTOR_REGULAR to just
CONFIG_CC_STACKPROTECTOR), but it would think that the STRONG version
used to be disabled (because it was really enabled by AUTO), and would
disable it in the new config, resulting in:
CONFIG_HAVE_CC_STACKPROTECTOR=y
CONFIG_CC_HAS_STACKPROTECTOR_NONE=y
CONFIG_CC_STACKPROTECTOR=y
# CONFIG_CC_STACKPROTECTOR_STRONG is not set
CONFIG_CC_HAS_SANE_STACKPROTECTOR=y
That's dangerously subtle - people could suddenly find themselves with
the weaker stack protector setup without even realizing.
The solution here is to just rename not just the old RECULAR stack
protector option, but also the strong one. This does that by just
removing the CC_ prefix entirely for the user choices, because it really
is not about the compiler support (the compiler support now instead
automatially impacts _visibility_ of the options to users).
This results in "make oldconfig" actually asking the user for their
choice, so that we don't have any silent subtle security model changes.
The end result would generally look like this:
CONFIG_HAVE_CC_STACKPROTECTOR=y
CONFIG_CC_HAS_STACKPROTECTOR_NONE=y
CONFIG_STACKPROTECTOR=y
CONFIG_STACKPROTECTOR_STRONG=y
CONFIG_CC_HAS_SANE_STACKPROTECTOR=y
where the "CC_" versions really are about internal compiler
infrastructure, not the user selections.
Acked-by: Masahiro Yamada <yamada.masahiro@socionext.com>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2018-06-14 11:21:18 +08:00
|
|
|
#ifdef CONFIG_STACKPROTECTOR
|
2017-03-27 17:44:47 +08:00
|
|
|
#include <linux/stackprotector.h>
|
|
|
|
unsigned long __stack_chk_guard __read_mostly;
|
|
|
|
EXPORT_SYMBOL(__stack_chk_guard);
|
|
|
|
#endif
|
|
|
|
|
2008-02-13 05:17:07 +08:00
|
|
|
#if XTENSA_HAVE_COPROCESSORS
|
|
|
|
|
|
|
|
void coprocessor_release_all(struct thread_info *ti)
|
|
|
|
{
|
|
|
|
unsigned long cpenable;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* Make sure we don't switch tasks during this operation. */
|
|
|
|
|
|
|
|
preempt_disable();
|
|
|
|
|
|
|
|
/* Walk through all cp owners and release it for the requested one. */
|
|
|
|
|
|
|
|
cpenable = ti->cpenable;
|
|
|
|
|
|
|
|
for (i = 0; i < XCHAL_CP_MAX; i++) {
|
|
|
|
if (coprocessor_owner[i] == ti) {
|
|
|
|
coprocessor_owner[i] = 0;
|
|
|
|
cpenable &= ~(1 << i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ti->cpenable = cpenable;
|
2018-11-27 08:30:51 +08:00
|
|
|
if (ti == current_thread_info())
|
|
|
|
xtensa_set_sr(0, cpenable);
|
2008-02-13 05:17:07 +08:00
|
|
|
|
|
|
|
preempt_enable();
|
|
|
|
}
|
|
|
|
|
|
|
|
void coprocessor_flush_all(struct thread_info *ti)
|
|
|
|
{
|
2018-11-27 05:29:41 +08:00
|
|
|
unsigned long cpenable, old_cpenable;
|
2008-02-13 05:17:07 +08:00
|
|
|
int i;
|
|
|
|
|
|
|
|
preempt_disable();
|
|
|
|
|
2018-11-28 08:27:47 +08:00
|
|
|
old_cpenable = xtensa_get_sr(cpenable);
|
2008-02-13 05:17:07 +08:00
|
|
|
cpenable = ti->cpenable;
|
2018-11-28 08:27:47 +08:00
|
|
|
xtensa_set_sr(cpenable, cpenable);
|
2008-02-13 05:17:07 +08:00
|
|
|
|
|
|
|
for (i = 0; i < XCHAL_CP_MAX; i++) {
|
|
|
|
if ((cpenable & 1) != 0 && coprocessor_owner[i] == ti)
|
|
|
|
coprocessor_flush(ti, i);
|
|
|
|
cpenable >>= 1;
|
|
|
|
}
|
2018-11-28 08:27:47 +08:00
|
|
|
xtensa_set_sr(old_cpenable, cpenable);
|
2008-02-13 05:17:07 +08:00
|
|
|
|
|
|
|
preempt_enable();
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2005-06-24 13:01:16 +08:00
|
|
|
/*
|
|
|
|
* Powermanagement idle function, if any is provided by the platform.
|
|
|
|
*/
|
2013-03-22 05:50:04 +08:00
|
|
|
void arch_cpu_idle(void)
|
2005-06-24 13:01:16 +08:00
|
|
|
{
|
2013-03-22 05:50:04 +08:00
|
|
|
platform_idle();
|
2005-06-24 13:01:16 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2008-02-13 05:17:07 +08:00
|
|
|
* This is called when the thread calls exit().
|
2005-06-24 13:01:16 +08:00
|
|
|
*/
|
2016-05-21 08:00:20 +08:00
|
|
|
void exit_thread(struct task_struct *tsk)
|
2005-06-24 13:01:16 +08:00
|
|
|
{
|
2008-02-13 05:17:07 +08:00
|
|
|
#if XTENSA_HAVE_COPROCESSORS
|
2016-05-21 08:00:20 +08:00
|
|
|
coprocessor_release_all(task_thread_info(tsk));
|
2008-02-13 05:17:07 +08:00
|
|
|
#endif
|
2005-06-24 13:01:16 +08:00
|
|
|
}
|
|
|
|
|
2008-02-13 05:17:07 +08:00
|
|
|
/*
|
|
|
|
* Flush thread state. This is called when a thread does an execve()
|
|
|
|
* Note that we flush coprocessor registers for the case execve fails.
|
|
|
|
*/
|
2005-06-24 13:01:16 +08:00
|
|
|
void flush_thread(void)
|
|
|
|
{
|
2008-02-13 05:17:07 +08:00
|
|
|
#if XTENSA_HAVE_COPROCESSORS
|
|
|
|
struct thread_info *ti = current_thread_info();
|
|
|
|
coprocessor_flush_all(ti);
|
|
|
|
coprocessor_release_all(ti);
|
|
|
|
#endif
|
2016-01-24 15:32:10 +08:00
|
|
|
flush_ptrace_hw_breakpoint(current);
|
2008-02-13 05:17:07 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2012-05-17 06:03:51 +08:00
|
|
|
* this gets called so that we can store coprocessor state into memory and
|
|
|
|
* copy the current task into the new thread.
|
2008-02-13 05:17:07 +08:00
|
|
|
*/
|
2012-05-17 06:03:51 +08:00
|
|
|
int arch_dup_task_struct(struct task_struct *dst, struct task_struct *src)
|
2008-02-13 05:17:07 +08:00
|
|
|
{
|
|
|
|
#if XTENSA_HAVE_COPROCESSORS
|
2012-05-17 06:03:51 +08:00
|
|
|
coprocessor_flush_all(task_thread_info(src));
|
2008-02-13 05:17:07 +08:00
|
|
|
#endif
|
2012-05-17 06:03:51 +08:00
|
|
|
*dst = *src;
|
|
|
|
return 0;
|
2005-06-24 13:01:16 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy thread.
|
|
|
|
*
|
2012-10-25 15:10:50 +08:00
|
|
|
* There are two modes in which this function is called:
|
|
|
|
* 1) Userspace thread creation,
|
|
|
|
* regs != NULL, usp_thread_fn is userspace stack pointer.
|
|
|
|
* It is expected to copy parent regs (in case CLONE_VM is not set
|
|
|
|
* in the clone_flags) and set up passed usp in the childregs.
|
|
|
|
* 2) Kernel thread creation,
|
|
|
|
* regs == NULL, usp_thread_fn is the function to run in the new thread
|
|
|
|
* and thread_fn_arg is its parameter.
|
|
|
|
* childregs are not used for the kernel threads.
|
|
|
|
*
|
2005-06-24 13:01:16 +08:00
|
|
|
* The stack layout for the new thread looks like this:
|
|
|
|
*
|
2012-10-25 15:10:50 +08:00
|
|
|
* +------------------------+
|
2005-06-24 13:01:16 +08:00
|
|
|
* | childregs |
|
|
|
|
* +------------------------+ <- thread.sp = sp in dummy-frame
|
|
|
|
* | dummy-frame | (saved in dummy-frame spill-area)
|
|
|
|
* +------------------------+
|
|
|
|
*
|
2012-10-25 15:10:50 +08:00
|
|
|
* We create a dummy frame to return to either ret_from_fork or
|
|
|
|
* ret_from_kernel_thread:
|
|
|
|
* a0 points to ret_from_fork/ret_from_kernel_thread (simulating a call4)
|
2005-06-24 13:01:16 +08:00
|
|
|
* sp points to itself (thread.sp)
|
2012-10-25 15:10:50 +08:00
|
|
|
* a2, a3 are unused for userspace threads,
|
|
|
|
* a2 points to thread_fn, a3 holds thread_fn arg for kernel threads.
|
2005-06-24 13:01:16 +08:00
|
|
|
*
|
|
|
|
* Note: This is a pristine frame, so we don't need any spill region on top of
|
|
|
|
* childregs.
|
2012-10-15 07:55:35 +08:00
|
|
|
*
|
|
|
|
* The fun part: if we're keeping the same VM (i.e. cloning a thread,
|
|
|
|
* not an entire process), we're normally given a new usp, and we CANNOT share
|
|
|
|
* any live address register windows. If we just copy those live frames over,
|
|
|
|
* the two threads (parent and child) will overflow the same frames onto the
|
|
|
|
* parent stack at different times, likely corrupting the parent stack (esp.
|
|
|
|
* if the parent returns from functions that called clone() and calls new
|
|
|
|
* ones, before the child overflows its now old copies of its parent windows).
|
|
|
|
* One solution is to spill windows to the parent stack, but that's fairly
|
|
|
|
* involved. Much simpler to just not copy those live frames across.
|
2005-06-24 13:01:16 +08:00
|
|
|
*/
|
|
|
|
|
2012-10-25 15:10:50 +08:00
|
|
|
int copy_thread(unsigned long clone_flags, unsigned long usp_thread_fn,
|
2012-10-23 10:51:14 +08:00
|
|
|
unsigned long thread_fn_arg, struct task_struct *p)
|
2005-06-24 13:01:16 +08:00
|
|
|
{
|
2012-10-25 15:10:50 +08:00
|
|
|
struct pt_regs *childregs = task_pt_regs(p);
|
2005-06-24 13:01:16 +08:00
|
|
|
|
2012-10-18 14:08:20 +08:00
|
|
|
#if (XTENSA_HAVE_COPROCESSORS || XTENSA_HAVE_IO_PORTS)
|
|
|
|
struct thread_info *ti;
|
|
|
|
#endif
|
|
|
|
|
2005-06-24 13:01:16 +08:00
|
|
|
/* Create a call4 dummy-frame: a0 = 0, a1 = childregs. */
|
2015-01-27 06:15:10 +08:00
|
|
|
SPILL_SLOT(childregs, 1) = (unsigned long)childregs;
|
|
|
|
SPILL_SLOT(childregs, 0) = 0;
|
2005-06-24 13:01:16 +08:00
|
|
|
|
|
|
|
p->thread.sp = (unsigned long)childregs;
|
2008-02-13 05:17:07 +08:00
|
|
|
|
2012-10-25 15:10:50 +08:00
|
|
|
if (!(p->flags & PF_KTHREAD)) {
|
|
|
|
struct pt_regs *regs = current_pt_regs();
|
|
|
|
unsigned long usp = usp_thread_fn ?
|
|
|
|
usp_thread_fn : regs->areg[1];
|
|
|
|
|
|
|
|
p->thread.ra = MAKE_RA_FOR_CALL(
|
|
|
|
(unsigned long)ret_from_fork, 0x1);
|
2005-06-24 13:01:16 +08:00
|
|
|
|
2012-10-25 15:10:50 +08:00
|
|
|
/* This does not copy all the regs.
|
|
|
|
* In a bout of brilliance or madness,
|
|
|
|
* ARs beyond a0-a15 exist past the end of the struct.
|
|
|
|
*/
|
|
|
|
*childregs = *regs;
|
2005-06-24 13:01:16 +08:00
|
|
|
childregs->areg[1] = usp;
|
2012-10-25 15:10:50 +08:00
|
|
|
childregs->areg[2] = 0;
|
2012-10-25 04:15:21 +08:00
|
|
|
|
|
|
|
/* When sharing memory with the parent thread, the child
|
|
|
|
usually starts on a pristine stack, so we have to reset
|
|
|
|
windowbase, windowstart and wmask.
|
|
|
|
(Note that such a new thread is required to always create
|
|
|
|
an initial call4 frame)
|
|
|
|
The exception is vfork, where the new thread continues to
|
|
|
|
run on the parent's stack until it calls execve. This could
|
|
|
|
be a call8 or call12, which requires a legal stack frame
|
|
|
|
of the previous caller for the overflow handlers to work.
|
|
|
|
(Note that it's always legal to overflow live registers).
|
|
|
|
In this case, ensure to spill at least the stack pointer
|
|
|
|
of that frame. */
|
|
|
|
|
2012-10-15 07:55:35 +08:00
|
|
|
if (clone_flags & CLONE_VM) {
|
2012-10-25 04:15:21 +08:00
|
|
|
/* check that caller window is live and same stack */
|
|
|
|
int len = childregs->wmask & ~0xf;
|
|
|
|
if (regs->areg[1] == usp && len != 0) {
|
|
|
|
int callinc = (regs->areg[0] >> 30) & 3;
|
|
|
|
int caller_ars = XCHAL_NUM_AREGS - callinc * 4;
|
|
|
|
put_user(regs->areg[caller_ars+1],
|
|
|
|
(unsigned __user*)(usp - 12));
|
|
|
|
}
|
|
|
|
childregs->wmask = 1;
|
|
|
|
childregs->windowstart = 1;
|
|
|
|
childregs->windowbase = 0;
|
2012-10-15 07:55:35 +08:00
|
|
|
} else {
|
|
|
|
int len = childregs->wmask & ~0xf;
|
|
|
|
memcpy(&childregs->areg[XCHAL_NUM_AREGS - len/4],
|
|
|
|
®s->areg[XCHAL_NUM_AREGS - len/4], len);
|
|
|
|
}
|
2013-02-24 11:35:57 +08:00
|
|
|
|
|
|
|
/* The thread pointer is passed in the '4th argument' (= a5) */
|
2005-06-24 13:01:16 +08:00
|
|
|
if (clone_flags & CLONE_SETTLS)
|
2013-02-24 11:35:57 +08:00
|
|
|
childregs->threadptr = childregs->areg[5];
|
2005-06-24 13:01:16 +08:00
|
|
|
} else {
|
2012-10-25 15:10:50 +08:00
|
|
|
p->thread.ra = MAKE_RA_FOR_CALL(
|
|
|
|
(unsigned long)ret_from_kernel_thread, 1);
|
|
|
|
|
|
|
|
/* pass parameters to ret_from_kernel_thread:
|
|
|
|
* a2 = thread_fn, a3 = thread_fn arg
|
|
|
|
*/
|
2015-01-27 06:15:10 +08:00
|
|
|
SPILL_SLOT(childregs, 3) = thread_fn_arg;
|
|
|
|
SPILL_SLOT(childregs, 2) = usp_thread_fn;
|
2012-10-25 15:10:50 +08:00
|
|
|
|
|
|
|
/* Childregs are only used when we're going to userspace
|
|
|
|
* in which case start_thread will set them up.
|
|
|
|
*/
|
2005-06-24 13:01:16 +08:00
|
|
|
}
|
2008-02-13 05:17:07 +08:00
|
|
|
|
|
|
|
#if (XTENSA_HAVE_COPROCESSORS || XTENSA_HAVE_IO_PORTS)
|
|
|
|
ti = task_thread_info(p);
|
|
|
|
ti->cpenable = 0;
|
|
|
|
#endif
|
|
|
|
|
2016-01-24 15:32:10 +08:00
|
|
|
clear_ptrace_hw_breakpoint(p);
|
|
|
|
|
2005-06-24 13:01:16 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* These bracket the sleeping functions..
|
|
|
|
*/
|
|
|
|
|
|
|
|
unsigned long get_wchan(struct task_struct *p)
|
|
|
|
{
|
|
|
|
unsigned long sp, pc;
|
2006-01-12 17:05:50 +08:00
|
|
|
unsigned long stack_page = (unsigned long) task_stack_page(p);
|
2005-06-24 13:01:16 +08:00
|
|
|
int count = 0;
|
|
|
|
|
|
|
|
if (!p || p == current || p->state == TASK_RUNNING)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
sp = p->thread.sp;
|
|
|
|
pc = MAKE_PC_FROM_RA(p->thread.ra, p->thread.sp);
|
|
|
|
|
|
|
|
do {
|
|
|
|
if (sp < stack_page + sizeof(struct task_struct) ||
|
|
|
|
sp >= (stack_page + THREAD_SIZE) ||
|
|
|
|
pc == 0)
|
|
|
|
return 0;
|
|
|
|
if (!in_sched_functions(pc))
|
|
|
|
return pc;
|
|
|
|
|
|
|
|
/* Stack layout: sp-4: ra, sp-3: sp' */
|
|
|
|
|
2019-01-02 17:08:32 +08:00
|
|
|
pc = MAKE_PC_FROM_RA(SPILL_SLOT(sp, 0), sp);
|
|
|
|
sp = SPILL_SLOT(sp, 1);
|
2005-06-24 13:01:16 +08:00
|
|
|
} while (count++ < 16);
|
|
|
|
return 0;
|
|
|
|
}
|