1 /* Output Dwarf format symbol table information from the GNU C compiler.
2 Copyright (C) 1992, 1993, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001 Free Software Foundation, Inc.
4 Contributed by Ron Guilmette (rfg@monkeys.com) of Network Computing Devices.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 2, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
25 Notes on the GNU Implementation of DWARF Debugging Information
26 --------------------------------------------------------------
27 Last Major Update: Sun Jul 17 08:17:42 PDT 1994 by rfg@segfault.us.com
28 ------------------------------------------------------------
30 This file describes special and unique aspects of the GNU implementation of
31 the DWARF Version 1 debugging information language, as provided in the GNU
32 version 2.x compiler(s).
34 For general information about the DWARF debugging information language,
35 you should obtain the DWARF version 1.1 specification document (and perhaps
36 also the DWARF version 2 draft specification document) developed by the
37 (now defunct) UNIX International Programming Languages Special Interest Group.
39 To obtain a copy of the DWARF Version 1 and/or DWARF Version 2
40 specification, visit the web page for the DWARF Version 2 committee, at
42 http://www.eagercon.com/dwarf/dwarf2std.htm
44 The generation of DWARF debugging information by the GNU version 2.x C
45 compiler has now been tested rather extensively for m88k, i386, i860, and
46 Sparc targets. The DWARF output of the GNU C compiler appears to inter-
47 operate well with the standard SVR4 SDB debugger on these kinds of target
48 systems (but of course, there are no guarantees).
50 DWARF 1 generation for the GNU g++ compiler is implemented, but limited.
51 C++ users should definitely use DWARF 2 instead.
53 Future plans for the dwarfout.c module of the GNU compiler(s) includes the
54 addition of full support for GNU FORTRAN. (This should, in theory, be a
55 lot simpler to add than adding support for g++... but we'll see.)
57 Many features of the DWARF version 2 specification have been adapted to
58 (and used in) the GNU implementation of DWARF (version 1). In most of
59 these cases, a DWARF version 2 approach is used in place of (or in addition
60 to) DWARF version 1 stuff simply because it is apparent that DWARF version
61 1 is not sufficiently expressive to provide the kinds of information which
62 may be necessary to support really robust debugging. In all of these cases
63 however, the use of DWARF version 2 features should not interfere in any
64 way with the interoperability (of GNU compilers) with generally available
65 "classic" (pre version 1) DWARF consumer tools (e.g. SVR4 SDB).
67 The DWARF generation enhancement for the GNU compiler(s) was initially
68 donated to the Free Software Foundation by Network Computing Devices.
69 (Thanks NCD!) Additional development and maintenance of dwarfout.c has
70 been largely supported (i.e. funded) by Intel Corporation. (Thanks Intel!)
72 If you have questions or comments about the DWARF generation feature, please
73 send mail to me <rfg@netcom.com>. I will be happy to investigate any bugs
74 reported and I may even provide fixes (but of course, I can make no promises).
76 The DWARF debugging information produced by GCC may deviate in a few minor
77 (but perhaps significant) respects from the DWARF debugging information
78 currently produced by other C compilers. A serious attempt has been made
79 however to conform to the published specifications, to existing practice,
80 and to generally accepted norms in the GNU implementation of DWARF.
82 ** IMPORTANT NOTE ** ** IMPORTANT NOTE ** ** IMPORTANT NOTE **
84 Under normal circumstances, the DWARF information generated by the GNU
85 compilers (in an assembly language file) is essentially impossible for
86 a human being to read. This fact can make it very difficult to debug
87 certain DWARF-related problems. In order to overcome this difficulty,
88 a feature has been added to dwarfout.c (enabled by the -dA
89 option) which causes additional comments to be placed into the assembly
90 language output file, out to the right-hand side of most bits of DWARF
91 material. The comments indicate (far more clearly that the obscure
92 DWARF hex codes do) what is actually being encoded in DWARF. Thus, the
93 -dA option can be highly useful for those who must study the
94 DWARF output from the GNU compilers in detail.
98 (Footnote: Within this file, the term `Debugging Information Entry' will
99 be abbreviated as `DIE'.)
102 Release Notes (aka known bugs)
103 -------------------------------
105 In one very obscure case involving dynamically sized arrays, the DWARF
106 "location information" for such an array may make it appear that the
107 array has been totally optimized out of existence, when in fact it
108 *must* actually exist. (This only happens when you are using *both* -g
109 *and* -O.) This is due to aggressive dead store elimination in the
110 compiler, and to the fact that the DECL_RTL expressions associated with
111 variables are not always updated to correctly reflect the effects of
112 GCC's aggressive dead store elimination.
114 -------------------------------
116 When attempting to set a breakpoint at the "start" of a function compiled
117 with -g1, the debugger currently has no way of knowing exactly where the
118 end of the prologue code for the function is. Thus, for most targets,
119 all the debugger can do is to set the breakpoint at the AT_low_pc address
120 for the function. But if you stop there and then try to look at one or
121 more of the formal parameter values, they may not have been "homed" yet,
122 so you may get inaccurate answers (or perhaps even addressing errors).
124 Some people may consider this simply a non-feature, but I consider it a
125 bug, and I hope to provide some GNU-specific attributes (on function
126 DIEs) which will specify the address of the end of the prologue and the
127 address of the beginning of the epilogue in a future release.
129 -------------------------------
131 It is believed at this time that old bugs relating to the AT_bit_offset
132 values for bit-fields have been fixed.
134 There may still be some very obscure bugs relating to the DWARF description
135 of type `long long' bit-fields for target machines (e.g. 80x86 machines)
136 where the alignment of type `long long' data objects is different from
137 (and less than) the size of a type `long long' data object.
139 Please report any problems with the DWARF description of bit-fields as you
140 would any other GCC bug. (Procedures for bug reporting are given in the
141 GNU C compiler manual.)
143 --------------------------------
145 At this time, GCC does not know how to handle the GNU C "nested functions"
146 extension. (See the GCC manual for more info on this extension to ANSI C.)
148 --------------------------------
150 The GNU compilers now represent inline functions (and inlined instances
151 thereof) in exactly the manner described by the current DWARF version 2
152 (draft) specification. The version 1 specification for handling inline
153 functions (and inlined instances) was known to be brain-damaged (by the
154 PLSIG) when the version 1 spec was finalized, but it was simply too late
155 in the cycle to get it removed before the version 1 spec was formally
156 released to the public (by UI).
158 --------------------------------
160 At this time, GCC does not generate the kind of really precise information
161 about the exact declared types of entities with signed integral types which
162 is required by the current DWARF draft specification.
164 Specifically, the current DWARF draft specification seems to require that
165 the type of an non-unsigned integral bit-field member of a struct or union
166 type be represented as either a "signed" type or as a "plain" type,
167 depending upon the exact set of keywords that were used in the
168 type specification for the given bit-field member. It was felt (by the
169 UI/PLSIG) that this distinction between "plain" and "signed" integral types
170 could have some significance (in the case of bit-fields) because ANSI C
171 does not constrain the signedness of a plain bit-field, whereas it does
172 constrain the signedness of an explicitly "signed" bit-field. For this
173 reason, the current DWARF specification calls for compilers to produce
174 type information (for *all* integral typed entities... not just bit-fields)
175 which explicitly indicates the signedness of the relevant type to be
176 "signed" or "plain" or "unsigned".
178 Unfortunately, the GNU DWARF implementation is currently incapable of making
181 --------------------------------
184 Known Interoperability Problems
185 -------------------------------
187 Although the GNU implementation of DWARF conforms (for the most part) with
188 the current UI/PLSIG DWARF version 1 specification (with many compatible
189 version 2 features added in as "vendor specific extensions" just for good
190 measure) there are a few known cases where GCC's DWARF output can cause
191 some confusion for "classic" (pre version 1) DWARF consumers such as the
192 System V Release 4 SDB debugger. These cases are described in this section.
194 --------------------------------
196 The DWARF version 1 specification includes the fundamental type codes
197 FT_ext_prec_float, FT_complex, FT_dbl_prec_complex, and FT_ext_prec_complex.
198 Since GNU C is only a C compiler (and since C doesn't provide any "complex"
199 data types) the only one of these fundamental type codes which GCC ever
200 generates is FT_ext_prec_float. This fundamental type code is generated
201 by GCC for the `long double' data type. Unfortunately, due to an apparent
202 bug in the SVR4 SDB debugger, SDB can become very confused wherever any
203 attempt is made to print a variable, parameter, or field whose type was
204 given in terms of FT_ext_prec_float.
206 (Actually, SVR4 SDB fails to understand *any* of the four fundamental type
207 codes mentioned here. This will fact will cause additional problems when
208 there is a GNU FORTRAN front-end.)
210 --------------------------------
212 In general, it appears that SVR4 SDB is not able to effectively ignore
213 fundamental type codes in the "implementation defined" range. This can
214 cause problems when a program being debugged uses the `long long' data
215 type (or the signed or unsigned varieties thereof) because these types
216 are not defined by ANSI C, and thus, GCC must use its own private fundamental
217 type codes (from the implementation-defined range) to represent these types.
219 --------------------------------
222 General GNU DWARF extensions
223 ----------------------------
225 In the current DWARF version 1 specification, no mechanism is specified by
226 which accurate information about executable code from include files can be
227 properly (and fully) described. (The DWARF version 2 specification *does*
228 specify such a mechanism, but it is about 10 times more complicated than
229 it needs to be so I'm not terribly anxious to try to implement it right
232 In the GNU implementation of DWARF version 1, a fully downward-compatible
233 extension has been implemented which permits the GNU compilers to specify
234 which executable lines come from which files. This extension places
235 additional information (about source file names) in GNU-specific sections
236 (which should be totally ignored by all non-GNU DWARF consumers) so that
237 this extended information can be provided (to GNU DWARF consumers) in a way
238 which is totally transparent (and invisible) to non-GNU DWARF consumers
239 (e.g. the SVR4 SDB debugger). The additional information is placed *only*
240 in specialized GNU-specific sections, where it should never even be seen
241 by non-GNU DWARF consumers.
243 To understand this GNU DWARF extension, imagine that the sequence of entries
244 in the .lines section is broken up into several subsections. Each contiguous
245 sequence of .line entries which relates to a sequence of lines (or statements)
246 from one particular file (either a `base' file or an `include' file) could
247 be called a `line entries chunk' (LEC).
249 For each LEC there is one entry in the .debug_srcinfo section.
251 Each normal entry in the .debug_srcinfo section consists of two 4-byte
252 words of data as follows:
254 (1) The starting address (relative to the entire .line section)
255 of the first .line entry in the relevant LEC.
257 (2) The starting address (relative to the entire .debug_sfnames
258 section) of a NUL terminated string representing the
259 relevant filename. (This filename name be either a
260 relative or an absolute filename, depending upon how the
261 given source file was located during compilation.)
263 Obviously, each .debug_srcinfo entry allows you to find the relevant filename,
264 and it also points you to the first .line entry that was generated as a result
265 of having compiled a given source line from the given source file.
267 Each subsequent .line entry should also be assumed to have been produced
268 as a result of compiling yet more lines from the same file. The end of
269 any given LEC is easily found by looking at the first 4-byte pointer in
270 the *next* .debug_srcinfo entry. That next .debug_srcinfo entry points
271 to a new and different LEC, so the preceding LEC (implicitly) must have
272 ended with the last .line section entry which occurs at the 2 1/2 words
273 just before the address given in the first pointer of the new .debug_srcinfo
276 The following picture may help to clarify this feature. Let's assume that
277 `LE' stands for `.line entry'. Also, assume that `* 'stands for a pointer.
280 .line section .debug_srcinfo section .debug_sfnames section
281 ----------------------------------------------------------------
283 LE <---------------------- *
284 LE * -----------------> "foobar.c" <---
287 LE <---------------------- * |
288 LE * -----------------> "foobar.h" <| |
291 LE <---------------------- * | |
292 LE * -----------------> "inner.h" | |
294 LE <---------------------- * | |
295 LE * ------------------------------- |
300 LE <---------------------- * |
301 LE * -----------------------------------
306 In effect, each entry in the .debug_srcinfo section points to *both* a
307 filename (in the .debug_sfnames section) and to the start of a block of
308 consecutive LEs (in the .line section).
310 Note that just like in the .line section, there are specialized first and
311 last entries in the .debug_srcinfo section for each object file. These
312 special first and last entries for the .debug_srcinfo section are very
313 different from the normal .debug_srcinfo section entries. They provide
314 additional information which may be helpful to a debugger when it is
315 interpreting the data in the .debug_srcinfo, .debug_sfnames, and .line
318 The first entry in the .debug_srcinfo section for each compilation unit
319 consists of five 4-byte words of data. The contents of these five words
320 should be interpreted (by debuggers) as follows:
322 (1) The starting address (relative to the entire .line section)
323 of the .line section for this compilation unit.
325 (2) The starting address (relative to the entire .debug_sfnames
326 section) of the .debug_sfnames section for this compilation
329 (3) The starting address (in the execution virtual address space)
330 of the .text section for this compilation unit.
332 (4) The ending address plus one (in the execution virtual address
333 space) of the .text section for this compilation unit.
335 (5) The date/time (in seconds since midnight 1/1/70) at which the
336 compilation of this compilation unit occurred. This value
337 should be interpreted as an unsigned quantity because gcc
338 might be configured to generate a default value of 0xffffffff
339 in this field (in cases where it is desired to have object
340 files created at different times from identical source files
341 be byte-for-byte identical). By default, these timestamps
342 are *not* generated by dwarfout.c (so that object files
343 compiled at different times will be byte-for-byte identical).
344 If you wish to enable this "timestamp" feature however, you
345 can simply place a #define for the symbol `DWARF_TIMESTAMPS'
346 in your target configuration file and then rebuild the GNU
349 Note that the first string placed into the .debug_sfnames section for each
350 compilation unit is the name of the directory in which compilation occurred.
351 This string ends with a `/' (to help indicate that it is the pathname of a
352 directory). Thus, the second word of each specialized initial .debug_srcinfo
353 entry for each compilation unit may be used as a pointer to the (string)
354 name of the compilation directory, and that string may in turn be used to
355 "absolutize" any relative pathnames which may appear later on in the
356 .debug_sfnames section entries for the same compilation unit.
358 The fifth and last word of each specialized starting entry for a compilation
359 unit in the .debug_srcinfo section may (depending upon your configuration)
360 indicate the date/time of compilation, and this may be used (by a debugger)
361 to determine if any of the source files which contributed code to this
362 compilation unit are newer than the object code for the compilation unit
363 itself. If so, the debugger may wish to print an "out-of-date" warning
364 about the compilation unit.
366 The .debug_srcinfo section associated with each compilation will also have
367 a specialized terminating entry. This terminating .debug_srcinfo section
368 entry will consist of the following two 4-byte words of data:
370 (1) The offset, measured from the start of the .line section to
371 the beginning of the terminating entry for the .line section.
373 (2) A word containing the value 0xffffffff.
375 --------------------------------
377 In the current DWARF version 1 specification, no mechanism is specified by
378 which information about macro definitions and un-definitions may be provided
379 to the DWARF consumer.
381 The DWARF version 2 (draft) specification does specify such a mechanism.
382 That specification was based on the GNU ("vendor specific extension")
383 which provided some support for macro definitions and un-definitions,
384 but the "official" DWARF version 2 (draft) specification mechanism for
385 handling macros and the GNU implementation have diverged somewhat. I
386 plan to update the GNU implementation to conform to the "official"
387 DWARF version 2 (draft) specification as soon as I get time to do that.
389 Note that in the GNU implementation, additional information about macro
390 definitions and un-definitions is *only* provided when the -g3 level of
391 debug-info production is selected. (The default level is -g2 and the
392 plain old -g option is considered to be identical to -g2.)
394 GCC records information about macro definitions and undefinitions primarily
395 in a section called the .debug_macinfo section. Normal entries in the
396 .debug_macinfo section consist of the following three parts:
398 (1) A special "type" byte.
400 (2) A 3-byte line-number/filename-offset field.
402 (3) A NUL terminated string.
404 The interpretation of the second and third parts is dependent upon the
405 value of the leading (type) byte.
407 The type byte may have one of four values depending upon the type of the
408 .debug_macinfo entry which follows. The 1-byte MACINFO type codes presently
409 used, and their meanings are as follows:
411 MACINFO_start A base file or an include file starts here.
412 MACINFO_resume The current base or include file ends here.
413 MACINFO_define A #define directive occurs here.
414 MACINFO_undef A #undef directive occur here.
416 (Note that the MACINFO_... codes mentioned here are simply symbolic names
417 for constants which are defined in the GNU dwarf.h file.)
419 For MACINFO_define and MACINFO_undef entries, the second (3-byte) field
420 contains the number of the source line (relative to the start of the current
421 base source file or the current include files) when the #define or #undef
422 directive appears. For a MACINFO_define entry, the following string field
423 contains the name of the macro which is defined, followed by its definition.
424 Note that the definition is always separated from the name of the macro
425 by at least one whitespace character. For a MACINFO_undef entry, the
426 string which follows the 3-byte line number field contains just the name
427 of the macro which is being undef'ed.
429 For a MACINFO_start entry, the 3-byte field following the type byte contains
430 the offset, relative to the start of the .debug_sfnames section for the
431 current compilation unit, of a string which names the new source file which
432 is beginning its inclusion at this point. Following that 3-byte field,
433 each MACINFO_start entry always contains a zero length NUL terminated
436 For a MACINFO_resume entry, the 3-byte field following the type byte contains
437 the line number WITHIN THE INCLUDING FILE at which the inclusion of the
438 current file (whose inclusion ends here) was initiated. Following that
439 3-byte field, each MACINFO_resume entry always contains a zero length NUL
442 Each set of .debug_macinfo entries for each compilation unit is terminated
443 by a special .debug_macinfo entry consisting of a 4-byte zero value followed
444 by a single NUL byte.
446 --------------------------------
448 In the current DWARF draft specification, no provision is made for providing
449 a separate level of (limited) debugging information necessary to support
450 tracebacks (only) through fully-debugged code (e.g. code in system libraries).
452 A proposal to define such a level was submitted (by me) to the UI/PLSIG.
453 This proposal was rejected by the UI/PLSIG for inclusion into the DWARF
454 version 1 specification for two reasons. First, it was felt (by the PLSIG)
455 that the issues involved in supporting a "traceback only" subset of DWARF
456 were not well understood. Second, and perhaps more importantly, the PLSIG
457 is already having enough trouble agreeing on what it means to be "conforming"
458 to the DWARF specification, and it was felt that trying to specify multiple
459 different *levels* of conformance would only complicate our discussions of
460 this already divisive issue. Nonetheless, the GNU implementation of DWARF
461 provides an abbreviated "traceback only" level of debug-info production for
462 use with fully-debugged "system library" code. This level should only be
463 used for fully debugged system library code, and even then, it should only
464 be used where there is a very strong need to conserve disk space. This
465 abbreviated level of debug-info production can be used by specifying the
466 -g1 option on the compilation command line.
468 --------------------------------
470 As mentioned above, the GNU implementation of DWARF currently uses the DWARF
471 version 2 (draft) approach for inline functions (and inlined instances
472 thereof). This is used in preference to the version 1 approach because
473 (quite simply) the version 1 approach is highly brain-damaged and probably
476 --------------------------------
479 GNU DWARF Representation of GNU C Extensions to ANSI C
480 ------------------------------------------------------
482 The file dwarfout.c has been designed and implemented so as to provide
483 some reasonable DWARF representation for each and every declarative
484 construct which is accepted by the GNU C compiler. Since the GNU C
485 compiler accepts a superset of ANSI C, this means that there are some
486 cases in which the DWARF information produced by GCC must take some
487 liberties in improvising DWARF representations for declarations which
488 are only valid in (extended) GNU C.
490 In particular, GNU C provides at least three significant extensions to
491 ANSI C when it comes to declarations. These are (1) inline functions,
492 and (2) dynamic arrays, and (3) incomplete enum types. (See the GCC
493 manual for more information on these GNU extensions to ANSI C.) When
494 used, these GNU C extensions are represented (in the generated DWARF
495 output of GCC) in the most natural and intuitively obvious ways.
497 In the case of inline functions, the DWARF representation is exactly as
498 called for in the DWARF version 2 (draft) specification for an identical
499 function written in C++; i.e. we "reuse" the representation of inline
500 functions which has been defined for C++ to support this GNU C extension.
502 In the case of dynamic arrays, we use the most obvious representational
503 mechanism available; i.e. an array type in which the upper bound of
504 some dimension (usually the first and only dimension) is a variable
505 rather than a constant. (See the DWARF version 1 specification for more
508 In the case of incomplete enum types, such types are represented simply
509 as TAG_enumeration_type DIEs which DO NOT contain either AT_byte_size
510 attributes or AT_element_list attributes.
512 --------------------------------
518 The codes, formats, and other paraphernalia necessary to provide proper
519 support for symbolic debugging for the C++ language are still being worked
520 on by the UI/PLSIG. The vast majority of the additions to DWARF which will
521 be needed to completely support C++ have already been hashed out and agreed
522 upon, but a few small issues (e.g. anonymous unions, access declarations)
523 are still being discussed. Also, we in the PLSIG are still discussing
524 whether or not we need to do anything special for C++ templates. (At this
525 time it is not yet clear whether we even need to do anything special for
528 With regard to FORTRAN, the UI/PLSIG has defined what is believed to be a
529 complete and sufficient set of codes and rules for adequately representing
530 all of FORTRAN 77, and most of Fortran 90 in DWARF. While some support for
531 this has been implemented in dwarfout.c, further implementation and testing
534 GNU DWARF support for other languages (i.e. Pascal and Modula) is a moot
535 issue until there are GNU front-ends for these other languages.
537 As currently defined, DWARF only describes a (binary) language which can
538 be used to communicate symbolic debugging information from a compiler
539 through an assembler and a linker, to a debugger. There is no clear
540 specification of what processing should be (or must be) done by the
541 assembler and/or the linker. Fortunately, the role of the assembler
542 is easily inferred (by anyone knowledgeable about assemblers) just by
543 looking at examples of assembly-level DWARF code. Sadly though, the
544 allowable (or required) processing steps performed by a linker are
545 harder to infer and (perhaps) even harder to agree upon. There are
546 several forms of very useful `post-processing' steps which intelligent
547 linkers *could* (in theory) perform on object files containing DWARF,
548 but any and all such link-time transformations are currently both disallowed
551 In particular, possible link-time transformations of DWARF code which could
552 provide significant benefits include (but are not limited to):
554 Commonization of duplicate DIEs obtained from multiple input
557 Cross-compilation type checking based upon DWARF type information
558 for objects and functions.
560 Other possible `compacting' transformations designed to save disk
561 space and to reduce linker & debugger I/O activity.
567 #ifdef DWARF_DEBUGGING_INFO
573 #include "hard-reg-set.h"
574 #include "insn-config.h"
577 #include "dwarf2asm.h"
581 #include "langhooks.h"
583 /* NOTE: In the comments in this file, many references are made to
584 so called "Debugging Information Entries". For the sake of brevity,
585 this term is abbreviated to `DIE' throughout the remainder of this
588 /* Note that the implementation of C++ support herein is (as yet) unfinished.
589 If you want to try to complete it, more power to you. */
591 /* How to start an assembler comment. */
592 #ifndef ASM_COMMENT_START
593 #define ASM_COMMENT_START ";#"
596 /* How to print out a register name. */
598 #define PRINT_REG(RTX, CODE, FILE) \
599 fprintf ((FILE), "%s", reg_names[REGNO (RTX)])
602 /* Define a macro which returns non-zero for any tagged type which is
603 used (directly or indirectly) in the specification of either some
604 function's return type or some formal parameter of some function.
605 We use this macro when we are operating in "terse" mode to help us
606 know what tagged types have to be represented in Dwarf (even in
607 terse mode) and which ones don't.
609 A flag bit with this meaning really should be a part of the normal
610 GCC ..._TYPE nodes, but at the moment, there is no such bit defined
611 for these nodes. For now, we have to just fake it. It it safe for
612 us to simply return zero for all complete tagged types (which will
613 get forced out anyway if they were used in the specification of some
614 formal or return type) and non-zero for all incomplete tagged types.
617 #define TYPE_USED_FOR_FUNCTION(tagged_type) (TYPE_SIZE (tagged_type) == 0)
619 /* Define a macro which returns non-zero for a TYPE_DECL which was
620 implicitly generated for a tagged type.
622 Note that unlike the gcc front end (which generates a NULL named
623 TYPE_DECL node for each complete tagged type, each array type, and
624 each function type node created) the g++ front end generates a
625 _named_ TYPE_DECL node for each tagged type node created.
626 These TYPE_DECLs have DECL_ARTIFICIAL set, so we know not to
627 generate a DW_TAG_typedef DIE for them. */
628 #define TYPE_DECL_IS_STUB(decl) \
629 (DECL_NAME (decl) == NULL \
630 || (DECL_ARTIFICIAL (decl) \
631 && is_tagged_type (TREE_TYPE (decl)) \
632 && decl == TYPE_STUB_DECL (TREE_TYPE (decl))))
634 extern int flag_traditional;
636 /* Maximum size (in bytes) of an artificially generated label. */
638 #define MAX_ARTIFICIAL_LABEL_BYTES 30
640 /* Structure to keep track of source filenames. */
642 struct filename_entry {
647 typedef struct filename_entry filename_entry;
649 /* Pointer to an array of elements, each one having the structure above. */
651 static filename_entry *filename_table;
653 /* Total number of entries in the table (i.e. array) pointed to by
654 `filename_table'. This is the *total* and includes both used and
657 static unsigned ft_entries_allocated;
659 /* Number of entries in the filename_table which are actually in use. */
661 static unsigned ft_entries;
663 /* Size (in elements) of increments by which we may expand the filename
664 table. Actually, a single hunk of space of this size should be enough
665 for most typical programs. */
667 #define FT_ENTRIES_INCREMENT 64
669 /* Local pointer to the name of the main input file. Initialized in
672 static const char *primary_filename;
674 /* Counter to generate unique names for DIEs. */
676 static unsigned next_unused_dienum = 1;
678 /* Number of the DIE which is currently being generated. */
680 static unsigned current_dienum;
682 /* Number to use for the special "pubname" label on the next DIE which
683 represents a function or data object defined in this compilation
684 unit which has "extern" linkage. */
686 static int next_pubname_number = 0;
688 #define NEXT_DIE_NUM pending_sibling_stack[pending_siblings-1]
690 /* Pointer to a dynamically allocated list of pre-reserved and still
691 pending sibling DIE numbers. Note that this list will grow as needed. */
693 static unsigned *pending_sibling_stack;
695 /* Counter to keep track of the number of pre-reserved and still pending
696 sibling DIE numbers. */
698 static unsigned pending_siblings;
700 /* The currently allocated size of the above list (expressed in number of
703 static unsigned pending_siblings_allocated;
705 /* Size (in elements) of increments by which we may expand the pending
706 sibling stack. Actually, a single hunk of space of this size should
707 be enough for most typical programs. */
709 #define PENDING_SIBLINGS_INCREMENT 64
711 /* Non-zero if we are performing our file-scope finalization pass and if
712 we should force out Dwarf descriptions of any and all file-scope
713 tagged types which are still incomplete types. */
715 static int finalizing = 0;
717 /* A pointer to the base of a list of pending types which we haven't
718 generated DIEs for yet, but which we will have to come back to
721 static tree *pending_types_list;
723 /* Number of elements currently allocated for the pending_types_list. */
725 static unsigned pending_types_allocated;
727 /* Number of elements of pending_types_list currently in use. */
729 static unsigned pending_types;
731 /* Size (in elements) of increments by which we may expand the pending
732 types list. Actually, a single hunk of space of this size should
733 be enough for most typical programs. */
735 #define PENDING_TYPES_INCREMENT 64
737 /* A pointer to the base of a list of incomplete types which might be
738 completed at some later time. */
740 static tree *incomplete_types_list;
742 /* Number of elements currently allocated for the incomplete_types_list. */
743 static unsigned incomplete_types_allocated;
745 /* Number of elements of incomplete_types_list currently in use. */
746 static unsigned incomplete_types;
748 /* Size (in elements) of increments by which we may expand the incomplete
749 types list. Actually, a single hunk of space of this size should
750 be enough for most typical programs. */
751 #define INCOMPLETE_TYPES_INCREMENT 64
753 /* Pointer to an artificial RECORD_TYPE which we create in dwarfout_init.
754 This is used in a hack to help us get the DIEs describing types of
755 formal parameters to come *after* all of the DIEs describing the formal
756 parameters themselves. That's necessary in order to be compatible
757 with what the brain-damaged svr4 SDB debugger requires. */
759 static tree fake_containing_scope;
761 /* The number of the current function definition that we are generating
762 debugging information for. These numbers range from 1 up to the maximum
763 number of function definitions contained within the current compilation
764 unit. These numbers are used to create unique labels for various things
765 contained within various function definitions. */
767 static unsigned current_funcdef_number = 1;
769 /* A pointer to the ..._DECL node which we have most recently been working
770 on. We keep this around just in case something about it looks screwy
771 and we want to tell the user what the source coordinates for the actual
774 static tree dwarf_last_decl;
776 /* A flag indicating that we are emitting the member declarations of a
777 class, so member functions and variables should not be entirely emitted.
778 This is a kludge to avoid passing a second argument to output_*_die. */
782 /* Forward declarations for functions defined in this file. */
784 static void dwarfout_init PARAMS ((const char *));
785 static void dwarfout_finish PARAMS ((const char *));
786 static void dwarfout_define PARAMS ((unsigned int, const char *));
787 static void dwarfout_undef PARAMS ((unsigned int, const char *));
788 static void dwarfout_start_source_file PARAMS ((unsigned, const char *));
789 static void dwarfout_start_source_file_check PARAMS ((unsigned, const char *));
790 static void dwarfout_end_source_file PARAMS ((unsigned));
791 static void dwarfout_end_source_file_check PARAMS ((unsigned));
792 static void dwarfout_begin_block PARAMS ((unsigned, unsigned));
793 static void dwarfout_end_block PARAMS ((unsigned, unsigned));
794 static void dwarfout_end_epilogue PARAMS ((void));
795 static void dwarfout_source_line PARAMS ((unsigned int, const char *));
796 static void dwarfout_end_prologue PARAMS ((unsigned int));
797 static void dwarfout_end_function PARAMS ((unsigned int));
798 static void dwarfout_function_decl PARAMS ((tree));
799 static void dwarfout_global_decl PARAMS ((tree));
800 static void dwarfout_deferred_inline_function PARAMS ((tree));
801 static void dwarfout_file_scope_decl PARAMS ((tree , int));
802 static const char *dwarf_tag_name PARAMS ((unsigned));
803 static const char *dwarf_attr_name PARAMS ((unsigned));
804 static const char *dwarf_stack_op_name PARAMS ((unsigned));
805 static const char *dwarf_typemod_name PARAMS ((unsigned));
806 static const char *dwarf_fmt_byte_name PARAMS ((unsigned));
807 static const char *dwarf_fund_type_name PARAMS ((unsigned));
808 static tree decl_ultimate_origin PARAMS ((tree));
809 static tree block_ultimate_origin PARAMS ((tree));
810 static tree decl_class_context PARAMS ((tree));
812 static void output_unsigned_leb128 PARAMS ((unsigned long));
813 static void output_signed_leb128 PARAMS ((long));
815 static int fundamental_type_code PARAMS ((tree));
816 static tree root_type_1 PARAMS ((tree, int));
817 static tree root_type PARAMS ((tree));
818 static void write_modifier_bytes_1 PARAMS ((tree, int, int, int));
819 static void write_modifier_bytes PARAMS ((tree, int, int));
820 static inline int type_is_fundamental PARAMS ((tree));
821 static void equate_decl_number_to_die_number PARAMS ((tree));
822 static inline void equate_type_number_to_die_number PARAMS ((tree));
823 static void output_reg_number PARAMS ((rtx));
824 static void output_mem_loc_descriptor PARAMS ((rtx));
825 static void output_loc_descriptor PARAMS ((rtx));
826 static void output_bound_representation PARAMS ((tree, unsigned, int));
827 static void output_enumeral_list PARAMS ((tree));
828 static inline HOST_WIDE_INT ceiling PARAMS ((HOST_WIDE_INT, unsigned int));
829 static inline tree field_type PARAMS ((tree));
830 static inline unsigned int simple_type_align_in_bits PARAMS ((tree));
831 static inline unsigned HOST_WIDE_INT simple_type_size_in_bits PARAMS ((tree));
832 static HOST_WIDE_INT field_byte_offset PARAMS ((tree));
833 static inline void sibling_attribute PARAMS ((void));
834 static void location_attribute PARAMS ((rtx));
835 static void data_member_location_attribute PARAMS ((tree));
836 static void const_value_attribute PARAMS ((rtx));
837 static void location_or_const_value_attribute PARAMS ((tree));
838 static inline void name_attribute PARAMS ((const char *));
839 static inline void fund_type_attribute PARAMS ((unsigned));
840 static void mod_fund_type_attribute PARAMS ((tree, int, int));
841 static inline void user_def_type_attribute PARAMS ((tree));
842 static void mod_u_d_type_attribute PARAMS ((tree, int, int));
843 #ifdef USE_ORDERING_ATTRIBUTE
844 static inline void ordering_attribute PARAMS ((unsigned));
845 #endif /* defined(USE_ORDERING_ATTRIBUTE) */
846 static void subscript_data_attribute PARAMS ((tree));
847 static void byte_size_attribute PARAMS ((tree));
848 static inline void bit_offset_attribute PARAMS ((tree));
849 static inline void bit_size_attribute PARAMS ((tree));
850 static inline void element_list_attribute PARAMS ((tree));
851 static inline void stmt_list_attribute PARAMS ((const char *));
852 static inline void low_pc_attribute PARAMS ((const char *));
853 static inline void high_pc_attribute PARAMS ((const char *));
854 static inline void body_begin_attribute PARAMS ((const char *));
855 static inline void body_end_attribute PARAMS ((const char *));
856 static inline void language_attribute PARAMS ((unsigned));
857 static inline void member_attribute PARAMS ((tree));
859 static inline void string_length_attribute PARAMS ((tree));
861 static inline void comp_dir_attribute PARAMS ((const char *));
862 static inline void sf_names_attribute PARAMS ((const char *));
863 static inline void src_info_attribute PARAMS ((const char *));
864 static inline void mac_info_attribute PARAMS ((const char *));
865 static inline void prototyped_attribute PARAMS ((tree));
866 static inline void producer_attribute PARAMS ((const char *));
867 static inline void inline_attribute PARAMS ((tree));
868 static inline void containing_type_attribute PARAMS ((tree));
869 static inline void abstract_origin_attribute PARAMS ((tree));
870 #ifdef DWARF_DECL_COORDINATES
871 static inline void src_coords_attribute PARAMS ((unsigned, unsigned));
872 #endif /* defined(DWARF_DECL_COORDINATES) */
873 static inline void pure_or_virtual_attribute PARAMS ((tree));
874 static void name_and_src_coords_attributes PARAMS ((tree));
875 static void type_attribute PARAMS ((tree, int, int));
876 static const char *type_tag PARAMS ((tree));
877 static inline void dienum_push PARAMS ((void));
878 static inline void dienum_pop PARAMS ((void));
879 static inline tree member_declared_type PARAMS ((tree));
880 static const char *function_start_label PARAMS ((tree));
881 static void output_array_type_die PARAMS ((void *));
882 static void output_set_type_die PARAMS ((void *));
884 static void output_entry_point_die PARAMS ((void *));
886 static void output_inlined_enumeration_type_die PARAMS ((void *));
887 static void output_inlined_structure_type_die PARAMS ((void *));
888 static void output_inlined_union_type_die PARAMS ((void *));
889 static void output_enumeration_type_die PARAMS ((void *));
890 static void output_formal_parameter_die PARAMS ((void *));
891 static void output_global_subroutine_die PARAMS ((void *));
892 static void output_global_variable_die PARAMS ((void *));
893 static void output_label_die PARAMS ((void *));
894 static void output_lexical_block_die PARAMS ((void *));
895 static void output_inlined_subroutine_die PARAMS ((void *));
896 static void output_local_variable_die PARAMS ((void *));
897 static void output_member_die PARAMS ((void *));
899 static void output_pointer_type_die PARAMS ((void *));
900 static void output_reference_type_die PARAMS ((void *));
902 static void output_ptr_to_mbr_type_die PARAMS ((void *));
903 static void output_compile_unit_die PARAMS ((void *));
904 static void output_string_type_die PARAMS ((void *));
905 static void output_inheritance_die PARAMS ((void *));
906 static void output_structure_type_die PARAMS ((void *));
907 static void output_local_subroutine_die PARAMS ((void *));
908 static void output_subroutine_type_die PARAMS ((void *));
909 static void output_typedef_die PARAMS ((void *));
910 static void output_union_type_die PARAMS ((void *));
911 static void output_unspecified_parameters_die PARAMS ((void *));
912 static void output_padded_null_die PARAMS ((void *));
913 static void output_die PARAMS ((void (*)(void *), void *));
914 static void end_sibling_chain PARAMS ((void));
915 static void output_formal_types PARAMS ((tree));
916 static void pend_type PARAMS ((tree));
917 static int type_ok_for_scope PARAMS ((tree, tree));
918 static void output_pending_types_for_scope PARAMS ((tree));
919 static void output_type PARAMS ((tree, tree));
920 static void output_tagged_type_instantiation PARAMS ((tree));
921 static void output_block PARAMS ((tree, int));
922 static void output_decls_for_scope PARAMS ((tree, int));
923 static void output_decl PARAMS ((tree, tree));
924 static void shuffle_filename_entry PARAMS ((filename_entry *));
925 static void generate_new_sfname_entry PARAMS ((void));
926 static unsigned lookup_filename PARAMS ((const char *));
927 static void generate_srcinfo_entry PARAMS ((unsigned, unsigned));
928 static void generate_macinfo_entry PARAMS ((unsigned int, rtx,
930 static int is_pseudo_reg PARAMS ((rtx));
931 static tree type_main_variant PARAMS ((tree));
932 static int is_tagged_type PARAMS ((tree));
933 static int is_redundant_typedef PARAMS ((tree));
934 static void add_incomplete_type PARAMS ((tree));
935 static void retry_incomplete_types PARAMS ((void));
937 /* Definitions of defaults for assembler-dependent names of various
938 pseudo-ops and section names.
940 Theses may be overridden in your tm.h file (if necessary) for your
941 particular assembler. The default values provided here correspond to
942 what is expected by "standard" AT&T System V.4 assemblers. */
945 #define FILE_ASM_OP "\t.file\t"
947 #ifndef VERSION_ASM_OP
948 #define VERSION_ASM_OP "\t.version\t"
951 #define SET_ASM_OP "\t.set\t"
954 /* Pseudo-ops for pushing the current section onto the section stack (and
955 simultaneously changing to a new section) and for poping back to the
956 section we were in immediately before this one. Note that most svr4
957 assemblers only maintain a one level stack... you can push all the
958 sections you want, but you can only pop out one level. (The sparc
959 svr4 assembler is an exception to this general rule.) That's
960 OK because we only use at most one level of the section stack herein. */
962 #ifndef PUSHSECTION_ASM_OP
963 #define PUSHSECTION_ASM_OP "\t.section\t"
965 #ifndef POPSECTION_ASM_OP
966 #define POPSECTION_ASM_OP "\t.previous"
969 /* The default format used by the ASM_OUTPUT_PUSH_SECTION macro (see below)
970 to print the PUSHSECTION_ASM_OP and the section name. The default here
971 works for almost all svr4 assemblers, except for the sparc, where the
972 section name must be enclosed in double quotes. (See sparcv4.h.) */
974 #ifndef PUSHSECTION_FORMAT
975 #define PUSHSECTION_FORMAT "%s%s\n"
978 #ifndef DEBUG_SECTION
979 #define DEBUG_SECTION ".debug"
982 #define LINE_SECTION ".line"
984 #ifndef DEBUG_SFNAMES_SECTION
985 #define DEBUG_SFNAMES_SECTION ".debug_sfnames"
987 #ifndef DEBUG_SRCINFO_SECTION
988 #define DEBUG_SRCINFO_SECTION ".debug_srcinfo"
990 #ifndef DEBUG_MACINFO_SECTION
991 #define DEBUG_MACINFO_SECTION ".debug_macinfo"
993 #ifndef DEBUG_PUBNAMES_SECTION
994 #define DEBUG_PUBNAMES_SECTION ".debug_pubnames"
996 #ifndef DEBUG_ARANGES_SECTION
997 #define DEBUG_ARANGES_SECTION ".debug_aranges"
999 #ifndef TEXT_SECTION_NAME
1000 #define TEXT_SECTION_NAME ".text"
1002 #ifndef DATA_SECTION_NAME
1003 #define DATA_SECTION_NAME ".data"
1005 #ifndef DATA1_SECTION_NAME
1006 #define DATA1_SECTION_NAME ".data1"
1008 #ifndef RODATA_SECTION_NAME
1009 #define RODATA_SECTION_NAME ".rodata"
1011 #ifndef RODATA1_SECTION_NAME
1012 #define RODATA1_SECTION_NAME ".rodata1"
1014 #ifndef BSS_SECTION_NAME
1015 #define BSS_SECTION_NAME ".bss"
1018 /* Definitions of defaults for formats and names of various special
1019 (artificial) labels which may be generated within this file (when
1020 the -g options is used and DWARF_DEBUGGING_INFO is in effect.
1022 If necessary, these may be overridden from within your tm.h file,
1023 but typically, you should never need to override these.
1025 These labels have been hacked (temporarily) so that they all begin with
1026 a `.L' sequence so as to appease the stock sparc/svr4 assembler and the
1027 stock m88k/svr4 assembler, both of which need to see .L at the start of
1028 a label in order to prevent that label from going into the linker symbol
1029 table). When I get time, I'll have to fix this the right way so that we
1030 will use ASM_GENERATE_INTERNAL_LABEL and ASM_OUTPUT_INTERNAL_LABEL herein,
1031 but that will require a rather massive set of changes. For the moment,
1032 the following definitions out to produce the right results for all svr4
1033 and svr3 assemblers. -- rfg
1036 #ifndef TEXT_BEGIN_LABEL
1037 #define TEXT_BEGIN_LABEL "*.L_text_b"
1039 #ifndef TEXT_END_LABEL
1040 #define TEXT_END_LABEL "*.L_text_e"
1043 #ifndef DATA_BEGIN_LABEL
1044 #define DATA_BEGIN_LABEL "*.L_data_b"
1046 #ifndef DATA_END_LABEL
1047 #define DATA_END_LABEL "*.L_data_e"
1050 #ifndef DATA1_BEGIN_LABEL
1051 #define DATA1_BEGIN_LABEL "*.L_data1_b"
1053 #ifndef DATA1_END_LABEL
1054 #define DATA1_END_LABEL "*.L_data1_e"
1057 #ifndef RODATA_BEGIN_LABEL
1058 #define RODATA_BEGIN_LABEL "*.L_rodata_b"
1060 #ifndef RODATA_END_LABEL
1061 #define RODATA_END_LABEL "*.L_rodata_e"
1064 #ifndef RODATA1_BEGIN_LABEL
1065 #define RODATA1_BEGIN_LABEL "*.L_rodata1_b"
1067 #ifndef RODATA1_END_LABEL
1068 #define RODATA1_END_LABEL "*.L_rodata1_e"
1071 #ifndef BSS_BEGIN_LABEL
1072 #define BSS_BEGIN_LABEL "*.L_bss_b"
1074 #ifndef BSS_END_LABEL
1075 #define BSS_END_LABEL "*.L_bss_e"
1078 #ifndef LINE_BEGIN_LABEL
1079 #define LINE_BEGIN_LABEL "*.L_line_b"
1081 #ifndef LINE_LAST_ENTRY_LABEL
1082 #define LINE_LAST_ENTRY_LABEL "*.L_line_last"
1084 #ifndef LINE_END_LABEL
1085 #define LINE_END_LABEL "*.L_line_e"
1088 #ifndef DEBUG_BEGIN_LABEL
1089 #define DEBUG_BEGIN_LABEL "*.L_debug_b"
1091 #ifndef SFNAMES_BEGIN_LABEL
1092 #define SFNAMES_BEGIN_LABEL "*.L_sfnames_b"
1094 #ifndef SRCINFO_BEGIN_LABEL
1095 #define SRCINFO_BEGIN_LABEL "*.L_srcinfo_b"
1097 #ifndef MACINFO_BEGIN_LABEL
1098 #define MACINFO_BEGIN_LABEL "*.L_macinfo_b"
1101 #ifndef DEBUG_ARANGES_BEGIN_LABEL
1102 #define DEBUG_ARANGES_BEGIN_LABEL "*.L_debug_aranges_begin"
1104 #ifndef DEBUG_ARANGES_END_LABEL
1105 #define DEBUG_ARANGES_END_LABEL "*.L_debug_aranges_end"
1108 #ifndef DIE_BEGIN_LABEL_FMT
1109 #define DIE_BEGIN_LABEL_FMT "*.L_D%u"
1111 #ifndef DIE_END_LABEL_FMT
1112 #define DIE_END_LABEL_FMT "*.L_D%u_e"
1114 #ifndef PUB_DIE_LABEL_FMT
1115 #define PUB_DIE_LABEL_FMT "*.L_P%u"
1117 #ifndef BLOCK_BEGIN_LABEL_FMT
1118 #define BLOCK_BEGIN_LABEL_FMT "*.L_B%u"
1120 #ifndef BLOCK_END_LABEL_FMT
1121 #define BLOCK_END_LABEL_FMT "*.L_B%u_e"
1123 #ifndef SS_BEGIN_LABEL_FMT
1124 #define SS_BEGIN_LABEL_FMT "*.L_s%u"
1126 #ifndef SS_END_LABEL_FMT
1127 #define SS_END_LABEL_FMT "*.L_s%u_e"
1129 #ifndef EE_BEGIN_LABEL_FMT
1130 #define EE_BEGIN_LABEL_FMT "*.L_e%u"
1132 #ifndef EE_END_LABEL_FMT
1133 #define EE_END_LABEL_FMT "*.L_e%u_e"
1135 #ifndef MT_BEGIN_LABEL_FMT
1136 #define MT_BEGIN_LABEL_FMT "*.L_t%u"
1138 #ifndef MT_END_LABEL_FMT
1139 #define MT_END_LABEL_FMT "*.L_t%u_e"
1141 #ifndef LOC_BEGIN_LABEL_FMT
1142 #define LOC_BEGIN_LABEL_FMT "*.L_l%u"
1144 #ifndef LOC_END_LABEL_FMT
1145 #define LOC_END_LABEL_FMT "*.L_l%u_e"
1147 #ifndef BOUND_BEGIN_LABEL_FMT
1148 #define BOUND_BEGIN_LABEL_FMT "*.L_b%u_%u_%c"
1150 #ifndef BOUND_END_LABEL_FMT
1151 #define BOUND_END_LABEL_FMT "*.L_b%u_%u_%c_e"
1153 #ifndef DERIV_BEGIN_LABEL_FMT
1154 #define DERIV_BEGIN_LABEL_FMT "*.L_d%u"
1156 #ifndef DERIV_END_LABEL_FMT
1157 #define DERIV_END_LABEL_FMT "*.L_d%u_e"
1159 #ifndef SL_BEGIN_LABEL_FMT
1160 #define SL_BEGIN_LABEL_FMT "*.L_sl%u"
1162 #ifndef SL_END_LABEL_FMT
1163 #define SL_END_LABEL_FMT "*.L_sl%u_e"
1165 #ifndef BODY_BEGIN_LABEL_FMT
1166 #define BODY_BEGIN_LABEL_FMT "*.L_b%u"
1168 #ifndef BODY_END_LABEL_FMT
1169 #define BODY_END_LABEL_FMT "*.L_b%u_e"
1171 #ifndef FUNC_END_LABEL_FMT
1172 #define FUNC_END_LABEL_FMT "*.L_f%u_e"
1174 #ifndef TYPE_NAME_FMT
1175 #define TYPE_NAME_FMT "*.L_T%u"
1177 #ifndef DECL_NAME_FMT
1178 #define DECL_NAME_FMT "*.L_E%u"
1180 #ifndef LINE_CODE_LABEL_FMT
1181 #define LINE_CODE_LABEL_FMT "*.L_LC%u"
1183 #ifndef SFNAMES_ENTRY_LABEL_FMT
1184 #define SFNAMES_ENTRY_LABEL_FMT "*.L_F%u"
1186 #ifndef LINE_ENTRY_LABEL_FMT
1187 #define LINE_ENTRY_LABEL_FMT "*.L_LE%u"
1190 /* Definitions of defaults for various types of primitive assembly language
1193 If necessary, these may be overridden from within your tm.h file,
1194 but typically, you shouldn't need to override these. */
1196 #ifndef ASM_OUTPUT_PUSH_SECTION
1197 #define ASM_OUTPUT_PUSH_SECTION(FILE, SECTION) \
1198 fprintf ((FILE), PUSHSECTION_FORMAT, PUSHSECTION_ASM_OP, SECTION)
1201 #ifndef ASM_OUTPUT_POP_SECTION
1202 #define ASM_OUTPUT_POP_SECTION(FILE) \
1203 fprintf ((FILE), "%s\n", POPSECTION_ASM_OP)
1206 #ifndef ASM_OUTPUT_DWARF_DELTA2
1207 #define ASM_OUTPUT_DWARF_DELTA2(FILE,LABEL1,LABEL2) \
1208 dw2_asm_output_delta (2, LABEL1, LABEL2, NULL)
1211 #ifndef ASM_OUTPUT_DWARF_DELTA4
1212 #define ASM_OUTPUT_DWARF_DELTA4(FILE,LABEL1,LABEL2) \
1213 dw2_asm_output_delta (4, LABEL1, LABEL2, NULL)
1216 #ifndef ASM_OUTPUT_DWARF_TAG
1217 #define ASM_OUTPUT_DWARF_TAG(FILE,TAG) \
1218 dw2_asm_output_data (2, TAG, "%s", dwarf_tag_name (TAG));
1221 #ifndef ASM_OUTPUT_DWARF_ATTRIBUTE
1222 #define ASM_OUTPUT_DWARF_ATTRIBUTE(FILE,ATTR) \
1223 dw2_asm_output_data (2, ATTR, "%s", dwarf_attr_name (ATTR))
1226 #ifndef ASM_OUTPUT_DWARF_STACK_OP
1227 #define ASM_OUTPUT_DWARF_STACK_OP(FILE,OP) \
1228 dw2_asm_output_data (1, OP, "%s", dwarf_stack_op_name (OP))
1231 #ifndef ASM_OUTPUT_DWARF_FUND_TYPE
1232 #define ASM_OUTPUT_DWARF_FUND_TYPE(FILE,FT) \
1233 dw2_asm_output_data (2, FT, "%s", dwarf_fund_type_name (FT))
1236 #ifndef ASM_OUTPUT_DWARF_FMT_BYTE
1237 #define ASM_OUTPUT_DWARF_FMT_BYTE(FILE,FMT) \
1238 dw2_asm_output_data (1, FMT, "%s", dwarf_fmt_byte_name (FMT));
1241 #ifndef ASM_OUTPUT_DWARF_TYPE_MODIFIER
1242 #define ASM_OUTPUT_DWARF_TYPE_MODIFIER(FILE,MOD) \
1243 dw2_asm_output_data (1, MOD, "%s", dwarf_typemod_name (MOD));
1246 #ifndef ASM_OUTPUT_DWARF_ADDR
1247 #define ASM_OUTPUT_DWARF_ADDR(FILE,LABEL) \
1248 dw2_asm_output_addr (4, LABEL, NULL)
1251 #ifndef ASM_OUTPUT_DWARF_ADDR_CONST
1252 #define ASM_OUTPUT_DWARF_ADDR_CONST(FILE,RTX) \
1253 dw2_asm_output_addr_rtx (4, RTX, NULL)
1256 #ifndef ASM_OUTPUT_DWARF_REF
1257 #define ASM_OUTPUT_DWARF_REF(FILE,LABEL) \
1258 dw2_asm_output_addr (4, LABEL, NULL)
1261 #ifndef ASM_OUTPUT_DWARF_DATA1
1262 #define ASM_OUTPUT_DWARF_DATA1(FILE,VALUE) \
1263 dw2_asm_output_data (1, VALUE, NULL)
1266 #ifndef ASM_OUTPUT_DWARF_DATA2
1267 #define ASM_OUTPUT_DWARF_DATA2(FILE,VALUE) \
1268 dw2_asm_output_data (2, VALUE, NULL)
1271 #ifndef ASM_OUTPUT_DWARF_DATA4
1272 #define ASM_OUTPUT_DWARF_DATA4(FILE,VALUE) \
1273 dw2_asm_output_data (4, VALUE, NULL)
1276 #ifndef ASM_OUTPUT_DWARF_DATA8
1277 #define ASM_OUTPUT_DWARF_DATA8(FILE,HIGH_VALUE,LOW_VALUE) \
1278 dw2_asm_output_data (8, VALUE, NULL)
1281 /* ASM_OUTPUT_DWARF_STRING is defined to output an ascii string, but to
1282 NOT issue a trailing newline. We define ASM_OUTPUT_DWARF_STRING_NEWLINE
1283 based on whether ASM_OUTPUT_DWARF_STRING is defined or not. If it is
1284 defined, we call it, then issue the line feed. If not, we supply a
1285 default definition of calling ASM_OUTPUT_ASCII */
1287 #ifndef ASM_OUTPUT_DWARF_STRING
1288 #define ASM_OUTPUT_DWARF_STRING_NEWLINE(FILE,P) \
1289 ASM_OUTPUT_ASCII ((FILE), P, strlen (P)+1)
1291 #define ASM_OUTPUT_DWARF_STRING_NEWLINE(FILE,P) \
1292 ASM_OUTPUT_DWARF_STRING (FILE,P), ASM_OUTPUT_DWARF_STRING (FILE,"\n")
1296 /* The debug hooks structure. */
1297 struct gcc_debug_hooks dwarf_debug_hooks =
1303 dwarfout_start_source_file_check,
1304 dwarfout_end_source_file_check,
1305 dwarfout_begin_block,
1307 debug_true_tree, /* ignore_block */
1308 dwarfout_source_line, /* source_line */
1309 dwarfout_source_line, /* begin_prologue */
1310 dwarfout_end_prologue,
1311 dwarfout_end_epilogue,
1312 debug_nothing_tree, /* begin_function */
1313 dwarfout_end_function,
1314 dwarfout_function_decl,
1315 dwarfout_global_decl,
1316 dwarfout_deferred_inline_function,
1317 debug_nothing_tree, /* outlining_inline_function */
1318 debug_nothing_rtx /* label */
1321 /************************ general utility functions **************************/
1327 return (((GET_CODE (rtl) == REG) && (REGNO (rtl) >= FIRST_PSEUDO_REGISTER))
1328 || ((GET_CODE (rtl) == SUBREG)
1329 && (REGNO (SUBREG_REG (rtl)) >= FIRST_PSEUDO_REGISTER)));
1333 type_main_variant (type)
1336 type = TYPE_MAIN_VARIANT (type);
1338 /* There really should be only one main variant among any group of variants
1339 of a given type (and all of the MAIN_VARIANT values for all members of
1340 the group should point to that one type) but sometimes the C front-end
1341 messes this up for array types, so we work around that bug here. */
1343 if (TREE_CODE (type) == ARRAY_TYPE)
1345 while (type != TYPE_MAIN_VARIANT (type))
1346 type = TYPE_MAIN_VARIANT (type);
1352 /* Return non-zero if the given type node represents a tagged type. */
1355 is_tagged_type (type)
1358 enum tree_code code = TREE_CODE (type);
1360 return (code == RECORD_TYPE || code == UNION_TYPE
1361 || code == QUAL_UNION_TYPE || code == ENUMERAL_TYPE);
1365 dwarf_tag_name (tag)
1370 case TAG_padding: return "TAG_padding";
1371 case TAG_array_type: return "TAG_array_type";
1372 case TAG_class_type: return "TAG_class_type";
1373 case TAG_entry_point: return "TAG_entry_point";
1374 case TAG_enumeration_type: return "TAG_enumeration_type";
1375 case TAG_formal_parameter: return "TAG_formal_parameter";
1376 case TAG_global_subroutine: return "TAG_global_subroutine";
1377 case TAG_global_variable: return "TAG_global_variable";
1378 case TAG_label: return "TAG_label";
1379 case TAG_lexical_block: return "TAG_lexical_block";
1380 case TAG_local_variable: return "TAG_local_variable";
1381 case TAG_member: return "TAG_member";
1382 case TAG_pointer_type: return "TAG_pointer_type";
1383 case TAG_reference_type: return "TAG_reference_type";
1384 case TAG_compile_unit: return "TAG_compile_unit";
1385 case TAG_string_type: return "TAG_string_type";
1386 case TAG_structure_type: return "TAG_structure_type";
1387 case TAG_subroutine: return "TAG_subroutine";
1388 case TAG_subroutine_type: return "TAG_subroutine_type";
1389 case TAG_typedef: return "TAG_typedef";
1390 case TAG_union_type: return "TAG_union_type";
1391 case TAG_unspecified_parameters: return "TAG_unspecified_parameters";
1392 case TAG_variant: return "TAG_variant";
1393 case TAG_common_block: return "TAG_common_block";
1394 case TAG_common_inclusion: return "TAG_common_inclusion";
1395 case TAG_inheritance: return "TAG_inheritance";
1396 case TAG_inlined_subroutine: return "TAG_inlined_subroutine";
1397 case TAG_module: return "TAG_module";
1398 case TAG_ptr_to_member_type: return "TAG_ptr_to_member_type";
1399 case TAG_set_type: return "TAG_set_type";
1400 case TAG_subrange_type: return "TAG_subrange_type";
1401 case TAG_with_stmt: return "TAG_with_stmt";
1403 /* GNU extensions. */
1405 case TAG_format_label: return "TAG_format_label";
1406 case TAG_namelist: return "TAG_namelist";
1407 case TAG_function_template: return "TAG_function_template";
1408 case TAG_class_template: return "TAG_class_template";
1410 default: return "TAG_<unknown>";
1415 dwarf_attr_name (attr)
1420 case AT_sibling: return "AT_sibling";
1421 case AT_location: return "AT_location";
1422 case AT_name: return "AT_name";
1423 case AT_fund_type: return "AT_fund_type";
1424 case AT_mod_fund_type: return "AT_mod_fund_type";
1425 case AT_user_def_type: return "AT_user_def_type";
1426 case AT_mod_u_d_type: return "AT_mod_u_d_type";
1427 case AT_ordering: return "AT_ordering";
1428 case AT_subscr_data: return "AT_subscr_data";
1429 case AT_byte_size: return "AT_byte_size";
1430 case AT_bit_offset: return "AT_bit_offset";
1431 case AT_bit_size: return "AT_bit_size";
1432 case AT_element_list: return "AT_element_list";
1433 case AT_stmt_list: return "AT_stmt_list";
1434 case AT_low_pc: return "AT_low_pc";
1435 case AT_high_pc: return "AT_high_pc";
1436 case AT_language: return "AT_language";
1437 case AT_member: return "AT_member";
1438 case AT_discr: return "AT_discr";
1439 case AT_discr_value: return "AT_discr_value";
1440 case AT_string_length: return "AT_string_length";
1441 case AT_common_reference: return "AT_common_reference";
1442 case AT_comp_dir: return "AT_comp_dir";
1443 case AT_const_value_string: return "AT_const_value_string";
1444 case AT_const_value_data2: return "AT_const_value_data2";
1445 case AT_const_value_data4: return "AT_const_value_data4";
1446 case AT_const_value_data8: return "AT_const_value_data8";
1447 case AT_const_value_block2: return "AT_const_value_block2";
1448 case AT_const_value_block4: return "AT_const_value_block4";
1449 case AT_containing_type: return "AT_containing_type";
1450 case AT_default_value_addr: return "AT_default_value_addr";
1451 case AT_default_value_data2: return "AT_default_value_data2";
1452 case AT_default_value_data4: return "AT_default_value_data4";
1453 case AT_default_value_data8: return "AT_default_value_data8";
1454 case AT_default_value_string: return "AT_default_value_string";
1455 case AT_friends: return "AT_friends";
1456 case AT_inline: return "AT_inline";
1457 case AT_is_optional: return "AT_is_optional";
1458 case AT_lower_bound_ref: return "AT_lower_bound_ref";
1459 case AT_lower_bound_data2: return "AT_lower_bound_data2";
1460 case AT_lower_bound_data4: return "AT_lower_bound_data4";
1461 case AT_lower_bound_data8: return "AT_lower_bound_data8";
1462 case AT_private: return "AT_private";
1463 case AT_producer: return "AT_producer";
1464 case AT_program: return "AT_program";
1465 case AT_protected: return "AT_protected";
1466 case AT_prototyped: return "AT_prototyped";
1467 case AT_public: return "AT_public";
1468 case AT_pure_virtual: return "AT_pure_virtual";
1469 case AT_return_addr: return "AT_return_addr";
1470 case AT_abstract_origin: return "AT_abstract_origin";
1471 case AT_start_scope: return "AT_start_scope";
1472 case AT_stride_size: return "AT_stride_size";
1473 case AT_upper_bound_ref: return "AT_upper_bound_ref";
1474 case AT_upper_bound_data2: return "AT_upper_bound_data2";
1475 case AT_upper_bound_data4: return "AT_upper_bound_data4";
1476 case AT_upper_bound_data8: return "AT_upper_bound_data8";
1477 case AT_virtual: return "AT_virtual";
1479 /* GNU extensions */
1481 case AT_sf_names: return "AT_sf_names";
1482 case AT_src_info: return "AT_src_info";
1483 case AT_mac_info: return "AT_mac_info";
1484 case AT_src_coords: return "AT_src_coords";
1485 case AT_body_begin: return "AT_body_begin";
1486 case AT_body_end: return "AT_body_end";
1488 default: return "AT_<unknown>";
1493 dwarf_stack_op_name (op)
1498 case OP_REG: return "OP_REG";
1499 case OP_BASEREG: return "OP_BASEREG";
1500 case OP_ADDR: return "OP_ADDR";
1501 case OP_CONST: return "OP_CONST";
1502 case OP_DEREF2: return "OP_DEREF2";
1503 case OP_DEREF4: return "OP_DEREF4";
1504 case OP_ADD: return "OP_ADD";
1505 default: return "OP_<unknown>";
1510 dwarf_typemod_name (mod)
1515 case MOD_pointer_to: return "MOD_pointer_to";
1516 case MOD_reference_to: return "MOD_reference_to";
1517 case MOD_const: return "MOD_const";
1518 case MOD_volatile: return "MOD_volatile";
1519 default: return "MOD_<unknown>";
1524 dwarf_fmt_byte_name (fmt)
1529 case FMT_FT_C_C: return "FMT_FT_C_C";
1530 case FMT_FT_C_X: return "FMT_FT_C_X";
1531 case FMT_FT_X_C: return "FMT_FT_X_C";
1532 case FMT_FT_X_X: return "FMT_FT_X_X";
1533 case FMT_UT_C_C: return "FMT_UT_C_C";
1534 case FMT_UT_C_X: return "FMT_UT_C_X";
1535 case FMT_UT_X_C: return "FMT_UT_X_C";
1536 case FMT_UT_X_X: return "FMT_UT_X_X";
1537 case FMT_ET: return "FMT_ET";
1538 default: return "FMT_<unknown>";
1543 dwarf_fund_type_name (ft)
1548 case FT_char: return "FT_char";
1549 case FT_signed_char: return "FT_signed_char";
1550 case FT_unsigned_char: return "FT_unsigned_char";
1551 case FT_short: return "FT_short";
1552 case FT_signed_short: return "FT_signed_short";
1553 case FT_unsigned_short: return "FT_unsigned_short";
1554 case FT_integer: return "FT_integer";
1555 case FT_signed_integer: return "FT_signed_integer";
1556 case FT_unsigned_integer: return "FT_unsigned_integer";
1557 case FT_long: return "FT_long";
1558 case FT_signed_long: return "FT_signed_long";
1559 case FT_unsigned_long: return "FT_unsigned_long";
1560 case FT_pointer: return "FT_pointer";
1561 case FT_float: return "FT_float";
1562 case FT_dbl_prec_float: return "FT_dbl_prec_float";
1563 case FT_ext_prec_float: return "FT_ext_prec_float";
1564 case FT_complex: return "FT_complex";
1565 case FT_dbl_prec_complex: return "FT_dbl_prec_complex";
1566 case FT_void: return "FT_void";
1567 case FT_boolean: return "FT_boolean";
1568 case FT_ext_prec_complex: return "FT_ext_prec_complex";
1569 case FT_label: return "FT_label";
1571 /* GNU extensions. */
1573 case FT_long_long: return "FT_long_long";
1574 case FT_signed_long_long: return "FT_signed_long_long";
1575 case FT_unsigned_long_long: return "FT_unsigned_long_long";
1577 case FT_int8: return "FT_int8";
1578 case FT_signed_int8: return "FT_signed_int8";
1579 case FT_unsigned_int8: return "FT_unsigned_int8";
1580 case FT_int16: return "FT_int16";
1581 case FT_signed_int16: return "FT_signed_int16";
1582 case FT_unsigned_int16: return "FT_unsigned_int16";
1583 case FT_int32: return "FT_int32";
1584 case FT_signed_int32: return "FT_signed_int32";
1585 case FT_unsigned_int32: return "FT_unsigned_int32";
1586 case FT_int64: return "FT_int64";
1587 case FT_signed_int64: return "FT_signed_int64";
1588 case FT_unsigned_int64: return "FT_unsigned_int64";
1589 case FT_int128: return "FT_int128";
1590 case FT_signed_int128: return "FT_signed_int128";
1591 case FT_unsigned_int128: return "FT_unsigned_int128";
1593 case FT_real32: return "FT_real32";
1594 case FT_real64: return "FT_real64";
1595 case FT_real96: return "FT_real96";
1596 case FT_real128: return "FT_real128";
1598 default: return "FT_<unknown>";
1602 /* Determine the "ultimate origin" of a decl. The decl may be an
1603 inlined instance of an inlined instance of a decl which is local
1604 to an inline function, so we have to trace all of the way back
1605 through the origin chain to find out what sort of node actually
1606 served as the original seed for the given block. */
1609 decl_ultimate_origin (decl)
1612 #ifdef ENABLE_CHECKING
1613 if (DECL_FROM_INLINE (DECL_ORIGIN (decl)))
1614 /* Since the DECL_ABSTRACT_ORIGIN for a DECL is supposed to be the
1615 most distant ancestor, this should never happen. */
1619 return DECL_ABSTRACT_ORIGIN (decl);
1622 /* Determine the "ultimate origin" of a block. The block may be an
1623 inlined instance of an inlined instance of a block which is local
1624 to an inline function, so we have to trace all of the way back
1625 through the origin chain to find out what sort of node actually
1626 served as the original seed for the given block. */
1629 block_ultimate_origin (block)
1632 tree immediate_origin = BLOCK_ABSTRACT_ORIGIN (block);
1634 if (immediate_origin == NULL)
1639 tree lookahead = immediate_origin;
1643 ret_val = lookahead;
1644 lookahead = (TREE_CODE (ret_val) == BLOCK)
1645 ? BLOCK_ABSTRACT_ORIGIN (ret_val)
1648 while (lookahead != NULL && lookahead != ret_val);
1653 /* Get the class to which DECL belongs, if any. In g++, the DECL_CONTEXT
1654 of a virtual function may refer to a base class, so we check the 'this'
1658 decl_class_context (decl)
1661 tree context = NULL_TREE;
1662 if (TREE_CODE (decl) != FUNCTION_DECL || ! DECL_VINDEX (decl))
1663 context = DECL_CONTEXT (decl);
1665 context = TYPE_MAIN_VARIANT
1666 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl)))));
1668 if (context && !TYPE_P (context))
1669 context = NULL_TREE;
1676 output_unsigned_leb128 (value)
1677 unsigned long value;
1679 unsigned long orig_value = value;
1683 unsigned byte = (value & 0x7f);
1686 if (value != 0) /* more bytes to follow */
1688 dw2_asm_output_data (1, byte, "\t%s ULEB128 number - value = %lu",
1695 output_signed_leb128 (value)
1698 long orig_value = value;
1699 int negative = (value < 0);
1704 unsigned byte = (value & 0x7f);
1708 value |= 0xfe000000; /* manually sign extend */
1709 if (((value == 0) && ((byte & 0x40) == 0))
1710 || ((value == -1) && ((byte & 0x40) == 1)))
1717 dw2_asm_output_data (1, byte, "\t%s SLEB128 number - value = %ld",
1724 /**************** utility functions for attribute functions ******************/
1726 /* Given a pointer to a tree node for some type, return a Dwarf fundamental
1727 type code for the given type.
1729 This routine must only be called for GCC type nodes that correspond to
1730 Dwarf fundamental types.
1732 The current Dwarf draft specification calls for Dwarf fundamental types
1733 to accurately reflect the fact that a given type was either a "plain"
1734 integral type or an explicitly "signed" integral type. Unfortunately,
1735 we can't always do this, because GCC may already have thrown away the
1736 information about the precise way in which the type was originally
1739 typedef signed int my_type;
1741 struct s { my_type f; };
1743 Since we may be stuck here without enough information to do exactly
1744 what is called for in the Dwarf draft specification, we do the best
1745 that we can under the circumstances and always use the "plain" integral
1746 fundamental type codes for int, short, and long types. That's probably
1747 good enough. The additional accuracy called for in the current DWARF
1748 draft specification is probably never even useful in practice. */
1751 fundamental_type_code (type)
1754 if (TREE_CODE (type) == ERROR_MARK)
1757 switch (TREE_CODE (type))
1766 /* Carefully distinguish all the standard types of C,
1767 without messing up if the language is not C.
1768 Note that we check only for the names that contain spaces;
1769 other names might occur by coincidence in other languages. */
1770 if (TYPE_NAME (type) != 0
1771 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
1772 && DECL_NAME (TYPE_NAME (type)) != 0
1773 && TREE_CODE (DECL_NAME (TYPE_NAME (type))) == IDENTIFIER_NODE)
1775 const char *const name =
1776 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
1778 if (!strcmp (name, "unsigned char"))
1779 return FT_unsigned_char;
1780 if (!strcmp (name, "signed char"))
1781 return FT_signed_char;
1782 if (!strcmp (name, "unsigned int"))
1783 return FT_unsigned_integer;
1784 if (!strcmp (name, "short int"))
1786 if (!strcmp (name, "short unsigned int"))
1787 return FT_unsigned_short;
1788 if (!strcmp (name, "long int"))
1790 if (!strcmp (name, "long unsigned int"))
1791 return FT_unsigned_long;
1792 if (!strcmp (name, "long long int"))
1793 return FT_long_long; /* Not grok'ed by svr4 SDB */
1794 if (!strcmp (name, "long long unsigned int"))
1795 return FT_unsigned_long_long; /* Not grok'ed by svr4 SDB */
1798 /* Most integer types will be sorted out above, however, for the
1799 sake of special `array index' integer types, the following code
1800 is also provided. */
1802 if (TYPE_PRECISION (type) == INT_TYPE_SIZE)
1803 return (TREE_UNSIGNED (type) ? FT_unsigned_integer : FT_integer);
1805 if (TYPE_PRECISION (type) == LONG_TYPE_SIZE)
1806 return (TREE_UNSIGNED (type) ? FT_unsigned_long : FT_long);
1808 if (TYPE_PRECISION (type) == LONG_LONG_TYPE_SIZE)
1809 return (TREE_UNSIGNED (type) ? FT_unsigned_long_long : FT_long_long);
1811 if (TYPE_PRECISION (type) == SHORT_TYPE_SIZE)
1812 return (TREE_UNSIGNED (type) ? FT_unsigned_short : FT_short);
1814 if (TYPE_PRECISION (type) == CHAR_TYPE_SIZE)
1815 return (TREE_UNSIGNED (type) ? FT_unsigned_char : FT_char);
1817 if (TYPE_MODE (type) == TImode)
1818 return (TREE_UNSIGNED (type) ? FT_unsigned_int128 : FT_int128);
1820 /* In C++, __java_boolean is an INTEGER_TYPE with precision == 1 */
1821 if (TYPE_PRECISION (type) == 1)
1827 /* Carefully distinguish all the standard types of C,
1828 without messing up if the language is not C. */
1829 if (TYPE_NAME (type) != 0
1830 && TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
1831 && DECL_NAME (TYPE_NAME (type)) != 0
1832 && TREE_CODE (DECL_NAME (TYPE_NAME (type))) == IDENTIFIER_NODE)
1834 const char *const name =
1835 IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type)));
1837 /* Note that here we can run afoul of a serious bug in "classic"
1838 svr4 SDB debuggers. They don't seem to understand the
1839 FT_ext_prec_float type (even though they should). */
1841 if (!strcmp (name, "long double"))
1842 return FT_ext_prec_float;
1845 if (TYPE_PRECISION (type) == DOUBLE_TYPE_SIZE)
1847 /* On the SH, when compiling with -m3e or -m4-single-only, both
1848 float and double are 32 bits. But since the debugger doesn't
1849 know about the subtarget, it always thinks double is 64 bits.
1850 So we have to tell the debugger that the type is float to
1851 make the output of the 'print' command etc. readable. */
1852 if (DOUBLE_TYPE_SIZE == FLOAT_TYPE_SIZE && FLOAT_TYPE_SIZE == 32)
1854 return FT_dbl_prec_float;
1856 if (TYPE_PRECISION (type) == FLOAT_TYPE_SIZE)
1859 /* Note that here we can run afoul of a serious bug in "classic"
1860 svr4 SDB debuggers. They don't seem to understand the
1861 FT_ext_prec_float type (even though they should). */
1863 if (TYPE_PRECISION (type) == LONG_DOUBLE_TYPE_SIZE)
1864 return FT_ext_prec_float;
1868 return FT_complex; /* GNU FORTRAN COMPLEX type. */
1871 return FT_char; /* GNU Pascal CHAR type. Not used in C. */
1874 return FT_boolean; /* GNU FORTRAN BOOLEAN type. */
1877 abort (); /* No other TREE_CODEs are Dwarf fundamental types. */
1882 /* Given a pointer to an arbitrary ..._TYPE tree node, return a pointer to
1883 the Dwarf "root" type for the given input type. The Dwarf "root" type
1884 of a given type is generally the same as the given type, except that if
1885 the given type is a pointer or reference type, then the root type of
1886 the given type is the root type of the "basis" type for the pointer or
1887 reference type. (This definition of the "root" type is recursive.)
1888 Also, the root type of a `const' qualified type or a `volatile'
1889 qualified type is the root type of the given type without the
1893 root_type_1 (type, count)
1897 /* Give up after searching 1000 levels, in case this is a recursive
1898 pointer type. Such types are possible in Ada, but it is not possible
1899 to represent them in DWARF1 debug info. */
1901 return error_mark_node;
1903 switch (TREE_CODE (type))
1906 return error_mark_node;
1909 case REFERENCE_TYPE:
1910 return root_type_1 (TREE_TYPE (type), count+1);
1921 type = root_type_1 (type, 0);
1922 if (type != error_mark_node)
1923 type = type_main_variant (type);
1927 /* Given a pointer to an arbitrary ..._TYPE tree node, write out a sequence
1928 of zero or more Dwarf "type-modifier" bytes applicable to the type. */
1931 write_modifier_bytes_1 (type, decl_const, decl_volatile, count)
1937 if (TREE_CODE (type) == ERROR_MARK)
1940 /* Give up after searching 1000 levels, in case this is a recursive
1941 pointer type. Such types are possible in Ada, but it is not possible
1942 to represent them in DWARF1 debug info. */
1946 if (TYPE_READONLY (type) || decl_const)
1947 ASM_OUTPUT_DWARF_TYPE_MODIFIER (asm_out_file, MOD_const);
1948 if (TYPE_VOLATILE (type) || decl_volatile)
1949 ASM_OUTPUT_DWARF_TYPE_MODIFIER (asm_out_file, MOD_volatile);
1950 switch (TREE_CODE (type))
1953 ASM_OUTPUT_DWARF_TYPE_MODIFIER (asm_out_file, MOD_pointer_to);
1954 write_modifier_bytes_1 (TREE_TYPE (type), 0, 0, count+1);
1957 case REFERENCE_TYPE:
1958 ASM_OUTPUT_DWARF_TYPE_MODIFIER (asm_out_file, MOD_reference_to);
1959 write_modifier_bytes_1 (TREE_TYPE (type), 0, 0, count+1);
1969 write_modifier_bytes (type, decl_const, decl_volatile)
1974 write_modifier_bytes_1 (type, decl_const, decl_volatile, 0);
1977 /* Given a pointer to an arbitrary ..._TYPE tree node, return non-zero if the
1978 given input type is a Dwarf "fundamental" type. Otherwise return zero. */
1981 type_is_fundamental (type)
1984 switch (TREE_CODE (type))
1999 case QUAL_UNION_TYPE:
2004 case REFERENCE_TYPE:
2017 /* Given a pointer to some ..._DECL tree node, generate an assembly language
2018 equate directive which will associate a symbolic name with the current DIE.
2020 The name used is an artificial label generated from the DECL_UID number
2021 associated with the given decl node. The name it gets equated to is the
2022 symbolic label that we (previously) output at the start of the DIE that
2023 we are currently generating.
2025 Calling this function while generating some "decl related" form of DIE
2026 makes it possible to later refer to the DIE which represents the given
2027 decl simply by re-generating the symbolic name from the ..._DECL node's
2031 equate_decl_number_to_die_number (decl)
2034 /* In the case where we are generating a DIE for some ..._DECL node
2035 which represents either some inline function declaration or some
2036 entity declared within an inline function declaration/definition,
2037 setup a symbolic name for the current DIE so that we have a name
2038 for this DIE that we can easily refer to later on within
2039 AT_abstract_origin attributes. */
2041 char decl_label[MAX_ARTIFICIAL_LABEL_BYTES];
2042 char die_label[MAX_ARTIFICIAL_LABEL_BYTES];
2044 sprintf (decl_label, DECL_NAME_FMT, DECL_UID (decl));
2045 sprintf (die_label, DIE_BEGIN_LABEL_FMT, current_dienum);
2046 ASM_OUTPUT_DEF (asm_out_file, decl_label, die_label);
2049 /* Given a pointer to some ..._TYPE tree node, generate an assembly language
2050 equate directive which will associate a symbolic name with the current DIE.
2052 The name used is an artificial label generated from the TYPE_UID number
2053 associated with the given type node. The name it gets equated to is the
2054 symbolic label that we (previously) output at the start of the DIE that
2055 we are currently generating.
2057 Calling this function while generating some "type related" form of DIE
2058 makes it easy to later refer to the DIE which represents the given type
2059 simply by re-generating the alternative name from the ..._TYPE node's
2063 equate_type_number_to_die_number (type)
2066 char type_label[MAX_ARTIFICIAL_LABEL_BYTES];
2067 char die_label[MAX_ARTIFICIAL_LABEL_BYTES];
2069 /* We are generating a DIE to represent the main variant of this type
2070 (i.e the type without any const or volatile qualifiers) so in order
2071 to get the equate to come out right, we need to get the main variant
2074 type = type_main_variant (type);
2076 sprintf (type_label, TYPE_NAME_FMT, TYPE_UID (type));
2077 sprintf (die_label, DIE_BEGIN_LABEL_FMT, current_dienum);
2078 ASM_OUTPUT_DEF (asm_out_file, type_label, die_label);
2082 output_reg_number (rtl)
2085 unsigned regno = REGNO (rtl);
2087 if (regno >= DWARF_FRAME_REGISTERS)
2089 warning_with_decl (dwarf_last_decl, "internal regno botch: regno = %d\n",
2093 dw2_assemble_integer (4, GEN_INT (DBX_REGISTER_NUMBER (regno)));
2096 fprintf (asm_out_file, "\t%s ", ASM_COMMENT_START);
2097 PRINT_REG (rtl, 0, asm_out_file);
2099 fputc ('\n', asm_out_file);
2102 /* The following routine is a nice and simple transducer. It converts the
2103 RTL for a variable or parameter (resident in memory) into an equivalent
2104 Dwarf representation of a mechanism for getting the address of that same
2105 variable onto the top of a hypothetical "address evaluation" stack.
2107 When creating memory location descriptors, we are effectively trans-
2108 forming the RTL for a memory-resident object into its Dwarf postfix
2109 expression equivalent. This routine just recursively descends an
2110 RTL tree, turning it into Dwarf postfix code as it goes. */
2113 output_mem_loc_descriptor (rtl)
2116 /* Note that for a dynamically sized array, the location we will
2117 generate a description of here will be the lowest numbered location
2118 which is actually within the array. That's *not* necessarily the
2119 same as the zeroth element of the array. */
2121 #ifdef ASM_SIMPLIFY_DWARF_ADDR
2122 rtl = ASM_SIMPLIFY_DWARF_ADDR (rtl);
2125 switch (GET_CODE (rtl))
2129 /* The case of a subreg may arise when we have a local (register)
2130 variable or a formal (register) parameter which doesn't quite
2131 fill up an entire register. For now, just assume that it is
2132 legitimate to make the Dwarf info refer to the whole register
2133 which contains the given subreg. */
2135 rtl = SUBREG_REG (rtl);
2140 /* Whenever a register number forms a part of the description of
2141 the method for calculating the (dynamic) address of a memory
2142 resident object, DWARF rules require the register number to
2143 be referred to as a "base register". This distinction is not
2144 based in any way upon what category of register the hardware
2145 believes the given register belongs to. This is strictly
2146 DWARF terminology we're dealing with here.
2148 Note that in cases where the location of a memory-resident data
2149 object could be expressed as:
2151 OP_ADD (OP_BASEREG (basereg), OP_CONST (0))
2153 the actual DWARF location descriptor that we generate may just
2154 be OP_BASEREG (basereg). This may look deceptively like the
2155 object in question was allocated to a register (rather than
2156 in memory) so DWARF consumers need to be aware of the subtle
2157 distinction between OP_REG and OP_BASEREG. */
2159 ASM_OUTPUT_DWARF_STACK_OP (asm_out_file, OP_BASEREG);
2160 output_reg_number (rtl);
2164 output_mem_loc_descriptor (XEXP (rtl, 0));
2165 ASM_OUTPUT_DWARF_STACK_OP (asm_out_file, OP_DEREF4);
2170 ASM_OUTPUT_DWARF_STACK_OP (asm_out_file, OP_ADDR);
2171 ASM_OUTPUT_DWARF_ADDR_CONST (asm_out_file, rtl);
2175 output_mem_loc_descriptor (XEXP (rtl, 0));
2176 output_mem_loc_descriptor (XEXP (rtl, 1));
2177 ASM_OUTPUT_DWARF_STACK_OP (asm_out_file, OP_ADD);
2181 ASM_OUTPUT_DWARF_STACK_OP (asm_out_file, OP_CONST);
2182 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, INTVAL (rtl));
2186 /* If a pseudo-reg is optimized away, it is possible for it to
2187 be replaced with a MEM containing a multiply. Use a GNU extension
2189 output_mem_loc_descriptor (XEXP (rtl, 0));
2190 output_mem_loc_descriptor (XEXP (rtl, 1));
2191 ASM_OUTPUT_DWARF_STACK_OP (asm_out_file, OP_MULT);
2199 /* Output a proper Dwarf location descriptor for a variable or parameter
2200 which is either allocated in a register or in a memory location. For
2201 a register, we just generate an OP_REG and the register number. For a
2202 memory location we provide a Dwarf postfix expression describing how to
2203 generate the (dynamic) address of the object onto the address stack. */
2206 output_loc_descriptor (rtl)
2209 switch (GET_CODE (rtl))
2213 /* The case of a subreg may arise when we have a local (register)
2214 variable or a formal (register) parameter which doesn't quite
2215 fill up an entire register. For now, just assume that it is
2216 legitimate to make the Dwarf info refer to the whole register
2217 which contains the given subreg. */
2219 rtl = SUBREG_REG (rtl);
2223 ASM_OUTPUT_DWARF_STACK_OP (asm_out_file, OP_REG);
2224 output_reg_number (rtl);
2228 output_mem_loc_descriptor (XEXP (rtl, 0));
2232 abort (); /* Should never happen */
2236 /* Given a tree node describing an array bound (either lower or upper)
2237 output a representation for that bound. */
2240 output_bound_representation (bound, dim_num, u_or_l)
2242 unsigned dim_num; /* For multi-dimensional arrays. */
2243 char u_or_l; /* Designates upper or lower bound. */
2245 switch (TREE_CODE (bound))
2251 /* All fixed-bounds are represented by INTEGER_CST nodes. */
2254 if (host_integerp (bound, 0))
2255 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, tree_low_cst (bound, 0));
2260 /* Dynamic bounds may be represented by NOP_EXPR nodes containing
2261 SAVE_EXPR nodes, in which case we can do something, or as
2262 an expression, which we cannot represent. */
2264 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
2265 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
2267 sprintf (begin_label, BOUND_BEGIN_LABEL_FMT,
2268 current_dienum, dim_num, u_or_l);
2270 sprintf (end_label, BOUND_END_LABEL_FMT,
2271 current_dienum, dim_num, u_or_l);
2273 ASM_OUTPUT_DWARF_DELTA2 (asm_out_file, end_label, begin_label);
2274 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
2276 /* If optimization is turned on, the SAVE_EXPRs that describe
2277 how to access the upper bound values are essentially bogus.
2278 They only describe (at best) how to get at these values at
2279 the points in the generated code right after they have just
2280 been computed. Worse yet, in the typical case, the upper
2281 bound values will not even *be* computed in the optimized
2282 code, so these SAVE_EXPRs are entirely bogus.
2284 In order to compensate for this fact, we check here to see
2285 if optimization is enabled, and if so, we effectively create
2286 an empty location description for the (unknown and unknowable)
2289 This should not cause too much trouble for existing (stupid?)
2290 debuggers because they have to deal with empty upper bounds
2291 location descriptions anyway in order to be able to deal with
2292 incomplete array types.
2294 Of course an intelligent debugger (GDB?) should be able to
2295 comprehend that a missing upper bound specification in a
2296 array type used for a storage class `auto' local array variable
2297 indicates that the upper bound is both unknown (at compile-
2298 time) and unknowable (at run-time) due to optimization. */
2302 while (TREE_CODE (bound) == NOP_EXPR
2303 || TREE_CODE (bound) == CONVERT_EXPR)
2304 bound = TREE_OPERAND (bound, 0);
2306 if (TREE_CODE (bound) == SAVE_EXPR)
2307 output_loc_descriptor
2308 (eliminate_regs (SAVE_EXPR_RTL (bound), 0, NULL_RTX));
2311 ASM_OUTPUT_LABEL (asm_out_file, end_label);
2318 /* Recursive function to output a sequence of value/name pairs for
2319 enumeration constants in reversed order. This is called from
2320 enumeration_type_die. */
2323 output_enumeral_list (link)
2328 output_enumeral_list (TREE_CHAIN (link));
2330 if (host_integerp (TREE_VALUE (link), 0))
2331 ASM_OUTPUT_DWARF_DATA4 (asm_out_file,
2332 tree_low_cst (TREE_VALUE (link), 0));
2334 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file,
2335 IDENTIFIER_POINTER (TREE_PURPOSE (link)));
2339 /* Given an unsigned value, round it up to the lowest multiple of `boundary'
2340 which is not less than the value itself. */
2342 static inline HOST_WIDE_INT
2343 ceiling (value, boundary)
2344 HOST_WIDE_INT value;
2345 unsigned int boundary;
2347 return (((value + boundary - 1) / boundary) * boundary);
2350 /* Given a pointer to what is assumed to be a FIELD_DECL node, return a
2351 pointer to the declared type for the relevant field variable, or return
2352 `integer_type_node' if the given node turns out to be an ERROR_MARK node. */
2360 if (TREE_CODE (decl) == ERROR_MARK)
2361 return integer_type_node;
2363 type = DECL_BIT_FIELD_TYPE (decl);
2365 type = TREE_TYPE (decl);
2369 /* Given a pointer to a tree node, assumed to be some kind of a ..._TYPE
2370 node, return the alignment in bits for the type, or else return
2371 BITS_PER_WORD if the node actually turns out to be an ERROR_MARK node. */
2373 static inline unsigned int
2374 simple_type_align_in_bits (type)
2377 return (TREE_CODE (type) != ERROR_MARK) ? TYPE_ALIGN (type) : BITS_PER_WORD;
2380 /* Given a pointer to a tree node, assumed to be some kind of a ..._TYPE
2381 node, return the size in bits for the type if it is a constant, or
2382 else return the alignment for the type if the type's size is not
2383 constant, or else return BITS_PER_WORD if the type actually turns out
2384 to be an ERROR_MARK node. */
2386 static inline unsigned HOST_WIDE_INT
2387 simple_type_size_in_bits (type)
2390 tree type_size_tree;
2392 if (TREE_CODE (type) == ERROR_MARK)
2393 return BITS_PER_WORD;
2394 type_size_tree = TYPE_SIZE (type);
2396 if (type_size_tree == NULL_TREE)
2398 if (! host_integerp (type_size_tree, 1))
2399 return TYPE_ALIGN (type);
2400 return tree_low_cst (type_size_tree, 1);
2403 /* Given a pointer to what is assumed to be a FIELD_DECL node, compute and
2404 return the byte offset of the lowest addressed byte of the "containing
2405 object" for the given FIELD_DECL, or return 0 if we are unable to deter-
2406 mine what that offset is, either because the argument turns out to be a
2407 pointer to an ERROR_MARK node, or because the offset is actually variable.
2408 (We can't handle the latter case just yet.) */
2410 static HOST_WIDE_INT
2411 field_byte_offset (decl)
2414 unsigned int type_align_in_bytes;
2415 unsigned int type_align_in_bits;
2416 unsigned HOST_WIDE_INT type_size_in_bits;
2417 HOST_WIDE_INT object_offset_in_align_units;
2418 HOST_WIDE_INT object_offset_in_bits;
2419 HOST_WIDE_INT object_offset_in_bytes;
2421 tree field_size_tree;
2422 HOST_WIDE_INT bitpos_int;
2423 HOST_WIDE_INT deepest_bitpos;
2424 unsigned HOST_WIDE_INT field_size_in_bits;
2426 if (TREE_CODE (decl) == ERROR_MARK)
2429 if (TREE_CODE (decl) != FIELD_DECL)
2432 type = field_type (decl);
2433 field_size_tree = DECL_SIZE (decl);
2435 /* The size could be unspecified if there was an error, or for
2436 a flexible array member. */
2437 if (! field_size_tree)
2438 field_size_tree = bitsize_zero_node;
2440 /* We cannot yet cope with fields whose positions or sizes are variable,
2441 so for now, when we see such things, we simply return 0. Someday,
2442 we may be able to handle such cases, but it will be damn difficult. */
2444 if (! host_integerp (bit_position (decl), 0)
2445 || ! host_integerp (field_size_tree, 1))
2448 bitpos_int = int_bit_position (decl);
2449 field_size_in_bits = tree_low_cst (field_size_tree, 1);
2451 type_size_in_bits = simple_type_size_in_bits (type);
2452 type_align_in_bits = simple_type_align_in_bits (type);
2453 type_align_in_bytes = type_align_in_bits / BITS_PER_UNIT;
2455 /* Note that the GCC front-end doesn't make any attempt to keep track
2456 of the starting bit offset (relative to the start of the containing
2457 structure type) of the hypothetical "containing object" for a bit-
2458 field. Thus, when computing the byte offset value for the start of
2459 the "containing object" of a bit-field, we must deduce this infor-
2462 This can be rather tricky to do in some cases. For example, handling
2463 the following structure type definition when compiling for an i386/i486
2464 target (which only aligns long long's to 32-bit boundaries) can be very
2469 long long field2:31;
2472 Fortunately, there is a simple rule-of-thumb which can be used in such
2473 cases. When compiling for an i386/i486, GCC will allocate 8 bytes for
2474 the structure shown above. It decides to do this based upon one simple
2475 rule for bit-field allocation. Quite simply, GCC allocates each "con-
2476 taining object" for each bit-field at the first (i.e. lowest addressed)
2477 legitimate alignment boundary (based upon the required minimum alignment
2478 for the declared type of the field) which it can possibly use, subject
2479 to the condition that there is still enough available space remaining
2480 in the containing object (when allocated at the selected point) to
2481 fully accommodate all of the bits of the bit-field itself.
2483 This simple rule makes it obvious why GCC allocates 8 bytes for each
2484 object of the structure type shown above. When looking for a place to
2485 allocate the "containing object" for `field2', the compiler simply tries
2486 to allocate a 64-bit "containing object" at each successive 32-bit
2487 boundary (starting at zero) until it finds a place to allocate that 64-
2488 bit field such that at least 31 contiguous (and previously unallocated)
2489 bits remain within that selected 64 bit field. (As it turns out, for
2490 the example above, the compiler finds that it is OK to allocate the
2491 "containing object" 64-bit field at bit-offset zero within the
2494 Here we attempt to work backwards from the limited set of facts we're
2495 given, and we try to deduce from those facts, where GCC must have
2496 believed that the containing object started (within the structure type).
2498 The value we deduce is then used (by the callers of this routine) to
2499 generate AT_location and AT_bit_offset attributes for fields (both
2500 bit-fields and, in the case of AT_location, regular fields as well). */
2502 /* Figure out the bit-distance from the start of the structure to the
2503 "deepest" bit of the bit-field. */
2504 deepest_bitpos = bitpos_int + field_size_in_bits;
2506 /* This is the tricky part. Use some fancy footwork to deduce where the
2507 lowest addressed bit of the containing object must be. */
2508 object_offset_in_bits
2509 = ceiling (deepest_bitpos, type_align_in_bits) - type_size_in_bits;
2511 /* Compute the offset of the containing object in "alignment units". */
2512 object_offset_in_align_units = object_offset_in_bits / type_align_in_bits;
2514 /* Compute the offset of the containing object in bytes. */
2515 object_offset_in_bytes = object_offset_in_align_units * type_align_in_bytes;
2517 /* The above code assumes that the field does not cross an alignment
2518 boundary. This can happen if PCC_BITFIELD_TYPE_MATTERS is not defined,
2519 or if the structure is packed. If this happens, then we get an object
2520 which starts after the bitfield, which means that the bit offset is
2521 negative. Gdb fails when given negative bit offsets. We avoid this
2522 by recomputing using the first bit of the bitfield. This will give
2523 us an object which does not completely contain the bitfield, but it
2524 will be aligned, and it will contain the first bit of the bitfield.
2526 However, only do this for a BYTES_BIG_ENDIAN target. For a
2527 ! BYTES_BIG_ENDIAN target, bitpos_int + field_size_in_bits is the first
2528 first bit of the bitfield. If we recompute using bitpos_int + 1 below,
2529 then we end up computing the object byte offset for the wrong word of the
2530 desired bitfield, which in turn causes the field offset to be negative
2531 in bit_offset_attribute. */
2532 if (BYTES_BIG_ENDIAN
2533 && object_offset_in_bits > bitpos_int)
2535 deepest_bitpos = bitpos_int + 1;
2536 object_offset_in_bits
2537 = ceiling (deepest_bitpos, type_align_in_bits) - type_size_in_bits;
2538 object_offset_in_align_units = (object_offset_in_bits
2539 / type_align_in_bits);
2540 object_offset_in_bytes = (object_offset_in_align_units
2541 * type_align_in_bytes);
2544 return object_offset_in_bytes;
2547 /****************************** attributes *********************************/
2549 /* The following routines are responsible for writing out the various types
2550 of Dwarf attributes (and any following data bytes associated with them).
2551 These routines are listed in order based on the numerical codes of their
2552 associated attributes. */
2554 /* Generate an AT_sibling attribute. */
2557 sibling_attribute ()
2559 char label[MAX_ARTIFICIAL_LABEL_BYTES];
2561 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_sibling);
2562 sprintf (label, DIE_BEGIN_LABEL_FMT, NEXT_DIE_NUM);
2563 ASM_OUTPUT_DWARF_REF (asm_out_file, label);
2566 /* Output the form of location attributes suitable for whole variables and
2567 whole parameters. Note that the location attributes for struct fields
2568 are generated by the routine `data_member_location_attribute' below. */
2571 location_attribute (rtl)
2574 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
2575 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
2577 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_location);
2578 sprintf (begin_label, LOC_BEGIN_LABEL_FMT, current_dienum);
2579 sprintf (end_label, LOC_END_LABEL_FMT, current_dienum);
2580 ASM_OUTPUT_DWARF_DELTA2 (asm_out_file, end_label, begin_label);
2581 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
2583 /* Handle a special case. If we are about to output a location descriptor
2584 for a variable or parameter which has been optimized out of existence,
2585 don't do that. Instead we output a zero-length location descriptor
2586 value as part of the location attribute.
2588 A variable which has been optimized out of existence will have a
2589 DECL_RTL value which denotes a pseudo-reg.
2591 Currently, in some rare cases, variables can have DECL_RTL values
2592 which look like (MEM (REG pseudo-reg#)). These cases are due to
2593 bugs elsewhere in the compiler. We treat such cases
2594 as if the variable(s) in question had been optimized out of existence.
2596 Note that in all cases where we wish to express the fact that a
2597 variable has been optimized out of existence, we do not simply
2598 suppress the generation of the entire location attribute because
2599 the absence of a location attribute in certain kinds of DIEs is
2600 used to indicate something else entirely... i.e. that the DIE
2601 represents an object declaration, but not a definition. So saith
2605 if (! is_pseudo_reg (rtl)
2606 && (GET_CODE (rtl) != MEM || ! is_pseudo_reg (XEXP (rtl, 0))))
2607 output_loc_descriptor (rtl);
2609 ASM_OUTPUT_LABEL (asm_out_file, end_label);
2612 /* Output the specialized form of location attribute used for data members
2613 of struct and union types.
2615 In the special case of a FIELD_DECL node which represents a bit-field,
2616 the "offset" part of this special location descriptor must indicate the
2617 distance in bytes from the lowest-addressed byte of the containing
2618 struct or union type to the lowest-addressed byte of the "containing
2619 object" for the bit-field. (See the `field_byte_offset' function above.)
2621 For any given bit-field, the "containing object" is a hypothetical
2622 object (of some integral or enum type) within which the given bit-field
2623 lives. The type of this hypothetical "containing object" is always the
2624 same as the declared type of the individual bit-field itself (for GCC
2625 anyway... the DWARF spec doesn't actually mandate this).
2627 Note that it is the size (in bytes) of the hypothetical "containing
2628 object" which will be given in the AT_byte_size attribute for this
2629 bit-field. (See the `byte_size_attribute' function below.) It is
2630 also used when calculating the value of the AT_bit_offset attribute.
2631 (See the `bit_offset_attribute' function below.) */
2634 data_member_location_attribute (t)
2637 unsigned object_offset_in_bytes;
2638 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
2639 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
2641 if (TREE_CODE (t) == TREE_VEC)
2642 object_offset_in_bytes = tree_low_cst (BINFO_OFFSET (t), 0);
2644 object_offset_in_bytes = field_byte_offset (t);
2646 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_location);
2647 sprintf (begin_label, LOC_BEGIN_LABEL_FMT, current_dienum);
2648 sprintf (end_label, LOC_END_LABEL_FMT, current_dienum);
2649 ASM_OUTPUT_DWARF_DELTA2 (asm_out_file, end_label, begin_label);
2650 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
2651 ASM_OUTPUT_DWARF_STACK_OP (asm_out_file, OP_CONST);
2652 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, object_offset_in_bytes);
2653 ASM_OUTPUT_DWARF_STACK_OP (asm_out_file, OP_ADD);
2654 ASM_OUTPUT_LABEL (asm_out_file, end_label);
2657 /* Output an AT_const_value attribute for a variable or a parameter which
2658 does not have a "location" either in memory or in a register. These
2659 things can arise in GNU C when a constant is passed as an actual
2660 parameter to an inlined function. They can also arise in C++ where
2661 declared constants do not necessarily get memory "homes". */
2664 const_value_attribute (rtl)
2667 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
2668 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
2670 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_const_value_block4);
2671 sprintf (begin_label, LOC_BEGIN_LABEL_FMT, current_dienum);
2672 sprintf (end_label, LOC_END_LABEL_FMT, current_dienum);
2673 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, end_label, begin_label);
2674 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
2676 switch (GET_CODE (rtl))
2679 /* Note that a CONST_INT rtx could represent either an integer or
2680 a floating-point constant. A CONST_INT is used whenever the
2681 constant will fit into a single word. In all such cases, the
2682 original mode of the constant value is wiped out, and the
2683 CONST_INT rtx is assigned VOIDmode. Since we no longer have
2684 precise mode information for these constants, we always just
2685 output them using 4 bytes. */
2687 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, (unsigned) INTVAL (rtl));
2691 /* Note that a CONST_DOUBLE rtx could represent either an integer
2692 or a floating-point constant. A CONST_DOUBLE is used whenever
2693 the constant requires more than one word in order to be adequately
2694 represented. In all such cases, the original mode of the constant
2695 value is preserved as the mode of the CONST_DOUBLE rtx, but for
2696 simplicity we always just output CONST_DOUBLEs using 8 bytes. */
2698 ASM_OUTPUT_DWARF_DATA8 (asm_out_file,
2699 (unsigned int) CONST_DOUBLE_HIGH (rtl),
2700 (unsigned int) CONST_DOUBLE_LOW (rtl));
2704 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, XSTR (rtl, 0));
2710 ASM_OUTPUT_DWARF_ADDR_CONST (asm_out_file, rtl);
2714 /* In cases where an inlined instance of an inline function is passed
2715 the address of an `auto' variable (which is local to the caller)
2716 we can get a situation where the DECL_RTL of the artificial
2717 local variable (for the inlining) which acts as a stand-in for
2718 the corresponding formal parameter (of the inline function)
2719 will look like (plus:SI (reg:SI FRAME_PTR) (const_int ...)).
2720 This is not exactly a compile-time constant expression, but it
2721 isn't the address of the (artificial) local variable either.
2722 Rather, it represents the *value* which the artificial local
2723 variable always has during its lifetime. We currently have no
2724 way to represent such quasi-constant values in Dwarf, so for now
2725 we just punt and generate an AT_const_value attribute with form
2726 FORM_BLOCK4 and a length of zero. */
2730 abort (); /* No other kinds of rtx should be possible here. */
2733 ASM_OUTPUT_LABEL (asm_out_file, end_label);
2736 /* Generate *either* an AT_location attribute or else an AT_const_value
2737 data attribute for a variable or a parameter. We generate the
2738 AT_const_value attribute only in those cases where the given
2739 variable or parameter does not have a true "location" either in
2740 memory or in a register. This can happen (for example) when a
2741 constant is passed as an actual argument in a call to an inline
2742 function. (It's possible that these things can crop up in other
2743 ways also.) Note that one type of constant value which can be
2744 passed into an inlined function is a constant pointer. This can
2745 happen for example if an actual argument in an inlined function
2746 call evaluates to a compile-time constant address. */
2749 location_or_const_value_attribute (decl)
2754 if (TREE_CODE (decl) == ERROR_MARK)
2757 if ((TREE_CODE (decl) != VAR_DECL) && (TREE_CODE (decl) != PARM_DECL))
2759 /* Should never happen. */
2764 /* Here we have to decide where we are going to say the parameter "lives"
2765 (as far as the debugger is concerned). We only have a couple of choices.
2766 GCC provides us with DECL_RTL and with DECL_INCOMING_RTL. DECL_RTL
2767 normally indicates where the parameter lives during most of the activa-
2768 tion of the function. If optimization is enabled however, this could
2769 be either NULL or else a pseudo-reg. Both of those cases indicate that
2770 the parameter doesn't really live anywhere (as far as the code generation
2771 parts of GCC are concerned) during most of the function's activation.
2772 That will happen (for example) if the parameter is never referenced
2773 within the function.
2775 We could just generate a location descriptor here for all non-NULL
2776 non-pseudo values of DECL_RTL and ignore all of the rest, but we can
2777 be a little nicer than that if we also consider DECL_INCOMING_RTL in
2778 cases where DECL_RTL is NULL or is a pseudo-reg.
2780 Note however that we can only get away with using DECL_INCOMING_RTL as
2781 a backup substitute for DECL_RTL in certain limited cases. In cases
2782 where DECL_ARG_TYPE(decl) indicates the same type as TREE_TYPE(decl)
2783 we can be sure that the parameter was passed using the same type as it
2784 is declared to have within the function, and that its DECL_INCOMING_RTL
2785 points us to a place where a value of that type is passed. In cases
2786 where DECL_ARG_TYPE(decl) and TREE_TYPE(decl) are different types
2787 however, we cannot (in general) use DECL_INCOMING_RTL as a backup
2788 substitute for DECL_RTL because in these cases, DECL_INCOMING_RTL
2789 points us to a value of some type which is *different* from the type
2790 of the parameter itself. Thus, if we tried to use DECL_INCOMING_RTL
2791 to generate a location attribute in such cases, the debugger would
2792 end up (for example) trying to fetch a `float' from a place which
2793 actually contains the first part of a `double'. That would lead to
2794 really incorrect and confusing output at debug-time, and we don't
2795 want that now do we?
2797 So in general, we DO NOT use DECL_INCOMING_RTL as a backup for DECL_RTL
2798 in cases where DECL_ARG_TYPE(decl) != TREE_TYPE(decl). There are a
2799 couple of cute exceptions however. On little-endian machines we can
2800 get away with using DECL_INCOMING_RTL even when DECL_ARG_TYPE(decl) is
2801 not the same as TREE_TYPE(decl) but only when DECL_ARG_TYPE(decl) is
2802 an integral type which is smaller than TREE_TYPE(decl). These cases
2803 arise when (on a little-endian machine) a non-prototyped function has
2804 a parameter declared to be of type `short' or `char'. In such cases,
2805 TREE_TYPE(decl) will be `short' or `char', DECL_ARG_TYPE(decl) will be
2806 `int', and DECL_INCOMING_RTL will point to the lowest-order byte of the
2807 passed `int' value. If the debugger then uses that address to fetch a
2808 `short' or a `char' (on a little-endian machine) the result will be the
2809 correct data, so we allow for such exceptional cases below.
2811 Note that our goal here is to describe the place where the given formal
2812 parameter lives during most of the function's activation (i.e. between
2813 the end of the prologue and the start of the epilogue). We'll do that
2814 as best as we can. Note however that if the given formal parameter is
2815 modified sometime during the execution of the function, then a stack
2816 backtrace (at debug-time) will show the function as having been called
2817 with the *new* value rather than the value which was originally passed
2818 in. This happens rarely enough that it is not a major problem, but it
2819 *is* a problem, and I'd like to fix it. A future version of dwarfout.c
2820 may generate two additional attributes for any given TAG_formal_parameter
2821 DIE which will describe the "passed type" and the "passed location" for
2822 the given formal parameter in addition to the attributes we now generate
2823 to indicate the "declared type" and the "active location" for each
2824 parameter. This additional set of attributes could be used by debuggers
2825 for stack backtraces.
2827 Separately, note that sometimes DECL_RTL can be NULL and DECL_INCOMING_RTL
2828 can be NULL also. This happens (for example) for inlined-instances of
2829 inline function formal parameters which are never referenced. This really
2830 shouldn't be happening. All PARM_DECL nodes should get valid non-NULL
2831 DECL_INCOMING_RTL values, but integrate.c doesn't currently generate
2832 these values for inlined instances of inline function parameters, so
2833 when we see such cases, we are just out-of-luck for the time
2834 being (until integrate.c gets fixed).
2837 /* Use DECL_RTL as the "location" unless we find something better. */
2838 rtl = DECL_RTL (decl);
2840 if (TREE_CODE (decl) == PARM_DECL)
2841 if (rtl == NULL_RTX || is_pseudo_reg (rtl))
2843 /* This decl represents a formal parameter which was optimized out. */
2844 tree declared_type = type_main_variant (TREE_TYPE (decl));
2845 tree passed_type = type_main_variant (DECL_ARG_TYPE (decl));
2847 /* Note that DECL_INCOMING_RTL may be NULL in here, but we handle
2848 *all* cases where (rtl == NULL_RTX) just below. */
2850 if (declared_type == passed_type)
2851 rtl = DECL_INCOMING_RTL (decl);
2852 else if (! BYTES_BIG_ENDIAN)
2853 if (TREE_CODE (declared_type) == INTEGER_TYPE)
2855 if (TYPE_SIZE (declared_type) <= TYPE_SIZE (passed_type))
2856 rtl = DECL_INCOMING_RTL (decl);
2859 if (rtl == NULL_RTX)
2862 rtl = eliminate_regs (rtl, 0, NULL_RTX);
2863 #ifdef LEAF_REG_REMAP
2864 if (current_function_uses_only_leaf_regs)
2865 leaf_renumber_regs_insn (rtl);
2868 switch (GET_CODE (rtl))
2871 /* The address of a variable that was optimized away; don't emit
2881 case PLUS: /* DECL_RTL could be (plus (reg ...) (const_int ...)) */
2882 const_value_attribute (rtl);
2888 location_attribute (rtl);
2892 /* ??? CONCAT is used for complex variables, which may have the real
2893 part stored in one place and the imag part stored somewhere else.
2894 DWARF1 has no way to describe a variable that lives in two different
2895 places, so we just describe where the first part lives, and hope that
2896 the second part is stored after it. */
2897 location_attribute (XEXP (rtl, 0));
2901 abort (); /* Should never happen. */
2905 /* Generate an AT_name attribute given some string value to be included as
2906 the value of the attribute. */
2909 name_attribute (name_string)
2910 const char *name_string;
2912 if (name_string && *name_string)
2914 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_name);
2915 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, name_string);
2920 fund_type_attribute (ft_code)
2923 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_fund_type);
2924 ASM_OUTPUT_DWARF_FUND_TYPE (asm_out_file, ft_code);
2928 mod_fund_type_attribute (type, decl_const, decl_volatile)
2933 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
2934 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
2936 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_mod_fund_type);
2937 sprintf (begin_label, MT_BEGIN_LABEL_FMT, current_dienum);
2938 sprintf (end_label, MT_END_LABEL_FMT, current_dienum);
2939 ASM_OUTPUT_DWARF_DELTA2 (asm_out_file, end_label, begin_label);
2940 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
2941 write_modifier_bytes (type, decl_const, decl_volatile);
2942 ASM_OUTPUT_DWARF_FUND_TYPE (asm_out_file,
2943 fundamental_type_code (root_type (type)));
2944 ASM_OUTPUT_LABEL (asm_out_file, end_label);
2948 user_def_type_attribute (type)
2951 char ud_type_name[MAX_ARTIFICIAL_LABEL_BYTES];
2953 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_user_def_type);
2954 sprintf (ud_type_name, TYPE_NAME_FMT, TYPE_UID (type));
2955 ASM_OUTPUT_DWARF_REF (asm_out_file, ud_type_name);
2959 mod_u_d_type_attribute (type, decl_const, decl_volatile)
2964 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
2965 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
2966 char ud_type_name[MAX_ARTIFICIAL_LABEL_BYTES];
2968 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_mod_u_d_type);
2969 sprintf (begin_label, MT_BEGIN_LABEL_FMT, current_dienum);
2970 sprintf (end_label, MT_END_LABEL_FMT, current_dienum);
2971 ASM_OUTPUT_DWARF_DELTA2 (asm_out_file, end_label, begin_label);
2972 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
2973 write_modifier_bytes (type, decl_const, decl_volatile);
2974 sprintf (ud_type_name, TYPE_NAME_FMT, TYPE_UID (root_type (type)));
2975 ASM_OUTPUT_DWARF_REF (asm_out_file, ud_type_name);
2976 ASM_OUTPUT_LABEL (asm_out_file, end_label);
2979 #ifdef USE_ORDERING_ATTRIBUTE
2981 ordering_attribute (ordering)
2984 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_ordering);
2985 ASM_OUTPUT_DWARF_DATA2 (asm_out_file, ordering);
2987 #endif /* defined(USE_ORDERING_ATTRIBUTE) */
2989 /* Note that the block of subscript information for an array type also
2990 includes information about the element type of type given array type. */
2993 subscript_data_attribute (type)
2996 unsigned dimension_number;
2997 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
2998 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
3000 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_subscr_data);
3001 sprintf (begin_label, SS_BEGIN_LABEL_FMT, current_dienum);
3002 sprintf (end_label, SS_END_LABEL_FMT, current_dienum);
3003 ASM_OUTPUT_DWARF_DELTA2 (asm_out_file, end_label, begin_label);
3004 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
3006 /* The GNU compilers represent multidimensional array types as sequences
3007 of one dimensional array types whose element types are themselves array
3008 types. Here we squish that down, so that each multidimensional array
3009 type gets only one array_type DIE in the Dwarf debugging info. The
3010 draft Dwarf specification say that we are allowed to do this kind
3011 of compression in C (because there is no difference between an
3012 array or arrays and a multidimensional array in C) but for other
3013 source languages (e.g. Ada) we probably shouldn't do this. */
3015 for (dimension_number = 0;
3016 TREE_CODE (type) == ARRAY_TYPE;
3017 type = TREE_TYPE (type), dimension_number++)
3019 tree domain = TYPE_DOMAIN (type);
3021 /* Arrays come in three flavors. Unspecified bounds, fixed
3022 bounds, and (in GNU C only) variable bounds. Handle all
3023 three forms here. */
3027 /* We have an array type with specified bounds. */
3029 tree lower = TYPE_MIN_VALUE (domain);
3030 tree upper = TYPE_MAX_VALUE (domain);
3032 /* Handle only fundamental types as index types for now. */
3033 if (! type_is_fundamental (domain))
3036 /* Output the representation format byte for this dimension. */
3037 ASM_OUTPUT_DWARF_FMT_BYTE (asm_out_file,
3038 FMT_CODE (1, TREE_CODE (lower) == INTEGER_CST,
3039 upper && TREE_CODE (upper) == INTEGER_CST));
3041 /* Output the index type for this dimension. */
3042 ASM_OUTPUT_DWARF_FUND_TYPE (asm_out_file,
3043 fundamental_type_code (domain));
3045 /* Output the representation for the lower bound. */
3046 output_bound_representation (lower, dimension_number, 'l');
3048 /* Output the representation for the upper bound. */
3050 output_bound_representation (upper, dimension_number, 'u');
3052 ASM_OUTPUT_DWARF_DATA2 (asm_out_file, 0);
3056 /* We have an array type with an unspecified length. For C and
3057 C++ we can assume that this really means that (a) the index
3058 type is an integral type, and (b) the lower bound is zero.
3059 Note that Dwarf defines the representation of an unspecified
3060 (upper) bound as being a zero-length location description. */
3062 /* Output the array-bounds format byte. */
3064 ASM_OUTPUT_DWARF_FMT_BYTE (asm_out_file, FMT_FT_C_X);
3066 /* Output the (assumed) index type. */
3068 ASM_OUTPUT_DWARF_FUND_TYPE (asm_out_file, FT_integer);
3070 /* Output the (assumed) lower bound (constant) value. */
3072 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, 0);
3074 /* Output the (empty) location description for the upper bound. */
3076 ASM_OUTPUT_DWARF_DATA2 (asm_out_file, 0);
3080 /* Output the prefix byte that says that the element type is coming up. */
3082 ASM_OUTPUT_DWARF_FMT_BYTE (asm_out_file, FMT_ET);
3084 /* Output a representation of the type of the elements of this array type. */
3086 type_attribute (type, 0, 0);
3088 ASM_OUTPUT_LABEL (asm_out_file, end_label);
3092 byte_size_attribute (tree_node)
3097 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_byte_size);
3098 switch (TREE_CODE (tree_node))
3107 case QUAL_UNION_TYPE:
3109 size = int_size_in_bytes (tree_node);
3113 /* For a data member of a struct or union, the AT_byte_size is
3114 generally given as the number of bytes normally allocated for
3115 an object of the *declared* type of the member itself. This
3116 is true even for bit-fields. */
3117 size = simple_type_size_in_bits (field_type (tree_node))
3125 /* Note that `size' might be -1 when we get to this point. If it
3126 is, that indicates that the byte size of the entity in question
3127 is variable. We have no good way of expressing this fact in Dwarf
3128 at the present time, so just let the -1 pass on through. */
3130 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, size);
3133 /* For a FIELD_DECL node which represents a bit-field, output an attribute
3134 which specifies the distance in bits from the highest order bit of the
3135 "containing object" for the bit-field to the highest order bit of the
3138 For any given bit-field, the "containing object" is a hypothetical
3139 object (of some integral or enum type) within which the given bit-field
3140 lives. The type of this hypothetical "containing object" is always the
3141 same as the declared type of the individual bit-field itself.
3143 The determination of the exact location of the "containing object" for
3144 a bit-field is rather complicated. It's handled by the `field_byte_offset'
3147 Note that it is the size (in bytes) of the hypothetical "containing
3148 object" which will be given in the AT_byte_size attribute for this
3149 bit-field. (See `byte_size_attribute' above.) */
3152 bit_offset_attribute (decl)
3155 HOST_WIDE_INT object_offset_in_bytes = field_byte_offset (decl);
3156 tree type = DECL_BIT_FIELD_TYPE (decl);
3157 HOST_WIDE_INT bitpos_int;
3158 HOST_WIDE_INT highest_order_object_bit_offset;
3159 HOST_WIDE_INT highest_order_field_bit_offset;
3160 HOST_WIDE_INT bit_offset;
3162 /* Must be a bit field. */
3164 || TREE_CODE (decl) != FIELD_DECL)
3167 /* We can't yet handle bit-fields whose offsets or sizes are variable, so
3168 if we encounter such things, just return without generating any
3169 attribute whatsoever. */
3171 if (! host_integerp (bit_position (decl), 0)
3172 || ! host_integerp (DECL_SIZE (decl), 1))
3175 bitpos_int = int_bit_position (decl);
3177 /* Note that the bit offset is always the distance (in bits) from the
3178 highest-order bit of the "containing object" to the highest-order
3179 bit of the bit-field itself. Since the "high-order end" of any
3180 object or field is different on big-endian and little-endian machines,
3181 the computation below must take account of these differences. */
3183 highest_order_object_bit_offset = object_offset_in_bytes * BITS_PER_UNIT;
3184 highest_order_field_bit_offset = bitpos_int;
3186 if (! BYTES_BIG_ENDIAN)
3188 highest_order_field_bit_offset += tree_low_cst (DECL_SIZE (decl), 1);
3189 highest_order_object_bit_offset += simple_type_size_in_bits (type);
3194 ? highest_order_object_bit_offset - highest_order_field_bit_offset
3195 : highest_order_field_bit_offset - highest_order_object_bit_offset);
3197 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_bit_offset);
3198 ASM_OUTPUT_DWARF_DATA2 (asm_out_file, bit_offset);
3201 /* For a FIELD_DECL node which represents a bit field, output an attribute
3202 which specifies the length in bits of the given field. */
3205 bit_size_attribute (decl)
3208 /* Must be a field and a bit field. */
3209 if (TREE_CODE (decl) != FIELD_DECL
3210 || ! DECL_BIT_FIELD_TYPE (decl))
3213 if (host_integerp (DECL_SIZE (decl), 1))
3215 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_bit_size);
3216 ASM_OUTPUT_DWARF_DATA4 (asm_out_file,
3217 tree_low_cst (DECL_SIZE (decl), 1));
3221 /* The following routine outputs the `element_list' attribute for enumeration
3222 type DIEs. The element_lits attribute includes the names and values of
3223 all of the enumeration constants associated with the given enumeration
3227 element_list_attribute (element)
3230 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
3231 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
3233 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_element_list);
3234 sprintf (begin_label, EE_BEGIN_LABEL_FMT, current_dienum);
3235 sprintf (end_label, EE_END_LABEL_FMT, current_dienum);
3236 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, end_label, begin_label);
3237 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
3239 /* Here we output a list of value/name pairs for each enumeration constant
3240 defined for this enumeration type (as required), but we do it in REVERSE
3241 order. The order is the one required by the draft #5 Dwarf specification
3242 published by the UI/PLSIG. */
3244 output_enumeral_list (element); /* Recursively output the whole list. */
3246 ASM_OUTPUT_LABEL (asm_out_file, end_label);
3249 /* Generate an AT_stmt_list attribute. These are normally present only in
3250 DIEs with a TAG_compile_unit tag. */
3253 stmt_list_attribute (label)
3256 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_stmt_list);
3257 /* Don't use ASM_OUTPUT_DWARF_DATA4 here. */
3258 ASM_OUTPUT_DWARF_ADDR (asm_out_file, label);
3261 /* Generate an AT_low_pc attribute for a label DIE, a lexical_block DIE or
3262 for a subroutine DIE. */
3265 low_pc_attribute (asm_low_label)
3266 const char *asm_low_label;
3268 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_low_pc);
3269 ASM_OUTPUT_DWARF_ADDR (asm_out_file, asm_low_label);
3272 /* Generate an AT_high_pc attribute for a lexical_block DIE or for a
3276 high_pc_attribute (asm_high_label)
3277 const char *asm_high_label;
3279 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_high_pc);
3280 ASM_OUTPUT_DWARF_ADDR (asm_out_file, asm_high_label);
3283 /* Generate an AT_body_begin attribute for a subroutine DIE. */
3286 body_begin_attribute (asm_begin_label)
3287 const char *asm_begin_label;
3289 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_body_begin);
3290 ASM_OUTPUT_DWARF_ADDR (asm_out_file, asm_begin_label);
3293 /* Generate an AT_body_end attribute for a subroutine DIE. */
3296 body_end_attribute (asm_end_label)
3297 const char *asm_end_label;
3299 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_body_end);
3300 ASM_OUTPUT_DWARF_ADDR (asm_out_file, asm_end_label);
3303 /* Generate an AT_language attribute given a LANG value. These attributes
3304 are used only within TAG_compile_unit DIEs. */
3307 language_attribute (language_code)
3308 unsigned language_code;
3310 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_language);
3311 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, language_code);
3315 member_attribute (context)
3318 char label[MAX_ARTIFICIAL_LABEL_BYTES];
3320 /* Generate this attribute only for members in C++. */
3322 if (context != NULL && is_tagged_type (context))
3324 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_member);
3325 sprintf (label, TYPE_NAME_FMT, TYPE_UID (context));
3326 ASM_OUTPUT_DWARF_REF (asm_out_file, label);
3332 string_length_attribute (upper_bound)
3335 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
3336 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
3338 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_string_length);
3339 sprintf (begin_label, SL_BEGIN_LABEL_FMT, current_dienum);
3340 sprintf (end_label, SL_END_LABEL_FMT, current_dienum);
3341 ASM_OUTPUT_DWARF_DELTA2 (asm_out_file, end_label, begin_label);
3342 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
3343 output_bound_representation (upper_bound, 0, 'u');
3344 ASM_OUTPUT_LABEL (asm_out_file, end_label);
3349 comp_dir_attribute (dirname)
3350 const char *dirname;
3352 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_comp_dir);
3353 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, dirname);
3357 sf_names_attribute (sf_names_start_label)
3358 const char *sf_names_start_label;
3360 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_sf_names);
3361 /* Don't use ASM_OUTPUT_DWARF_DATA4 here. */
3362 ASM_OUTPUT_DWARF_ADDR (asm_out_file, sf_names_start_label);
3366 src_info_attribute (src_info_start_label)
3367 const char *src_info_start_label;
3369 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_src_info);
3370 /* Don't use ASM_OUTPUT_DWARF_DATA4 here. */
3371 ASM_OUTPUT_DWARF_ADDR (asm_out_file, src_info_start_label);
3375 mac_info_attribute (mac_info_start_label)
3376 const char *mac_info_start_label;
3378 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_mac_info);
3379 /* Don't use ASM_OUTPUT_DWARF_DATA4 here. */
3380 ASM_OUTPUT_DWARF_ADDR (asm_out_file, mac_info_start_label);
3384 prototyped_attribute (func_type)
3387 if ((strcmp (lang_hooks.name, "GNU C") == 0)
3388 && (TYPE_ARG_TYPES (func_type) != NULL))
3390 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_prototyped);
3391 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, "");
3396 producer_attribute (producer)
3397 const char *producer;
3399 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_producer);
3400 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, producer);
3404 inline_attribute (decl)
3407 if (DECL_INLINE (decl))
3409 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_inline);
3410 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, "");
3415 containing_type_attribute (containing_type)
3416 tree containing_type;
3418 char label[MAX_ARTIFICIAL_LABEL_BYTES];
3420 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_containing_type);
3421 sprintf (label, TYPE_NAME_FMT, TYPE_UID (containing_type));
3422 ASM_OUTPUT_DWARF_REF (asm_out_file, label);
3426 abstract_origin_attribute (origin)
3429 char label[MAX_ARTIFICIAL_LABEL_BYTES];
3431 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_abstract_origin);
3432 switch (TREE_CODE_CLASS (TREE_CODE (origin)))
3435 sprintf (label, DECL_NAME_FMT, DECL_UID (origin));
3439 sprintf (label, TYPE_NAME_FMT, TYPE_UID (origin));
3443 abort (); /* Should never happen. */
3446 ASM_OUTPUT_DWARF_REF (asm_out_file, label);
3449 #ifdef DWARF_DECL_COORDINATES
3451 src_coords_attribute (src_fileno, src_lineno)
3452 unsigned src_fileno;
3453 unsigned src_lineno;
3455 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_src_coords);
3456 ASM_OUTPUT_DWARF_DATA2 (asm_out_file, src_fileno);
3457 ASM_OUTPUT_DWARF_DATA2 (asm_out_file, src_lineno);
3459 #endif /* defined(DWARF_DECL_COORDINATES) */
3462 pure_or_virtual_attribute (func_decl)
3465 if (DECL_VIRTUAL_P (func_decl))
3467 #if 0 /* DECL_ABSTRACT_VIRTUAL_P is C++-specific. */
3468 if (DECL_ABSTRACT_VIRTUAL_P (func_decl))
3469 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_pure_virtual);
3472 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_virtual);
3473 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, "");
3477 /************************* end of attributes *****************************/
3479 /********************* utility routines for DIEs *************************/
3481 /* Output an AT_name attribute and an AT_src_coords attribute for the
3482 given decl, but only if it actually has a name. */
3485 name_and_src_coords_attributes (decl)
3488 tree decl_name = DECL_NAME (decl);
3490 if (decl_name && IDENTIFIER_POINTER (decl_name))
3492 name_attribute (IDENTIFIER_POINTER (decl_name));
3493 #ifdef DWARF_DECL_COORDINATES
3495 register unsigned file_index;
3497 /* This is annoying, but we have to pop out of the .debug section
3498 for a moment while we call `lookup_filename' because calling it
3499 may cause a temporary switch into the .debug_sfnames section and
3500 most svr4 assemblers are not smart enough to be able to nest
3501 section switches to any depth greater than one. Note that we
3502 also can't skirt this issue by delaying all output to the
3503 .debug_sfnames section unit the end of compilation because that
3504 would cause us to have inter-section forward references and
3505 Fred Fish sez that m68k/svr4 assemblers botch those. */
3507 ASM_OUTPUT_POP_SECTION (asm_out_file);
3508 file_index = lookup_filename (DECL_SOURCE_FILE (decl));
3509 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_SECTION);
3511 src_coords_attribute (file_index, DECL_SOURCE_LINE (decl));
3513 #endif /* defined(DWARF_DECL_COORDINATES) */
3517 /* Many forms of DIEs contain a "type description" part. The following
3518 routine writes out these "type descriptor" parts. */
3521 type_attribute (type, decl_const, decl_volatile)
3526 enum tree_code code = TREE_CODE (type);
3527 int root_type_modified;
3529 if (code == ERROR_MARK)
3532 /* Handle a special case. For functions whose return type is void,
3533 we generate *no* type attribute. (Note that no object may have
3534 type `void', so this only applies to function return types. */
3536 if (code == VOID_TYPE)
3539 /* If this is a subtype, find the underlying type. Eventually,
3540 this should write out the appropriate subtype info. */
3541 while ((code == INTEGER_TYPE || code == REAL_TYPE)
3542 && TREE_TYPE (type) != 0)
3543 type = TREE_TYPE (type), code = TREE_CODE (type);
3545 root_type_modified = (code == POINTER_TYPE || code == REFERENCE_TYPE
3546 || decl_const || decl_volatile
3547 || TYPE_READONLY (type) || TYPE_VOLATILE (type));
3549 if (type_is_fundamental (root_type (type)))
3551 if (root_type_modified)
3552 mod_fund_type_attribute (type, decl_const, decl_volatile);
3554 fund_type_attribute (fundamental_type_code (type));
3558 if (root_type_modified)
3559 mod_u_d_type_attribute (type, decl_const, decl_volatile);
3561 /* We have to get the type_main_variant here (and pass that to the
3562 `user_def_type_attribute' routine) because the ..._TYPE node we
3563 have might simply be a *copy* of some original type node (where
3564 the copy was created to help us keep track of typedef names)
3565 and that copy might have a different TYPE_UID from the original
3566 ..._TYPE node. (Note that when `equate_type_number_to_die_number'
3567 is labeling a given type DIE for future reference, it always and
3568 only creates labels for DIEs representing *main variants*, and it
3569 never even knows about non-main-variants.) */
3570 user_def_type_attribute (type_main_variant (type));
3574 /* Given a tree pointer to a struct, class, union, or enum type node, return
3575 a pointer to the (string) tag name for the given type, or zero if the
3576 type was declared without a tag. */
3582 const char *name = 0;
3584 if (TYPE_NAME (type) != 0)
3588 /* Find the IDENTIFIER_NODE for the type name. */
3589 if (TREE_CODE (TYPE_NAME (type)) == IDENTIFIER_NODE)
3590 t = TYPE_NAME (type);
3592 /* The g++ front end makes the TYPE_NAME of *each* tagged type point to
3593 a TYPE_DECL node, regardless of whether or not a `typedef' was
3595 else if (TREE_CODE (TYPE_NAME (type)) == TYPE_DECL
3596 && ! DECL_IGNORED_P (TYPE_NAME (type)))
3597 t = DECL_NAME (TYPE_NAME (type));
3599 /* Now get the name as a string, or invent one. */
3601 name = IDENTIFIER_POINTER (t);
3604 return (name == 0 || *name == '\0') ? 0 : name;
3610 /* Start by checking if the pending_sibling_stack needs to be expanded.
3611 If necessary, expand it. */
3613 if (pending_siblings == pending_siblings_allocated)
3615 pending_siblings_allocated += PENDING_SIBLINGS_INCREMENT;
3616 pending_sibling_stack
3617 = (unsigned *) xrealloc (pending_sibling_stack,
3618 pending_siblings_allocated * sizeof(unsigned));
3622 NEXT_DIE_NUM = next_unused_dienum++;
3625 /* Pop the sibling stack so that the most recently pushed DIEnum becomes the
3635 member_declared_type (member)
3638 return (DECL_BIT_FIELD_TYPE (member))
3639 ? DECL_BIT_FIELD_TYPE (member)
3640 : TREE_TYPE (member);
3643 /* Get the function's label, as described by its RTL.
3644 This may be different from the DECL_NAME name used
3645 in the source file. */
3648 function_start_label (decl)
3654 x = DECL_RTL (decl);
3655 if (GET_CODE (x) != MEM)
3658 if (GET_CODE (x) != SYMBOL_REF)
3660 fnname = XSTR (x, 0);
3665 /******************************* DIEs ************************************/
3667 /* Output routines for individual types of DIEs. */
3669 /* Note that every type of DIE (except a null DIE) gets a sibling. */
3672 output_array_type_die (arg)
3677 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_array_type);
3678 sibling_attribute ();
3679 equate_type_number_to_die_number (type);
3680 member_attribute (TYPE_CONTEXT (type));
3682 /* I believe that we can default the array ordering. SDB will probably
3683 do the right things even if AT_ordering is not present. It's not
3684 even an issue until we start to get into multidimensional arrays
3685 anyway. If SDB is ever caught doing the Wrong Thing for multi-
3686 dimensional arrays, then we'll have to put the AT_ordering attribute
3687 back in. (But if and when we find out that we need to put these in,
3688 we will only do so for multidimensional arrays. After all, we don't
3689 want to waste space in the .debug section now do we?) */
3691 #ifdef USE_ORDERING_ATTRIBUTE
3692 ordering_attribute (ORD_row_major);
3693 #endif /* defined(USE_ORDERING_ATTRIBUTE) */
3695 subscript_data_attribute (type);
3699 output_set_type_die (arg)
3704 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_set_type);
3705 sibling_attribute ();
3706 equate_type_number_to_die_number (type);
3707 member_attribute (TYPE_CONTEXT (type));
3708 type_attribute (TREE_TYPE (type), 0, 0);
3712 /* Implement this when there is a GNU FORTRAN or GNU Ada front end. */
3715 output_entry_point_die (arg)
3719 tree origin = decl_ultimate_origin (decl);
3721 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_entry_point);
3722 sibling_attribute ();
3725 abstract_origin_attribute (origin);
3728 name_and_src_coords_attributes (decl);
3729 member_attribute (DECL_CONTEXT (decl));
3730 type_attribute (TREE_TYPE (TREE_TYPE (decl)), 0, 0);
3732 if (DECL_ABSTRACT (decl))
3733 equate_decl_number_to_die_number (decl);
3735 low_pc_attribute (function_start_label (decl));
3739 /* Output a DIE to represent an inlined instance of an enumeration type. */
3742 output_inlined_enumeration_type_die (arg)
3747 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_enumeration_type);
3748 sibling_attribute ();
3749 if (!TREE_ASM_WRITTEN (type))
3751 abstract_origin_attribute (type);
3754 /* Output a DIE to represent an inlined instance of a structure type. */
3757 output_inlined_structure_type_die (arg)
3762 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_structure_type);
3763 sibling_attribute ();
3764 if (!TREE_ASM_WRITTEN (type))
3766 abstract_origin_attribute (type);
3769 /* Output a DIE to represent an inlined instance of a union type. */
3772 output_inlined_union_type_die (arg)
3777 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_union_type);
3778 sibling_attribute ();
3779 if (!TREE_ASM_WRITTEN (type))
3781 abstract_origin_attribute (type);
3784 /* Output a DIE to represent an enumeration type. Note that these DIEs
3785 include all of the information about the enumeration values also.
3786 This information is encoded into the element_list attribute. */
3789 output_enumeration_type_die (arg)
3794 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_enumeration_type);
3795 sibling_attribute ();
3796 equate_type_number_to_die_number (type);
3797 name_attribute (type_tag (type));
3798 member_attribute (TYPE_CONTEXT (type));
3800 /* Handle a GNU C/C++ extension, i.e. incomplete enum types. If the
3801 given enum type is incomplete, do not generate the AT_byte_size
3802 attribute or the AT_element_list attribute. */
3804 if (COMPLETE_TYPE_P (type))
3806 byte_size_attribute (type);
3807 element_list_attribute (TYPE_FIELDS (type));
3811 /* Output a DIE to represent either a real live formal parameter decl or
3812 to represent just the type of some formal parameter position in some
3815 Note that this routine is a bit unusual because its argument may be
3816 a ..._DECL node (i.e. either a PARM_DECL or perhaps a VAR_DECL which
3817 represents an inlining of some PARM_DECL) or else some sort of a
3818 ..._TYPE node. If it's the former then this function is being called
3819 to output a DIE to represent a formal parameter object (or some inlining
3820 thereof). If it's the latter, then this function is only being called
3821 to output a TAG_formal_parameter DIE to stand as a placeholder for some
3822 formal argument type of some subprogram type. */
3825 output_formal_parameter_die (arg)
3830 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_formal_parameter);
3831 sibling_attribute ();
3833 switch (TREE_CODE_CLASS (TREE_CODE (node)))
3835 case 'd': /* We were called with some kind of a ..._DECL node. */
3837 register tree origin = decl_ultimate_origin (node);
3840 abstract_origin_attribute (origin);
3843 name_and_src_coords_attributes (node);
3844 type_attribute (TREE_TYPE (node),
3845 TREE_READONLY (node), TREE_THIS_VOLATILE (node));
3847 if (DECL_ABSTRACT (node))
3848 equate_decl_number_to_die_number (node);
3850 location_or_const_value_attribute (node);
3854 case 't': /* We were called with some kind of a ..._TYPE node. */
3855 type_attribute (node, 0, 0);
3859 abort (); /* Should never happen. */
3863 /* Output a DIE to represent a declared function (either file-scope
3864 or block-local) which has "external linkage" (according to ANSI-C). */
3867 output_global_subroutine_die (arg)
3871 tree origin = decl_ultimate_origin (decl);
3873 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_global_subroutine);
3874 sibling_attribute ();
3877 abstract_origin_attribute (origin);
3880 tree type = TREE_TYPE (decl);
3882 name_and_src_coords_attributes (decl);
3883 inline_attribute (decl);
3884 prototyped_attribute (type);
3885 member_attribute (DECL_CONTEXT (decl));
3886 type_attribute (TREE_TYPE (type), 0, 0);
3887 pure_or_virtual_attribute (decl);
3889 if (DECL_ABSTRACT (decl))
3890 equate_decl_number_to_die_number (decl);
3893 if (! DECL_EXTERNAL (decl) && ! in_class
3894 && decl == current_function_decl)
3896 char label[MAX_ARTIFICIAL_LABEL_BYTES];
3898 low_pc_attribute (function_start_label (decl));
3899 sprintf (label, FUNC_END_LABEL_FMT, current_funcdef_number);
3900 high_pc_attribute (label);
3901 if (use_gnu_debug_info_extensions)
3903 sprintf (label, BODY_BEGIN_LABEL_FMT, current_funcdef_number);
3904 body_begin_attribute (label);
3905 sprintf (label, BODY_END_LABEL_FMT, current_funcdef_number);
3906 body_end_attribute (label);
3912 /* Output a DIE to represent a declared data object (either file-scope
3913 or block-local) which has "external linkage" (according to ANSI-C). */
3916 output_global_variable_die (arg)
3920 tree origin = decl_ultimate_origin (decl);
3922 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_global_variable);
3923 sibling_attribute ();
3925 abstract_origin_attribute (origin);
3928 name_and_src_coords_attributes (decl);
3929 member_attribute (DECL_CONTEXT (decl));
3930 type_attribute (TREE_TYPE (decl),
3931 TREE_READONLY (decl), TREE_THIS_VOLATILE (decl));
3933 if (DECL_ABSTRACT (decl))
3934 equate_decl_number_to_die_number (decl);
3937 if (! DECL_EXTERNAL (decl) && ! in_class
3938 && current_function_decl == decl_function_context (decl))
3939 location_or_const_value_attribute (decl);
3944 output_label_die (arg)
3948 tree origin = decl_ultimate_origin (decl);
3950 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_label);
3951 sibling_attribute ();
3953 abstract_origin_attribute (origin);
3955 name_and_src_coords_attributes (decl);
3956 if (DECL_ABSTRACT (decl))
3957 equate_decl_number_to_die_number (decl);
3960 rtx insn = DECL_RTL (decl);
3962 /* Deleted labels are programmer specified labels which have been
3963 eliminated because of various optimisations. We still emit them
3964 here so that it is possible to put breakpoints on them. */
3965 if (GET_CODE (insn) == CODE_LABEL
3966 || ((GET_CODE (insn) == NOTE
3967 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_DELETED_LABEL)))
3969 char label[MAX_ARTIFICIAL_LABEL_BYTES];
3971 /* When optimization is enabled (via -O) some parts of the compiler
3972 (e.g. jump.c and cse.c) may try to delete CODE_LABEL insns which
3973 represent source-level labels which were explicitly declared by
3974 the user. This really shouldn't be happening though, so catch
3975 it if it ever does happen. */
3977 if (INSN_DELETED_P (insn))
3978 abort (); /* Should never happen. */
3980 ASM_GENERATE_INTERNAL_LABEL (label, "L", CODE_LABEL_NUMBER (insn));
3981 low_pc_attribute (label);
3987 output_lexical_block_die (arg)
3992 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_lexical_block);
3993 sibling_attribute ();
3995 if (! BLOCK_ABSTRACT (stmt))
3997 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
3998 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
4000 sprintf (begin_label, BLOCK_BEGIN_LABEL_FMT, BLOCK_NUMBER (stmt));
4001 low_pc_attribute (begin_label);
4002 sprintf (end_label, BLOCK_END_LABEL_FMT, BLOCK_NUMBER (stmt));
4003 high_pc_attribute (end_label);
4008 output_inlined_subroutine_die (arg)
4013 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_inlined_subroutine);
4014 sibling_attribute ();
4016 abstract_origin_attribute (block_ultimate_origin (stmt));
4017 if (! BLOCK_ABSTRACT (stmt))
4019 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
4020 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
4022 sprintf (begin_label, BLOCK_BEGIN_LABEL_FMT, BLOCK_NUMBER (stmt));
4023 low_pc_attribute (begin_label);
4024 sprintf (end_label, BLOCK_END_LABEL_FMT, BLOCK_NUMBER (stmt));
4025 high_pc_attribute (end_label);
4029 /* Output a DIE to represent a declared data object (either file-scope
4030 or block-local) which has "internal linkage" (according to ANSI-C). */
4033 output_local_variable_die (arg)
4037 tree origin = decl_ultimate_origin (decl);
4039 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_local_variable);
4040 sibling_attribute ();
4042 abstract_origin_attribute (origin);
4045 name_and_src_coords_attributes (decl);
4046 member_attribute (DECL_CONTEXT (decl));
4047 type_attribute (TREE_TYPE (decl),
4048 TREE_READONLY (decl), TREE_THIS_VOLATILE (decl));
4050 if (DECL_ABSTRACT (decl))
4051 equate_decl_number_to_die_number (decl);
4053 location_or_const_value_attribute (decl);
4057 output_member_die (arg)
4062 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_member);
4063 sibling_attribute ();
4064 name_and_src_coords_attributes (decl);
4065 member_attribute (DECL_CONTEXT (decl));
4066 type_attribute (member_declared_type (decl),
4067 TREE_READONLY (decl), TREE_THIS_VOLATILE (decl));
4068 if (DECL_BIT_FIELD_TYPE (decl)) /* If this is a bit field... */
4070 byte_size_attribute (decl);
4071 bit_size_attribute (decl);
4072 bit_offset_attribute (decl);
4074 data_member_location_attribute (decl);
4078 /* Don't generate either pointer_type DIEs or reference_type DIEs. Use
4079 modified types instead.
4081 We keep this code here just in case these types of DIEs may be
4082 needed to represent certain things in other languages (e.g. Pascal)
4086 output_pointer_type_die (arg)
4091 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_pointer_type);
4092 sibling_attribute ();
4093 equate_type_number_to_die_number (type);
4094 member_attribute (TYPE_CONTEXT (type));
4095 type_attribute (TREE_TYPE (type), 0, 0);
4099 output_reference_type_die (arg)
4104 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_reference_type);
4105 sibling_attribute ();
4106 equate_type_number_to_die_number (type);
4107 member_attribute (TYPE_CONTEXT (type));
4108 type_attribute (TREE_TYPE (type), 0, 0);
4113 output_ptr_to_mbr_type_die (arg)
4118 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_ptr_to_member_type);
4119 sibling_attribute ();
4120 equate_type_number_to_die_number (type);
4121 member_attribute (TYPE_CONTEXT (type));
4122 containing_type_attribute (TYPE_OFFSET_BASETYPE (type));
4123 type_attribute (TREE_TYPE (type), 0, 0);
4127 output_compile_unit_die (arg)
4130 const char *main_input_filename = arg;
4131 const char *language_string = lang_hooks.name;
4133 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_compile_unit);
4134 sibling_attribute ();
4136 name_attribute (main_input_filename);
4141 sprintf (producer, "%s %s", language_string, version_string);
4142 producer_attribute (producer);
4145 if (strcmp (language_string, "GNU C++") == 0)
4146 language_attribute (LANG_C_PLUS_PLUS);
4147 else if (strcmp (language_string, "GNU Ada") == 0)
4148 language_attribute (LANG_ADA83);
4149 else if (strcmp (language_string, "GNU F77") == 0)
4150 language_attribute (LANG_FORTRAN77);
4151 else if (strcmp (language_string, "GNU Pascal") == 0)
4152 language_attribute (LANG_PASCAL83);
4153 else if (strcmp (language_string, "GNU Java") == 0)
4154 language_attribute (LANG_JAVA);
4155 else if (flag_traditional)
4156 language_attribute (LANG_C);
4158 language_attribute (LANG_C89);
4159 low_pc_attribute (TEXT_BEGIN_LABEL);
4160 high_pc_attribute (TEXT_END_LABEL);
4161 if (debug_info_level >= DINFO_LEVEL_NORMAL)
4162 stmt_list_attribute (LINE_BEGIN_LABEL);
4165 const char *wd = getpwd ();
4167 comp_dir_attribute (wd);
4170 if (debug_info_level >= DINFO_LEVEL_NORMAL && use_gnu_debug_info_extensions)
4172 sf_names_attribute (SFNAMES_BEGIN_LABEL);
4173 src_info_attribute (SRCINFO_BEGIN_LABEL);
4174 if (debug_info_level >= DINFO_LEVEL_VERBOSE)
4175 mac_info_attribute (MACINFO_BEGIN_LABEL);
4180 output_string_type_die (arg)
4185 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_string_type);
4186 sibling_attribute ();
4187 equate_type_number_to_die_number (type);
4188 member_attribute (TYPE_CONTEXT (type));
4189 /* this is a fixed length string */
4190 byte_size_attribute (type);
4194 output_inheritance_die (arg)
4199 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_inheritance);
4200 sibling_attribute ();
4201 type_attribute (BINFO_TYPE (binfo), 0, 0);
4202 data_member_location_attribute (binfo);
4203 if (TREE_VIA_VIRTUAL (binfo))
4205 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_virtual);
4206 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, "");
4208 if (TREE_VIA_PUBLIC (binfo))
4210 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_public);
4211 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, "");
4213 else if (TREE_VIA_PROTECTED (binfo))
4215 ASM_OUTPUT_DWARF_ATTRIBUTE (asm_out_file, AT_protected);
4216 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, "");
4221 output_structure_type_die (arg)
4226 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_structure_type);
4227 sibling_attribute ();
4228 equate_type_number_to_die_number (type);
4229 name_attribute (type_tag (type));
4230 member_attribute (TYPE_CONTEXT (type));
4232 /* If this type has been completed, then give it a byte_size attribute
4233 and prepare to give a list of members. Otherwise, don't do either of
4234 these things. In the latter case, we will not be generating a list
4235 of members (since we don't have any idea what they might be for an
4236 incomplete type). */
4238 if (COMPLETE_TYPE_P (type))
4241 byte_size_attribute (type);
4245 /* Output a DIE to represent a declared function (either file-scope
4246 or block-local) which has "internal linkage" (according to ANSI-C). */
4249 output_local_subroutine_die (arg)
4253 tree origin = decl_ultimate_origin (decl);
4255 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_subroutine);
4256 sibling_attribute ();
4259 abstract_origin_attribute (origin);
4262 tree type = TREE_TYPE (decl);
4264 name_and_src_coords_attributes (decl);
4265 inline_attribute (decl);
4266 prototyped_attribute (type);
4267 member_attribute (DECL_CONTEXT (decl));
4268 type_attribute (TREE_TYPE (type), 0, 0);
4269 pure_or_virtual_attribute (decl);
4271 if (DECL_ABSTRACT (decl))
4272 equate_decl_number_to_die_number (decl);
4275 /* Avoid getting screwed up in cases where a function was declared
4276 static but where no definition was ever given for it. */
4278 if (TREE_ASM_WRITTEN (decl))
4280 char label[MAX_ARTIFICIAL_LABEL_BYTES];
4281 low_pc_attribute (function_start_label (decl));
4282 sprintf (label, FUNC_END_LABEL_FMT, current_funcdef_number);
4283 high_pc_attribute (label);
4284 if (use_gnu_debug_info_extensions)
4286 sprintf (label, BODY_BEGIN_LABEL_FMT, current_funcdef_number);
4287 body_begin_attribute (label);
4288 sprintf (label, BODY_END_LABEL_FMT, current_funcdef_number);
4289 body_end_attribute (label);
4296 output_subroutine_type_die (arg)
4300 tree return_type = TREE_TYPE (type);
4302 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_subroutine_type);
4303 sibling_attribute ();
4305 equate_type_number_to_die_number (type);
4306 prototyped_attribute (type);
4307 member_attribute (TYPE_CONTEXT (type));
4308 type_attribute (return_type, 0, 0);
4312 output_typedef_die (arg)
4316 tree origin = decl_ultimate_origin (decl);
4318 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_typedef);
4319 sibling_attribute ();
4321 abstract_origin_attribute (origin);
4324 name_and_src_coords_attributes (decl);
4325 member_attribute (DECL_CONTEXT (decl));
4326 type_attribute (TREE_TYPE (decl),
4327 TREE_READONLY (decl), TREE_THIS_VOLATILE (decl));
4329 if (DECL_ABSTRACT (decl))
4330 equate_decl_number_to_die_number (decl);
4334 output_union_type_die (arg)
4339 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_union_type);
4340 sibling_attribute ();
4341 equate_type_number_to_die_number (type);
4342 name_attribute (type_tag (type));
4343 member_attribute (TYPE_CONTEXT (type));
4345 /* If this type has been completed, then give it a byte_size attribute
4346 and prepare to give a list of members. Otherwise, don't do either of
4347 these things. In the latter case, we will not be generating a list
4348 of members (since we don't have any idea what they might be for an
4349 incomplete type). */
4351 if (COMPLETE_TYPE_P (type))
4354 byte_size_attribute (type);
4358 /* Generate a special type of DIE used as a stand-in for a trailing ellipsis
4359 at the end of an (ANSI prototyped) formal parameters list. */
4362 output_unspecified_parameters_die (arg)
4365 tree decl_or_type = arg;
4367 ASM_OUTPUT_DWARF_TAG (asm_out_file, TAG_unspecified_parameters);
4368 sibling_attribute ();
4370 /* This kludge is here only for the sake of being compatible with what
4371 the USL CI5 C compiler does. The specification of Dwarf Version 1
4372 doesn't say that TAG_unspecified_parameters DIEs should contain any
4373 attributes other than the AT_sibling attribute, but they are certainly
4374 allowed to contain additional attributes, and the CI5 compiler
4375 generates AT_name, AT_fund_type, and AT_location attributes within
4376 TAG_unspecified_parameters DIEs which appear in the child lists for
4377 DIEs representing function definitions, so we do likewise here. */
4379 if (TREE_CODE (decl_or_type) == FUNCTION_DECL && DECL_INITIAL (decl_or_type))
4381 name_attribute ("...");
4382 fund_type_attribute (FT_pointer);
4383 /* location_attribute (?); */
4388 output_padded_null_die (arg)
4389 void *arg ATTRIBUTE_UNUSED;
4391 ASM_OUTPUT_ALIGN (asm_out_file, 2); /* 2**2 == 4 */
4394 /*************************** end of DIEs *********************************/
4396 /* Generate some type of DIE. This routine generates the generic outer
4397 wrapper stuff which goes around all types of DIE's (regardless of their
4398 TAGs. All forms of DIEs start with a DIE-specific label, followed by a
4399 DIE-length word, followed by the guts of the DIE itself. After the guts
4400 of the DIE, there must always be a terminator label for the DIE. */
4403 output_die (die_specific_output_function, param)
4404 void (*die_specific_output_function) PARAMS ((void *));
4407 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
4408 char end_label[MAX_ARTIFICIAL_LABEL_BYTES];
4410 current_dienum = NEXT_DIE_NUM;
4411 NEXT_DIE_NUM = next_unused_dienum;
4413 sprintf (begin_label, DIE_BEGIN_LABEL_FMT, current_dienum);
4414 sprintf (end_label, DIE_END_LABEL_FMT, current_dienum);
4416 /* Write a label which will act as the name for the start of this DIE. */
4418 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
4420 /* Write the DIE-length word. */
4422 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, end_label, begin_label);
4424 /* Fill in the guts of the DIE. */
4426 next_unused_dienum++;
4427 die_specific_output_function (param);
4429 /* Write a label which will act as the name for the end of this DIE. */
4431 ASM_OUTPUT_LABEL (asm_out_file, end_label);
4435 end_sibling_chain ()
4437 char begin_label[MAX_ARTIFICIAL_LABEL_BYTES];
4439 current_dienum = NEXT_DIE_NUM;
4440 NEXT_DIE_NUM = next_unused_dienum;
4442 sprintf (begin_label, DIE_BEGIN_LABEL_FMT, current_dienum);
4444 /* Write a label which will act as the name for the start of this DIE. */
4446 ASM_OUTPUT_LABEL (asm_out_file, begin_label);
4448 /* Write the DIE-length word. */
4450 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, 4);
4455 /* Generate a list of nameless TAG_formal_parameter DIEs (and perhaps a
4456 TAG_unspecified_parameters DIE) to represent the types of the formal
4457 parameters as specified in some function type specification (except
4458 for those which appear as part of a function *definition*).
4460 Note that we must be careful here to output all of the parameter
4461 DIEs *before* we output any DIEs needed to represent the types of
4462 the formal parameters. This keeps svr4 SDB happy because it
4463 (incorrectly) thinks that the first non-parameter DIE it sees ends
4464 the formal parameter list. */
4467 output_formal_types (function_or_method_type)
4468 tree function_or_method_type;
4471 tree formal_type = NULL;
4472 tree first_parm_type = TYPE_ARG_TYPES (function_or_method_type);
4474 /* Set TREE_ASM_WRITTEN while processing the parameters, lest we
4475 get bogus recursion when outputting tagged types local to a
4476 function declaration. */
4477 int save_asm_written = TREE_ASM_WRITTEN (function_or_method_type);
4478 TREE_ASM_WRITTEN (function_or_method_type) = 1;
4480 /* In the case where we are generating a formal types list for a C++
4481 non-static member function type, skip over the first thing on the
4482 TYPE_ARG_TYPES list because it only represents the type of the
4483 hidden `this pointer'. The debugger should be able to figure
4484 out (without being explicitly told) that this non-static member
4485 function type takes a `this pointer' and should be able to figure
4486 what the type of that hidden parameter is from the AT_member
4487 attribute of the parent TAG_subroutine_type DIE. */
4489 if (TREE_CODE (function_or_method_type) == METHOD_TYPE)
4490 first_parm_type = TREE_CHAIN (first_parm_type);
4492 /* Make our first pass over the list of formal parameter types and output
4493 a TAG_formal_parameter DIE for each one. */
4495 for (link = first_parm_type; link; link = TREE_CHAIN (link))
4497 formal_type = TREE_VALUE (link);
4498 if (formal_type == void_type_node)
4501 /* Output a (nameless) DIE to represent the formal parameter itself. */
4503 output_die (output_formal_parameter_die, formal_type);
4506 /* If this function type has an ellipsis, add a TAG_unspecified_parameters
4507 DIE to the end of the parameter list. */
4509 if (formal_type != void_type_node)
4510 output_die (output_unspecified_parameters_die, function_or_method_type);
4512 /* Make our second (and final) pass over the list of formal parameter types
4513 and output DIEs to represent those types (as necessary). */
4515 for (link = TYPE_ARG_TYPES (function_or_method_type);
4517 link = TREE_CHAIN (link))
4519 formal_type = TREE_VALUE (link);
4520 if (formal_type == void_type_node)
4523 output_type (formal_type, function_or_method_type);
4526 TREE_ASM_WRITTEN (function_or_method_type) = save_asm_written;
4529 /* Remember a type in the pending_types_list. */
4535 if (pending_types == pending_types_allocated)
4537 pending_types_allocated += PENDING_TYPES_INCREMENT;
4539 = (tree *) xrealloc (pending_types_list,
4540 sizeof (tree) * pending_types_allocated);
4542 pending_types_list[pending_types++] = type;
4544 /* Mark the pending type as having been output already (even though
4545 it hasn't been). This prevents the type from being added to the
4546 pending_types_list more than once. */
4548 TREE_ASM_WRITTEN (type) = 1;
4551 /* Return non-zero if it is legitimate to output DIEs to represent a
4552 given type while we are generating the list of child DIEs for some
4553 DIE (e.g. a function or lexical block DIE) associated with a given scope.
4555 See the comments within the function for a description of when it is
4556 considered legitimate to output DIEs for various kinds of types.
4558 Note that TYPE_CONTEXT(type) may be NULL (to indicate global scope)
4559 or it may point to a BLOCK node (for types local to a block), or to a
4560 FUNCTION_DECL node (for types local to the heading of some function
4561 definition), or to a FUNCTION_TYPE node (for types local to the
4562 prototyped parameter list of a function type specification), or to a
4563 RECORD_TYPE, UNION_TYPE, or QUAL_UNION_TYPE node
4564 (in the case of C++ nested types).
4566 The `scope' parameter should likewise be NULL or should point to a
4567 BLOCK node, a FUNCTION_DECL node, a FUNCTION_TYPE node, a RECORD_TYPE
4568 node, a UNION_TYPE node, or a QUAL_UNION_TYPE node.
4570 This function is used only for deciding when to "pend" and when to
4571 "un-pend" types to/from the pending_types_list.
4573 Note that we sometimes make use of this "type pending" feature in a
4574 rather twisted way to temporarily delay the production of DIEs for the
4575 types of formal parameters. (We do this just to make svr4 SDB happy.)
4576 It order to delay the production of DIEs representing types of formal
4577 parameters, callers of this function supply `fake_containing_scope' as
4578 the `scope' parameter to this function. Given that fake_containing_scope
4579 is a tagged type which is *not* the containing scope for *any* other type,
4580 the desired effect is achieved, i.e. output of DIEs representing types
4581 is temporarily suspended, and any type DIEs which would have otherwise
4582 been output are instead placed onto the pending_types_list. Later on,
4583 we force these (temporarily pended) types to be output simply by calling
4584 `output_pending_types_for_scope' with an actual argument equal to the
4585 true scope of the types we temporarily pended. */
4588 type_ok_for_scope (type, scope)
4592 /* Tagged types (i.e. struct, union, and enum types) must always be
4593 output only in the scopes where they actually belong (or else the
4594 scoping of their own tag names and the scoping of their member
4595 names will be incorrect). Non-tagged-types on the other hand can
4596 generally be output anywhere, except that svr4 SDB really doesn't
4597 want to see them nested within struct or union types, so here we
4598 say it is always OK to immediately output any such a (non-tagged)
4599 type, so long as we are not within such a context. Note that the
4600 only kinds of non-tagged types which we will be dealing with here
4601 (for C and C++ anyway) will be array types and function types. */
4603 return is_tagged_type (type)
4604 ? (TYPE_CONTEXT (type) == scope
4605 /* Ignore namespaces for the moment. */
4606 || (scope == NULL_TREE
4607 && TREE_CODE (TYPE_CONTEXT (type)) == NAMESPACE_DECL)
4608 || (scope == NULL_TREE && is_tagged_type (TYPE_CONTEXT (type))
4609 && TREE_ASM_WRITTEN (TYPE_CONTEXT (type))))
4610 : (scope == NULL_TREE || ! is_tagged_type (scope));
4613 /* Output any pending types (from the pending_types list) which we can output
4614 now (taking into account the scope that we are working on now).
4616 For each type output, remove the given type from the pending_types_list
4617 *before* we try to output it.
4619 Note that we have to process the list in beginning-to-end order,
4620 because the call made here to output_type may cause yet more types
4621 to be added to the end of the list, and we may have to output some
4625 output_pending_types_for_scope (containing_scope)
4626 tree containing_scope;
4630 for (i = 0; i < pending_types; )
4632 tree type = pending_types_list[i];
4634 if (type_ok_for_scope (type, containing_scope))
4640 limit = &pending_types_list[pending_types];
4641 for (mover = &pending_types_list[i]; mover < limit; mover++)
4642 *mover = *(mover+1);
4644 /* Un-mark the type as having been output already (because it
4645 hasn't been, really). Then call output_type to generate a
4646 Dwarf representation of it. */
4648 TREE_ASM_WRITTEN (type) = 0;
4649 output_type (type, containing_scope);
4651 /* Don't increment the loop counter in this case because we
4652 have shifted all of the subsequent pending types down one
4653 element in the pending_types_list array. */
4660 /* Remember a type in the incomplete_types_list. */
4663 add_incomplete_type (type)
4666 if (incomplete_types == incomplete_types_allocated)
4668 incomplete_types_allocated += INCOMPLETE_TYPES_INCREMENT;
4669 incomplete_types_list
4670 = (tree *) xrealloc (incomplete_types_list,
4671 sizeof (tree) * incomplete_types_allocated);
4674 incomplete_types_list[incomplete_types++] = type;
4677 /* Walk through the list of incomplete types again, trying once more to
4678 emit full debugging info for them. */
4681 retry_incomplete_types ()
4686 while (incomplete_types)
4689 type = incomplete_types_list[incomplete_types];
4690 output_type (type, NULL_TREE);
4695 output_type (type, containing_scope)
4697 tree containing_scope;
4699 if (type == 0 || type == error_mark_node)
4702 /* We are going to output a DIE to represent the unqualified version of
4703 this type (i.e. without any const or volatile qualifiers) so get
4704 the main variant (i.e. the unqualified version) of this type now. */
4706 type = type_main_variant (type);
4708 if (TREE_ASM_WRITTEN (type))
4710 if (finalizing && AGGREGATE_TYPE_P (type))
4714 /* Some of our nested types might not have been defined when we
4715 were written out before; force them out now. */
4717 for (member = TYPE_FIELDS (type); member;
4718 member = TREE_CHAIN (member))
4719 if (TREE_CODE (member) == TYPE_DECL
4720 && ! TREE_ASM_WRITTEN (TREE_TYPE (member)))
4721 output_type (TREE_TYPE (member), containing_scope);
4726 /* If this is a nested type whose containing class hasn't been
4727 written out yet, writing it out will cover this one, too. */
4729 if (TYPE_CONTEXT (type)
4730 && TYPE_P (TYPE_CONTEXT (type))
4731 && ! TREE_ASM_WRITTEN (TYPE_CONTEXT (type)))
4733 output_type (TYPE_CONTEXT (type), containing_scope);
4737 /* Don't generate any DIEs for this type now unless it is OK to do so
4738 (based upon what `type_ok_for_scope' tells us). */
4740 if (! type_ok_for_scope (type, containing_scope))
4746 switch (TREE_CODE (type))
4752 output_type (TYPE_DEBUG_REPRESENTATION_TYPE (type), containing_scope);
4756 case REFERENCE_TYPE:
4757 /* Prevent infinite recursion in cases where this is a recursive
4758 type. Recursive types are possible in Ada. */
4759 TREE_ASM_WRITTEN (type) = 1;
4760 /* For these types, all that is required is that we output a DIE
4761 (or a set of DIEs) to represent the "basis" type. */
4762 output_type (TREE_TYPE (type), containing_scope);
4766 /* This code is used for C++ pointer-to-data-member types. */
4767 /* Output a description of the relevant class type. */
4768 output_type (TYPE_OFFSET_BASETYPE (type), containing_scope);
4769 /* Output a description of the type of the object pointed to. */
4770 output_type (TREE_TYPE (type), containing_scope);
4771 /* Now output a DIE to represent this pointer-to-data-member type
4773 output_die (output_ptr_to_mbr_type_die, type);
4777 output_type (TYPE_DOMAIN (type), containing_scope);
4778 output_die (output_set_type_die, type);
4782 output_type (TREE_TYPE (type), containing_scope);
4783 abort (); /* No way to represent these in Dwarf yet! */
4787 /* Force out return type (in case it wasn't forced out already). */
4788 output_type (TREE_TYPE (type), containing_scope);
4789 output_die (output_subroutine_type_die, type);
4790 output_formal_types (type);
4791 end_sibling_chain ();
4795 /* Force out return type (in case it wasn't forced out already). */
4796 output_type (TREE_TYPE (type), containing_scope);
4797 output_die (output_subroutine_type_die, type);
4798 output_formal_types (type);
4799 end_sibling_chain ();
4803 if (TYPE_STRING_FLAG (type) && TREE_CODE(TREE_TYPE(type)) == CHAR_TYPE)
4805 output_type (TREE_TYPE (type), containing_scope);
4806 output_die (output_string_type_die, type);
4812 element_type = TREE_TYPE (type);
4813 while (TREE_CODE (element_type) == ARRAY_TYPE)
4814 element_type = TREE_TYPE (element_type);
4816 output_type (element_type, containing_scope);
4817 output_die (output_array_type_die, type);
4824 case QUAL_UNION_TYPE:
4826 /* For a non-file-scope tagged type, we can always go ahead and
4827 output a Dwarf description of this type right now, even if
4828 the type in question is still incomplete, because if this
4829 local type *was* ever completed anywhere within its scope,
4830 that complete definition would already have been attached to
4831 this RECORD_TYPE, UNION_TYPE, QUAL_UNION_TYPE or ENUMERAL_TYPE
4832 node by the time we reach this point. That's true because of the
4833 way the front-end does its processing of file-scope declarations (of
4834 functions and class types) within which other types might be
4835 nested. The C and C++ front-ends always gobble up such "local
4836 scope" things en-mass before they try to output *any* debugging
4837 information for any of the stuff contained inside them and thus,
4838 we get the benefit here of what is (in effect) a pre-resolution
4839 of forward references to tagged types in local scopes.
4841 Note however that for file-scope tagged types we cannot assume
4842 that such pre-resolution of forward references has taken place.
4843 A given file-scope tagged type may appear to be incomplete when
4844 we reach this point, but it may yet be given a full definition
4845 (at file-scope) later on during compilation. In order to avoid
4846 generating a premature (and possibly incorrect) set of Dwarf
4847 DIEs for such (as yet incomplete) file-scope tagged types, we
4848 generate nothing at all for as-yet incomplete file-scope tagged
4849 types here unless we are making our special "finalization" pass
4850 for file-scope things at the very end of compilation. At that
4851 time, we will certainly know as much about each file-scope tagged
4852 type as we are ever going to know, so at that point in time, we
4853 can safely generate correct Dwarf descriptions for these file-
4854 scope tagged types. */
4856 if (!COMPLETE_TYPE_P (type)
4857 && (TYPE_CONTEXT (type) == NULL
4858 || AGGREGATE_TYPE_P (TYPE_CONTEXT (type))
4859 || TREE_CODE (TYPE_CONTEXT (type)) == NAMESPACE_DECL)
4862 /* We don't need to do this for function-local types. */
4863 if (! decl_function_context (TYPE_STUB_DECL (type)))
4864 add_incomplete_type (type);
4865 return; /* EARLY EXIT! Avoid setting TREE_ASM_WRITTEN. */
4868 /* Prevent infinite recursion in cases where the type of some
4869 member of this type is expressed in terms of this type itself. */
4871 TREE_ASM_WRITTEN (type) = 1;
4873 /* Output a DIE to represent the tagged type itself. */
4875 switch (TREE_CODE (type))
4878 output_die (output_enumeration_type_die, type);
4879 return; /* a special case -- nothing left to do so just return */
4882 output_die (output_structure_type_die, type);
4886 case QUAL_UNION_TYPE:
4887 output_die (output_union_type_die, type);
4891 abort (); /* Should never happen. */
4894 /* If this is not an incomplete type, output descriptions of
4895 each of its members.
4897 Note that as we output the DIEs necessary to represent the
4898 members of this record or union type, we will also be trying
4899 to output DIEs to represent the *types* of those members.
4900 However the `output_type' function (above) will specifically
4901 avoid generating type DIEs for member types *within* the list
4902 of member DIEs for this (containing) type except for those
4903 types (of members) which are explicitly marked as also being
4904 members of this (containing) type themselves. The g++ front-
4905 end can force any given type to be treated as a member of some
4906 other (containing) type by setting the TYPE_CONTEXT of the
4907 given (member) type to point to the TREE node representing the
4908 appropriate (containing) type.
4911 if (COMPLETE_TYPE_P (type))
4913 /* First output info about the base classes. */
4914 if (TYPE_BINFO (type) && TYPE_BINFO_BASETYPES (type))
4916 register tree bases = TYPE_BINFO_BASETYPES (type);
4917 register int n_bases = TREE_VEC_LENGTH (bases);
4920 for (i = 0; i < n_bases; i++)
4922 tree binfo = TREE_VEC_ELT (bases, i);
4923 output_type (BINFO_TYPE (binfo), containing_scope);
4924 output_die (output_inheritance_die, binfo);
4933 /* Now output info about the data members and type members. */
4935 for (normal_member = TYPE_FIELDS (type);
4937 normal_member = TREE_CHAIN (normal_member))
4938 output_decl (normal_member, type);
4944 /* Now output info about the function members (if any). */
4946 for (func_member = TYPE_METHODS (type);
4948 func_member = TREE_CHAIN (func_member))
4950 /* Don't include clones in the member list. */
4951 if (DECL_ABSTRACT_ORIGIN (func_member))
4954 output_decl (func_member, type);
4960 /* RECORD_TYPEs, UNION_TYPEs, and QUAL_UNION_TYPEs are themselves
4961 scopes (at least in C++) so we must now output any nested
4962 pending types which are local just to this type. */
4964 output_pending_types_for_scope (type);
4966 end_sibling_chain (); /* Terminate member chain. */
4977 break; /* No DIEs needed for fundamental types. */
4979 case LANG_TYPE: /* No Dwarf representation currently defined. */
4986 TREE_ASM_WRITTEN (type) = 1;
4990 output_tagged_type_instantiation (type)
4993 if (type == 0 || type == error_mark_node)
4996 /* We are going to output a DIE to represent the unqualified version of
4997 this type (i.e. without any const or volatile qualifiers) so make
4998 sure that we have the main variant (i.e. the unqualified version) of
5001 if (type != type_main_variant (type))
5004 if (!TREE_ASM_WRITTEN (type))
5007 switch (TREE_CODE (type))
5013 output_die (output_inlined_enumeration_type_die, type);
5017 output_die (output_inlined_structure_type_die, type);
5021 case QUAL_UNION_TYPE:
5022 output_die (output_inlined_union_type_die, type);
5026 abort (); /* Should never happen. */
5030 /* Output a TAG_lexical_block DIE followed by DIEs to represent all of
5031 the things which are local to the given block. */
5034 output_block (stmt, depth)
5038 int must_output_die = 0;
5040 enum tree_code origin_code;
5042 /* Ignore blocks never really used to make RTL. */
5044 if (! stmt || ! TREE_USED (stmt)
5045 || (!TREE_ASM_WRITTEN (stmt) && !BLOCK_ABSTRACT (stmt)))
5048 /* Determine the "ultimate origin" of this block. This block may be an
5049 inlined instance of an inlined instance of inline function, so we
5050 have to trace all of the way back through the origin chain to find
5051 out what sort of node actually served as the original seed for the
5052 creation of the current block. */
5054 origin = block_ultimate_origin (stmt);
5055 origin_code = (origin != NULL) ? TREE_CODE (origin) : ERROR_MARK;
5057 /* Determine if we need to output any Dwarf DIEs at all to represent this
5060 if (origin_code == FUNCTION_DECL)
5061 /* The outer scopes for inlinings *must* always be represented. We
5062 generate TAG_inlined_subroutine DIEs for them. (See below.) */
5063 must_output_die = 1;
5066 /* In the case where the current block represents an inlining of the
5067 "body block" of an inline function, we must *NOT* output any DIE
5068 for this block because we have already output a DIE to represent
5069 the whole inlined function scope and the "body block" of any
5070 function doesn't really represent a different scope according to
5071 ANSI C rules. So we check here to make sure that this block does
5072 not represent a "body block inlining" before trying to set the
5073 `must_output_die' flag. */
5075 if (! is_body_block (origin ? origin : stmt))
5077 /* Determine if this block directly contains any "significant"
5078 local declarations which we will need to output DIEs for. */
5080 if (debug_info_level > DINFO_LEVEL_TERSE)
5081 /* We are not in terse mode so *any* local declaration counts
5082 as being a "significant" one. */
5083 must_output_die = (BLOCK_VARS (stmt) != NULL);
5088 /* We are in terse mode, so only local (nested) function
5089 definitions count as "significant" local declarations. */
5091 for (decl = BLOCK_VARS (stmt); decl; decl = TREE_CHAIN (decl))
5092 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl))
5094 must_output_die = 1;
5101 /* It would be a waste of space to generate a Dwarf TAG_lexical_block
5102 DIE for any block which contains no significant local declarations
5103 at all. Rather, in such cases we just call `output_decls_for_scope'
5104 so that any needed Dwarf info for any sub-blocks will get properly
5105 generated. Note that in terse mode, our definition of what constitutes
5106 a "significant" local declaration gets restricted to include only
5107 inlined function instances and local (nested) function definitions. */
5109 if (origin_code == FUNCTION_DECL && BLOCK_ABSTRACT (stmt))
5110 /* We don't care about an abstract inlined subroutine. */;
5111 else if (must_output_die)
5113 output_die ((origin_code == FUNCTION_DECL)
5114 ? output_inlined_subroutine_die
5115 : output_lexical_block_die,
5117 output_decls_for_scope (stmt, depth);
5118 end_sibling_chain ();
5121 output_decls_for_scope (stmt, depth);
5124 /* Output all of the decls declared within a given scope (also called
5125 a `binding contour') and (recursively) all of it's sub-blocks. */
5128 output_decls_for_scope (stmt, depth)
5132 /* Ignore blocks never really used to make RTL. */
5134 if (! stmt || ! TREE_USED (stmt))
5137 /* Output the DIEs to represent all of the data objects, functions,
5138 typedefs, and tagged types declared directly within this block
5139 but not within any nested sub-blocks. */
5144 for (decl = BLOCK_VARS (stmt); decl; decl = TREE_CHAIN (decl))
5145 output_decl (decl, stmt);
5148 output_pending_types_for_scope (stmt);
5150 /* Output the DIEs to represent all sub-blocks (and the items declared
5151 therein) of this block. */
5156 for (subblocks = BLOCK_SUBBLOCKS (stmt);
5158 subblocks = BLOCK_CHAIN (subblocks))
5159 output_block (subblocks, depth + 1);
5163 /* Is this a typedef we can avoid emitting? */
5166 is_redundant_typedef (decl)
5169 if (TYPE_DECL_IS_STUB (decl))
5171 if (DECL_ARTIFICIAL (decl)
5172 && DECL_CONTEXT (decl)
5173 && is_tagged_type (DECL_CONTEXT (decl))
5174 && TREE_CODE (TYPE_NAME (DECL_CONTEXT (decl))) == TYPE_DECL
5175 && DECL_NAME (decl) == DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl))))
5176 /* Also ignore the artificial member typedef for the class name. */
5181 /* Output Dwarf .debug information for a decl described by DECL. */
5184 output_decl (decl, containing_scope)
5186 tree containing_scope;
5188 /* Make a note of the decl node we are going to be working on. We may
5189 need to give the user the source coordinates of where it appeared in
5190 case we notice (later on) that something about it looks screwy. */
5192 dwarf_last_decl = decl;
5194 if (TREE_CODE (decl) == ERROR_MARK)
5197 /* If a structure is declared within an initialization, e.g. as the
5198 operand of a sizeof, then it will not have a name. We don't want
5199 to output a DIE for it, as the tree nodes are in the temporary obstack */
5201 if ((TREE_CODE (TREE_TYPE (decl)) == RECORD_TYPE
5202 || TREE_CODE (TREE_TYPE (decl)) == UNION_TYPE)
5203 && ((DECL_NAME (decl) == 0 && TYPE_NAME (TREE_TYPE (decl)) == 0)
5204 || (TYPE_FIELDS (TREE_TYPE (decl))
5205 && (TREE_CODE (TYPE_FIELDS (TREE_TYPE (decl))) == ERROR_MARK))))
5208 /* If this ..._DECL node is marked to be ignored, then ignore it. */
5210 if (DECL_IGNORED_P (decl))
5213 switch (TREE_CODE (decl))
5216 /* The individual enumerators of an enum type get output when we
5217 output the Dwarf representation of the relevant enum type itself. */
5221 /* If we are in terse mode, don't output any DIEs to represent
5222 mere function declarations. Also, if we are conforming
5223 to the DWARF version 1 specification, don't output DIEs for
5224 mere function declarations. */
5226 if (DECL_INITIAL (decl) == NULL_TREE)
5227 #if (DWARF_VERSION > 1)
5228 if (debug_info_level <= DINFO_LEVEL_TERSE)
5232 /* Before we describe the FUNCTION_DECL itself, make sure that we
5233 have described its return type. */
5235 output_type (TREE_TYPE (TREE_TYPE (decl)), containing_scope);
5238 /* And its containing type. */
5239 register tree origin = decl_class_context (decl);
5241 output_type (origin, containing_scope);
5244 /* If we're emitting an out-of-line copy of an inline function,
5245 set up to refer to the abstract instance emitted from
5246 dwarfout_deferred_inline_function. */
5247 if (DECL_INLINE (decl) && ! DECL_ABSTRACT (decl)
5248 && ! (containing_scope && TYPE_P (containing_scope)))
5249 set_decl_origin_self (decl);
5251 /* If the following DIE will represent a function definition for a
5252 function with "extern" linkage, output a special "pubnames" DIE
5253 label just ahead of the actual DIE. A reference to this label
5254 was already generated in the .debug_pubnames section sub-entry
5255 for this function definition. */
5257 if (TREE_PUBLIC (decl))
5259 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5261 sprintf (label, PUB_DIE_LABEL_FMT, next_pubname_number++);
5262 ASM_OUTPUT_LABEL (asm_out_file, label);
5265 /* Now output a DIE to represent the function itself. */
5267 output_die (TREE_PUBLIC (decl) || DECL_EXTERNAL (decl)
5268 ? output_global_subroutine_die
5269 : output_local_subroutine_die,
5272 /* Now output descriptions of the arguments for this function.
5273 This gets (unnecessarily?) complex because of the fact that
5274 the DECL_ARGUMENT list for a FUNCTION_DECL doesn't indicate
5275 cases where there was a trailing `...' at the end of the formal
5276 parameter list. In order to find out if there was a trailing
5277 ellipsis or not, we must instead look at the type associated
5278 with the FUNCTION_DECL. This will be a node of type FUNCTION_TYPE.
5279 If the chain of type nodes hanging off of this FUNCTION_TYPE node
5280 ends with a void_type_node then there should *not* be an ellipsis
5283 /* In the case where we are describing a mere function declaration, all
5284 we need to do here (and all we *can* do here) is to describe
5285 the *types* of its formal parameters. */
5287 if (decl != current_function_decl || in_class)
5288 output_formal_types (TREE_TYPE (decl));
5291 /* Generate DIEs to represent all known formal parameters */
5293 tree arg_decls = DECL_ARGUMENTS (decl);
5296 /* WARNING! Kludge zone ahead! Here we have a special
5297 hack for svr4 SDB compatibility. Instead of passing the
5298 current FUNCTION_DECL node as the second parameter (i.e.
5299 the `containing_scope' parameter) to `output_decl' (as
5300 we ought to) we instead pass a pointer to our own private
5301 fake_containing_scope node. That node is a RECORD_TYPE
5302 node which NO OTHER TYPE may ever actually be a member of.
5304 This pointer will ultimately get passed into `output_type'
5305 as its `containing_scope' parameter. `Output_type' will
5306 then perform its part in the hack... i.e. it will pend
5307 the type of the formal parameter onto the pending_types
5308 list. Later on, when we are done generating the whole
5309 sequence of formal parameter DIEs for this function
5310 definition, we will un-pend all previously pended types
5311 of formal parameters for this function definition.
5313 This whole kludge prevents any type DIEs from being
5314 mixed in with the formal parameter DIEs. That's good
5315 because svr4 SDB believes that the list of formal
5316 parameter DIEs for a function ends wherever the first
5317 non-formal-parameter DIE appears. Thus, we have to
5318 keep the formal parameter DIEs segregated. They must
5319 all appear (consecutively) at the start of the list of
5320 children for the DIE representing the function definition.
5321 Then (and only then) may we output any additional DIEs
5322 needed to represent the types of these formal parameters.
5326 When generating DIEs, generate the unspecified_parameters
5327 DIE instead if we come across the arg "__builtin_va_alist"
5330 for (parm = arg_decls; parm; parm = TREE_CHAIN (parm))
5331 if (TREE_CODE (parm) == PARM_DECL)
5333 if (DECL_NAME(parm) &&
5334 !strcmp(IDENTIFIER_POINTER(DECL_NAME(parm)),
5335 "__builtin_va_alist") )
5336 output_die (output_unspecified_parameters_die, decl);
5338 output_decl (parm, fake_containing_scope);
5342 Now that we have finished generating all of the DIEs to
5343 represent the formal parameters themselves, force out
5344 any DIEs needed to represent their types. We do this
5345 simply by un-pending all previously pended types which
5346 can legitimately go into the chain of children DIEs for
5347 the current FUNCTION_DECL.
5350 output_pending_types_for_scope (decl);
5353 Decide whether we need an unspecified_parameters DIE at the end.
5354 There are 2 more cases to do this for:
5355 1) the ansi ... declaration - this is detectable when the end
5356 of the arg list is not a void_type_node
5357 2) an unprototyped function declaration (not a definition). This
5358 just means that we have no info about the parameters at all.
5362 tree fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
5366 /* this is the prototyped case, check for ... */
5367 if (TREE_VALUE (tree_last (fn_arg_types)) != void_type_node)
5368 output_die (output_unspecified_parameters_die, decl);
5372 /* this is unprototyped, check for undefined (just declaration) */
5373 if (!DECL_INITIAL (decl))
5374 output_die (output_unspecified_parameters_die, decl);
5378 /* Output Dwarf info for all of the stuff within the body of the
5379 function (if it has one - it may be just a declaration). */
5382 tree outer_scope = DECL_INITIAL (decl);
5384 if (outer_scope && TREE_CODE (outer_scope) != ERROR_MARK)
5386 /* Note that here, `outer_scope' is a pointer to the outermost
5387 BLOCK node created to represent a function.
5388 This outermost BLOCK actually represents the outermost
5389 binding contour for the function, i.e. the contour in which
5390 the function's formal parameters and labels get declared.
5392 Curiously, it appears that the front end doesn't actually
5393 put the PARM_DECL nodes for the current function onto the
5394 BLOCK_VARS list for this outer scope. (They are strung
5395 off of the DECL_ARGUMENTS list for the function instead.)
5396 The BLOCK_VARS list for the `outer_scope' does provide us
5397 with a list of the LABEL_DECL nodes for the function however,
5398 and we output DWARF info for those here.
5400 Just within the `outer_scope' there will be a BLOCK node
5401 representing the function's outermost pair of curly braces,
5402 and any blocks used for the base and member initializers of
5403 a C++ constructor function. */
5405 output_decls_for_scope (outer_scope, 0);
5407 /* Finally, force out any pending types which are local to the
5408 outermost block of this function definition. These will
5409 all have a TYPE_CONTEXT which points to the FUNCTION_DECL
5412 output_pending_types_for_scope (decl);
5417 /* Generate a terminator for the list of stuff `owned' by this
5420 end_sibling_chain ();
5425 /* If we are in terse mode, don't generate any DIEs to represent
5426 any actual typedefs. Note that even when we are in terse mode,
5427 we must still output DIEs to represent those tagged types which
5428 are used (directly or indirectly) in the specification of either
5429 a return type or a formal parameter type of some function. */
5431 if (debug_info_level <= DINFO_LEVEL_TERSE)
5432 if (! TYPE_DECL_IS_STUB (decl)
5433 || (! TYPE_USED_FOR_FUNCTION (TREE_TYPE (decl)) && ! in_class))
5436 /* In the special case of a TYPE_DECL node representing
5437 the declaration of some type tag, if the given TYPE_DECL is
5438 marked as having been instantiated from some other (original)
5439 TYPE_DECL node (e.g. one which was generated within the original
5440 definition of an inline function) we have to generate a special
5441 (abbreviated) TAG_structure_type, TAG_union_type, or
5442 TAG_enumeration-type DIE here. */
5444 if (TYPE_DECL_IS_STUB (decl) && DECL_ABSTRACT_ORIGIN (decl))
5446 output_tagged_type_instantiation (TREE_TYPE (decl));
5450 output_type (TREE_TYPE (decl), containing_scope);
5452 if (! is_redundant_typedef (decl))
5453 /* Output a DIE to represent the typedef itself. */
5454 output_die (output_typedef_die, decl);
5458 if (debug_info_level >= DINFO_LEVEL_NORMAL)
5459 output_die (output_label_die, decl);
5463 /* If we are conforming to the DWARF version 1 specification, don't
5464 generated any DIEs to represent mere external object declarations. */
5466 #if (DWARF_VERSION <= 1)
5467 if (DECL_EXTERNAL (decl) && ! TREE_PUBLIC (decl))
5471 /* If we are in terse mode, don't generate any DIEs to represent
5472 any variable declarations or definitions. */
5474 if (debug_info_level <= DINFO_LEVEL_TERSE)
5477 /* Output any DIEs that are needed to specify the type of this data
5480 output_type (TREE_TYPE (decl), containing_scope);
5483 /* And its containing type. */
5484 register tree origin = decl_class_context (decl);
5486 output_type (origin, containing_scope);
5489 /* If the following DIE will represent a data object definition for a
5490 data object with "extern" linkage, output a special "pubnames" DIE
5491 label just ahead of the actual DIE. A reference to this label
5492 was already generated in the .debug_pubnames section sub-entry
5493 for this data object definition. */
5495 if (TREE_PUBLIC (decl) && ! DECL_ABSTRACT (decl))
5497 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5499 sprintf (label, PUB_DIE_LABEL_FMT, next_pubname_number++);
5500 ASM_OUTPUT_LABEL (asm_out_file, label);
5503 /* Now output the DIE to represent the data object itself. This gets
5504 complicated because of the possibility that the VAR_DECL really
5505 represents an inlined instance of a formal parameter for an inline
5509 void (*func) PARAMS ((void *));
5510 register tree origin = decl_ultimate_origin (decl);
5512 if (origin != NULL && TREE_CODE (origin) == PARM_DECL)
5513 func = output_formal_parameter_die;
5516 if (TREE_PUBLIC (decl) || DECL_EXTERNAL (decl))
5517 func = output_global_variable_die;
5519 func = output_local_variable_die;
5521 output_die (func, decl);
5526 /* Ignore the nameless fields that are used to skip bits. */
5527 if (DECL_NAME (decl) != 0)
5529 output_type (member_declared_type (decl), containing_scope);
5530 output_die (output_member_die, decl);
5535 /* Force out the type of this formal, if it was not forced out yet.
5536 Note that here we can run afoul of a bug in "classic" svr4 SDB.
5537 It should be able to grok the presence of type DIEs within a list
5538 of TAG_formal_parameter DIEs, but it doesn't. */
5540 output_type (TREE_TYPE (decl), containing_scope);
5541 output_die (output_formal_parameter_die, decl);
5544 case NAMESPACE_DECL:
5545 /* Ignore for now. */
5553 /* Output debug information for a function. */
5555 dwarfout_function_decl (decl)
5558 dwarfout_file_scope_decl (decl, 0);
5561 /* Debug information for a global DECL. Called from toplev.c after
5562 compilation proper has finished. */
5564 dwarfout_global_decl (decl)
5567 /* Output DWARF information for file-scope tentative data object
5568 declarations, file-scope (extern) function declarations (which
5569 had no corresponding body) and file-scope tagged type
5570 declarations and definitions which have not yet been forced out. */
5572 if (TREE_CODE (decl) != FUNCTION_DECL || !DECL_INITIAL (decl))
5573 dwarfout_file_scope_decl (decl, 1);
5576 /* DECL is an inline function, whose body is present, but which is not
5577 being output at this point. (We're putting that off until we need
5580 dwarfout_deferred_inline_function (decl)
5583 /* Generate the DWARF info for the "abstract" instance of a function
5584 which we may later generate inlined and/or out-of-line instances
5586 if ((DECL_INLINE (decl) || DECL_ABSTRACT (decl))
5587 && ! DECL_ABSTRACT_ORIGIN (decl))
5589 /* The front-end may not have set CURRENT_FUNCTION_DECL, but the
5590 DWARF code expects it to be set in this case. Intuitively,
5591 DECL is the function we just finished defining, so setting
5592 CURRENT_FUNCTION_DECL is sensible. */
5593 tree saved_cfd = current_function_decl;
5594 int was_abstract = DECL_ABSTRACT (decl);
5595 current_function_decl = decl;
5597 /* Let the DWARF code do its work. */
5598 set_decl_abstract_flags (decl, 1);
5599 dwarfout_file_scope_decl (decl, 0);
5601 set_decl_abstract_flags (decl, 0);
5603 /* Reset CURRENT_FUNCTION_DECL. */
5604 current_function_decl = saved_cfd;
5609 dwarfout_file_scope_decl (decl, set_finalizing)
5613 if (TREE_CODE (decl) == ERROR_MARK)
5616 /* If this ..._DECL node is marked to be ignored, then ignore it. */
5618 if (DECL_IGNORED_P (decl))
5621 switch (TREE_CODE (decl))
5625 /* Ignore this FUNCTION_DECL if it refers to a builtin declaration of
5626 a builtin function. Explicit programmer-supplied declarations of
5627 these same functions should NOT be ignored however. */
5629 if (DECL_EXTERNAL (decl) && DECL_FUNCTION_CODE (decl))
5632 /* What we would really like to do here is to filter out all mere
5633 file-scope declarations of file-scope functions which are never
5634 referenced later within this translation unit (and keep all of
5635 ones that *are* referenced later on) but we aren't clairvoyant,
5636 so we have no idea which functions will be referenced in the
5637 future (i.e. later on within the current translation unit).
5638 So here we just ignore all file-scope function declarations
5639 which are not also definitions. If and when the debugger needs
5640 to know something about these functions, it will have to hunt
5641 around and find the DWARF information associated with the
5642 *definition* of the function.
5644 Note that we can't just check `DECL_EXTERNAL' to find out which
5645 FUNCTION_DECL nodes represent definitions and which ones represent
5646 mere declarations. We have to check `DECL_INITIAL' instead. That's
5647 because the C front-end supports some weird semantics for "extern
5648 inline" function definitions. These can get inlined within the
5649 current translation unit (an thus, we need to generate DWARF info
5650 for their abstract instances so that the DWARF info for the
5651 concrete inlined instances can have something to refer to) but
5652 the compiler never generates any out-of-lines instances of such
5653 things (despite the fact that they *are* definitions). The
5654 important point is that the C front-end marks these "extern inline"
5655 functions as DECL_EXTERNAL, but we need to generate DWARF for them
5658 Note that the C++ front-end also plays some similar games for inline
5659 function definitions appearing within include files which also
5660 contain `#pragma interface' pragmas. */
5662 if (DECL_INITIAL (decl) == NULL_TREE)
5665 if (TREE_PUBLIC (decl)
5666 && ! DECL_EXTERNAL (decl)
5667 && ! DECL_ABSTRACT (decl))
5669 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5671 /* Output a .debug_pubnames entry for a public function
5672 defined in this compilation unit. */
5674 fputc ('\n', asm_out_file);
5675 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_PUBNAMES_SECTION);
5676 sprintf (label, PUB_DIE_LABEL_FMT, next_pubname_number);
5677 ASM_OUTPUT_DWARF_ADDR (asm_out_file, label);
5678 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file,
5679 IDENTIFIER_POINTER (DECL_NAME (decl)));
5680 ASM_OUTPUT_POP_SECTION (asm_out_file);
5687 /* Ignore this VAR_DECL if it refers to a file-scope extern data
5688 object declaration and if the declaration was never even
5689 referenced from within this entire compilation unit. We
5690 suppress these DIEs in order to save space in the .debug section
5691 (by eliminating entries which are probably useless). Note that
5692 we must not suppress block-local extern declarations (whether
5693 used or not) because that would screw-up the debugger's name
5694 lookup mechanism and cause it to miss things which really ought
5695 to be in scope at a given point. */
5697 if (DECL_EXTERNAL (decl) && !TREE_USED (decl))
5700 if (TREE_PUBLIC (decl)
5701 && ! DECL_EXTERNAL (decl)
5702 && GET_CODE (DECL_RTL (decl)) == MEM
5703 && ! DECL_ABSTRACT (decl))
5705 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5707 if (debug_info_level >= DINFO_LEVEL_NORMAL)
5709 /* Output a .debug_pubnames entry for a public variable
5710 defined in this compilation unit. */
5712 fputc ('\n', asm_out_file);
5713 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_PUBNAMES_SECTION);
5714 sprintf (label, PUB_DIE_LABEL_FMT, next_pubname_number);
5715 ASM_OUTPUT_DWARF_ADDR (asm_out_file, label);
5716 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file,
5717 IDENTIFIER_POINTER (DECL_NAME (decl)));
5718 ASM_OUTPUT_POP_SECTION (asm_out_file);
5721 if (DECL_INITIAL (decl) == NULL)
5723 /* Output a .debug_aranges entry for a public variable
5724 which is tentatively defined in this compilation unit. */
5726 fputc ('\n', asm_out_file);
5727 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_ARANGES_SECTION);
5728 ASM_OUTPUT_DWARF_ADDR (asm_out_file,
5729 IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)));
5730 ASM_OUTPUT_DWARF_DATA4 (asm_out_file,
5731 (unsigned) int_size_in_bytes (TREE_TYPE (decl)));
5732 ASM_OUTPUT_POP_SECTION (asm_out_file);
5736 /* If we are in terse mode, don't generate any DIEs to represent
5737 any variable declarations or definitions. */
5739 if (debug_info_level <= DINFO_LEVEL_TERSE)
5745 /* Don't bother trying to generate any DIEs to represent any of the
5746 normal built-in types for the language we are compiling, except
5747 in cases where the types in question are *not* DWARF fundamental
5748 types. We make an exception in the case of non-fundamental types
5749 for the sake of objective C (and perhaps C++) because the GNU
5750 front-ends for these languages may in fact create certain "built-in"
5751 types which are (for example) RECORD_TYPEs. In such cases, we
5752 really need to output these (non-fundamental) types because other
5753 DIEs may contain references to them. */
5755 /* Also ignore language dependent types here, because they are probably
5756 also built-in types. If we didn't ignore them, then we would get
5757 references to undefined labels because output_type doesn't support
5758 them. So, for now, we need to ignore them to avoid assembler
5761 /* ??? This code is different than the equivalent code in dwarf2out.c.
5762 The dwarf2out.c code is probably more correct. */
5764 if (DECL_SOURCE_LINE (decl) == 0
5765 && (type_is_fundamental (TREE_TYPE (decl))
5766 || TREE_CODE (TREE_TYPE (decl)) == LANG_TYPE))
5769 /* If we are in terse mode, don't generate any DIEs to represent
5770 any actual typedefs. Note that even when we are in terse mode,
5771 we must still output DIEs to represent those tagged types which
5772 are used (directly or indirectly) in the specification of either
5773 a return type or a formal parameter type of some function. */
5775 if (debug_info_level <= DINFO_LEVEL_TERSE)
5776 if (! TYPE_DECL_IS_STUB (decl)
5777 || ! TYPE_USED_FOR_FUNCTION (TREE_TYPE (decl)))
5786 fputc ('\n', asm_out_file);
5787 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_SECTION);
5788 finalizing = set_finalizing;
5789 output_decl (decl, NULL_TREE);
5791 /* NOTE: The call above to `output_decl' may have caused one or more
5792 file-scope named types (i.e. tagged types) to be placed onto the
5793 pending_types_list. We have to get those types off of that list
5794 at some point, and this is the perfect time to do it. If we didn't
5795 take them off now, they might still be on the list when cc1 finally
5796 exits. That might be OK if it weren't for the fact that when we put
5797 types onto the pending_types_list, we set the TREE_ASM_WRITTEN flag
5798 for these types, and that causes them never to be output unless
5799 `output_pending_types_for_scope' takes them off of the list and un-sets
5800 their TREE_ASM_WRITTEN flags. */
5802 output_pending_types_for_scope (NULL_TREE);
5804 /* The above call should have totally emptied the pending_types_list
5805 if this is not a nested function or class. If this is a nested type,
5806 then the remaining pending_types will be emitted when the containing type
5809 if (! DECL_CONTEXT (decl))
5811 if (pending_types != 0)
5815 ASM_OUTPUT_POP_SECTION (asm_out_file);
5817 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_INITIAL (decl) != NULL)
5818 current_funcdef_number++;
5821 /* Output a marker (i.e. a label) for the beginning of the generated code
5822 for a lexical block. */
5825 dwarfout_begin_block (line, blocknum)
5826 unsigned int line ATTRIBUTE_UNUSED;
5827 unsigned int blocknum;
5829 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5831 function_section (current_function_decl);
5832 sprintf (label, BLOCK_BEGIN_LABEL_FMT, blocknum);
5833 ASM_OUTPUT_LABEL (asm_out_file, label);
5836 /* Output a marker (i.e. a label) for the end of the generated code
5837 for a lexical block. */
5840 dwarfout_end_block (line, blocknum)
5841 unsigned int line ATTRIBUTE_UNUSED;
5842 unsigned int blocknum;
5844 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5846 function_section (current_function_decl);
5847 sprintf (label, BLOCK_END_LABEL_FMT, blocknum);
5848 ASM_OUTPUT_LABEL (asm_out_file, label);
5851 /* Output a marker (i.e. a label) for the point in the generated code where
5852 the real body of the function begins (after parameters have been moved
5853 to their home locations). */
5856 dwarfout_end_prologue (line)
5857 unsigned int line ATTRIBUTE_UNUSED;
5859 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5861 if (! use_gnu_debug_info_extensions)
5864 function_section (current_function_decl);
5865 sprintf (label, BODY_BEGIN_LABEL_FMT, current_funcdef_number);
5866 ASM_OUTPUT_LABEL (asm_out_file, label);
5869 /* Output a marker (i.e. a label) for the point in the generated code where
5870 the real body of the function ends (just before the epilogue code). */
5873 dwarfout_end_function (line)
5874 unsigned int line ATTRIBUTE_UNUSED;
5876 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5878 if (! use_gnu_debug_info_extensions)
5880 function_section (current_function_decl);
5881 sprintf (label, BODY_END_LABEL_FMT, current_funcdef_number);
5882 ASM_OUTPUT_LABEL (asm_out_file, label);
5885 /* Output a marker (i.e. a label) for the absolute end of the generated code
5886 for a function definition. This gets called *after* the epilogue code
5887 has been generated. */
5890 dwarfout_end_epilogue ()
5892 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5894 /* Output a label to mark the endpoint of the code generated for this
5897 sprintf (label, FUNC_END_LABEL_FMT, current_funcdef_number);
5898 ASM_OUTPUT_LABEL (asm_out_file, label);
5902 shuffle_filename_entry (new_zeroth)
5903 filename_entry *new_zeroth;
5905 filename_entry temp_entry;
5906 filename_entry *limit_p;
5907 filename_entry *move_p;
5909 if (new_zeroth == &filename_table[0])
5912 temp_entry = *new_zeroth;
5914 /* Shift entries up in the table to make room at [0]. */
5916 limit_p = &filename_table[0];
5917 for (move_p = new_zeroth; move_p > limit_p; move_p--)
5918 *move_p = *(move_p-1);
5920 /* Install the found entry at [0]. */
5922 filename_table[0] = temp_entry;
5925 /* Create a new (string) entry for the .debug_sfnames section. */
5928 generate_new_sfname_entry ()
5930 char label[MAX_ARTIFICIAL_LABEL_BYTES];
5932 fputc ('\n', asm_out_file);
5933 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_SFNAMES_SECTION);
5934 sprintf (label, SFNAMES_ENTRY_LABEL_FMT, filename_table[0].number);
5935 ASM_OUTPUT_LABEL (asm_out_file, label);
5936 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file,
5937 filename_table[0].name
5938 ? filename_table[0].name
5940 ASM_OUTPUT_POP_SECTION (asm_out_file);
5943 /* Lookup a filename (in the list of filenames that we know about here in
5944 dwarfout.c) and return its "index". The index of each (known) filename
5945 is just a unique number which is associated with only that one filename.
5946 We need such numbers for the sake of generating labels (in the
5947 .debug_sfnames section) and references to those unique labels (in the
5948 .debug_srcinfo and .debug_macinfo sections).
5950 If the filename given as an argument is not found in our current list,
5951 add it to the list and assign it the next available unique index number.
5953 Whatever we do (i.e. whether we find a pre-existing filename or add a new
5954 one), we shuffle the filename found (or added) up to the zeroth entry of
5955 our list of filenames (which is always searched linearly). We do this so
5956 as to optimize the most common case for these filename lookups within
5957 dwarfout.c. The most common case by far is the case where we call
5958 lookup_filename to lookup the very same filename that we did a lookup
5959 on the last time we called lookup_filename. We make sure that this
5960 common case is fast because such cases will constitute 99.9% of the
5961 lookups we ever do (in practice).
5963 If we add a new filename entry to our table, we go ahead and generate
5964 the corresponding entry in the .debug_sfnames section right away.
5965 Doing so allows us to avoid tickling an assembler bug (present in some
5966 m68k assemblers) which yields assembly-time errors in cases where the
5967 difference of two label addresses is taken and where the two labels
5968 are in a section *other* than the one where the difference is being
5969 calculated, and where at least one of the two symbol references is a
5970 forward reference. (This bug could be tickled by our .debug_srcinfo
5971 entries if we don't output their corresponding .debug_sfnames entries
5975 lookup_filename (file_name)
5976 const char *file_name;
5978 filename_entry *search_p;
5979 filename_entry *limit_p = &filename_table[ft_entries];
5981 for (search_p = filename_table; search_p < limit_p; search_p++)
5982 if (!strcmp (file_name, search_p->name))
5984 /* When we get here, we have found the filename that we were
5985 looking for in the filename_table. Now we want to make sure
5986 that it gets moved to the zero'th entry in the table (if it
5987 is not already there) so that subsequent attempts to find the
5988 same filename will find it as quickly as possible. */
5990 shuffle_filename_entry (search_p);
5991 return filename_table[0].number;
5994 /* We come here whenever we have a new filename which is not registered
5995 in the current table. Here we add it to the table. */
5997 /* Prepare to add a new table entry by making sure there is enough space
5998 in the table to do so. If not, expand the current table. */
6000 if (ft_entries == ft_entries_allocated)
6002 ft_entries_allocated += FT_ENTRIES_INCREMENT;
6004 = (filename_entry *)
6005 xrealloc (filename_table,
6006 ft_entries_allocated * sizeof (filename_entry));
6009 /* Initially, add the new entry at the end of the filename table. */
6011 filename_table[ft_entries].number = ft_entries;
6012 filename_table[ft_entries].name = xstrdup (file_name);
6014 /* Shuffle the new entry into filename_table[0]. */
6016 shuffle_filename_entry (&filename_table[ft_entries]);
6018 if (debug_info_level >= DINFO_LEVEL_NORMAL)
6019 generate_new_sfname_entry ();
6022 return filename_table[0].number;
6026 generate_srcinfo_entry (line_entry_num, files_entry_num)
6027 unsigned line_entry_num;
6028 unsigned files_entry_num;
6030 char label[MAX_ARTIFICIAL_LABEL_BYTES];
6032 fputc ('\n', asm_out_file);
6033 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_SRCINFO_SECTION);
6034 sprintf (label, LINE_ENTRY_LABEL_FMT, line_entry_num);
6035 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, label, LINE_BEGIN_LABEL);
6036 sprintf (label, SFNAMES_ENTRY_LABEL_FMT, files_entry_num);
6037 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, label, SFNAMES_BEGIN_LABEL);
6038 ASM_OUTPUT_POP_SECTION (asm_out_file);
6042 dwarfout_source_line (line, filename)
6044 const char *filename;
6046 if (debug_info_level >= DINFO_LEVEL_NORMAL
6047 /* We can't emit line number info for functions in separate sections,
6048 because the assembler can't subtract labels in different sections. */
6049 && DECL_SECTION_NAME (current_function_decl) == NULL_TREE)
6051 char label[MAX_ARTIFICIAL_LABEL_BYTES];
6052 static unsigned last_line_entry_num = 0;
6053 static unsigned prev_file_entry_num = (unsigned) -1;
6054 unsigned this_file_entry_num;
6056 function_section (current_function_decl);
6057 sprintf (label, LINE_CODE_LABEL_FMT, ++last_line_entry_num);
6058 ASM_OUTPUT_LABEL (asm_out_file, label);
6060 fputc ('\n', asm_out_file);
6062 if (use_gnu_debug_info_extensions)
6063 this_file_entry_num = lookup_filename (filename);
6065 this_file_entry_num = (unsigned) -1;
6067 ASM_OUTPUT_PUSH_SECTION (asm_out_file, LINE_SECTION);
6068 if (this_file_entry_num != prev_file_entry_num)
6070 char line_entry_label[MAX_ARTIFICIAL_LABEL_BYTES];
6072 sprintf (line_entry_label, LINE_ENTRY_LABEL_FMT, last_line_entry_num);
6073 ASM_OUTPUT_LABEL (asm_out_file, line_entry_label);
6077 const char *tail = strrchr (filename, '/');
6083 dw2_asm_output_data (4, line, "%s:%u", filename, line);
6084 ASM_OUTPUT_DWARF_DATA2 (asm_out_file, 0xffff);
6085 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, label, TEXT_BEGIN_LABEL);
6086 ASM_OUTPUT_POP_SECTION (asm_out_file);
6088 if (this_file_entry_num != prev_file_entry_num)
6089 generate_srcinfo_entry (last_line_entry_num, this_file_entry_num);
6090 prev_file_entry_num = this_file_entry_num;
6094 /* Generate an entry in the .debug_macinfo section. */
6097 generate_macinfo_entry (type, offset, string)
6102 if (! use_gnu_debug_info_extensions)
6105 fputc ('\n', asm_out_file);
6106 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_MACINFO_SECTION);
6107 assemble_integer (gen_rtx_PLUS (SImode, GEN_INT (type << 24), offset),
6108 4, BITS_PER_UNIT, 1);
6109 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, string);
6110 ASM_OUTPUT_POP_SECTION (asm_out_file);
6113 /* Wrapper for toplev.c callback to check debug info level. */
6115 dwarfout_start_source_file_check (line, filename)
6117 const char *filename;
6119 if (debug_info_level == DINFO_LEVEL_VERBOSE)
6120 dwarfout_start_source_file (line, filename);
6124 dwarfout_start_source_file (line, filename)
6125 unsigned int line ATTRIBUTE_UNUSED;
6126 const char *filename;
6128 char label[MAX_ARTIFICIAL_LABEL_BYTES];
6129 const char *label1, *label2;
6131 sprintf (label, SFNAMES_ENTRY_LABEL_FMT, lookup_filename (filename));
6132 label1 = (*label == '*') + label;
6133 label2 = (*SFNAMES_BEGIN_LABEL == '*') + SFNAMES_BEGIN_LABEL;
6134 generate_macinfo_entry (MACINFO_start,
6135 gen_rtx_MINUS (Pmode,
6136 gen_rtx_SYMBOL_REF (Pmode, label1),
6137 gen_rtx_SYMBOL_REF (Pmode, label2)),
6141 /* Wrapper for toplev.c callback to check debug info level. */
6143 dwarfout_end_source_file_check (lineno)
6146 if (debug_info_level == DINFO_LEVEL_VERBOSE)
6147 dwarfout_end_source_file (lineno);
6151 dwarfout_end_source_file (lineno)
6154 generate_macinfo_entry (MACINFO_resume, GEN_INT (lineno), "");
6157 /* Called from check_newline in c-parse.y. The `buffer' parameter
6158 contains the tail part of the directive line, i.e. the part which
6159 is past the initial whitespace, #, whitespace, directive-name,
6163 dwarfout_define (lineno, buffer)
6167 static int initialized = 0;
6171 dwarfout_start_source_file (0, primary_filename);
6174 generate_macinfo_entry (MACINFO_define, GEN_INT (lineno), buffer);
6177 /* Called from check_newline in c-parse.y. The `buffer' parameter
6178 contains the tail part of the directive line, i.e. the part which
6179 is past the initial whitespace, #, whitespace, directive-name,
6183 dwarfout_undef (lineno, buffer)
6187 generate_macinfo_entry (MACINFO_undef, GEN_INT (lineno), buffer);
6190 /* Set up for Dwarf output at the start of compilation. */
6193 dwarfout_init (main_input_filename)
6194 const char *main_input_filename;
6196 /* Remember the name of the primary input file. */
6198 primary_filename = main_input_filename;
6200 /* Allocate the initial hunk of the pending_sibling_stack. */
6202 pending_sibling_stack
6204 xmalloc (PENDING_SIBLINGS_INCREMENT * sizeof (unsigned));
6205 pending_siblings_allocated = PENDING_SIBLINGS_INCREMENT;
6206 pending_siblings = 1;
6208 /* Allocate the initial hunk of the filename_table. */
6211 = (filename_entry *)
6212 xmalloc (FT_ENTRIES_INCREMENT * sizeof (filename_entry));
6213 ft_entries_allocated = FT_ENTRIES_INCREMENT;
6216 /* Allocate the initial hunk of the pending_types_list. */
6219 = (tree *) xmalloc (PENDING_TYPES_INCREMENT * sizeof (tree));
6220 pending_types_allocated = PENDING_TYPES_INCREMENT;
6223 /* Create an artificial RECORD_TYPE node which we can use in our hack
6224 to get the DIEs representing types of formal parameters to come out
6225 only *after* the DIEs for the formal parameters themselves. */
6227 fake_containing_scope = make_node (RECORD_TYPE);
6229 /* Output a starting label for the .text section. */
6231 fputc ('\n', asm_out_file);
6232 ASM_OUTPUT_PUSH_SECTION (asm_out_file, TEXT_SECTION_NAME);
6233 ASM_OUTPUT_LABEL (asm_out_file, TEXT_BEGIN_LABEL);
6234 ASM_OUTPUT_POP_SECTION (asm_out_file);
6236 /* Output a starting label for the .data section. */
6238 fputc ('\n', asm_out_file);
6239 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DATA_SECTION_NAME);
6240 ASM_OUTPUT_LABEL (asm_out_file, DATA_BEGIN_LABEL);
6241 ASM_OUTPUT_POP_SECTION (asm_out_file);
6243 #if 0 /* GNU C doesn't currently use .data1. */
6244 /* Output a starting label for the .data1 section. */
6246 fputc ('\n', asm_out_file);
6247 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DATA1_SECTION_NAME);
6248 ASM_OUTPUT_LABEL (asm_out_file, DATA1_BEGIN_LABEL);
6249 ASM_OUTPUT_POP_SECTION (asm_out_file);
6252 /* Output a starting label for the .rodata section. */
6254 fputc ('\n', asm_out_file);
6255 ASM_OUTPUT_PUSH_SECTION (asm_out_file, RODATA_SECTION_NAME);
6256 ASM_OUTPUT_LABEL (asm_out_file, RODATA_BEGIN_LABEL);
6257 ASM_OUTPUT_POP_SECTION (asm_out_file);
6259 #if 0 /* GNU C doesn't currently use .rodata1. */
6260 /* Output a starting label for the .rodata1 section. */
6262 fputc ('\n', asm_out_file);
6263 ASM_OUTPUT_PUSH_SECTION (asm_out_file, RODATA1_SECTION_NAME);
6264 ASM_OUTPUT_LABEL (asm_out_file, RODATA1_BEGIN_LABEL);
6265 ASM_OUTPUT_POP_SECTION (asm_out_file);
6268 /* Output a starting label for the .bss section. */
6270 fputc ('\n', asm_out_file);
6271 ASM_OUTPUT_PUSH_SECTION (asm_out_file, BSS_SECTION_NAME);
6272 ASM_OUTPUT_LABEL (asm_out_file, BSS_BEGIN_LABEL);
6273 ASM_OUTPUT_POP_SECTION (asm_out_file);
6275 if (debug_info_level >= DINFO_LEVEL_NORMAL)
6277 if (use_gnu_debug_info_extensions)
6279 /* Output a starting label and an initial (compilation directory)
6280 entry for the .debug_sfnames section. The starting label will be
6281 referenced by the initial entry in the .debug_srcinfo section. */
6283 fputc ('\n', asm_out_file);
6284 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_SFNAMES_SECTION);
6285 ASM_OUTPUT_LABEL (asm_out_file, SFNAMES_BEGIN_LABEL);
6287 const char *pwd = getpwd ();
6291 fatal_io_error ("can't get current directory");
6293 dirname = concat (pwd, "/", NULL);
6294 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, dirname);
6297 ASM_OUTPUT_POP_SECTION (asm_out_file);
6300 if (debug_info_level >= DINFO_LEVEL_VERBOSE
6301 && use_gnu_debug_info_extensions)
6303 /* Output a starting label for the .debug_macinfo section. This
6304 label will be referenced by the AT_mac_info attribute in the
6305 TAG_compile_unit DIE. */
6307 fputc ('\n', asm_out_file);
6308 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_MACINFO_SECTION);
6309 ASM_OUTPUT_LABEL (asm_out_file, MACINFO_BEGIN_LABEL);
6310 ASM_OUTPUT_POP_SECTION (asm_out_file);
6313 /* Generate the initial entry for the .line section. */
6315 fputc ('\n', asm_out_file);
6316 ASM_OUTPUT_PUSH_SECTION (asm_out_file, LINE_SECTION);
6317 ASM_OUTPUT_LABEL (asm_out_file, LINE_BEGIN_LABEL);
6318 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, LINE_END_LABEL, LINE_BEGIN_LABEL);
6319 ASM_OUTPUT_DWARF_ADDR (asm_out_file, TEXT_BEGIN_LABEL);
6320 ASM_OUTPUT_POP_SECTION (asm_out_file);
6322 if (use_gnu_debug_info_extensions)
6324 /* Generate the initial entry for the .debug_srcinfo section. */
6326 fputc ('\n', asm_out_file);
6327 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_SRCINFO_SECTION);
6328 ASM_OUTPUT_LABEL (asm_out_file, SRCINFO_BEGIN_LABEL);
6329 ASM_OUTPUT_DWARF_ADDR (asm_out_file, LINE_BEGIN_LABEL);
6330 ASM_OUTPUT_DWARF_ADDR (asm_out_file, SFNAMES_BEGIN_LABEL);
6331 ASM_OUTPUT_DWARF_ADDR (asm_out_file, TEXT_BEGIN_LABEL);
6332 ASM_OUTPUT_DWARF_ADDR (asm_out_file, TEXT_END_LABEL);
6333 #ifdef DWARF_TIMESTAMPS
6334 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, time (NULL));
6336 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, -1);
6338 ASM_OUTPUT_POP_SECTION (asm_out_file);
6341 /* Generate the initial entry for the .debug_pubnames section. */
6343 fputc ('\n', asm_out_file);
6344 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_PUBNAMES_SECTION);
6345 ASM_OUTPUT_DWARF_ADDR (asm_out_file, DEBUG_BEGIN_LABEL);
6346 ASM_OUTPUT_POP_SECTION (asm_out_file);
6348 /* Generate the initial entry for the .debug_aranges section. */
6350 fputc ('\n', asm_out_file);
6351 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_ARANGES_SECTION);
6352 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file,
6353 DEBUG_ARANGES_END_LABEL,
6354 DEBUG_ARANGES_BEGIN_LABEL);
6355 ASM_OUTPUT_LABEL (asm_out_file, DEBUG_ARANGES_BEGIN_LABEL);
6356 ASM_OUTPUT_DWARF_DATA1 (asm_out_file, 1);
6357 ASM_OUTPUT_DWARF_ADDR (asm_out_file, DEBUG_BEGIN_LABEL);
6358 ASM_OUTPUT_POP_SECTION (asm_out_file);
6361 /* Setup first DIE number == 1. */
6362 NEXT_DIE_NUM = next_unused_dienum++;
6364 /* Generate the initial DIE for the .debug section. Note that the
6365 (string) value given in the AT_name attribute of the TAG_compile_unit
6366 DIE will (typically) be a relative pathname and that this pathname
6367 should be taken as being relative to the directory from which the
6368 compiler was invoked when the given (base) source file was compiled. */
6370 fputc ('\n', asm_out_file);
6371 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_SECTION);
6372 ASM_OUTPUT_LABEL (asm_out_file, DEBUG_BEGIN_LABEL);
6373 output_die (output_compile_unit_die, (PTR) main_input_filename);
6374 ASM_OUTPUT_POP_SECTION (asm_out_file);
6376 fputc ('\n', asm_out_file);
6379 /* Output stuff that dwarf requires at the end of every file. */
6382 dwarfout_finish (main_input_filename)
6383 const char *main_input_filename ATTRIBUTE_UNUSED;
6385 char label[MAX_ARTIFICIAL_LABEL_BYTES];
6387 fputc ('\n', asm_out_file);
6388 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_SECTION);
6389 retry_incomplete_types ();
6390 fputc ('\n', asm_out_file);
6392 /* Mark the end of the chain of siblings which represent all file-scope
6393 declarations in this compilation unit. */
6395 /* The (null) DIE which represents the terminator for the (sibling linked)
6396 list of file-scope items is *special*. Normally, we would just call
6397 end_sibling_chain at this point in order to output a word with the
6398 value `4' and that word would act as the terminator for the list of
6399 DIEs describing file-scope items. Unfortunately, if we were to simply
6400 do that, the label that would follow this DIE in the .debug section
6401 (i.e. `..D2') would *not* be properly aligned (as it must be on some
6402 machines) to a 4 byte boundary.
6404 In order to force the label `..D2' to get aligned to a 4 byte boundary,
6405 the trick used is to insert extra (otherwise useless) padding bytes
6406 into the (null) DIE that we know must precede the ..D2 label in the
6407 .debug section. The amount of padding required can be anywhere between
6408 0 and 3 bytes. The length word at the start of this DIE (i.e. the one
6409 with the padding) would normally contain the value 4, but now it will
6410 also have to include the padding bytes, so it will instead have some
6411 value in the range 4..7.
6413 Fortunately, the rules of Dwarf say that any DIE whose length word
6414 contains *any* value less than 8 should be treated as a null DIE, so
6415 this trick works out nicely. Clever, eh? Don't give me any credit
6416 (or blame). I didn't think of this scheme. I just conformed to it.
6419 output_die (output_padded_null_die, (void *) 0);
6422 sprintf (label, DIE_BEGIN_LABEL_FMT, NEXT_DIE_NUM);
6423 ASM_OUTPUT_LABEL (asm_out_file, label); /* should be ..D2 */
6424 ASM_OUTPUT_POP_SECTION (asm_out_file);
6426 /* Output a terminator label for the .text section. */
6428 fputc ('\n', asm_out_file);
6429 ASM_OUTPUT_PUSH_SECTION (asm_out_file, TEXT_SECTION_NAME);
6430 ASM_OUTPUT_LABEL (asm_out_file, TEXT_END_LABEL);
6431 ASM_OUTPUT_POP_SECTION (asm_out_file);
6433 /* Output a terminator label for the .data section. */
6435 fputc ('\n', asm_out_file);
6436 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DATA_SECTION_NAME);
6437 ASM_OUTPUT_LABEL (asm_out_file, DATA_END_LABEL);
6438 ASM_OUTPUT_POP_SECTION (asm_out_file);
6440 #if 0 /* GNU C doesn't currently use .data1. */
6441 /* Output a terminator label for the .data1 section. */
6443 fputc ('\n', asm_out_file);
6444 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DATA1_SECTION_NAME);
6445 ASM_OUTPUT_LABEL (asm_out_file, DATA1_END_LABEL);
6446 ASM_OUTPUT_POP_SECTION (asm_out_file);
6449 /* Output a terminator label for the .rodata section. */
6451 fputc ('\n', asm_out_file);
6452 ASM_OUTPUT_PUSH_SECTION (asm_out_file, RODATA_SECTION_NAME);
6453 ASM_OUTPUT_LABEL (asm_out_file, RODATA_END_LABEL);
6454 ASM_OUTPUT_POP_SECTION (asm_out_file);
6456 #if 0 /* GNU C doesn't currently use .rodata1. */
6457 /* Output a terminator label for the .rodata1 section. */
6459 fputc ('\n', asm_out_file);
6460 ASM_OUTPUT_PUSH_SECTION (asm_out_file, RODATA1_SECTION_NAME);
6461 ASM_OUTPUT_LABEL (asm_out_file, RODATA1_END_LABEL);
6462 ASM_OUTPUT_POP_SECTION (asm_out_file);
6465 /* Output a terminator label for the .bss section. */
6467 fputc ('\n', asm_out_file);
6468 ASM_OUTPUT_PUSH_SECTION (asm_out_file, BSS_SECTION_NAME);
6469 ASM_OUTPUT_LABEL (asm_out_file, BSS_END_LABEL);
6470 ASM_OUTPUT_POP_SECTION (asm_out_file);
6472 if (debug_info_level >= DINFO_LEVEL_NORMAL)
6474 /* Output a terminating entry for the .line section. */
6476 fputc ('\n', asm_out_file);
6477 ASM_OUTPUT_PUSH_SECTION (asm_out_file, LINE_SECTION);
6478 ASM_OUTPUT_LABEL (asm_out_file, LINE_LAST_ENTRY_LABEL);
6479 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, 0);
6480 ASM_OUTPUT_DWARF_DATA2 (asm_out_file, 0xffff);
6481 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, TEXT_END_LABEL, TEXT_BEGIN_LABEL);
6482 ASM_OUTPUT_LABEL (asm_out_file, LINE_END_LABEL);
6483 ASM_OUTPUT_POP_SECTION (asm_out_file);
6485 if (use_gnu_debug_info_extensions)
6487 /* Output a terminating entry for the .debug_srcinfo section. */
6489 fputc ('\n', asm_out_file);
6490 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_SRCINFO_SECTION);
6491 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file,
6492 LINE_LAST_ENTRY_LABEL, LINE_BEGIN_LABEL);
6493 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, -1);
6494 ASM_OUTPUT_POP_SECTION (asm_out_file);
6497 if (debug_info_level >= DINFO_LEVEL_VERBOSE)
6499 /* Output terminating entries for the .debug_macinfo section. */
6501 dwarfout_end_source_file (0);
6503 fputc ('\n', asm_out_file);
6504 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_MACINFO_SECTION);
6505 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, 0);
6506 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, "");
6507 ASM_OUTPUT_POP_SECTION (asm_out_file);
6510 /* Generate the terminating entry for the .debug_pubnames section. */
6512 fputc ('\n', asm_out_file);
6513 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_PUBNAMES_SECTION);
6514 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, 0);
6515 ASM_OUTPUT_DWARF_STRING_NEWLINE (asm_out_file, "");
6516 ASM_OUTPUT_POP_SECTION (asm_out_file);
6518 /* Generate the terminating entries for the .debug_aranges section.
6520 Note that we want to do this only *after* we have output the end
6521 labels (for the various program sections) which we are going to
6522 refer to here. This allows us to work around a bug in the m68k
6523 svr4 assembler. That assembler gives bogus assembly-time errors
6524 if (within any given section) you try to take the difference of
6525 two relocatable symbols, both of which are located within some
6526 other section, and if one (or both?) of the symbols involved is
6527 being forward-referenced. By generating the .debug_aranges
6528 entries at this late point in the assembly output, we skirt the
6529 issue simply by avoiding forward-references.
6532 fputc ('\n', asm_out_file);
6533 ASM_OUTPUT_PUSH_SECTION (asm_out_file, DEBUG_ARANGES_SECTION);
6535 ASM_OUTPUT_DWARF_ADDR (asm_out_file, TEXT_BEGIN_LABEL);
6536 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, TEXT_END_LABEL, TEXT_BEGIN_LABEL);
6538 ASM_OUTPUT_DWARF_ADDR (asm_out_file, DATA_BEGIN_LABEL);
6539 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, DATA_END_LABEL, DATA_BEGIN_LABEL);
6541 #if 0 /* GNU C doesn't currently use .data1. */
6542 ASM_OUTPUT_DWARF_ADDR (asm_out_file, DATA1_BEGIN_LABEL);
6543 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, DATA1_END_LABEL,
6547 ASM_OUTPUT_DWARF_ADDR (asm_out_file, RODATA_BEGIN_LABEL);
6548 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, RODATA_END_LABEL,
6549 RODATA_BEGIN_LABEL);
6551 #if 0 /* GNU C doesn't currently use .rodata1. */
6552 ASM_OUTPUT_DWARF_ADDR (asm_out_file, RODATA1_BEGIN_LABEL);
6553 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, RODATA1_END_LABEL,
6554 RODATA1_BEGIN_LABEL);
6557 ASM_OUTPUT_DWARF_ADDR (asm_out_file, BSS_BEGIN_LABEL);
6558 ASM_OUTPUT_DWARF_DELTA4 (asm_out_file, BSS_END_LABEL, BSS_BEGIN_LABEL);
6560 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, 0);
6561 ASM_OUTPUT_DWARF_DATA4 (asm_out_file, 0);
6563 ASM_OUTPUT_LABEL (asm_out_file, DEBUG_ARANGES_END_LABEL);
6564 ASM_OUTPUT_POP_SECTION (asm_out_file);
6567 /* There should not be any pending types left at the end. We need
6568 this now because it may not have been checked on the last call to
6569 dwarfout_file_scope_decl. */
6570 if (pending_types != 0)
6574 #endif /* DWARF_DEBUGGING_INFO */
OSDN Git Service
