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
|
/*
* Copyright (c) 2015 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*
Copyright (c) 2004 Eliot Dresselhaus
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include <vppinfra/clib.h>
#include <vppinfra/error.h>
#ifdef __mips__
/* Let code below know we've defined _clib_backtrace */
#define clib_backtrace_defined
#include <vppinfra/asm_mips.h>
__clib_export uword
clib_backtrace (uword * callers, uword max_callers, uword n_frames_to_skip)
{
u32 *pc;
void *sp;
uword i, saved_pc;
/* Figure current PC, saved PC and stack pointer. */
asm volatile (".set push\n"
".set noat\n" "move %[saved_pc], $31\n" "move %[sp], $29\n"
/* Fetches current PC. */
"la $at, 1f\n"
"jalr %[pc], $at\n"
"nop\n"
"1:\n"
".set pop\n":[pc] "=r" (pc),
[saved_pc] "=r" (saved_pc),[sp] "=r" (sp));
/* Also skip current frame. */
n_frames_to_skip += 1;
for (i = 0; i < max_callers + n_frames_to_skip; i++)
{
mips_insn_opcode_t op;
mips_insn_special_funct_t funct;
i32 insn, rs, rt, rd, immediate, found_saved_pc;
u32 *start_pc;
/* Parse instructions until we reach prologue for this
stack frame. We'll need to figure out where saved
PC is and where previous stack frame lives. */
start_pc = pc;
found_saved_pc = 0;
while (1)
{
insn = *--pc;
op = mips_insn_get_op (insn);
funct = mips_insn_get_funct (insn);
rs = mips_insn_get_rs (insn);
rt = mips_insn_get_rt (insn);
rd = mips_insn_get_rd (insn);
immediate = mips_insn_get_immediate (insn);
switch (op)
{
default:
break;
case MIPS_OPCODE_sd:
case MIPS_OPCODE_sw:
/* Trace stores of return address. */
if (rt == MIPS_REG_RA)
{
void *addr = sp + immediate;
/* If RA is stored somewhere other than in the
stack frame, give up. */
if (rs != MIPS_REG_SP)
goto backtrace_done;
ASSERT (immediate % 4 == 0);
if (op == MIPS_OPCODE_sw)
saved_pc = ((u32 *) addr)[0];
else
saved_pc = ((u64 *) addr)[0];
found_saved_pc = 1;
}
break;
case MIPS_OPCODE_addiu:
case MIPS_OPCODE_daddiu:
case MIPS_OPCODE_addi:
case MIPS_OPCODE_daddi:
if (rt == MIPS_REG_SP)
{
if (rs != MIPS_REG_SP)
goto backtrace_done;
ASSERT (immediate % 4 == 0);
/* Assume positive offset is part of the epilogue.
E.g.
jr ra
add sp,sp,100
*/
if (immediate > 0)
continue;
/* Negative offset means allocate stack space.
This could either be the prologue or could be due to
alloca. */
sp -= immediate;
/* This frame will not save RA. */
if (i == 0)
goto found_prologue;
/* Assume that addiu sp,sp,-N without store of ra means
that we have not found the prologue yet. */
if (found_saved_pc)
goto found_prologue;
}
break;
case MIPS_OPCODE_slti:
case MIPS_OPCODE_sltiu:
case MIPS_OPCODE_andi:
case MIPS_OPCODE_ori:
case MIPS_OPCODE_xori:
case MIPS_OPCODE_lui:
case MIPS_OPCODE_ldl:
case MIPS_OPCODE_ldr:
case MIPS_OPCODE_lb:
case MIPS_OPCODE_lh:
case MIPS_OPCODE_lwl:
case MIPS_OPCODE_lw:
case MIPS_OPCODE_lbu:
case MIPS_OPCODE_lhu:
case MIPS_OPCODE_lwr:
case MIPS_OPCODE_lwu:
case MIPS_OPCODE_ld:
/* Give up when we find anyone setting the stack pointer. */
if (rt == MIPS_REG_SP)
goto backtrace_done;
break;
case MIPS_OPCODE_SPECIAL:
if (rd == MIPS_REG_SP)
switch (funct)
{
default:
/* Give up when we find anyone setting the stack pointer. */
goto backtrace_done;
case MIPS_SPECIAL_FUNCT_break:
case MIPS_SPECIAL_FUNCT_jr:
case MIPS_SPECIAL_FUNCT_sync:
case MIPS_SPECIAL_FUNCT_syscall:
case MIPS_SPECIAL_FUNCT_tge:
case MIPS_SPECIAL_FUNCT_tgeu:
case MIPS_SPECIAL_FUNCT_tlt:
case MIPS_SPECIAL_FUNCT_tltu:
case MIPS_SPECIAL_FUNCT_teq:
case MIPS_SPECIAL_FUNCT_tne:
/* These instructions can validly have rd == MIPS_REG_SP */
break;
}
break;
}
}
found_prologue:
/* Check sanity of saved pc. */
if (saved_pc & 3)
goto backtrace_done;
if (saved_pc == 0)
goto backtrace_done;
if (i >= n_frames_to_skip)
callers[i - n_frames_to_skip] = saved_pc;
pc = uword_to_pointer (saved_pc, u32 *);
}
backtrace_done:
if (i < n_frames_to_skip)
return 0;
else
return i - n_frames_to_skip;
}
#endif /* __mips__ */
#ifndef clib_backtrace_defined
#define clib_backtrace_defined
/* use glibc backtrace for stack trace */
#include <execinfo.h>
__clib_export uword
clib_backtrace (uword * callers, uword max_callers, uword n_frames_to_skip)
{
int size;
void *array[20];
/* Also skip current frame. */
n_frames_to_skip += 1;
size = clib_min (ARRAY_LEN (array), max_callers + n_frames_to_skip);
size = backtrace (array, size);
uword i;
for (i = 0; i < max_callers + n_frames_to_skip && i < size; i++)
{
if (i >= n_frames_to_skip)
callers[i - n_frames_to_skip] = pointer_to_uword (array[i]);
}
if (i < n_frames_to_skip)
return 0;
else
return i - n_frames_to_skip;
}
#endif /* clib_backtrace_defined */
/*
* fd.io coding-style-patch-verification: ON
*
* Local Variables:
* eval: (c-set-style "gnu")
* End:
*/
|
