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
|
/**************************************************************************/
/* */
/* OCaml */
/* */
/* Xavier Leroy, projet Gallium, INRIA Rocquencourt */
/* */
/* Copyright 2006 Institut National de Recherche en Informatique et */
/* en Automatique. */
/* */
/* All rights reserved. This file is distributed under the terms of */
/* the GNU Lesser General Public License version 2.1, with the */
/* special exception on linking described in the file LICENSE. */
/* */
/**************************************************************************/
#define CAML_INTERNALS
/* Stack backtrace for uncaught exceptions */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "caml/alloc.h"
#include "caml/backtrace.h"
#include "caml/backtrace_prim.h"
#include "caml/frame_descriptors.h"
#include "caml/stack.h"
#include "caml/memory.h"
#include "caml/misc.h"
#include "caml/mlvalues.h"
#include "caml/fiber.h"
#include "caml/fail.h"
/* Returns the next frame descriptor (or NULL if none is available),
and updates *pc and *sp to point to the following one. */
frame_descr * caml_next_frame_descriptor
(caml_frame_descrs fds, uintnat * pc, char ** sp, struct stack_info* stack)
{
frame_descr * d;
while (1) {
d = caml_find_frame_descr(fds, *pc);
if( d == NULL ) {
return NULL;
}
/* Skip to next frame */
if (!frame_return_to_C(d)) {
/* Regular frame, update sp/pc and return the frame descriptor */
*sp += frame_size(d);
*pc = Saved_return_address(*sp);
return d;
} else {
/* This marks the top of an ML stack chunk. Move sp to the previous stack
chunk. This includes skipping over the DWARF link & trap frame
(4 words). */
*sp += 4 * sizeof(value);
if (*sp == (char*)Stack_high(stack)) {
/* We've reached the top of stack. No more frames. */
*pc = 0;
return NULL;
}
Pop_frame_pointer(*sp);
*pc = **(uintnat**)sp;
*sp += sizeof(value); /* return address */
}
}
}
int caml_alloc_backtrace_buffer(void){
CAMLassert(Caml_state->backtrace_pos == 0);
Caml_state->backtrace_buffer =
caml_stat_alloc_noexc(BACKTRACE_BUFFER_SIZE * sizeof(backtrace_slot));
if (Caml_state->backtrace_buffer == NULL) return -1;
return 0;
}
void caml_free_backtrace_buffer(backtrace_slot *backtrace_buffer) {
if (backtrace_buffer != NULL)
caml_stat_free(backtrace_buffer);
}
/* Stores the return addresses contained in the given stack fragment
into the backtrace array ; this version is performance-sensitive as
it is called at each [raise] in a program compiled with [-g], so we
preserved the global, statically bounded buffer of the old
implementation -- before the more flexible
[caml_get_current_callstack] was implemented. */
void caml_stash_backtrace(value exn, uintnat pc, char * sp, char* trapsp)
{
caml_domain_state* domain_state = Caml_state;
caml_frame_descrs fds;
if (exn != domain_state->backtrace_last_exn) {
domain_state->backtrace_pos = 0;
caml_modify_generational_global_root
(&domain_state->backtrace_last_exn, exn);
}
if (Caml_state->backtrace_buffer == NULL &&
caml_alloc_backtrace_buffer() == -1)
return;
fds = caml_get_frame_descrs();
/* iterate on each frame */
while (1) {
frame_descr * descr = caml_next_frame_descriptor
(fds, &pc, &sp, domain_state->current_stack);
if (descr == NULL) return;
/* store its descriptor in the backtrace buffer */
if (domain_state->backtrace_pos >= BACKTRACE_BUFFER_SIZE) return;
domain_state->backtrace_buffer[domain_state->backtrace_pos++] =
(backtrace_slot) descr;
/* Stop when we reach the current exception handler */
if (sp > trapsp) return;
}
}
/* Stores upto [max_frames_value] frames of the current call stack to
return to the user. This is used not in an exception-raising
context, but only when the user requests to save the trace
(hopefully less often). Instead of using a bounded buffer as
[caml_stash_backtrace], we first traverse the stack to compute the
right size, then allocate space for the trace. */
static void get_callstack(struct stack_info* orig_stack, intnat max_frames,
frame_descr*** trace, intnat* trace_size)
{
intnat trace_pos;
char *sp;
uintnat pc;
caml_frame_descrs fds;
CAMLnoalloc;
fds = caml_get_frame_descrs();
/* first compute the size of the trace */
{
struct stack_info* stack = orig_stack;
caml_get_stack_sp_pc(stack, &sp, &pc);
trace_pos = 0;
while(1) {
frame_descr *descr = caml_next_frame_descriptor(fds, &pc, &sp, stack);
if (trace_pos >= max_frames) break;
if (descr == NULL) {
stack = Stack_parent(stack);
if (stack == NULL) break;
caml_get_stack_sp_pc(stack, &sp, &pc);
} else {
++trace_pos;
}
}
}
*trace_size = trace_pos;
*trace = caml_stat_alloc(sizeof(frame_descr*) * trace_pos);
/* then collect the trace */
{
struct stack_info* stack = orig_stack;
caml_get_stack_sp_pc(stack, &sp, &pc);
trace_pos = 0;
while(1) {
frame_descr *descr = caml_next_frame_descriptor(fds, &pc, &sp, stack);
if (trace_pos >= max_frames) break;
if (descr == NULL) {
stack = Stack_parent(stack);
if (stack == NULL) break;
caml_get_stack_sp_pc(stack, &sp, &pc);
} else {
(*trace)[trace_pos] = descr;
++trace_pos;
}
}
}
}
static value alloc_callstack(frame_descr** trace, intnat trace_len)
{
CAMLparam0();
CAMLlocal1(callstack);
int i;
callstack = caml_alloc(trace_len, 0);
for (i = 0; i < trace_len; i++)
Store_field(callstack, i, Val_backtrace_slot(trace[i]));
caml_stat_free(trace);
CAMLreturn(callstack);
}
CAMLprim value caml_get_current_callstack (value max_frames_value) {
frame_descr** trace;
intnat trace_len;
get_callstack(Caml_state->current_stack, Long_val(max_frames_value),
&trace, &trace_len);
return alloc_callstack(trace, trace_len);
}
CAMLprim value caml_get_continuation_callstack (value cont, value max_frames)
{
frame_descr** trace;
intnat trace_len;
struct stack_info* stack;
stack = Ptr_val(caml_continuation_use(cont));
{
CAMLnoalloc;
get_callstack(stack, max_frames,
&trace, &trace_len);
caml_continuation_replace(cont, stack);
}
return alloc_callstack(trace, trace_len);
}
debuginfo caml_debuginfo_extract(backtrace_slot slot)
{
unsigned char* infoptr;
uint32_t debuginfo_offset;
frame_descr * d = (frame_descr *)slot;
/* The special frames marking returns from Caml to C are never
returned by caml_next_frame_descriptor, so should never reach
here. */
CAMLassert(!frame_return_to_C(d));
if (!frame_has_debug(d)) {
return NULL;
}
/* Recover debugging info */
infoptr = (unsigned char*)&d->live_ofs[d->num_live];
if (frame_has_allocs(d)) {
/* skip alloc_lengths */
infoptr += *infoptr + 1;
/* align to 32 bits */
infoptr = Align_to(infoptr, uint32_t);
/* we know there's at least one valid debuginfo,
but it may not be the one for the first alloc */
while (*(uint32_t*)infoptr == 0) {
infoptr += sizeof(uint32_t);
}
} else {
/* align to 32 bits */
infoptr = Align_to(infoptr, uint32_t);
}
/* read offset to debuginfo */
debuginfo_offset = *(uint32_t*)infoptr;
return (debuginfo)(infoptr + debuginfo_offset);
}
debuginfo caml_debuginfo_next(debuginfo dbg)
{
uint32_t * infoptr;
if (dbg == NULL)
return NULL;
infoptr = dbg;
if ((infoptr[0] & 1) == 0)
/* No next debuginfo */
return NULL;
else
/* Next debuginfo is after the two packed info fields */
return (debuginfo*)(infoptr + 2);
}
/* Multiple names may share the same filename,
so it is referenced as an offset instead of stored inline */
struct name_info {
int32_t filename_offs;
char name[1];
};
/* Extract location information for the given frame descriptor */
void caml_debuginfo_location(debuginfo dbg, /*out*/ struct caml_loc_info * li)
{
uint32_t info1, info2;
struct name_info * name_info;
/* If no debugging information available, print nothing.
When everything is compiled with -g, this corresponds to
compiler-inserted re-raise operations. */
if (dbg == NULL) {
li->loc_valid = 0;
li->loc_is_raise = 1;
li->loc_is_inlined = 0;
return;
}
/* Recover debugging info */
info1 = ((uint32_t *)dbg)[0];
info2 = ((uint32_t *)dbg)[1];
name_info = (struct name_info*)((char *) dbg + (info1 & 0x3FFFFFC));
/* Format of the two info words:
llllllllllllllllllll aaaaaaaa bbbbbbbbbb ffffffffffffffffffffffff k n
44 36 26 2 1 0
(32+12) (32+4)
n ( 1 bit ): 0 if this is the final debuginfo
1 if there's another following this one
k ( 1 bit ): 0 if it's a call
1 if it's a raise
f (24 bits): offset (in 4-byte words) of file name relative to dbg
l (20 bits): line number
a ( 8 bits): beginning of character range
b (10 bits): end of character range */
li->loc_valid = 1;
li->loc_is_raise = (info1 & 2) == 2;
li->loc_is_inlined = caml_debuginfo_next(dbg) != NULL;
li->loc_defname = name_info->name;
li->loc_filename =
(char *)name_info + name_info->filename_offs;
li->loc_lnum = info2 >> 12;
li->loc_startchr = (info2 >> 4) & 0xFF;
li->loc_endchr = ((info2 & 0xF) << 6) | (info1 >> 26);
}
value caml_add_debug_info(backtrace_slot start, value size, value events)
{
return Val_unit;
}
value caml_remove_debug_info(backtrace_slot start)
{
return Val_unit;
}
int caml_debug_info_available(void)
{
return 1;
}
int caml_debug_info_status(void)
{
return 1;
}
|