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.
31 #include "arch/alpha/isa_traits.hh"
32 #include "arch/alpha/stacktrace.hh"
33 #include "arch/alpha/vtophys.hh"
34 #include "base/bitfield.hh"
35 #include "base/trace.hh"
36 #include "cpu/base.hh"
37 #include "cpu/exec_context.hh"
41 ProcessInfo::ProcessInfo(ExecContext
*_xc
)
46 if (!xc
->system
->kernelSymtab
->findAddress("thread_info_size", addr
))
47 panic("thread info not compiled into kernel\n");
48 thread_info_size
= *(int32_t *)vtomem(xc
, addr
, sizeof(int32_t));
50 if (!xc
->system
->kernelSymtab
->findAddress("task_struct_size", addr
))
51 panic("thread info not compiled into kernel\n");
52 task_struct_size
= *(int32_t *)vtomem(xc
, addr
, sizeof(int32_t));
54 if (!xc
->system
->kernelSymtab
->findAddress("thread_info_task", addr
))
55 panic("thread info not compiled into kernel\n");
56 task_off
= *(int32_t *)vtomem(xc
, addr
, sizeof(int32_t));
58 if (!xc
->system
->kernelSymtab
->findAddress("task_struct_pid", addr
))
59 panic("thread info not compiled into kernel\n");
60 pid_off
= *(int32_t *)vtomem(xc
, addr
, sizeof(int32_t));
62 if (!xc
->system
->kernelSymtab
->findAddress("task_struct_comm", addr
))
63 panic("thread info not compiled into kernel\n");
64 name_off
= *(int32_t *)vtomem(xc
, addr
, sizeof(int32_t));
68 ProcessInfo::task(Addr ksp
) const
70 Addr base
= ksp
& ~0x3fff;
71 if (base
== ULL(0xfffffc0000000000))
75 CopyOut(xc
, &task
, base
+ task_off
, sizeof(task
));
80 ProcessInfo::pid(Addr ksp
) const
82 Addr task
= this->task(ksp
);
87 CopyOut(xc
, &pid
, task
+ pid_off
, sizeof(pid
));
92 ProcessInfo::name(Addr ksp
) const
94 Addr task
= this->task(ksp
);
99 CopyString(xc
, comm
, task
+ name_off
, sizeof(comm
));
106 StackTrace::StackTrace()
111 StackTrace::StackTrace(ExecContext
*_xc
, StaticInstPtr
<TheISA
> inst
)
117 StackTrace::~StackTrace()
122 StackTrace::trace(ExecContext
*_xc
, bool is_call
)
126 bool usermode
= (xc
->regs
.ipr
[AlphaISA::IPR_DTB_CM
] & 0x18) != 0;
128 Addr pc
= xc
->regs
.npc
;
129 bool kernel
= xc
->system
->kernelStart
<= pc
&& pc
<= xc
->system
->kernelEnd
;
132 stack
.push_back(user
);
137 stack
.push_back(console
);
141 SymbolTable
*symtab
= xc
->system
->kernelSymtab
;
142 Addr ksp
= xc
->regs
.intRegFile
[TheISA::StackPointerReg
];
143 Addr bottom
= ksp
& ~0x3fff;
147 if (!symtab
->findNearestAddr(pc
, addr
))
148 panic("could not find address %#x", pc
);
150 stack
.push_back(addr
);
157 while (ksp
> bottom
) {
158 if (!symtab
->findNearestAddr(pc
, addr
))
159 panic("could not find symbol for pc=%#x", pc
);
160 assert(pc
>= addr
&& "symbol botch: callpc < func");
162 stack
.push_back(addr
);
167 if (decodePrologue(ksp
, pc
, addr
, size
, ra
)) {
172 stack
.push_back(unknown
);
179 stack
.push_back(unknown
);
183 bool kernel
= xc
->system
->kernelStart
<= pc
&&
184 pc
<= xc
->system
->kernelEnd
;
188 if (stack
.size() >= 1000)
189 panic("unwinding too far");
192 panic("unwinding too far");
196 StackTrace::isEntry(Addr addr
)
198 if (addr
== xc
->regs
.ipr
[AlphaISA::IPR_PALtemp12
])
201 if (addr
== xc
->regs
.ipr
[AlphaISA::IPR_PALtemp7
])
204 if (addr
== xc
->regs
.ipr
[AlphaISA::IPR_PALtemp11
])
207 if (addr
== xc
->regs
.ipr
[AlphaISA::IPR_PALtemp21
])
210 if (addr
== xc
->regs
.ipr
[AlphaISA::IPR_PALtemp9
])
213 if (addr
== xc
->regs
.ipr
[AlphaISA::IPR_PALtemp2
])
220 StackTrace::decodeStack(MachInst inst
, int &disp
)
222 // lda $sp, -disp($sp)
224 // Opcode<31:26> == 0x08
228 const MachInst mem_mask
= 0xffff0000;
229 const MachInst lda_pattern
= 0x23de0000;
230 const MachInst lda_disp_mask
= 0x0000ffff;
232 // subq $sp, disp, $sp
233 // addq $sp, disp, $sp
235 // Opcode<31:26> == 0x10
239 // Func<11:5> == 0x20 (addq)
240 // Func<11:5> == 0x29 (subq)
242 const MachInst intop_mask
= 0xffe01fff;
243 const MachInst addq_pattern
= 0x43c0141e;
244 const MachInst subq_pattern
= 0x43c0153e;
245 const MachInst intop_disp_mask
= 0x001fe000;
246 const int intop_disp_shift
= 13;
248 if ((inst
& mem_mask
) == lda_pattern
)
249 disp
= -sext
<16>(inst
& lda_disp_mask
);
250 else if ((inst
& intop_mask
) == addq_pattern
)
251 disp
= -int((inst
& intop_disp_mask
) >> intop_disp_shift
);
252 else if ((inst
& intop_mask
) == subq_pattern
)
253 disp
= int((inst
& intop_disp_mask
) >> intop_disp_shift
);
261 StackTrace::decodeSave(MachInst inst
, int ®
, int &disp
)
263 // lda $stq, disp($sp)
265 // Opcode<31:26> == 0x08
269 const MachInst stq_mask
= 0xfc1f0000;
270 const MachInst stq_pattern
= 0xb41e0000;
271 const MachInst stq_disp_mask
= 0x0000ffff;
272 const MachInst reg_mask
= 0x03e00000;
273 const int reg_shift
= 21;
275 if ((inst
& stq_mask
) == stq_pattern
) {
276 reg
= (inst
& reg_mask
) >> reg_shift
;
277 disp
= sext
<16>(inst
& stq_disp_mask
);
286 * Decode the function prologue for the function we're in, and note
287 * which registers are stored where, and how large the stack frame is.
290 StackTrace::decodePrologue(Addr sp
, Addr callpc
, Addr func
,
296 for (Addr pc
= func
; pc
< callpc
; pc
+= sizeof(MachInst
)) {
298 CopyOut(xc
, (uint8_t *)&inst
, pc
, sizeof(MachInst
));
301 if (decodeStack(inst
, disp
)) {
303 // panic("decoding frame size again");
307 } else if (decodeSave(inst
, reg
, disp
)) {
308 if (!ra
&& reg
== ReturnAddressReg
) {
309 CopyOut(xc
, (uint8_t *)&ra
, sp
+ disp
, sizeof(Addr
));
311 // panic("no return address value pc=%#x\n", pc);
325 StringWrap
name(xc
->cpu
->name());
326 SymbolTable
*symtab
= xc
->system
->kernelSymtab
;
328 DPRINTFN("------ Stack ------\n");
331 for (int i
= 0, size
= stack
.size(); i
< size
; ++i
) {
332 Addr addr
= stack
[size
- i
- 1];
335 else if (addr
== console
)
337 else if (addr
== unknown
)
340 symtab
->findSymbol(addr
, symbol
);
342 DPRINTFN("%#x: %s\n", addr
, symbol
);