227 lines
6.3 KiB
C++
227 lines
6.3 KiB
C++
/*
|
|
* Copyright (c) 2005 The Regents of The University of Michigan
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met: redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer;
|
|
* redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution;
|
|
* neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* Authors: Nathan Binkert
|
|
*/
|
|
|
|
#include <string>
|
|
|
|
#include "arch/x86/isa_traits.hh"
|
|
#include "arch/x86/stacktrace.hh"
|
|
#include "arch/x86/vtophys.hh"
|
|
#include "base/bitfield.hh"
|
|
#include "base/trace.hh"
|
|
#include "cpu/base.hh"
|
|
#include "cpu/thread_context.hh"
|
|
#include "mem/vport.hh"
|
|
#include "sim/system.hh"
|
|
|
|
using namespace std;
|
|
namespace X86ISA
|
|
{
|
|
ProcessInfo::ProcessInfo(ThreadContext *_tc)
|
|
: tc(_tc)
|
|
{
|
|
Addr addr = 0;
|
|
|
|
VirtualPort *vp;
|
|
|
|
vp = tc->getVirtPort();
|
|
|
|
if (!tc->getSystemPtr()->kernelSymtab->findAddress("thread_info_size", addr))
|
|
panic("thread info not compiled into kernel\n");
|
|
thread_info_size = vp->readGtoH<int32_t>(addr);
|
|
|
|
if (!tc->getSystemPtr()->kernelSymtab->findAddress("task_struct_size", addr))
|
|
panic("thread info not compiled into kernel\n");
|
|
task_struct_size = vp->readGtoH<int32_t>(addr);
|
|
|
|
if (!tc->getSystemPtr()->kernelSymtab->findAddress("thread_info_task", addr))
|
|
panic("thread info not compiled into kernel\n");
|
|
task_off = vp->readGtoH<int32_t>(addr);
|
|
|
|
if (!tc->getSystemPtr()->kernelSymtab->findAddress("task_struct_pid", addr))
|
|
panic("thread info not compiled into kernel\n");
|
|
pid_off = vp->readGtoH<int32_t>(addr);
|
|
|
|
if (!tc->getSystemPtr()->kernelSymtab->findAddress("task_struct_comm", addr))
|
|
panic("thread info not compiled into kernel\n");
|
|
name_off = vp->readGtoH<int32_t>(addr);
|
|
}
|
|
|
|
Addr
|
|
ProcessInfo::task(Addr ksp) const
|
|
{
|
|
Addr base = ksp & ~0x3fff;
|
|
if (base == ULL(0xfffffc0000000000))
|
|
return 0;
|
|
|
|
Addr tsk;
|
|
|
|
VirtualPort *vp;
|
|
|
|
vp = tc->getVirtPort();
|
|
tsk = vp->readGtoH<Addr>(base + task_off);
|
|
|
|
return tsk;
|
|
}
|
|
|
|
int
|
|
ProcessInfo::pid(Addr ksp) const
|
|
{
|
|
Addr task = this->task(ksp);
|
|
if (!task)
|
|
return -1;
|
|
|
|
uint16_t pd;
|
|
|
|
VirtualPort *vp;
|
|
|
|
vp = tc->getVirtPort();
|
|
pd = vp->readGtoH<uint16_t>(task + pid_off);
|
|
|
|
return pd;
|
|
}
|
|
|
|
string
|
|
ProcessInfo::name(Addr ksp) const
|
|
{
|
|
Addr task = this->task(ksp);
|
|
if (!task)
|
|
return "console";
|
|
|
|
char comm[256];
|
|
CopyStringOut(tc, comm, task + name_off, sizeof(comm));
|
|
if (!comm[0])
|
|
return "startup";
|
|
|
|
return comm;
|
|
}
|
|
|
|
StackTrace::StackTrace()
|
|
: tc(0), stack(64)
|
|
{
|
|
}
|
|
|
|
StackTrace::StackTrace(ThreadContext *_tc, StaticInstPtr inst)
|
|
: tc(0), stack(64)
|
|
{
|
|
trace(_tc, inst);
|
|
}
|
|
|
|
StackTrace::~StackTrace()
|
|
{
|
|
}
|
|
|
|
void
|
|
StackTrace::trace(ThreadContext *_tc, bool is_call)
|
|
{
|
|
}
|
|
|
|
bool
|
|
StackTrace::isEntry(Addr addr)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
bool
|
|
StackTrace::decodeStack(MachInst inst, int &disp)
|
|
{
|
|
disp = 0;
|
|
return true;
|
|
}
|
|
|
|
bool
|
|
StackTrace::decodeSave(MachInst inst, int ®, int &disp)
|
|
{
|
|
reg = 0;
|
|
disp = 0;
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
* Decode the function prologue for the function we're in, and note
|
|
* which registers are stored where, and how large the stack frame is.
|
|
*/
|
|
bool
|
|
StackTrace::decodePrologue(Addr sp, Addr callpc, Addr func,
|
|
int &size, Addr &ra)
|
|
{
|
|
size = 0;
|
|
ra = 0;
|
|
|
|
for (Addr pc = func; pc < callpc; pc += sizeof(MachInst)) {
|
|
MachInst inst;
|
|
CopyOut(tc, (uint8_t *)&inst, pc, sizeof(MachInst));
|
|
|
|
int reg, disp;
|
|
if (decodeStack(inst, disp)) {
|
|
if (size) {
|
|
// panic("decoding frame size again");
|
|
return true;
|
|
}
|
|
size += disp;
|
|
} else if (decodeSave(inst, reg, disp)) {
|
|
if (!ra && reg == ReturnAddressReg) {
|
|
CopyOut(tc, (uint8_t *)&ra, sp + disp, sizeof(Addr));
|
|
if (!ra) {
|
|
// panic("no return address value pc=%#x\n", pc);
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
#if TRACING_ON
|
|
void
|
|
StackTrace::dump()
|
|
{
|
|
StringWrap name(tc->getCpuPtr()->name());
|
|
SymbolTable *symtab = tc->getSystemPtr()->kernelSymtab;
|
|
|
|
DPRINTFN("------ Stack ------\n");
|
|
|
|
string symbol;
|
|
for (int i = 0, size = stack.size(); i < size; ++i) {
|
|
Addr addr = stack[size - i - 1];
|
|
if (addr == user)
|
|
symbol = "user";
|
|
else if (addr == console)
|
|
symbol = "console";
|
|
else if (addr == unknown)
|
|
symbol = "unknown";
|
|
else
|
|
symtab->findSymbol(addr, symbol);
|
|
|
|
DPRINTFN("%#x: %s\n", addr, symbol);
|
|
}
|
|
}
|
|
#endif
|
|
}
|