2 * Copyright (c) 2005 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Nathan Binkert
33 #include "arch/alpha/isa_traits.hh"
34 #include "arch/alpha/stacktrace.hh"
35 #include "arch/alpha/vtophys.hh"
36 #include "base/bitfield.hh"
37 #include "base/trace.hh"
38 #include "cpu/base.hh"
39 #include "cpu/thread_context.hh"
40 #include "sim/system.hh"
46 ProcessInfo::ProcessInfo(ThreadContext
*_tc
)
53 vp
= tc
->getVirtPort();
55 if (!tc
->getSystemPtr()->kernelSymtab
->findAddress("thread_info_size", addr
))
56 panic("thread info not compiled into kernel\n");
57 thread_info_size
= vp
->readGtoH
<int32_t>(addr
);
59 if (!tc
->getSystemPtr()->kernelSymtab
->findAddress("task_struct_size", addr
))
60 panic("thread info not compiled into kernel\n");
61 task_struct_size
= vp
->readGtoH
<int32_t>(addr
);
63 if (!tc
->getSystemPtr()->kernelSymtab
->findAddress("thread_info_task", addr
))
64 panic("thread info not compiled into kernel\n");
65 task_off
= vp
->readGtoH
<int32_t>(addr
);
67 if (!tc
->getSystemPtr()->kernelSymtab
->findAddress("task_struct_pid", addr
))
68 panic("thread info not compiled into kernel\n");
69 pid_off
= vp
->readGtoH
<int32_t>(addr
);
71 if (!tc
->getSystemPtr()->kernelSymtab
->findAddress("task_struct_comm", addr
))
72 panic("thread info not compiled into kernel\n");
73 name_off
= vp
->readGtoH
<int32_t>(addr
);
77 ProcessInfo::task(Addr ksp
) const
79 Addr base
= ksp
& ~0x3fff;
80 if (base
== ULL(0xfffffc0000000000))
87 vp
= tc
->getVirtPort();
88 tsk
= vp
->readGtoH
<Addr
>(base
+ task_off
);
94 ProcessInfo::pid(Addr ksp
) const
96 Addr task
= this->task(ksp
);
104 vp
= tc
->getVirtPort();
105 pd
= vp
->readGtoH
<uint16_t>(task
+ pid_off
);
111 ProcessInfo::name(Addr ksp
) const
113 Addr task
= this->task(ksp
);
118 CopyStringOut(tc
, comm
, task
+ name_off
, sizeof(comm
));
125 StackTrace::StackTrace()
130 StackTrace::StackTrace(ThreadContext
*_tc
, StaticInstPtr inst
)
136 StackTrace::~StackTrace()
141 StackTrace::trace(ThreadContext
*_tc
, bool is_call
)
145 bool usermode
= (tc
->readMiscRegNoEffect(IPR_DTB_CM
) & 0x18) != 0;
147 Addr pc
= tc
->readNextPC();
148 bool kernel
= tc
->getSystemPtr()->kernelStart
<= pc
&&
149 pc
<= tc
->getSystemPtr()->kernelEnd
;
152 stack
.push_back(user
);
157 stack
.push_back(console
);
161 SymbolTable
*symtab
= tc
->getSystemPtr()->kernelSymtab
;
162 Addr ksp
= tc
->readIntReg(StackPointerReg
);
163 Addr bottom
= ksp
& ~0x3fff;
167 if (!symtab
->findNearestAddr(pc
, addr
))
168 panic("could not find address %#x", pc
);
170 stack
.push_back(addr
);
177 while (ksp
> bottom
) {
178 if (!symtab
->findNearestAddr(pc
, addr
))
179 panic("could not find symbol for pc=%#x", pc
);
180 assert(pc
>= addr
&& "symbol botch: callpc < func");
182 stack
.push_back(addr
);
187 if (decodePrologue(ksp
, pc
, addr
, size
, ra
)) {
192 stack
.push_back(unknown
);
199 stack
.push_back(unknown
);
203 bool kernel
= tc
->getSystemPtr()->kernelStart
<= pc
&&
204 pc
<= tc
->getSystemPtr()->kernelEnd
;
208 if (stack
.size() >= 1000)
209 panic("unwinding too far");
212 panic("unwinding too far");
216 StackTrace::isEntry(Addr addr
)
218 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp12
))
221 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp7
))
224 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp11
))
227 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp21
))
230 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp9
))
233 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp2
))
240 StackTrace::decodeStack(MachInst inst
, int &disp
)
242 // lda $sp, -disp($sp)
244 // Opcode<31:26> == 0x08
248 const MachInst mem_mask
= 0xffff0000;
249 const MachInst lda_pattern
= 0x23de0000;
250 const MachInst lda_disp_mask
= 0x0000ffff;
252 // subq $sp, disp, $sp
253 // addq $sp, disp, $sp
255 // Opcode<31:26> == 0x10
259 // Func<11:5> == 0x20 (addq)
260 // Func<11:5> == 0x29 (subq)
262 const MachInst intop_mask
= 0xffe01fff;
263 const MachInst addq_pattern
= 0x43c0141e;
264 const MachInst subq_pattern
= 0x43c0153e;
265 const MachInst intop_disp_mask
= 0x001fe000;
266 const int intop_disp_shift
= 13;
268 if ((inst
& mem_mask
) == lda_pattern
)
269 disp
= -sext
<16>(inst
& lda_disp_mask
);
270 else if ((inst
& intop_mask
) == addq_pattern
)
271 disp
= -int((inst
& intop_disp_mask
) >> intop_disp_shift
);
272 else if ((inst
& intop_mask
) == subq_pattern
)
273 disp
= int((inst
& intop_disp_mask
) >> intop_disp_shift
);
281 StackTrace::decodeSave(MachInst inst
, int ®
, int &disp
)
283 // lda $stq, disp($sp)
285 // Opcode<31:26> == 0x08
289 const MachInst stq_mask
= 0xfc1f0000;
290 const MachInst stq_pattern
= 0xb41e0000;
291 const MachInst stq_disp_mask
= 0x0000ffff;
292 const MachInst reg_mask
= 0x03e00000;
293 const int reg_shift
= 21;
295 if ((inst
& stq_mask
) == stq_pattern
) {
296 reg
= (inst
& reg_mask
) >> reg_shift
;
297 disp
= sext
<16>(inst
& stq_disp_mask
);
306 * Decode the function prologue for the function we're in, and note
307 * which registers are stored where, and how large the stack frame is.
310 StackTrace::decodePrologue(Addr sp
, Addr callpc
, Addr func
,
316 for (Addr pc
= func
; pc
< callpc
; pc
+= sizeof(MachInst
)) {
318 CopyOut(tc
, (uint8_t *)&inst
, pc
, sizeof(MachInst
));
321 if (decodeStack(inst
, disp
)) {
323 // panic("decoding frame size again");
327 } else if (decodeSave(inst
, reg
, disp
)) {
328 if (!ra
&& reg
== ReturnAddressReg
) {
329 CopyOut(tc
, (uint8_t *)&ra
, sp
+ disp
, sizeof(Addr
));
331 // panic("no return address value pc=%#x\n", pc);
345 StringWrap
name(tc
->getCpuPtr()->name());
346 SymbolTable
*symtab
= tc
->getSystemPtr()->kernelSymtab
;
348 DPRINTFN("------ Stack ------\n");
351 for (int i
= 0, size
= stack
.size(); i
< size
; ++i
) {
352 Addr addr
= stack
[size
- i
- 1];
355 else if (addr
== console
)
357 else if (addr
== unknown
)
360 symtab
->findSymbol(addr
, symbol
);
362 DPRINTFN("%#x: %s\n", addr
, symbol
);