1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
|
/* $OpenBSD: alpha_trace.c,v 1.2 2002/03/15 16:41:06 jason Exp $ */
/*
* Copyright (c) 2002 Artur Grabowski <art@openbsd.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED ``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 AUTHOR 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.
*/
/*
* Copyright (c) 1997 Niklas Hallqvist. All rights reserverd.
* Copyright (c) 1997 Theo de Raadt. All rights reserverd.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Niklas Hallqvist and
* Theo de Raadt.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
*/
#include <sys/param.h>
#include <sys/ptrace.h>
#include <machine/reg.h>
#include <machine/frame.h>
#include <stdio.h>
#include <string.h>
#include "pmdb.h"
#include "alpha_instruction.h"
#include "symbol.h"
struct opcode {
enum opc_fmt { OPC_PAL, OPC_RES, OPC_MEM, OPC_OP, OPC_BR } opc_fmt;
char *opc_name;
int opc_print;
};
#define inst_return(ins) (((ins) & 0xfc000000) == 0x68000000)
const struct opcode opcode[] = {
{ OPC_PAL, "call_pal", 0 }, /* 00 */
{ OPC_RES, "opc01", 0 }, /* 01 */
{ OPC_RES, "opc02", 0 }, /* 02 */
{ OPC_RES, "opc03", 0 }, /* 03 */
{ OPC_RES, "opc04", 0 }, /* 04 */
{ OPC_RES, "opc05", 0 }, /* 05 */
{ OPC_RES, "opc06", 0 }, /* 06 */
{ OPC_RES, "opc07", 0 }, /* 07 */
{ OPC_MEM, "lda", 1 }, /* 08 */
{ OPC_MEM, "ldah", 1 }, /* 09 */
{ OPC_RES, "opc0a", 0 }, /* 0A */
{ OPC_MEM, "ldq_u", 1 }, /* 0B */
{ OPC_RES, "opc0c", 0 }, /* 0C */
{ OPC_RES, "opc0d", 0 }, /* 0D */
{ OPC_RES, "opc0e", 0 }, /* 0E */
{ OPC_MEM, "stq_u", 1 }, /* 0F */
{ OPC_OP, "inta", 0 }, /* 10 */
{ OPC_OP, "intl", 0 }, /* 11 */
{ OPC_OP, "ints", 0 }, /* 12 */
{ OPC_OP, "intm", 0 }, /* 13 */
{ OPC_RES, "opc14", 0 }, /* 14 */
{ OPC_OP, "fltv", 1 }, /* 15 */
{ OPC_OP, "flti", 1 }, /* 16 */
{ OPC_OP, "fltl", 1 }, /* 17 */
{ OPC_MEM, "misc", 0 }, /* 18 */
{ OPC_PAL, "pal19", 0 }, /* 19 */
{ OPC_MEM, "jsr", 0 }, /* 1A */
{ OPC_PAL, "pal1b", 0 }, /* 1B */
{ OPC_RES, "opc1c", 0 }, /* 1C */
{ OPC_PAL, "pal1d", 0 }, /* 1D */
{ OPC_PAL, "pal1e", 0 }, /* 1E */
{ OPC_PAL, "pal1f", 0 }, /* 1F */
{ OPC_MEM, "ldf", 1 }, /* 20 */
{ OPC_MEM, "ldg", 1 }, /* 21 */
{ OPC_MEM, "lds", 1 }, /* 22 */
{ OPC_MEM, "ldt", 1 }, /* 23 */
{ OPC_MEM, "stf", 1 }, /* 24 */
{ OPC_MEM, "stg", 1 }, /* 25 */
{ OPC_MEM, "sts", 1 }, /* 26 */
{ OPC_MEM, "stt", 1 }, /* 27 */
{ OPC_MEM, "ldl", 1 }, /* 28 */
{ OPC_MEM, "ldq", 1 }, /* 29 */
{ OPC_MEM, "ldl_l", 1 }, /* 2A */
{ OPC_MEM, "ldq_l", 1 }, /* 2B */
{ OPC_MEM, "stl", 1 }, /* 2C */
{ OPC_MEM, "stq", 1 }, /* 2D */
{ OPC_MEM, "stl_c", 1 }, /* 2E */
{ OPC_MEM, "stq_c", 1 }, /* 2F */
{ OPC_BR, "br", 1 }, /* 30 */
{ OPC_BR, "fbeq", 1 }, /* 31 */
{ OPC_BR, "fblt", 1 }, /* 32 */
{ OPC_BR, "fble", 1 }, /* 33 */
{ OPC_BR, "bsr", 1 }, /* 34 */
{ OPC_BR, "fbne", 1 }, /* 35 */
{ OPC_BR, "fbge", 1 }, /* 36 */
{ OPC_BR, "fbgt", 1 }, /* 37 */
{ OPC_BR, "blbc", 1 }, /* 38 */
{ OPC_BR, "beq", 1 }, /* 39 */
{ OPC_BR, "blt", 1 }, /* 3A */
{ OPC_BR, "ble", 1 }, /* 3B */
{ OPC_BR, "blbs", 1 }, /* 3C */
{ OPC_BR, "bne", 1 }, /* 3D */
{ OPC_BR, "bge", 1 }, /* 3E */
{ OPC_BR, "bgt", 1 }, /* 3F */
};
int
inst_load(int ins)
{
alpha_instruction insn;
insn.bits = ins;
/* Loads. */
if (insn.mem_format.opcode == op_ldbu ||
insn.mem_format.opcode == op_ldq_u ||
insn.mem_format.opcode == op_ldwu)
return (1);
if ((insn.mem_format.opcode >= op_ldf) &&
(insn.mem_format.opcode <= op_ldt))
return (1);
if ((insn.mem_format.opcode >= op_ldl) &&
(insn.mem_format.opcode <= op_ldq_l))
return (1);
/* Prefetches. */
if (insn.mem_format.opcode == op_special) {
/* Note: MB is treated as a store. */
if ((insn.mem_format.displacement == (short)op_fetch) ||
(insn.mem_format.displacement == (short)op_fetch_m))
return (1);
}
return (0);
}
static __inline int sext __P((u_int));
static __inline int rega __P((u_int));
static __inline int regb __P((u_int));
static __inline int regc __P((u_int));
static __inline int disp __P((u_int));
static __inline int
sext(x)
u_int x;
{
return ((x & 0x8000) ? -(-x & 0xffff) : (x & 0xffff));
}
static __inline int
rega(x)
u_int x;
{
return ((x >> 21) & 0x1f);
}
static __inline int
regb(x)
u_int x;
{
return ((x >> 16) & 0x1f);
}
static __inline int
regc(x)
u_int x;
{
return (x & 0x1f);
}
static __inline int
disp(x)
u_int x;
{
return (sext(x & 0xffff));
}
/*
* XXX There are a couple of problems with this code:
*
* The argument list printout code is likely to get confused.
*
* It relies on the conventions of gcc code generation.
*
* It uses heuristics to calculate the framesize, and might get it wrong.
*
* It doesn't yet use the framepointer if available.
*
* The address argument can only be used for pointing at trapframes
* since a frame pointer of its own serves no good on the alpha,
* you need a pc value too.
*
* The heuristics used for tracing through a trap relies on having
* symbols available.
*/
int
md_getframe(struct pstate *ps, int framec, struct md_frame *fram)
{
reg frame;
int i, framesize;
reg pc, ra;
u_int inst;
char *name;
char namebuf[1024];
reg offset;
reg slot[32];
struct reg regs;
int count;
bzero(slot, sizeof(slot));
if (ptrace(PT_GETREGS, ps->ps_pid, (caddr_t)®s, 0) != 0)
return -1;
for (i = 0; i < 32; i++)
slot[i] = -1;
frame = regs.r_regs[R_SP];
pc = regs.r_regs[R_ZERO]; /* Ieeek. on drugs. */
ra = regs.r_regs[R_RA];
for (count = 0; count < framec + 1; count++) {
/* XXX - better out of bounds check needed. */
if (pc < 0x1000 || pc == 0xffffffffffffffff) {
return -1;
}
name = sym_name_and_offset(ps, pc, namebuf,
sizeof(namebuf), &offset);
if (!name) {
/* Limit the search for procedure start */
offset = 65536;
}
framesize = 0;
for (i = sizeof (int); i <= offset; i += sizeof (int)) {
if (read_from_pid(ps->ps_pid, pc - i, &inst, sizeof(inst)) < 0)
return -1;
/*
* If by chance we don't have any symbols we have to
* get out somehow anyway. Check for the preceding
* procedure return in that case.
*/
if (name == NULL && inst_return(inst))
break;
/*
* Disassemble to get the needed info for the frame.
*/
if ((inst & 0xffff0000) == 0x23de0000) {
/* lda sp,n(sp) */
framesize -= disp(inst) / sizeof (u_long);
} else if ((inst & 0xfc1f0000) == 0xb41e0000) {
/* stq X,n(sp) */
slot[rega(inst)] = frame + disp(inst);
} else if ((inst & 0xfc000fe0) == 0x44000400 &&
rega(inst) == regb(inst)) {
/* bis X,X,Y (aka mov X,Y) */
/* zero is hardwired */
if (rega(inst) != 31)
slot[rega(inst)] = slot[regc(inst)];
slot[regc(inst)] = 0;
/*
* XXX In here we might special case a frame
* pointer setup, i.e. mov sp, fp.
*/
} else if (inst_load(inst)) {
/* clobbers a register */
slot[rega(inst)] = 0;
} else if (opcode[inst >> 26].opc_fmt == OPC_OP) {
/* clobbers a register */
slot[regc(inst)] = 0;
}
/*
* XXX Recognize more reg clobbering instructions and
* set slot[reg] = 0 then too.
*/
}
fram->pc = pc;
fram->fp = frame;
/* Look for the return address if recorded. */
if (slot[R_RA]) {
if (slot[R_RA] == -1)
ra = regs.r_regs[R_RA];
else
if (read_from_pid(ps->ps_pid, (off_t)slot[R_RA],
&ra, sizeof(ra)) < 0)
return -1;
} else {
break;
}
/* Advance to the next frame. */
frame += framesize * sizeof(u_long);
if (pc == ra) {
break;
}
pc = ra;
}
return count == framec + 1 ? 0 : -1;
}
|