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
)
50 VirtualPort
*vp
= tc
->getVirtPort();
51 SymbolTable
*symtab
= tc
->getSystemPtr()->kernelSymtab
;
53 if (!symtab
->findAddress("thread_info_size", addr
))
54 panic("thread info not compiled into kernel\n");
55 thread_info_size
= vp
->readGtoH
<int32_t>(addr
);
57 if (!symtab
->findAddress("task_struct_size", addr
))
58 panic("thread info not compiled into kernel\n");
59 task_struct_size
= vp
->readGtoH
<int32_t>(addr
);
61 if (!symtab
->findAddress("thread_info_task", addr
))
62 panic("thread info not compiled into kernel\n");
63 task_off
= vp
->readGtoH
<int32_t>(addr
);
65 if (!symtab
->findAddress("task_struct_pid", addr
))
66 panic("thread info not compiled into kernel\n");
67 pid_off
= vp
->readGtoH
<int32_t>(addr
);
69 if (!symtab
->findAddress("task_struct_comm", addr
))
70 panic("thread info not compiled into kernel\n");
71 name_off
= vp
->readGtoH
<int32_t>(addr
);
75 ProcessInfo::task(Addr ksp
) const
77 Addr base
= ksp
& ~0x3fff;
78 if (base
== ULL(0xfffffc0000000000))
85 vp
= tc
->getVirtPort();
86 tsk
= vp
->readGtoH
<Addr
>(base
+ task_off
);
92 ProcessInfo::pid(Addr ksp
) const
94 Addr task
= this->task(ksp
);
102 vp
= tc
->getVirtPort();
103 pd
= vp
->readGtoH
<uint16_t>(task
+ pid_off
);
109 ProcessInfo::name(Addr ksp
) const
111 Addr task
= this->task(ksp
);
116 CopyStringOut(tc
, comm
, task
+ name_off
, sizeof(comm
));
123 StackTrace::StackTrace()
128 StackTrace::StackTrace(ThreadContext
*_tc
, StaticInstPtr inst
)
134 StackTrace::~StackTrace()
139 StackTrace::trace(ThreadContext
*_tc
, bool is_call
)
143 System
*sys
= tc
->getSystemPtr();
146 (tc
->readMiscRegNoEffect(IPR_DTB_CM
) & 0x18) != 0;
148 Addr pc
= tc
->readNextPC();
149 bool kernel
= sys
->kernelStart
<= pc
&& pc
<= sys
->kernelEnd
;
152 stack
.push_back(user
);
157 stack
.push_back(console
);
161 SymbolTable
*symtab
= sys
->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
);
174 while (ksp
> bottom
) {
176 if (!symtab
->findNearestAddr(pc
, addr
))
177 panic("could not find symbol for pc=%#x", pc
);
178 assert(pc
>= addr
&& "symbol botch: callpc < func");
180 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
= sys
->kernelStart
<= pc
&& pc
<= sys
->kernelEnd
;
207 if (stack
.size() >= 1000)
208 panic("unwinding too far");
211 panic("unwinding too far");
215 StackTrace::isEntry(Addr addr
)
217 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp12
))
220 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp7
))
223 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp11
))
226 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp21
))
229 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp9
))
232 if (addr
== tc
->readMiscRegNoEffect(IPR_PALtemp2
))
239 StackTrace::decodeStack(MachInst inst
, int &disp
)
241 // lda $sp, -disp($sp)
243 // Opcode<31:26> == 0x08
247 const MachInst mem_mask
= 0xffff0000;
248 const MachInst lda_pattern
= 0x23de0000;
249 const MachInst lda_disp_mask
= 0x0000ffff;
251 // subq $sp, disp, $sp
252 // addq $sp, disp, $sp
254 // Opcode<31:26> == 0x10
258 // Func<11:5> == 0x20 (addq)
259 // Func<11:5> == 0x29 (subq)
261 const MachInst intop_mask
= 0xffe01fff;
262 const MachInst addq_pattern
= 0x43c0141e;
263 const MachInst subq_pattern
= 0x43c0153e;
264 const MachInst intop_disp_mask
= 0x001fe000;
265 const int intop_disp_shift
= 13;
267 if ((inst
& mem_mask
) == lda_pattern
)
268 disp
= -sext
<16>(inst
& lda_disp_mask
);
269 else if ((inst
& intop_mask
) == addq_pattern
)
270 disp
= -int((inst
& intop_disp_mask
) >> intop_disp_shift
);
271 else if ((inst
& intop_mask
) == subq_pattern
)
272 disp
= int((inst
& intop_disp_mask
) >> intop_disp_shift
);
280 StackTrace::decodeSave(MachInst inst
, int ®
, int &disp
)
282 // lda $stq, disp($sp)
284 // Opcode<31:26> == 0x08
288 const MachInst stq_mask
= 0xfc1f0000;
289 const MachInst stq_pattern
= 0xb41e0000;
290 const MachInst stq_disp_mask
= 0x0000ffff;
291 const MachInst reg_mask
= 0x03e00000;
292 const int reg_shift
= 21;
294 if ((inst
& stq_mask
) == stq_pattern
) {
295 reg
= (inst
& reg_mask
) >> reg_shift
;
296 disp
= sext
<16>(inst
& stq_disp_mask
);
305 * Decode the function prologue for the function we're in, and note
306 * which registers are stored where, and how large the stack frame is.
309 StackTrace::decodePrologue(Addr sp
, Addr callpc
, Addr func
, int &size
,
315 for (Addr pc
= func
; pc
< callpc
; pc
+= sizeof(MachInst
)) {
317 CopyOut(tc
, (uint8_t *)&inst
, pc
, sizeof(MachInst
));
320 if (decodeStack(inst
, disp
)) {
322 // panic("decoding frame size again");
326 } else if (decodeSave(inst
, reg
, disp
)) {
327 if (!ra
&& reg
== ReturnAddressReg
) {
328 CopyOut(tc
, (uint8_t *)&ra
, sp
+ disp
, sizeof(Addr
));
330 // panic("no return address value pc=%#x\n", pc);
344 StringWrap
name(tc
->getCpuPtr()->name());
345 SymbolTable
*symtab
= tc
->getSystemPtr()->kernelSymtab
;
347 DPRINTFN("------ Stack ------\n");
350 for (int i
= 0, size
= stack
.size(); i
< size
; ++i
) {
351 Addr addr
= stack
[size
- i
- 1];
354 else if (addr
== console
)
356 else if (addr
== unknown
)
359 symtab
->findSymbol(addr
, symbol
);
361 DPRINTFN("%#x: %s\n", addr
, symbol
);
366 } // namespace AlphaISA