1 /****************************************************************************
3 * GNAT COMPILER COMPONENTS *
7 * C Implementation File *
9 * Copyright (C) 2000-2005 Ada Core Technologies, Inc. *
11 * GNAT is free software; you can redistribute it and/or modify it under *
12 * terms of the GNU General Public License as published by the Free Soft- *
13 * ware Foundation; either version 2, or (at your option) any later ver- *
14 * sion. GNAT is distributed in the hope that it will be useful, but WITH- *
15 * OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY *
16 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License *
17 * for more details. You should have received a copy of the GNU General *
18 * Public License distributed with GNAT; see file COPYING. If not, write *
19 * to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, *
20 * MA 02111-1307, USA. *
22 * As a special exception, if you link this file with other files to *
23 * produce an executable, this file does not by itself cause the resulting *
24 * executable to be covered by the GNU General Public License. This except- *
25 * ion does not however invalidate any other reasons why the executable *
26 * file might be covered by the GNU Public License. *
28 * GNAT was originally developed by the GNAT team at New York University. *
29 * Extensive contributions were provided by Ada Core Technologies Inc. *
31 ****************************************************************************/
33 /* This file contains low level support for stack unwinding using GCC intrinsic
35 It has been tested on the following configurations:
48 #ifdef __alpha_vxworks
61 extern int __gnat_backtrace (void **, int, void *, void *, int);
63 /* The point is to provide an implementation of the __gnat_backtrace function
64 above, called by the default implementation of the System.Traceback package.
66 We first have a series of target specific implementations, each included
67 from a separate C file for readability purposes.
69 Then come two flavors of a generic implementation: one relying on static
70 assumptions about the frame layout, and the other one using the GCC EH
71 infrastructure. The former uses a whole set of macros and structures which
72 may be tailored on a per target basis, and is activated as soon as
73 USE_GENERIC_UNWINDER is defined. The latter uses a small subset of the
74 macro definitions and is activated when USE_GCC_UNWINDER is defined. It is
75 only available post GCC 3.3.
77 Finally, there is a default dummy implementation, necessary to make the
78 linker happy on platforms where the feature is not supported, but where the
79 function is still referenced by the default System.Traceback. */
81 #define Lock_Task system__soft_links__lock_task
82 extern void (*Lock_Task
) (void);
84 #define Unlock_Task system__soft_links__unlock_task
85 extern void (*Unlock_Task
) (void);
87 /*-------------------------------------*
88 *-- Target specific implementations --*
89 *-------------------------------------*/
91 #if defined (__alpha_vxworks)
95 #elif defined (__ALPHA) && defined (__VMS__)
100 /* No target specific implementation. */
102 /*----------------------------------------------------------------*
103 *-- Target specific definitions for the generic implementation --*
104 *----------------------------------------------------------------*/
106 /* The stack layout is specified by the target ABI. The "generic" scheme is
107 based on the following assumption:
109 The stack layout from some frame pointer is such that the information
110 required to compute the backtrace is available at static offsets.
112 For a given frame, the information we are interested in is the saved return
113 address (somewhere after the call instruction in the caller) and a pointer
114 to the caller's frame. The former is the base of the call chain information
115 we store in the tracebacks array. The latter allows us to loop over the
116 successive frames in the chain.
118 To initiate the process, we retrieve an initial frame pointer using the
119 appropriate GCC builtin (__builtin_frame_address).
121 This scheme is unfortunately not applicable on every target because the
122 stack layout is not necessarily regular (static) enough. On targets where
123 this scheme applies, the implementation relies on the following items:
125 o struct layout, describing the expected stack data layout relevant to the
126 information we are interested in,
128 o FRAME_OFFSET, the offset, from a given frame pointer, at which this
129 layout will be found,
131 o FRAME_LEVEL, controls how many frames up we get at to start with,
132 from the initial frame pointer we compute by way of the GCC builtin,
134 0 is most often the appropriate value. 1 may be necessary on targets
135 where return addresses are saved by a function in it's caller's frame
138 o PC_ADJUST, to account for the difference between a call point (address
139 of a call instruction), which is what we want in the output array, and
140 the associated return address, which is what we retrieve from the stack.
142 o STOP_FRAME, to decide wether we reached the top of the call chain, and
143 thus if the process shall stop.
149 | | | (FRAME_OFFSET) |
150 | | | : | (PC_ADJUST)
151 | | layout:| return_address ----------------+
153 +--------------- next_frame | |
156 | +----------------+ | +-----+
157 | | : |<- Base fp | | : |
158 | | (FRAME_OFFSET) | (FRAME_LEVEL) | | : |
160 | layout:| return_address --------------------> | [0]
161 | | ... | (PC_ADJUST) +-----+
162 +---------- next_frame | traceback[]
169 Since we inherently deal with return addresses, there is an implicit shift
170 by at least one for the initial point we are able to observe in the chain.
172 On some targets (e.g. sparc-solaris), the first return address we can
173 easily get without special code is even our caller's return address, so
174 there is a initial shift of two.
176 BASE_SKIP represents this initial shift, which is the minimal "skip_frames"
177 value we support. We could add special code for the skip_frames < BASE_SKIP
178 cases. This is not done currently because there is virtually no situation
179 in which this would be useful.
181 Finally, to account for some ABI specificities, a target may (but does
184 o FORCE_CALL, to force a call to a dummy function at the very beginning
185 of the computation. See the PPC AIX target for an example where this
188 o FETCH_UP_FRAME, to force an invocation of __builtin_frame_address with a
189 positive argument right after a possibly forced call even if FRAME_LEVEL
190 is 0. See the Sparc Solaris case for an example where this is useful.
194 /*--------------------------- PPC AIX/Darwin ----------------------------*/
196 #if (defined (__ppc__) && ((defined (_AIX) || defined (__APPLE__))))
198 #define USE_GENERIC_UNWINDER
204 void *return_address
;
207 #define FRAME_OFFSET 0
209 #define STOP_FRAME(CURRENT, TOP_STACK) ((void *) (CURRENT) < (TOP_STACK))
211 /* The PPC ABI has an interesting specificity: the return address saved by a
212 function is located in it's caller's frame, and the save operation only
213 takes place if the function performs a call.
215 To have __gnat_backtrace retrieve its own return address, we then
219 #define FRAME_LEVEL 1
223 /*---------------------------- PPC VxWorks------------------------------*/
225 #elif defined (_ARCH_PPC) && defined (__vxworks)
227 #define USE_GENERIC_UNWINDER
232 void *return_address
;
236 #define FRAME_LEVEL 1
237 /* See the PPC AIX case for an explanation of these values. */
239 #define FRAME_OFFSET 0
241 #define STOP_FRAME(CURRENT, TOP_STACK) ((CURRENT)->next == 0)
245 /*-------------------------- Sparc Solaris -----------------------------*/
247 #elif defined (sun) && defined (sparc)
249 #define USE_GENERIC_UNWINDER
251 /* These definitions are inspired from the Appendix D (Software
252 Considerations) of the SPARC V8 architecture manual. */
257 void *return_address
;
260 #define FRAME_LEVEL 0
261 #define FRAME_OFFSET (14 * (sizeof (void*)))
263 #define STOP_FRAME(CURRENT, TOP_STACK) \
264 ((CURRENT)->return_address == 0|| (CURRENT)->next == 0 \
265 || (void *) (CURRENT) < (TOP_STACK))
267 /* The sparc register windows need to be flushed before we may access them
268 from the stack. This is achieved by way of builtin_frame_address only
269 when the "count" argument is positive, so force at least one such call. */
270 #define FETCH_UP_FRAME_ADDRESS
273 /* From the frame pointer of frame N, we are accessing the flushed register
274 window of frame N-1 (positive offset from fp), in which we retrieve the
275 saved return address. We then end up with our caller's return address. */
277 /*------------------------------- x86 ----------------------------------*/
283 #define IS_BAD_PTR(ptr) (IsBadCodePtr((void *)ptr))
285 #define IS_BAD_PTR(ptr) 0
288 #define USE_GENERIC_UNWINDER
293 void *return_address
;
296 #define LOWEST_ADDR 0
297 #define FRAME_LEVEL 0
298 #define FRAME_OFFSET 0
300 #define STOP_FRAME(CURRENT, TOP_STACK) \
301 (IS_BAD_PTR((long)(CURRENT)->return_address) \
302 || (unsigned int)(CURRENT)->return_address < LOWEST_ADDR \
303 || (CURRENT)->return_address == 0|| (CURRENT)->next == 0 \
304 || (void *) (CURRENT) < (TOP_STACK))
308 /* On i386 architecture we check that at the call point we really have a call
309 insn. Possible call instructions are:
311 call addr16 E8 xx xx xx xx
313 call off(reg) FF xx xx
314 lcall addr seg 9A xx xx xx xx xx xx
316 This check will not catch all cases but it will increase the backtrace
317 reliability on this architecture.
320 #define VALID_STACK_FRAME(ptr) \
322 && (((*((ptr) - 3) & 0xff) == 0xe8) \
323 || ((*((ptr) - 5) & 0xff) == 0x9a) \
324 || ((*((ptr) - 1) & 0xff) == 0xff) \
325 || (((*(ptr) & 0xd0ff) == 0xd0ff))))
327 /*------------------------------- mips-irix -------------------------------*/
329 #elif defined (__mips) && defined (__sgi)
331 #define USE_GCC_UNWINDER
336 /*---------------------------------------------------------------------*
337 *-- The post GCC 3.3 infrastructure based implementation --*
338 *---------------------------------------------------------------------*/
340 #if defined (USE_GCC_UNWINDER) && (__GNUC__ * 10 + __GNUC_MINOR__ > 33)
342 /* Conditioning the inclusion on the GCC version is useful to avoid bootstrap
343 path problems, since the included file refers to post 3.3 functions in
344 libgcc, and the stage1 compiler is unlikely to be linked against a post 3.3
345 library. It actually disables the support for backtraces in this compiler
346 for targets defining USE_GCC_UNWINDER, which is OK since we don't use the
347 traceback capability in the compiler anyway.
349 The condition is expressed the way above because we cannot reliably rely on
350 any other macro from the base compiler when compiling stage1. */
354 /*------------------------------------------------------------------*
355 *-- The generic implementation based on frame layout assumptions --*
356 *------------------------------------------------------------------*/
358 #elif defined (USE_GENERIC_UNWINDER)
360 #ifndef CURRENT_STACK_FRAME
361 # define CURRENT_STACK_FRAME ({ char __csf; &__csf; })
364 #ifndef VALID_STACK_FRAME
365 #define VALID_STACK_FRAME(ptr) 1
369 #define MAX(x,y) ((x) > (y) ? (x) : (y))
372 /* Define a dummy function to call if FORCE_CALL is defined. Don't
373 define it otherwise, as this could lead to "defined but not used"
375 #if defined (FORCE_CALL)
376 static void forced_callee () {}
380 __gnat_backtrace (void **array
,
386 struct layout
*current
;
391 /* Honor FORCE_CALL when defined. */
392 #if defined (FORCE_CALL)
396 /* Force a call to builtin_frame_address with a positive argument
397 if required. This is necessary e.g. on sparc to have the register
398 windows flushed before we attempt to access them on the stack. */
399 #if defined (FETCH_UP_FRAME_ADDRESS) && (FRAME_LEVEL == 0)
400 __builtin_frame_address (1);
403 top_frame
= __builtin_frame_address (FRAME_LEVEL
);
404 top_stack
= CURRENT_STACK_FRAME
;
405 current
= (struct layout
*) ((size_t) top_frame
+ FRAME_OFFSET
);
407 /* Skip the number of calls we have been requested to skip, accounting for
408 the BASE_SKIP parameter.
410 FRAME_LEVEL is meaningless for the count adjustment. It impacts where we
411 start retrieving data from, but how many frames "up" we start at is in
412 BASE_SKIP by definition. */
414 skip_frames
= MAX (0, skip_frames
- BASE_SKIP
);
416 while (cnt
< skip_frames
)
418 current
= (struct layout
*) ((size_t) current
->next
+ FRAME_OFFSET
);
425 if (STOP_FRAME (current
, top_stack
) ||
426 !VALID_STACK_FRAME((char *)(current
->return_address
+ PC_ADJUST
)))
429 if (current
->return_address
< exclude_min
430 || current
->return_address
> exclude_max
)
431 array
[cnt
++] = current
->return_address
+ PC_ADJUST
;
433 current
= (struct layout
*) ((size_t) current
->next
+ FRAME_OFFSET
);
441 /* No target specific implementation and neither USE_GCC_UNWINDER not
442 USE_GCC_UNWINDER defined. */
444 /*------------------------------*
445 *-- The dummy implementation --*
446 *------------------------------*/
449 __gnat_backtrace (array
, size
, exclude_min
, exclude_max
, skip_frames
)
450 void **array ATTRIBUTE_UNUSED
;
451 int size ATTRIBUTE_UNUSED
;
452 void *exclude_min ATTRIBUTE_UNUSED
;
453 void *exclude_max ATTRIBUTE_UNUSED
;
454 int skip_frames ATTRIBUTE_UNUSED
;