1 /* Output Dwarf2 format symbol table information from GCC.
2 Copyright (C) 1992-2020 Free Software Foundation, Inc.
3 Contributed by Gary Funck (gary@intrepid.com).
4 Derived from DWARF 1 implementation of Ron Guilmette (rfg@monkeys.com).
5 Extensively modified by Jason Merrill (jason@cygnus.com).
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* TODO: Emit .debug_line header even when there are no functions, since
24 the file numbers are used by .debug_info. Alternately, leave
25 out locations for types and decls.
26 Avoid talking about ctors and op= for PODs.
27 Factor out common prologue sequences into multiple CIEs. */
29 /* The first part of this file deals with the DWARF 2 frame unwind
30 information, which is also used by the GCC efficient exception handling
31 mechanism. The second part, controlled only by an #ifdef
32 DWARF2_DEBUGGING_INFO, deals with the other DWARF 2 debugging
35 /* DWARF2 Abbreviation Glossary:
37 CFA = Canonical Frame Address
38 a fixed address on the stack which identifies a call frame.
39 We define it to be the value of SP just before the call insn.
40 The CFA register and offset, which may change during the course
41 of the function, are used to calculate its value at runtime.
43 CFI = Call Frame Instruction
44 an instruction for the DWARF2 abstract machine
46 CIE = Common Information Entry
47 information describing information common to one or more FDEs
49 DIE = Debugging Information Entry
51 FDE = Frame Description Entry
52 information describing the stack call frame, in particular,
53 how to restore registers
55 DW_CFA_... = DWARF2 CFA call frame instruction
56 DW_TAG_... = DWARF2 DIE tag */
60 #include "coretypes.h"
67 #include "stringpool.h"
68 #include "insn-config.h"
71 #include "diagnostic.h"
72 #include "fold-const.h"
73 #include "stor-layout.h"
81 #include "dwarf2out.h"
82 #include "dwarf2asm.h"
85 #include "tree-pretty-print.h"
86 #include "print-rtl.h"
88 #include "common/common-target.h"
89 #include "langhooks.h"
94 #include "gdb/gdb-index.h"
96 #include "stringpool.h"
98 #include "file-prefix-map.h" /* remap_debug_filename() */
100 static void dwarf2out_source_line (unsigned int, unsigned int, const char *,
102 static rtx_insn
*last_var_location_insn
;
103 static rtx_insn
*cached_next_real_insn
;
104 static void dwarf2out_decl (tree
);
105 static bool is_redundant_typedef (const_tree
);
107 #ifndef XCOFF_DEBUGGING_INFO
108 #define XCOFF_DEBUGGING_INFO 0
111 #ifndef HAVE_XCOFF_DWARF_EXTRAS
112 #define HAVE_XCOFF_DWARF_EXTRAS 0
115 #ifdef VMS_DEBUGGING_INFO
116 int vms_file_stats_name (const char *, long long *, long *, char *, int *);
118 /* Define this macro to be a nonzero value if the directory specifications
119 which are output in the debug info should end with a separator. */
120 #define DWARF2_DIR_SHOULD_END_WITH_SEPARATOR 1
121 /* Define this macro to evaluate to a nonzero value if GCC should refrain
122 from generating indirect strings in DWARF2 debug information, for instance
123 if your target is stuck with an old version of GDB that is unable to
124 process them properly or uses VMS Debug. */
125 #define DWARF2_INDIRECT_STRING_SUPPORT_MISSING_ON_TARGET 1
127 #define DWARF2_DIR_SHOULD_END_WITH_SEPARATOR 0
128 #define DWARF2_INDIRECT_STRING_SUPPORT_MISSING_ON_TARGET 0
131 /* ??? Poison these here until it can be done generically. They've been
132 totally replaced in this file; make sure it stays that way. */
133 #undef DWARF2_UNWIND_INFO
134 #undef DWARF2_FRAME_INFO
135 #if (GCC_VERSION >= 3000)
136 #pragma GCC poison DWARF2_UNWIND_INFO DWARF2_FRAME_INFO
139 /* The size of the target's pointer type. */
141 #define PTR_SIZE (POINTER_SIZE / BITS_PER_UNIT)
144 /* Array of RTXes referenced by the debugging information, which therefore
145 must be kept around forever. */
146 static GTY(()) vec
<rtx
, va_gc
> *used_rtx_array
;
148 /* A pointer to the base of a list of incomplete types which might be
149 completed at some later time. incomplete_types_list needs to be a
150 vec<tree, va_gc> *because we want to tell the garbage collector about
152 static GTY(()) vec
<tree
, va_gc
> *incomplete_types
;
154 /* Pointers to various DWARF2 sections. */
155 static GTY(()) section
*debug_info_section
;
156 static GTY(()) section
*debug_skeleton_info_section
;
157 static GTY(()) section
*debug_abbrev_section
;
158 static GTY(()) section
*debug_skeleton_abbrev_section
;
159 static GTY(()) section
*debug_aranges_section
;
160 static GTY(()) section
*debug_addr_section
;
161 static GTY(()) section
*debug_macinfo_section
;
162 static const char *debug_macinfo_section_name
;
163 static unsigned macinfo_label_base
= 1;
164 static GTY(()) section
*debug_line_section
;
165 static GTY(()) section
*debug_skeleton_line_section
;
166 static GTY(()) section
*debug_loc_section
;
167 static GTY(()) section
*debug_pubnames_section
;
168 static GTY(()) section
*debug_pubtypes_section
;
169 static GTY(()) section
*debug_str_section
;
170 static GTY(()) section
*debug_line_str_section
;
171 static GTY(()) section
*debug_str_dwo_section
;
172 static GTY(()) section
*debug_str_offsets_section
;
173 static GTY(()) section
*debug_ranges_section
;
174 static GTY(()) section
*debug_frame_section
;
176 /* Maximum size (in bytes) of an artificially generated label. */
177 #define MAX_ARTIFICIAL_LABEL_BYTES 40
179 /* According to the (draft) DWARF 3 specification, the initial length
180 should either be 4 or 12 bytes. When it's 12 bytes, the first 4
181 bytes are 0xffffffff, followed by the length stored in the next 8
184 However, the SGI/MIPS ABI uses an initial length which is equal to
185 DWARF_OFFSET_SIZE. It is defined (elsewhere) accordingly. */
187 #ifndef DWARF_INITIAL_LENGTH_SIZE
188 #define DWARF_INITIAL_LENGTH_SIZE (DWARF_OFFSET_SIZE == 4 ? 4 : 12)
191 #ifndef DWARF_INITIAL_LENGTH_SIZE_STR
192 #define DWARF_INITIAL_LENGTH_SIZE_STR (DWARF_OFFSET_SIZE == 4 ? "-4" : "-12")
195 /* Round SIZE up to the nearest BOUNDARY. */
196 #define DWARF_ROUND(SIZE,BOUNDARY) \
197 ((((SIZE) + (BOUNDARY) - 1) / (BOUNDARY)) * (BOUNDARY))
199 /* CIE identifier. */
200 #if HOST_BITS_PER_WIDE_INT >= 64
201 #define DWARF_CIE_ID \
202 (unsigned HOST_WIDE_INT) (DWARF_OFFSET_SIZE == 4 ? DW_CIE_ID : DW64_CIE_ID)
204 #define DWARF_CIE_ID DW_CIE_ID
208 /* A vector for a table that contains frame description
209 information for each routine. */
210 #define NOT_INDEXED (-1U)
211 #define NO_INDEX_ASSIGNED (-2U)
213 static GTY(()) vec
<dw_fde_ref
, va_gc
> *fde_vec
;
215 struct GTY((for_user
)) indirect_string_node
{
217 unsigned int refcount
;
218 enum dwarf_form form
;
223 struct indirect_string_hasher
: ggc_ptr_hash
<indirect_string_node
>
225 typedef const char *compare_type
;
227 static hashval_t
hash (indirect_string_node
*);
228 static bool equal (indirect_string_node
*, const char *);
231 static GTY (()) hash_table
<indirect_string_hasher
> *debug_str_hash
;
233 static GTY (()) hash_table
<indirect_string_hasher
> *debug_line_str_hash
;
235 /* With split_debug_info, both the comp_dir and dwo_name go in the
236 main object file, rather than the dwo, similar to the force_direct
237 parameter elsewhere but with additional complications:
239 1) The string is needed in both the main object file and the dwo.
240 That is, the comp_dir and dwo_name will appear in both places.
242 2) Strings can use four forms: DW_FORM_string, DW_FORM_strp,
243 DW_FORM_line_strp or DW_FORM_strx/GNU_str_index.
245 3) GCC chooses the form to use late, depending on the size and
248 Rather than forcing the all debug string handling functions and
249 callers to deal with these complications, simply use a separate,
250 special-cased string table for any attribute that should go in the
251 main object file. This limits the complexity to just the places
254 static GTY (()) hash_table
<indirect_string_hasher
> *skeleton_debug_str_hash
;
256 static GTY(()) int dw2_string_counter
;
258 /* True if the compilation unit places functions in more than one section. */
259 static GTY(()) bool have_multiple_function_sections
= false;
261 /* Whether the default text and cold text sections have been used at all. */
262 static GTY(()) bool text_section_used
= false;
263 static GTY(()) bool cold_text_section_used
= false;
265 /* The default cold text section. */
266 static GTY(()) section
*cold_text_section
;
268 /* The DIE for C++14 'auto' in a function return type. */
269 static GTY(()) dw_die_ref auto_die
;
271 /* The DIE for C++14 'decltype(auto)' in a function return type. */
272 static GTY(()) dw_die_ref decltype_auto_die
;
274 /* Forward declarations for functions defined in this file. */
276 static void output_call_frame_info (int);
277 static void dwarf2out_note_section_used (void);
279 /* Personality decl of current unit. Used only when assembler does not support
281 static GTY(()) rtx current_unit_personality
;
283 /* Whether an eh_frame section is required. */
284 static GTY(()) bool do_eh_frame
= false;
286 /* .debug_rnglists next index. */
287 static unsigned int rnglist_idx
;
289 /* Data and reference forms for relocatable data. */
290 #define DW_FORM_data (DWARF_OFFSET_SIZE == 8 ? DW_FORM_data8 : DW_FORM_data4)
291 #define DW_FORM_ref (DWARF_OFFSET_SIZE == 8 ? DW_FORM_ref8 : DW_FORM_ref4)
293 #ifndef DEBUG_FRAME_SECTION
294 #define DEBUG_FRAME_SECTION ".debug_frame"
297 #ifndef FUNC_BEGIN_LABEL
298 #define FUNC_BEGIN_LABEL "LFB"
301 #ifndef FUNC_SECOND_SECT_LABEL
302 #define FUNC_SECOND_SECT_LABEL "LFSB"
305 #ifndef FUNC_END_LABEL
306 #define FUNC_END_LABEL "LFE"
309 #ifndef PROLOGUE_END_LABEL
310 #define PROLOGUE_END_LABEL "LPE"
313 #ifndef EPILOGUE_BEGIN_LABEL
314 #define EPILOGUE_BEGIN_LABEL "LEB"
317 #ifndef FRAME_BEGIN_LABEL
318 #define FRAME_BEGIN_LABEL "Lframe"
320 #define CIE_AFTER_SIZE_LABEL "LSCIE"
321 #define CIE_END_LABEL "LECIE"
322 #define FDE_LABEL "LSFDE"
323 #define FDE_AFTER_SIZE_LABEL "LASFDE"
324 #define FDE_END_LABEL "LEFDE"
325 #define LINE_NUMBER_BEGIN_LABEL "LSLT"
326 #define LINE_NUMBER_END_LABEL "LELT"
327 #define LN_PROLOG_AS_LABEL "LASLTP"
328 #define LN_PROLOG_END_LABEL "LELTP"
329 #define DIE_LABEL_PREFIX "DW"
331 /* Match the base name of a file to the base name of a compilation unit. */
334 matches_main_base (const char *path
)
336 /* Cache the last query. */
337 static const char *last_path
= NULL
;
338 static int last_match
= 0;
339 if (path
!= last_path
)
342 int length
= base_of_path (path
, &base
);
344 last_match
= (length
== main_input_baselength
345 && memcmp (base
, main_input_basename
, length
) == 0);
350 #ifdef DEBUG_DEBUG_STRUCT
353 dump_struct_debug (tree type
, enum debug_info_usage usage
,
354 enum debug_struct_file criterion
, int generic
,
355 int matches
, int result
)
357 /* Find the type name. */
358 tree type_decl
= TYPE_STUB_DECL (type
);
360 const char *name
= 0;
361 if (TREE_CODE (t
) == TYPE_DECL
)
364 name
= IDENTIFIER_POINTER (t
);
366 fprintf (stderr
, " struct %d %s %s %s %s %d %p %s\n",
368 DECL_IN_SYSTEM_HEADER (type_decl
) ? "sys" : "usr",
369 matches
? "bas" : "hdr",
370 generic
? "gen" : "ord",
371 usage
== DINFO_USAGE_DFN
? ";" :
372 usage
== DINFO_USAGE_DIR_USE
? "." : "*",
374 (void*) type_decl
, name
);
377 #define DUMP_GSTRUCT(type, usage, criterion, generic, matches, result) \
378 dump_struct_debug (type, usage, criterion, generic, matches, result)
382 #define DUMP_GSTRUCT(type, usage, criterion, generic, matches, result) \
387 /* Get the number of HOST_WIDE_INTs needed to represent the precision
388 of the number. Some constants have a large uniform precision, so
389 we get the precision needed for the actual value of the number. */
392 get_full_len (const wide_int
&op
)
394 int prec
= wi::min_precision (op
, UNSIGNED
);
395 return ((prec
+ HOST_BITS_PER_WIDE_INT
- 1)
396 / HOST_BITS_PER_WIDE_INT
);
400 should_emit_struct_debug (tree type
, enum debug_info_usage usage
)
402 enum debug_struct_file criterion
;
404 bool generic
= lang_hooks
.types
.generic_p (type
);
407 criterion
= debug_struct_generic
[usage
];
409 criterion
= debug_struct_ordinary
[usage
];
411 if (criterion
== DINFO_STRUCT_FILE_NONE
)
412 return DUMP_GSTRUCT (type
, usage
, criterion
, generic
, false, false);
413 if (criterion
== DINFO_STRUCT_FILE_ANY
)
414 return DUMP_GSTRUCT (type
, usage
, criterion
, generic
, false, true);
416 type_decl
= TYPE_STUB_DECL (TYPE_MAIN_VARIANT (type
));
418 if (type_decl
!= NULL
)
420 if (criterion
== DINFO_STRUCT_FILE_SYS
&& DECL_IN_SYSTEM_HEADER (type_decl
))
421 return DUMP_GSTRUCT (type
, usage
, criterion
, generic
, false, true);
423 if (matches_main_base (DECL_SOURCE_FILE (type_decl
)))
424 return DUMP_GSTRUCT (type
, usage
, criterion
, generic
, true, true);
427 return DUMP_GSTRUCT (type
, usage
, criterion
, generic
, false, false);
430 /* Switch [BACK] to eh_frame_section. If we don't have an eh_frame_section,
431 switch to the data section instead, and write out a synthetic start label
432 for collect2 the first time around. */
435 switch_to_eh_frame_section (bool back ATTRIBUTE_UNUSED
)
437 if (eh_frame_section
== 0)
441 if (EH_TABLES_CAN_BE_READ_ONLY
)
447 fde_encoding
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/1,
449 per_encoding
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/2,
451 lsda_encoding
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/0,
454 || ((fde_encoding
& 0x70) != DW_EH_PE_absptr
455 && (fde_encoding
& 0x70) != DW_EH_PE_aligned
456 && (per_encoding
& 0x70) != DW_EH_PE_absptr
457 && (per_encoding
& 0x70) != DW_EH_PE_aligned
458 && (lsda_encoding
& 0x70) != DW_EH_PE_absptr
459 && (lsda_encoding
& 0x70) != DW_EH_PE_aligned
))
460 ? 0 : SECTION_WRITE
);
463 flags
= SECTION_WRITE
;
465 #ifdef EH_FRAME_SECTION_NAME
466 eh_frame_section
= get_section (EH_FRAME_SECTION_NAME
, flags
, NULL
);
468 eh_frame_section
= ((flags
== SECTION_WRITE
)
469 ? data_section
: readonly_data_section
);
470 #endif /* EH_FRAME_SECTION_NAME */
473 switch_to_section (eh_frame_section
);
475 #ifdef EH_FRAME_THROUGH_COLLECT2
476 /* We have no special eh_frame section. Emit special labels to guide
480 tree label
= get_file_function_name ("F");
481 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (PTR_SIZE
));
482 targetm
.asm_out
.globalize_label (asm_out_file
,
483 IDENTIFIER_POINTER (label
));
484 ASM_OUTPUT_LABEL (asm_out_file
, IDENTIFIER_POINTER (label
));
489 /* Switch [BACK] to the eh or debug frame table section, depending on
493 switch_to_frame_table_section (int for_eh
, bool back
)
496 switch_to_eh_frame_section (back
);
499 if (!debug_frame_section
)
500 debug_frame_section
= get_section (DEBUG_FRAME_SECTION
,
501 SECTION_DEBUG
, NULL
);
502 switch_to_section (debug_frame_section
);
506 /* Describe for the GTY machinery what parts of dw_cfi_oprnd1 are used. */
508 enum dw_cfi_oprnd_type
509 dw_cfi_oprnd1_desc (enum dwarf_call_frame_info cfi
)
514 case DW_CFA_GNU_window_save
:
515 case DW_CFA_remember_state
:
516 case DW_CFA_restore_state
:
517 return dw_cfi_oprnd_unused
;
520 case DW_CFA_advance_loc1
:
521 case DW_CFA_advance_loc2
:
522 case DW_CFA_advance_loc4
:
523 case DW_CFA_MIPS_advance_loc8
:
524 return dw_cfi_oprnd_addr
;
527 case DW_CFA_offset_extended
:
529 case DW_CFA_offset_extended_sf
:
530 case DW_CFA_def_cfa_sf
:
532 case DW_CFA_restore_extended
:
533 case DW_CFA_undefined
:
534 case DW_CFA_same_value
:
535 case DW_CFA_def_cfa_register
:
536 case DW_CFA_register
:
537 case DW_CFA_expression
:
538 case DW_CFA_val_expression
:
539 return dw_cfi_oprnd_reg_num
;
541 case DW_CFA_def_cfa_offset
:
542 case DW_CFA_GNU_args_size
:
543 case DW_CFA_def_cfa_offset_sf
:
544 return dw_cfi_oprnd_offset
;
546 case DW_CFA_def_cfa_expression
:
547 return dw_cfi_oprnd_loc
;
554 /* Describe for the GTY machinery what parts of dw_cfi_oprnd2 are used. */
556 enum dw_cfi_oprnd_type
557 dw_cfi_oprnd2_desc (enum dwarf_call_frame_info cfi
)
562 case DW_CFA_def_cfa_sf
:
564 case DW_CFA_offset_extended_sf
:
565 case DW_CFA_offset_extended
:
566 return dw_cfi_oprnd_offset
;
568 case DW_CFA_register
:
569 return dw_cfi_oprnd_reg_num
;
571 case DW_CFA_expression
:
572 case DW_CFA_val_expression
:
573 return dw_cfi_oprnd_loc
;
575 case DW_CFA_def_cfa_expression
:
576 return dw_cfi_oprnd_cfa_loc
;
579 return dw_cfi_oprnd_unused
;
583 /* Output one FDE. */
586 output_fde (dw_fde_ref fde
, bool for_eh
, bool second
,
587 char *section_start_label
, int fde_encoding
, char *augmentation
,
588 bool any_lsda_needed
, int lsda_encoding
)
590 const char *begin
, *end
;
591 static unsigned int j
;
592 char l1
[MAX_ARTIFICIAL_LABEL_BYTES
], l2
[MAX_ARTIFICIAL_LABEL_BYTES
];
594 targetm
.asm_out
.emit_unwind_label (asm_out_file
, fde
->decl
, for_eh
,
596 targetm
.asm_out
.internal_label (asm_out_file
, FDE_LABEL
,
598 ASM_GENERATE_INTERNAL_LABEL (l1
, FDE_AFTER_SIZE_LABEL
, for_eh
+ j
);
599 ASM_GENERATE_INTERNAL_LABEL (l2
, FDE_END_LABEL
, for_eh
+ j
);
600 if (!XCOFF_DEBUGGING_INFO
|| for_eh
)
602 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4 && !for_eh
)
603 dw2_asm_output_data (4, 0xffffffff, "Initial length escape value"
604 " indicating 64-bit DWARF extension");
605 dw2_asm_output_delta (for_eh
? 4 : DWARF_OFFSET_SIZE
, l2
, l1
,
608 ASM_OUTPUT_LABEL (asm_out_file
, l1
);
611 dw2_asm_output_delta (4, l1
, section_start_label
, "FDE CIE offset");
613 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, section_start_label
,
614 debug_frame_section
, "FDE CIE offset");
616 begin
= second
? fde
->dw_fde_second_begin
: fde
->dw_fde_begin
;
617 end
= second
? fde
->dw_fde_second_end
: fde
->dw_fde_end
;
621 rtx sym_ref
= gen_rtx_SYMBOL_REF (Pmode
, begin
);
622 SYMBOL_REF_FLAGS (sym_ref
) |= SYMBOL_FLAG_LOCAL
;
623 dw2_asm_output_encoded_addr_rtx (fde_encoding
, sym_ref
, false,
624 "FDE initial location");
625 dw2_asm_output_delta (size_of_encoded_value (fde_encoding
),
626 end
, begin
, "FDE address range");
630 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, begin
, "FDE initial location");
631 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, end
, begin
, "FDE address range");
638 int size
= size_of_encoded_value (lsda_encoding
);
640 if (lsda_encoding
== DW_EH_PE_aligned
)
642 int offset
= ( 4 /* Length */
644 + 2 * size_of_encoded_value (fde_encoding
)
645 + 1 /* Augmentation size */ );
646 int pad
= -offset
& (PTR_SIZE
- 1);
649 gcc_assert (size_of_uleb128 (size
) == 1);
652 dw2_asm_output_data_uleb128 (size
, "Augmentation size");
654 if (fde
->uses_eh_lsda
)
656 ASM_GENERATE_INTERNAL_LABEL (l1
, second
? "LLSDAC" : "LLSDA",
657 fde
->funcdef_number
);
658 dw2_asm_output_encoded_addr_rtx (lsda_encoding
,
659 gen_rtx_SYMBOL_REF (Pmode
, l1
),
661 "Language Specific Data Area");
665 if (lsda_encoding
== DW_EH_PE_aligned
)
666 ASM_OUTPUT_ALIGN (asm_out_file
, floor_log2 (PTR_SIZE
));
667 dw2_asm_output_data (size_of_encoded_value (lsda_encoding
), 0,
668 "Language Specific Data Area (none)");
672 dw2_asm_output_data_uleb128 (0, "Augmentation size");
675 /* Loop through the Call Frame Instructions associated with this FDE. */
676 fde
->dw_fde_current_label
= begin
;
678 size_t from
, until
, i
;
681 until
= vec_safe_length (fde
->dw_fde_cfi
);
683 if (fde
->dw_fde_second_begin
== NULL
)
686 until
= fde
->dw_fde_switch_cfi_index
;
688 from
= fde
->dw_fde_switch_cfi_index
;
690 for (i
= from
; i
< until
; i
++)
691 output_cfi ((*fde
->dw_fde_cfi
)[i
], fde
, for_eh
);
694 /* If we are to emit a ref/link from function bodies to their frame tables,
695 do it now. This is typically performed to make sure that tables
696 associated with functions are dragged with them and not discarded in
697 garbage collecting links. We need to do this on a per function basis to
698 cope with -ffunction-sections. */
700 #ifdef ASM_OUTPUT_DWARF_TABLE_REF
701 /* Switch to the function section, emit the ref to the tables, and
702 switch *back* into the table section. */
703 switch_to_section (function_section (fde
->decl
));
704 ASM_OUTPUT_DWARF_TABLE_REF (section_start_label
);
705 switch_to_frame_table_section (for_eh
, true);
708 /* Pad the FDE out to an address sized boundary. */
709 ASM_OUTPUT_ALIGN (asm_out_file
,
710 floor_log2 ((for_eh
? PTR_SIZE
: DWARF2_ADDR_SIZE
)));
711 ASM_OUTPUT_LABEL (asm_out_file
, l2
);
716 /* Return true if frame description entry FDE is needed for EH. */
719 fde_needed_for_eh_p (dw_fde_ref fde
)
721 if (flag_asynchronous_unwind_tables
)
724 if (TARGET_USES_WEAK_UNWIND_INFO
&& DECL_WEAK (fde
->decl
))
727 if (fde
->uses_eh_lsda
)
730 /* If exceptions are enabled, we have collected nothrow info. */
731 if (flag_exceptions
&& (fde
->all_throwers_are_sibcalls
|| fde
->nothrow
))
737 /* Output the call frame information used to record information
738 that relates to calculating the frame pointer, and records the
739 location of saved registers. */
742 output_call_frame_info (int for_eh
)
747 char l1
[MAX_ARTIFICIAL_LABEL_BYTES
], l2
[MAX_ARTIFICIAL_LABEL_BYTES
];
748 char section_start_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
749 bool any_lsda_needed
= false;
750 char augmentation
[6];
751 int augmentation_size
;
752 int fde_encoding
= DW_EH_PE_absptr
;
753 int per_encoding
= DW_EH_PE_absptr
;
754 int lsda_encoding
= DW_EH_PE_absptr
;
756 rtx personality
= NULL
;
759 /* Don't emit a CIE if there won't be any FDEs. */
763 /* Nothing to do if the assembler's doing it all. */
764 if (dwarf2out_do_cfi_asm ())
767 /* If we don't have any functions we'll want to unwind out of, don't emit
768 any EH unwind information. If we make FDEs linkonce, we may have to
769 emit an empty label for an FDE that wouldn't otherwise be emitted. We
770 want to avoid having an FDE kept around when the function it refers to
771 is discarded. Example where this matters: a primary function template
772 in C++ requires EH information, an explicit specialization doesn't. */
775 bool any_eh_needed
= false;
777 FOR_EACH_VEC_ELT (*fde_vec
, i
, fde
)
779 if (fde
->uses_eh_lsda
)
780 any_eh_needed
= any_lsda_needed
= true;
781 else if (fde_needed_for_eh_p (fde
))
782 any_eh_needed
= true;
783 else if (TARGET_USES_WEAK_UNWIND_INFO
)
784 targetm
.asm_out
.emit_unwind_label (asm_out_file
, fde
->decl
, 1, 1);
791 /* We're going to be generating comments, so turn on app. */
795 /* Switch to the proper frame section, first time. */
796 switch_to_frame_table_section (for_eh
, false);
798 ASM_GENERATE_INTERNAL_LABEL (section_start_label
, FRAME_BEGIN_LABEL
, for_eh
);
799 ASM_OUTPUT_LABEL (asm_out_file
, section_start_label
);
801 /* Output the CIE. */
802 ASM_GENERATE_INTERNAL_LABEL (l1
, CIE_AFTER_SIZE_LABEL
, for_eh
);
803 ASM_GENERATE_INTERNAL_LABEL (l2
, CIE_END_LABEL
, for_eh
);
804 if (!XCOFF_DEBUGGING_INFO
|| for_eh
)
806 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4 && !for_eh
)
807 dw2_asm_output_data (4, 0xffffffff,
808 "Initial length escape value indicating 64-bit DWARF extension");
809 dw2_asm_output_delta (for_eh
? 4 : DWARF_OFFSET_SIZE
, l2
, l1
,
810 "Length of Common Information Entry");
812 ASM_OUTPUT_LABEL (asm_out_file
, l1
);
814 /* Now that the CIE pointer is PC-relative for EH,
815 use 0 to identify the CIE. */
816 dw2_asm_output_data ((for_eh
? 4 : DWARF_OFFSET_SIZE
),
817 (for_eh
? 0 : DWARF_CIE_ID
),
818 "CIE Identifier Tag");
820 /* Use the CIE version 3 for DWARF3; allow DWARF2 to continue to
821 use CIE version 1, unless that would produce incorrect results
822 due to overflowing the return register column. */
823 return_reg
= DWARF2_FRAME_REG_OUT (DWARF_FRAME_RETURN_COLUMN
, for_eh
);
825 if (return_reg
>= 256 || dwarf_version
> 2)
827 dw2_asm_output_data (1, dw_cie_version
, "CIE Version");
830 augmentation_size
= 0;
832 personality
= current_unit_personality
;
838 z Indicates that a uleb128 is present to size the
839 augmentation section.
840 L Indicates the encoding (and thus presence) of
841 an LSDA pointer in the FDE augmentation.
842 R Indicates a non-default pointer encoding for
844 P Indicates the presence of an encoding + language
845 personality routine in the CIE augmentation. */
847 fde_encoding
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/1, /*global=*/0);
848 per_encoding
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/2, /*global=*/1);
849 lsda_encoding
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/0, /*global=*/0);
851 p
= augmentation
+ 1;
855 augmentation_size
+= 1 + size_of_encoded_value (per_encoding
);
856 assemble_external_libcall (personality
);
861 augmentation_size
+= 1;
863 if (fde_encoding
!= DW_EH_PE_absptr
)
866 augmentation_size
+= 1;
868 if (p
> augmentation
+ 1)
870 augmentation
[0] = 'z';
874 /* Ug. Some platforms can't do unaligned dynamic relocations at all. */
875 if (personality
&& per_encoding
== DW_EH_PE_aligned
)
877 int offset
= ( 4 /* Length */
879 + 1 /* CIE version */
880 + strlen (augmentation
) + 1 /* Augmentation */
881 + size_of_uleb128 (1) /* Code alignment */
882 + size_of_sleb128 (DWARF_CIE_DATA_ALIGNMENT
)
884 + 1 /* Augmentation size */
885 + 1 /* Personality encoding */ );
886 int pad
= -offset
& (PTR_SIZE
- 1);
888 augmentation_size
+= pad
;
890 /* Augmentations should be small, so there's scarce need to
891 iterate for a solution. Die if we exceed one uleb128 byte. */
892 gcc_assert (size_of_uleb128 (augmentation_size
) == 1);
896 dw2_asm_output_nstring (augmentation
, -1, "CIE Augmentation");
897 if (dw_cie_version
>= 4)
899 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "CIE Address Size");
900 dw2_asm_output_data (1, 0, "CIE Segment Size");
902 dw2_asm_output_data_uleb128 (1, "CIE Code Alignment Factor");
903 dw2_asm_output_data_sleb128 (DWARF_CIE_DATA_ALIGNMENT
,
904 "CIE Data Alignment Factor");
906 if (dw_cie_version
== 1)
907 dw2_asm_output_data (1, return_reg
, "CIE RA Column");
909 dw2_asm_output_data_uleb128 (return_reg
, "CIE RA Column");
913 dw2_asm_output_data_uleb128 (augmentation_size
, "Augmentation size");
916 dw2_asm_output_data (1, per_encoding
, "Personality (%s)",
917 eh_data_format_name (per_encoding
));
918 dw2_asm_output_encoded_addr_rtx (per_encoding
,
924 dw2_asm_output_data (1, lsda_encoding
, "LSDA Encoding (%s)",
925 eh_data_format_name (lsda_encoding
));
927 if (fde_encoding
!= DW_EH_PE_absptr
)
928 dw2_asm_output_data (1, fde_encoding
, "FDE Encoding (%s)",
929 eh_data_format_name (fde_encoding
));
932 FOR_EACH_VEC_ELT (*cie_cfi_vec
, i
, cfi
)
933 output_cfi (cfi
, NULL
, for_eh
);
935 /* Pad the CIE out to an address sized boundary. */
936 ASM_OUTPUT_ALIGN (asm_out_file
,
937 floor_log2 (for_eh
? PTR_SIZE
: DWARF2_ADDR_SIZE
));
938 ASM_OUTPUT_LABEL (asm_out_file
, l2
);
940 /* Loop through all of the FDE's. */
941 FOR_EACH_VEC_ELT (*fde_vec
, i
, fde
)
945 /* Don't emit EH unwind info for leaf functions that don't need it. */
946 if (for_eh
&& !fde_needed_for_eh_p (fde
))
949 for (k
= 0; k
< (fde
->dw_fde_second_begin
? 2 : 1); k
++)
950 output_fde (fde
, for_eh
, k
, section_start_label
, fde_encoding
,
951 augmentation
, any_lsda_needed
, lsda_encoding
);
954 if (for_eh
&& targetm
.terminate_dw2_eh_frame_info
)
955 dw2_asm_output_data (4, 0, "End of Table");
957 /* Turn off app to make assembly quicker. */
962 /* Emit .cfi_startproc and .cfi_personality/.cfi_lsda if needed. */
965 dwarf2out_do_cfi_startproc (bool second
)
970 fprintf (asm_out_file
, "\t.cfi_startproc\n");
972 targetm
.asm_out
.post_cfi_startproc (asm_out_file
, current_function_decl
);
974 /* .cfi_personality and .cfi_lsda are only relevant to DWARF2
976 if (targetm_common
.except_unwind_info (&global_options
) != UI_DWARF2
)
979 rtx personality
= get_personality_function (current_function_decl
);
983 enc
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/2, /*global=*/1);
986 /* ??? The GAS support isn't entirely consistent. We have to
987 handle indirect support ourselves, but PC-relative is done
988 in the assembler. Further, the assembler can't handle any
989 of the weirder relocation types. */
990 if (enc
& DW_EH_PE_indirect
)
991 ref
= dw2_force_const_mem (ref
, true);
993 fprintf (asm_out_file
, "\t.cfi_personality %#x,", enc
);
994 output_addr_const (asm_out_file
, ref
);
995 fputc ('\n', asm_out_file
);
998 if (crtl
->uses_eh_lsda
)
1000 char lab
[MAX_ARTIFICIAL_LABEL_BYTES
];
1002 enc
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/0, /*global=*/0);
1003 ASM_GENERATE_INTERNAL_LABEL (lab
, second
? "LLSDAC" : "LLSDA",
1004 current_function_funcdef_no
);
1005 ref
= gen_rtx_SYMBOL_REF (Pmode
, lab
);
1006 SYMBOL_REF_FLAGS (ref
) = SYMBOL_FLAG_LOCAL
;
1008 if (enc
& DW_EH_PE_indirect
)
1009 ref
= dw2_force_const_mem (ref
, true);
1011 fprintf (asm_out_file
, "\t.cfi_lsda %#x,", enc
);
1012 output_addr_const (asm_out_file
, ref
);
1013 fputc ('\n', asm_out_file
);
1017 /* Allocate CURRENT_FDE. Immediately initialize all we can, noting that
1018 this allocation may be done before pass_final. */
1021 dwarf2out_alloc_current_fde (void)
1025 fde
= ggc_cleared_alloc
<dw_fde_node
> ();
1026 fde
->decl
= current_function_decl
;
1027 fde
->funcdef_number
= current_function_funcdef_no
;
1028 fde
->fde_index
= vec_safe_length (fde_vec
);
1029 fde
->all_throwers_are_sibcalls
= crtl
->all_throwers_are_sibcalls
;
1030 fde
->uses_eh_lsda
= crtl
->uses_eh_lsda
;
1031 fde
->nothrow
= crtl
->nothrow
;
1032 fde
->drap_reg
= INVALID_REGNUM
;
1033 fde
->vdrap_reg
= INVALID_REGNUM
;
1035 /* Record the FDE associated with this function. */
1037 vec_safe_push (fde_vec
, fde
);
1042 /* Output a marker (i.e. a label) for the beginning of a function, before
1046 dwarf2out_begin_prologue (unsigned int line ATTRIBUTE_UNUSED
,
1047 unsigned int column ATTRIBUTE_UNUSED
,
1048 const char *file ATTRIBUTE_UNUSED
)
1050 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
1056 current_function_func_begin_label
= NULL
;
1058 do_frame
= dwarf2out_do_frame ();
1060 /* ??? current_function_func_begin_label is also used by except.c for
1061 call-site information. We must emit this label if it might be used. */
1063 && (!flag_exceptions
1064 || targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
))
1067 fnsec
= function_section (current_function_decl
);
1068 switch_to_section (fnsec
);
1069 ASM_GENERATE_INTERNAL_LABEL (label
, FUNC_BEGIN_LABEL
,
1070 current_function_funcdef_no
);
1071 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, FUNC_BEGIN_LABEL
,
1072 current_function_funcdef_no
);
1073 dup_label
= xstrdup (label
);
1074 current_function_func_begin_label
= dup_label
;
1076 /* We can elide FDE allocation if we're not emitting frame unwind info. */
1080 /* Unlike the debug version, the EH version of frame unwind info is a per-
1081 function setting so we need to record whether we need it for the unit. */
1082 do_eh_frame
|= dwarf2out_do_eh_frame ();
1084 /* Cater to the various TARGET_ASM_OUTPUT_MI_THUNK implementations that
1085 emit insns as rtx but bypass the bulk of rest_of_compilation, which
1086 would include pass_dwarf2_frame. If we've not created the FDE yet,
1090 fde
= dwarf2out_alloc_current_fde ();
1092 /* Initialize the bits of CURRENT_FDE that were not available earlier. */
1093 fde
->dw_fde_begin
= dup_label
;
1094 fde
->dw_fde_current_label
= dup_label
;
1095 fde
->in_std_section
= (fnsec
== text_section
1096 || (cold_text_section
&& fnsec
== cold_text_section
));
1098 /* We only want to output line number information for the genuine dwarf2
1099 prologue case, not the eh frame case. */
1100 #ifdef DWARF2_DEBUGGING_INFO
1102 dwarf2out_source_line (line
, column
, file
, 0, true);
1105 if (dwarf2out_do_cfi_asm ())
1106 dwarf2out_do_cfi_startproc (false);
1109 rtx personality
= get_personality_function (current_function_decl
);
1110 if (!current_unit_personality
)
1111 current_unit_personality
= personality
;
1113 /* We cannot keep a current personality per function as without CFI
1114 asm, at the point where we emit the CFI data, there is no current
1115 function anymore. */
1116 if (personality
&& current_unit_personality
!= personality
)
1117 sorry ("multiple EH personalities are supported only with assemblers "
1118 "supporting %<.cfi_personality%> directive");
1122 /* Output a marker (i.e. a label) for the end of the generated code
1123 for a function prologue. This gets called *after* the prologue code has
1127 dwarf2out_vms_end_prologue (unsigned int line ATTRIBUTE_UNUSED
,
1128 const char *file ATTRIBUTE_UNUSED
)
1130 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
1132 /* Output a label to mark the endpoint of the code generated for this
1134 ASM_GENERATE_INTERNAL_LABEL (label
, PROLOGUE_END_LABEL
,
1135 current_function_funcdef_no
);
1136 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, PROLOGUE_END_LABEL
,
1137 current_function_funcdef_no
);
1138 cfun
->fde
->dw_fde_vms_end_prologue
= xstrdup (label
);
1141 /* Output a marker (i.e. a label) for the beginning of the generated code
1142 for a function epilogue. This gets called *before* the prologue code has
1146 dwarf2out_vms_begin_epilogue (unsigned int line ATTRIBUTE_UNUSED
,
1147 const char *file ATTRIBUTE_UNUSED
)
1149 dw_fde_ref fde
= cfun
->fde
;
1150 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
1152 if (fde
->dw_fde_vms_begin_epilogue
)
1155 /* Output a label to mark the endpoint of the code generated for this
1157 ASM_GENERATE_INTERNAL_LABEL (label
, EPILOGUE_BEGIN_LABEL
,
1158 current_function_funcdef_no
);
1159 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, EPILOGUE_BEGIN_LABEL
,
1160 current_function_funcdef_no
);
1161 fde
->dw_fde_vms_begin_epilogue
= xstrdup (label
);
1164 /* Output a marker (i.e. a label) for the absolute end of the generated code
1165 for a function definition. This gets called *after* the epilogue code has
1169 dwarf2out_end_epilogue (unsigned int line ATTRIBUTE_UNUSED
,
1170 const char *file ATTRIBUTE_UNUSED
)
1173 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
1175 last_var_location_insn
= NULL
;
1176 cached_next_real_insn
= NULL
;
1178 if (dwarf2out_do_cfi_asm ())
1179 fprintf (asm_out_file
, "\t.cfi_endproc\n");
1181 /* Output a label to mark the endpoint of the code generated for this
1183 ASM_GENERATE_INTERNAL_LABEL (label
, FUNC_END_LABEL
,
1184 current_function_funcdef_no
);
1185 ASM_OUTPUT_LABEL (asm_out_file
, label
);
1187 gcc_assert (fde
!= NULL
);
1188 if (fde
->dw_fde_second_begin
== NULL
)
1189 fde
->dw_fde_end
= xstrdup (label
);
1193 dwarf2out_frame_finish (void)
1195 /* Output call frame information. */
1196 if (targetm
.debug_unwind_info () == UI_DWARF2
)
1197 output_call_frame_info (0);
1199 /* Output another copy for the unwinder. */
1201 output_call_frame_info (1);
1204 /* Note that the current function section is being used for code. */
1207 dwarf2out_note_section_used (void)
1209 section
*sec
= current_function_section ();
1210 if (sec
== text_section
)
1211 text_section_used
= true;
1212 else if (sec
== cold_text_section
)
1213 cold_text_section_used
= true;
1216 static void var_location_switch_text_section (void);
1217 static void set_cur_line_info_table (section
*);
1220 dwarf2out_switch_text_section (void)
1222 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
1224 dw_fde_ref fde
= cfun
->fde
;
1226 gcc_assert (cfun
&& fde
&& fde
->dw_fde_second_begin
== NULL
);
1228 ASM_GENERATE_INTERNAL_LABEL (label
, FUNC_SECOND_SECT_LABEL
,
1229 current_function_funcdef_no
);
1231 fde
->dw_fde_second_begin
= ggc_strdup (label
);
1232 if (!in_cold_section_p
)
1234 fde
->dw_fde_end
= crtl
->subsections
.cold_section_end_label
;
1235 fde
->dw_fde_second_end
= crtl
->subsections
.hot_section_end_label
;
1239 fde
->dw_fde_end
= crtl
->subsections
.hot_section_end_label
;
1240 fde
->dw_fde_second_end
= crtl
->subsections
.cold_section_end_label
;
1242 have_multiple_function_sections
= true;
1244 /* There is no need to mark used sections when not debugging. */
1245 if (cold_text_section
!= NULL
)
1246 dwarf2out_note_section_used ();
1248 if (dwarf2out_do_cfi_asm ())
1249 fprintf (asm_out_file
, "\t.cfi_endproc\n");
1251 /* Now do the real section switch. */
1252 sect
= current_function_section ();
1253 switch_to_section (sect
);
1255 fde
->second_in_std_section
1256 = (sect
== text_section
1257 || (cold_text_section
&& sect
== cold_text_section
));
1259 if (dwarf2out_do_cfi_asm ())
1260 dwarf2out_do_cfi_startproc (true);
1262 var_location_switch_text_section ();
1264 if (cold_text_section
!= NULL
)
1265 set_cur_line_info_table (sect
);
1268 /* And now, the subset of the debugging information support code necessary
1269 for emitting location expressions. */
1271 /* Data about a single source file. */
1272 struct GTY((for_user
)) dwarf_file_data
{
1273 const char * filename
;
1277 /* Describe an entry into the .debug_addr section. */
1281 ate_kind_rtx_dtprel
,
1285 struct GTY((for_user
)) addr_table_entry
{
1287 unsigned int refcount
;
1289 union addr_table_entry_struct_union
1291 rtx
GTY ((tag ("0"))) rtl
;
1292 char * GTY ((tag ("1"))) label
;
1294 GTY ((desc ("%1.kind"))) addr
;
1297 typedef unsigned int var_loc_view
;
1299 /* Location lists are ranges + location descriptions for that range,
1300 so you can track variables that are in different places over
1301 their entire life. */
1302 typedef struct GTY(()) dw_loc_list_struct
{
1303 dw_loc_list_ref dw_loc_next
;
1304 const char *begin
; /* Label and addr_entry for start of range */
1305 addr_table_entry
*begin_entry
;
1306 const char *end
; /* Label for end of range */
1307 char *ll_symbol
; /* Label for beginning of location list.
1308 Only on head of list. */
1309 char *vl_symbol
; /* Label for beginning of view list. Ditto. */
1310 const char *section
; /* Section this loclist is relative to */
1311 dw_loc_descr_ref expr
;
1312 var_loc_view vbegin
, vend
;
1314 /* True if all addresses in this and subsequent lists are known to be
1317 /* True if this list has been replaced by dw_loc_next. */
1319 /* True if it has been emitted into .debug_loc* / .debug_loclists*
1321 unsigned char emitted
: 1;
1322 /* True if hash field is index rather than hash value. */
1323 unsigned char num_assigned
: 1;
1324 /* True if .debug_loclists.dwo offset has been emitted for it already. */
1325 unsigned char offset_emitted
: 1;
1326 /* True if note_variable_value_in_expr has been called on it. */
1327 unsigned char noted_variable_value
: 1;
1328 /* True if the range should be emitted even if begin and end
1333 static dw_loc_descr_ref
int_loc_descriptor (poly_int64
);
1334 static dw_loc_descr_ref
uint_loc_descriptor (unsigned HOST_WIDE_INT
);
1336 /* Convert a DWARF stack opcode into its string name. */
1339 dwarf_stack_op_name (unsigned int op
)
1341 const char *name
= get_DW_OP_name (op
);
1346 return "OP_<unknown>";
1349 /* Return TRUE iff we're to output location view lists as a separate
1350 attribute next to the location lists, as an extension compatible
1351 with DWARF 2 and above. */
1354 dwarf2out_locviews_in_attribute ()
1356 return debug_variable_location_views
== 1;
1359 /* Return TRUE iff we're to output location view lists as part of the
1360 location lists, as proposed for standardization after DWARF 5. */
1363 dwarf2out_locviews_in_loclist ()
1365 #ifndef DW_LLE_view_pair
1368 return debug_variable_location_views
== -1;
1372 /* Return a pointer to a newly allocated location description. Location
1373 descriptions are simple expression terms that can be strung
1374 together to form more complicated location (address) descriptions. */
1376 static inline dw_loc_descr_ref
1377 new_loc_descr (enum dwarf_location_atom op
, unsigned HOST_WIDE_INT oprnd1
,
1378 unsigned HOST_WIDE_INT oprnd2
)
1380 dw_loc_descr_ref descr
= ggc_cleared_alloc
<dw_loc_descr_node
> ();
1382 descr
->dw_loc_opc
= op
;
1383 descr
->dw_loc_oprnd1
.val_class
= dw_val_class_unsigned_const
;
1384 descr
->dw_loc_oprnd1
.val_entry
= NULL
;
1385 descr
->dw_loc_oprnd1
.v
.val_unsigned
= oprnd1
;
1386 descr
->dw_loc_oprnd2
.val_class
= dw_val_class_unsigned_const
;
1387 descr
->dw_loc_oprnd2
.val_entry
= NULL
;
1388 descr
->dw_loc_oprnd2
.v
.val_unsigned
= oprnd2
;
1393 /* Add a location description term to a location description expression. */
1396 add_loc_descr (dw_loc_descr_ref
*list_head
, dw_loc_descr_ref descr
)
1398 dw_loc_descr_ref
*d
;
1400 /* Find the end of the chain. */
1401 for (d
= list_head
; (*d
) != NULL
; d
= &(*d
)->dw_loc_next
)
1407 /* Compare two location operands for exact equality. */
1410 dw_val_equal_p (dw_val_node
*a
, dw_val_node
*b
)
1412 if (a
->val_class
!= b
->val_class
)
1414 switch (a
->val_class
)
1416 case dw_val_class_none
:
1418 case dw_val_class_addr
:
1419 return rtx_equal_p (a
->v
.val_addr
, b
->v
.val_addr
);
1421 case dw_val_class_offset
:
1422 case dw_val_class_unsigned_const
:
1423 case dw_val_class_const
:
1424 case dw_val_class_unsigned_const_implicit
:
1425 case dw_val_class_const_implicit
:
1426 case dw_val_class_range_list
:
1427 /* These are all HOST_WIDE_INT, signed or unsigned. */
1428 return a
->v
.val_unsigned
== b
->v
.val_unsigned
;
1430 case dw_val_class_loc
:
1431 return a
->v
.val_loc
== b
->v
.val_loc
;
1432 case dw_val_class_loc_list
:
1433 return a
->v
.val_loc_list
== b
->v
.val_loc_list
;
1434 case dw_val_class_view_list
:
1435 return a
->v
.val_view_list
== b
->v
.val_view_list
;
1436 case dw_val_class_die_ref
:
1437 return a
->v
.val_die_ref
.die
== b
->v
.val_die_ref
.die
;
1438 case dw_val_class_fde_ref
:
1439 return a
->v
.val_fde_index
== b
->v
.val_fde_index
;
1440 case dw_val_class_symview
:
1441 return strcmp (a
->v
.val_symbolic_view
, b
->v
.val_symbolic_view
) == 0;
1442 case dw_val_class_lbl_id
:
1443 case dw_val_class_lineptr
:
1444 case dw_val_class_macptr
:
1445 case dw_val_class_loclistsptr
:
1446 case dw_val_class_high_pc
:
1447 return strcmp (a
->v
.val_lbl_id
, b
->v
.val_lbl_id
) == 0;
1448 case dw_val_class_str
:
1449 return a
->v
.val_str
== b
->v
.val_str
;
1450 case dw_val_class_flag
:
1451 return a
->v
.val_flag
== b
->v
.val_flag
;
1452 case dw_val_class_file
:
1453 case dw_val_class_file_implicit
:
1454 return a
->v
.val_file
== b
->v
.val_file
;
1455 case dw_val_class_decl_ref
:
1456 return a
->v
.val_decl_ref
== b
->v
.val_decl_ref
;
1458 case dw_val_class_const_double
:
1459 return (a
->v
.val_double
.high
== b
->v
.val_double
.high
1460 && a
->v
.val_double
.low
== b
->v
.val_double
.low
);
1462 case dw_val_class_wide_int
:
1463 return *a
->v
.val_wide
== *b
->v
.val_wide
;
1465 case dw_val_class_vec
:
1467 size_t a_len
= a
->v
.val_vec
.elt_size
* a
->v
.val_vec
.length
;
1468 size_t b_len
= b
->v
.val_vec
.elt_size
* b
->v
.val_vec
.length
;
1470 return (a_len
== b_len
1471 && !memcmp (a
->v
.val_vec
.array
, b
->v
.val_vec
.array
, a_len
));
1474 case dw_val_class_data8
:
1475 return memcmp (a
->v
.val_data8
, b
->v
.val_data8
, 8) == 0;
1477 case dw_val_class_vms_delta
:
1478 return (!strcmp (a
->v
.val_vms_delta
.lbl1
, b
->v
.val_vms_delta
.lbl1
)
1479 && !strcmp (a
->v
.val_vms_delta
.lbl1
, b
->v
.val_vms_delta
.lbl1
));
1481 case dw_val_class_discr_value
:
1482 return (a
->v
.val_discr_value
.pos
== b
->v
.val_discr_value
.pos
1483 && a
->v
.val_discr_value
.v
.uval
== b
->v
.val_discr_value
.v
.uval
);
1484 case dw_val_class_discr_list
:
1485 /* It makes no sense comparing two discriminant value lists. */
1491 /* Compare two location atoms for exact equality. */
1494 loc_descr_equal_p_1 (dw_loc_descr_ref a
, dw_loc_descr_ref b
)
1496 if (a
->dw_loc_opc
!= b
->dw_loc_opc
)
1499 /* ??? This is only ever set for DW_OP_constNu, for N equal to the
1500 address size, but since we always allocate cleared storage it
1501 should be zero for other types of locations. */
1502 if (a
->dtprel
!= b
->dtprel
)
1505 return (dw_val_equal_p (&a
->dw_loc_oprnd1
, &b
->dw_loc_oprnd1
)
1506 && dw_val_equal_p (&a
->dw_loc_oprnd2
, &b
->dw_loc_oprnd2
));
1509 /* Compare two complete location expressions for exact equality. */
1512 loc_descr_equal_p (dw_loc_descr_ref a
, dw_loc_descr_ref b
)
1518 if (a
== NULL
|| b
== NULL
)
1520 if (!loc_descr_equal_p_1 (a
, b
))
1529 /* Add a constant POLY_OFFSET to a location expression. */
1532 loc_descr_plus_const (dw_loc_descr_ref
*list_head
, poly_int64 poly_offset
)
1534 dw_loc_descr_ref loc
;
1537 gcc_assert (*list_head
!= NULL
);
1539 if (known_eq (poly_offset
, 0))
1542 /* Find the end of the chain. */
1543 for (loc
= *list_head
; loc
->dw_loc_next
!= NULL
; loc
= loc
->dw_loc_next
)
1546 HOST_WIDE_INT offset
;
1547 if (!poly_offset
.is_constant (&offset
))
1549 loc
->dw_loc_next
= int_loc_descriptor (poly_offset
);
1550 add_loc_descr (&loc
->dw_loc_next
, new_loc_descr (DW_OP_plus
, 0, 0));
1555 if (loc
->dw_loc_opc
== DW_OP_fbreg
1556 || (loc
->dw_loc_opc
>= DW_OP_breg0
&& loc
->dw_loc_opc
<= DW_OP_breg31
))
1557 p
= &loc
->dw_loc_oprnd1
.v
.val_int
;
1558 else if (loc
->dw_loc_opc
== DW_OP_bregx
)
1559 p
= &loc
->dw_loc_oprnd2
.v
.val_int
;
1561 /* If the last operation is fbreg, breg{0..31,x}, optimize by adjusting its
1562 offset. Don't optimize if an signed integer overflow would happen. */
1564 && ((offset
> 0 && *p
<= INTTYPE_MAXIMUM (HOST_WIDE_INT
) - offset
)
1565 || (offset
< 0 && *p
>= INTTYPE_MINIMUM (HOST_WIDE_INT
) - offset
)))
1568 else if (offset
> 0)
1569 loc
->dw_loc_next
= new_loc_descr (DW_OP_plus_uconst
, offset
, 0);
1574 = uint_loc_descriptor (-(unsigned HOST_WIDE_INT
) offset
);
1575 add_loc_descr (&loc
->dw_loc_next
, new_loc_descr (DW_OP_minus
, 0, 0));
1579 /* Return a pointer to a newly allocated location description for
1582 static inline dw_loc_descr_ref
1583 new_reg_loc_descr (unsigned int reg
, poly_int64 offset
)
1585 HOST_WIDE_INT const_offset
;
1586 if (offset
.is_constant (&const_offset
))
1589 return new_loc_descr ((enum dwarf_location_atom
) (DW_OP_breg0
+ reg
),
1592 return new_loc_descr (DW_OP_bregx
, reg
, const_offset
);
1596 dw_loc_descr_ref ret
= new_reg_loc_descr (reg
, 0);
1597 loc_descr_plus_const (&ret
, offset
);
1602 /* Add a constant OFFSET to a location list. */
1605 loc_list_plus_const (dw_loc_list_ref list_head
, poly_int64 offset
)
1608 for (d
= list_head
; d
!= NULL
; d
= d
->dw_loc_next
)
1609 loc_descr_plus_const (&d
->expr
, offset
);
1612 #define DWARF_REF_SIZE \
1613 (dwarf_version == 2 ? DWARF2_ADDR_SIZE : DWARF_OFFSET_SIZE)
1615 /* The number of bits that can be encoded by largest DW_FORM_dataN.
1616 In DWARF4 and earlier it is DW_FORM_data8 with 64 bits, in DWARF5
1617 DW_FORM_data16 with 128 bits. */
1618 #define DWARF_LARGEST_DATA_FORM_BITS \
1619 (dwarf_version >= 5 ? 128 : 64)
1621 /* Utility inline function for construction of ops that were GNU extension
1623 static inline enum dwarf_location_atom
1624 dwarf_OP (enum dwarf_location_atom op
)
1628 case DW_OP_implicit_pointer
:
1629 if (dwarf_version
< 5)
1630 return DW_OP_GNU_implicit_pointer
;
1633 case DW_OP_entry_value
:
1634 if (dwarf_version
< 5)
1635 return DW_OP_GNU_entry_value
;
1638 case DW_OP_const_type
:
1639 if (dwarf_version
< 5)
1640 return DW_OP_GNU_const_type
;
1643 case DW_OP_regval_type
:
1644 if (dwarf_version
< 5)
1645 return DW_OP_GNU_regval_type
;
1648 case DW_OP_deref_type
:
1649 if (dwarf_version
< 5)
1650 return DW_OP_GNU_deref_type
;
1654 if (dwarf_version
< 5)
1655 return DW_OP_GNU_convert
;
1658 case DW_OP_reinterpret
:
1659 if (dwarf_version
< 5)
1660 return DW_OP_GNU_reinterpret
;
1664 if (dwarf_version
< 5)
1665 return DW_OP_GNU_addr_index
;
1669 if (dwarf_version
< 5)
1670 return DW_OP_GNU_const_index
;
1679 /* Similarly for attributes. */
1680 static inline enum dwarf_attribute
1681 dwarf_AT (enum dwarf_attribute at
)
1685 case DW_AT_call_return_pc
:
1686 if (dwarf_version
< 5)
1687 return DW_AT_low_pc
;
1690 case DW_AT_call_tail_call
:
1691 if (dwarf_version
< 5)
1692 return DW_AT_GNU_tail_call
;
1695 case DW_AT_call_origin
:
1696 if (dwarf_version
< 5)
1697 return DW_AT_abstract_origin
;
1700 case DW_AT_call_target
:
1701 if (dwarf_version
< 5)
1702 return DW_AT_GNU_call_site_target
;
1705 case DW_AT_call_target_clobbered
:
1706 if (dwarf_version
< 5)
1707 return DW_AT_GNU_call_site_target_clobbered
;
1710 case DW_AT_call_parameter
:
1711 if (dwarf_version
< 5)
1712 return DW_AT_abstract_origin
;
1715 case DW_AT_call_value
:
1716 if (dwarf_version
< 5)
1717 return DW_AT_GNU_call_site_value
;
1720 case DW_AT_call_data_value
:
1721 if (dwarf_version
< 5)
1722 return DW_AT_GNU_call_site_data_value
;
1725 case DW_AT_call_all_calls
:
1726 if (dwarf_version
< 5)
1727 return DW_AT_GNU_all_call_sites
;
1730 case DW_AT_call_all_tail_calls
:
1731 if (dwarf_version
< 5)
1732 return DW_AT_GNU_all_tail_call_sites
;
1735 case DW_AT_dwo_name
:
1736 if (dwarf_version
< 5)
1737 return DW_AT_GNU_dwo_name
;
1740 case DW_AT_addr_base
:
1741 if (dwarf_version
< 5)
1742 return DW_AT_GNU_addr_base
;
1751 /* And similarly for tags. */
1752 static inline enum dwarf_tag
1753 dwarf_TAG (enum dwarf_tag tag
)
1757 case DW_TAG_call_site
:
1758 if (dwarf_version
< 5)
1759 return DW_TAG_GNU_call_site
;
1762 case DW_TAG_call_site_parameter
:
1763 if (dwarf_version
< 5)
1764 return DW_TAG_GNU_call_site_parameter
;
1773 /* And similarly for forms. */
1774 static inline enum dwarf_form
1775 dwarf_FORM (enum dwarf_form form
)
1780 if (dwarf_version
< 5)
1781 return DW_FORM_GNU_addr_index
;
1785 if (dwarf_version
< 5)
1786 return DW_FORM_GNU_str_index
;
1795 static unsigned long int get_base_type_offset (dw_die_ref
);
1797 /* Return the size of a location descriptor. */
1799 static unsigned long
1800 size_of_loc_descr (dw_loc_descr_ref loc
)
1802 unsigned long size
= 1;
1804 switch (loc
->dw_loc_opc
)
1807 size
+= DWARF2_ADDR_SIZE
;
1809 case DW_OP_GNU_addr_index
:
1811 case DW_OP_GNU_const_index
:
1813 gcc_assert (loc
->dw_loc_oprnd1
.val_entry
->index
!= NO_INDEX_ASSIGNED
);
1814 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.val_entry
->index
);
1833 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.v
.val_unsigned
);
1836 size
+= size_of_sleb128 (loc
->dw_loc_oprnd1
.v
.val_int
);
1841 case DW_OP_plus_uconst
:
1842 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.v
.val_unsigned
);
1880 size
+= size_of_sleb128 (loc
->dw_loc_oprnd1
.v
.val_int
);
1883 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.v
.val_unsigned
);
1886 size
+= size_of_sleb128 (loc
->dw_loc_oprnd1
.v
.val_int
);
1889 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.v
.val_unsigned
);
1890 size
+= size_of_sleb128 (loc
->dw_loc_oprnd2
.v
.val_int
);
1893 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.v
.val_unsigned
);
1895 case DW_OP_bit_piece
:
1896 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.v
.val_unsigned
);
1897 size
+= size_of_uleb128 (loc
->dw_loc_oprnd2
.v
.val_unsigned
);
1899 case DW_OP_deref_size
:
1900 case DW_OP_xderef_size
:
1909 case DW_OP_call_ref
:
1910 case DW_OP_GNU_variable_value
:
1911 size
+= DWARF_REF_SIZE
;
1913 case DW_OP_implicit_value
:
1914 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.v
.val_unsigned
)
1915 + loc
->dw_loc_oprnd1
.v
.val_unsigned
;
1917 case DW_OP_implicit_pointer
:
1918 case DW_OP_GNU_implicit_pointer
:
1919 size
+= DWARF_REF_SIZE
+ size_of_sleb128 (loc
->dw_loc_oprnd2
.v
.val_int
);
1921 case DW_OP_entry_value
:
1922 case DW_OP_GNU_entry_value
:
1924 unsigned long op_size
= size_of_locs (loc
->dw_loc_oprnd1
.v
.val_loc
);
1925 size
+= size_of_uleb128 (op_size
) + op_size
;
1928 case DW_OP_const_type
:
1929 case DW_OP_GNU_const_type
:
1932 = get_base_type_offset (loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
);
1933 size
+= size_of_uleb128 (o
) + 1;
1934 switch (loc
->dw_loc_oprnd2
.val_class
)
1936 case dw_val_class_vec
:
1937 size
+= loc
->dw_loc_oprnd2
.v
.val_vec
.length
1938 * loc
->dw_loc_oprnd2
.v
.val_vec
.elt_size
;
1940 case dw_val_class_const
:
1941 size
+= HOST_BITS_PER_WIDE_INT
/ BITS_PER_UNIT
;
1943 case dw_val_class_const_double
:
1944 size
+= HOST_BITS_PER_DOUBLE_INT
/ BITS_PER_UNIT
;
1946 case dw_val_class_wide_int
:
1947 size
+= (get_full_len (*loc
->dw_loc_oprnd2
.v
.val_wide
)
1948 * HOST_BITS_PER_WIDE_INT
/ BITS_PER_UNIT
);
1955 case DW_OP_regval_type
:
1956 case DW_OP_GNU_regval_type
:
1959 = get_base_type_offset (loc
->dw_loc_oprnd2
.v
.val_die_ref
.die
);
1960 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.v
.val_unsigned
)
1961 + size_of_uleb128 (o
);
1964 case DW_OP_deref_type
:
1965 case DW_OP_GNU_deref_type
:
1968 = get_base_type_offset (loc
->dw_loc_oprnd2
.v
.val_die_ref
.die
);
1969 size
+= 1 + size_of_uleb128 (o
);
1973 case DW_OP_reinterpret
:
1974 case DW_OP_GNU_convert
:
1975 case DW_OP_GNU_reinterpret
:
1976 if (loc
->dw_loc_oprnd1
.val_class
== dw_val_class_unsigned_const
)
1977 size
+= size_of_uleb128 (loc
->dw_loc_oprnd1
.v
.val_unsigned
);
1981 = get_base_type_offset (loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
);
1982 size
+= size_of_uleb128 (o
);
1985 case DW_OP_GNU_parameter_ref
:
1995 /* Return the size of a series of location descriptors. */
1998 size_of_locs (dw_loc_descr_ref loc
)
2003 /* If there are no skip or bra opcodes, don't fill in the dw_loc_addr
2004 field, to avoid writing to a PCH file. */
2005 for (size
= 0, l
= loc
; l
!= NULL
; l
= l
->dw_loc_next
)
2007 if (l
->dw_loc_opc
== DW_OP_skip
|| l
->dw_loc_opc
== DW_OP_bra
)
2009 size
+= size_of_loc_descr (l
);
2014 for (size
= 0, l
= loc
; l
!= NULL
; l
= l
->dw_loc_next
)
2016 l
->dw_loc_addr
= size
;
2017 size
+= size_of_loc_descr (l
);
2023 /* Return the size of the value in a DW_AT_discr_value attribute. */
2026 size_of_discr_value (dw_discr_value
*discr_value
)
2028 if (discr_value
->pos
)
2029 return size_of_uleb128 (discr_value
->v
.uval
);
2031 return size_of_sleb128 (discr_value
->v
.sval
);
2034 /* Return the size of the value in a DW_AT_discr_list attribute. */
2037 size_of_discr_list (dw_discr_list_ref discr_list
)
2041 for (dw_discr_list_ref list
= discr_list
;
2043 list
= list
->dw_discr_next
)
2045 /* One byte for the discriminant value descriptor, and then one or two
2046 LEB128 numbers, depending on whether it's a single case label or a
2049 size
+= size_of_discr_value (&list
->dw_discr_lower_bound
);
2050 if (list
->dw_discr_range
!= 0)
2051 size
+= size_of_discr_value (&list
->dw_discr_upper_bound
);
2056 static HOST_WIDE_INT
extract_int (const unsigned char *, unsigned);
2057 static void get_ref_die_offset_label (char *, dw_die_ref
);
2058 static unsigned long int get_ref_die_offset (dw_die_ref
);
2060 /* Output location description stack opcode's operands (if any).
2061 The for_eh_or_skip parameter controls whether register numbers are
2062 converted using DWARF2_FRAME_REG_OUT, which is needed in the case that
2063 hard reg numbers have been processed via DWARF_FRAME_REGNUM (i.e. for unwind
2064 info). This should be suppressed for the cases that have not been converted
2065 (i.e. symbolic debug info), by setting the parameter < 0. See PR47324. */
2068 output_loc_operands (dw_loc_descr_ref loc
, int for_eh_or_skip
)
2070 dw_val_ref val1
= &loc
->dw_loc_oprnd1
;
2071 dw_val_ref val2
= &loc
->dw_loc_oprnd2
;
2073 switch (loc
->dw_loc_opc
)
2075 #ifdef DWARF2_DEBUGGING_INFO
2078 dw2_asm_output_data (2, val1
->v
.val_int
, NULL
);
2083 gcc_assert (targetm
.asm_out
.output_dwarf_dtprel
);
2084 targetm
.asm_out
.output_dwarf_dtprel (asm_out_file
, 4,
2086 fputc ('\n', asm_out_file
);
2091 dw2_asm_output_data (4, val1
->v
.val_int
, NULL
);
2096 gcc_assert (targetm
.asm_out
.output_dwarf_dtprel
);
2097 targetm
.asm_out
.output_dwarf_dtprel (asm_out_file
, 8,
2099 fputc ('\n', asm_out_file
);
2104 gcc_assert (HOST_BITS_PER_WIDE_INT
>= 64);
2105 dw2_asm_output_data (8, val1
->v
.val_int
, NULL
);
2112 gcc_assert (val1
->val_class
== dw_val_class_loc
);
2113 offset
= val1
->v
.val_loc
->dw_loc_addr
- (loc
->dw_loc_addr
+ 3);
2115 dw2_asm_output_data (2, offset
, NULL
);
2118 case DW_OP_implicit_value
:
2119 dw2_asm_output_data_uleb128 (val1
->v
.val_unsigned
, NULL
);
2120 switch (val2
->val_class
)
2122 case dw_val_class_const
:
2123 dw2_asm_output_data (val1
->v
.val_unsigned
, val2
->v
.val_int
, NULL
);
2125 case dw_val_class_vec
:
2127 unsigned int elt_size
= val2
->v
.val_vec
.elt_size
;
2128 unsigned int len
= val2
->v
.val_vec
.length
;
2132 if (elt_size
> sizeof (HOST_WIDE_INT
))
2137 for (i
= 0, p
= (unsigned char *) val2
->v
.val_vec
.array
;
2140 dw2_asm_output_data (elt_size
, extract_int (p
, elt_size
),
2141 "fp or vector constant word %u", i
);
2144 case dw_val_class_const_double
:
2146 unsigned HOST_WIDE_INT first
, second
;
2148 if (WORDS_BIG_ENDIAN
)
2150 first
= val2
->v
.val_double
.high
;
2151 second
= val2
->v
.val_double
.low
;
2155 first
= val2
->v
.val_double
.low
;
2156 second
= val2
->v
.val_double
.high
;
2158 dw2_asm_output_data (HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
,
2160 dw2_asm_output_data (HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
,
2164 case dw_val_class_wide_int
:
2167 int len
= get_full_len (*val2
->v
.val_wide
);
2168 if (WORDS_BIG_ENDIAN
)
2169 for (i
= len
- 1; i
>= 0; --i
)
2170 dw2_asm_output_data (HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
,
2171 val2
->v
.val_wide
->elt (i
), NULL
);
2173 for (i
= 0; i
< len
; ++i
)
2174 dw2_asm_output_data (HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
,
2175 val2
->v
.val_wide
->elt (i
), NULL
);
2178 case dw_val_class_addr
:
2179 gcc_assert (val1
->v
.val_unsigned
== DWARF2_ADDR_SIZE
);
2180 dw2_asm_output_addr_rtx (DWARF2_ADDR_SIZE
, val2
->v
.val_addr
, NULL
);
2195 case DW_OP_implicit_value
:
2196 /* We currently don't make any attempt to make sure these are
2197 aligned properly like we do for the main unwind info, so
2198 don't support emitting things larger than a byte if we're
2199 only doing unwinding. */
2204 dw2_asm_output_data (1, val1
->v
.val_int
, NULL
);
2207 dw2_asm_output_data_uleb128 (val1
->v
.val_unsigned
, NULL
);
2210 dw2_asm_output_data_sleb128 (val1
->v
.val_int
, NULL
);
2213 dw2_asm_output_data (1, val1
->v
.val_int
, NULL
);
2215 case DW_OP_plus_uconst
:
2216 dw2_asm_output_data_uleb128 (val1
->v
.val_unsigned
, NULL
);
2250 dw2_asm_output_data_sleb128 (val1
->v
.val_int
, NULL
);
2254 unsigned r
= val1
->v
.val_unsigned
;
2255 if (for_eh_or_skip
>= 0)
2256 r
= DWARF2_FRAME_REG_OUT (r
, for_eh_or_skip
);
2257 gcc_assert (size_of_uleb128 (r
)
2258 == size_of_uleb128 (val1
->v
.val_unsigned
));
2259 dw2_asm_output_data_uleb128 (r
, NULL
);
2263 dw2_asm_output_data_sleb128 (val1
->v
.val_int
, NULL
);
2267 unsigned r
= val1
->v
.val_unsigned
;
2268 if (for_eh_or_skip
>= 0)
2269 r
= DWARF2_FRAME_REG_OUT (r
, for_eh_or_skip
);
2270 gcc_assert (size_of_uleb128 (r
)
2271 == size_of_uleb128 (val1
->v
.val_unsigned
));
2272 dw2_asm_output_data_uleb128 (r
, NULL
);
2273 dw2_asm_output_data_sleb128 (val2
->v
.val_int
, NULL
);
2277 dw2_asm_output_data_uleb128 (val1
->v
.val_unsigned
, NULL
);
2279 case DW_OP_bit_piece
:
2280 dw2_asm_output_data_uleb128 (val1
->v
.val_unsigned
, NULL
);
2281 dw2_asm_output_data_uleb128 (val2
->v
.val_unsigned
, NULL
);
2283 case DW_OP_deref_size
:
2284 case DW_OP_xderef_size
:
2285 dw2_asm_output_data (1, val1
->v
.val_int
, NULL
);
2291 if (targetm
.asm_out
.output_dwarf_dtprel
)
2293 targetm
.asm_out
.output_dwarf_dtprel (asm_out_file
,
2296 fputc ('\n', asm_out_file
);
2303 #ifdef DWARF2_DEBUGGING_INFO
2304 dw2_asm_output_addr_rtx (DWARF2_ADDR_SIZE
, val1
->v
.val_addr
, NULL
);
2311 case DW_OP_GNU_addr_index
:
2313 case DW_OP_GNU_const_index
:
2315 gcc_assert (loc
->dw_loc_oprnd1
.val_entry
->index
!= NO_INDEX_ASSIGNED
);
2316 dw2_asm_output_data_uleb128 (loc
->dw_loc_oprnd1
.val_entry
->index
,
2317 "(index into .debug_addr)");
2323 unsigned long die_offset
2324 = get_ref_die_offset (val1
->v
.val_die_ref
.die
);
2325 /* Make sure the offset has been computed and that we can encode it as
2327 gcc_assert (die_offset
> 0
2328 && die_offset
<= (loc
->dw_loc_opc
== DW_OP_call2
2331 dw2_asm_output_data ((loc
->dw_loc_opc
== DW_OP_call2
) ? 2 : 4,
2336 case DW_OP_call_ref
:
2337 case DW_OP_GNU_variable_value
:
2339 char label
[MAX_ARTIFICIAL_LABEL_BYTES
2340 + HOST_BITS_PER_WIDE_INT
/ 2 + 2];
2341 gcc_assert (val1
->val_class
== dw_val_class_die_ref
);
2342 get_ref_die_offset_label (label
, val1
->v
.val_die_ref
.die
);
2343 dw2_asm_output_offset (DWARF_REF_SIZE
, label
, debug_info_section
, NULL
);
2347 case DW_OP_implicit_pointer
:
2348 case DW_OP_GNU_implicit_pointer
:
2350 char label
[MAX_ARTIFICIAL_LABEL_BYTES
2351 + HOST_BITS_PER_WIDE_INT
/ 2 + 2];
2352 gcc_assert (val1
->val_class
== dw_val_class_die_ref
);
2353 get_ref_die_offset_label (label
, val1
->v
.val_die_ref
.die
);
2354 dw2_asm_output_offset (DWARF_REF_SIZE
, label
, debug_info_section
, NULL
);
2355 dw2_asm_output_data_sleb128 (val2
->v
.val_int
, NULL
);
2359 case DW_OP_entry_value
:
2360 case DW_OP_GNU_entry_value
:
2361 dw2_asm_output_data_uleb128 (size_of_locs (val1
->v
.val_loc
), NULL
);
2362 output_loc_sequence (val1
->v
.val_loc
, for_eh_or_skip
);
2365 case DW_OP_const_type
:
2366 case DW_OP_GNU_const_type
:
2368 unsigned long o
= get_base_type_offset (val1
->v
.val_die_ref
.die
), l
;
2370 dw2_asm_output_data_uleb128 (o
, NULL
);
2371 switch (val2
->val_class
)
2373 case dw_val_class_const
:
2374 l
= HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
;
2375 dw2_asm_output_data (1, l
, NULL
);
2376 dw2_asm_output_data (l
, val2
->v
.val_int
, NULL
);
2378 case dw_val_class_vec
:
2380 unsigned int elt_size
= val2
->v
.val_vec
.elt_size
;
2381 unsigned int len
= val2
->v
.val_vec
.length
;
2386 dw2_asm_output_data (1, l
, NULL
);
2387 if (elt_size
> sizeof (HOST_WIDE_INT
))
2392 for (i
= 0, p
= (unsigned char *) val2
->v
.val_vec
.array
;
2395 dw2_asm_output_data (elt_size
, extract_int (p
, elt_size
),
2396 "fp or vector constant word %u", i
);
2399 case dw_val_class_const_double
:
2401 unsigned HOST_WIDE_INT first
, second
;
2402 l
= HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
;
2404 dw2_asm_output_data (1, 2 * l
, NULL
);
2405 if (WORDS_BIG_ENDIAN
)
2407 first
= val2
->v
.val_double
.high
;
2408 second
= val2
->v
.val_double
.low
;
2412 first
= val2
->v
.val_double
.low
;
2413 second
= val2
->v
.val_double
.high
;
2415 dw2_asm_output_data (l
, first
, NULL
);
2416 dw2_asm_output_data (l
, second
, NULL
);
2419 case dw_val_class_wide_int
:
2422 int len
= get_full_len (*val2
->v
.val_wide
);
2423 l
= HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
;
2425 dw2_asm_output_data (1, len
* l
, NULL
);
2426 if (WORDS_BIG_ENDIAN
)
2427 for (i
= len
- 1; i
>= 0; --i
)
2428 dw2_asm_output_data (l
, val2
->v
.val_wide
->elt (i
), NULL
);
2430 for (i
= 0; i
< len
; ++i
)
2431 dw2_asm_output_data (l
, val2
->v
.val_wide
->elt (i
), NULL
);
2439 case DW_OP_regval_type
:
2440 case DW_OP_GNU_regval_type
:
2442 unsigned r
= val1
->v
.val_unsigned
;
2443 unsigned long o
= get_base_type_offset (val2
->v
.val_die_ref
.die
);
2445 if (for_eh_or_skip
>= 0)
2447 r
= DWARF2_FRAME_REG_OUT (r
, for_eh_or_skip
);
2448 gcc_assert (size_of_uleb128 (r
)
2449 == size_of_uleb128 (val1
->v
.val_unsigned
));
2451 dw2_asm_output_data_uleb128 (r
, NULL
);
2452 dw2_asm_output_data_uleb128 (o
, NULL
);
2455 case DW_OP_deref_type
:
2456 case DW_OP_GNU_deref_type
:
2458 unsigned long o
= get_base_type_offset (val2
->v
.val_die_ref
.die
);
2460 dw2_asm_output_data (1, val1
->v
.val_int
, NULL
);
2461 dw2_asm_output_data_uleb128 (o
, NULL
);
2465 case DW_OP_reinterpret
:
2466 case DW_OP_GNU_convert
:
2467 case DW_OP_GNU_reinterpret
:
2468 if (loc
->dw_loc_oprnd1
.val_class
== dw_val_class_unsigned_const
)
2469 dw2_asm_output_data_uleb128 (val1
->v
.val_unsigned
, NULL
);
2472 unsigned long o
= get_base_type_offset (val1
->v
.val_die_ref
.die
);
2474 dw2_asm_output_data_uleb128 (o
, NULL
);
2478 case DW_OP_GNU_parameter_ref
:
2481 gcc_assert (val1
->val_class
== dw_val_class_die_ref
);
2482 o
= get_ref_die_offset (val1
->v
.val_die_ref
.die
);
2483 dw2_asm_output_data (4, o
, NULL
);
2488 /* Other codes have no operands. */
2493 /* Output a sequence of location operations.
2494 The for_eh_or_skip parameter controls whether register numbers are
2495 converted using DWARF2_FRAME_REG_OUT, which is needed in the case that
2496 hard reg numbers have been processed via DWARF_FRAME_REGNUM (i.e. for unwind
2497 info). This should be suppressed for the cases that have not been converted
2498 (i.e. symbolic debug info), by setting the parameter < 0. See PR47324. */
2501 output_loc_sequence (dw_loc_descr_ref loc
, int for_eh_or_skip
)
2503 for (; loc
!= NULL
; loc
= loc
->dw_loc_next
)
2505 enum dwarf_location_atom opc
= loc
->dw_loc_opc
;
2506 /* Output the opcode. */
2507 if (for_eh_or_skip
>= 0
2508 && opc
>= DW_OP_breg0
&& opc
<= DW_OP_breg31
)
2510 unsigned r
= (opc
- DW_OP_breg0
);
2511 r
= DWARF2_FRAME_REG_OUT (r
, for_eh_or_skip
);
2512 gcc_assert (r
<= 31);
2513 opc
= (enum dwarf_location_atom
) (DW_OP_breg0
+ r
);
2515 else if (for_eh_or_skip
>= 0
2516 && opc
>= DW_OP_reg0
&& opc
<= DW_OP_reg31
)
2518 unsigned r
= (opc
- DW_OP_reg0
);
2519 r
= DWARF2_FRAME_REG_OUT (r
, for_eh_or_skip
);
2520 gcc_assert (r
<= 31);
2521 opc
= (enum dwarf_location_atom
) (DW_OP_reg0
+ r
);
2524 dw2_asm_output_data (1, opc
,
2525 "%s", dwarf_stack_op_name (opc
));
2527 /* Output the operand(s) (if any). */
2528 output_loc_operands (loc
, for_eh_or_skip
);
2532 /* Output location description stack opcode's operands (if any).
2533 The output is single bytes on a line, suitable for .cfi_escape. */
2536 output_loc_operands_raw (dw_loc_descr_ref loc
)
2538 dw_val_ref val1
= &loc
->dw_loc_oprnd1
;
2539 dw_val_ref val2
= &loc
->dw_loc_oprnd2
;
2541 switch (loc
->dw_loc_opc
)
2544 case DW_OP_GNU_addr_index
:
2546 case DW_OP_GNU_const_index
:
2548 case DW_OP_implicit_value
:
2549 /* We cannot output addresses in .cfi_escape, only bytes. */
2555 case DW_OP_deref_size
:
2556 case DW_OP_xderef_size
:
2557 fputc (',', asm_out_file
);
2558 dw2_asm_output_data_raw (1, val1
->v
.val_int
);
2563 fputc (',', asm_out_file
);
2564 dw2_asm_output_data_raw (2, val1
->v
.val_int
);
2569 fputc (',', asm_out_file
);
2570 dw2_asm_output_data_raw (4, val1
->v
.val_int
);
2575 gcc_assert (HOST_BITS_PER_WIDE_INT
>= 64);
2576 fputc (',', asm_out_file
);
2577 dw2_asm_output_data_raw (8, val1
->v
.val_int
);
2585 gcc_assert (val1
->val_class
== dw_val_class_loc
);
2586 offset
= val1
->v
.val_loc
->dw_loc_addr
- (loc
->dw_loc_addr
+ 3);
2588 fputc (',', asm_out_file
);
2589 dw2_asm_output_data_raw (2, offset
);
2595 unsigned r
= DWARF2_FRAME_REG_OUT (val1
->v
.val_unsigned
, 1);
2596 gcc_assert (size_of_uleb128 (r
)
2597 == size_of_uleb128 (val1
->v
.val_unsigned
));
2598 fputc (',', asm_out_file
);
2599 dw2_asm_output_data_uleb128_raw (r
);
2604 case DW_OP_plus_uconst
:
2606 fputc (',', asm_out_file
);
2607 dw2_asm_output_data_uleb128_raw (val1
->v
.val_unsigned
);
2610 case DW_OP_bit_piece
:
2611 fputc (',', asm_out_file
);
2612 dw2_asm_output_data_uleb128_raw (val1
->v
.val_unsigned
);
2613 dw2_asm_output_data_uleb128_raw (val2
->v
.val_unsigned
);
2650 fputc (',', asm_out_file
);
2651 dw2_asm_output_data_sleb128_raw (val1
->v
.val_int
);
2656 unsigned r
= DWARF2_FRAME_REG_OUT (val1
->v
.val_unsigned
, 1);
2657 gcc_assert (size_of_uleb128 (r
)
2658 == size_of_uleb128 (val1
->v
.val_unsigned
));
2659 fputc (',', asm_out_file
);
2660 dw2_asm_output_data_uleb128_raw (r
);
2661 fputc (',', asm_out_file
);
2662 dw2_asm_output_data_sleb128_raw (val2
->v
.val_int
);
2666 case DW_OP_implicit_pointer
:
2667 case DW_OP_entry_value
:
2668 case DW_OP_const_type
:
2669 case DW_OP_regval_type
:
2670 case DW_OP_deref_type
:
2672 case DW_OP_reinterpret
:
2673 case DW_OP_GNU_implicit_pointer
:
2674 case DW_OP_GNU_entry_value
:
2675 case DW_OP_GNU_const_type
:
2676 case DW_OP_GNU_regval_type
:
2677 case DW_OP_GNU_deref_type
:
2678 case DW_OP_GNU_convert
:
2679 case DW_OP_GNU_reinterpret
:
2680 case DW_OP_GNU_parameter_ref
:
2685 /* Other codes have no operands. */
2691 output_loc_sequence_raw (dw_loc_descr_ref loc
)
2695 enum dwarf_location_atom opc
= loc
->dw_loc_opc
;
2696 /* Output the opcode. */
2697 if (opc
>= DW_OP_breg0
&& opc
<= DW_OP_breg31
)
2699 unsigned r
= (opc
- DW_OP_breg0
);
2700 r
= DWARF2_FRAME_REG_OUT (r
, 1);
2701 gcc_assert (r
<= 31);
2702 opc
= (enum dwarf_location_atom
) (DW_OP_breg0
+ r
);
2704 else if (opc
>= DW_OP_reg0
&& opc
<= DW_OP_reg31
)
2706 unsigned r
= (opc
- DW_OP_reg0
);
2707 r
= DWARF2_FRAME_REG_OUT (r
, 1);
2708 gcc_assert (r
<= 31);
2709 opc
= (enum dwarf_location_atom
) (DW_OP_reg0
+ r
);
2711 /* Output the opcode. */
2712 fprintf (asm_out_file
, "%#x", opc
);
2713 output_loc_operands_raw (loc
);
2715 if (!loc
->dw_loc_next
)
2717 loc
= loc
->dw_loc_next
;
2719 fputc (',', asm_out_file
);
2723 /* This function builds a dwarf location descriptor sequence from a
2724 dw_cfa_location, adding the given OFFSET to the result of the
2727 struct dw_loc_descr_node
*
2728 build_cfa_loc (dw_cfa_location
*cfa
, poly_int64 offset
)
2730 struct dw_loc_descr_node
*head
, *tmp
;
2732 offset
+= cfa
->offset
;
2736 head
= new_reg_loc_descr (cfa
->reg
, cfa
->base_offset
);
2737 head
->dw_loc_oprnd1
.val_class
= dw_val_class_const
;
2738 head
->dw_loc_oprnd1
.val_entry
= NULL
;
2739 tmp
= new_loc_descr (DW_OP_deref
, 0, 0);
2740 add_loc_descr (&head
, tmp
);
2741 loc_descr_plus_const (&head
, offset
);
2744 head
= new_reg_loc_descr (cfa
->reg
, offset
);
2749 /* This function builds a dwarf location descriptor sequence for
2750 the address at OFFSET from the CFA when stack is aligned to
2753 struct dw_loc_descr_node
*
2754 build_cfa_aligned_loc (dw_cfa_location
*cfa
,
2755 poly_int64 offset
, HOST_WIDE_INT alignment
)
2757 struct dw_loc_descr_node
*head
;
2758 unsigned int dwarf_fp
2759 = DWARF_FRAME_REGNUM (HARD_FRAME_POINTER_REGNUM
);
2761 /* When CFA is defined as FP+OFFSET, emulate stack alignment. */
2762 if (cfa
->reg
== HARD_FRAME_POINTER_REGNUM
&& cfa
->indirect
== 0)
2764 head
= new_reg_loc_descr (dwarf_fp
, 0);
2765 add_loc_descr (&head
, int_loc_descriptor (alignment
));
2766 add_loc_descr (&head
, new_loc_descr (DW_OP_and
, 0, 0));
2767 loc_descr_plus_const (&head
, offset
);
2770 head
= new_reg_loc_descr (dwarf_fp
, offset
);
2774 /* And now, the support for symbolic debugging information. */
2776 /* .debug_str support. */
2778 static void dwarf2out_init (const char *);
2779 static void dwarf2out_finish (const char *);
2780 static void dwarf2out_early_finish (const char *);
2781 static void dwarf2out_assembly_start (void);
2782 static void dwarf2out_define (unsigned int, const char *);
2783 static void dwarf2out_undef (unsigned int, const char *);
2784 static void dwarf2out_start_source_file (unsigned, const char *);
2785 static void dwarf2out_end_source_file (unsigned);
2786 static void dwarf2out_function_decl (tree
);
2787 static void dwarf2out_begin_block (unsigned, unsigned);
2788 static void dwarf2out_end_block (unsigned, unsigned);
2789 static bool dwarf2out_ignore_block (const_tree
);
2790 static void dwarf2out_early_global_decl (tree
);
2791 static void dwarf2out_late_global_decl (tree
);
2792 static void dwarf2out_type_decl (tree
, int);
2793 static void dwarf2out_imported_module_or_decl (tree
, tree
, tree
, bool, bool);
2794 static void dwarf2out_imported_module_or_decl_1 (tree
, tree
, tree
,
2796 static void dwarf2out_abstract_function (tree
);
2797 static void dwarf2out_var_location (rtx_insn
*);
2798 static void dwarf2out_inline_entry (tree
);
2799 static void dwarf2out_size_function (tree
);
2800 static void dwarf2out_begin_function (tree
);
2801 static void dwarf2out_end_function (unsigned int);
2802 static void dwarf2out_register_main_translation_unit (tree unit
);
2803 static void dwarf2out_set_name (tree
, tree
);
2804 static void dwarf2out_register_external_die (tree decl
, const char *sym
,
2805 unsigned HOST_WIDE_INT off
);
2806 static bool dwarf2out_die_ref_for_decl (tree decl
, const char **sym
,
2807 unsigned HOST_WIDE_INT
*off
);
2809 /* The debug hooks structure. */
2811 const struct gcc_debug_hooks dwarf2_debug_hooks
=
2815 dwarf2out_early_finish
,
2816 dwarf2out_assembly_start
,
2819 dwarf2out_start_source_file
,
2820 dwarf2out_end_source_file
,
2821 dwarf2out_begin_block
,
2822 dwarf2out_end_block
,
2823 dwarf2out_ignore_block
,
2824 dwarf2out_source_line
,
2825 dwarf2out_begin_prologue
,
2826 #if VMS_DEBUGGING_INFO
2827 dwarf2out_vms_end_prologue
,
2828 dwarf2out_vms_begin_epilogue
,
2830 debug_nothing_int_charstar
,
2831 debug_nothing_int_charstar
,
2833 dwarf2out_end_epilogue
,
2834 dwarf2out_begin_function
,
2835 dwarf2out_end_function
, /* end_function */
2836 dwarf2out_register_main_translation_unit
,
2837 dwarf2out_function_decl
, /* function_decl */
2838 dwarf2out_early_global_decl
,
2839 dwarf2out_late_global_decl
,
2840 dwarf2out_type_decl
, /* type_decl */
2841 dwarf2out_imported_module_or_decl
,
2842 dwarf2out_die_ref_for_decl
,
2843 dwarf2out_register_external_die
,
2844 debug_nothing_tree
, /* deferred_inline_function */
2845 /* The DWARF 2 backend tries to reduce debugging bloat by not
2846 emitting the abstract description of inline functions until
2847 something tries to reference them. */
2848 dwarf2out_abstract_function
, /* outlining_inline_function */
2849 debug_nothing_rtx_code_label
, /* label */
2850 debug_nothing_int
, /* handle_pch */
2851 dwarf2out_var_location
,
2852 dwarf2out_inline_entry
, /* inline_entry */
2853 dwarf2out_size_function
, /* size_function */
2854 dwarf2out_switch_text_section
,
2856 1, /* start_end_main_source_file */
2857 TYPE_SYMTAB_IS_DIE
/* tree_type_symtab_field */
2860 const struct gcc_debug_hooks dwarf2_lineno_debug_hooks
=
2863 debug_nothing_charstar
,
2864 debug_nothing_charstar
,
2865 dwarf2out_assembly_start
,
2866 debug_nothing_int_charstar
,
2867 debug_nothing_int_charstar
,
2868 debug_nothing_int_charstar
,
2870 debug_nothing_int_int
, /* begin_block */
2871 debug_nothing_int_int
, /* end_block */
2872 debug_true_const_tree
, /* ignore_block */
2873 dwarf2out_source_line
, /* source_line */
2874 debug_nothing_int_int_charstar
, /* begin_prologue */
2875 debug_nothing_int_charstar
, /* end_prologue */
2876 debug_nothing_int_charstar
, /* begin_epilogue */
2877 debug_nothing_int_charstar
, /* end_epilogue */
2878 debug_nothing_tree
, /* begin_function */
2879 debug_nothing_int
, /* end_function */
2880 debug_nothing_tree
, /* register_main_translation_unit */
2881 debug_nothing_tree
, /* function_decl */
2882 debug_nothing_tree
, /* early_global_decl */
2883 debug_nothing_tree
, /* late_global_decl */
2884 debug_nothing_tree_int
, /* type_decl */
2885 debug_nothing_tree_tree_tree_bool_bool
,/* imported_module_or_decl */
2886 debug_false_tree_charstarstar_uhwistar
,/* die_ref_for_decl */
2887 debug_nothing_tree_charstar_uhwi
, /* register_external_die */
2888 debug_nothing_tree
, /* deferred_inline_function */
2889 debug_nothing_tree
, /* outlining_inline_function */
2890 debug_nothing_rtx_code_label
, /* label */
2891 debug_nothing_int
, /* handle_pch */
2892 debug_nothing_rtx_insn
, /* var_location */
2893 debug_nothing_tree
, /* inline_entry */
2894 debug_nothing_tree
, /* size_function */
2895 debug_nothing_void
, /* switch_text_section */
2896 debug_nothing_tree_tree
, /* set_name */
2897 0, /* start_end_main_source_file */
2898 TYPE_SYMTAB_IS_ADDRESS
/* tree_type_symtab_field */
2901 /* NOTE: In the comments in this file, many references are made to
2902 "Debugging Information Entries". This term is abbreviated as `DIE'
2903 throughout the remainder of this file. */
2905 /* An internal representation of the DWARF output is built, and then
2906 walked to generate the DWARF debugging info. The walk of the internal
2907 representation is done after the entire program has been compiled.
2908 The types below are used to describe the internal representation. */
2910 /* Whether to put type DIEs into their own section .debug_types instead
2911 of making them part of the .debug_info section. Only supported for
2912 Dwarf V4 or higher and the user didn't disable them through
2913 -fno-debug-types-section. It is more efficient to put them in a
2914 separate comdat sections since the linker will then be able to
2915 remove duplicates. But not all tools support .debug_types sections
2916 yet. For Dwarf V5 or higher .debug_types doesn't exist any more,
2917 it is DW_UT_type unit type in .debug_info section. For late LTO
2918 debug there should be almost no types emitted so avoid enabling
2919 -fdebug-types-section there. */
2921 #define use_debug_types (dwarf_version >= 4 \
2922 && flag_debug_types_section \
2925 /* Various DIE's use offsets relative to the beginning of the
2926 .debug_info section to refer to each other. */
2928 typedef long int dw_offset
;
2930 struct comdat_type_node
;
2932 /* The entries in the line_info table more-or-less mirror the opcodes
2933 that are used in the real dwarf line table. Arrays of these entries
2934 are collected per section when DWARF2_ASM_LINE_DEBUG_INFO is not
2937 enum dw_line_info_opcode
{
2938 /* Emit DW_LNE_set_address; the operand is the label index. */
2941 /* Emit a row to the matrix with the given line. This may be done
2942 via any combination of DW_LNS_copy, DW_LNS_advance_line, and
2946 /* Emit a DW_LNS_set_file. */
2949 /* Emit a DW_LNS_set_column. */
2952 /* Emit a DW_LNS_negate_stmt; the operand is ignored. */
2955 /* Emit a DW_LNS_set_prologue_end/epilogue_begin; the operand is ignored. */
2956 LI_set_prologue_end
,
2957 LI_set_epilogue_begin
,
2959 /* Emit a DW_LNE_set_discriminator. */
2960 LI_set_discriminator
,
2962 /* Output a Fixed Advance PC; the target PC is the label index; the
2963 base PC is the previous LI_adv_address or LI_set_address entry.
2964 We only use this when emitting debug views without assembler
2965 support, at explicit user request. Ideally, we should only use
2966 it when the offset might be zero but we can't tell: it's the only
2967 way to maybe change the PC without resetting the view number. */
2971 typedef struct GTY(()) dw_line_info_struct
{
2972 enum dw_line_info_opcode opcode
;
2974 } dw_line_info_entry
;
2977 struct GTY(()) dw_line_info_table
{
2978 /* The label that marks the end of this section. */
2979 const char *end_label
;
2981 /* The values for the last row of the matrix, as collected in the table.
2982 These are used to minimize the changes to the next row. */
2983 unsigned int file_num
;
2984 unsigned int line_num
;
2985 unsigned int column_num
;
2990 /* This denotes the NEXT view number.
2992 If it is 0, it is known that the NEXT view will be the first view
2995 If it is -1, we're forcing the view number to be reset, e.g. at a
2998 The meaning of other nonzero values depends on whether we're
2999 computing views internally or leaving it for the assembler to do
3000 so. If we're emitting them internally, view denotes the view
3001 number since the last known advance of PC. If we're leaving it
3002 for the assembler, it denotes the LVU label number that we're
3003 going to ask the assembler to assign. */
3006 /* This counts the number of symbolic views emitted in this table
3007 since the latest view reset. Its max value, over all tables,
3008 sets symview_upper_bound. */
3009 var_loc_view symviews_since_reset
;
3011 #define FORCE_RESET_NEXT_VIEW(x) ((x) = (var_loc_view)-1)
3012 #define RESET_NEXT_VIEW(x) ((x) = (var_loc_view)0)
3013 #define FORCE_RESETTING_VIEW_P(x) ((x) == (var_loc_view)-1)
3014 #define RESETTING_VIEW_P(x) ((x) == (var_loc_view)0 || FORCE_RESETTING_VIEW_P (x))
3016 vec
<dw_line_info_entry
, va_gc
> *entries
;
3019 /* This is an upper bound for view numbers that the assembler may
3020 assign to symbolic views output in this translation. It is used to
3021 decide how big a field to use to represent view numbers in
3022 symview-classed attributes. */
3024 static var_loc_view symview_upper_bound
;
3026 /* If we're keep track of location views and their reset points, and
3027 INSN is a reset point (i.e., it necessarily advances the PC), mark
3028 the next view in TABLE as reset. */
3031 maybe_reset_location_view (rtx_insn
*insn
, dw_line_info_table
*table
)
3033 if (!debug_internal_reset_location_views
)
3036 /* Maybe turn (part of?) this test into a default target hook. */
3039 if (targetm
.reset_location_view
)
3040 reset
= targetm
.reset_location_view (insn
);
3044 else if (JUMP_TABLE_DATA_P (insn
))
3046 else if (GET_CODE (insn
) == USE
3047 || GET_CODE (insn
) == CLOBBER
3048 || GET_CODE (insn
) == ASM_INPUT
3049 || asm_noperands (insn
) >= 0)
3051 else if (get_attr_min_length (insn
) > 0)
3054 if (reset
> 0 && !RESETTING_VIEW_P (table
->view
))
3055 RESET_NEXT_VIEW (table
->view
);
3058 /* Each DIE attribute has a field specifying the attribute kind,
3059 a link to the next attribute in the chain, and an attribute value.
3060 Attributes are typically linked below the DIE they modify. */
3062 typedef struct GTY(()) dw_attr_struct
{
3063 enum dwarf_attribute dw_attr
;
3064 dw_val_node dw_attr_val
;
3069 /* The Debugging Information Entry (DIE) structure. DIEs form a tree.
3070 The children of each node form a circular list linked by
3071 die_sib. die_child points to the node *before* the "first" child node. */
3073 typedef struct GTY((chain_circular ("%h.die_sib"), for_user
)) die_struct
{
3074 union die_symbol_or_type_node
3076 const char * GTY ((tag ("0"))) die_symbol
;
3077 comdat_type_node
*GTY ((tag ("1"))) die_type_node
;
3079 GTY ((desc ("%0.comdat_type_p"))) die_id
;
3080 vec
<dw_attr_node
, va_gc
> *die_attr
;
3081 dw_die_ref die_parent
;
3082 dw_die_ref die_child
;
3084 dw_die_ref die_definition
; /* ref from a specification to its definition */
3085 dw_offset die_offset
;
3086 unsigned long die_abbrev
;
3088 unsigned int decl_id
;
3089 enum dwarf_tag die_tag
;
3090 /* Die is used and must not be pruned as unused. */
3091 BOOL_BITFIELD die_perennial_p
: 1;
3092 BOOL_BITFIELD comdat_type_p
: 1; /* DIE has a type signature */
3093 /* For an external ref to die_symbol if die_offset contains an extra
3094 offset to that symbol. */
3095 BOOL_BITFIELD with_offset
: 1;
3096 /* Whether this DIE was removed from the DIE tree, for example via
3097 prune_unused_types. We don't consider those present from the
3098 DIE lookup routines. */
3099 BOOL_BITFIELD removed
: 1;
3100 /* Lots of spare bits. */
3104 /* Set to TRUE while dwarf2out_early_global_decl is running. */
3105 static bool early_dwarf
;
3106 static bool early_dwarf_finished
;
3107 class set_early_dwarf
{
3110 set_early_dwarf () : saved(early_dwarf
)
3112 gcc_assert (! early_dwarf_finished
);
3115 ~set_early_dwarf () { early_dwarf
= saved
; }
3118 /* Evaluate 'expr' while 'c' is set to each child of DIE in order. */
3119 #define FOR_EACH_CHILD(die, c, expr) do { \
3120 c = die->die_child; \
3124 } while (c != die->die_child); \
3127 /* The pubname structure */
3129 typedef struct GTY(()) pubname_struct
{
3136 struct GTY(()) dw_ranges
{
3138 /* If this is positive, it's a block number, otherwise it's a
3139 bitwise-negated index into dw_ranges_by_label. */
3141 /* Index for the range list for DW_FORM_rnglistx. */
3142 unsigned int idx
: 31;
3143 /* True if this range might be possibly in a different section
3144 from previous entry. */
3145 unsigned int maybe_new_sec
: 1;
3148 /* A structure to hold a macinfo entry. */
3150 typedef struct GTY(()) macinfo_struct
{
3152 unsigned HOST_WIDE_INT lineno
;
3158 struct GTY(()) dw_ranges_by_label
{
3163 /* The comdat type node structure. */
3164 struct GTY(()) comdat_type_node
3166 dw_die_ref root_die
;
3167 dw_die_ref type_die
;
3168 dw_die_ref skeleton_die
;
3169 char signature
[DWARF_TYPE_SIGNATURE_SIZE
];
3170 comdat_type_node
*next
;
3173 /* A list of DIEs for which we can't determine ancestry (parent_die
3174 field) just yet. Later in dwarf2out_finish we will fill in the
3176 typedef struct GTY(()) limbo_die_struct
{
3178 /* The tree for which this DIE was created. We use this to
3179 determine ancestry later. */
3181 struct limbo_die_struct
*next
;
3185 typedef struct skeleton_chain_struct
3189 struct skeleton_chain_struct
*parent
;
3191 skeleton_chain_node
;
3193 /* Define a macro which returns nonzero for a TYPE_DECL which was
3194 implicitly generated for a type.
3196 Note that, unlike the C front-end (which generates a NULL named
3197 TYPE_DECL node for each complete tagged type, each array type,
3198 and each function type node created) the C++ front-end generates
3199 a _named_ TYPE_DECL node for each tagged type node created.
3200 These TYPE_DECLs have DECL_ARTIFICIAL set, so we know not to
3201 generate a DW_TAG_typedef DIE for them. Likewise with the Ada
3202 front-end, but for each type, tagged or not. */
3204 #define TYPE_DECL_IS_STUB(decl) \
3205 (DECL_NAME (decl) == NULL_TREE \
3206 || (DECL_ARTIFICIAL (decl) \
3207 && ((decl == TYPE_STUB_DECL (TREE_TYPE (decl))) \
3208 /* This is necessary for stub decls that \
3209 appear in nested inline functions. */ \
3210 || (DECL_ABSTRACT_ORIGIN (decl) != NULL_TREE \
3211 && (decl_ultimate_origin (decl) \
3212 == TYPE_STUB_DECL (TREE_TYPE (decl)))))))
3214 /* Information concerning the compilation unit's programming
3215 language, and compiler version. */
3217 /* Fixed size portion of the DWARF compilation unit header. */
3218 #define DWARF_COMPILE_UNIT_HEADER_SIZE \
3219 (DWARF_INITIAL_LENGTH_SIZE + DWARF_OFFSET_SIZE \
3220 + (dwarf_version >= 5 ? 4 : 3))
3222 /* Fixed size portion of the DWARF comdat type unit header. */
3223 #define DWARF_COMDAT_TYPE_UNIT_HEADER_SIZE \
3224 (DWARF_COMPILE_UNIT_HEADER_SIZE \
3225 + DWARF_TYPE_SIGNATURE_SIZE + DWARF_OFFSET_SIZE)
3227 /* Fixed size portion of the DWARF skeleton compilation unit header. */
3228 #define DWARF_COMPILE_UNIT_SKELETON_HEADER_SIZE \
3229 (DWARF_COMPILE_UNIT_HEADER_SIZE + (dwarf_version >= 5 ? 8 : 0))
3231 /* Fixed size portion of public names info. */
3232 #define DWARF_PUBNAMES_HEADER_SIZE (2 * DWARF_OFFSET_SIZE + 2)
3234 /* Fixed size portion of the address range info. */
3235 #define DWARF_ARANGES_HEADER_SIZE \
3236 (DWARF_ROUND (DWARF_INITIAL_LENGTH_SIZE + DWARF_OFFSET_SIZE + 4, \
3237 DWARF2_ADDR_SIZE * 2) \
3238 - DWARF_INITIAL_LENGTH_SIZE)
3240 /* Size of padding portion in the address range info. It must be
3241 aligned to twice the pointer size. */
3242 #define DWARF_ARANGES_PAD_SIZE \
3243 (DWARF_ROUND (DWARF_INITIAL_LENGTH_SIZE + DWARF_OFFSET_SIZE + 4, \
3244 DWARF2_ADDR_SIZE * 2) \
3245 - (DWARF_INITIAL_LENGTH_SIZE + DWARF_OFFSET_SIZE + 4))
3247 /* Use assembler line directives if available. */
3248 #ifndef DWARF2_ASM_LINE_DEBUG_INFO
3249 #ifdef HAVE_AS_DWARF2_DEBUG_LINE
3250 #define DWARF2_ASM_LINE_DEBUG_INFO 1
3252 #define DWARF2_ASM_LINE_DEBUG_INFO 0
3256 /* Use assembler views in line directives if available. */
3257 #ifndef DWARF2_ASM_VIEW_DEBUG_INFO
3258 #ifdef HAVE_AS_DWARF2_DEBUG_VIEW
3259 #define DWARF2_ASM_VIEW_DEBUG_INFO 1
3261 #define DWARF2_ASM_VIEW_DEBUG_INFO 0
3265 /* Return true if GCC configure detected assembler support for .loc. */
3268 dwarf2out_default_as_loc_support (void)
3270 return DWARF2_ASM_LINE_DEBUG_INFO
;
3271 #if (GCC_VERSION >= 3000)
3272 # undef DWARF2_ASM_LINE_DEBUG_INFO
3273 # pragma GCC poison DWARF2_ASM_LINE_DEBUG_INFO
3277 /* Return true if GCC configure detected assembler support for views
3278 in .loc directives. */
3281 dwarf2out_default_as_locview_support (void)
3283 return DWARF2_ASM_VIEW_DEBUG_INFO
;
3284 #if (GCC_VERSION >= 3000)
3285 # undef DWARF2_ASM_VIEW_DEBUG_INFO
3286 # pragma GCC poison DWARF2_ASM_VIEW_DEBUG_INFO
3290 /* A bit is set in ZERO_VIEW_P if we are using the assembler-supported
3291 view computation, and it refers to a view identifier for which we
3292 will not emit a label because it is known to map to a view number
3293 zero. We won't allocate the bitmap if we're not using assembler
3294 support for location views, but we have to make the variable
3295 visible for GGC and for code that will be optimized out for lack of
3296 support but that's still parsed and compiled. We could abstract it
3297 out with macros, but it's not worth it. */
3298 static GTY(()) bitmap zero_view_p
;
3300 /* Evaluate to TRUE iff N is known to identify the first location view
3301 at its PC. When not using assembler location view computation,
3302 that must be view number zero. Otherwise, ZERO_VIEW_P is allocated
3303 and views label numbers recorded in it are the ones known to be
3305 #define ZERO_VIEW_P(N) ((N) == (var_loc_view)0 \
3306 || (N) == (var_loc_view)-1 \
3308 && bitmap_bit_p (zero_view_p, (N))))
3310 /* Return true iff we're to emit .loc directives for the assembler to
3311 generate line number sections.
3313 When we're not emitting views, all we need from the assembler is
3314 support for .loc directives.
3316 If we are emitting views, we can only use the assembler's .loc
3317 support if it also supports views.
3319 When the compiler is emitting the line number programs and
3320 computing view numbers itself, it resets view numbers at known PC
3321 changes and counts from that, and then it emits view numbers as
3322 literal constants in locviewlists. There are cases in which the
3323 compiler is not sure about PC changes, e.g. when extra alignment is
3324 requested for a label. In these cases, the compiler may not reset
3325 the view counter, and the potential PC advance in the line number
3326 program will use an opcode that does not reset the view counter
3327 even if the PC actually changes, so that compiler and debug info
3328 consumer can keep view numbers in sync.
3330 When the compiler defers view computation to the assembler, it
3331 emits symbolic view numbers in locviewlists, with the exception of
3332 views known to be zero (forced resets, or reset after
3333 compiler-visible PC changes): instead of emitting symbols for
3334 these, we emit literal zero and assert the assembler agrees with
3335 the compiler's assessment. We could use symbolic views everywhere,
3336 instead of special-casing zero views, but then we'd be unable to
3337 optimize out locviewlists that contain only zeros. */
3340 output_asm_line_debug_info (void)
3342 return (dwarf2out_as_loc_support
3343 && (dwarf2out_as_locview_support
3344 || !debug_variable_location_views
));
3347 /* Minimum line offset in a special line info. opcode.
3348 This value was chosen to give a reasonable range of values. */
3349 #define DWARF_LINE_BASE -10
3351 /* First special line opcode - leave room for the standard opcodes. */
3352 #define DWARF_LINE_OPCODE_BASE ((int)DW_LNS_set_isa + 1)
3354 /* Range of line offsets in a special line info. opcode. */
3355 #define DWARF_LINE_RANGE (254-DWARF_LINE_OPCODE_BASE+1)
3357 /* Flag that indicates the initial value of the is_stmt_start flag.
3358 In the present implementation, we do not mark any lines as
3359 the beginning of a source statement, because that information
3360 is not made available by the GCC front-end. */
3361 #define DWARF_LINE_DEFAULT_IS_STMT_START 1
3363 /* Maximum number of operations per instruction bundle. */
3364 #ifndef DWARF_LINE_DEFAULT_MAX_OPS_PER_INSN
3365 #define DWARF_LINE_DEFAULT_MAX_OPS_PER_INSN 1
3368 /* This location is used by calc_die_sizes() to keep track
3369 the offset of each DIE within the .debug_info section. */
3370 static unsigned long next_die_offset
;
3372 /* Record the root of the DIE's built for the current compilation unit. */
3373 static GTY(()) dw_die_ref single_comp_unit_die
;
3375 /* A list of type DIEs that have been separated into comdat sections. */
3376 static GTY(()) comdat_type_node
*comdat_type_list
;
3378 /* A list of CU DIEs that have been separated. */
3379 static GTY(()) limbo_die_node
*cu_die_list
;
3381 /* A list of DIEs with a NULL parent waiting to be relocated. */
3382 static GTY(()) limbo_die_node
*limbo_die_list
;
3384 /* A list of DIEs for which we may have to generate
3385 DW_AT_{,MIPS_}linkage_name once their DECL_ASSEMBLER_NAMEs are set. */
3386 static GTY(()) limbo_die_node
*deferred_asm_name
;
3388 struct dwarf_file_hasher
: ggc_ptr_hash
<dwarf_file_data
>
3390 typedef const char *compare_type
;
3392 static hashval_t
hash (dwarf_file_data
*);
3393 static bool equal (dwarf_file_data
*, const char *);
3396 /* Filenames referenced by this compilation unit. */
3397 static GTY(()) hash_table
<dwarf_file_hasher
> *file_table
;
3399 struct decl_die_hasher
: ggc_ptr_hash
<die_node
>
3401 typedef tree compare_type
;
3403 static hashval_t
hash (die_node
*);
3404 static bool equal (die_node
*, tree
);
3406 /* A hash table of references to DIE's that describe declarations.
3407 The key is a DECL_UID() which is a unique number identifying each decl. */
3408 static GTY (()) hash_table
<decl_die_hasher
> *decl_die_table
;
3410 struct GTY ((for_user
)) variable_value_struct
{
3411 unsigned int decl_id
;
3412 vec
<dw_die_ref
, va_gc
> *dies
;
3415 struct variable_value_hasher
: ggc_ptr_hash
<variable_value_struct
>
3417 typedef tree compare_type
;
3419 static hashval_t
hash (variable_value_struct
*);
3420 static bool equal (variable_value_struct
*, tree
);
3422 /* A hash table of DIEs that contain DW_OP_GNU_variable_value with
3423 dw_val_class_decl_ref class, indexed by FUNCTION_DECLs which is
3424 DECL_CONTEXT of the referenced VAR_DECLs. */
3425 static GTY (()) hash_table
<variable_value_hasher
> *variable_value_hash
;
3427 struct block_die_hasher
: ggc_ptr_hash
<die_struct
>
3429 static hashval_t
hash (die_struct
*);
3430 static bool equal (die_struct
*, die_struct
*);
3433 /* A hash table of references to DIE's that describe COMMON blocks.
3434 The key is DECL_UID() ^ die_parent. */
3435 static GTY (()) hash_table
<block_die_hasher
> *common_block_die_table
;
3437 typedef struct GTY(()) die_arg_entry_struct
{
3443 /* Node of the variable location list. */
3444 struct GTY ((chain_next ("%h.next"))) var_loc_node
{
3445 /* Either NOTE_INSN_VAR_LOCATION, or, for SRA optimized variables,
3446 EXPR_LIST chain. For small bitsizes, bitsize is encoded
3447 in mode of the EXPR_LIST node and first EXPR_LIST operand
3448 is either NOTE_INSN_VAR_LOCATION for a piece with a known
3449 location or NULL for padding. For larger bitsizes,
3450 mode is 0 and first operand is a CONCAT with bitsize
3451 as first CONCAT operand and NOTE_INSN_VAR_LOCATION resp.
3452 NULL as second operand. */
3454 const char * GTY (()) label
;
3455 struct var_loc_node
* GTY (()) next
;
3459 /* Variable location list. */
3460 struct GTY ((for_user
)) var_loc_list_def
{
3461 struct var_loc_node
* GTY (()) first
;
3463 /* Pointer to the last but one or last element of the
3464 chained list. If the list is empty, both first and
3465 last are NULL, if the list contains just one node
3466 or the last node certainly is not redundant, it points
3467 to the last node, otherwise points to the last but one.
3468 Do not mark it for GC because it is marked through the chain. */
3469 struct var_loc_node
* GTY ((skip ("%h"))) last
;
3471 /* Pointer to the last element before section switch,
3472 if NULL, either sections weren't switched or first
3473 is after section switch. */
3474 struct var_loc_node
* GTY ((skip ("%h"))) last_before_switch
;
3476 /* DECL_UID of the variable decl. */
3477 unsigned int decl_id
;
3479 typedef struct var_loc_list_def var_loc_list
;
3481 /* Call argument location list. */
3482 struct GTY ((chain_next ("%h.next"))) call_arg_loc_node
{
3483 rtx
GTY (()) call_arg_loc_note
;
3484 const char * GTY (()) label
;
3485 tree
GTY (()) block
;
3487 rtx
GTY (()) symbol_ref
;
3488 struct call_arg_loc_node
* GTY (()) next
;
3492 struct decl_loc_hasher
: ggc_ptr_hash
<var_loc_list
>
3494 typedef const_tree compare_type
;
3496 static hashval_t
hash (var_loc_list
*);
3497 static bool equal (var_loc_list
*, const_tree
);
3500 /* Table of decl location linked lists. */
3501 static GTY (()) hash_table
<decl_loc_hasher
> *decl_loc_table
;
3503 /* Head and tail of call_arg_loc chain. */
3504 static GTY (()) struct call_arg_loc_node
*call_arg_locations
;
3505 static struct call_arg_loc_node
*call_arg_loc_last
;
3507 /* Number of call sites in the current function. */
3508 static int call_site_count
= -1;
3509 /* Number of tail call sites in the current function. */
3510 static int tail_call_site_count
= -1;
3512 /* A cached location list. */
3513 struct GTY ((for_user
)) cached_dw_loc_list_def
{
3514 /* The DECL_UID of the decl that this entry describes. */
3515 unsigned int decl_id
;
3517 /* The cached location list. */
3518 dw_loc_list_ref loc_list
;
3520 typedef struct cached_dw_loc_list_def cached_dw_loc_list
;
3522 struct dw_loc_list_hasher
: ggc_ptr_hash
<cached_dw_loc_list
>
3525 typedef const_tree compare_type
;
3527 static hashval_t
hash (cached_dw_loc_list
*);
3528 static bool equal (cached_dw_loc_list
*, const_tree
);
3531 /* Table of cached location lists. */
3532 static GTY (()) hash_table
<dw_loc_list_hasher
> *cached_dw_loc_list_table
;
3534 /* A vector of references to DIE's that are uniquely identified by their tag,
3535 presence/absence of children DIE's, and list of attribute/value pairs. */
3536 static GTY(()) vec
<dw_die_ref
, va_gc
> *abbrev_die_table
;
3538 /* A hash map to remember the stack usage for DWARF procedures. The value
3539 stored is the stack size difference between before the DWARF procedure
3540 invokation and after it returned. In other words, for a DWARF procedure
3541 that consumes N stack slots and that pushes M ones, this stores M - N. */
3542 static hash_map
<dw_die_ref
, int> *dwarf_proc_stack_usage_map
;
3544 /* A global counter for generating labels for line number data. */
3545 static unsigned int line_info_label_num
;
3547 /* The current table to which we should emit line number information
3548 for the current function. This will be set up at the beginning of
3549 assembly for the function. */
3550 static GTY(()) dw_line_info_table
*cur_line_info_table
;
3552 /* The two default tables of line number info. */
3553 static GTY(()) dw_line_info_table
*text_section_line_info
;
3554 static GTY(()) dw_line_info_table
*cold_text_section_line_info
;
3556 /* The set of all non-default tables of line number info. */
3557 static GTY(()) vec
<dw_line_info_table
*, va_gc
> *separate_line_info
;
3559 /* A flag to tell pubnames/types export if there is an info section to
3561 static bool info_section_emitted
;
3563 /* A pointer to the base of a table that contains a list of publicly
3564 accessible names. */
3565 static GTY (()) vec
<pubname_entry
, va_gc
> *pubname_table
;
3567 /* A pointer to the base of a table that contains a list of publicly
3568 accessible types. */
3569 static GTY (()) vec
<pubname_entry
, va_gc
> *pubtype_table
;
3571 /* A pointer to the base of a table that contains a list of macro
3572 defines/undefines (and file start/end markers). */
3573 static GTY (()) vec
<macinfo_entry
, va_gc
> *macinfo_table
;
3575 /* True if .debug_macinfo or .debug_macros section is going to be
3577 #define have_macinfo \
3578 ((!XCOFF_DEBUGGING_INFO || HAVE_XCOFF_DWARF_EXTRAS) \
3579 && debug_info_level >= DINFO_LEVEL_VERBOSE \
3580 && !macinfo_table->is_empty ())
3582 /* Vector of dies for which we should generate .debug_ranges info. */
3583 static GTY (()) vec
<dw_ranges
, va_gc
> *ranges_table
;
3585 /* Vector of pairs of labels referenced in ranges_table. */
3586 static GTY (()) vec
<dw_ranges_by_label
, va_gc
> *ranges_by_label
;
3588 /* Whether we have location lists that need outputting */
3589 static GTY(()) bool have_location_lists
;
3591 /* Unique label counter. */
3592 static GTY(()) unsigned int loclabel_num
;
3594 /* Unique label counter for point-of-call tables. */
3595 static GTY(()) unsigned int poc_label_num
;
3597 /* The last file entry emitted by maybe_emit_file(). */
3598 static GTY(()) struct dwarf_file_data
* last_emitted_file
;
3600 /* Number of internal labels generated by gen_internal_sym(). */
3601 static GTY(()) int label_num
;
3603 static GTY(()) vec
<die_arg_entry
, va_gc
> *tmpl_value_parm_die_table
;
3605 /* Instances of generic types for which we need to generate debug
3606 info that describe their generic parameters and arguments. That
3607 generation needs to happen once all types are properly laid out so
3608 we do it at the end of compilation. */
3609 static GTY(()) vec
<tree
, va_gc
> *generic_type_instances
;
3611 /* Offset from the "steady-state frame pointer" to the frame base,
3612 within the current function. */
3613 static poly_int64 frame_pointer_fb_offset
;
3614 static bool frame_pointer_fb_offset_valid
;
3616 static vec
<dw_die_ref
> base_types
;
3618 /* Flags to represent a set of attribute classes for attributes that represent
3619 a scalar value (bounds, pointers, ...). */
3622 dw_scalar_form_constant
= 0x01,
3623 dw_scalar_form_exprloc
= 0x02,
3624 dw_scalar_form_reference
= 0x04
3627 /* Forward declarations for functions defined in this file. */
3629 static int is_pseudo_reg (const_rtx
);
3630 static tree
type_main_variant (tree
);
3631 static int is_tagged_type (const_tree
);
3632 static const char *dwarf_tag_name (unsigned);
3633 static const char *dwarf_attr_name (unsigned);
3634 static const char *dwarf_form_name (unsigned);
3635 static tree
decl_ultimate_origin (const_tree
);
3636 static tree
decl_class_context (tree
);
3637 static void add_dwarf_attr (dw_die_ref
, dw_attr_node
*);
3638 static inline enum dw_val_class
AT_class (dw_attr_node
*);
3639 static inline unsigned int AT_index (dw_attr_node
*);
3640 static void add_AT_flag (dw_die_ref
, enum dwarf_attribute
, unsigned);
3641 static inline unsigned AT_flag (dw_attr_node
*);
3642 static void add_AT_int (dw_die_ref
, enum dwarf_attribute
, HOST_WIDE_INT
);
3643 static inline HOST_WIDE_INT
AT_int (dw_attr_node
*);
3644 static void add_AT_unsigned (dw_die_ref
, enum dwarf_attribute
, unsigned HOST_WIDE_INT
);
3645 static inline unsigned HOST_WIDE_INT
AT_unsigned (dw_attr_node
*);
3646 static void add_AT_double (dw_die_ref
, enum dwarf_attribute
,
3647 HOST_WIDE_INT
, unsigned HOST_WIDE_INT
);
3648 static inline void add_AT_vec (dw_die_ref
, enum dwarf_attribute
, unsigned int,
3649 unsigned int, unsigned char *);
3650 static void add_AT_data8 (dw_die_ref
, enum dwarf_attribute
, unsigned char *);
3651 static void add_AT_string (dw_die_ref
, enum dwarf_attribute
, const char *);
3652 static inline const char *AT_string (dw_attr_node
*);
3653 static enum dwarf_form
AT_string_form (dw_attr_node
*);
3654 static void add_AT_die_ref (dw_die_ref
, enum dwarf_attribute
, dw_die_ref
);
3655 static void add_AT_specification (dw_die_ref
, dw_die_ref
);
3656 static inline dw_die_ref
AT_ref (dw_attr_node
*);
3657 static inline int AT_ref_external (dw_attr_node
*);
3658 static inline void set_AT_ref_external (dw_attr_node
*, int);
3659 static void add_AT_loc (dw_die_ref
, enum dwarf_attribute
, dw_loc_descr_ref
);
3660 static inline dw_loc_descr_ref
AT_loc (dw_attr_node
*);
3661 static void add_AT_loc_list (dw_die_ref
, enum dwarf_attribute
,
3663 static inline dw_loc_list_ref
AT_loc_list (dw_attr_node
*);
3664 static void add_AT_view_list (dw_die_ref
, enum dwarf_attribute
);
3665 static inline dw_loc_list_ref
AT_loc_list (dw_attr_node
*);
3666 static addr_table_entry
*add_addr_table_entry (void *, enum ate_kind
);
3667 static void remove_addr_table_entry (addr_table_entry
*);
3668 static void add_AT_addr (dw_die_ref
, enum dwarf_attribute
, rtx
, bool);
3669 static inline rtx
AT_addr (dw_attr_node
*);
3670 static void add_AT_symview (dw_die_ref
, enum dwarf_attribute
, const char *);
3671 static void add_AT_lbl_id (dw_die_ref
, enum dwarf_attribute
, const char *);
3672 static void add_AT_lineptr (dw_die_ref
, enum dwarf_attribute
, const char *);
3673 static void add_AT_macptr (dw_die_ref
, enum dwarf_attribute
, const char *);
3674 static void add_AT_range_list (dw_die_ref
, enum dwarf_attribute
,
3675 unsigned long, bool);
3676 static inline const char *AT_lbl (dw_attr_node
*);
3677 static dw_attr_node
*get_AT (dw_die_ref
, enum dwarf_attribute
);
3678 static const char *get_AT_low_pc (dw_die_ref
);
3679 static const char *get_AT_string (dw_die_ref
, enum dwarf_attribute
);
3680 static int get_AT_flag (dw_die_ref
, enum dwarf_attribute
);
3681 static unsigned get_AT_unsigned (dw_die_ref
, enum dwarf_attribute
);
3682 static inline dw_die_ref
get_AT_ref (dw_die_ref
, enum dwarf_attribute
);
3683 static bool is_c (void);
3684 static bool is_cxx (void);
3685 static bool is_cxx (const_tree
);
3686 static bool is_fortran (void);
3687 static bool is_ada (void);
3688 static bool remove_AT (dw_die_ref
, enum dwarf_attribute
);
3689 static void remove_child_TAG (dw_die_ref
, enum dwarf_tag
);
3690 static void add_child_die (dw_die_ref
, dw_die_ref
);
3691 static dw_die_ref
new_die (enum dwarf_tag
, dw_die_ref
, tree
);
3692 static dw_die_ref
lookup_type_die (tree
);
3693 static dw_die_ref
strip_naming_typedef (tree
, dw_die_ref
);
3694 static dw_die_ref
lookup_type_die_strip_naming_typedef (tree
);
3695 static void equate_type_number_to_die (tree
, dw_die_ref
);
3696 static dw_die_ref
lookup_decl_die (tree
);
3697 static var_loc_list
*lookup_decl_loc (const_tree
);
3698 static void equate_decl_number_to_die (tree
, dw_die_ref
);
3699 static struct var_loc_node
*add_var_loc_to_decl (tree
, rtx
, const char *, var_loc_view
);
3700 static void print_spaces (FILE *);
3701 static void print_die (dw_die_ref
, FILE *);
3702 static void loc_checksum (dw_loc_descr_ref
, struct md5_ctx
*);
3703 static void attr_checksum (dw_attr_node
*, struct md5_ctx
*, int *);
3704 static void die_checksum (dw_die_ref
, struct md5_ctx
*, int *);
3705 static void checksum_sleb128 (HOST_WIDE_INT
, struct md5_ctx
*);
3706 static void checksum_uleb128 (unsigned HOST_WIDE_INT
, struct md5_ctx
*);
3707 static void loc_checksum_ordered (dw_loc_descr_ref
, struct md5_ctx
*);
3708 static void attr_checksum_ordered (enum dwarf_tag
, dw_attr_node
*,
3709 struct md5_ctx
*, int *);
3710 struct checksum_attributes
;
3711 static void collect_checksum_attributes (struct checksum_attributes
*, dw_die_ref
);
3712 static void die_checksum_ordered (dw_die_ref
, struct md5_ctx
*, int *);
3713 static void checksum_die_context (dw_die_ref
, struct md5_ctx
*);
3714 static void generate_type_signature (dw_die_ref
, comdat_type_node
*);
3715 static int same_loc_p (dw_loc_descr_ref
, dw_loc_descr_ref
, int *);
3716 static int same_dw_val_p (const dw_val_node
*, const dw_val_node
*, int *);
3717 static int same_attr_p (dw_attr_node
*, dw_attr_node
*, int *);
3718 static int same_die_p (dw_die_ref
, dw_die_ref
, int *);
3719 static int is_type_die (dw_die_ref
);
3720 static inline bool is_template_instantiation (dw_die_ref
);
3721 static int is_declaration_die (dw_die_ref
);
3722 static int should_move_die_to_comdat (dw_die_ref
);
3723 static dw_die_ref
clone_as_declaration (dw_die_ref
);
3724 static dw_die_ref
clone_die (dw_die_ref
);
3725 static dw_die_ref
clone_tree (dw_die_ref
);
3726 static dw_die_ref
copy_declaration_context (dw_die_ref
, dw_die_ref
);
3727 static void generate_skeleton_ancestor_tree (skeleton_chain_node
*);
3728 static void generate_skeleton_bottom_up (skeleton_chain_node
*);
3729 static dw_die_ref
generate_skeleton (dw_die_ref
);
3730 static dw_die_ref
remove_child_or_replace_with_skeleton (dw_die_ref
,
3733 static void break_out_comdat_types (dw_die_ref
);
3734 static void copy_decls_for_unworthy_types (dw_die_ref
);
3736 static void add_sibling_attributes (dw_die_ref
);
3737 static void output_location_lists (dw_die_ref
);
3738 static int constant_size (unsigned HOST_WIDE_INT
);
3739 static unsigned long size_of_die (dw_die_ref
);
3740 static void calc_die_sizes (dw_die_ref
);
3741 static void calc_base_type_die_sizes (void);
3742 static void mark_dies (dw_die_ref
);
3743 static void unmark_dies (dw_die_ref
);
3744 static void unmark_all_dies (dw_die_ref
);
3745 static unsigned long size_of_pubnames (vec
<pubname_entry
, va_gc
> *);
3746 static unsigned long size_of_aranges (void);
3747 static enum dwarf_form
value_format (dw_attr_node
*);
3748 static void output_value_format (dw_attr_node
*);
3749 static void output_abbrev_section (void);
3750 static void output_die_abbrevs (unsigned long, dw_die_ref
);
3751 static void output_die (dw_die_ref
);
3752 static void output_compilation_unit_header (enum dwarf_unit_type
);
3753 static void output_comp_unit (dw_die_ref
, int, const unsigned char *);
3754 static void output_comdat_type_unit (comdat_type_node
*, bool);
3755 static const char *dwarf2_name (tree
, int);
3756 static void add_pubname (tree
, dw_die_ref
);
3757 static void add_enumerator_pubname (const char *, dw_die_ref
);
3758 static void add_pubname_string (const char *, dw_die_ref
);
3759 static void add_pubtype (tree
, dw_die_ref
);
3760 static void output_pubnames (vec
<pubname_entry
, va_gc
> *);
3761 static void output_aranges (void);
3762 static unsigned int add_ranges (const_tree
, bool = false);
3763 static void add_ranges_by_labels (dw_die_ref
, const char *, const char *,
3765 static void output_ranges (void);
3766 static dw_line_info_table
*new_line_info_table (void);
3767 static void output_line_info (bool);
3768 static void output_file_names (void);
3769 static dw_die_ref
base_type_die (tree
, bool);
3770 static int is_base_type (tree
);
3771 static dw_die_ref
subrange_type_die (tree
, tree
, tree
, tree
, dw_die_ref
);
3772 static int decl_quals (const_tree
);
3773 static dw_die_ref
modified_type_die (tree
, int, bool, dw_die_ref
);
3774 static dw_die_ref
generic_parameter_die (tree
, tree
, bool, dw_die_ref
);
3775 static dw_die_ref
template_parameter_pack_die (tree
, tree
, dw_die_ref
);
3776 static unsigned int dbx_reg_number (const_rtx
);
3777 static void add_loc_descr_op_piece (dw_loc_descr_ref
*, int);
3778 static dw_loc_descr_ref
reg_loc_descriptor (rtx
, enum var_init_status
);
3779 static dw_loc_descr_ref
one_reg_loc_descriptor (unsigned int,
3780 enum var_init_status
);
3781 static dw_loc_descr_ref
multiple_reg_loc_descriptor (rtx
, rtx
,
3782 enum var_init_status
);
3783 static dw_loc_descr_ref
based_loc_descr (rtx
, poly_int64
,
3784 enum var_init_status
);
3785 static int is_based_loc (const_rtx
);
3786 static bool resolve_one_addr (rtx
*);
3787 static dw_loc_descr_ref
concat_loc_descriptor (rtx
, rtx
,
3788 enum var_init_status
);
3789 static dw_loc_descr_ref
loc_descriptor (rtx
, machine_mode mode
,
3790 enum var_init_status
);
3791 struct loc_descr_context
;
3792 static void add_loc_descr_to_each (dw_loc_list_ref list
, dw_loc_descr_ref ref
);
3793 static void add_loc_list (dw_loc_list_ref
*ret
, dw_loc_list_ref list
);
3794 static dw_loc_list_ref
loc_list_from_tree (tree
, int,
3795 struct loc_descr_context
*);
3796 static dw_loc_descr_ref
loc_descriptor_from_tree (tree
, int,
3797 struct loc_descr_context
*);
3798 static tree
field_type (const_tree
);
3799 static unsigned int simple_type_align_in_bits (const_tree
);
3800 static unsigned int simple_decl_align_in_bits (const_tree
);
3801 static unsigned HOST_WIDE_INT
simple_type_size_in_bits (const_tree
);
3803 static dw_loc_descr_ref
field_byte_offset (const_tree
, struct vlr_context
*,
3805 static void add_AT_location_description (dw_die_ref
, enum dwarf_attribute
,
3807 static void add_data_member_location_attribute (dw_die_ref
, tree
,
3808 struct vlr_context
*);
3809 static bool add_const_value_attribute (dw_die_ref
, rtx
);
3810 static void insert_int (HOST_WIDE_INT
, unsigned, unsigned char *);
3811 static void insert_wide_int (const wide_int
&, unsigned char *, int);
3812 static void insert_float (const_rtx
, unsigned char *);
3813 static rtx
rtl_for_decl_location (tree
);
3814 static bool add_location_or_const_value_attribute (dw_die_ref
, tree
, bool);
3815 static bool tree_add_const_value_attribute (dw_die_ref
, tree
);
3816 static bool tree_add_const_value_attribute_for_decl (dw_die_ref
, tree
);
3817 static void add_name_attribute (dw_die_ref
, const char *);
3818 static void add_desc_attribute (dw_die_ref
, tree
);
3819 static void add_gnat_descriptive_type_attribute (dw_die_ref
, tree
, dw_die_ref
);
3820 static void add_comp_dir_attribute (dw_die_ref
);
3821 static void add_scalar_info (dw_die_ref
, enum dwarf_attribute
, tree
, int,
3822 struct loc_descr_context
*);
3823 static void add_bound_info (dw_die_ref
, enum dwarf_attribute
, tree
,
3824 struct loc_descr_context
*);
3825 static void add_subscript_info (dw_die_ref
, tree
, bool);
3826 static void add_byte_size_attribute (dw_die_ref
, tree
);
3827 static void add_alignment_attribute (dw_die_ref
, tree
);
3828 static inline void add_bit_offset_attribute (dw_die_ref
, tree
,
3829 struct vlr_context
*);
3830 static void add_bit_size_attribute (dw_die_ref
, tree
);
3831 static void add_prototyped_attribute (dw_die_ref
, tree
);
3832 static void add_abstract_origin_attribute (dw_die_ref
, tree
);
3833 static void add_pure_or_virtual_attribute (dw_die_ref
, tree
);
3834 static void add_src_coords_attributes (dw_die_ref
, tree
);
3835 static void add_name_and_src_coords_attributes (dw_die_ref
, tree
, bool = false);
3836 static void add_discr_value (dw_die_ref
, dw_discr_value
*);
3837 static void add_discr_list (dw_die_ref
, dw_discr_list_ref
);
3838 static inline dw_discr_list_ref
AT_discr_list (dw_attr_node
*);
3839 static dw_die_ref
scope_die_for (tree
, dw_die_ref
);
3840 static inline int local_scope_p (dw_die_ref
);
3841 static inline int class_scope_p (dw_die_ref
);
3842 static inline int class_or_namespace_scope_p (dw_die_ref
);
3843 static void add_type_attribute (dw_die_ref
, tree
, int, bool, dw_die_ref
);
3844 static void add_calling_convention_attribute (dw_die_ref
, tree
);
3845 static const char *type_tag (const_tree
);
3846 static tree
member_declared_type (const_tree
);
3848 static const char *decl_start_label (tree
);
3850 static void gen_array_type_die (tree
, dw_die_ref
);
3851 static void gen_descr_array_type_die (tree
, struct array_descr_info
*, dw_die_ref
);
3853 static void gen_entry_point_die (tree
, dw_die_ref
);
3855 static dw_die_ref
gen_enumeration_type_die (tree
, dw_die_ref
);
3856 static dw_die_ref
gen_formal_parameter_die (tree
, tree
, bool, dw_die_ref
);
3857 static dw_die_ref
gen_formal_parameter_pack_die (tree
, tree
, dw_die_ref
, tree
*);
3858 static void gen_unspecified_parameters_die (tree
, dw_die_ref
);
3859 static void gen_formal_types_die (tree
, dw_die_ref
);
3860 static void gen_subprogram_die (tree
, dw_die_ref
);
3861 static void gen_variable_die (tree
, tree
, dw_die_ref
);
3862 static void gen_const_die (tree
, dw_die_ref
);
3863 static void gen_label_die (tree
, dw_die_ref
);
3864 static void gen_lexical_block_die (tree
, dw_die_ref
);
3865 static void gen_inlined_subroutine_die (tree
, dw_die_ref
);
3866 static void gen_field_die (tree
, struct vlr_context
*, dw_die_ref
);
3867 static void gen_ptr_to_mbr_type_die (tree
, dw_die_ref
);
3868 static dw_die_ref
gen_compile_unit_die (const char *);
3869 static void gen_inheritance_die (tree
, tree
, tree
, dw_die_ref
);
3870 static void gen_member_die (tree
, dw_die_ref
);
3871 static void gen_struct_or_union_type_die (tree
, dw_die_ref
,
3872 enum debug_info_usage
);
3873 static void gen_subroutine_type_die (tree
, dw_die_ref
);
3874 static void gen_typedef_die (tree
, dw_die_ref
);
3875 static void gen_type_die (tree
, dw_die_ref
);
3876 static void gen_block_die (tree
, dw_die_ref
);
3877 static void decls_for_scope (tree
, dw_die_ref
, bool = true);
3878 static bool is_naming_typedef_decl (const_tree
);
3879 static inline dw_die_ref
get_context_die (tree
);
3880 static void gen_namespace_die (tree
, dw_die_ref
);
3881 static dw_die_ref
gen_namelist_decl (tree
, dw_die_ref
, tree
);
3882 static dw_die_ref
gen_decl_die (tree
, tree
, struct vlr_context
*, dw_die_ref
);
3883 static dw_die_ref
force_decl_die (tree
);
3884 static dw_die_ref
force_type_die (tree
);
3885 static dw_die_ref
setup_namespace_context (tree
, dw_die_ref
);
3886 static dw_die_ref
declare_in_namespace (tree
, dw_die_ref
);
3887 static struct dwarf_file_data
* lookup_filename (const char *);
3888 static void retry_incomplete_types (void);
3889 static void gen_type_die_for_member (tree
, tree
, dw_die_ref
);
3890 static void gen_generic_params_dies (tree
);
3891 static void gen_tagged_type_die (tree
, dw_die_ref
, enum debug_info_usage
);
3892 static void gen_type_die_with_usage (tree
, dw_die_ref
, enum debug_info_usage
);
3893 static void splice_child_die (dw_die_ref
, dw_die_ref
);
3894 static int file_info_cmp (const void *, const void *);
3895 static dw_loc_list_ref
new_loc_list (dw_loc_descr_ref
, const char *, var_loc_view
,
3896 const char *, var_loc_view
, const char *);
3897 static void output_loc_list (dw_loc_list_ref
);
3898 static char *gen_internal_sym (const char *);
3899 static bool want_pubnames (void);
3901 static void prune_unmark_dies (dw_die_ref
);
3902 static void prune_unused_types_mark_generic_parms_dies (dw_die_ref
);
3903 static void prune_unused_types_mark (dw_die_ref
, int);
3904 static void prune_unused_types_walk (dw_die_ref
);
3905 static void prune_unused_types_walk_attribs (dw_die_ref
);
3906 static void prune_unused_types_prune (dw_die_ref
);
3907 static void prune_unused_types (void);
3908 static int maybe_emit_file (struct dwarf_file_data
*fd
);
3909 static inline const char *AT_vms_delta1 (dw_attr_node
*);
3910 static inline const char *AT_vms_delta2 (dw_attr_node
*);
3911 static inline void add_AT_vms_delta (dw_die_ref
, enum dwarf_attribute
,
3912 const char *, const char *);
3913 static void append_entry_to_tmpl_value_parm_die_table (dw_die_ref
, tree
);
3914 static void gen_remaining_tmpl_value_param_die_attribute (void);
3915 static bool generic_type_p (tree
);
3916 static void schedule_generic_params_dies_gen (tree t
);
3917 static void gen_scheduled_generic_parms_dies (void);
3918 static void resolve_variable_values (void);
3920 static const char *comp_dir_string (void);
3922 static void hash_loc_operands (dw_loc_descr_ref
, inchash::hash
&);
3924 /* enum for tracking thread-local variables whose address is really an offset
3925 relative to the TLS pointer, which will need link-time relocation, but will
3926 not need relocation by the DWARF consumer. */
3934 /* Return the operator to use for an address of a variable. For dtprel_true, we
3935 use DW_OP_const*. For regular variables, which need both link-time
3936 relocation and consumer-level relocation (e.g., to account for shared objects
3937 loaded at a random address), we use DW_OP_addr*. */
3939 static inline enum dwarf_location_atom
3940 dw_addr_op (enum dtprel_bool dtprel
)
3942 if (dtprel
== dtprel_true
)
3943 return (dwarf_split_debug_info
? dwarf_OP (DW_OP_constx
)
3944 : (DWARF2_ADDR_SIZE
== 4 ? DW_OP_const4u
: DW_OP_const8u
));
3946 return dwarf_split_debug_info
? dwarf_OP (DW_OP_addrx
) : DW_OP_addr
;
3949 /* Return a pointer to a newly allocated address location description. If
3950 dwarf_split_debug_info is true, then record the address with the appropriate
3952 static inline dw_loc_descr_ref
3953 new_addr_loc_descr (rtx addr
, enum dtprel_bool dtprel
)
3955 dw_loc_descr_ref ref
= new_loc_descr (dw_addr_op (dtprel
), 0, 0);
3957 ref
->dw_loc_oprnd1
.val_class
= dw_val_class_addr
;
3958 ref
->dw_loc_oprnd1
.v
.val_addr
= addr
;
3959 ref
->dtprel
= dtprel
;
3960 if (dwarf_split_debug_info
)
3961 ref
->dw_loc_oprnd1
.val_entry
3962 = add_addr_table_entry (addr
,
3963 dtprel
? ate_kind_rtx_dtprel
: ate_kind_rtx
);
3965 ref
->dw_loc_oprnd1
.val_entry
= NULL
;
3970 /* Section names used to hold DWARF debugging information. */
3972 #ifndef DEBUG_INFO_SECTION
3973 #define DEBUG_INFO_SECTION ".debug_info"
3975 #ifndef DEBUG_DWO_INFO_SECTION
3976 #define DEBUG_DWO_INFO_SECTION ".debug_info.dwo"
3978 #ifndef DEBUG_LTO_INFO_SECTION
3979 #define DEBUG_LTO_INFO_SECTION ".gnu.debuglto_.debug_info"
3981 #ifndef DEBUG_LTO_DWO_INFO_SECTION
3982 #define DEBUG_LTO_DWO_INFO_SECTION ".gnu.debuglto_.debug_info.dwo"
3984 #ifndef DEBUG_ABBREV_SECTION
3985 #define DEBUG_ABBREV_SECTION ".debug_abbrev"
3987 #ifndef DEBUG_LTO_ABBREV_SECTION
3988 #define DEBUG_LTO_ABBREV_SECTION ".gnu.debuglto_.debug_abbrev"
3990 #ifndef DEBUG_DWO_ABBREV_SECTION
3991 #define DEBUG_DWO_ABBREV_SECTION ".debug_abbrev.dwo"
3993 #ifndef DEBUG_LTO_DWO_ABBREV_SECTION
3994 #define DEBUG_LTO_DWO_ABBREV_SECTION ".gnu.debuglto_.debug_abbrev.dwo"
3996 #ifndef DEBUG_ARANGES_SECTION
3997 #define DEBUG_ARANGES_SECTION ".debug_aranges"
3999 #ifndef DEBUG_ADDR_SECTION
4000 #define DEBUG_ADDR_SECTION ".debug_addr"
4002 #ifndef DEBUG_MACINFO_SECTION
4003 #define DEBUG_MACINFO_SECTION ".debug_macinfo"
4005 #ifndef DEBUG_LTO_MACINFO_SECTION
4006 #define DEBUG_LTO_MACINFO_SECTION ".gnu.debuglto_.debug_macinfo"
4008 #ifndef DEBUG_DWO_MACINFO_SECTION
4009 #define DEBUG_DWO_MACINFO_SECTION ".debug_macinfo.dwo"
4011 #ifndef DEBUG_LTO_DWO_MACINFO_SECTION
4012 #define DEBUG_LTO_DWO_MACINFO_SECTION ".gnu.debuglto_.debug_macinfo.dwo"
4014 #ifndef DEBUG_MACRO_SECTION
4015 #define DEBUG_MACRO_SECTION ".debug_macro"
4017 #ifndef DEBUG_LTO_MACRO_SECTION
4018 #define DEBUG_LTO_MACRO_SECTION ".gnu.debuglto_.debug_macro"
4020 #ifndef DEBUG_DWO_MACRO_SECTION
4021 #define DEBUG_DWO_MACRO_SECTION ".debug_macro.dwo"
4023 #ifndef DEBUG_LTO_DWO_MACRO_SECTION
4024 #define DEBUG_LTO_DWO_MACRO_SECTION ".gnu.debuglto_.debug_macro.dwo"
4026 #ifndef DEBUG_LINE_SECTION
4027 #define DEBUG_LINE_SECTION ".debug_line"
4029 #ifndef DEBUG_LTO_LINE_SECTION
4030 #define DEBUG_LTO_LINE_SECTION ".gnu.debuglto_.debug_line"
4032 #ifndef DEBUG_DWO_LINE_SECTION
4033 #define DEBUG_DWO_LINE_SECTION ".debug_line.dwo"
4035 #ifndef DEBUG_LTO_DWO_LINE_SECTION
4036 #define DEBUG_LTO_DWO_LINE_SECTION ".gnu.debuglto_.debug_line.dwo"
4038 #ifndef DEBUG_LOC_SECTION
4039 #define DEBUG_LOC_SECTION ".debug_loc"
4041 #ifndef DEBUG_DWO_LOC_SECTION
4042 #define DEBUG_DWO_LOC_SECTION ".debug_loc.dwo"
4044 #ifndef DEBUG_LOCLISTS_SECTION
4045 #define DEBUG_LOCLISTS_SECTION ".debug_loclists"
4047 #ifndef DEBUG_DWO_LOCLISTS_SECTION
4048 #define DEBUG_DWO_LOCLISTS_SECTION ".debug_loclists.dwo"
4050 #ifndef DEBUG_PUBNAMES_SECTION
4051 #define DEBUG_PUBNAMES_SECTION \
4052 ((debug_generate_pub_sections == 2) \
4053 ? ".debug_gnu_pubnames" : ".debug_pubnames")
4055 #ifndef DEBUG_PUBTYPES_SECTION
4056 #define DEBUG_PUBTYPES_SECTION \
4057 ((debug_generate_pub_sections == 2) \
4058 ? ".debug_gnu_pubtypes" : ".debug_pubtypes")
4060 #ifndef DEBUG_STR_OFFSETS_SECTION
4061 #define DEBUG_STR_OFFSETS_SECTION ".debug_str_offsets"
4063 #ifndef DEBUG_DWO_STR_OFFSETS_SECTION
4064 #define DEBUG_DWO_STR_OFFSETS_SECTION ".debug_str_offsets.dwo"
4066 #ifndef DEBUG_LTO_DWO_STR_OFFSETS_SECTION
4067 #define DEBUG_LTO_DWO_STR_OFFSETS_SECTION ".gnu.debuglto_.debug_str_offsets.dwo"
4069 #ifndef DEBUG_STR_SECTION
4070 #define DEBUG_STR_SECTION ".debug_str"
4072 #ifndef DEBUG_LTO_STR_SECTION
4073 #define DEBUG_LTO_STR_SECTION ".gnu.debuglto_.debug_str"
4075 #ifndef DEBUG_STR_DWO_SECTION
4076 #define DEBUG_STR_DWO_SECTION ".debug_str.dwo"
4078 #ifndef DEBUG_LTO_STR_DWO_SECTION
4079 #define DEBUG_LTO_STR_DWO_SECTION ".gnu.debuglto_.debug_str.dwo"
4081 #ifndef DEBUG_RANGES_SECTION
4082 #define DEBUG_RANGES_SECTION ".debug_ranges"
4084 #ifndef DEBUG_RNGLISTS_SECTION
4085 #define DEBUG_RNGLISTS_SECTION ".debug_rnglists"
4087 #ifndef DEBUG_LINE_STR_SECTION
4088 #define DEBUG_LINE_STR_SECTION ".debug_line_str"
4090 #ifndef DEBUG_LTO_LINE_STR_SECTION
4091 #define DEBUG_LTO_LINE_STR_SECTION ".gnu.debuglto_.debug_line_str"
4094 /* Standard ELF section names for compiled code and data. */
4095 #ifndef TEXT_SECTION_NAME
4096 #define TEXT_SECTION_NAME ".text"
4099 /* Section flags for .debug_str section. */
4100 #define DEBUG_STR_SECTION_FLAGS \
4101 (HAVE_GAS_SHF_MERGE && flag_merge_debug_strings \
4102 ? SECTION_DEBUG | SECTION_MERGE | SECTION_STRINGS | 1 \
4105 /* Section flags for .debug_str.dwo section. */
4106 #define DEBUG_STR_DWO_SECTION_FLAGS (SECTION_DEBUG | SECTION_EXCLUDE)
4108 /* Attribute used to refer to the macro section. */
4109 #define DEBUG_MACRO_ATTRIBUTE (dwarf_version >= 5 ? DW_AT_macros \
4110 : dwarf_strict ? DW_AT_macro_info : DW_AT_GNU_macros)
4112 /* Labels we insert at beginning sections we can reference instead of
4113 the section names themselves. */
4115 #ifndef TEXT_SECTION_LABEL
4116 #define TEXT_SECTION_LABEL "Ltext"
4118 #ifndef COLD_TEXT_SECTION_LABEL
4119 #define COLD_TEXT_SECTION_LABEL "Ltext_cold"
4121 #ifndef DEBUG_LINE_SECTION_LABEL
4122 #define DEBUG_LINE_SECTION_LABEL "Ldebug_line"
4124 #ifndef DEBUG_SKELETON_LINE_SECTION_LABEL
4125 #define DEBUG_SKELETON_LINE_SECTION_LABEL "Lskeleton_debug_line"
4127 #ifndef DEBUG_INFO_SECTION_LABEL
4128 #define DEBUG_INFO_SECTION_LABEL "Ldebug_info"
4130 #ifndef DEBUG_SKELETON_INFO_SECTION_LABEL
4131 #define DEBUG_SKELETON_INFO_SECTION_LABEL "Lskeleton_debug_info"
4133 #ifndef DEBUG_ABBREV_SECTION_LABEL
4134 #define DEBUG_ABBREV_SECTION_LABEL "Ldebug_abbrev"
4136 #ifndef DEBUG_SKELETON_ABBREV_SECTION_LABEL
4137 #define DEBUG_SKELETON_ABBREV_SECTION_LABEL "Lskeleton_debug_abbrev"
4139 #ifndef DEBUG_ADDR_SECTION_LABEL
4140 #define DEBUG_ADDR_SECTION_LABEL "Ldebug_addr"
4142 #ifndef DEBUG_LOC_SECTION_LABEL
4143 #define DEBUG_LOC_SECTION_LABEL "Ldebug_loc"
4145 #ifndef DEBUG_RANGES_SECTION_LABEL
4146 #define DEBUG_RANGES_SECTION_LABEL "Ldebug_ranges"
4148 #ifndef DEBUG_MACINFO_SECTION_LABEL
4149 #define DEBUG_MACINFO_SECTION_LABEL "Ldebug_macinfo"
4151 #ifndef DEBUG_MACRO_SECTION_LABEL
4152 #define DEBUG_MACRO_SECTION_LABEL "Ldebug_macro"
4154 #define SKELETON_COMP_DIE_ABBREV 1
4155 #define SKELETON_TYPE_DIE_ABBREV 2
4157 /* Definitions of defaults for formats and names of various special
4158 (artificial) labels which may be generated within this file (when the -g
4159 options is used and DWARF2_DEBUGGING_INFO is in effect.
4160 If necessary, these may be overridden from within the tm.h file, but
4161 typically, overriding these defaults is unnecessary. */
4163 static char text_end_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4164 static char text_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4165 static char cold_text_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4166 static char cold_end_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4167 static char abbrev_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4168 static char debug_info_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4169 static char debug_skeleton_info_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4170 static char debug_skeleton_abbrev_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4171 static char debug_line_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4172 static char debug_addr_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4173 static char debug_skeleton_line_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4174 static char macinfo_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4175 static char loc_section_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4176 static char ranges_section_label
[2 * MAX_ARTIFICIAL_LABEL_BYTES
];
4177 static char ranges_base_label
[2 * MAX_ARTIFICIAL_LABEL_BYTES
];
4179 #ifndef TEXT_END_LABEL
4180 #define TEXT_END_LABEL "Letext"
4182 #ifndef COLD_END_LABEL
4183 #define COLD_END_LABEL "Letext_cold"
4185 #ifndef BLOCK_BEGIN_LABEL
4186 #define BLOCK_BEGIN_LABEL "LBB"
4188 #ifndef BLOCK_INLINE_ENTRY_LABEL
4189 #define BLOCK_INLINE_ENTRY_LABEL "LBI"
4191 #ifndef BLOCK_END_LABEL
4192 #define BLOCK_END_LABEL "LBE"
4194 #ifndef LINE_CODE_LABEL
4195 #define LINE_CODE_LABEL "LM"
4199 /* Return the root of the DIE's built for the current compilation unit. */
4201 comp_unit_die (void)
4203 if (!single_comp_unit_die
)
4204 single_comp_unit_die
= gen_compile_unit_die (NULL
);
4205 return single_comp_unit_die
;
4208 /* We allow a language front-end to designate a function that is to be
4209 called to "demangle" any name before it is put into a DIE. */
4211 static const char *(*demangle_name_func
) (const char *);
4214 dwarf2out_set_demangle_name_func (const char *(*func
) (const char *))
4216 demangle_name_func
= func
;
4219 /* Test if rtl node points to a pseudo register. */
4222 is_pseudo_reg (const_rtx rtl
)
4224 return ((REG_P (rtl
) && REGNO (rtl
) >= FIRST_PSEUDO_REGISTER
)
4225 || (GET_CODE (rtl
) == SUBREG
4226 && REGNO (SUBREG_REG (rtl
)) >= FIRST_PSEUDO_REGISTER
));
4229 /* Return a reference to a type, with its const and volatile qualifiers
4233 type_main_variant (tree type
)
4235 type
= TYPE_MAIN_VARIANT (type
);
4237 /* ??? There really should be only one main variant among any group of
4238 variants of a given type (and all of the MAIN_VARIANT values for all
4239 members of the group should point to that one type) but sometimes the C
4240 front-end messes this up for array types, so we work around that bug
4242 if (TREE_CODE (type
) == ARRAY_TYPE
)
4243 while (type
!= TYPE_MAIN_VARIANT (type
))
4244 type
= TYPE_MAIN_VARIANT (type
);
4249 /* Return nonzero if the given type node represents a tagged type. */
4252 is_tagged_type (const_tree type
)
4254 enum tree_code code
= TREE_CODE (type
);
4256 return (code
== RECORD_TYPE
|| code
== UNION_TYPE
4257 || code
== QUAL_UNION_TYPE
|| code
== ENUMERAL_TYPE
);
4260 /* Set label to debug_info_section_label + die_offset of a DIE reference. */
4263 get_ref_die_offset_label (char *label
, dw_die_ref ref
)
4265 sprintf (label
, "%s+%ld", debug_info_section_label
, ref
->die_offset
);
4268 /* Return die_offset of a DIE reference to a base type. */
4270 static unsigned long int
4271 get_base_type_offset (dw_die_ref ref
)
4273 if (ref
->die_offset
)
4274 return ref
->die_offset
;
4275 if (comp_unit_die ()->die_abbrev
)
4277 calc_base_type_die_sizes ();
4278 gcc_assert (ref
->die_offset
);
4280 return ref
->die_offset
;
4283 /* Return die_offset of a DIE reference other than base type. */
4285 static unsigned long int
4286 get_ref_die_offset (dw_die_ref ref
)
4288 gcc_assert (ref
->die_offset
);
4289 return ref
->die_offset
;
4292 /* Convert a DIE tag into its string name. */
4295 dwarf_tag_name (unsigned int tag
)
4297 const char *name
= get_DW_TAG_name (tag
);
4302 return "DW_TAG_<unknown>";
4305 /* Convert a DWARF attribute code into its string name. */
4308 dwarf_attr_name (unsigned int attr
)
4314 #if VMS_DEBUGGING_INFO
4315 case DW_AT_HP_prologue
:
4316 return "DW_AT_HP_prologue";
4318 case DW_AT_MIPS_loop_unroll_factor
:
4319 return "DW_AT_MIPS_loop_unroll_factor";
4322 #if VMS_DEBUGGING_INFO
4323 case DW_AT_HP_epilogue
:
4324 return "DW_AT_HP_epilogue";
4326 case DW_AT_MIPS_stride
:
4327 return "DW_AT_MIPS_stride";
4331 name
= get_DW_AT_name (attr
);
4336 return "DW_AT_<unknown>";
4339 /* Convert a DWARF value form code into its string name. */
4342 dwarf_form_name (unsigned int form
)
4344 const char *name
= get_DW_FORM_name (form
);
4349 return "DW_FORM_<unknown>";
4352 /* Determine the "ultimate origin" of a decl. The decl may be an inlined
4353 instance of an inlined instance of a decl which is local to an inline
4354 function, so we have to trace all of the way back through the origin chain
4355 to find out what sort of node actually served as the original seed for the
4359 decl_ultimate_origin (const_tree decl
)
4361 if (!CODE_CONTAINS_STRUCT (TREE_CODE (decl
), TS_DECL_COMMON
))
4364 /* DECL_ABSTRACT_ORIGIN can point to itself; ignore that if
4365 we're trying to output the abstract instance of this function. */
4366 if (DECL_ABSTRACT_P (decl
) && DECL_ABSTRACT_ORIGIN (decl
) == decl
)
4369 /* Since the DECL_ABSTRACT_ORIGIN for a DECL is supposed to be the
4370 most distant ancestor, this should never happen. */
4371 gcc_assert (!DECL_FROM_INLINE (DECL_ORIGIN (decl
)));
4373 return DECL_ABSTRACT_ORIGIN (decl
);
4376 /* Get the class to which DECL belongs, if any. In g++, the DECL_CONTEXT
4377 of a virtual function may refer to a base class, so we check the 'this'
4381 decl_class_context (tree decl
)
4383 tree context
= NULL_TREE
;
4385 if (TREE_CODE (decl
) != FUNCTION_DECL
|| ! DECL_VINDEX (decl
))
4386 context
= DECL_CONTEXT (decl
);
4388 context
= TYPE_MAIN_VARIANT
4389 (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (decl
)))));
4391 if (context
&& !TYPE_P (context
))
4392 context
= NULL_TREE
;
4397 /* Add an attribute/value pair to a DIE. */
4400 add_dwarf_attr (dw_die_ref die
, dw_attr_node
*attr
)
4402 /* Maybe this should be an assert? */
4408 /* Check we do not add duplicate attrs. Can't use get_AT here
4409 because that recurses to the specification/abstract origin DIE. */
4412 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
4413 gcc_assert (a
->dw_attr
!= attr
->dw_attr
);
4416 vec_safe_reserve (die
->die_attr
, 1);
4417 vec_safe_push (die
->die_attr
, *attr
);
4420 static inline enum dw_val_class
4421 AT_class (dw_attr_node
*a
)
4423 return a
->dw_attr_val
.val_class
;
4426 /* Return the index for any attribute that will be referenced with a
4427 DW_FORM_addrx/GNU_addr_index or DW_FORM_strx/GNU_str_index. String
4428 indices are stored in dw_attr_val.v.val_str for reference counting
4431 static inline unsigned int
4432 AT_index (dw_attr_node
*a
)
4434 if (AT_class (a
) == dw_val_class_str
)
4435 return a
->dw_attr_val
.v
.val_str
->index
;
4436 else if (a
->dw_attr_val
.val_entry
!= NULL
)
4437 return a
->dw_attr_val
.val_entry
->index
;
4441 /* Add a flag value attribute to a DIE. */
4444 add_AT_flag (dw_die_ref die
, enum dwarf_attribute attr_kind
, unsigned int flag
)
4448 attr
.dw_attr
= attr_kind
;
4449 attr
.dw_attr_val
.val_class
= dw_val_class_flag
;
4450 attr
.dw_attr_val
.val_entry
= NULL
;
4451 attr
.dw_attr_val
.v
.val_flag
= flag
;
4452 add_dwarf_attr (die
, &attr
);
4455 static inline unsigned
4456 AT_flag (dw_attr_node
*a
)
4458 gcc_assert (a
&& AT_class (a
) == dw_val_class_flag
);
4459 return a
->dw_attr_val
.v
.val_flag
;
4462 /* Add a signed integer attribute value to a DIE. */
4465 add_AT_int (dw_die_ref die
, enum dwarf_attribute attr_kind
, HOST_WIDE_INT int_val
)
4469 attr
.dw_attr
= attr_kind
;
4470 attr
.dw_attr_val
.val_class
= dw_val_class_const
;
4471 attr
.dw_attr_val
.val_entry
= NULL
;
4472 attr
.dw_attr_val
.v
.val_int
= int_val
;
4473 add_dwarf_attr (die
, &attr
);
4476 static inline HOST_WIDE_INT
4477 AT_int (dw_attr_node
*a
)
4479 gcc_assert (a
&& (AT_class (a
) == dw_val_class_const
4480 || AT_class (a
) == dw_val_class_const_implicit
));
4481 return a
->dw_attr_val
.v
.val_int
;
4484 /* Add an unsigned integer attribute value to a DIE. */
4487 add_AT_unsigned (dw_die_ref die
, enum dwarf_attribute attr_kind
,
4488 unsigned HOST_WIDE_INT unsigned_val
)
4492 attr
.dw_attr
= attr_kind
;
4493 attr
.dw_attr_val
.val_class
= dw_val_class_unsigned_const
;
4494 attr
.dw_attr_val
.val_entry
= NULL
;
4495 attr
.dw_attr_val
.v
.val_unsigned
= unsigned_val
;
4496 add_dwarf_attr (die
, &attr
);
4499 static inline unsigned HOST_WIDE_INT
4500 AT_unsigned (dw_attr_node
*a
)
4502 gcc_assert (a
&& (AT_class (a
) == dw_val_class_unsigned_const
4503 || AT_class (a
) == dw_val_class_unsigned_const_implicit
));
4504 return a
->dw_attr_val
.v
.val_unsigned
;
4507 /* Add an unsigned wide integer attribute value to a DIE. */
4510 add_AT_wide (dw_die_ref die
, enum dwarf_attribute attr_kind
,
4515 attr
.dw_attr
= attr_kind
;
4516 attr
.dw_attr_val
.val_class
= dw_val_class_wide_int
;
4517 attr
.dw_attr_val
.val_entry
= NULL
;
4518 attr
.dw_attr_val
.v
.val_wide
= ggc_alloc
<wide_int
> ();
4519 *attr
.dw_attr_val
.v
.val_wide
= w
;
4520 add_dwarf_attr (die
, &attr
);
4523 /* Add an unsigned double integer attribute value to a DIE. */
4526 add_AT_double (dw_die_ref die
, enum dwarf_attribute attr_kind
,
4527 HOST_WIDE_INT high
, unsigned HOST_WIDE_INT low
)
4531 attr
.dw_attr
= attr_kind
;
4532 attr
.dw_attr_val
.val_class
= dw_val_class_const_double
;
4533 attr
.dw_attr_val
.val_entry
= NULL
;
4534 attr
.dw_attr_val
.v
.val_double
.high
= high
;
4535 attr
.dw_attr_val
.v
.val_double
.low
= low
;
4536 add_dwarf_attr (die
, &attr
);
4539 /* Add a floating point attribute value to a DIE and return it. */
4542 add_AT_vec (dw_die_ref die
, enum dwarf_attribute attr_kind
,
4543 unsigned int length
, unsigned int elt_size
, unsigned char *array
)
4547 attr
.dw_attr
= attr_kind
;
4548 attr
.dw_attr_val
.val_class
= dw_val_class_vec
;
4549 attr
.dw_attr_val
.val_entry
= NULL
;
4550 attr
.dw_attr_val
.v
.val_vec
.length
= length
;
4551 attr
.dw_attr_val
.v
.val_vec
.elt_size
= elt_size
;
4552 attr
.dw_attr_val
.v
.val_vec
.array
= array
;
4553 add_dwarf_attr (die
, &attr
);
4556 /* Add an 8-byte data attribute value to a DIE. */
4559 add_AT_data8 (dw_die_ref die
, enum dwarf_attribute attr_kind
,
4560 unsigned char data8
[8])
4564 attr
.dw_attr
= attr_kind
;
4565 attr
.dw_attr_val
.val_class
= dw_val_class_data8
;
4566 attr
.dw_attr_val
.val_entry
= NULL
;
4567 memcpy (attr
.dw_attr_val
.v
.val_data8
, data8
, 8);
4568 add_dwarf_attr (die
, &attr
);
4571 /* Add DW_AT_low_pc and DW_AT_high_pc to a DIE. When using
4572 dwarf_split_debug_info, address attributes in dies destined for the
4573 final executable have force_direct set to avoid using indexed
4577 add_AT_low_high_pc (dw_die_ref die
, const char *lbl_low
, const char *lbl_high
,
4583 lbl_id
= xstrdup (lbl_low
);
4584 attr
.dw_attr
= DW_AT_low_pc
;
4585 attr
.dw_attr_val
.val_class
= dw_val_class_lbl_id
;
4586 attr
.dw_attr_val
.v
.val_lbl_id
= lbl_id
;
4587 if (dwarf_split_debug_info
&& !force_direct
)
4588 attr
.dw_attr_val
.val_entry
4589 = add_addr_table_entry (lbl_id
, ate_kind_label
);
4591 attr
.dw_attr_val
.val_entry
= NULL
;
4592 add_dwarf_attr (die
, &attr
);
4594 attr
.dw_attr
= DW_AT_high_pc
;
4595 if (dwarf_version
< 4)
4596 attr
.dw_attr_val
.val_class
= dw_val_class_lbl_id
;
4598 attr
.dw_attr_val
.val_class
= dw_val_class_high_pc
;
4599 lbl_id
= xstrdup (lbl_high
);
4600 attr
.dw_attr_val
.v
.val_lbl_id
= lbl_id
;
4601 if (attr
.dw_attr_val
.val_class
== dw_val_class_lbl_id
4602 && dwarf_split_debug_info
&& !force_direct
)
4603 attr
.dw_attr_val
.val_entry
4604 = add_addr_table_entry (lbl_id
, ate_kind_label
);
4606 attr
.dw_attr_val
.val_entry
= NULL
;
4607 add_dwarf_attr (die
, &attr
);
4610 /* Hash and equality functions for debug_str_hash. */
4613 indirect_string_hasher::hash (indirect_string_node
*x
)
4615 return htab_hash_string (x
->str
);
4619 indirect_string_hasher::equal (indirect_string_node
*x1
, const char *x2
)
4621 return strcmp (x1
->str
, x2
) == 0;
4624 /* Add STR to the given string hash table. */
4626 static struct indirect_string_node
*
4627 find_AT_string_in_table (const char *str
,
4628 hash_table
<indirect_string_hasher
> *table
,
4629 enum insert_option insert
= INSERT
)
4631 struct indirect_string_node
*node
;
4633 indirect_string_node
**slot
4634 = table
->find_slot_with_hash (str
, htab_hash_string (str
), insert
);
4637 node
= ggc_cleared_alloc
<indirect_string_node
> ();
4638 node
->str
= ggc_strdup (str
);
4648 /* Add STR to the indirect string hash table. */
4650 static struct indirect_string_node
*
4651 find_AT_string (const char *str
, enum insert_option insert
= INSERT
)
4653 if (! debug_str_hash
)
4654 debug_str_hash
= hash_table
<indirect_string_hasher
>::create_ggc (10);
4656 return find_AT_string_in_table (str
, debug_str_hash
, insert
);
4659 /* Add a string attribute value to a DIE. */
4662 add_AT_string (dw_die_ref die
, enum dwarf_attribute attr_kind
, const char *str
)
4665 struct indirect_string_node
*node
;
4667 node
= find_AT_string (str
);
4669 attr
.dw_attr
= attr_kind
;
4670 attr
.dw_attr_val
.val_class
= dw_val_class_str
;
4671 attr
.dw_attr_val
.val_entry
= NULL
;
4672 attr
.dw_attr_val
.v
.val_str
= node
;
4673 add_dwarf_attr (die
, &attr
);
4676 static inline const char *
4677 AT_string (dw_attr_node
*a
)
4679 gcc_assert (a
&& AT_class (a
) == dw_val_class_str
);
4680 return a
->dw_attr_val
.v
.val_str
->str
;
4683 /* Call this function directly to bypass AT_string_form's logic to put
4684 the string inline in the die. */
4687 set_indirect_string (struct indirect_string_node
*node
)
4689 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
4690 /* Already indirect is a no op. */
4691 if (node
->form
== DW_FORM_strp
4692 || node
->form
== DW_FORM_line_strp
4693 || node
->form
== dwarf_FORM (DW_FORM_strx
))
4695 gcc_assert (node
->label
);
4698 ASM_GENERATE_INTERNAL_LABEL (label
, "LASF", dw2_string_counter
);
4699 ++dw2_string_counter
;
4700 node
->label
= xstrdup (label
);
4702 if (!dwarf_split_debug_info
)
4704 node
->form
= DW_FORM_strp
;
4705 node
->index
= NOT_INDEXED
;
4709 node
->form
= dwarf_FORM (DW_FORM_strx
);
4710 node
->index
= NO_INDEX_ASSIGNED
;
4714 /* A helper function for dwarf2out_finish, called to reset indirect
4715 string decisions done for early LTO dwarf output before fat object
4719 reset_indirect_string (indirect_string_node
**h
, void *)
4721 struct indirect_string_node
*node
= *h
;
4722 if (node
->form
== DW_FORM_strp
|| node
->form
== dwarf_FORM (DW_FORM_strx
))
4726 node
->form
= (dwarf_form
) 0;
4732 /* Find out whether a string should be output inline in DIE
4733 or out-of-line in .debug_str section. */
4735 static enum dwarf_form
4736 find_string_form (struct indirect_string_node
*node
)
4743 len
= strlen (node
->str
) + 1;
4745 /* If the string is shorter or equal to the size of the reference, it is
4746 always better to put it inline. */
4747 if (len
<= DWARF_OFFSET_SIZE
|| node
->refcount
== 0)
4748 return node
->form
= DW_FORM_string
;
4750 /* If we cannot expect the linker to merge strings in .debug_str
4751 section, only put it into .debug_str if it is worth even in this
4753 if (DWARF2_INDIRECT_STRING_SUPPORT_MISSING_ON_TARGET
4754 || ((debug_str_section
->common
.flags
& SECTION_MERGE
) == 0
4755 && (len
- DWARF_OFFSET_SIZE
) * node
->refcount
<= len
))
4756 return node
->form
= DW_FORM_string
;
4758 set_indirect_string (node
);
4763 /* Find out whether the string referenced from the attribute should be
4764 output inline in DIE or out-of-line in .debug_str section. */
4766 static enum dwarf_form
4767 AT_string_form (dw_attr_node
*a
)
4769 gcc_assert (a
&& AT_class (a
) == dw_val_class_str
);
4770 return find_string_form (a
->dw_attr_val
.v
.val_str
);
4773 /* Add a DIE reference attribute value to a DIE. */
4776 add_AT_die_ref (dw_die_ref die
, enum dwarf_attribute attr_kind
, dw_die_ref targ_die
)
4779 gcc_checking_assert (targ_die
!= NULL
);
4781 /* With LTO we can end up trying to reference something we didn't create
4782 a DIE for. Avoid crashing later on a NULL referenced DIE. */
4783 if (targ_die
== NULL
)
4786 attr
.dw_attr
= attr_kind
;
4787 attr
.dw_attr_val
.val_class
= dw_val_class_die_ref
;
4788 attr
.dw_attr_val
.val_entry
= NULL
;
4789 attr
.dw_attr_val
.v
.val_die_ref
.die
= targ_die
;
4790 attr
.dw_attr_val
.v
.val_die_ref
.external
= 0;
4791 add_dwarf_attr (die
, &attr
);
4794 /* Change DIE reference REF to point to NEW_DIE instead. */
4797 change_AT_die_ref (dw_attr_node
*ref
, dw_die_ref new_die
)
4799 gcc_assert (ref
->dw_attr_val
.val_class
== dw_val_class_die_ref
);
4800 ref
->dw_attr_val
.v
.val_die_ref
.die
= new_die
;
4801 ref
->dw_attr_val
.v
.val_die_ref
.external
= 0;
4804 /* Add an AT_specification attribute to a DIE, and also make the back
4805 pointer from the specification to the definition. */
4808 add_AT_specification (dw_die_ref die
, dw_die_ref targ_die
)
4810 add_AT_die_ref (die
, DW_AT_specification
, targ_die
);
4811 gcc_assert (!targ_die
->die_definition
);
4812 targ_die
->die_definition
= die
;
4815 static inline dw_die_ref
4816 AT_ref (dw_attr_node
*a
)
4818 gcc_assert (a
&& AT_class (a
) == dw_val_class_die_ref
);
4819 return a
->dw_attr_val
.v
.val_die_ref
.die
;
4823 AT_ref_external (dw_attr_node
*a
)
4825 if (a
&& AT_class (a
) == dw_val_class_die_ref
)
4826 return a
->dw_attr_val
.v
.val_die_ref
.external
;
4832 set_AT_ref_external (dw_attr_node
*a
, int i
)
4834 gcc_assert (a
&& AT_class (a
) == dw_val_class_die_ref
);
4835 a
->dw_attr_val
.v
.val_die_ref
.external
= i
;
4838 /* Add a location description attribute value to a DIE. */
4841 add_AT_loc (dw_die_ref die
, enum dwarf_attribute attr_kind
, dw_loc_descr_ref loc
)
4845 attr
.dw_attr
= attr_kind
;
4846 attr
.dw_attr_val
.val_class
= dw_val_class_loc
;
4847 attr
.dw_attr_val
.val_entry
= NULL
;
4848 attr
.dw_attr_val
.v
.val_loc
= loc
;
4849 add_dwarf_attr (die
, &attr
);
4852 static inline dw_loc_descr_ref
4853 AT_loc (dw_attr_node
*a
)
4855 gcc_assert (a
&& AT_class (a
) == dw_val_class_loc
);
4856 return a
->dw_attr_val
.v
.val_loc
;
4860 add_AT_loc_list (dw_die_ref die
, enum dwarf_attribute attr_kind
, dw_loc_list_ref loc_list
)
4864 if (XCOFF_DEBUGGING_INFO
&& !HAVE_XCOFF_DWARF_EXTRAS
)
4867 attr
.dw_attr
= attr_kind
;
4868 attr
.dw_attr_val
.val_class
= dw_val_class_loc_list
;
4869 attr
.dw_attr_val
.val_entry
= NULL
;
4870 attr
.dw_attr_val
.v
.val_loc_list
= loc_list
;
4871 add_dwarf_attr (die
, &attr
);
4872 have_location_lists
= true;
4875 static inline dw_loc_list_ref
4876 AT_loc_list (dw_attr_node
*a
)
4878 gcc_assert (a
&& AT_class (a
) == dw_val_class_loc_list
);
4879 return a
->dw_attr_val
.v
.val_loc_list
;
4882 /* Add a view list attribute to DIE. It must have a DW_AT_location
4883 attribute, because the view list complements the location list. */
4886 add_AT_view_list (dw_die_ref die
, enum dwarf_attribute attr_kind
)
4890 if (XCOFF_DEBUGGING_INFO
&& !HAVE_XCOFF_DWARF_EXTRAS
)
4893 attr
.dw_attr
= attr_kind
;
4894 attr
.dw_attr_val
.val_class
= dw_val_class_view_list
;
4895 attr
.dw_attr_val
.val_entry
= NULL
;
4896 attr
.dw_attr_val
.v
.val_view_list
= die
;
4897 add_dwarf_attr (die
, &attr
);
4898 gcc_checking_assert (get_AT (die
, DW_AT_location
));
4899 gcc_assert (have_location_lists
);
4902 /* Return a pointer to the location list referenced by the attribute.
4903 If the named attribute is a view list, look up the corresponding
4904 DW_AT_location attribute and return its location list. */
4906 static inline dw_loc_list_ref
*
4907 AT_loc_list_ptr (dw_attr_node
*a
)
4910 switch (AT_class (a
))
4912 case dw_val_class_loc_list
:
4913 return &a
->dw_attr_val
.v
.val_loc_list
;
4914 case dw_val_class_view_list
:
4917 l
= get_AT (a
->dw_attr_val
.v
.val_view_list
, DW_AT_location
);
4920 gcc_checking_assert (l
+ 1 == a
);
4921 return AT_loc_list_ptr (l
);
4928 /* Return the location attribute value associated with a view list
4931 static inline dw_val_node
*
4932 view_list_to_loc_list_val_node (dw_val_node
*val
)
4934 gcc_assert (val
->val_class
== dw_val_class_view_list
);
4935 dw_attr_node
*loc
= get_AT (val
->v
.val_view_list
, DW_AT_location
);
4938 gcc_checking_assert (&(loc
+ 1)->dw_attr_val
== val
);
4939 gcc_assert (AT_class (loc
) == dw_val_class_loc_list
);
4940 return &loc
->dw_attr_val
;
4943 struct addr_hasher
: ggc_ptr_hash
<addr_table_entry
>
4945 static hashval_t
hash (addr_table_entry
*);
4946 static bool equal (addr_table_entry
*, addr_table_entry
*);
4949 /* Table of entries into the .debug_addr section. */
4951 static GTY (()) hash_table
<addr_hasher
> *addr_index_table
;
4953 /* Hash an address_table_entry. */
4956 addr_hasher::hash (addr_table_entry
*a
)
4958 inchash::hash hstate
;
4964 case ate_kind_rtx_dtprel
:
4967 case ate_kind_label
:
4968 return htab_hash_string (a
->addr
.label
);
4972 inchash::add_rtx (a
->addr
.rtl
, hstate
);
4973 return hstate
.end ();
4976 /* Determine equality for two address_table_entries. */
4979 addr_hasher::equal (addr_table_entry
*a1
, addr_table_entry
*a2
)
4981 if (a1
->kind
!= a2
->kind
)
4986 case ate_kind_rtx_dtprel
:
4987 return rtx_equal_p (a1
->addr
.rtl
, a2
->addr
.rtl
);
4988 case ate_kind_label
:
4989 return strcmp (a1
->addr
.label
, a2
->addr
.label
) == 0;
4995 /* Initialize an addr_table_entry. */
4998 init_addr_table_entry (addr_table_entry
*e
, enum ate_kind kind
, void *addr
)
5004 case ate_kind_rtx_dtprel
:
5005 e
->addr
.rtl
= (rtx
) addr
;
5007 case ate_kind_label
:
5008 e
->addr
.label
= (char *) addr
;
5012 e
->index
= NO_INDEX_ASSIGNED
;
5015 /* Add attr to the address table entry to the table. Defer setting an
5016 index until output time. */
5018 static addr_table_entry
*
5019 add_addr_table_entry (void *addr
, enum ate_kind kind
)
5021 addr_table_entry
*node
;
5022 addr_table_entry finder
;
5024 gcc_assert (dwarf_split_debug_info
);
5025 if (! addr_index_table
)
5026 addr_index_table
= hash_table
<addr_hasher
>::create_ggc (10);
5027 init_addr_table_entry (&finder
, kind
, addr
);
5028 addr_table_entry
**slot
= addr_index_table
->find_slot (&finder
, INSERT
);
5030 if (*slot
== HTAB_EMPTY_ENTRY
)
5032 node
= ggc_cleared_alloc
<addr_table_entry
> ();
5033 init_addr_table_entry (node
, kind
, addr
);
5043 /* Remove an entry from the addr table by decrementing its refcount.
5044 Strictly, decrementing the refcount would be enough, but the
5045 assertion that the entry is actually in the table has found
5049 remove_addr_table_entry (addr_table_entry
*entry
)
5051 gcc_assert (dwarf_split_debug_info
&& addr_index_table
);
5052 /* After an index is assigned, the table is frozen. */
5053 gcc_assert (entry
->refcount
> 0 && entry
->index
== NO_INDEX_ASSIGNED
);
5057 /* Given a location list, remove all addresses it refers to from the
5061 remove_loc_list_addr_table_entries (dw_loc_descr_ref descr
)
5063 for (; descr
; descr
= descr
->dw_loc_next
)
5064 if (descr
->dw_loc_oprnd1
.val_entry
!= NULL
)
5066 gcc_assert (descr
->dw_loc_oprnd1
.val_entry
->index
== NO_INDEX_ASSIGNED
);
5067 remove_addr_table_entry (descr
->dw_loc_oprnd1
.val_entry
);
5071 /* A helper function for dwarf2out_finish called through
5072 htab_traverse. Assign an addr_table_entry its index. All entries
5073 must be collected into the table when this function is called,
5074 because the indexing code relies on htab_traverse to traverse nodes
5075 in the same order for each run. */
5078 index_addr_table_entry (addr_table_entry
**h
, unsigned int *index
)
5080 addr_table_entry
*node
= *h
;
5082 /* Don't index unreferenced nodes. */
5083 if (node
->refcount
== 0)
5086 gcc_assert (node
->index
== NO_INDEX_ASSIGNED
);
5087 node
->index
= *index
;
5093 /* Add an address constant attribute value to a DIE. When using
5094 dwarf_split_debug_info, address attributes in dies destined for the
5095 final executable should be direct references--setting the parameter
5096 force_direct ensures this behavior. */
5099 add_AT_addr (dw_die_ref die
, enum dwarf_attribute attr_kind
, rtx addr
,
5104 attr
.dw_attr
= attr_kind
;
5105 attr
.dw_attr_val
.val_class
= dw_val_class_addr
;
5106 attr
.dw_attr_val
.v
.val_addr
= addr
;
5107 if (dwarf_split_debug_info
&& !force_direct
)
5108 attr
.dw_attr_val
.val_entry
= add_addr_table_entry (addr
, ate_kind_rtx
);
5110 attr
.dw_attr_val
.val_entry
= NULL
;
5111 add_dwarf_attr (die
, &attr
);
5114 /* Get the RTX from to an address DIE attribute. */
5117 AT_addr (dw_attr_node
*a
)
5119 gcc_assert (a
&& AT_class (a
) == dw_val_class_addr
);
5120 return a
->dw_attr_val
.v
.val_addr
;
5123 /* Add a file attribute value to a DIE. */
5126 add_AT_file (dw_die_ref die
, enum dwarf_attribute attr_kind
,
5127 struct dwarf_file_data
*fd
)
5131 attr
.dw_attr
= attr_kind
;
5132 attr
.dw_attr_val
.val_class
= dw_val_class_file
;
5133 attr
.dw_attr_val
.val_entry
= NULL
;
5134 attr
.dw_attr_val
.v
.val_file
= fd
;
5135 add_dwarf_attr (die
, &attr
);
5138 /* Get the dwarf_file_data from a file DIE attribute. */
5140 static inline struct dwarf_file_data
*
5141 AT_file (dw_attr_node
*a
)
5143 gcc_assert (a
&& (AT_class (a
) == dw_val_class_file
5144 || AT_class (a
) == dw_val_class_file_implicit
));
5145 return a
->dw_attr_val
.v
.val_file
;
5148 /* Add a vms delta attribute value to a DIE. */
5151 add_AT_vms_delta (dw_die_ref die
, enum dwarf_attribute attr_kind
,
5152 const char *lbl1
, const char *lbl2
)
5156 attr
.dw_attr
= attr_kind
;
5157 attr
.dw_attr_val
.val_class
= dw_val_class_vms_delta
;
5158 attr
.dw_attr_val
.val_entry
= NULL
;
5159 attr
.dw_attr_val
.v
.val_vms_delta
.lbl1
= xstrdup (lbl1
);
5160 attr
.dw_attr_val
.v
.val_vms_delta
.lbl2
= xstrdup (lbl2
);
5161 add_dwarf_attr (die
, &attr
);
5164 /* Add a symbolic view identifier attribute value to a DIE. */
5167 add_AT_symview (dw_die_ref die
, enum dwarf_attribute attr_kind
,
5168 const char *view_label
)
5172 attr
.dw_attr
= attr_kind
;
5173 attr
.dw_attr_val
.val_class
= dw_val_class_symview
;
5174 attr
.dw_attr_val
.val_entry
= NULL
;
5175 attr
.dw_attr_val
.v
.val_symbolic_view
= xstrdup (view_label
);
5176 add_dwarf_attr (die
, &attr
);
5179 /* Add a label identifier attribute value to a DIE. */
5182 add_AT_lbl_id (dw_die_ref die
, enum dwarf_attribute attr_kind
,
5187 attr
.dw_attr
= attr_kind
;
5188 attr
.dw_attr_val
.val_class
= dw_val_class_lbl_id
;
5189 attr
.dw_attr_val
.val_entry
= NULL
;
5190 attr
.dw_attr_val
.v
.val_lbl_id
= xstrdup (lbl_id
);
5191 if (dwarf_split_debug_info
)
5192 attr
.dw_attr_val
.val_entry
5193 = add_addr_table_entry (attr
.dw_attr_val
.v
.val_lbl_id
,
5195 add_dwarf_attr (die
, &attr
);
5198 /* Add a section offset attribute value to a DIE, an offset into the
5199 debug_line section. */
5202 add_AT_lineptr (dw_die_ref die
, enum dwarf_attribute attr_kind
,
5207 attr
.dw_attr
= attr_kind
;
5208 attr
.dw_attr_val
.val_class
= dw_val_class_lineptr
;
5209 attr
.dw_attr_val
.val_entry
= NULL
;
5210 attr
.dw_attr_val
.v
.val_lbl_id
= xstrdup (label
);
5211 add_dwarf_attr (die
, &attr
);
5214 /* Add a section offset attribute value to a DIE, an offset into the
5215 debug_macinfo section. */
5218 add_AT_macptr (dw_die_ref die
, enum dwarf_attribute attr_kind
,
5223 attr
.dw_attr
= attr_kind
;
5224 attr
.dw_attr_val
.val_class
= dw_val_class_macptr
;
5225 attr
.dw_attr_val
.val_entry
= NULL
;
5226 attr
.dw_attr_val
.v
.val_lbl_id
= xstrdup (label
);
5227 add_dwarf_attr (die
, &attr
);
5230 /* Add a range_list attribute value to a DIE. When using
5231 dwarf_split_debug_info, address attributes in dies destined for the
5232 final executable should be direct references--setting the parameter
5233 force_direct ensures this behavior. */
5235 #define UNRELOCATED_OFFSET ((addr_table_entry *) 1)
5236 #define RELOCATED_OFFSET (NULL)
5239 add_AT_range_list (dw_die_ref die
, enum dwarf_attribute attr_kind
,
5240 long unsigned int offset
, bool force_direct
)
5244 attr
.dw_attr
= attr_kind
;
5245 attr
.dw_attr_val
.val_class
= dw_val_class_range_list
;
5246 /* For the range_list attribute, use val_entry to store whether the
5247 offset should follow split-debug-info or normal semantics. This
5248 value is read in output_range_list_offset. */
5249 if (dwarf_split_debug_info
&& !force_direct
)
5250 attr
.dw_attr_val
.val_entry
= UNRELOCATED_OFFSET
;
5252 attr
.dw_attr_val
.val_entry
= RELOCATED_OFFSET
;
5253 attr
.dw_attr_val
.v
.val_offset
= offset
;
5254 add_dwarf_attr (die
, &attr
);
5257 /* Return the start label of a delta attribute. */
5259 static inline const char *
5260 AT_vms_delta1 (dw_attr_node
*a
)
5262 gcc_assert (a
&& (AT_class (a
) == dw_val_class_vms_delta
));
5263 return a
->dw_attr_val
.v
.val_vms_delta
.lbl1
;
5266 /* Return the end label of a delta attribute. */
5268 static inline const char *
5269 AT_vms_delta2 (dw_attr_node
*a
)
5271 gcc_assert (a
&& (AT_class (a
) == dw_val_class_vms_delta
));
5272 return a
->dw_attr_val
.v
.val_vms_delta
.lbl2
;
5275 static inline const char *
5276 AT_lbl (dw_attr_node
*a
)
5278 gcc_assert (a
&& (AT_class (a
) == dw_val_class_lbl_id
5279 || AT_class (a
) == dw_val_class_lineptr
5280 || AT_class (a
) == dw_val_class_macptr
5281 || AT_class (a
) == dw_val_class_loclistsptr
5282 || AT_class (a
) == dw_val_class_high_pc
));
5283 return a
->dw_attr_val
.v
.val_lbl_id
;
5286 /* Get the attribute of type attr_kind. */
5288 static dw_attr_node
*
5289 get_AT (dw_die_ref die
, enum dwarf_attribute attr_kind
)
5293 dw_die_ref spec
= NULL
;
5298 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
5299 if (a
->dw_attr
== attr_kind
)
5301 else if (a
->dw_attr
== DW_AT_specification
5302 || a
->dw_attr
== DW_AT_abstract_origin
)
5306 return get_AT (spec
, attr_kind
);
5311 /* Returns the parent of the declaration of DIE. */
5314 get_die_parent (dw_die_ref die
)
5321 if ((t
= get_AT_ref (die
, DW_AT_abstract_origin
))
5322 || (t
= get_AT_ref (die
, DW_AT_specification
)))
5325 return die
->die_parent
;
5328 /* Return the "low pc" attribute value, typically associated with a subprogram
5329 DIE. Return null if the "low pc" attribute is either not present, or if it
5330 cannot be represented as an assembler label identifier. */
5332 static inline const char *
5333 get_AT_low_pc (dw_die_ref die
)
5335 dw_attr_node
*a
= get_AT (die
, DW_AT_low_pc
);
5337 return a
? AT_lbl (a
) : NULL
;
5340 /* Return the value of the string attribute designated by ATTR_KIND, or
5341 NULL if it is not present. */
5343 static inline const char *
5344 get_AT_string (dw_die_ref die
, enum dwarf_attribute attr_kind
)
5346 dw_attr_node
*a
= get_AT (die
, attr_kind
);
5348 return a
? AT_string (a
) : NULL
;
5351 /* Return the value of the flag attribute designated by ATTR_KIND, or -1
5352 if it is not present. */
5355 get_AT_flag (dw_die_ref die
, enum dwarf_attribute attr_kind
)
5357 dw_attr_node
*a
= get_AT (die
, attr_kind
);
5359 return a
? AT_flag (a
) : 0;
5362 /* Return the value of the unsigned attribute designated by ATTR_KIND, or 0
5363 if it is not present. */
5365 static inline unsigned
5366 get_AT_unsigned (dw_die_ref die
, enum dwarf_attribute attr_kind
)
5368 dw_attr_node
*a
= get_AT (die
, attr_kind
);
5370 return a
? AT_unsigned (a
) : 0;
5373 static inline dw_die_ref
5374 get_AT_ref (dw_die_ref die
, enum dwarf_attribute attr_kind
)
5376 dw_attr_node
*a
= get_AT (die
, attr_kind
);
5378 return a
? AT_ref (a
) : NULL
;
5381 static inline struct dwarf_file_data
*
5382 get_AT_file (dw_die_ref die
, enum dwarf_attribute attr_kind
)
5384 dw_attr_node
*a
= get_AT (die
, attr_kind
);
5386 return a
? AT_file (a
) : NULL
;
5389 /* Return TRUE if the language is C. */
5394 unsigned int lang
= get_AT_unsigned (comp_unit_die (), DW_AT_language
);
5396 return (lang
== DW_LANG_C
|| lang
== DW_LANG_C89
|| lang
== DW_LANG_C99
5397 || lang
== DW_LANG_C11
|| lang
== DW_LANG_ObjC
);
5402 /* Return TRUE if the language is C++. */
5407 unsigned int lang
= get_AT_unsigned (comp_unit_die (), DW_AT_language
);
5409 return (lang
== DW_LANG_C_plus_plus
|| lang
== DW_LANG_ObjC_plus_plus
5410 || lang
== DW_LANG_C_plus_plus_11
|| lang
== DW_LANG_C_plus_plus_14
);
5413 /* Return TRUE if DECL was created by the C++ frontend. */
5416 is_cxx (const_tree decl
)
5420 const_tree context
= get_ultimate_context (decl
);
5421 if (context
&& TRANSLATION_UNIT_LANGUAGE (context
))
5422 return strncmp (TRANSLATION_UNIT_LANGUAGE (context
), "GNU C++", 7) == 0;
5427 /* Return TRUE if the language is Fortran. */
5432 unsigned int lang
= get_AT_unsigned (comp_unit_die (), DW_AT_language
);
5434 return (lang
== DW_LANG_Fortran77
5435 || lang
== DW_LANG_Fortran90
5436 || lang
== DW_LANG_Fortran95
5437 || lang
== DW_LANG_Fortran03
5438 || lang
== DW_LANG_Fortran08
);
5442 is_fortran (const_tree decl
)
5446 const_tree context
= get_ultimate_context (decl
);
5447 if (context
&& TRANSLATION_UNIT_LANGUAGE (context
))
5448 return (strncmp (TRANSLATION_UNIT_LANGUAGE (context
),
5449 "GNU Fortran", 11) == 0
5450 || strcmp (TRANSLATION_UNIT_LANGUAGE (context
),
5453 return is_fortran ();
5456 /* Return TRUE if the language is Ada. */
5461 unsigned int lang
= get_AT_unsigned (comp_unit_die (), DW_AT_language
);
5463 return lang
== DW_LANG_Ada95
|| lang
== DW_LANG_Ada83
;
5466 /* Return TRUE if the language is D. */
5471 unsigned int lang
= get_AT_unsigned (comp_unit_die (), DW_AT_language
);
5473 return lang
== DW_LANG_D
;
5476 /* Remove the specified attribute if present. Return TRUE if removal
5480 remove_AT (dw_die_ref die
, enum dwarf_attribute attr_kind
)
5488 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
5489 if (a
->dw_attr
== attr_kind
)
5491 if (AT_class (a
) == dw_val_class_str
)
5492 if (a
->dw_attr_val
.v
.val_str
->refcount
)
5493 a
->dw_attr_val
.v
.val_str
->refcount
--;
5495 /* vec::ordered_remove should help reduce the number of abbrevs
5497 die
->die_attr
->ordered_remove (ix
);
5503 /* Remove CHILD from its parent. PREV must have the property that
5504 PREV->DIE_SIB == CHILD. Does not alter CHILD. */
5507 remove_child_with_prev (dw_die_ref child
, dw_die_ref prev
)
5509 gcc_assert (child
->die_parent
== prev
->die_parent
);
5510 gcc_assert (prev
->die_sib
== child
);
5513 gcc_assert (child
->die_parent
->die_child
== child
);
5517 prev
->die_sib
= child
->die_sib
;
5518 if (child
->die_parent
->die_child
== child
)
5519 child
->die_parent
->die_child
= prev
;
5520 child
->die_sib
= NULL
;
5523 /* Replace OLD_CHILD with NEW_CHILD. PREV must have the property that
5524 PREV->DIE_SIB == OLD_CHILD. Does not alter OLD_CHILD. */
5527 replace_child (dw_die_ref old_child
, dw_die_ref new_child
, dw_die_ref prev
)
5529 dw_die_ref parent
= old_child
->die_parent
;
5531 gcc_assert (parent
== prev
->die_parent
);
5532 gcc_assert (prev
->die_sib
== old_child
);
5534 new_child
->die_parent
= parent
;
5535 if (prev
== old_child
)
5537 gcc_assert (parent
->die_child
== old_child
);
5538 new_child
->die_sib
= new_child
;
5542 prev
->die_sib
= new_child
;
5543 new_child
->die_sib
= old_child
->die_sib
;
5545 if (old_child
->die_parent
->die_child
== old_child
)
5546 old_child
->die_parent
->die_child
= new_child
;
5547 old_child
->die_sib
= NULL
;
5550 /* Move all children from OLD_PARENT to NEW_PARENT. */
5553 move_all_children (dw_die_ref old_parent
, dw_die_ref new_parent
)
5556 new_parent
->die_child
= old_parent
->die_child
;
5557 old_parent
->die_child
= NULL
;
5558 FOR_EACH_CHILD (new_parent
, c
, c
->die_parent
= new_parent
);
5561 /* Remove child DIE whose die_tag is TAG. Do nothing if no child
5565 remove_child_TAG (dw_die_ref die
, enum dwarf_tag tag
)
5571 dw_die_ref prev
= c
;
5573 while (c
->die_tag
== tag
)
5575 remove_child_with_prev (c
, prev
);
5576 c
->die_parent
= NULL
;
5577 /* Might have removed every child. */
5578 if (die
->die_child
== NULL
)
5582 } while (c
!= die
->die_child
);
5585 /* Add a CHILD_DIE as the last child of DIE. */
5588 add_child_die (dw_die_ref die
, dw_die_ref child_die
)
5590 /* FIXME this should probably be an assert. */
5591 if (! die
|| ! child_die
)
5593 gcc_assert (die
!= child_die
);
5595 child_die
->die_parent
= die
;
5598 child_die
->die_sib
= die
->die_child
->die_sib
;
5599 die
->die_child
->die_sib
= child_die
;
5602 child_die
->die_sib
= child_die
;
5603 die
->die_child
= child_die
;
5606 /* Like add_child_die, but put CHILD_DIE after AFTER_DIE. */
5609 add_child_die_after (dw_die_ref die
, dw_die_ref child_die
,
5610 dw_die_ref after_die
)
5616 && die
!= child_die
);
5618 child_die
->die_parent
= die
;
5619 child_die
->die_sib
= after_die
->die_sib
;
5620 after_die
->die_sib
= child_die
;
5621 if (die
->die_child
== after_die
)
5622 die
->die_child
= child_die
;
5625 /* Unassociate CHILD from its parent, and make its parent be
5629 reparent_child (dw_die_ref child
, dw_die_ref new_parent
)
5631 for (dw_die_ref p
= child
->die_parent
->die_child
; ; p
= p
->die_sib
)
5632 if (p
->die_sib
== child
)
5634 remove_child_with_prev (child
, p
);
5637 add_child_die (new_parent
, child
);
5640 /* Move CHILD, which must be a child of PARENT or the DIE for which PARENT
5641 is the specification, to the end of PARENT's list of children.
5642 This is done by removing and re-adding it. */
5645 splice_child_die (dw_die_ref parent
, dw_die_ref child
)
5647 /* We want the declaration DIE from inside the class, not the
5648 specification DIE at toplevel. */
5649 if (child
->die_parent
!= parent
)
5651 dw_die_ref tmp
= get_AT_ref (child
, DW_AT_specification
);
5657 gcc_assert (child
->die_parent
== parent
5658 || (child
->die_parent
5659 == get_AT_ref (parent
, DW_AT_specification
)));
5661 reparent_child (child
, parent
);
5664 /* Create and return a new die with TAG_VALUE as tag. */
5666 static inline dw_die_ref
5667 new_die_raw (enum dwarf_tag tag_value
)
5669 dw_die_ref die
= ggc_cleared_alloc
<die_node
> ();
5670 die
->die_tag
= tag_value
;
5674 /* Create and return a new die with a parent of PARENT_DIE. If
5675 PARENT_DIE is NULL, the new DIE is placed in limbo and an
5676 associated tree T must be supplied to determine parenthood
5679 static inline dw_die_ref
5680 new_die (enum dwarf_tag tag_value
, dw_die_ref parent_die
, tree t
)
5682 dw_die_ref die
= new_die_raw (tag_value
);
5684 if (parent_die
!= NULL
)
5685 add_child_die (parent_die
, die
);
5688 limbo_die_node
*limbo_node
;
5690 /* No DIEs created after early dwarf should end up in limbo,
5691 because the limbo list should not persist past LTO
5693 if (tag_value
!= DW_TAG_compile_unit
5694 /* These are allowed because they're generated while
5695 breaking out COMDAT units late. */
5696 && tag_value
!= DW_TAG_type_unit
5697 && tag_value
!= DW_TAG_skeleton_unit
5699 /* Allow nested functions to live in limbo because they will
5700 only temporarily live there, as decls_for_scope will fix
5702 && (TREE_CODE (t
) != FUNCTION_DECL
5703 || !decl_function_context (t
))
5704 /* Same as nested functions above but for types. Types that
5705 are local to a function will be fixed in
5707 && (!RECORD_OR_UNION_TYPE_P (t
)
5708 || !TYPE_CONTEXT (t
)
5709 || TREE_CODE (TYPE_CONTEXT (t
)) != FUNCTION_DECL
)
5710 /* FIXME debug-early: Allow late limbo DIE creation for LTO,
5711 especially in the ltrans stage, but once we implement LTO
5712 dwarf streaming, we should remove this exception. */
5715 fprintf (stderr
, "symbol ended up in limbo too late:");
5716 debug_generic_stmt (t
);
5720 limbo_node
= ggc_cleared_alloc
<limbo_die_node
> ();
5721 limbo_node
->die
= die
;
5722 limbo_node
->created_for
= t
;
5723 limbo_node
->next
= limbo_die_list
;
5724 limbo_die_list
= limbo_node
;
5730 /* Return the DIE associated with the given type specifier. */
5732 static inline dw_die_ref
5733 lookup_type_die (tree type
)
5735 dw_die_ref die
= TYPE_SYMTAB_DIE (type
);
5736 if (die
&& die
->removed
)
5738 TYPE_SYMTAB_DIE (type
) = NULL
;
5744 /* Given a TYPE_DIE representing the type TYPE, if TYPE is an
5745 anonymous type named by the typedef TYPE_DIE, return the DIE of the
5746 anonymous type instead the one of the naming typedef. */
5748 static inline dw_die_ref
5749 strip_naming_typedef (tree type
, dw_die_ref type_die
)
5752 && TREE_CODE (type
) == RECORD_TYPE
5754 && type_die
->die_tag
== DW_TAG_typedef
5755 && is_naming_typedef_decl (TYPE_NAME (type
)))
5756 type_die
= get_AT_ref (type_die
, DW_AT_type
);
5760 /* Like lookup_type_die, but if type is an anonymous type named by a
5761 typedef[1], return the DIE of the anonymous type instead the one of
5762 the naming typedef. This is because in gen_typedef_die, we did
5763 equate the anonymous struct named by the typedef with the DIE of
5764 the naming typedef. So by default, lookup_type_die on an anonymous
5765 struct yields the DIE of the naming typedef.
5767 [1]: Read the comment of is_naming_typedef_decl to learn about what
5768 a naming typedef is. */
5770 static inline dw_die_ref
5771 lookup_type_die_strip_naming_typedef (tree type
)
5773 dw_die_ref die
= lookup_type_die (type
);
5774 return strip_naming_typedef (type
, die
);
5777 /* Equate a DIE to a given type specifier. */
5780 equate_type_number_to_die (tree type
, dw_die_ref type_die
)
5782 TYPE_SYMTAB_DIE (type
) = type_die
;
5785 static dw_die_ref
maybe_create_die_with_external_ref (tree
);
5786 struct GTY(()) sym_off_pair
5788 const char * GTY((skip
)) sym
;
5789 unsigned HOST_WIDE_INT off
;
5791 static GTY(()) hash_map
<tree
, sym_off_pair
> *external_die_map
;
5793 /* Returns a hash value for X (which really is a die_struct). */
5796 decl_die_hasher::hash (die_node
*x
)
5798 return (hashval_t
) x
->decl_id
;
5801 /* Return nonzero if decl_id of die_struct X is the same as UID of decl *Y. */
5804 decl_die_hasher::equal (die_node
*x
, tree y
)
5806 return (x
->decl_id
== DECL_UID (y
));
5809 /* Return the DIE associated with a given declaration. */
5811 static inline dw_die_ref
5812 lookup_decl_die (tree decl
)
5814 dw_die_ref
*die
= decl_die_table
->find_slot_with_hash (decl
, DECL_UID (decl
),
5819 return maybe_create_die_with_external_ref (decl
);
5822 if ((*die
)->removed
)
5824 decl_die_table
->clear_slot (die
);
5831 /* Return the DIE associated with BLOCK. */
5833 static inline dw_die_ref
5834 lookup_block_die (tree block
)
5836 dw_die_ref die
= BLOCK_DIE (block
);
5837 if (!die
&& in_lto_p
)
5838 return maybe_create_die_with_external_ref (block
);
5842 /* Associate DIE with BLOCK. */
5845 equate_block_to_die (tree block
, dw_die_ref die
)
5847 BLOCK_DIE (block
) = die
;
5852 /* For DECL which might have early dwarf output query a SYMBOL + OFFSET
5853 style reference. Return true if we found one refering to a DIE for
5854 DECL, otherwise return false. */
5857 dwarf2out_die_ref_for_decl (tree decl
, const char **sym
,
5858 unsigned HOST_WIDE_INT
*off
)
5864 /* During WPA stage and incremental linking we use a hash-map
5865 to store the decl <-> label + offset map. */
5866 if (!external_die_map
)
5868 sym_off_pair
*desc
= external_die_map
->get (decl
);
5876 if (TREE_CODE (decl
) == BLOCK
)
5877 die
= lookup_block_die (decl
);
5879 die
= lookup_decl_die (decl
);
5883 /* Similar to get_ref_die_offset_label, but using the "correct"
5885 *off
= die
->die_offset
;
5886 while (die
->die_parent
)
5887 die
= die
->die_parent
;
5888 /* For the containing CU DIE we compute a die_symbol in
5889 compute_comp_unit_symbol. */
5890 gcc_assert (die
->die_tag
== DW_TAG_compile_unit
5891 && die
->die_id
.die_symbol
!= NULL
);
5892 *sym
= die
->die_id
.die_symbol
;
5896 /* Add a reference of kind ATTR_KIND to a DIE at SYMBOL + OFFSET to DIE. */
5899 add_AT_external_die_ref (dw_die_ref die
, enum dwarf_attribute attr_kind
,
5900 const char *symbol
, HOST_WIDE_INT offset
)
5902 /* Create a fake DIE that contains the reference. Don't use
5903 new_die because we don't want to end up in the limbo list. */
5904 /* ??? We probably want to share these, thus put a ref to the DIE
5905 we create here to the external_die_map entry. */
5906 dw_die_ref ref
= new_die_raw (die
->die_tag
);
5907 ref
->die_id
.die_symbol
= symbol
;
5908 ref
->die_offset
= offset
;
5909 ref
->with_offset
= 1;
5910 add_AT_die_ref (die
, attr_kind
, ref
);
5913 /* Create a DIE for DECL if required and add a reference to a DIE
5914 at SYMBOL + OFFSET which contains attributes dumped early. */
5917 dwarf2out_register_external_die (tree decl
, const char *sym
,
5918 unsigned HOST_WIDE_INT off
)
5920 if (debug_info_level
== DINFO_LEVEL_NONE
)
5923 if (!external_die_map
)
5924 external_die_map
= hash_map
<tree
, sym_off_pair
>::create_ggc (1000);
5925 gcc_checking_assert (!external_die_map
->get (decl
));
5926 sym_off_pair p
= { IDENTIFIER_POINTER (get_identifier (sym
)), off
};
5927 external_die_map
->put (decl
, p
);
5930 /* If we have a registered external DIE for DECL return a new DIE for
5931 the concrete instance with an appropriate abstract origin. */
5934 maybe_create_die_with_external_ref (tree decl
)
5936 if (!external_die_map
)
5938 sym_off_pair
*desc
= external_die_map
->get (decl
);
5942 const char *sym
= desc
->sym
;
5943 unsigned HOST_WIDE_INT off
= desc
->off
;
5946 dw_die_ref die
= (TREE_CODE (decl
) == BLOCK
5947 ? lookup_block_die (decl
) : lookup_decl_die (decl
));
5952 dw_die_ref parent
= NULL
;
5953 /* Need to lookup a DIE for the decls context - the containing
5954 function or translation unit. */
5955 if (TREE_CODE (decl
) == BLOCK
)
5957 ctx
= BLOCK_SUPERCONTEXT (decl
);
5958 /* ??? We do not output DIEs for all scopes thus skip as
5959 many DIEs as needed. */
5960 while (TREE_CODE (ctx
) == BLOCK
5961 && !lookup_block_die (ctx
))
5962 ctx
= BLOCK_SUPERCONTEXT (ctx
);
5965 ctx
= DECL_CONTEXT (decl
);
5966 /* Peel types in the context stack. */
5967 while (ctx
&& TYPE_P (ctx
))
5968 ctx
= TYPE_CONTEXT (ctx
);
5969 /* Likewise namespaces in case we do not want to emit DIEs for them. */
5970 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
5971 while (ctx
&& TREE_CODE (ctx
) == NAMESPACE_DECL
)
5972 ctx
= DECL_CONTEXT (ctx
);
5975 if (TREE_CODE (ctx
) == BLOCK
)
5976 parent
= lookup_block_die (ctx
);
5977 else if (TREE_CODE (ctx
) == TRANSLATION_UNIT_DECL
5978 /* Keep the 1:1 association during WPA. */
5980 && flag_incremental_link
!= INCREMENTAL_LINK_LTO
)
5981 /* Otherwise all late annotations go to the main CU which
5982 imports the original CUs. */
5983 parent
= comp_unit_die ();
5984 else if (TREE_CODE (ctx
) == FUNCTION_DECL
5985 && TREE_CODE (decl
) != FUNCTION_DECL
5986 && TREE_CODE (decl
) != PARM_DECL
5987 && TREE_CODE (decl
) != RESULT_DECL
5988 && TREE_CODE (decl
) != BLOCK
)
5989 /* Leave function local entities parent determination to when
5990 we process scope vars. */
5993 parent
= lookup_decl_die (ctx
);
5996 /* In some cases the FEs fail to set DECL_CONTEXT properly.
5997 Handle this case gracefully by globalizing stuff. */
5998 parent
= comp_unit_die ();
5999 /* Create a DIE "stub". */
6000 switch (TREE_CODE (decl
))
6002 case TRANSLATION_UNIT_DECL
:
6004 die
= comp_unit_die ();
6005 /* We re-target all CU decls to the LTRANS CU DIE, so no need
6006 to create a DIE for the original CUs. */
6009 case NAMESPACE_DECL
:
6010 if (is_fortran (decl
))
6011 die
= new_die (DW_TAG_module
, parent
, decl
);
6013 die
= new_die (DW_TAG_namespace
, parent
, decl
);
6016 die
= new_die (DW_TAG_subprogram
, parent
, decl
);
6019 die
= new_die (DW_TAG_variable
, parent
, decl
);
6022 die
= new_die (DW_TAG_variable
, parent
, decl
);
6025 die
= new_die (DW_TAG_formal_parameter
, parent
, decl
);
6028 die
= new_die (DW_TAG_constant
, parent
, decl
);
6031 die
= new_die (DW_TAG_label
, parent
, decl
);
6034 die
= new_die (DW_TAG_lexical_block
, parent
, decl
);
6039 if (TREE_CODE (decl
) == BLOCK
)
6040 equate_block_to_die (decl
, die
);
6042 equate_decl_number_to_die (decl
, die
);
6044 add_desc_attribute (die
, decl
);
6046 /* Add a reference to the DIE providing early debug at $sym + off. */
6047 add_AT_external_die_ref (die
, DW_AT_abstract_origin
, sym
, off
);
6052 /* Returns a hash value for X (which really is a var_loc_list). */
6055 decl_loc_hasher::hash (var_loc_list
*x
)
6057 return (hashval_t
) x
->decl_id
;
6060 /* Return nonzero if decl_id of var_loc_list X is the same as
6064 decl_loc_hasher::equal (var_loc_list
*x
, const_tree y
)
6066 return (x
->decl_id
== DECL_UID (y
));
6069 /* Return the var_loc list associated with a given declaration. */
6071 static inline var_loc_list
*
6072 lookup_decl_loc (const_tree decl
)
6074 if (!decl_loc_table
)
6076 return decl_loc_table
->find_with_hash (decl
, DECL_UID (decl
));
6079 /* Returns a hash value for X (which really is a cached_dw_loc_list_list). */
6082 dw_loc_list_hasher::hash (cached_dw_loc_list
*x
)
6084 return (hashval_t
) x
->decl_id
;
6087 /* Return nonzero if decl_id of cached_dw_loc_list X is the same as
6091 dw_loc_list_hasher::equal (cached_dw_loc_list
*x
, const_tree y
)
6093 return (x
->decl_id
== DECL_UID (y
));
6096 /* Equate a DIE to a particular declaration. */
6099 equate_decl_number_to_die (tree decl
, dw_die_ref decl_die
)
6101 unsigned int decl_id
= DECL_UID (decl
);
6103 *decl_die_table
->find_slot_with_hash (decl
, decl_id
, INSERT
) = decl_die
;
6104 decl_die
->decl_id
= decl_id
;
6107 /* Return how many bits covers PIECE EXPR_LIST. */
6109 static HOST_WIDE_INT
6110 decl_piece_bitsize (rtx piece
)
6112 int ret
= (int) GET_MODE (piece
);
6115 gcc_assert (GET_CODE (XEXP (piece
, 0)) == CONCAT
6116 && CONST_INT_P (XEXP (XEXP (piece
, 0), 0)));
6117 return INTVAL (XEXP (XEXP (piece
, 0), 0));
6120 /* Return pointer to the location of location note in PIECE EXPR_LIST. */
6123 decl_piece_varloc_ptr (rtx piece
)
6125 if ((int) GET_MODE (piece
))
6126 return &XEXP (piece
, 0);
6128 return &XEXP (XEXP (piece
, 0), 1);
6131 /* Create an EXPR_LIST for location note LOC_NOTE covering BITSIZE bits.
6132 Next is the chain of following piece nodes. */
6134 static rtx_expr_list
*
6135 decl_piece_node (rtx loc_note
, HOST_WIDE_INT bitsize
, rtx next
)
6137 if (bitsize
> 0 && bitsize
<= (int) MAX_MACHINE_MODE
)
6138 return alloc_EXPR_LIST (bitsize
, loc_note
, next
);
6140 return alloc_EXPR_LIST (0, gen_rtx_CONCAT (VOIDmode
,
6145 /* Return rtx that should be stored into loc field for
6146 LOC_NOTE and BITPOS/BITSIZE. */
6149 construct_piece_list (rtx loc_note
, HOST_WIDE_INT bitpos
,
6150 HOST_WIDE_INT bitsize
)
6154 loc_note
= decl_piece_node (loc_note
, bitsize
, NULL_RTX
);
6156 loc_note
= decl_piece_node (NULL_RTX
, bitpos
, loc_note
);
6161 /* This function either modifies location piece list *DEST in
6162 place (if SRC and INNER is NULL), or copies location piece list
6163 *SRC to *DEST while modifying it. Location BITPOS is modified
6164 to contain LOC_NOTE, any pieces overlapping it are removed resp.
6165 not copied and if needed some padding around it is added.
6166 When modifying in place, DEST should point to EXPR_LIST where
6167 earlier pieces cover PIECE_BITPOS bits, when copying SRC points
6168 to the start of the whole list and INNER points to the EXPR_LIST
6169 where earlier pieces cover PIECE_BITPOS bits. */
6172 adjust_piece_list (rtx
*dest
, rtx
*src
, rtx
*inner
,
6173 HOST_WIDE_INT bitpos
, HOST_WIDE_INT piece_bitpos
,
6174 HOST_WIDE_INT bitsize
, rtx loc_note
)
6177 bool copy
= inner
!= NULL
;
6181 /* First copy all nodes preceding the current bitpos. */
6182 while (src
!= inner
)
6184 *dest
= decl_piece_node (*decl_piece_varloc_ptr (*src
),
6185 decl_piece_bitsize (*src
), NULL_RTX
);
6186 dest
= &XEXP (*dest
, 1);
6187 src
= &XEXP (*src
, 1);
6190 /* Add padding if needed. */
6191 if (bitpos
!= piece_bitpos
)
6193 *dest
= decl_piece_node (NULL_RTX
, bitpos
- piece_bitpos
,
6194 copy
? NULL_RTX
: *dest
);
6195 dest
= &XEXP (*dest
, 1);
6197 else if (*dest
&& decl_piece_bitsize (*dest
) == bitsize
)
6200 /* A piece with correct bitpos and bitsize already exist,
6201 just update the location for it and return. */
6202 *decl_piece_varloc_ptr (*dest
) = loc_note
;
6205 /* Add the piece that changed. */
6206 *dest
= decl_piece_node (loc_note
, bitsize
, copy
? NULL_RTX
: *dest
);
6207 dest
= &XEXP (*dest
, 1);
6208 /* Skip over pieces that overlap it. */
6209 diff
= bitpos
- piece_bitpos
+ bitsize
;
6212 while (diff
> 0 && *src
)
6215 diff
-= decl_piece_bitsize (piece
);
6217 src
= &XEXP (piece
, 1);
6220 *src
= XEXP (piece
, 1);
6221 free_EXPR_LIST_node (piece
);
6224 /* Add padding if needed. */
6225 if (diff
< 0 && *src
)
6229 *dest
= decl_piece_node (NULL_RTX
, -diff
, copy
? NULL_RTX
: *dest
);
6230 dest
= &XEXP (*dest
, 1);
6234 /* Finally copy all nodes following it. */
6237 *dest
= decl_piece_node (*decl_piece_varloc_ptr (*src
),
6238 decl_piece_bitsize (*src
), NULL_RTX
);
6239 dest
= &XEXP (*dest
, 1);
6240 src
= &XEXP (*src
, 1);
6244 /* Add a variable location node to the linked list for DECL. */
6246 static struct var_loc_node
*
6247 add_var_loc_to_decl (tree decl
, rtx loc_note
, const char *label
, var_loc_view view
)
6249 unsigned int decl_id
;
6251 struct var_loc_node
*loc
= NULL
;
6252 HOST_WIDE_INT bitsize
= -1, bitpos
= -1;
6254 if (VAR_P (decl
) && DECL_HAS_DEBUG_EXPR_P (decl
))
6256 tree realdecl
= DECL_DEBUG_EXPR (decl
);
6257 if (handled_component_p (realdecl
)
6258 || (TREE_CODE (realdecl
) == MEM_REF
6259 && TREE_CODE (TREE_OPERAND (realdecl
, 0)) == ADDR_EXPR
))
6262 tree innerdecl
= get_ref_base_and_extent_hwi (realdecl
, &bitpos
,
6263 &bitsize
, &reverse
);
6265 || !DECL_P (innerdecl
)
6266 || DECL_IGNORED_P (innerdecl
)
6267 || TREE_STATIC (innerdecl
)
6269 || bitpos
+ bitsize
> 256)
6275 decl_id
= DECL_UID (decl
);
6277 = decl_loc_table
->find_slot_with_hash (decl
, decl_id
, INSERT
);
6280 temp
= ggc_cleared_alloc
<var_loc_list
> ();
6281 temp
->decl_id
= decl_id
;
6287 /* For PARM_DECLs try to keep around the original incoming value,
6288 even if that means we'll emit a zero-range .debug_loc entry. */
6290 && temp
->first
== temp
->last
6291 && TREE_CODE (decl
) == PARM_DECL
6292 && NOTE_P (temp
->first
->loc
)
6293 && NOTE_VAR_LOCATION_DECL (temp
->first
->loc
) == decl
6294 && DECL_INCOMING_RTL (decl
)
6295 && NOTE_VAR_LOCATION_LOC (temp
->first
->loc
)
6296 && GET_CODE (NOTE_VAR_LOCATION_LOC (temp
->first
->loc
))
6297 == GET_CODE (DECL_INCOMING_RTL (decl
))
6298 && prev_real_insn (as_a
<rtx_insn
*> (temp
->first
->loc
)) == NULL_RTX
6300 || !rtx_equal_p (NOTE_VAR_LOCATION_LOC (temp
->first
->loc
),
6301 NOTE_VAR_LOCATION_LOC (loc_note
))
6302 || (NOTE_VAR_LOCATION_STATUS (temp
->first
->loc
)
6303 != NOTE_VAR_LOCATION_STATUS (loc_note
))))
6305 loc
= ggc_cleared_alloc
<var_loc_node
> ();
6306 temp
->first
->next
= loc
;
6308 loc
->loc
= construct_piece_list (loc_note
, bitpos
, bitsize
);
6310 else if (temp
->last
)
6312 struct var_loc_node
*last
= temp
->last
, *unused
= NULL
;
6313 rtx
*piece_loc
= NULL
, last_loc_note
;
6314 HOST_WIDE_INT piece_bitpos
= 0;
6318 gcc_assert (last
->next
== NULL
);
6320 if (bitsize
!= -1 && GET_CODE (last
->loc
) == EXPR_LIST
)
6322 piece_loc
= &last
->loc
;
6325 HOST_WIDE_INT cur_bitsize
= decl_piece_bitsize (*piece_loc
);
6326 if (piece_bitpos
+ cur_bitsize
> bitpos
)
6328 piece_bitpos
+= cur_bitsize
;
6329 piece_loc
= &XEXP (*piece_loc
, 1);
6333 /* TEMP->LAST here is either pointer to the last but one or
6334 last element in the chained list, LAST is pointer to the
6336 if (label
&& strcmp (last
->label
, label
) == 0 && last
->view
== view
)
6338 /* For SRA optimized variables if there weren't any real
6339 insns since last note, just modify the last node. */
6340 if (piece_loc
!= NULL
)
6342 adjust_piece_list (piece_loc
, NULL
, NULL
,
6343 bitpos
, piece_bitpos
, bitsize
, loc_note
);
6346 /* If the last note doesn't cover any instructions, remove it. */
6347 if (temp
->last
!= last
)
6349 temp
->last
->next
= NULL
;
6352 gcc_assert (strcmp (last
->label
, label
) != 0 || last
->view
!= view
);
6356 gcc_assert (temp
->first
== temp
->last
6357 || (temp
->first
->next
== temp
->last
6358 && TREE_CODE (decl
) == PARM_DECL
));
6359 memset (temp
->last
, '\0', sizeof (*temp
->last
));
6360 temp
->last
->loc
= construct_piece_list (loc_note
, bitpos
, bitsize
);
6364 if (bitsize
== -1 && NOTE_P (last
->loc
))
6365 last_loc_note
= last
->loc
;
6366 else if (piece_loc
!= NULL
6367 && *piece_loc
!= NULL_RTX
6368 && piece_bitpos
== bitpos
6369 && decl_piece_bitsize (*piece_loc
) == bitsize
)
6370 last_loc_note
= *decl_piece_varloc_ptr (*piece_loc
);
6372 last_loc_note
= NULL_RTX
;
6373 /* If the current location is the same as the end of the list,
6374 and either both or neither of the locations is uninitialized,
6375 we have nothing to do. */
6376 if (last_loc_note
== NULL_RTX
6377 || (!rtx_equal_p (NOTE_VAR_LOCATION_LOC (last_loc_note
),
6378 NOTE_VAR_LOCATION_LOC (loc_note
)))
6379 || ((NOTE_VAR_LOCATION_STATUS (last_loc_note
)
6380 != NOTE_VAR_LOCATION_STATUS (loc_note
))
6381 && ((NOTE_VAR_LOCATION_STATUS (last_loc_note
)
6382 == VAR_INIT_STATUS_UNINITIALIZED
)
6383 || (NOTE_VAR_LOCATION_STATUS (loc_note
)
6384 == VAR_INIT_STATUS_UNINITIALIZED
))))
6386 /* Add LOC to the end of list and update LAST. If the last
6387 element of the list has been removed above, reuse its
6388 memory for the new node, otherwise allocate a new one. */
6392 memset (loc
, '\0', sizeof (*loc
));
6395 loc
= ggc_cleared_alloc
<var_loc_node
> ();
6396 if (bitsize
== -1 || piece_loc
== NULL
)
6397 loc
->loc
= construct_piece_list (loc_note
, bitpos
, bitsize
);
6399 adjust_piece_list (&loc
->loc
, &last
->loc
, piece_loc
,
6400 bitpos
, piece_bitpos
, bitsize
, loc_note
);
6402 /* Ensure TEMP->LAST will point either to the new last but one
6403 element of the chain, or to the last element in it. */
6404 if (last
!= temp
->last
)
6412 loc
= ggc_cleared_alloc
<var_loc_node
> ();
6415 loc
->loc
= construct_piece_list (loc_note
, bitpos
, bitsize
);
6420 /* Keep track of the number of spaces used to indent the
6421 output of the debugging routines that print the structure of
6422 the DIE internal representation. */
6423 static int print_indent
;
6425 /* Indent the line the number of spaces given by print_indent. */
6428 print_spaces (FILE *outfile
)
6430 fprintf (outfile
, "%*s", print_indent
, "");
6433 /* Print a type signature in hex. */
6436 print_signature (FILE *outfile
, char *sig
)
6440 for (i
= 0; i
< DWARF_TYPE_SIGNATURE_SIZE
; i
++)
6441 fprintf (outfile
, "%02x", sig
[i
] & 0xff);
6445 print_discr_value (FILE *outfile
, dw_discr_value
*discr_value
)
6447 if (discr_value
->pos
)
6448 fprintf (outfile
, HOST_WIDE_INT_PRINT_UNSIGNED
, discr_value
->v
.sval
);
6450 fprintf (outfile
, HOST_WIDE_INT_PRINT_DEC
, discr_value
->v
.uval
);
6453 static void print_loc_descr (dw_loc_descr_ref
, FILE *);
6455 /* Print the value associated to the VAL DWARF value node to OUTFILE. If
6456 RECURSE, output location descriptor operations. */
6459 print_dw_val (dw_val_node
*val
, bool recurse
, FILE *outfile
)
6461 switch (val
->val_class
)
6463 case dw_val_class_addr
:
6464 fprintf (outfile
, "address");
6466 case dw_val_class_offset
:
6467 fprintf (outfile
, "offset");
6469 case dw_val_class_loc
:
6470 fprintf (outfile
, "location descriptor");
6471 if (val
->v
.val_loc
== NULL
)
6472 fprintf (outfile
, " -> <null>\n");
6475 fprintf (outfile
, ":\n");
6477 print_loc_descr (val
->v
.val_loc
, outfile
);
6482 if (flag_dump_noaddr
|| flag_dump_unnumbered
)
6483 fprintf (outfile
, " #\n");
6485 fprintf (outfile
, " (%p)\n", (void *) val
->v
.val_loc
);
6488 case dw_val_class_loc_list
:
6489 fprintf (outfile
, "location list -> label:%s",
6490 val
->v
.val_loc_list
->ll_symbol
);
6492 case dw_val_class_view_list
:
6493 val
= view_list_to_loc_list_val_node (val
);
6494 fprintf (outfile
, "location list with views -> labels:%s and %s",
6495 val
->v
.val_loc_list
->ll_symbol
,
6496 val
->v
.val_loc_list
->vl_symbol
);
6498 case dw_val_class_range_list
:
6499 fprintf (outfile
, "range list");
6501 case dw_val_class_const
:
6502 case dw_val_class_const_implicit
:
6503 fprintf (outfile
, HOST_WIDE_INT_PRINT_DEC
, val
->v
.val_int
);
6505 case dw_val_class_unsigned_const
:
6506 case dw_val_class_unsigned_const_implicit
:
6507 fprintf (outfile
, HOST_WIDE_INT_PRINT_UNSIGNED
, val
->v
.val_unsigned
);
6509 case dw_val_class_const_double
:
6510 fprintf (outfile
, "constant (" HOST_WIDE_INT_PRINT_DEC
","\
6511 HOST_WIDE_INT_PRINT_UNSIGNED
")",
6512 val
->v
.val_double
.high
,
6513 val
->v
.val_double
.low
);
6515 case dw_val_class_wide_int
:
6517 int i
= val
->v
.val_wide
->get_len ();
6518 fprintf (outfile
, "constant (");
6520 if (val
->v
.val_wide
->elt (i
- 1) == 0)
6521 fprintf (outfile
, "0x");
6522 fprintf (outfile
, HOST_WIDE_INT_PRINT_HEX
,
6523 val
->v
.val_wide
->elt (--i
));
6525 fprintf (outfile
, HOST_WIDE_INT_PRINT_PADDED_HEX
,
6526 val
->v
.val_wide
->elt (i
));
6527 fprintf (outfile
, ")");
6530 case dw_val_class_vec
:
6531 fprintf (outfile
, "floating-point or vector constant");
6533 case dw_val_class_flag
:
6534 fprintf (outfile
, "%u", val
->v
.val_flag
);
6536 case dw_val_class_die_ref
:
6537 if (val
->v
.val_die_ref
.die
!= NULL
)
6539 dw_die_ref die
= val
->v
.val_die_ref
.die
;
6541 if (die
->comdat_type_p
)
6543 fprintf (outfile
, "die -> signature: ");
6544 print_signature (outfile
,
6545 die
->die_id
.die_type_node
->signature
);
6547 else if (die
->die_id
.die_symbol
)
6549 fprintf (outfile
, "die -> label: %s", die
->die_id
.die_symbol
);
6550 if (die
->with_offset
)
6551 fprintf (outfile
, " + %ld", die
->die_offset
);
6554 fprintf (outfile
, "die -> %ld", die
->die_offset
);
6555 if (flag_dump_noaddr
|| flag_dump_unnumbered
)
6556 fprintf (outfile
, " #");
6558 fprintf (outfile
, " (%p)", (void *) die
);
6561 fprintf (outfile
, "die -> <null>");
6563 case dw_val_class_vms_delta
:
6564 fprintf (outfile
, "delta: @slotcount(%s-%s)",
6565 val
->v
.val_vms_delta
.lbl2
, val
->v
.val_vms_delta
.lbl1
);
6567 case dw_val_class_symview
:
6568 fprintf (outfile
, "view: %s", val
->v
.val_symbolic_view
);
6570 case dw_val_class_lbl_id
:
6571 case dw_val_class_lineptr
:
6572 case dw_val_class_macptr
:
6573 case dw_val_class_loclistsptr
:
6574 case dw_val_class_high_pc
:
6575 fprintf (outfile
, "label: %s", val
->v
.val_lbl_id
);
6577 case dw_val_class_str
:
6578 if (val
->v
.val_str
->str
!= NULL
)
6579 fprintf (outfile
, "\"%s\"", val
->v
.val_str
->str
);
6581 fprintf (outfile
, "<null>");
6583 case dw_val_class_file
:
6584 case dw_val_class_file_implicit
:
6585 fprintf (outfile
, "\"%s\" (%d)", val
->v
.val_file
->filename
,
6586 val
->v
.val_file
->emitted_number
);
6588 case dw_val_class_data8
:
6592 for (i
= 0; i
< 8; i
++)
6593 fprintf (outfile
, "%02x", val
->v
.val_data8
[i
]);
6596 case dw_val_class_discr_value
:
6597 print_discr_value (outfile
, &val
->v
.val_discr_value
);
6599 case dw_val_class_discr_list
:
6600 for (dw_discr_list_ref node
= val
->v
.val_discr_list
;
6602 node
= node
->dw_discr_next
)
6604 if (node
->dw_discr_range
)
6606 fprintf (outfile
, " .. ");
6607 print_discr_value (outfile
, &node
->dw_discr_lower_bound
);
6608 print_discr_value (outfile
, &node
->dw_discr_upper_bound
);
6611 print_discr_value (outfile
, &node
->dw_discr_lower_bound
);
6613 if (node
->dw_discr_next
!= NULL
)
6614 fprintf (outfile
, " | ");
6621 /* Likewise, for a DIE attribute. */
6624 print_attribute (dw_attr_node
*a
, bool recurse
, FILE *outfile
)
6626 print_dw_val (&a
->dw_attr_val
, recurse
, outfile
);
6630 /* Print the list of operands in the LOC location description to OUTFILE. This
6631 routine is a debugging aid only. */
6634 print_loc_descr (dw_loc_descr_ref loc
, FILE *outfile
)
6636 dw_loc_descr_ref l
= loc
;
6640 print_spaces (outfile
);
6641 fprintf (outfile
, "<null>\n");
6645 for (l
= loc
; l
!= NULL
; l
= l
->dw_loc_next
)
6647 print_spaces (outfile
);
6648 if (flag_dump_noaddr
|| flag_dump_unnumbered
)
6649 fprintf (outfile
, "#");
6651 fprintf (outfile
, "(%p)", (void *) l
);
6652 fprintf (outfile
, " %s",
6653 dwarf_stack_op_name (l
->dw_loc_opc
));
6654 if (l
->dw_loc_oprnd1
.val_class
!= dw_val_class_none
)
6656 fprintf (outfile
, " ");
6657 print_dw_val (&l
->dw_loc_oprnd1
, false, outfile
);
6659 if (l
->dw_loc_oprnd2
.val_class
!= dw_val_class_none
)
6661 fprintf (outfile
, ", ");
6662 print_dw_val (&l
->dw_loc_oprnd2
, false, outfile
);
6664 fprintf (outfile
, "\n");
6668 /* Print the information associated with a given DIE, and its children.
6669 This routine is a debugging aid only. */
6672 print_die (dw_die_ref die
, FILE *outfile
)
6678 print_spaces (outfile
);
6679 fprintf (outfile
, "DIE %4ld: %s ",
6680 die
->die_offset
, dwarf_tag_name (die
->die_tag
));
6681 if (flag_dump_noaddr
|| flag_dump_unnumbered
)
6682 fprintf (outfile
, "#\n");
6684 fprintf (outfile
, "(%p)\n", (void*) die
);
6685 print_spaces (outfile
);
6686 fprintf (outfile
, " abbrev id: %lu", die
->die_abbrev
);
6687 fprintf (outfile
, " offset: %ld", die
->die_offset
);
6688 fprintf (outfile
, " mark: %d\n", die
->die_mark
);
6690 if (die
->comdat_type_p
)
6692 print_spaces (outfile
);
6693 fprintf (outfile
, " signature: ");
6694 print_signature (outfile
, die
->die_id
.die_type_node
->signature
);
6695 fprintf (outfile
, "\n");
6698 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
6700 print_spaces (outfile
);
6701 fprintf (outfile
, " %s: ", dwarf_attr_name (a
->dw_attr
));
6703 print_attribute (a
, true, outfile
);
6704 fprintf (outfile
, "\n");
6707 if (die
->die_child
!= NULL
)
6710 FOR_EACH_CHILD (die
, c
, print_die (c
, outfile
));
6713 if (print_indent
== 0)
6714 fprintf (outfile
, "\n");
6717 /* Print the list of operations in the LOC location description. */
6720 debug_dwarf_loc_descr (dw_loc_descr_ref loc
)
6722 print_loc_descr (loc
, stderr
);
6725 /* Print the information collected for a given DIE. */
6728 debug_dwarf_die (dw_die_ref die
)
6730 print_die (die
, stderr
);
6734 debug (die_struct
&ref
)
6736 print_die (&ref
, stderr
);
6740 debug (die_struct
*ptr
)
6745 fprintf (stderr
, "<nil>\n");
6749 /* Print all DWARF information collected for the compilation unit.
6750 This routine is a debugging aid only. */
6756 print_die (comp_unit_die (), stderr
);
6759 /* Verify the DIE tree structure. */
6762 verify_die (dw_die_ref die
)
6764 gcc_assert (!die
->die_mark
);
6765 if (die
->die_parent
== NULL
6766 && die
->die_sib
== NULL
)
6768 /* Verify the die_sib list is cyclic. */
6775 while (x
&& !x
->die_mark
);
6776 gcc_assert (x
== die
);
6780 /* Verify all dies have the same parent. */
6781 gcc_assert (x
->die_parent
== die
->die_parent
);
6784 /* Verify the child has the proper parent and recurse. */
6785 gcc_assert (x
->die_child
->die_parent
== x
);
6786 verify_die (x
->die_child
);
6791 while (x
&& x
->die_mark
);
6794 /* Sanity checks on DIEs. */
6797 check_die (dw_die_ref die
)
6801 bool inline_found
= false;
6802 int n_location
= 0, n_low_pc
= 0, n_high_pc
= 0, n_artificial
= 0;
6803 int n_decl_line
= 0, n_decl_column
= 0, n_decl_file
= 0;
6804 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
6809 if (a
->dw_attr_val
.v
.val_unsigned
)
6810 inline_found
= true;
6812 case DW_AT_location
:
6821 case DW_AT_artificial
:
6824 case DW_AT_decl_column
:
6827 case DW_AT_decl_line
:
6830 case DW_AT_decl_file
:
6837 if (n_location
> 1 || n_low_pc
> 1 || n_high_pc
> 1 || n_artificial
> 1
6838 || n_decl_column
> 1 || n_decl_line
> 1 || n_decl_file
> 1)
6840 fprintf (stderr
, "Duplicate attributes in DIE:\n");
6841 debug_dwarf_die (die
);
6846 /* A debugging information entry that is a member of an abstract
6847 instance tree [that has DW_AT_inline] should not contain any
6848 attributes which describe aspects of the subroutine which vary
6849 between distinct inlined expansions or distinct out-of-line
6851 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
6852 gcc_assert (a
->dw_attr
!= DW_AT_low_pc
6853 && a
->dw_attr
!= DW_AT_high_pc
6854 && a
->dw_attr
!= DW_AT_location
6855 && a
->dw_attr
!= DW_AT_frame_base
6856 && a
->dw_attr
!= DW_AT_call_all_calls
6857 && a
->dw_attr
!= DW_AT_GNU_all_call_sites
);
6861 #define CHECKSUM(FOO) md5_process_bytes (&(FOO), sizeof (FOO), ctx)
6862 #define CHECKSUM_BLOCK(FOO, SIZE) md5_process_bytes ((FOO), (SIZE), ctx)
6863 #define CHECKSUM_STRING(FOO) md5_process_bytes ((FOO), strlen (FOO), ctx)
6865 /* Calculate the checksum of a location expression. */
6868 loc_checksum (dw_loc_descr_ref loc
, struct md5_ctx
*ctx
)
6871 inchash::hash hstate
;
6874 tem
= (loc
->dtprel
<< 8) | ((unsigned int) loc
->dw_loc_opc
);
6876 hash_loc_operands (loc
, hstate
);
6877 hash
= hstate
.end();
6881 /* Calculate the checksum of an attribute. */
6884 attr_checksum (dw_attr_node
*at
, struct md5_ctx
*ctx
, int *mark
)
6886 dw_loc_descr_ref loc
;
6889 CHECKSUM (at
->dw_attr
);
6891 /* We don't care that this was compiled with a different compiler
6892 snapshot; if the output is the same, that's what matters. */
6893 if (at
->dw_attr
== DW_AT_producer
)
6896 switch (AT_class (at
))
6898 case dw_val_class_const
:
6899 case dw_val_class_const_implicit
:
6900 CHECKSUM (at
->dw_attr_val
.v
.val_int
);
6902 case dw_val_class_unsigned_const
:
6903 case dw_val_class_unsigned_const_implicit
:
6904 CHECKSUM (at
->dw_attr_val
.v
.val_unsigned
);
6906 case dw_val_class_const_double
:
6907 CHECKSUM (at
->dw_attr_val
.v
.val_double
);
6909 case dw_val_class_wide_int
:
6910 CHECKSUM_BLOCK (at
->dw_attr_val
.v
.val_wide
->get_val (),
6911 get_full_len (*at
->dw_attr_val
.v
.val_wide
)
6912 * HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
);
6914 case dw_val_class_vec
:
6915 CHECKSUM_BLOCK (at
->dw_attr_val
.v
.val_vec
.array
,
6916 (at
->dw_attr_val
.v
.val_vec
.length
6917 * at
->dw_attr_val
.v
.val_vec
.elt_size
));
6919 case dw_val_class_flag
:
6920 CHECKSUM (at
->dw_attr_val
.v
.val_flag
);
6922 case dw_val_class_str
:
6923 CHECKSUM_STRING (AT_string (at
));
6926 case dw_val_class_addr
:
6928 gcc_assert (GET_CODE (r
) == SYMBOL_REF
);
6929 CHECKSUM_STRING (XSTR (r
, 0));
6932 case dw_val_class_offset
:
6933 CHECKSUM (at
->dw_attr_val
.v
.val_offset
);
6936 case dw_val_class_loc
:
6937 for (loc
= AT_loc (at
); loc
; loc
= loc
->dw_loc_next
)
6938 loc_checksum (loc
, ctx
);
6941 case dw_val_class_die_ref
:
6942 die_checksum (AT_ref (at
), ctx
, mark
);
6945 case dw_val_class_fde_ref
:
6946 case dw_val_class_vms_delta
:
6947 case dw_val_class_symview
:
6948 case dw_val_class_lbl_id
:
6949 case dw_val_class_lineptr
:
6950 case dw_val_class_macptr
:
6951 case dw_val_class_loclistsptr
:
6952 case dw_val_class_high_pc
:
6955 case dw_val_class_file
:
6956 case dw_val_class_file_implicit
:
6957 CHECKSUM_STRING (AT_file (at
)->filename
);
6960 case dw_val_class_data8
:
6961 CHECKSUM (at
->dw_attr_val
.v
.val_data8
);
6969 /* Calculate the checksum of a DIE. */
6972 die_checksum (dw_die_ref die
, struct md5_ctx
*ctx
, int *mark
)
6978 /* To avoid infinite recursion. */
6981 CHECKSUM (die
->die_mark
);
6984 die
->die_mark
= ++(*mark
);
6986 CHECKSUM (die
->die_tag
);
6988 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
6989 attr_checksum (a
, ctx
, mark
);
6991 FOR_EACH_CHILD (die
, c
, die_checksum (c
, ctx
, mark
));
6995 #undef CHECKSUM_BLOCK
6996 #undef CHECKSUM_STRING
6998 /* For DWARF-4 types, include the trailing NULL when checksumming strings. */
6999 #define CHECKSUM(FOO) md5_process_bytes (&(FOO), sizeof (FOO), ctx)
7000 #define CHECKSUM_BLOCK(FOO, SIZE) md5_process_bytes ((FOO), (SIZE), ctx)
7001 #define CHECKSUM_STRING(FOO) md5_process_bytes ((FOO), strlen (FOO) + 1, ctx)
7002 #define CHECKSUM_SLEB128(FOO) checksum_sleb128 ((FOO), ctx)
7003 #define CHECKSUM_ULEB128(FOO) checksum_uleb128 ((FOO), ctx)
7004 #define CHECKSUM_ATTR(FOO) \
7005 if (FOO) attr_checksum_ordered (die->die_tag, (FOO), ctx, mark)
7007 /* Calculate the checksum of a number in signed LEB128 format. */
7010 checksum_sleb128 (HOST_WIDE_INT value
, struct md5_ctx
*ctx
)
7017 byte
= (value
& 0x7f);
7019 more
= !((value
== 0 && (byte
& 0x40) == 0)
7020 || (value
== -1 && (byte
& 0x40) != 0));
7029 /* Calculate the checksum of a number in unsigned LEB128 format. */
7032 checksum_uleb128 (unsigned HOST_WIDE_INT value
, struct md5_ctx
*ctx
)
7036 unsigned char byte
= (value
& 0x7f);
7039 /* More bytes to follow. */
7047 /* Checksum the context of the DIE. This adds the names of any
7048 surrounding namespaces or structures to the checksum. */
7051 checksum_die_context (dw_die_ref die
, struct md5_ctx
*ctx
)
7055 int tag
= die
->die_tag
;
7057 if (tag
!= DW_TAG_namespace
7058 && tag
!= DW_TAG_structure_type
7059 && tag
!= DW_TAG_class_type
)
7062 name
= get_AT_string (die
, DW_AT_name
);
7064 spec
= get_AT_ref (die
, DW_AT_specification
);
7068 if (die
->die_parent
!= NULL
)
7069 checksum_die_context (die
->die_parent
, ctx
);
7071 CHECKSUM_ULEB128 ('C');
7072 CHECKSUM_ULEB128 (tag
);
7074 CHECKSUM_STRING (name
);
7077 /* Calculate the checksum of a location expression. */
7080 loc_checksum_ordered (dw_loc_descr_ref loc
, struct md5_ctx
*ctx
)
7082 /* Special case for lone DW_OP_plus_uconst: checksum as if the location
7083 were emitted as a DW_FORM_sdata instead of a location expression. */
7084 if (loc
->dw_loc_opc
== DW_OP_plus_uconst
&& loc
->dw_loc_next
== NULL
)
7086 CHECKSUM_ULEB128 (DW_FORM_sdata
);
7087 CHECKSUM_SLEB128 ((HOST_WIDE_INT
) loc
->dw_loc_oprnd1
.v
.val_unsigned
);
7091 /* Otherwise, just checksum the raw location expression. */
7094 inchash::hash hstate
;
7097 CHECKSUM_ULEB128 (loc
->dtprel
);
7098 CHECKSUM_ULEB128 (loc
->dw_loc_opc
);
7099 hash_loc_operands (loc
, hstate
);
7100 hash
= hstate
.end ();
7102 loc
= loc
->dw_loc_next
;
7106 /* Calculate the checksum of an attribute. */
7109 attr_checksum_ordered (enum dwarf_tag tag
, dw_attr_node
*at
,
7110 struct md5_ctx
*ctx
, int *mark
)
7112 dw_loc_descr_ref loc
;
7115 if (AT_class (at
) == dw_val_class_die_ref
)
7117 dw_die_ref target_die
= AT_ref (at
);
7119 /* For pointer and reference types, we checksum only the (qualified)
7120 name of the target type (if there is a name). For friend entries,
7121 we checksum only the (qualified) name of the target type or function.
7122 This allows the checksum to remain the same whether the target type
7123 is complete or not. */
7124 if ((at
->dw_attr
== DW_AT_type
7125 && (tag
== DW_TAG_pointer_type
7126 || tag
== DW_TAG_reference_type
7127 || tag
== DW_TAG_rvalue_reference_type
7128 || tag
== DW_TAG_ptr_to_member_type
))
7129 || (at
->dw_attr
== DW_AT_friend
7130 && tag
== DW_TAG_friend
))
7132 dw_attr_node
*name_attr
= get_AT (target_die
, DW_AT_name
);
7134 if (name_attr
!= NULL
)
7136 dw_die_ref decl
= get_AT_ref (target_die
, DW_AT_specification
);
7140 CHECKSUM_ULEB128 ('N');
7141 CHECKSUM_ULEB128 (at
->dw_attr
);
7142 if (decl
->die_parent
!= NULL
)
7143 checksum_die_context (decl
->die_parent
, ctx
);
7144 CHECKSUM_ULEB128 ('E');
7145 CHECKSUM_STRING (AT_string (name_attr
));
7150 /* For all other references to another DIE, we check to see if the
7151 target DIE has already been visited. If it has, we emit a
7152 backward reference; if not, we descend recursively. */
7153 if (target_die
->die_mark
> 0)
7155 CHECKSUM_ULEB128 ('R');
7156 CHECKSUM_ULEB128 (at
->dw_attr
);
7157 CHECKSUM_ULEB128 (target_die
->die_mark
);
7161 dw_die_ref decl
= get_AT_ref (target_die
, DW_AT_specification
);
7165 target_die
->die_mark
= ++(*mark
);
7166 CHECKSUM_ULEB128 ('T');
7167 CHECKSUM_ULEB128 (at
->dw_attr
);
7168 if (decl
->die_parent
!= NULL
)
7169 checksum_die_context (decl
->die_parent
, ctx
);
7170 die_checksum_ordered (target_die
, ctx
, mark
);
7175 CHECKSUM_ULEB128 ('A');
7176 CHECKSUM_ULEB128 (at
->dw_attr
);
7178 switch (AT_class (at
))
7180 case dw_val_class_const
:
7181 case dw_val_class_const_implicit
:
7182 CHECKSUM_ULEB128 (DW_FORM_sdata
);
7183 CHECKSUM_SLEB128 (at
->dw_attr_val
.v
.val_int
);
7186 case dw_val_class_unsigned_const
:
7187 case dw_val_class_unsigned_const_implicit
:
7188 CHECKSUM_ULEB128 (DW_FORM_sdata
);
7189 CHECKSUM_SLEB128 ((int) at
->dw_attr_val
.v
.val_unsigned
);
7192 case dw_val_class_const_double
:
7193 CHECKSUM_ULEB128 (DW_FORM_block
);
7194 CHECKSUM_ULEB128 (sizeof (at
->dw_attr_val
.v
.val_double
));
7195 CHECKSUM (at
->dw_attr_val
.v
.val_double
);
7198 case dw_val_class_wide_int
:
7199 CHECKSUM_ULEB128 (DW_FORM_block
);
7200 CHECKSUM_ULEB128 (get_full_len (*at
->dw_attr_val
.v
.val_wide
)
7201 * HOST_BITS_PER_WIDE_INT
/ BITS_PER_UNIT
);
7202 CHECKSUM_BLOCK (at
->dw_attr_val
.v
.val_wide
->get_val (),
7203 get_full_len (*at
->dw_attr_val
.v
.val_wide
)
7204 * HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
);
7207 case dw_val_class_vec
:
7208 CHECKSUM_ULEB128 (DW_FORM_block
);
7209 CHECKSUM_ULEB128 (at
->dw_attr_val
.v
.val_vec
.length
7210 * at
->dw_attr_val
.v
.val_vec
.elt_size
);
7211 CHECKSUM_BLOCK (at
->dw_attr_val
.v
.val_vec
.array
,
7212 (at
->dw_attr_val
.v
.val_vec
.length
7213 * at
->dw_attr_val
.v
.val_vec
.elt_size
));
7216 case dw_val_class_flag
:
7217 CHECKSUM_ULEB128 (DW_FORM_flag
);
7218 CHECKSUM_ULEB128 (at
->dw_attr_val
.v
.val_flag
? 1 : 0);
7221 case dw_val_class_str
:
7222 CHECKSUM_ULEB128 (DW_FORM_string
);
7223 CHECKSUM_STRING (AT_string (at
));
7226 case dw_val_class_addr
:
7228 gcc_assert (GET_CODE (r
) == SYMBOL_REF
);
7229 CHECKSUM_ULEB128 (DW_FORM_string
);
7230 CHECKSUM_STRING (XSTR (r
, 0));
7233 case dw_val_class_offset
:
7234 CHECKSUM_ULEB128 (DW_FORM_sdata
);
7235 CHECKSUM_ULEB128 (at
->dw_attr_val
.v
.val_offset
);
7238 case dw_val_class_loc
:
7239 for (loc
= AT_loc (at
); loc
; loc
= loc
->dw_loc_next
)
7240 loc_checksum_ordered (loc
, ctx
);
7243 case dw_val_class_fde_ref
:
7244 case dw_val_class_symview
:
7245 case dw_val_class_lbl_id
:
7246 case dw_val_class_lineptr
:
7247 case dw_val_class_macptr
:
7248 case dw_val_class_loclistsptr
:
7249 case dw_val_class_high_pc
:
7252 case dw_val_class_file
:
7253 case dw_val_class_file_implicit
:
7254 CHECKSUM_ULEB128 (DW_FORM_string
);
7255 CHECKSUM_STRING (AT_file (at
)->filename
);
7258 case dw_val_class_data8
:
7259 CHECKSUM (at
->dw_attr_val
.v
.val_data8
);
7267 struct checksum_attributes
7269 dw_attr_node
*at_name
;
7270 dw_attr_node
*at_type
;
7271 dw_attr_node
*at_friend
;
7272 dw_attr_node
*at_accessibility
;
7273 dw_attr_node
*at_address_class
;
7274 dw_attr_node
*at_alignment
;
7275 dw_attr_node
*at_allocated
;
7276 dw_attr_node
*at_artificial
;
7277 dw_attr_node
*at_associated
;
7278 dw_attr_node
*at_binary_scale
;
7279 dw_attr_node
*at_bit_offset
;
7280 dw_attr_node
*at_bit_size
;
7281 dw_attr_node
*at_bit_stride
;
7282 dw_attr_node
*at_byte_size
;
7283 dw_attr_node
*at_byte_stride
;
7284 dw_attr_node
*at_const_value
;
7285 dw_attr_node
*at_containing_type
;
7286 dw_attr_node
*at_count
;
7287 dw_attr_node
*at_data_location
;
7288 dw_attr_node
*at_data_member_location
;
7289 dw_attr_node
*at_decimal_scale
;
7290 dw_attr_node
*at_decimal_sign
;
7291 dw_attr_node
*at_default_value
;
7292 dw_attr_node
*at_digit_count
;
7293 dw_attr_node
*at_discr
;
7294 dw_attr_node
*at_discr_list
;
7295 dw_attr_node
*at_discr_value
;
7296 dw_attr_node
*at_encoding
;
7297 dw_attr_node
*at_endianity
;
7298 dw_attr_node
*at_explicit
;
7299 dw_attr_node
*at_is_optional
;
7300 dw_attr_node
*at_location
;
7301 dw_attr_node
*at_lower_bound
;
7302 dw_attr_node
*at_mutable
;
7303 dw_attr_node
*at_ordering
;
7304 dw_attr_node
*at_picture_string
;
7305 dw_attr_node
*at_prototyped
;
7306 dw_attr_node
*at_small
;
7307 dw_attr_node
*at_segment
;
7308 dw_attr_node
*at_string_length
;
7309 dw_attr_node
*at_string_length_bit_size
;
7310 dw_attr_node
*at_string_length_byte_size
;
7311 dw_attr_node
*at_threads_scaled
;
7312 dw_attr_node
*at_upper_bound
;
7313 dw_attr_node
*at_use_location
;
7314 dw_attr_node
*at_use_UTF8
;
7315 dw_attr_node
*at_variable_parameter
;
7316 dw_attr_node
*at_virtuality
;
7317 dw_attr_node
*at_visibility
;
7318 dw_attr_node
*at_vtable_elem_location
;
7321 /* Collect the attributes that we will want to use for the checksum. */
7324 collect_checksum_attributes (struct checksum_attributes
*attrs
, dw_die_ref die
)
7329 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
7340 attrs
->at_friend
= a
;
7342 case DW_AT_accessibility
:
7343 attrs
->at_accessibility
= a
;
7345 case DW_AT_address_class
:
7346 attrs
->at_address_class
= a
;
7348 case DW_AT_alignment
:
7349 attrs
->at_alignment
= a
;
7351 case DW_AT_allocated
:
7352 attrs
->at_allocated
= a
;
7354 case DW_AT_artificial
:
7355 attrs
->at_artificial
= a
;
7357 case DW_AT_associated
:
7358 attrs
->at_associated
= a
;
7360 case DW_AT_binary_scale
:
7361 attrs
->at_binary_scale
= a
;
7363 case DW_AT_bit_offset
:
7364 attrs
->at_bit_offset
= a
;
7366 case DW_AT_bit_size
:
7367 attrs
->at_bit_size
= a
;
7369 case DW_AT_bit_stride
:
7370 attrs
->at_bit_stride
= a
;
7372 case DW_AT_byte_size
:
7373 attrs
->at_byte_size
= a
;
7375 case DW_AT_byte_stride
:
7376 attrs
->at_byte_stride
= a
;
7378 case DW_AT_const_value
:
7379 attrs
->at_const_value
= a
;
7381 case DW_AT_containing_type
:
7382 attrs
->at_containing_type
= a
;
7385 attrs
->at_count
= a
;
7387 case DW_AT_data_location
:
7388 attrs
->at_data_location
= a
;
7390 case DW_AT_data_member_location
:
7391 attrs
->at_data_member_location
= a
;
7393 case DW_AT_decimal_scale
:
7394 attrs
->at_decimal_scale
= a
;
7396 case DW_AT_decimal_sign
:
7397 attrs
->at_decimal_sign
= a
;
7399 case DW_AT_default_value
:
7400 attrs
->at_default_value
= a
;
7402 case DW_AT_digit_count
:
7403 attrs
->at_digit_count
= a
;
7406 attrs
->at_discr
= a
;
7408 case DW_AT_discr_list
:
7409 attrs
->at_discr_list
= a
;
7411 case DW_AT_discr_value
:
7412 attrs
->at_discr_value
= a
;
7414 case DW_AT_encoding
:
7415 attrs
->at_encoding
= a
;
7417 case DW_AT_endianity
:
7418 attrs
->at_endianity
= a
;
7420 case DW_AT_explicit
:
7421 attrs
->at_explicit
= a
;
7423 case DW_AT_is_optional
:
7424 attrs
->at_is_optional
= a
;
7426 case DW_AT_location
:
7427 attrs
->at_location
= a
;
7429 case DW_AT_lower_bound
:
7430 attrs
->at_lower_bound
= a
;
7433 attrs
->at_mutable
= a
;
7435 case DW_AT_ordering
:
7436 attrs
->at_ordering
= a
;
7438 case DW_AT_picture_string
:
7439 attrs
->at_picture_string
= a
;
7441 case DW_AT_prototyped
:
7442 attrs
->at_prototyped
= a
;
7445 attrs
->at_small
= a
;
7448 attrs
->at_segment
= a
;
7450 case DW_AT_string_length
:
7451 attrs
->at_string_length
= a
;
7453 case DW_AT_string_length_bit_size
:
7454 attrs
->at_string_length_bit_size
= a
;
7456 case DW_AT_string_length_byte_size
:
7457 attrs
->at_string_length_byte_size
= a
;
7459 case DW_AT_threads_scaled
:
7460 attrs
->at_threads_scaled
= a
;
7462 case DW_AT_upper_bound
:
7463 attrs
->at_upper_bound
= a
;
7465 case DW_AT_use_location
:
7466 attrs
->at_use_location
= a
;
7468 case DW_AT_use_UTF8
:
7469 attrs
->at_use_UTF8
= a
;
7471 case DW_AT_variable_parameter
:
7472 attrs
->at_variable_parameter
= a
;
7474 case DW_AT_virtuality
:
7475 attrs
->at_virtuality
= a
;
7477 case DW_AT_visibility
:
7478 attrs
->at_visibility
= a
;
7480 case DW_AT_vtable_elem_location
:
7481 attrs
->at_vtable_elem_location
= a
;
7489 /* Calculate the checksum of a DIE, using an ordered subset of attributes. */
7492 die_checksum_ordered (dw_die_ref die
, struct md5_ctx
*ctx
, int *mark
)
7496 struct checksum_attributes attrs
;
7498 CHECKSUM_ULEB128 ('D');
7499 CHECKSUM_ULEB128 (die
->die_tag
);
7501 memset (&attrs
, 0, sizeof (attrs
));
7503 decl
= get_AT_ref (die
, DW_AT_specification
);
7505 collect_checksum_attributes (&attrs
, decl
);
7506 collect_checksum_attributes (&attrs
, die
);
7508 CHECKSUM_ATTR (attrs
.at_name
);
7509 CHECKSUM_ATTR (attrs
.at_accessibility
);
7510 CHECKSUM_ATTR (attrs
.at_address_class
);
7511 CHECKSUM_ATTR (attrs
.at_allocated
);
7512 CHECKSUM_ATTR (attrs
.at_artificial
);
7513 CHECKSUM_ATTR (attrs
.at_associated
);
7514 CHECKSUM_ATTR (attrs
.at_binary_scale
);
7515 CHECKSUM_ATTR (attrs
.at_bit_offset
);
7516 CHECKSUM_ATTR (attrs
.at_bit_size
);
7517 CHECKSUM_ATTR (attrs
.at_bit_stride
);
7518 CHECKSUM_ATTR (attrs
.at_byte_size
);
7519 CHECKSUM_ATTR (attrs
.at_byte_stride
);
7520 CHECKSUM_ATTR (attrs
.at_const_value
);
7521 CHECKSUM_ATTR (attrs
.at_containing_type
);
7522 CHECKSUM_ATTR (attrs
.at_count
);
7523 CHECKSUM_ATTR (attrs
.at_data_location
);
7524 CHECKSUM_ATTR (attrs
.at_data_member_location
);
7525 CHECKSUM_ATTR (attrs
.at_decimal_scale
);
7526 CHECKSUM_ATTR (attrs
.at_decimal_sign
);
7527 CHECKSUM_ATTR (attrs
.at_default_value
);
7528 CHECKSUM_ATTR (attrs
.at_digit_count
);
7529 CHECKSUM_ATTR (attrs
.at_discr
);
7530 CHECKSUM_ATTR (attrs
.at_discr_list
);
7531 CHECKSUM_ATTR (attrs
.at_discr_value
);
7532 CHECKSUM_ATTR (attrs
.at_encoding
);
7533 CHECKSUM_ATTR (attrs
.at_endianity
);
7534 CHECKSUM_ATTR (attrs
.at_explicit
);
7535 CHECKSUM_ATTR (attrs
.at_is_optional
);
7536 CHECKSUM_ATTR (attrs
.at_location
);
7537 CHECKSUM_ATTR (attrs
.at_lower_bound
);
7538 CHECKSUM_ATTR (attrs
.at_mutable
);
7539 CHECKSUM_ATTR (attrs
.at_ordering
);
7540 CHECKSUM_ATTR (attrs
.at_picture_string
);
7541 CHECKSUM_ATTR (attrs
.at_prototyped
);
7542 CHECKSUM_ATTR (attrs
.at_small
);
7543 CHECKSUM_ATTR (attrs
.at_segment
);
7544 CHECKSUM_ATTR (attrs
.at_string_length
);
7545 CHECKSUM_ATTR (attrs
.at_string_length_bit_size
);
7546 CHECKSUM_ATTR (attrs
.at_string_length_byte_size
);
7547 CHECKSUM_ATTR (attrs
.at_threads_scaled
);
7548 CHECKSUM_ATTR (attrs
.at_upper_bound
);
7549 CHECKSUM_ATTR (attrs
.at_use_location
);
7550 CHECKSUM_ATTR (attrs
.at_use_UTF8
);
7551 CHECKSUM_ATTR (attrs
.at_variable_parameter
);
7552 CHECKSUM_ATTR (attrs
.at_virtuality
);
7553 CHECKSUM_ATTR (attrs
.at_visibility
);
7554 CHECKSUM_ATTR (attrs
.at_vtable_elem_location
);
7555 CHECKSUM_ATTR (attrs
.at_type
);
7556 CHECKSUM_ATTR (attrs
.at_friend
);
7557 CHECKSUM_ATTR (attrs
.at_alignment
);
7559 /* Checksum the child DIEs. */
7562 dw_attr_node
*name_attr
;
7565 name_attr
= get_AT (c
, DW_AT_name
);
7566 if (is_template_instantiation (c
))
7568 /* Ignore instantiations of member type and function templates. */
7570 else if (name_attr
!= NULL
7571 && (is_type_die (c
) || c
->die_tag
== DW_TAG_subprogram
))
7573 /* Use a shallow checksum for named nested types and member
7575 CHECKSUM_ULEB128 ('S');
7576 CHECKSUM_ULEB128 (c
->die_tag
);
7577 CHECKSUM_STRING (AT_string (name_attr
));
7581 /* Use a deep checksum for other children. */
7582 /* Mark this DIE so it gets processed when unmarking. */
7583 if (c
->die_mark
== 0)
7585 die_checksum_ordered (c
, ctx
, mark
);
7587 } while (c
!= die
->die_child
);
7589 CHECKSUM_ULEB128 (0);
7592 /* Add a type name and tag to a hash. */
7594 die_odr_checksum (int tag
, const char *name
, md5_ctx
*ctx
)
7596 CHECKSUM_ULEB128 (tag
);
7597 CHECKSUM_STRING (name
);
7601 #undef CHECKSUM_STRING
7602 #undef CHECKSUM_ATTR
7603 #undef CHECKSUM_LEB128
7604 #undef CHECKSUM_ULEB128
7606 /* Generate the type signature for DIE. This is computed by generating an
7607 MD5 checksum over the DIE's tag, its relevant attributes, and its
7608 children. Attributes that are references to other DIEs are processed
7609 by recursion, using the MARK field to prevent infinite recursion.
7610 If the DIE is nested inside a namespace or another type, we also
7611 need to include that context in the signature. The lower 64 bits
7612 of the resulting MD5 checksum comprise the signature. */
7615 generate_type_signature (dw_die_ref die
, comdat_type_node
*type_node
)
7619 unsigned char checksum
[16];
7624 name
= get_AT_string (die
, DW_AT_name
);
7625 decl
= get_AT_ref (die
, DW_AT_specification
);
7626 parent
= get_die_parent (die
);
7628 /* First, compute a signature for just the type name (and its surrounding
7629 context, if any. This is stored in the type unit DIE for link-time
7630 ODR (one-definition rule) checking. */
7632 if (is_cxx () && name
!= NULL
)
7634 md5_init_ctx (&ctx
);
7636 /* Checksum the names of surrounding namespaces and structures. */
7638 checksum_die_context (parent
, &ctx
);
7640 /* Checksum the current DIE. */
7641 die_odr_checksum (die
->die_tag
, name
, &ctx
);
7642 md5_finish_ctx (&ctx
, checksum
);
7644 add_AT_data8 (type_node
->root_die
, DW_AT_GNU_odr_signature
, &checksum
[8]);
7647 /* Next, compute the complete type signature. */
7649 md5_init_ctx (&ctx
);
7651 die
->die_mark
= mark
;
7653 /* Checksum the names of surrounding namespaces and structures. */
7655 checksum_die_context (parent
, &ctx
);
7657 /* Checksum the DIE and its children. */
7658 die_checksum_ordered (die
, &ctx
, &mark
);
7659 unmark_all_dies (die
);
7660 md5_finish_ctx (&ctx
, checksum
);
7662 /* Store the signature in the type node and link the type DIE and the
7663 type node together. */
7664 memcpy (type_node
->signature
, &checksum
[16 - DWARF_TYPE_SIGNATURE_SIZE
],
7665 DWARF_TYPE_SIGNATURE_SIZE
);
7666 die
->comdat_type_p
= true;
7667 die
->die_id
.die_type_node
= type_node
;
7668 type_node
->type_die
= die
;
7670 /* If the DIE is a specification, link its declaration to the type node
7674 decl
->comdat_type_p
= true;
7675 decl
->die_id
.die_type_node
= type_node
;
7679 /* Do the location expressions look same? */
7681 same_loc_p (dw_loc_descr_ref loc1
, dw_loc_descr_ref loc2
, int *mark
)
7683 return loc1
->dw_loc_opc
== loc2
->dw_loc_opc
7684 && same_dw_val_p (&loc1
->dw_loc_oprnd1
, &loc2
->dw_loc_oprnd1
, mark
)
7685 && same_dw_val_p (&loc1
->dw_loc_oprnd2
, &loc2
->dw_loc_oprnd2
, mark
);
7688 /* Do the values look the same? */
7690 same_dw_val_p (const dw_val_node
*v1
, const dw_val_node
*v2
, int *mark
)
7692 dw_loc_descr_ref loc1
, loc2
;
7695 if (v1
->val_class
!= v2
->val_class
)
7698 switch (v1
->val_class
)
7700 case dw_val_class_const
:
7701 case dw_val_class_const_implicit
:
7702 return v1
->v
.val_int
== v2
->v
.val_int
;
7703 case dw_val_class_unsigned_const
:
7704 case dw_val_class_unsigned_const_implicit
:
7705 return v1
->v
.val_unsigned
== v2
->v
.val_unsigned
;
7706 case dw_val_class_const_double
:
7707 return v1
->v
.val_double
.high
== v2
->v
.val_double
.high
7708 && v1
->v
.val_double
.low
== v2
->v
.val_double
.low
;
7709 case dw_val_class_wide_int
:
7710 return *v1
->v
.val_wide
== *v2
->v
.val_wide
;
7711 case dw_val_class_vec
:
7712 if (v1
->v
.val_vec
.length
!= v2
->v
.val_vec
.length
7713 || v1
->v
.val_vec
.elt_size
!= v2
->v
.val_vec
.elt_size
)
7715 if (memcmp (v1
->v
.val_vec
.array
, v2
->v
.val_vec
.array
,
7716 v1
->v
.val_vec
.length
* v1
->v
.val_vec
.elt_size
))
7719 case dw_val_class_flag
:
7720 return v1
->v
.val_flag
== v2
->v
.val_flag
;
7721 case dw_val_class_str
:
7722 return !strcmp (v1
->v
.val_str
->str
, v2
->v
.val_str
->str
);
7724 case dw_val_class_addr
:
7725 r1
= v1
->v
.val_addr
;
7726 r2
= v2
->v
.val_addr
;
7727 if (GET_CODE (r1
) != GET_CODE (r2
))
7729 return !rtx_equal_p (r1
, r2
);
7731 case dw_val_class_offset
:
7732 return v1
->v
.val_offset
== v2
->v
.val_offset
;
7734 case dw_val_class_loc
:
7735 for (loc1
= v1
->v
.val_loc
, loc2
= v2
->v
.val_loc
;
7737 loc1
= loc1
->dw_loc_next
, loc2
= loc2
->dw_loc_next
)
7738 if (!same_loc_p (loc1
, loc2
, mark
))
7740 return !loc1
&& !loc2
;
7742 case dw_val_class_die_ref
:
7743 return same_die_p (v1
->v
.val_die_ref
.die
, v2
->v
.val_die_ref
.die
, mark
);
7745 case dw_val_class_symview
:
7746 return strcmp (v1
->v
.val_symbolic_view
, v2
->v
.val_symbolic_view
) == 0;
7748 case dw_val_class_fde_ref
:
7749 case dw_val_class_vms_delta
:
7750 case dw_val_class_lbl_id
:
7751 case dw_val_class_lineptr
:
7752 case dw_val_class_macptr
:
7753 case dw_val_class_loclistsptr
:
7754 case dw_val_class_high_pc
:
7757 case dw_val_class_file
:
7758 case dw_val_class_file_implicit
:
7759 return v1
->v
.val_file
== v2
->v
.val_file
;
7761 case dw_val_class_data8
:
7762 return !memcmp (v1
->v
.val_data8
, v2
->v
.val_data8
, 8);
7769 /* Do the attributes look the same? */
7772 same_attr_p (dw_attr_node
*at1
, dw_attr_node
*at2
, int *mark
)
7774 if (at1
->dw_attr
!= at2
->dw_attr
)
7777 /* We don't care that this was compiled with a different compiler
7778 snapshot; if the output is the same, that's what matters. */
7779 if (at1
->dw_attr
== DW_AT_producer
)
7782 return same_dw_val_p (&at1
->dw_attr_val
, &at2
->dw_attr_val
, mark
);
7785 /* Do the dies look the same? */
7788 same_die_p (dw_die_ref die1
, dw_die_ref die2
, int *mark
)
7794 /* To avoid infinite recursion. */
7796 return die1
->die_mark
== die2
->die_mark
;
7797 die1
->die_mark
= die2
->die_mark
= ++(*mark
);
7799 if (die1
->die_tag
!= die2
->die_tag
)
7802 if (vec_safe_length (die1
->die_attr
) != vec_safe_length (die2
->die_attr
))
7805 FOR_EACH_VEC_SAFE_ELT (die1
->die_attr
, ix
, a1
)
7806 if (!same_attr_p (a1
, &(*die2
->die_attr
)[ix
], mark
))
7809 c1
= die1
->die_child
;
7810 c2
= die2
->die_child
;
7819 if (!same_die_p (c1
, c2
, mark
))
7823 if (c1
== die1
->die_child
)
7825 if (c2
== die2
->die_child
)
7835 /* Calculate the MD5 checksum of the compilation unit DIE UNIT_DIE and its
7836 children, and set die_symbol. */
7839 compute_comp_unit_symbol (dw_die_ref unit_die
)
7841 const char *die_name
= get_AT_string (unit_die
, DW_AT_name
);
7842 const char *base
= die_name
? lbasename (die_name
) : "anonymous";
7843 char *name
= XALLOCAVEC (char, strlen (base
) + 64);
7846 unsigned char checksum
[16];
7849 /* Compute the checksum of the DIE, then append part of it as hex digits to
7850 the name filename of the unit. */
7852 md5_init_ctx (&ctx
);
7854 die_checksum (unit_die
, &ctx
, &mark
);
7855 unmark_all_dies (unit_die
);
7856 md5_finish_ctx (&ctx
, checksum
);
7858 /* When we this for comp_unit_die () we have a DW_AT_name that might
7859 not start with a letter but with anything valid for filenames and
7860 clean_symbol_name doesn't fix that up. Prepend 'g' if the first
7861 character is not a letter. */
7862 sprintf (name
, "%s%s.", ISALPHA (*base
) ? "" : "g", base
);
7863 clean_symbol_name (name
);
7865 p
= name
+ strlen (name
);
7866 for (i
= 0; i
< 4; i
++)
7868 sprintf (p
, "%.2x", checksum
[i
]);
7872 unit_die
->die_id
.die_symbol
= xstrdup (name
);
7875 /* Returns nonzero if DIE represents a type, in the sense of TYPE_P. */
7878 is_type_die (dw_die_ref die
)
7880 switch (die
->die_tag
)
7882 case DW_TAG_array_type
:
7883 case DW_TAG_class_type
:
7884 case DW_TAG_interface_type
:
7885 case DW_TAG_enumeration_type
:
7886 case DW_TAG_pointer_type
:
7887 case DW_TAG_reference_type
:
7888 case DW_TAG_rvalue_reference_type
:
7889 case DW_TAG_string_type
:
7890 case DW_TAG_structure_type
:
7891 case DW_TAG_subroutine_type
:
7892 case DW_TAG_union_type
:
7893 case DW_TAG_ptr_to_member_type
:
7894 case DW_TAG_set_type
:
7895 case DW_TAG_subrange_type
:
7896 case DW_TAG_base_type
:
7897 case DW_TAG_const_type
:
7898 case DW_TAG_file_type
:
7899 case DW_TAG_packed_type
:
7900 case DW_TAG_volatile_type
:
7901 case DW_TAG_typedef
:
7908 /* Returns true iff C is a compile-unit DIE. */
7911 is_cu_die (dw_die_ref c
)
7913 return c
&& (c
->die_tag
== DW_TAG_compile_unit
7914 || c
->die_tag
== DW_TAG_skeleton_unit
);
7917 /* Returns true iff C is a unit DIE of some sort. */
7920 is_unit_die (dw_die_ref c
)
7922 return c
&& (c
->die_tag
== DW_TAG_compile_unit
7923 || c
->die_tag
== DW_TAG_partial_unit
7924 || c
->die_tag
== DW_TAG_type_unit
7925 || c
->die_tag
== DW_TAG_skeleton_unit
);
7928 /* Returns true iff C is a namespace DIE. */
7931 is_namespace_die (dw_die_ref c
)
7933 return c
&& c
->die_tag
== DW_TAG_namespace
;
7936 /* Return non-zero if this DIE is a template parameter. */
7939 is_template_parameter (dw_die_ref die
)
7941 switch (die
->die_tag
)
7943 case DW_TAG_template_type_param
:
7944 case DW_TAG_template_value_param
:
7945 case DW_TAG_GNU_template_template_param
:
7946 case DW_TAG_GNU_template_parameter_pack
:
7953 /* Return non-zero if this DIE represents a template instantiation. */
7956 is_template_instantiation (dw_die_ref die
)
7960 if (!is_type_die (die
) && die
->die_tag
!= DW_TAG_subprogram
)
7962 FOR_EACH_CHILD (die
, c
, if (is_template_parameter (c
)) return true);
7967 gen_internal_sym (const char *prefix
)
7969 char buf
[MAX_ARTIFICIAL_LABEL_BYTES
];
7971 ASM_GENERATE_INTERNAL_LABEL (buf
, prefix
, label_num
++);
7972 return xstrdup (buf
);
7975 /* Return non-zero if this DIE is a declaration. */
7978 is_declaration_die (dw_die_ref die
)
7983 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
7984 if (a
->dw_attr
== DW_AT_declaration
)
7990 /* Return non-zero if this DIE is nested inside a subprogram. */
7993 is_nested_in_subprogram (dw_die_ref die
)
7995 dw_die_ref decl
= get_AT_ref (die
, DW_AT_specification
);
7999 return local_scope_p (decl
);
8002 /* Return non-zero if this DIE contains a defining declaration of a
8006 contains_subprogram_definition (dw_die_ref die
)
8010 if (die
->die_tag
== DW_TAG_subprogram
&& ! is_declaration_die (die
))
8012 FOR_EACH_CHILD (die
, c
, if (contains_subprogram_definition (c
)) return 1);
8016 /* Return non-zero if this is a type DIE that should be moved to a
8017 COMDAT .debug_types section or .debug_info section with DW_UT_*type
8021 should_move_die_to_comdat (dw_die_ref die
)
8023 switch (die
->die_tag
)
8025 case DW_TAG_class_type
:
8026 case DW_TAG_structure_type
:
8027 case DW_TAG_enumeration_type
:
8028 case DW_TAG_union_type
:
8029 /* Don't move declarations, inlined instances, types nested in a
8030 subprogram, or types that contain subprogram definitions. */
8031 if (is_declaration_die (die
)
8032 || get_AT (die
, DW_AT_abstract_origin
)
8033 || is_nested_in_subprogram (die
)
8034 || contains_subprogram_definition (die
))
8037 case DW_TAG_array_type
:
8038 case DW_TAG_interface_type
:
8039 case DW_TAG_pointer_type
:
8040 case DW_TAG_reference_type
:
8041 case DW_TAG_rvalue_reference_type
:
8042 case DW_TAG_string_type
:
8043 case DW_TAG_subroutine_type
:
8044 case DW_TAG_ptr_to_member_type
:
8045 case DW_TAG_set_type
:
8046 case DW_TAG_subrange_type
:
8047 case DW_TAG_base_type
:
8048 case DW_TAG_const_type
:
8049 case DW_TAG_file_type
:
8050 case DW_TAG_packed_type
:
8051 case DW_TAG_volatile_type
:
8052 case DW_TAG_typedef
:
8058 /* Make a clone of DIE. */
8061 clone_die (dw_die_ref die
)
8063 dw_die_ref clone
= new_die_raw (die
->die_tag
);
8067 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
8068 add_dwarf_attr (clone
, a
);
8073 /* Make a clone of the tree rooted at DIE. */
8076 clone_tree (dw_die_ref die
)
8079 dw_die_ref clone
= clone_die (die
);
8081 FOR_EACH_CHILD (die
, c
, add_child_die (clone
, clone_tree (c
)));
8086 /* Make a clone of DIE as a declaration. */
8089 clone_as_declaration (dw_die_ref die
)
8096 /* If the DIE is already a declaration, just clone it. */
8097 if (is_declaration_die (die
))
8098 return clone_die (die
);
8100 /* If the DIE is a specification, just clone its declaration DIE. */
8101 decl
= get_AT_ref (die
, DW_AT_specification
);
8104 clone
= clone_die (decl
);
8105 if (die
->comdat_type_p
)
8106 add_AT_die_ref (clone
, DW_AT_signature
, die
);
8110 clone
= new_die_raw (die
->die_tag
);
8112 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
8114 /* We don't want to copy over all attributes.
8115 For example we don't want DW_AT_byte_size because otherwise we will no
8116 longer have a declaration and GDB will treat it as a definition. */
8120 case DW_AT_abstract_origin
:
8121 case DW_AT_artificial
:
8122 case DW_AT_containing_type
:
8123 case DW_AT_external
:
8126 case DW_AT_virtuality
:
8127 case DW_AT_linkage_name
:
8128 case DW_AT_MIPS_linkage_name
:
8129 add_dwarf_attr (clone
, a
);
8131 case DW_AT_byte_size
:
8132 case DW_AT_alignment
:
8138 if (die
->comdat_type_p
)
8139 add_AT_die_ref (clone
, DW_AT_signature
, die
);
8141 add_AT_flag (clone
, DW_AT_declaration
, 1);
8146 /* Structure to map a DIE in one CU to its copy in a comdat type unit. */
8148 struct decl_table_entry
8154 /* Helpers to manipulate hash table of copied declarations. */
8156 /* Hashtable helpers. */
8158 struct decl_table_entry_hasher
: free_ptr_hash
<decl_table_entry
>
8160 typedef die_struct
*compare_type
;
8161 static inline hashval_t
hash (const decl_table_entry
*);
8162 static inline bool equal (const decl_table_entry
*, const die_struct
*);
8166 decl_table_entry_hasher::hash (const decl_table_entry
*entry
)
8168 return htab_hash_pointer (entry
->orig
);
8172 decl_table_entry_hasher::equal (const decl_table_entry
*entry1
,
8173 const die_struct
*entry2
)
8175 return entry1
->orig
== entry2
;
8178 typedef hash_table
<decl_table_entry_hasher
> decl_hash_type
;
8180 /* Copy DIE and its ancestors, up to, but not including, the compile unit
8181 or type unit entry, to a new tree. Adds the new tree to UNIT and returns
8182 a pointer to the copy of DIE. If DECL_TABLE is provided, it is used
8183 to check if the ancestor has already been copied into UNIT. */
8186 copy_ancestor_tree (dw_die_ref unit
, dw_die_ref die
,
8187 decl_hash_type
*decl_table
)
8189 dw_die_ref parent
= die
->die_parent
;
8190 dw_die_ref new_parent
= unit
;
8192 decl_table_entry
**slot
= NULL
;
8193 struct decl_table_entry
*entry
= NULL
;
8195 /* If DIE refers to a stub unfold that so we get the appropriate
8196 DIE registered as orig in decl_table. */
8197 if (dw_die_ref c
= get_AT_ref (die
, DW_AT_signature
))
8202 /* Check if the entry has already been copied to UNIT. */
8203 slot
= decl_table
->find_slot_with_hash (die
, htab_hash_pointer (die
),
8205 if (*slot
!= HTAB_EMPTY_ENTRY
)
8211 /* Record in DECL_TABLE that DIE has been copied to UNIT. */
8212 entry
= XCNEW (struct decl_table_entry
);
8220 dw_die_ref spec
= get_AT_ref (parent
, DW_AT_specification
);
8223 if (!is_unit_die (parent
))
8224 new_parent
= copy_ancestor_tree (unit
, parent
, decl_table
);
8227 copy
= clone_as_declaration (die
);
8228 add_child_die (new_parent
, copy
);
8232 /* Record the pointer to the copy. */
8238 /* Copy the declaration context to the new type unit DIE. This includes
8239 any surrounding namespace or type declarations. If the DIE has an
8240 AT_specification attribute, it also includes attributes and children
8241 attached to the specification, and returns a pointer to the original
8242 parent of the declaration DIE. Returns NULL otherwise. */
8245 copy_declaration_context (dw_die_ref unit
, dw_die_ref die
)
8248 dw_die_ref new_decl
;
8249 dw_die_ref orig_parent
= NULL
;
8251 decl
= get_AT_ref (die
, DW_AT_specification
);
8260 /* The original DIE will be changed to a declaration, and must
8261 be moved to be a child of the original declaration DIE. */
8262 orig_parent
= decl
->die_parent
;
8264 /* Copy the type node pointer from the new DIE to the original
8265 declaration DIE so we can forward references later. */
8266 decl
->comdat_type_p
= true;
8267 decl
->die_id
.die_type_node
= die
->die_id
.die_type_node
;
8269 remove_AT (die
, DW_AT_specification
);
8271 FOR_EACH_VEC_SAFE_ELT (decl
->die_attr
, ix
, a
)
8273 if (a
->dw_attr
!= DW_AT_name
8274 && a
->dw_attr
!= DW_AT_declaration
8275 && a
->dw_attr
!= DW_AT_external
)
8276 add_dwarf_attr (die
, a
);
8279 FOR_EACH_CHILD (decl
, c
, add_child_die (die
, clone_tree (c
)));
8282 if (decl
->die_parent
!= NULL
8283 && !is_unit_die (decl
->die_parent
))
8285 new_decl
= copy_ancestor_tree (unit
, decl
, NULL
);
8286 if (new_decl
!= NULL
)
8288 remove_AT (new_decl
, DW_AT_signature
);
8289 add_AT_specification (die
, new_decl
);
8296 /* Generate the skeleton ancestor tree for the given NODE, then clone
8297 the DIE and add the clone into the tree. */
8300 generate_skeleton_ancestor_tree (skeleton_chain_node
*node
)
8302 if (node
->new_die
!= NULL
)
8305 node
->new_die
= clone_as_declaration (node
->old_die
);
8307 if (node
->parent
!= NULL
)
8309 generate_skeleton_ancestor_tree (node
->parent
);
8310 add_child_die (node
->parent
->new_die
, node
->new_die
);
8314 /* Generate a skeleton tree of DIEs containing any declarations that are
8315 found in the original tree. We traverse the tree looking for declaration
8316 DIEs, and construct the skeleton from the bottom up whenever we find one. */
8319 generate_skeleton_bottom_up (skeleton_chain_node
*parent
)
8321 skeleton_chain_node node
;
8324 dw_die_ref prev
= NULL
;
8325 dw_die_ref next
= NULL
;
8327 node
.parent
= parent
;
8329 first
= c
= parent
->old_die
->die_child
;
8333 if (prev
== NULL
|| prev
->die_sib
== c
)
8336 next
= (c
== first
? NULL
: c
->die_sib
);
8338 node
.new_die
= NULL
;
8339 if (is_declaration_die (c
))
8341 if (is_template_instantiation (c
))
8343 /* Instantiated templates do not need to be cloned into the
8344 type unit. Just move the DIE and its children back to
8345 the skeleton tree (in the main CU). */
8346 remove_child_with_prev (c
, prev
);
8347 add_child_die (parent
->new_die
, c
);
8350 else if (c
->comdat_type_p
)
8352 /* This is the skeleton of earlier break_out_comdat_types
8353 type. Clone the existing DIE, but keep the children
8354 under the original (which is in the main CU). */
8355 dw_die_ref clone
= clone_die (c
);
8357 replace_child (c
, clone
, prev
);
8358 generate_skeleton_ancestor_tree (parent
);
8359 add_child_die (parent
->new_die
, c
);
8365 /* Clone the existing DIE, move the original to the skeleton
8366 tree (which is in the main CU), and put the clone, with
8367 all the original's children, where the original came from
8368 (which is about to be moved to the type unit). */
8369 dw_die_ref clone
= clone_die (c
);
8370 move_all_children (c
, clone
);
8372 /* If the original has a DW_AT_object_pointer attribute,
8373 it would now point to a child DIE just moved to the
8374 cloned tree, so we need to remove that attribute from
8376 remove_AT (c
, DW_AT_object_pointer
);
8378 replace_child (c
, clone
, prev
);
8379 generate_skeleton_ancestor_tree (parent
);
8380 add_child_die (parent
->new_die
, c
);
8381 node
.old_die
= clone
;
8386 generate_skeleton_bottom_up (&node
);
8387 } while (next
!= NULL
);
8390 /* Wrapper function for generate_skeleton_bottom_up. */
8393 generate_skeleton (dw_die_ref die
)
8395 skeleton_chain_node node
;
8398 node
.new_die
= NULL
;
8401 /* If this type definition is nested inside another type,
8402 and is not an instantiation of a template, always leave
8403 at least a declaration in its place. */
8404 if (die
->die_parent
!= NULL
8405 && is_type_die (die
->die_parent
)
8406 && !is_template_instantiation (die
))
8407 node
.new_die
= clone_as_declaration (die
);
8409 generate_skeleton_bottom_up (&node
);
8410 return node
.new_die
;
8413 /* Remove the CHILD DIE from its parent, possibly replacing it with a cloned
8414 declaration. The original DIE is moved to a new compile unit so that
8415 existing references to it follow it to the new location. If any of the
8416 original DIE's descendants is a declaration, we need to replace the
8417 original DIE with a skeleton tree and move the declarations back into the
8421 remove_child_or_replace_with_skeleton (dw_die_ref unit
, dw_die_ref child
,
8424 dw_die_ref skeleton
, orig_parent
;
8426 /* Copy the declaration context to the type unit DIE. If the returned
8427 ORIG_PARENT is not NULL, the skeleton needs to be added as a child of
8429 orig_parent
= copy_declaration_context (unit
, child
);
8431 skeleton
= generate_skeleton (child
);
8432 if (skeleton
== NULL
)
8433 remove_child_with_prev (child
, prev
);
8436 skeleton
->comdat_type_p
= true;
8437 skeleton
->die_id
.die_type_node
= child
->die_id
.die_type_node
;
8439 /* If the original DIE was a specification, we need to put
8440 the skeleton under the parent DIE of the declaration.
8441 This leaves the original declaration in the tree, but
8442 it will be pruned later since there are no longer any
8443 references to it. */
8444 if (orig_parent
!= NULL
)
8446 remove_child_with_prev (child
, prev
);
8447 add_child_die (orig_parent
, skeleton
);
8450 replace_child (child
, skeleton
, prev
);
8457 copy_dwarf_procs_ref_in_attrs (dw_die_ref die
,
8458 comdat_type_node
*type_node
,
8459 hash_map
<dw_die_ref
, dw_die_ref
> &copied_dwarf_procs
);
8461 /* Helper for copy_dwarf_procs_ref_in_dies. Make a copy of the DIE DWARF
8462 procedure, put it under TYPE_NODE and return the copy. Continue looking for
8463 DWARF procedure references in the DW_AT_location attribute. */
8466 copy_dwarf_procedure (dw_die_ref die
,
8467 comdat_type_node
*type_node
,
8468 hash_map
<dw_die_ref
, dw_die_ref
> &copied_dwarf_procs
)
8470 gcc_assert (die
->die_tag
== DW_TAG_dwarf_procedure
);
8472 /* DWARF procedures are not supposed to have children... */
8473 gcc_assert (die
->die_child
== NULL
);
8475 /* ... and they are supposed to have only one attribute: DW_AT_location. */
8476 gcc_assert (vec_safe_length (die
->die_attr
) == 1
8477 && ((*die
->die_attr
)[0].dw_attr
== DW_AT_location
));
8479 /* Do not copy more than once DWARF procedures. */
8481 dw_die_ref
&die_copy
= copied_dwarf_procs
.get_or_insert (die
, &existed
);
8485 die_copy
= clone_die (die
);
8486 add_child_die (type_node
->root_die
, die_copy
);
8487 copy_dwarf_procs_ref_in_attrs (die_copy
, type_node
, copied_dwarf_procs
);
8491 /* Helper for copy_dwarf_procs_ref_in_dies. Look for references to DWARF
8492 procedures in DIE's attributes. */
8495 copy_dwarf_procs_ref_in_attrs (dw_die_ref die
,
8496 comdat_type_node
*type_node
,
8497 hash_map
<dw_die_ref
, dw_die_ref
> &copied_dwarf_procs
)
8502 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, i
, a
)
8504 dw_loc_descr_ref loc
;
8506 if (a
->dw_attr_val
.val_class
!= dw_val_class_loc
)
8509 for (loc
= a
->dw_attr_val
.v
.val_loc
; loc
!= NULL
; loc
= loc
->dw_loc_next
)
8511 switch (loc
->dw_loc_opc
)
8515 case DW_OP_call_ref
:
8516 gcc_assert (loc
->dw_loc_oprnd1
.val_class
8517 == dw_val_class_die_ref
);
8518 loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
8519 = copy_dwarf_procedure (loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
,
8521 copied_dwarf_procs
);
8530 /* Copy DWARF procedures that are referenced by the DIE tree to TREE_NODE and
8531 rewrite references to point to the copies.
8533 References are looked for in DIE's attributes and recursively in all its
8534 children attributes that are location descriptions. COPIED_DWARF_PROCS is a
8535 mapping from old DWARF procedures to their copy. It is used not to copy
8536 twice the same DWARF procedure under TYPE_NODE. */
8539 copy_dwarf_procs_ref_in_dies (dw_die_ref die
,
8540 comdat_type_node
*type_node
,
8541 hash_map
<dw_die_ref
, dw_die_ref
> &copied_dwarf_procs
)
8545 copy_dwarf_procs_ref_in_attrs (die
, type_node
, copied_dwarf_procs
);
8546 FOR_EACH_CHILD (die
, c
, copy_dwarf_procs_ref_in_dies (c
,
8548 copied_dwarf_procs
));
8551 /* Traverse the DIE and set up additional .debug_types or .debug_info
8552 DW_UT_*type sections for each type worthy of being placed in a COMDAT
8556 break_out_comdat_types (dw_die_ref die
)
8560 dw_die_ref prev
= NULL
;
8561 dw_die_ref next
= NULL
;
8562 dw_die_ref unit
= NULL
;
8564 first
= c
= die
->die_child
;
8568 if (prev
== NULL
|| prev
->die_sib
== c
)
8571 next
= (c
== first
? NULL
: c
->die_sib
);
8572 if (should_move_die_to_comdat (c
))
8574 dw_die_ref replacement
;
8575 comdat_type_node
*type_node
;
8577 /* Break out nested types into their own type units. */
8578 break_out_comdat_types (c
);
8580 /* Create a new type unit DIE as the root for the new tree. */
8581 unit
= new_die (DW_TAG_type_unit
, NULL
, NULL
);
8582 add_AT_unsigned (unit
, DW_AT_language
,
8583 get_AT_unsigned (comp_unit_die (), DW_AT_language
));
8585 /* Add the new unit's type DIE into the comdat type list. */
8586 type_node
= ggc_cleared_alloc
<comdat_type_node
> ();
8587 type_node
->root_die
= unit
;
8588 type_node
->next
= comdat_type_list
;
8589 comdat_type_list
= type_node
;
8591 /* Generate the type signature. */
8592 generate_type_signature (c
, type_node
);
8594 /* Copy the declaration context, attributes, and children of the
8595 declaration into the new type unit DIE, then remove this DIE
8596 from the main CU (or replace it with a skeleton if necessary). */
8597 replacement
= remove_child_or_replace_with_skeleton (unit
, c
, prev
);
8598 type_node
->skeleton_die
= replacement
;
8600 /* Add the DIE to the new compunit. */
8601 add_child_die (unit
, c
);
8603 /* Types can reference DWARF procedures for type size or data location
8604 expressions. Calls in DWARF expressions cannot target procedures
8605 that are not in the same section. So we must copy DWARF procedures
8606 along with this type and then rewrite references to them. */
8607 hash_map
<dw_die_ref
, dw_die_ref
> copied_dwarf_procs
;
8608 copy_dwarf_procs_ref_in_dies (c
, type_node
, copied_dwarf_procs
);
8610 if (replacement
!= NULL
)
8613 else if (c
->die_tag
== DW_TAG_namespace
8614 || c
->die_tag
== DW_TAG_class_type
8615 || c
->die_tag
== DW_TAG_structure_type
8616 || c
->die_tag
== DW_TAG_union_type
)
8618 /* Look for nested types that can be broken out. */
8619 break_out_comdat_types (c
);
8621 } while (next
!= NULL
);
8624 /* Like clone_tree, but copy DW_TAG_subprogram DIEs as declarations.
8625 Enter all the cloned children into the hash table decl_table. */
8628 clone_tree_partial (dw_die_ref die
, decl_hash_type
*decl_table
)
8632 struct decl_table_entry
*entry
;
8633 decl_table_entry
**slot
;
8635 if (die
->die_tag
== DW_TAG_subprogram
)
8636 clone
= clone_as_declaration (die
);
8638 clone
= clone_die (die
);
8640 slot
= decl_table
->find_slot_with_hash (die
,
8641 htab_hash_pointer (die
), INSERT
);
8643 /* Assert that DIE isn't in the hash table yet. If it would be there
8644 before, the ancestors would be necessarily there as well, therefore
8645 clone_tree_partial wouldn't be called. */
8646 gcc_assert (*slot
== HTAB_EMPTY_ENTRY
);
8648 entry
= XCNEW (struct decl_table_entry
);
8650 entry
->copy
= clone
;
8653 if (die
->die_tag
!= DW_TAG_subprogram
)
8654 FOR_EACH_CHILD (die
, c
,
8655 add_child_die (clone
, clone_tree_partial (c
, decl_table
)));
8660 /* Walk the DIE and its children, looking for references to incomplete
8661 or trivial types that are unmarked (i.e., that are not in the current
8665 copy_decls_walk (dw_die_ref unit
, dw_die_ref die
, decl_hash_type
*decl_table
)
8671 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
8673 if (AT_class (a
) == dw_val_class_die_ref
)
8675 dw_die_ref targ
= AT_ref (a
);
8676 decl_table_entry
**slot
;
8677 struct decl_table_entry
*entry
;
8679 if (targ
->die_mark
!= 0 || targ
->comdat_type_p
)
8682 slot
= decl_table
->find_slot_with_hash (targ
,
8683 htab_hash_pointer (targ
),
8686 if (*slot
!= HTAB_EMPTY_ENTRY
)
8688 /* TARG has already been copied, so we just need to
8689 modify the reference to point to the copy. */
8691 a
->dw_attr_val
.v
.val_die_ref
.die
= entry
->copy
;
8695 dw_die_ref parent
= unit
;
8696 dw_die_ref copy
= clone_die (targ
);
8698 /* Record in DECL_TABLE that TARG has been copied.
8699 Need to do this now, before the recursive call,
8700 because DECL_TABLE may be expanded and SLOT
8701 would no longer be a valid pointer. */
8702 entry
= XCNEW (struct decl_table_entry
);
8707 /* If TARG is not a declaration DIE, we need to copy its
8709 if (!is_declaration_die (targ
))
8713 add_child_die (copy
,
8714 clone_tree_partial (c
, decl_table
)));
8717 /* Make sure the cloned tree is marked as part of the
8721 /* If TARG has surrounding context, copy its ancestor tree
8722 into the new type unit. */
8723 if (targ
->die_parent
!= NULL
8724 && !is_unit_die (targ
->die_parent
))
8725 parent
= copy_ancestor_tree (unit
, targ
->die_parent
,
8728 add_child_die (parent
, copy
);
8729 a
->dw_attr_val
.v
.val_die_ref
.die
= copy
;
8731 /* Make sure the newly-copied DIE is walked. If it was
8732 installed in a previously-added context, it won't
8733 get visited otherwise. */
8736 /* Find the highest point of the newly-added tree,
8737 mark each node along the way, and walk from there. */
8738 parent
->die_mark
= 1;
8739 while (parent
->die_parent
8740 && parent
->die_parent
->die_mark
== 0)
8742 parent
= parent
->die_parent
;
8743 parent
->die_mark
= 1;
8745 copy_decls_walk (unit
, parent
, decl_table
);
8751 FOR_EACH_CHILD (die
, c
, copy_decls_walk (unit
, c
, decl_table
));
8754 /* Collect skeleton dies in DIE created by break_out_comdat_types already
8755 and record them in DECL_TABLE. */
8758 collect_skeleton_dies (dw_die_ref die
, decl_hash_type
*decl_table
)
8762 if (dw_attr_node
*a
= get_AT (die
, DW_AT_signature
))
8764 dw_die_ref targ
= AT_ref (a
);
8765 gcc_assert (targ
->die_mark
== 0 && targ
->comdat_type_p
);
8766 decl_table_entry
**slot
8767 = decl_table
->find_slot_with_hash (targ
,
8768 htab_hash_pointer (targ
),
8770 gcc_assert (*slot
== HTAB_EMPTY_ENTRY
);
8771 /* Record in DECL_TABLE that TARG has been already copied
8772 by remove_child_or_replace_with_skeleton. */
8773 decl_table_entry
*entry
= XCNEW (struct decl_table_entry
);
8778 FOR_EACH_CHILD (die
, c
, collect_skeleton_dies (c
, decl_table
));
8781 /* Copy declarations for "unworthy" types into the new comdat section.
8782 Incomplete types, modified types, and certain other types aren't broken
8783 out into comdat sections of their own, so they don't have a signature,
8784 and we need to copy the declaration into the same section so that we
8785 don't have an external reference. */
8788 copy_decls_for_unworthy_types (dw_die_ref unit
)
8791 decl_hash_type
decl_table (10);
8792 collect_skeleton_dies (unit
, &decl_table
);
8793 copy_decls_walk (unit
, unit
, &decl_table
);
8797 /* Traverse the DIE and add a sibling attribute if it may have the
8798 effect of speeding up access to siblings. To save some space,
8799 avoid generating sibling attributes for DIE's without children. */
8802 add_sibling_attributes (dw_die_ref die
)
8806 if (! die
->die_child
)
8809 if (die
->die_parent
&& die
!= die
->die_parent
->die_child
)
8810 add_AT_die_ref (die
, DW_AT_sibling
, die
->die_sib
);
8812 FOR_EACH_CHILD (die
, c
, add_sibling_attributes (c
));
8815 /* Output all location lists for the DIE and its children. */
8818 output_location_lists (dw_die_ref die
)
8824 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
8825 if (AT_class (a
) == dw_val_class_loc_list
)
8826 output_loc_list (AT_loc_list (a
));
8828 FOR_EACH_CHILD (die
, c
, output_location_lists (c
));
8831 /* During assign_location_list_indexes and output_loclists_offset the
8832 current index, after it the number of assigned indexes (i.e. how
8833 large the .debug_loclists* offset table should be). */
8834 static unsigned int loc_list_idx
;
8836 /* Output all location list offsets for the DIE and its children. */
8839 output_loclists_offsets (dw_die_ref die
)
8845 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
8846 if (AT_class (a
) == dw_val_class_loc_list
)
8848 dw_loc_list_ref l
= AT_loc_list (a
);
8849 if (l
->offset_emitted
)
8851 dw2_asm_output_delta (DWARF_OFFSET_SIZE
, l
->ll_symbol
,
8852 loc_section_label
, NULL
);
8853 gcc_assert (l
->hash
== loc_list_idx
);
8855 l
->offset_emitted
= true;
8858 FOR_EACH_CHILD (die
, c
, output_loclists_offsets (c
));
8861 /* Recursively set indexes of location lists. */
8864 assign_location_list_indexes (dw_die_ref die
)
8870 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
8871 if (AT_class (a
) == dw_val_class_loc_list
)
8873 dw_loc_list_ref list
= AT_loc_list (a
);
8874 if (!list
->num_assigned
)
8876 list
->num_assigned
= true;
8877 list
->hash
= loc_list_idx
++;
8881 FOR_EACH_CHILD (die
, c
, assign_location_list_indexes (c
));
8884 /* We want to limit the number of external references, because they are
8885 larger than local references: a relocation takes multiple words, and
8886 even a sig8 reference is always eight bytes, whereas a local reference
8887 can be as small as one byte (though DW_FORM_ref is usually 4 in GCC).
8888 So if we encounter multiple external references to the same type DIE, we
8889 make a local typedef stub for it and redirect all references there.
8891 This is the element of the hash table for keeping track of these
8901 /* Hashtable helpers. */
8903 struct external_ref_hasher
: free_ptr_hash
<external_ref
>
8905 static inline hashval_t
hash (const external_ref
*);
8906 static inline bool equal (const external_ref
*, const external_ref
*);
8910 external_ref_hasher::hash (const external_ref
*r
)
8912 dw_die_ref die
= r
->type
;
8915 /* We can't use the address of the DIE for hashing, because
8916 that will make the order of the stub DIEs non-deterministic. */
8917 if (! die
->comdat_type_p
)
8918 /* We have a symbol; use it to compute a hash. */
8919 h
= htab_hash_string (die
->die_id
.die_symbol
);
8922 /* We have a type signature; use a subset of the bits as the hash.
8923 The 8-byte signature is at least as large as hashval_t. */
8924 comdat_type_node
*type_node
= die
->die_id
.die_type_node
;
8925 memcpy (&h
, type_node
->signature
, sizeof (h
));
8931 external_ref_hasher::equal (const external_ref
*r1
, const external_ref
*r2
)
8933 return r1
->type
== r2
->type
;
8936 typedef hash_table
<external_ref_hasher
> external_ref_hash_type
;
8938 /* Return a pointer to the external_ref for references to DIE. */
8940 static struct external_ref
*
8941 lookup_external_ref (external_ref_hash_type
*map
, dw_die_ref die
)
8943 struct external_ref ref
, *ref_p
;
8944 external_ref
**slot
;
8947 slot
= map
->find_slot (&ref
, INSERT
);
8948 if (*slot
!= HTAB_EMPTY_ENTRY
)
8951 ref_p
= XCNEW (struct external_ref
);
8957 /* Subroutine of optimize_external_refs, below.
8959 If we see a type skeleton, record it as our stub. If we see external
8960 references, remember how many we've seen. */
8963 optimize_external_refs_1 (dw_die_ref die
, external_ref_hash_type
*map
)
8968 struct external_ref
*ref_p
;
8970 if (is_type_die (die
)
8971 && (c
= get_AT_ref (die
, DW_AT_signature
)))
8973 /* This is a local skeleton; use it for local references. */
8974 ref_p
= lookup_external_ref (map
, c
);
8978 /* Scan the DIE references, and remember any that refer to DIEs from
8979 other CUs (i.e. those which are not marked). */
8980 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
8981 if (AT_class (a
) == dw_val_class_die_ref
8982 && (c
= AT_ref (a
))->die_mark
== 0
8985 ref_p
= lookup_external_ref (map
, c
);
8989 FOR_EACH_CHILD (die
, c
, optimize_external_refs_1 (c
, map
));
8992 /* htab_traverse callback function for optimize_external_refs, below. SLOT
8993 points to an external_ref, DATA is the CU we're processing. If we don't
8994 already have a local stub, and we have multiple refs, build a stub. */
8997 dwarf2_build_local_stub (external_ref
**slot
, dw_die_ref data
)
8999 struct external_ref
*ref_p
= *slot
;
9001 if (ref_p
->stub
== NULL
&& ref_p
->n_refs
> 1 && !dwarf_strict
)
9003 /* We have multiple references to this type, so build a small stub.
9004 Both of these forms are a bit dodgy from the perspective of the
9005 DWARF standard, since technically they should have names. */
9006 dw_die_ref cu
= data
;
9007 dw_die_ref type
= ref_p
->type
;
9008 dw_die_ref stub
= NULL
;
9010 if (type
->comdat_type_p
)
9012 /* If we refer to this type via sig8, use AT_signature. */
9013 stub
= new_die (type
->die_tag
, cu
, NULL_TREE
);
9014 add_AT_die_ref (stub
, DW_AT_signature
, type
);
9018 /* Otherwise, use a typedef with no name. */
9019 stub
= new_die (DW_TAG_typedef
, cu
, NULL_TREE
);
9020 add_AT_die_ref (stub
, DW_AT_type
, type
);
9029 /* DIE is a unit; look through all the DIE references to see if there are
9030 any external references to types, and if so, create local stubs for
9031 them which will be applied in build_abbrev_table. This is useful because
9032 references to local DIEs are smaller. */
9034 static external_ref_hash_type
*
9035 optimize_external_refs (dw_die_ref die
)
9037 external_ref_hash_type
*map
= new external_ref_hash_type (10);
9038 optimize_external_refs_1 (die
, map
);
9039 map
->traverse
<dw_die_ref
, dwarf2_build_local_stub
> (die
);
9043 /* The following 3 variables are temporaries that are computed only during the
9044 build_abbrev_table call and used and released during the following
9045 optimize_abbrev_table call. */
9047 /* First abbrev_id that can be optimized based on usage. */
9048 static unsigned int abbrev_opt_start
;
9050 /* Maximum abbrev_id of a base type plus one (we can't optimize DIEs with
9051 abbrev_id smaller than this, because they must be already sized
9052 during build_abbrev_table). */
9053 static unsigned int abbrev_opt_base_type_end
;
9055 /* Vector of usage counts during build_abbrev_table. Indexed by
9056 abbrev_id - abbrev_opt_start. */
9057 static vec
<unsigned int> abbrev_usage_count
;
9059 /* Vector of all DIEs added with die_abbrev >= abbrev_opt_start. */
9060 static vec
<dw_die_ref
> sorted_abbrev_dies
;
9062 /* The format of each DIE (and its attribute value pairs) is encoded in an
9063 abbreviation table. This routine builds the abbreviation table and assigns
9064 a unique abbreviation id for each abbreviation entry. The children of each
9065 die are visited recursively. */
9068 build_abbrev_table (dw_die_ref die
, external_ref_hash_type
*extern_map
)
9070 unsigned int abbrev_id
= 0;
9076 /* Scan the DIE references, and replace any that refer to
9077 DIEs from other CUs (i.e. those which are not marked) with
9078 the local stubs we built in optimize_external_refs. */
9079 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
9080 if (AT_class (a
) == dw_val_class_die_ref
9081 && (c
= AT_ref (a
))->die_mark
== 0)
9083 struct external_ref
*ref_p
;
9084 gcc_assert (AT_ref (a
)->comdat_type_p
|| AT_ref (a
)->die_id
.die_symbol
);
9087 && (ref_p
= lookup_external_ref (extern_map
, c
))
9088 && ref_p
->stub
&& ref_p
->stub
!= die
)
9090 gcc_assert (a
->dw_attr
!= DW_AT_signature
);
9091 change_AT_die_ref (a
, ref_p
->stub
);
9094 /* We aren't changing this reference, so mark it external. */
9095 set_AT_ref_external (a
, 1);
9098 FOR_EACH_VEC_SAFE_ELT (abbrev_die_table
, abbrev_id
, abbrev
)
9100 dw_attr_node
*die_a
, *abbrev_a
;
9106 if (abbrev
->die_tag
!= die
->die_tag
)
9108 if ((abbrev
->die_child
!= NULL
) != (die
->die_child
!= NULL
))
9111 if (vec_safe_length (abbrev
->die_attr
) != vec_safe_length (die
->die_attr
))
9114 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, die_a
)
9116 abbrev_a
= &(*abbrev
->die_attr
)[ix
];
9117 if ((abbrev_a
->dw_attr
!= die_a
->dw_attr
)
9118 || (value_format (abbrev_a
) != value_format (die_a
)))
9128 if (abbrev_id
>= vec_safe_length (abbrev_die_table
))
9130 vec_safe_push (abbrev_die_table
, die
);
9131 if (abbrev_opt_start
)
9132 abbrev_usage_count
.safe_push (0);
9134 if (abbrev_opt_start
&& abbrev_id
>= abbrev_opt_start
)
9136 abbrev_usage_count
[abbrev_id
- abbrev_opt_start
]++;
9137 sorted_abbrev_dies
.safe_push (die
);
9140 die
->die_abbrev
= abbrev_id
;
9141 FOR_EACH_CHILD (die
, c
, build_abbrev_table (c
, extern_map
));
9144 /* Callback function for sorted_abbrev_dies vector sorting. We sort
9145 by die_abbrev's usage count, from the most commonly used
9146 abbreviation to the least. */
9149 die_abbrev_cmp (const void *p1
, const void *p2
)
9151 dw_die_ref die1
= *(const dw_die_ref
*) p1
;
9152 dw_die_ref die2
= *(const dw_die_ref
*) p2
;
9154 gcc_checking_assert (die1
->die_abbrev
>= abbrev_opt_start
);
9155 gcc_checking_assert (die2
->die_abbrev
>= abbrev_opt_start
);
9157 if (die1
->die_abbrev
>= abbrev_opt_base_type_end
9158 && die2
->die_abbrev
>= abbrev_opt_base_type_end
)
9160 if (abbrev_usage_count
[die1
->die_abbrev
- abbrev_opt_start
]
9161 > abbrev_usage_count
[die2
->die_abbrev
- abbrev_opt_start
])
9163 if (abbrev_usage_count
[die1
->die_abbrev
- abbrev_opt_start
]
9164 < abbrev_usage_count
[die2
->die_abbrev
- abbrev_opt_start
])
9168 /* Stabilize the sort. */
9169 if (die1
->die_abbrev
< die2
->die_abbrev
)
9171 if (die1
->die_abbrev
> die2
->die_abbrev
)
9177 /* Convert dw_val_class_const and dw_val_class_unsigned_const class attributes
9178 of DIEs in between sorted_abbrev_dies[first_id] and abbrev_dies[end_id - 1]
9179 into dw_val_class_const_implicit or
9180 dw_val_class_unsigned_const_implicit. */
9183 optimize_implicit_const (unsigned int first_id
, unsigned int end
,
9184 vec
<bool> &implicit_consts
)
9186 /* It never makes sense if there is just one DIE using the abbreviation. */
9187 if (end
< first_id
+ 2)
9192 dw_die_ref die
= sorted_abbrev_dies
[first_id
];
9193 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
9194 if (implicit_consts
[ix
])
9196 enum dw_val_class new_class
= dw_val_class_none
;
9197 switch (AT_class (a
))
9199 case dw_val_class_unsigned_const
:
9200 if ((HOST_WIDE_INT
) AT_unsigned (a
) < 0)
9203 /* The .debug_abbrev section will grow by
9204 size_of_sleb128 (AT_unsigned (a)) and we avoid the constants
9205 in all the DIEs using that abbreviation. */
9206 if (constant_size (AT_unsigned (a
)) * (end
- first_id
)
9207 <= (unsigned) size_of_sleb128 (AT_unsigned (a
)))
9210 new_class
= dw_val_class_unsigned_const_implicit
;
9213 case dw_val_class_const
:
9214 new_class
= dw_val_class_const_implicit
;
9217 case dw_val_class_file
:
9218 new_class
= dw_val_class_file_implicit
;
9224 for (i
= first_id
; i
< end
; i
++)
9225 (*sorted_abbrev_dies
[i
]->die_attr
)[ix
].dw_attr_val
.val_class
9230 /* Attempt to optimize abbreviation table from abbrev_opt_start
9231 abbreviation above. */
9234 optimize_abbrev_table (void)
9236 if (abbrev_opt_start
9237 && vec_safe_length (abbrev_die_table
) > abbrev_opt_start
9238 && (dwarf_version
>= 5 || vec_safe_length (abbrev_die_table
) > 127))
9240 auto_vec
<bool, 32> implicit_consts
;
9241 sorted_abbrev_dies
.qsort (die_abbrev_cmp
);
9243 unsigned int abbrev_id
= abbrev_opt_start
- 1;
9244 unsigned int first_id
= ~0U;
9245 unsigned int last_abbrev_id
= 0;
9248 if (abbrev_opt_base_type_end
> abbrev_opt_start
)
9249 abbrev_id
= abbrev_opt_base_type_end
- 1;
9250 /* Reassign abbreviation ids from abbrev_opt_start above, so that
9251 most commonly used abbreviations come first. */
9252 FOR_EACH_VEC_ELT (sorted_abbrev_dies
, i
, die
)
9257 /* If calc_base_type_die_sizes has been called, the CU and
9258 base types after it can't be optimized, because we've already
9259 calculated their DIE offsets. We've sorted them first. */
9260 if (die
->die_abbrev
< abbrev_opt_base_type_end
)
9262 if (die
->die_abbrev
!= last_abbrev_id
)
9264 last_abbrev_id
= die
->die_abbrev
;
9265 if (dwarf_version
>= 5 && first_id
!= ~0U)
9266 optimize_implicit_const (first_id
, i
, implicit_consts
);
9268 (*abbrev_die_table
)[abbrev_id
] = die
;
9269 if (dwarf_version
>= 5)
9272 implicit_consts
.truncate (0);
9274 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
9275 switch (AT_class (a
))
9277 case dw_val_class_const
:
9278 case dw_val_class_unsigned_const
:
9279 case dw_val_class_file
:
9280 implicit_consts
.safe_push (true);
9283 implicit_consts
.safe_push (false);
9288 else if (dwarf_version
>= 5)
9290 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
9291 if (!implicit_consts
[ix
])
9295 dw_attr_node
*other_a
9296 = &(*(*abbrev_die_table
)[abbrev_id
]->die_attr
)[ix
];
9297 if (!dw_val_equal_p (&a
->dw_attr_val
,
9298 &other_a
->dw_attr_val
))
9299 implicit_consts
[ix
] = false;
9302 die
->die_abbrev
= abbrev_id
;
9304 gcc_assert (abbrev_id
== vec_safe_length (abbrev_die_table
) - 1);
9305 if (dwarf_version
>= 5 && first_id
!= ~0U)
9306 optimize_implicit_const (first_id
, i
, implicit_consts
);
9309 abbrev_opt_start
= 0;
9310 abbrev_opt_base_type_end
= 0;
9311 abbrev_usage_count
.release ();
9312 sorted_abbrev_dies
.release ();
9315 /* Return the power-of-two number of bytes necessary to represent VALUE. */
9318 constant_size (unsigned HOST_WIDE_INT value
)
9325 log
= floor_log2 (value
);
9328 log
= 1 << (floor_log2 (log
) + 1);
9333 /* Return the size of a DIE as it is represented in the
9334 .debug_info section. */
9336 static unsigned long
9337 size_of_die (dw_die_ref die
)
9339 unsigned long size
= 0;
9342 enum dwarf_form form
;
9344 size
+= size_of_uleb128 (die
->die_abbrev
);
9345 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
9347 switch (AT_class (a
))
9349 case dw_val_class_addr
:
9350 if (dwarf_split_debug_info
&& AT_index (a
) != NOT_INDEXED
)
9352 gcc_assert (AT_index (a
) != NO_INDEX_ASSIGNED
);
9353 size
+= size_of_uleb128 (AT_index (a
));
9356 size
+= DWARF2_ADDR_SIZE
;
9358 case dw_val_class_offset
:
9359 size
+= DWARF_OFFSET_SIZE
;
9361 case dw_val_class_loc
:
9363 unsigned long lsize
= size_of_locs (AT_loc (a
));
9366 if (dwarf_version
>= 4)
9367 size
+= size_of_uleb128 (lsize
);
9369 size
+= constant_size (lsize
);
9373 case dw_val_class_loc_list
:
9374 if (dwarf_split_debug_info
&& dwarf_version
>= 5)
9376 gcc_assert (AT_loc_list (a
)->num_assigned
);
9377 size
+= size_of_uleb128 (AT_loc_list (a
)->hash
);
9380 size
+= DWARF_OFFSET_SIZE
;
9382 case dw_val_class_view_list
:
9383 size
+= DWARF_OFFSET_SIZE
;
9385 case dw_val_class_range_list
:
9386 if (value_format (a
) == DW_FORM_rnglistx
)
9388 gcc_assert (rnglist_idx
);
9389 dw_ranges
*r
= &(*ranges_table
)[a
->dw_attr_val
.v
.val_offset
];
9390 size
+= size_of_uleb128 (r
->idx
);
9393 size
+= DWARF_OFFSET_SIZE
;
9395 case dw_val_class_const
:
9396 size
+= size_of_sleb128 (AT_int (a
));
9398 case dw_val_class_unsigned_const
:
9400 int csize
= constant_size (AT_unsigned (a
));
9401 if (dwarf_version
== 3
9402 && a
->dw_attr
== DW_AT_data_member_location
9404 size
+= size_of_uleb128 (AT_unsigned (a
));
9409 case dw_val_class_symview
:
9410 if (symview_upper_bound
<= 0xff)
9412 else if (symview_upper_bound
<= 0xffff)
9414 else if (symview_upper_bound
<= 0xffffffff)
9419 case dw_val_class_const_implicit
:
9420 case dw_val_class_unsigned_const_implicit
:
9421 case dw_val_class_file_implicit
:
9422 /* These occupy no size in the DIE, just an extra sleb128 in
9425 case dw_val_class_const_double
:
9426 size
+= HOST_BITS_PER_DOUBLE_INT
/ HOST_BITS_PER_CHAR
;
9427 if (HOST_BITS_PER_WIDE_INT
>= DWARF_LARGEST_DATA_FORM_BITS
)
9430 case dw_val_class_wide_int
:
9431 size
+= (get_full_len (*a
->dw_attr_val
.v
.val_wide
)
9432 * HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
);
9433 if (get_full_len (*a
->dw_attr_val
.v
.val_wide
)
9434 * HOST_BITS_PER_WIDE_INT
> DWARF_LARGEST_DATA_FORM_BITS
)
9437 case dw_val_class_vec
:
9438 size
+= constant_size (a
->dw_attr_val
.v
.val_vec
.length
9439 * a
->dw_attr_val
.v
.val_vec
.elt_size
)
9440 + a
->dw_attr_val
.v
.val_vec
.length
9441 * a
->dw_attr_val
.v
.val_vec
.elt_size
; /* block */
9443 case dw_val_class_flag
:
9444 if (dwarf_version
>= 4)
9445 /* Currently all add_AT_flag calls pass in 1 as last argument,
9446 so DW_FORM_flag_present can be used. If that ever changes,
9447 we'll need to use DW_FORM_flag and have some optimization
9448 in build_abbrev_table that will change those to
9449 DW_FORM_flag_present if it is set to 1 in all DIEs using
9450 the same abbrev entry. */
9451 gcc_assert (a
->dw_attr_val
.v
.val_flag
== 1);
9455 case dw_val_class_die_ref
:
9456 if (AT_ref_external (a
))
9458 /* In DWARF4, we use DW_FORM_ref_sig8; for earlier versions
9459 we use DW_FORM_ref_addr. In DWARF2, DW_FORM_ref_addr
9460 is sized by target address length, whereas in DWARF3
9461 it's always sized as an offset. */
9462 if (AT_ref (a
)->comdat_type_p
)
9463 size
+= DWARF_TYPE_SIGNATURE_SIZE
;
9464 else if (dwarf_version
== 2)
9465 size
+= DWARF2_ADDR_SIZE
;
9467 size
+= DWARF_OFFSET_SIZE
;
9470 size
+= DWARF_OFFSET_SIZE
;
9472 case dw_val_class_fde_ref
:
9473 size
+= DWARF_OFFSET_SIZE
;
9475 case dw_val_class_lbl_id
:
9476 if (dwarf_split_debug_info
&& AT_index (a
) != NOT_INDEXED
)
9478 gcc_assert (AT_index (a
) != NO_INDEX_ASSIGNED
);
9479 size
+= size_of_uleb128 (AT_index (a
));
9482 size
+= DWARF2_ADDR_SIZE
;
9484 case dw_val_class_lineptr
:
9485 case dw_val_class_macptr
:
9486 case dw_val_class_loclistsptr
:
9487 size
+= DWARF_OFFSET_SIZE
;
9489 case dw_val_class_str
:
9490 form
= AT_string_form (a
);
9491 if (form
== DW_FORM_strp
|| form
== DW_FORM_line_strp
)
9492 size
+= DWARF_OFFSET_SIZE
;
9493 else if (form
== dwarf_FORM (DW_FORM_strx
))
9494 size
+= size_of_uleb128 (AT_index (a
));
9496 size
+= strlen (a
->dw_attr_val
.v
.val_str
->str
) + 1;
9498 case dw_val_class_file
:
9499 size
+= constant_size (maybe_emit_file (a
->dw_attr_val
.v
.val_file
));
9501 case dw_val_class_data8
:
9504 case dw_val_class_vms_delta
:
9505 size
+= DWARF_OFFSET_SIZE
;
9507 case dw_val_class_high_pc
:
9508 size
+= DWARF2_ADDR_SIZE
;
9510 case dw_val_class_discr_value
:
9511 size
+= size_of_discr_value (&a
->dw_attr_val
.v
.val_discr_value
);
9513 case dw_val_class_discr_list
:
9515 unsigned block_size
= size_of_discr_list (AT_discr_list (a
));
9517 /* This is a block, so we have the block length and then its
9519 size
+= constant_size (block_size
) + block_size
;
9530 /* Size the debugging information associated with a given DIE. Visits the
9531 DIE's children recursively. Updates the global variable next_die_offset, on
9532 each time through. Uses the current value of next_die_offset to update the
9533 die_offset field in each DIE. */
9536 calc_die_sizes (dw_die_ref die
)
9540 gcc_assert (die
->die_offset
== 0
9541 || (unsigned long int) die
->die_offset
== next_die_offset
);
9542 die
->die_offset
= next_die_offset
;
9543 next_die_offset
+= size_of_die (die
);
9545 FOR_EACH_CHILD (die
, c
, calc_die_sizes (c
));
9547 if (die
->die_child
!= NULL
)
9548 /* Count the null byte used to terminate sibling lists. */
9549 next_die_offset
+= 1;
9552 /* Size just the base type children at the start of the CU.
9553 This is needed because build_abbrev needs to size locs
9554 and sizing of type based stack ops needs to know die_offset
9555 values for the base types. */
9558 calc_base_type_die_sizes (void)
9560 unsigned long die_offset
= (dwarf_split_debug_info
9561 ? DWARF_COMPILE_UNIT_SKELETON_HEADER_SIZE
9562 : DWARF_COMPILE_UNIT_HEADER_SIZE
);
9564 dw_die_ref base_type
;
9565 #if ENABLE_ASSERT_CHECKING
9566 dw_die_ref prev
= comp_unit_die ()->die_child
;
9569 die_offset
+= size_of_die (comp_unit_die ());
9570 for (i
= 0; base_types
.iterate (i
, &base_type
); i
++)
9572 #if ENABLE_ASSERT_CHECKING
9573 gcc_assert (base_type
->die_offset
== 0
9574 && prev
->die_sib
== base_type
9575 && base_type
->die_child
== NULL
9576 && base_type
->die_abbrev
);
9579 if (abbrev_opt_start
9580 && base_type
->die_abbrev
>= abbrev_opt_base_type_end
)
9581 abbrev_opt_base_type_end
= base_type
->die_abbrev
+ 1;
9582 base_type
->die_offset
= die_offset
;
9583 die_offset
+= size_of_die (base_type
);
9587 /* Set the marks for a die and its children. We do this so
9588 that we know whether or not a reference needs to use FORM_ref_addr; only
9589 DIEs in the same CU will be marked. We used to clear out the offset
9590 and use that as the flag, but ran into ordering problems. */
9593 mark_dies (dw_die_ref die
)
9597 gcc_assert (!die
->die_mark
);
9600 FOR_EACH_CHILD (die
, c
, mark_dies (c
));
9603 /* Clear the marks for a die and its children. */
9606 unmark_dies (dw_die_ref die
)
9610 if (! use_debug_types
)
9611 gcc_assert (die
->die_mark
);
9614 FOR_EACH_CHILD (die
, c
, unmark_dies (c
));
9617 /* Clear the marks for a die, its children and referred dies. */
9620 unmark_all_dies (dw_die_ref die
)
9630 FOR_EACH_CHILD (die
, c
, unmark_all_dies (c
));
9632 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
9633 if (AT_class (a
) == dw_val_class_die_ref
)
9634 unmark_all_dies (AT_ref (a
));
9637 /* Calculate if the entry should appear in the final output file. It may be
9638 from a pruned a type. */
9641 include_pubname_in_output (vec
<pubname_entry
, va_gc
> *table
, pubname_entry
*p
)
9643 /* By limiting gnu pubnames to definitions only, gold can generate a
9644 gdb index without entries for declarations, which don't include
9645 enough information to be useful. */
9646 if (debug_generate_pub_sections
== 2 && is_declaration_die (p
->die
))
9649 if (table
== pubname_table
)
9651 /* Enumerator names are part of the pubname table, but the
9652 parent DW_TAG_enumeration_type die may have been pruned.
9653 Don't output them if that is the case. */
9654 if (p
->die
->die_tag
== DW_TAG_enumerator
&&
9655 (p
->die
->die_parent
== NULL
9656 || !p
->die
->die_parent
->die_perennial_p
))
9659 /* Everything else in the pubname table is included. */
9663 /* The pubtypes table shouldn't include types that have been
9665 return (p
->die
->die_offset
!= 0
9666 || !flag_eliminate_unused_debug_types
);
9669 /* Return the size of the .debug_pubnames or .debug_pubtypes table
9670 generated for the compilation unit. */
9672 static unsigned long
9673 size_of_pubnames (vec
<pubname_entry
, va_gc
> *names
)
9678 int space_for_flags
= (debug_generate_pub_sections
== 2) ? 1 : 0;
9680 size
= DWARF_PUBNAMES_HEADER_SIZE
;
9681 FOR_EACH_VEC_ELT (*names
, i
, p
)
9682 if (include_pubname_in_output (names
, p
))
9683 size
+= strlen (p
->name
) + DWARF_OFFSET_SIZE
+ 1 + space_for_flags
;
9685 size
+= DWARF_OFFSET_SIZE
;
9689 /* Return the size of the information in the .debug_aranges section. */
9691 static unsigned long
9692 size_of_aranges (void)
9696 size
= DWARF_ARANGES_HEADER_SIZE
;
9698 /* Count the address/length pair for this compilation unit. */
9699 if (text_section_used
)
9700 size
+= 2 * DWARF2_ADDR_SIZE
;
9701 if (cold_text_section_used
)
9702 size
+= 2 * DWARF2_ADDR_SIZE
;
9703 if (have_multiple_function_sections
)
9708 FOR_EACH_VEC_ELT (*fde_vec
, fde_idx
, fde
)
9710 if (DECL_IGNORED_P (fde
->decl
))
9712 if (!fde
->in_std_section
)
9713 size
+= 2 * DWARF2_ADDR_SIZE
;
9714 if (fde
->dw_fde_second_begin
&& !fde
->second_in_std_section
)
9715 size
+= 2 * DWARF2_ADDR_SIZE
;
9719 /* Count the two zero words used to terminated the address range table. */
9720 size
+= 2 * DWARF2_ADDR_SIZE
;
9724 /* Select the encoding of an attribute value. */
9726 static enum dwarf_form
9727 value_format (dw_attr_node
*a
)
9729 switch (AT_class (a
))
9731 case dw_val_class_addr
:
9732 /* Only very few attributes allow DW_FORM_addr. */
9737 case DW_AT_entry_pc
:
9738 case DW_AT_trampoline
:
9739 return (AT_index (a
) == NOT_INDEXED
9740 ? DW_FORM_addr
: dwarf_FORM (DW_FORM_addrx
));
9744 switch (DWARF2_ADDR_SIZE
)
9747 return DW_FORM_data1
;
9749 return DW_FORM_data2
;
9751 return DW_FORM_data4
;
9753 return DW_FORM_data8
;
9757 case dw_val_class_loc_list
:
9758 if (dwarf_split_debug_info
9759 && dwarf_version
>= 5
9760 && AT_loc_list (a
)->num_assigned
)
9761 return DW_FORM_loclistx
;
9763 case dw_val_class_view_list
:
9764 case dw_val_class_range_list
:
9765 /* For range lists in DWARF 5, use DW_FORM_rnglistx from .debug_info.dwo
9766 but in .debug_info use DW_FORM_sec_offset, which is shorter if we
9767 care about sizes of .debug* sections in shared libraries and
9768 executables and don't take into account relocations that affect just
9769 relocatable objects - for DW_FORM_rnglistx we'd have to emit offset
9770 table in the .debug_rnglists section. */
9771 if (dwarf_split_debug_info
9772 && dwarf_version
>= 5
9773 && AT_class (a
) == dw_val_class_range_list
9775 && a
->dw_attr_val
.val_entry
!= RELOCATED_OFFSET
)
9776 return DW_FORM_rnglistx
;
9777 if (dwarf_version
>= 4)
9778 return DW_FORM_sec_offset
;
9780 case dw_val_class_vms_delta
:
9781 case dw_val_class_offset
:
9782 switch (DWARF_OFFSET_SIZE
)
9785 return DW_FORM_data4
;
9787 return DW_FORM_data8
;
9791 case dw_val_class_loc
:
9792 if (dwarf_version
>= 4)
9793 return DW_FORM_exprloc
;
9794 switch (constant_size (size_of_locs (AT_loc (a
))))
9797 return DW_FORM_block1
;
9799 return DW_FORM_block2
;
9801 return DW_FORM_block4
;
9805 case dw_val_class_const
:
9806 return DW_FORM_sdata
;
9807 case dw_val_class_unsigned_const
:
9808 switch (constant_size (AT_unsigned (a
)))
9811 return DW_FORM_data1
;
9813 return DW_FORM_data2
;
9815 /* In DWARF3 DW_AT_data_member_location with
9816 DW_FORM_data4 or DW_FORM_data8 is a loclistptr, not
9817 constant, so we need to use DW_FORM_udata if we need
9818 a large constant. */
9819 if (dwarf_version
== 3 && a
->dw_attr
== DW_AT_data_member_location
)
9820 return DW_FORM_udata
;
9821 return DW_FORM_data4
;
9823 if (dwarf_version
== 3 && a
->dw_attr
== DW_AT_data_member_location
)
9824 return DW_FORM_udata
;
9825 return DW_FORM_data8
;
9829 case dw_val_class_const_implicit
:
9830 case dw_val_class_unsigned_const_implicit
:
9831 case dw_val_class_file_implicit
:
9832 return DW_FORM_implicit_const
;
9833 case dw_val_class_const_double
:
9834 switch (HOST_BITS_PER_WIDE_INT
)
9837 return DW_FORM_data2
;
9839 return DW_FORM_data4
;
9841 return DW_FORM_data8
;
9843 if (dwarf_version
>= 5)
9844 return DW_FORM_data16
;
9847 return DW_FORM_block1
;
9849 case dw_val_class_wide_int
:
9850 switch (get_full_len (*a
->dw_attr_val
.v
.val_wide
) * HOST_BITS_PER_WIDE_INT
)
9853 return DW_FORM_data1
;
9855 return DW_FORM_data2
;
9857 return DW_FORM_data4
;
9859 return DW_FORM_data8
;
9861 if (dwarf_version
>= 5)
9862 return DW_FORM_data16
;
9865 return DW_FORM_block1
;
9867 case dw_val_class_symview
:
9868 /* ??? We might use uleb128, but then we'd have to compute
9869 .debug_info offsets in the assembler. */
9870 if (symview_upper_bound
<= 0xff)
9871 return DW_FORM_data1
;
9872 else if (symview_upper_bound
<= 0xffff)
9873 return DW_FORM_data2
;
9874 else if (symview_upper_bound
<= 0xffffffff)
9875 return DW_FORM_data4
;
9877 return DW_FORM_data8
;
9878 case dw_val_class_vec
:
9879 switch (constant_size (a
->dw_attr_val
.v
.val_vec
.length
9880 * a
->dw_attr_val
.v
.val_vec
.elt_size
))
9883 return DW_FORM_block1
;
9885 return DW_FORM_block2
;
9887 return DW_FORM_block4
;
9891 case dw_val_class_flag
:
9892 if (dwarf_version
>= 4)
9894 /* Currently all add_AT_flag calls pass in 1 as last argument,
9895 so DW_FORM_flag_present can be used. If that ever changes,
9896 we'll need to use DW_FORM_flag and have some optimization
9897 in build_abbrev_table that will change those to
9898 DW_FORM_flag_present if it is set to 1 in all DIEs using
9899 the same abbrev entry. */
9900 gcc_assert (a
->dw_attr_val
.v
.val_flag
== 1);
9901 return DW_FORM_flag_present
;
9903 return DW_FORM_flag
;
9904 case dw_val_class_die_ref
:
9905 if (AT_ref_external (a
))
9907 if (AT_ref (a
)->comdat_type_p
)
9908 return DW_FORM_ref_sig8
;
9910 return DW_FORM_ref_addr
;
9914 case dw_val_class_fde_ref
:
9915 return DW_FORM_data
;
9916 case dw_val_class_lbl_id
:
9917 return (AT_index (a
) == NOT_INDEXED
9918 ? DW_FORM_addr
: dwarf_FORM (DW_FORM_addrx
));
9919 case dw_val_class_lineptr
:
9920 case dw_val_class_macptr
:
9921 case dw_val_class_loclistsptr
:
9922 return dwarf_version
>= 4 ? DW_FORM_sec_offset
: DW_FORM_data
;
9923 case dw_val_class_str
:
9924 return AT_string_form (a
);
9925 case dw_val_class_file
:
9926 switch (constant_size (maybe_emit_file (a
->dw_attr_val
.v
.val_file
)))
9929 return DW_FORM_data1
;
9931 return DW_FORM_data2
;
9933 return DW_FORM_data4
;
9938 case dw_val_class_data8
:
9939 return DW_FORM_data8
;
9941 case dw_val_class_high_pc
:
9942 switch (DWARF2_ADDR_SIZE
)
9945 return DW_FORM_data1
;
9947 return DW_FORM_data2
;
9949 return DW_FORM_data4
;
9951 return DW_FORM_data8
;
9956 case dw_val_class_discr_value
:
9957 return (a
->dw_attr_val
.v
.val_discr_value
.pos
9960 case dw_val_class_discr_list
:
9961 switch (constant_size (size_of_discr_list (AT_discr_list (a
))))
9964 return DW_FORM_block1
;
9966 return DW_FORM_block2
;
9968 return DW_FORM_block4
;
9978 /* Output the encoding of an attribute value. */
9981 output_value_format (dw_attr_node
*a
)
9983 enum dwarf_form form
= value_format (a
);
9985 dw2_asm_output_data_uleb128 (form
, "(%s)", dwarf_form_name (form
));
9988 /* Given a die and id, produce the appropriate abbreviations. */
9991 output_die_abbrevs (unsigned long abbrev_id
, dw_die_ref abbrev
)
9994 dw_attr_node
*a_attr
;
9996 dw2_asm_output_data_uleb128 (abbrev_id
, "(abbrev code)");
9997 dw2_asm_output_data_uleb128 (abbrev
->die_tag
, "(TAG: %s)",
9998 dwarf_tag_name (abbrev
->die_tag
));
10000 if (abbrev
->die_child
!= NULL
)
10001 dw2_asm_output_data (1, DW_children_yes
, "DW_children_yes");
10003 dw2_asm_output_data (1, DW_children_no
, "DW_children_no");
10005 for (ix
= 0; vec_safe_iterate (abbrev
->die_attr
, ix
, &a_attr
); ix
++)
10007 dw2_asm_output_data_uleb128 (a_attr
->dw_attr
, "(%s)",
10008 dwarf_attr_name (a_attr
->dw_attr
));
10009 output_value_format (a_attr
);
10010 if (value_format (a_attr
) == DW_FORM_implicit_const
)
10012 if (AT_class (a_attr
) == dw_val_class_file_implicit
)
10014 int f
= maybe_emit_file (a_attr
->dw_attr_val
.v
.val_file
);
10015 const char *filename
= a_attr
->dw_attr_val
.v
.val_file
->filename
;
10016 dw2_asm_output_data_sleb128 (f
, "(%s)", filename
);
10019 dw2_asm_output_data_sleb128 (a_attr
->dw_attr_val
.v
.val_int
, NULL
);
10023 dw2_asm_output_data (1, 0, NULL
);
10024 dw2_asm_output_data (1, 0, NULL
);
10028 /* Output the .debug_abbrev section which defines the DIE abbreviation
10032 output_abbrev_section (void)
10034 unsigned int abbrev_id
;
10037 FOR_EACH_VEC_SAFE_ELT (abbrev_die_table
, abbrev_id
, abbrev
)
10038 if (abbrev_id
!= 0)
10039 output_die_abbrevs (abbrev_id
, abbrev
);
10041 /* Terminate the table. */
10042 dw2_asm_output_data (1, 0, NULL
);
10045 /* Return a new location list, given the begin and end range, and the
10048 static inline dw_loc_list_ref
10049 new_loc_list (dw_loc_descr_ref expr
, const char *begin
, var_loc_view vbegin
,
10050 const char *end
, var_loc_view vend
,
10051 const char *section
)
10053 dw_loc_list_ref retlist
= ggc_cleared_alloc
<dw_loc_list_node
> ();
10055 retlist
->begin
= begin
;
10056 retlist
->begin_entry
= NULL
;
10057 retlist
->end
= end
;
10058 retlist
->expr
= expr
;
10059 retlist
->section
= section
;
10060 retlist
->vbegin
= vbegin
;
10061 retlist
->vend
= vend
;
10066 /* Return true iff there's any nonzero view number in the loc list.
10068 ??? When views are not enabled, we'll often extend a single range
10069 to the entire function, so that we emit a single location
10070 expression rather than a location list. With views, even with a
10071 single range, we'll output a list if start or end have a nonzero
10072 view. If we change this, we may want to stop splitting a single
10073 range in dw_loc_list just because of a nonzero view, even if it
10074 straddles across hot/cold partitions. */
10077 loc_list_has_views (dw_loc_list_ref list
)
10079 if (!debug_variable_location_views
)
10082 for (dw_loc_list_ref loc
= list
;
10083 loc
!= NULL
; loc
= loc
->dw_loc_next
)
10084 if (!ZERO_VIEW_P (loc
->vbegin
) || !ZERO_VIEW_P (loc
->vend
))
10090 /* Generate a new internal symbol for this location list node, if it
10091 hasn't got one yet. */
10094 gen_llsym (dw_loc_list_ref list
)
10096 gcc_assert (!list
->ll_symbol
);
10097 list
->ll_symbol
= gen_internal_sym ("LLST");
10099 if (!loc_list_has_views (list
))
10102 if (dwarf2out_locviews_in_attribute ())
10104 /* Use the same label_num for the view list. */
10106 list
->vl_symbol
= gen_internal_sym ("LVUS");
10109 list
->vl_symbol
= list
->ll_symbol
;
10112 /* Generate a symbol for the list, but only if we really want to emit
10116 maybe_gen_llsym (dw_loc_list_ref list
)
10118 if (!list
|| (!list
->dw_loc_next
&& !loc_list_has_views (list
)))
10124 /* Determine whether or not to skip loc_list entry CURR. If SIZEP is
10125 NULL, don't consider size of the location expression. If we're not
10126 to skip it, and SIZEP is non-null, store the size of CURR->expr's
10127 representation in *SIZEP. */
10130 skip_loc_list_entry (dw_loc_list_ref curr
, unsigned long *sizep
= NULL
)
10132 /* Don't output an entry that starts and ends at the same address. */
10133 if (strcmp (curr
->begin
, curr
->end
) == 0
10134 && curr
->vbegin
== curr
->vend
&& !curr
->force
)
10140 unsigned long size
= size_of_locs (curr
->expr
);
10142 /* If the expression is too large, drop it on the floor. We could
10143 perhaps put it into DW_TAG_dwarf_procedure and refer to that
10144 in the expression, but >= 64KB expressions for a single value
10145 in a single range are unlikely very useful. */
10146 if (dwarf_version
< 5 && size
> 0xffff)
10154 /* Output a view pair loclist entry for CURR, if it requires one. */
10157 dwarf2out_maybe_output_loclist_view_pair (dw_loc_list_ref curr
)
10159 if (!dwarf2out_locviews_in_loclist ())
10162 if (ZERO_VIEW_P (curr
->vbegin
) && ZERO_VIEW_P (curr
->vend
))
10165 #ifdef DW_LLE_view_pair
10166 dw2_asm_output_data (1, DW_LLE_view_pair
, "DW_LLE_view_pair");
10168 if (dwarf2out_as_locview_support
)
10170 if (ZERO_VIEW_P (curr
->vbegin
))
10171 dw2_asm_output_data_uleb128 (0, "Location view begin");
10174 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
10175 ASM_GENERATE_INTERNAL_LABEL (label
, "LVU", curr
->vbegin
);
10176 dw2_asm_output_symname_uleb128 (label
, "Location view begin");
10179 if (ZERO_VIEW_P (curr
->vend
))
10180 dw2_asm_output_data_uleb128 (0, "Location view end");
10183 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
10184 ASM_GENERATE_INTERNAL_LABEL (label
, "LVU", curr
->vend
);
10185 dw2_asm_output_symname_uleb128 (label
, "Location view end");
10190 dw2_asm_output_data_uleb128 (curr
->vbegin
, "Location view begin");
10191 dw2_asm_output_data_uleb128 (curr
->vend
, "Location view end");
10193 #endif /* DW_LLE_view_pair */
10198 /* Output the location list given to us. */
10201 output_loc_list (dw_loc_list_ref list_head
)
10203 int vcount
= 0, lcount
= 0;
10205 if (list_head
->emitted
)
10207 list_head
->emitted
= true;
10209 if (list_head
->vl_symbol
&& dwarf2out_locviews_in_attribute ())
10211 ASM_OUTPUT_LABEL (asm_out_file
, list_head
->vl_symbol
);
10213 for (dw_loc_list_ref curr
= list_head
; curr
!= NULL
;
10214 curr
= curr
->dw_loc_next
)
10216 unsigned long size
;
10218 if (skip_loc_list_entry (curr
, &size
))
10223 /* ?? dwarf_split_debug_info? */
10224 if (dwarf2out_as_locview_support
)
10226 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
10228 if (!ZERO_VIEW_P (curr
->vbegin
))
10230 ASM_GENERATE_INTERNAL_LABEL (label
, "LVU", curr
->vbegin
);
10231 dw2_asm_output_symname_uleb128 (label
,
10232 "View list begin (%s)",
10233 list_head
->vl_symbol
);
10236 dw2_asm_output_data_uleb128 (0,
10237 "View list begin (%s)",
10238 list_head
->vl_symbol
);
10240 if (!ZERO_VIEW_P (curr
->vend
))
10242 ASM_GENERATE_INTERNAL_LABEL (label
, "LVU", curr
->vend
);
10243 dw2_asm_output_symname_uleb128 (label
,
10244 "View list end (%s)",
10245 list_head
->vl_symbol
);
10248 dw2_asm_output_data_uleb128 (0,
10249 "View list end (%s)",
10250 list_head
->vl_symbol
);
10254 dw2_asm_output_data_uleb128 (curr
->vbegin
,
10255 "View list begin (%s)",
10256 list_head
->vl_symbol
);
10257 dw2_asm_output_data_uleb128 (curr
->vend
,
10258 "View list end (%s)",
10259 list_head
->vl_symbol
);
10264 ASM_OUTPUT_LABEL (asm_out_file
, list_head
->ll_symbol
);
10266 const char *last_section
= NULL
;
10267 const char *base_label
= NULL
;
10269 /* Walk the location list, and output each range + expression. */
10270 for (dw_loc_list_ref curr
= list_head
; curr
!= NULL
;
10271 curr
= curr
->dw_loc_next
)
10273 unsigned long size
;
10275 /* Skip this entry? If we skip it here, we must skip it in the
10276 view list above as well. */
10277 if (skip_loc_list_entry (curr
, &size
))
10282 if (dwarf_version
>= 5)
10284 if (dwarf_split_debug_info
)
10286 dwarf2out_maybe_output_loclist_view_pair (curr
);
10287 /* For -gsplit-dwarf, emit DW_LLE_starx_length, which has
10288 uleb128 index into .debug_addr and uleb128 length. */
10289 dw2_asm_output_data (1, DW_LLE_startx_length
,
10290 "DW_LLE_startx_length (%s)",
10291 list_head
->ll_symbol
);
10292 dw2_asm_output_data_uleb128 (curr
->begin_entry
->index
,
10293 "Location list range start index "
10294 "(%s)", curr
->begin
);
10295 /* FIXME: This will ICE ifndef HAVE_AS_LEB128.
10296 For that case we probably need to emit DW_LLE_startx_endx,
10297 but we'd need 2 .debug_addr entries rather than just one. */
10298 dw2_asm_output_delta_uleb128 (curr
->end
, curr
->begin
,
10299 "Location list length (%s)",
10300 list_head
->ll_symbol
);
10302 else if (!have_multiple_function_sections
&& HAVE_AS_LEB128
)
10304 dwarf2out_maybe_output_loclist_view_pair (curr
);
10305 /* If all code is in .text section, the base address is
10306 already provided by the CU attributes. Use
10307 DW_LLE_offset_pair where both addresses are uleb128 encoded
10308 offsets against that base. */
10309 dw2_asm_output_data (1, DW_LLE_offset_pair
,
10310 "DW_LLE_offset_pair (%s)",
10311 list_head
->ll_symbol
);
10312 dw2_asm_output_delta_uleb128 (curr
->begin
, curr
->section
,
10313 "Location list begin address (%s)",
10314 list_head
->ll_symbol
);
10315 dw2_asm_output_delta_uleb128 (curr
->end
, curr
->section
,
10316 "Location list end address (%s)",
10317 list_head
->ll_symbol
);
10319 else if (HAVE_AS_LEB128
)
10321 /* Otherwise, find out how many consecutive entries could share
10322 the same base entry. If just one, emit DW_LLE_start_length,
10323 otherwise emit DW_LLE_base_address for the base address
10324 followed by a series of DW_LLE_offset_pair. */
10325 if (last_section
== NULL
|| curr
->section
!= last_section
)
10327 dw_loc_list_ref curr2
;
10328 for (curr2
= curr
->dw_loc_next
; curr2
!= NULL
;
10329 curr2
= curr2
->dw_loc_next
)
10331 if (strcmp (curr2
->begin
, curr2
->end
) == 0
10336 if (curr2
== NULL
|| curr
->section
!= curr2
->section
)
10337 last_section
= NULL
;
10340 last_section
= curr
->section
;
10341 base_label
= curr
->begin
;
10342 dw2_asm_output_data (1, DW_LLE_base_address
,
10343 "DW_LLE_base_address (%s)",
10344 list_head
->ll_symbol
);
10345 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, base_label
,
10346 "Base address (%s)",
10347 list_head
->ll_symbol
);
10350 /* Only one entry with the same base address. Use
10351 DW_LLE_start_length with absolute address and uleb128
10353 if (last_section
== NULL
)
10355 dwarf2out_maybe_output_loclist_view_pair (curr
);
10356 dw2_asm_output_data (1, DW_LLE_start_length
,
10357 "DW_LLE_start_length (%s)",
10358 list_head
->ll_symbol
);
10359 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, curr
->begin
,
10360 "Location list begin address (%s)",
10361 list_head
->ll_symbol
);
10362 dw2_asm_output_delta_uleb128 (curr
->end
, curr
->begin
,
10363 "Location list length "
10364 "(%s)", list_head
->ll_symbol
);
10366 /* Otherwise emit DW_LLE_offset_pair, relative to above emitted
10367 DW_LLE_base_address. */
10370 dwarf2out_maybe_output_loclist_view_pair (curr
);
10371 dw2_asm_output_data (1, DW_LLE_offset_pair
,
10372 "DW_LLE_offset_pair (%s)",
10373 list_head
->ll_symbol
);
10374 dw2_asm_output_delta_uleb128 (curr
->begin
, base_label
,
10375 "Location list begin address "
10376 "(%s)", list_head
->ll_symbol
);
10377 dw2_asm_output_delta_uleb128 (curr
->end
, base_label
,
10378 "Location list end address "
10379 "(%s)", list_head
->ll_symbol
);
10382 /* The assembler does not support .uleb128 directive. Emit
10383 DW_LLE_start_end with a pair of absolute addresses. */
10386 dwarf2out_maybe_output_loclist_view_pair (curr
);
10387 dw2_asm_output_data (1, DW_LLE_start_end
,
10388 "DW_LLE_start_end (%s)",
10389 list_head
->ll_symbol
);
10390 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, curr
->begin
,
10391 "Location list begin address (%s)",
10392 list_head
->ll_symbol
);
10393 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, curr
->end
,
10394 "Location list end address (%s)",
10395 list_head
->ll_symbol
);
10398 else if (dwarf_split_debug_info
)
10400 /* For -gsplit-dwarf -gdwarf-{2,3,4} emit index into .debug_addr
10401 and 4 byte length. */
10402 dw2_asm_output_data (1, DW_LLE_GNU_start_length_entry
,
10403 "Location list start/length entry (%s)",
10404 list_head
->ll_symbol
);
10405 dw2_asm_output_data_uleb128 (curr
->begin_entry
->index
,
10406 "Location list range start index (%s)",
10408 /* The length field is 4 bytes. If we ever need to support
10409 an 8-byte length, we can add a new DW_LLE code or fall back
10410 to DW_LLE_GNU_start_end_entry. */
10411 dw2_asm_output_delta (4, curr
->end
, curr
->begin
,
10412 "Location list range length (%s)",
10413 list_head
->ll_symbol
);
10415 else if (!have_multiple_function_sections
)
10417 /* Pair of relative addresses against start of text section. */
10418 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, curr
->begin
, curr
->section
,
10419 "Location list begin address (%s)",
10420 list_head
->ll_symbol
);
10421 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, curr
->end
, curr
->section
,
10422 "Location list end address (%s)",
10423 list_head
->ll_symbol
);
10427 /* Pair of absolute addresses. */
10428 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, curr
->begin
,
10429 "Location list begin address (%s)",
10430 list_head
->ll_symbol
);
10431 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, curr
->end
,
10432 "Location list end address (%s)",
10433 list_head
->ll_symbol
);
10436 /* Output the block length for this list of location operations. */
10437 if (dwarf_version
>= 5)
10438 dw2_asm_output_data_uleb128 (size
, "Location expression size");
10441 gcc_assert (size
<= 0xffff);
10442 dw2_asm_output_data (2, size
, "Location expression size");
10445 output_loc_sequence (curr
->expr
, -1);
10448 /* And finally list termination. */
10449 if (dwarf_version
>= 5)
10450 dw2_asm_output_data (1, DW_LLE_end_of_list
,
10451 "DW_LLE_end_of_list (%s)", list_head
->ll_symbol
);
10452 else if (dwarf_split_debug_info
)
10453 dw2_asm_output_data (1, DW_LLE_GNU_end_of_list_entry
,
10454 "Location list terminator (%s)",
10455 list_head
->ll_symbol
);
10458 dw2_asm_output_data (DWARF2_ADDR_SIZE
, 0,
10459 "Location list terminator begin (%s)",
10460 list_head
->ll_symbol
);
10461 dw2_asm_output_data (DWARF2_ADDR_SIZE
, 0,
10462 "Location list terminator end (%s)",
10463 list_head
->ll_symbol
);
10466 gcc_assert (!list_head
->vl_symbol
10467 || vcount
== lcount
* (dwarf2out_locviews_in_attribute () ? 1 : 0));
10470 /* Output a range_list offset into the .debug_ranges or .debug_rnglists
10471 section. Emit a relocated reference if val_entry is NULL, otherwise,
10472 emit an indirect reference. */
10475 output_range_list_offset (dw_attr_node
*a
)
10477 const char *name
= dwarf_attr_name (a
->dw_attr
);
10479 if (a
->dw_attr_val
.val_entry
== RELOCATED_OFFSET
)
10481 if (dwarf_version
>= 5)
10483 dw_ranges
*r
= &(*ranges_table
)[a
->dw_attr_val
.v
.val_offset
];
10484 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, r
->label
,
10485 debug_ranges_section
, "%s", name
);
10489 char *p
= strchr (ranges_section_label
, '\0');
10490 sprintf (p
, "+" HOST_WIDE_INT_PRINT_HEX
,
10491 a
->dw_attr_val
.v
.val_offset
* 2 * DWARF2_ADDR_SIZE
);
10492 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, ranges_section_label
,
10493 debug_ranges_section
, "%s", name
);
10497 else if (dwarf_version
>= 5)
10499 dw_ranges
*r
= &(*ranges_table
)[a
->dw_attr_val
.v
.val_offset
];
10500 gcc_assert (rnglist_idx
);
10501 dw2_asm_output_data_uleb128 (r
->idx
, "%s", name
);
10504 dw2_asm_output_data (DWARF_OFFSET_SIZE
,
10505 a
->dw_attr_val
.v
.val_offset
* 2 * DWARF2_ADDR_SIZE
,
10506 "%s (offset from %s)", name
, ranges_section_label
);
10509 /* Output the offset into the debug_loc section. */
10512 output_loc_list_offset (dw_attr_node
*a
)
10514 char *sym
= AT_loc_list (a
)->ll_symbol
;
10517 if (!dwarf_split_debug_info
)
10518 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, sym
, debug_loc_section
,
10519 "%s", dwarf_attr_name (a
->dw_attr
));
10520 else if (dwarf_version
>= 5)
10522 gcc_assert (AT_loc_list (a
)->num_assigned
);
10523 dw2_asm_output_data_uleb128 (AT_loc_list (a
)->hash
, "%s (%s)",
10524 dwarf_attr_name (a
->dw_attr
),
10528 dw2_asm_output_delta (DWARF_OFFSET_SIZE
, sym
, loc_section_label
,
10529 "%s", dwarf_attr_name (a
->dw_attr
));
10532 /* Output the offset into the debug_loc section. */
10535 output_view_list_offset (dw_attr_node
*a
)
10537 char *sym
= (*AT_loc_list_ptr (a
))->vl_symbol
;
10540 if (dwarf_split_debug_info
)
10541 dw2_asm_output_delta (DWARF_OFFSET_SIZE
, sym
, loc_section_label
,
10542 "%s", dwarf_attr_name (a
->dw_attr
));
10544 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, sym
, debug_loc_section
,
10545 "%s", dwarf_attr_name (a
->dw_attr
));
10548 /* Output an attribute's index or value appropriately. */
10551 output_attr_index_or_value (dw_attr_node
*a
)
10553 const char *name
= dwarf_attr_name (a
->dw_attr
);
10555 if (dwarf_split_debug_info
&& AT_index (a
) != NOT_INDEXED
)
10557 dw2_asm_output_data_uleb128 (AT_index (a
), "%s", name
);
10560 switch (AT_class (a
))
10562 case dw_val_class_addr
:
10563 dw2_asm_output_addr_rtx (DWARF2_ADDR_SIZE
, AT_addr (a
), "%s", name
);
10565 case dw_val_class_high_pc
:
10566 case dw_val_class_lbl_id
:
10567 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, AT_lbl (a
), "%s", name
);
10570 gcc_unreachable ();
10574 /* Output a type signature. */
10577 output_signature (const char *sig
, const char *name
)
10581 for (i
= 0; i
< DWARF_TYPE_SIGNATURE_SIZE
; i
++)
10582 dw2_asm_output_data (1, sig
[i
], i
== 0 ? "%s" : NULL
, name
);
10585 /* Output a discriminant value. */
10588 output_discr_value (dw_discr_value
*discr_value
, const char *name
)
10590 if (discr_value
->pos
)
10591 dw2_asm_output_data_uleb128 (discr_value
->v
.uval
, "%s", name
);
10593 dw2_asm_output_data_sleb128 (discr_value
->v
.sval
, "%s", name
);
10596 /* Output the DIE and its attributes. Called recursively to generate
10597 the definitions of each child DIE. */
10600 output_die (dw_die_ref die
)
10604 unsigned long size
;
10607 dw2_asm_output_data_uleb128 (die
->die_abbrev
, "(DIE (%#lx) %s)",
10608 (unsigned long)die
->die_offset
,
10609 dwarf_tag_name (die
->die_tag
));
10611 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
10613 const char *name
= dwarf_attr_name (a
->dw_attr
);
10615 switch (AT_class (a
))
10617 case dw_val_class_addr
:
10618 output_attr_index_or_value (a
);
10621 case dw_val_class_offset
:
10622 dw2_asm_output_data (DWARF_OFFSET_SIZE
, a
->dw_attr_val
.v
.val_offset
,
10626 case dw_val_class_range_list
:
10627 output_range_list_offset (a
);
10630 case dw_val_class_loc
:
10631 size
= size_of_locs (AT_loc (a
));
10633 /* Output the block length for this list of location operations. */
10634 if (dwarf_version
>= 4)
10635 dw2_asm_output_data_uleb128 (size
, "%s", name
);
10637 dw2_asm_output_data (constant_size (size
), size
, "%s", name
);
10639 output_loc_sequence (AT_loc (a
), -1);
10642 case dw_val_class_const
:
10643 /* ??? It would be slightly more efficient to use a scheme like is
10644 used for unsigned constants below, but gdb 4.x does not sign
10645 extend. Gdb 5.x does sign extend. */
10646 dw2_asm_output_data_sleb128 (AT_int (a
), "%s", name
);
10649 case dw_val_class_unsigned_const
:
10651 int csize
= constant_size (AT_unsigned (a
));
10652 if (dwarf_version
== 3
10653 && a
->dw_attr
== DW_AT_data_member_location
10655 dw2_asm_output_data_uleb128 (AT_unsigned (a
), "%s", name
);
10657 dw2_asm_output_data (csize
, AT_unsigned (a
), "%s", name
);
10661 case dw_val_class_symview
:
10664 if (symview_upper_bound
<= 0xff)
10666 else if (symview_upper_bound
<= 0xffff)
10668 else if (symview_upper_bound
<= 0xffffffff)
10672 dw2_asm_output_addr (vsize
, a
->dw_attr_val
.v
.val_symbolic_view
,
10677 case dw_val_class_const_implicit
:
10678 if (flag_debug_asm
)
10679 fprintf (asm_out_file
, "\t\t\t%s %s ("
10680 HOST_WIDE_INT_PRINT_DEC
")\n",
10681 ASM_COMMENT_START
, name
, AT_int (a
));
10684 case dw_val_class_unsigned_const_implicit
:
10685 if (flag_debug_asm
)
10686 fprintf (asm_out_file
, "\t\t\t%s %s ("
10687 HOST_WIDE_INT_PRINT_HEX
")\n",
10688 ASM_COMMENT_START
, name
, AT_unsigned (a
));
10691 case dw_val_class_const_double
:
10693 unsigned HOST_WIDE_INT first
, second
;
10695 if (HOST_BITS_PER_WIDE_INT
>= DWARF_LARGEST_DATA_FORM_BITS
)
10696 dw2_asm_output_data (1,
10697 HOST_BITS_PER_DOUBLE_INT
10698 / HOST_BITS_PER_CHAR
,
10701 if (WORDS_BIG_ENDIAN
)
10703 first
= a
->dw_attr_val
.v
.val_double
.high
;
10704 second
= a
->dw_attr_val
.v
.val_double
.low
;
10708 first
= a
->dw_attr_val
.v
.val_double
.low
;
10709 second
= a
->dw_attr_val
.v
.val_double
.high
;
10712 dw2_asm_output_data (HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
,
10713 first
, "%s", name
);
10714 dw2_asm_output_data (HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
,
10719 case dw_val_class_wide_int
:
10722 int len
= get_full_len (*a
->dw_attr_val
.v
.val_wide
);
10723 int l
= HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
;
10724 if (len
* HOST_BITS_PER_WIDE_INT
> DWARF_LARGEST_DATA_FORM_BITS
)
10725 dw2_asm_output_data (1, get_full_len (*a
->dw_attr_val
.v
.val_wide
)
10728 if (WORDS_BIG_ENDIAN
)
10729 for (i
= len
- 1; i
>= 0; --i
)
10731 dw2_asm_output_data (l
, a
->dw_attr_val
.v
.val_wide
->elt (i
),
10736 for (i
= 0; i
< len
; ++i
)
10738 dw2_asm_output_data (l
, a
->dw_attr_val
.v
.val_wide
->elt (i
),
10745 case dw_val_class_vec
:
10747 unsigned int elt_size
= a
->dw_attr_val
.v
.val_vec
.elt_size
;
10748 unsigned int len
= a
->dw_attr_val
.v
.val_vec
.length
;
10752 dw2_asm_output_data (constant_size (len
* elt_size
),
10753 len
* elt_size
, "%s", name
);
10754 if (elt_size
> sizeof (HOST_WIDE_INT
))
10759 for (i
= 0, p
= (unsigned char *) a
->dw_attr_val
.v
.val_vec
.array
;
10761 i
++, p
+= elt_size
)
10762 dw2_asm_output_data (elt_size
, extract_int (p
, elt_size
),
10763 "fp or vector constant word %u", i
);
10767 case dw_val_class_flag
:
10768 if (dwarf_version
>= 4)
10770 /* Currently all add_AT_flag calls pass in 1 as last argument,
10771 so DW_FORM_flag_present can be used. If that ever changes,
10772 we'll need to use DW_FORM_flag and have some optimization
10773 in build_abbrev_table that will change those to
10774 DW_FORM_flag_present if it is set to 1 in all DIEs using
10775 the same abbrev entry. */
10776 gcc_assert (AT_flag (a
) == 1);
10777 if (flag_debug_asm
)
10778 fprintf (asm_out_file
, "\t\t\t%s %s\n",
10779 ASM_COMMENT_START
, name
);
10782 dw2_asm_output_data (1, AT_flag (a
), "%s", name
);
10785 case dw_val_class_loc_list
:
10786 output_loc_list_offset (a
);
10789 case dw_val_class_view_list
:
10790 output_view_list_offset (a
);
10793 case dw_val_class_die_ref
:
10794 if (AT_ref_external (a
))
10796 if (AT_ref (a
)->comdat_type_p
)
10798 comdat_type_node
*type_node
10799 = AT_ref (a
)->die_id
.die_type_node
;
10801 gcc_assert (type_node
);
10802 output_signature (type_node
->signature
, name
);
10806 const char *sym
= AT_ref (a
)->die_id
.die_symbol
;
10810 /* In DWARF2, DW_FORM_ref_addr is sized by target address
10811 length, whereas in DWARF3 it's always sized as an
10813 if (dwarf_version
== 2)
10814 size
= DWARF2_ADDR_SIZE
;
10816 size
= DWARF_OFFSET_SIZE
;
10817 /* ??? We cannot unconditionally output die_offset if
10818 non-zero - others might create references to those
10820 And we do not clear its DIE offset after outputting it
10821 (and the label refers to the actual DIEs, not the
10822 DWARF CU unit header which is when using label + offset
10823 would be the correct thing to do).
10824 ??? This is the reason for the with_offset flag. */
10825 if (AT_ref (a
)->with_offset
)
10826 dw2_asm_output_offset (size
, sym
, AT_ref (a
)->die_offset
,
10827 debug_info_section
, "%s", name
);
10829 dw2_asm_output_offset (size
, sym
, debug_info_section
, "%s",
10835 gcc_assert (AT_ref (a
)->die_offset
);
10836 dw2_asm_output_data (DWARF_OFFSET_SIZE
, AT_ref (a
)->die_offset
,
10841 case dw_val_class_fde_ref
:
10843 char l1
[MAX_ARTIFICIAL_LABEL_BYTES
];
10845 ASM_GENERATE_INTERNAL_LABEL (l1
, FDE_LABEL
,
10846 a
->dw_attr_val
.v
.val_fde_index
* 2);
10847 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, l1
, debug_frame_section
,
10852 case dw_val_class_vms_delta
:
10853 #ifdef ASM_OUTPUT_DWARF_VMS_DELTA
10854 dw2_asm_output_vms_delta (DWARF_OFFSET_SIZE
,
10855 AT_vms_delta2 (a
), AT_vms_delta1 (a
),
10858 dw2_asm_output_delta (DWARF_OFFSET_SIZE
,
10859 AT_vms_delta2 (a
), AT_vms_delta1 (a
),
10864 case dw_val_class_lbl_id
:
10865 output_attr_index_or_value (a
);
10868 case dw_val_class_lineptr
:
10869 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, AT_lbl (a
),
10870 debug_line_section
, "%s", name
);
10873 case dw_val_class_macptr
:
10874 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, AT_lbl (a
),
10875 debug_macinfo_section
, "%s", name
);
10878 case dw_val_class_loclistsptr
:
10879 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, AT_lbl (a
),
10880 debug_loc_section
, "%s", name
);
10883 case dw_val_class_str
:
10884 if (a
->dw_attr_val
.v
.val_str
->form
== DW_FORM_strp
)
10885 dw2_asm_output_offset (DWARF_OFFSET_SIZE
,
10886 a
->dw_attr_val
.v
.val_str
->label
,
10888 "%s: \"%s\"", name
, AT_string (a
));
10889 else if (a
->dw_attr_val
.v
.val_str
->form
== DW_FORM_line_strp
)
10890 dw2_asm_output_offset (DWARF_OFFSET_SIZE
,
10891 a
->dw_attr_val
.v
.val_str
->label
,
10892 debug_line_str_section
,
10893 "%s: \"%s\"", name
, AT_string (a
));
10894 else if (a
->dw_attr_val
.v
.val_str
->form
== dwarf_FORM (DW_FORM_strx
))
10895 dw2_asm_output_data_uleb128 (AT_index (a
),
10896 "%s: \"%s\"", name
, AT_string (a
));
10898 dw2_asm_output_nstring (AT_string (a
), -1, "%s", name
);
10901 case dw_val_class_file
:
10903 int f
= maybe_emit_file (a
->dw_attr_val
.v
.val_file
);
10905 dw2_asm_output_data (constant_size (f
), f
, "%s (%s)", name
,
10906 a
->dw_attr_val
.v
.val_file
->filename
);
10910 case dw_val_class_file_implicit
:
10911 if (flag_debug_asm
)
10912 fprintf (asm_out_file
, "\t\t\t%s %s (%d, %s)\n",
10913 ASM_COMMENT_START
, name
,
10914 maybe_emit_file (a
->dw_attr_val
.v
.val_file
),
10915 a
->dw_attr_val
.v
.val_file
->filename
);
10918 case dw_val_class_data8
:
10922 for (i
= 0; i
< 8; i
++)
10923 dw2_asm_output_data (1, a
->dw_attr_val
.v
.val_data8
[i
],
10924 i
== 0 ? "%s" : NULL
, name
);
10928 case dw_val_class_high_pc
:
10929 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, AT_lbl (a
),
10930 get_AT_low_pc (die
), "DW_AT_high_pc");
10933 case dw_val_class_discr_value
:
10934 output_discr_value (&a
->dw_attr_val
.v
.val_discr_value
, name
);
10937 case dw_val_class_discr_list
:
10939 dw_discr_list_ref list
= AT_discr_list (a
);
10940 const int size
= size_of_discr_list (list
);
10942 /* This is a block, so output its length first. */
10943 dw2_asm_output_data (constant_size (size
), size
,
10944 "%s: block size", name
);
10946 for (; list
!= NULL
; list
= list
->dw_discr_next
)
10948 /* One byte for the discriminant value descriptor, and then as
10949 many LEB128 numbers as required. */
10950 if (list
->dw_discr_range
)
10951 dw2_asm_output_data (1, DW_DSC_range
,
10952 "%s: DW_DSC_range", name
);
10954 dw2_asm_output_data (1, DW_DSC_label
,
10955 "%s: DW_DSC_label", name
);
10957 output_discr_value (&list
->dw_discr_lower_bound
, name
);
10958 if (list
->dw_discr_range
)
10959 output_discr_value (&list
->dw_discr_upper_bound
, name
);
10965 gcc_unreachable ();
10969 FOR_EACH_CHILD (die
, c
, output_die (c
));
10971 /* Add null byte to terminate sibling list. */
10972 if (die
->die_child
!= NULL
)
10973 dw2_asm_output_data (1, 0, "end of children of DIE %#lx",
10974 (unsigned long) die
->die_offset
);
10977 /* Output the dwarf version number. */
10980 output_dwarf_version ()
10982 /* ??? For now, if -gdwarf-6 is specified, we output version 5 with
10983 views in loclist. That will change eventually. */
10984 if (dwarf_version
== 6)
10989 warning (0, "%<-gdwarf-6%> is output as version 5 with "
10990 "incompatibilities");
10993 dw2_asm_output_data (2, 5, "DWARF version number");
10996 dw2_asm_output_data (2, dwarf_version
, "DWARF version number");
10999 /* Output the compilation unit that appears at the beginning of the
11000 .debug_info section, and precedes the DIE descriptions. */
11003 output_compilation_unit_header (enum dwarf_unit_type ut
)
11005 if (!XCOFF_DEBUGGING_INFO
)
11007 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4)
11008 dw2_asm_output_data (4, 0xffffffff,
11009 "Initial length escape value indicating 64-bit DWARF extension");
11010 dw2_asm_output_data (DWARF_OFFSET_SIZE
,
11011 next_die_offset
- DWARF_INITIAL_LENGTH_SIZE
,
11012 "Length of Compilation Unit Info");
11015 output_dwarf_version ();
11016 if (dwarf_version
>= 5)
11021 case DW_UT_compile
: name
= "DW_UT_compile"; break;
11022 case DW_UT_type
: name
= "DW_UT_type"; break;
11023 case DW_UT_split_compile
: name
= "DW_UT_split_compile"; break;
11024 case DW_UT_split_type
: name
= "DW_UT_split_type"; break;
11025 default: gcc_unreachable ();
11027 dw2_asm_output_data (1, ut
, "%s", name
);
11028 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "Pointer Size (in bytes)");
11030 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, abbrev_section_label
,
11031 debug_abbrev_section
,
11032 "Offset Into Abbrev. Section");
11033 if (dwarf_version
< 5)
11034 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "Pointer Size (in bytes)");
11037 /* Output the compilation unit DIE and its children. */
11040 output_comp_unit (dw_die_ref die
, int output_if_empty
,
11041 const unsigned char *dwo_id
)
11043 const char *secname
, *oldsym
;
11046 /* Unless we are outputting main CU, we may throw away empty ones. */
11047 if (!output_if_empty
&& die
->die_child
== NULL
)
11050 /* Even if there are no children of this DIE, we must output the information
11051 about the compilation unit. Otherwise, on an empty translation unit, we
11052 will generate a present, but empty, .debug_info section. IRIX 6.5 `nm'
11053 will then complain when examining the file. First mark all the DIEs in
11054 this CU so we know which get local refs. */
11057 external_ref_hash_type
*extern_map
= optimize_external_refs (die
);
11059 /* For now, optimize only the main CU, in order to optimize the rest
11060 we'd need to see all of them earlier. Leave the rest for post-linking
11062 if (die
== comp_unit_die ())
11063 abbrev_opt_start
= vec_safe_length (abbrev_die_table
);
11065 build_abbrev_table (die
, extern_map
);
11067 optimize_abbrev_table ();
11071 /* Initialize the beginning DIE offset - and calculate sizes/offsets. */
11072 next_die_offset
= (dwo_id
11073 ? DWARF_COMPILE_UNIT_SKELETON_HEADER_SIZE
11074 : DWARF_COMPILE_UNIT_HEADER_SIZE
);
11075 calc_die_sizes (die
);
11077 oldsym
= die
->die_id
.die_symbol
;
11078 if (oldsym
&& die
->comdat_type_p
)
11080 tmp
= XALLOCAVEC (char, strlen (oldsym
) + 24);
11082 sprintf (tmp
, ".gnu.linkonce.wi.%s", oldsym
);
11084 die
->die_id
.die_symbol
= NULL
;
11085 switch_to_section (get_section (secname
, SECTION_DEBUG
, NULL
));
11089 switch_to_section (debug_info_section
);
11090 ASM_OUTPUT_LABEL (asm_out_file
, debug_info_section_label
);
11091 info_section_emitted
= true;
11094 /* For LTO cross unit DIE refs we want a symbol on the start of the
11095 debuginfo section, not on the CU DIE. */
11096 if ((flag_generate_lto
|| flag_generate_offload
) && oldsym
)
11098 /* ??? No way to get visibility assembled without a decl. */
11099 tree decl
= build_decl (UNKNOWN_LOCATION
, VAR_DECL
,
11100 get_identifier (oldsym
), char_type_node
);
11101 TREE_PUBLIC (decl
) = true;
11102 TREE_STATIC (decl
) = true;
11103 DECL_ARTIFICIAL (decl
) = true;
11104 DECL_VISIBILITY (decl
) = VISIBILITY_HIDDEN
;
11105 DECL_VISIBILITY_SPECIFIED (decl
) = true;
11106 targetm
.asm_out
.assemble_visibility (decl
, VISIBILITY_HIDDEN
);
11107 #ifdef ASM_WEAKEN_LABEL
11108 /* We prefer a .weak because that handles duplicates from duplicate
11109 archive members in a graceful way. */
11110 ASM_WEAKEN_LABEL (asm_out_file
, oldsym
);
11112 targetm
.asm_out
.globalize_label (asm_out_file
, oldsym
);
11114 ASM_OUTPUT_LABEL (asm_out_file
, oldsym
);
11117 /* Output debugging information. */
11118 output_compilation_unit_header (dwo_id
11119 ? DW_UT_split_compile
: DW_UT_compile
);
11120 if (dwarf_version
>= 5)
11122 if (dwo_id
!= NULL
)
11123 for (int i
= 0; i
< 8; i
++)
11124 dw2_asm_output_data (1, dwo_id
[i
], i
== 0 ? "DWO id" : NULL
);
11128 /* Leave the marks on the main CU, so we can check them in
11129 output_pubnames. */
11133 die
->die_id
.die_symbol
= oldsym
;
11137 /* Whether to generate the DWARF accelerator tables in .debug_pubnames
11138 and .debug_pubtypes. This is configured per-target, but can be
11139 overridden by the -gpubnames or -gno-pubnames options. */
11142 want_pubnames (void)
11144 if (debug_info_level
<= DINFO_LEVEL_TERSE
11145 /* Names and types go to the early debug part only. */
11148 if (debug_generate_pub_sections
!= -1)
11149 return debug_generate_pub_sections
;
11150 return targetm
.want_debug_pub_sections
;
11153 /* Add the DW_AT_GNU_pubnames and DW_AT_GNU_pubtypes attributes. */
11156 add_AT_pubnames (dw_die_ref die
)
11158 if (want_pubnames ())
11159 add_AT_flag (die
, DW_AT_GNU_pubnames
, 1);
11162 /* Add a string attribute value to a skeleton DIE. */
11165 add_skeleton_AT_string (dw_die_ref die
, enum dwarf_attribute attr_kind
,
11169 struct indirect_string_node
*node
;
11171 if (! skeleton_debug_str_hash
)
11172 skeleton_debug_str_hash
11173 = hash_table
<indirect_string_hasher
>::create_ggc (10);
11175 node
= find_AT_string_in_table (str
, skeleton_debug_str_hash
);
11176 find_string_form (node
);
11177 if (node
->form
== dwarf_FORM (DW_FORM_strx
))
11178 node
->form
= DW_FORM_strp
;
11180 attr
.dw_attr
= attr_kind
;
11181 attr
.dw_attr_val
.val_class
= dw_val_class_str
;
11182 attr
.dw_attr_val
.val_entry
= NULL
;
11183 attr
.dw_attr_val
.v
.val_str
= node
;
11184 add_dwarf_attr (die
, &attr
);
11187 /* Helper function to generate top-level dies for skeleton debug_info and
11191 add_top_level_skeleton_die_attrs (dw_die_ref die
)
11193 const char *dwo_file_name
= concat (aux_base_name
, ".dwo", NULL
);
11194 const char *comp_dir
= comp_dir_string ();
11196 add_skeleton_AT_string (die
, dwarf_AT (DW_AT_dwo_name
), dwo_file_name
);
11197 if (comp_dir
!= NULL
)
11198 add_skeleton_AT_string (die
, DW_AT_comp_dir
, comp_dir
);
11199 add_AT_pubnames (die
);
11200 if (addr_index_table
!= NULL
&& addr_index_table
->size () > 0)
11201 add_AT_lineptr (die
, dwarf_AT (DW_AT_addr_base
), debug_addr_section_label
);
11204 /* Output skeleton debug sections that point to the dwo file. */
11207 output_skeleton_debug_sections (dw_die_ref comp_unit
,
11208 const unsigned char *dwo_id
)
11210 /* These attributes will be found in the full debug_info section. */
11211 remove_AT (comp_unit
, DW_AT_producer
);
11212 remove_AT (comp_unit
, DW_AT_language
);
11214 switch_to_section (debug_skeleton_info_section
);
11215 ASM_OUTPUT_LABEL (asm_out_file
, debug_skeleton_info_section_label
);
11217 /* Produce the skeleton compilation-unit header. This one differs enough from
11218 a normal CU header that it's better not to call output_compilation_unit
11220 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4)
11221 dw2_asm_output_data (4, 0xffffffff,
11222 "Initial length escape value indicating 64-bit "
11223 "DWARF extension");
11225 dw2_asm_output_data (DWARF_OFFSET_SIZE
,
11226 DWARF_COMPILE_UNIT_SKELETON_HEADER_SIZE
11227 - DWARF_INITIAL_LENGTH_SIZE
11228 + size_of_die (comp_unit
),
11229 "Length of Compilation Unit Info");
11230 output_dwarf_version ();
11231 if (dwarf_version
>= 5)
11233 dw2_asm_output_data (1, DW_UT_skeleton
, "DW_UT_skeleton");
11234 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "Pointer Size (in bytes)");
11236 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, debug_skeleton_abbrev_section_label
,
11237 debug_skeleton_abbrev_section
,
11238 "Offset Into Abbrev. Section");
11239 if (dwarf_version
< 5)
11240 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "Pointer Size (in bytes)");
11242 for (int i
= 0; i
< 8; i
++)
11243 dw2_asm_output_data (1, dwo_id
[i
], i
== 0 ? "DWO id" : NULL
);
11245 comp_unit
->die_abbrev
= SKELETON_COMP_DIE_ABBREV
;
11246 output_die (comp_unit
);
11248 /* Build the skeleton debug_abbrev section. */
11249 switch_to_section (debug_skeleton_abbrev_section
);
11250 ASM_OUTPUT_LABEL (asm_out_file
, debug_skeleton_abbrev_section_label
);
11252 output_die_abbrevs (SKELETON_COMP_DIE_ABBREV
, comp_unit
);
11254 dw2_asm_output_data (1, 0, "end of skeleton .debug_abbrev");
11257 /* Output a comdat type unit DIE and its children. */
11260 output_comdat_type_unit (comdat_type_node
*node
,
11261 bool early_lto_debug ATTRIBUTE_UNUSED
)
11263 const char *secname
;
11266 #if defined (OBJECT_FORMAT_ELF)
11270 /* First mark all the DIEs in this CU so we know which get local refs. */
11271 mark_dies (node
->root_die
);
11273 external_ref_hash_type
*extern_map
= optimize_external_refs (node
->root_die
);
11275 build_abbrev_table (node
->root_die
, extern_map
);
11280 /* Initialize the beginning DIE offset - and calculate sizes/offsets. */
11281 next_die_offset
= DWARF_COMDAT_TYPE_UNIT_HEADER_SIZE
;
11282 calc_die_sizes (node
->root_die
);
11284 #if defined (OBJECT_FORMAT_ELF)
11285 if (dwarf_version
>= 5)
11287 if (!dwarf_split_debug_info
)
11288 secname
= early_lto_debug
? DEBUG_LTO_INFO_SECTION
: DEBUG_INFO_SECTION
;
11290 secname
= (early_lto_debug
11291 ? DEBUG_LTO_DWO_INFO_SECTION
: DEBUG_DWO_INFO_SECTION
);
11293 else if (!dwarf_split_debug_info
)
11294 secname
= early_lto_debug
? ".gnu.debuglto_.debug_types" : ".debug_types";
11296 secname
= (early_lto_debug
11297 ? ".gnu.debuglto_.debug_types.dwo" : ".debug_types.dwo");
11299 tmp
= XALLOCAVEC (char, 4 + DWARF_TYPE_SIGNATURE_SIZE
* 2);
11300 sprintf (tmp
, dwarf_version
>= 5 ? "wi." : "wt.");
11301 for (i
= 0; i
< DWARF_TYPE_SIGNATURE_SIZE
; i
++)
11302 sprintf (tmp
+ 3 + i
* 2, "%02x", node
->signature
[i
] & 0xff);
11303 comdat_key
= get_identifier (tmp
);
11304 targetm
.asm_out
.named_section (secname
,
11305 SECTION_DEBUG
| SECTION_LINKONCE
,
11308 tmp
= XALLOCAVEC (char, 18 + DWARF_TYPE_SIGNATURE_SIZE
* 2);
11309 sprintf (tmp
, (dwarf_version
>= 5
11310 ? ".gnu.linkonce.wi." : ".gnu.linkonce.wt."));
11311 for (i
= 0; i
< DWARF_TYPE_SIGNATURE_SIZE
; i
++)
11312 sprintf (tmp
+ 17 + i
* 2, "%02x", node
->signature
[i
] & 0xff);
11314 switch_to_section (get_section (secname
, SECTION_DEBUG
, NULL
));
11317 /* Output debugging information. */
11318 output_compilation_unit_header (dwarf_split_debug_info
11319 ? DW_UT_split_type
: DW_UT_type
);
11320 output_signature (node
->signature
, "Type Signature");
11321 dw2_asm_output_data (DWARF_OFFSET_SIZE
, node
->type_die
->die_offset
,
11322 "Offset to Type DIE");
11323 output_die (node
->root_die
);
11325 unmark_dies (node
->root_die
);
11328 /* Return the DWARF2/3 pubname associated with a decl. */
11330 static const char *
11331 dwarf2_name (tree decl
, int scope
)
11333 if (DECL_NAMELESS (decl
))
11335 return lang_hooks
.dwarf_name (decl
, scope
? 1 : 0);
11338 /* Add a new entry to .debug_pubnames if appropriate. */
11341 add_pubname_string (const char *str
, dw_die_ref die
)
11346 e
.name
= xstrdup (str
);
11347 vec_safe_push (pubname_table
, e
);
11351 add_pubname (tree decl
, dw_die_ref die
)
11353 if (!want_pubnames ())
11356 /* Don't add items to the table when we expect that the consumer will have
11357 just read the enclosing die. For example, if the consumer is looking at a
11358 class_member, it will either be inside the class already, or will have just
11359 looked up the class to find the member. Either way, searching the class is
11360 faster than searching the index. */
11361 if ((TREE_PUBLIC (decl
) && !class_scope_p (die
->die_parent
))
11362 || is_cu_die (die
->die_parent
) || is_namespace_die (die
->die_parent
))
11364 const char *name
= dwarf2_name (decl
, 1);
11367 add_pubname_string (name
, die
);
11371 /* Add an enumerator to the pubnames section. */
11374 add_enumerator_pubname (const char *scope_name
, dw_die_ref die
)
11378 gcc_assert (scope_name
);
11379 e
.name
= concat (scope_name
, get_AT_string (die
, DW_AT_name
), NULL
);
11381 vec_safe_push (pubname_table
, e
);
11384 /* Add a new entry to .debug_pubtypes if appropriate. */
11387 add_pubtype (tree decl
, dw_die_ref die
)
11391 if (!want_pubnames ())
11394 if ((TREE_PUBLIC (decl
)
11395 || is_cu_die (die
->die_parent
) || is_namespace_die (die
->die_parent
))
11396 && (die
->die_tag
== DW_TAG_typedef
|| COMPLETE_TYPE_P (decl
)))
11399 const char *scope_name
= "";
11400 const char *sep
= is_cxx () ? "::" : ".";
11403 scope
= TYPE_P (decl
) ? TYPE_CONTEXT (decl
) : NULL
;
11404 if (scope
&& TREE_CODE (scope
) == NAMESPACE_DECL
)
11406 scope_name
= lang_hooks
.dwarf_name (scope
, 1);
11407 if (scope_name
!= NULL
&& scope_name
[0] != '\0')
11408 scope_name
= concat (scope_name
, sep
, NULL
);
11414 name
= type_tag (decl
);
11416 name
= lang_hooks
.dwarf_name (decl
, 1);
11418 /* If we don't have a name for the type, there's no point in adding
11419 it to the table. */
11420 if (name
!= NULL
&& name
[0] != '\0')
11423 e
.name
= concat (scope_name
, name
, NULL
);
11424 vec_safe_push (pubtype_table
, e
);
11427 /* Although it might be more consistent to add the pubinfo for the
11428 enumerators as their dies are created, they should only be added if the
11429 enum type meets the criteria above. So rather than re-check the parent
11430 enum type whenever an enumerator die is created, just output them all
11431 here. This isn't protected by the name conditional because anonymous
11432 enums don't have names. */
11433 if (die
->die_tag
== DW_TAG_enumeration_type
)
11437 FOR_EACH_CHILD (die
, c
, add_enumerator_pubname (scope_name
, c
));
11442 /* Output a single entry in the pubnames table. */
11445 output_pubname (dw_offset die_offset
, pubname_entry
*entry
)
11447 dw_die_ref die
= entry
->die
;
11448 int is_static
= get_AT_flag (die
, DW_AT_external
) ? 0 : 1;
11450 dw2_asm_output_data (DWARF_OFFSET_SIZE
, die_offset
, "DIE offset");
11452 if (debug_generate_pub_sections
== 2)
11454 /* This logic follows gdb's method for determining the value of the flag
11456 uint32_t flags
= GDB_INDEX_SYMBOL_KIND_NONE
;
11457 switch (die
->die_tag
)
11459 case DW_TAG_typedef
:
11460 case DW_TAG_base_type
:
11461 case DW_TAG_subrange_type
:
11462 GDB_INDEX_SYMBOL_KIND_SET_VALUE(flags
, GDB_INDEX_SYMBOL_KIND_TYPE
);
11463 GDB_INDEX_SYMBOL_STATIC_SET_VALUE(flags
, 1);
11465 case DW_TAG_enumerator
:
11466 GDB_INDEX_SYMBOL_KIND_SET_VALUE(flags
,
11467 GDB_INDEX_SYMBOL_KIND_VARIABLE
);
11469 GDB_INDEX_SYMBOL_STATIC_SET_VALUE(flags
, 1);
11471 case DW_TAG_subprogram
:
11472 GDB_INDEX_SYMBOL_KIND_SET_VALUE(flags
,
11473 GDB_INDEX_SYMBOL_KIND_FUNCTION
);
11475 GDB_INDEX_SYMBOL_STATIC_SET_VALUE(flags
, is_static
);
11477 case DW_TAG_constant
:
11478 GDB_INDEX_SYMBOL_KIND_SET_VALUE(flags
,
11479 GDB_INDEX_SYMBOL_KIND_VARIABLE
);
11480 GDB_INDEX_SYMBOL_STATIC_SET_VALUE(flags
, is_static
);
11482 case DW_TAG_variable
:
11483 GDB_INDEX_SYMBOL_KIND_SET_VALUE(flags
,
11484 GDB_INDEX_SYMBOL_KIND_VARIABLE
);
11485 GDB_INDEX_SYMBOL_STATIC_SET_VALUE(flags
, is_static
);
11487 case DW_TAG_namespace
:
11488 case DW_TAG_imported_declaration
:
11489 GDB_INDEX_SYMBOL_KIND_SET_VALUE(flags
, GDB_INDEX_SYMBOL_KIND_TYPE
);
11491 case DW_TAG_class_type
:
11492 case DW_TAG_interface_type
:
11493 case DW_TAG_structure_type
:
11494 case DW_TAG_union_type
:
11495 case DW_TAG_enumeration_type
:
11496 GDB_INDEX_SYMBOL_KIND_SET_VALUE(flags
, GDB_INDEX_SYMBOL_KIND_TYPE
);
11498 GDB_INDEX_SYMBOL_STATIC_SET_VALUE(flags
, 1);
11501 /* An unusual tag. Leave the flag-byte empty. */
11504 dw2_asm_output_data (1, flags
>> GDB_INDEX_CU_BITSIZE
,
11505 "GDB-index flags");
11508 dw2_asm_output_nstring (entry
->name
, -1, "external name");
11512 /* Output the public names table used to speed up access to externally
11513 visible names; or the public types table used to find type definitions. */
11516 output_pubnames (vec
<pubname_entry
, va_gc
> *names
)
11519 unsigned long pubnames_length
= size_of_pubnames (names
);
11520 pubname_entry
*pub
;
11522 if (!XCOFF_DEBUGGING_INFO
)
11524 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4)
11525 dw2_asm_output_data (4, 0xffffffff,
11526 "Initial length escape value indicating 64-bit DWARF extension");
11527 dw2_asm_output_data (DWARF_OFFSET_SIZE
, pubnames_length
,
11528 "Pub Info Length");
11531 /* Version number for pubnames/pubtypes is independent of dwarf version. */
11532 dw2_asm_output_data (2, 2, "DWARF pubnames/pubtypes version");
11534 if (dwarf_split_debug_info
)
11535 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, debug_skeleton_info_section_label
,
11536 debug_skeleton_info_section
,
11537 "Offset of Compilation Unit Info");
11539 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, debug_info_section_label
,
11540 debug_info_section
,
11541 "Offset of Compilation Unit Info");
11542 dw2_asm_output_data (DWARF_OFFSET_SIZE
, next_die_offset
,
11543 "Compilation Unit Length");
11545 FOR_EACH_VEC_ELT (*names
, i
, pub
)
11547 if (include_pubname_in_output (names
, pub
))
11549 dw_offset die_offset
= pub
->die
->die_offset
;
11551 /* We shouldn't see pubnames for DIEs outside of the main CU. */
11552 if (names
== pubname_table
&& pub
->die
->die_tag
!= DW_TAG_enumerator
)
11553 gcc_assert (pub
->die
->die_mark
);
11555 /* If we're putting types in their own .debug_types sections,
11556 the .debug_pubtypes table will still point to the compile
11557 unit (not the type unit), so we want to use the offset of
11558 the skeleton DIE (if there is one). */
11559 if (pub
->die
->comdat_type_p
&& names
== pubtype_table
)
11561 comdat_type_node
*type_node
= pub
->die
->die_id
.die_type_node
;
11563 if (type_node
!= NULL
)
11564 die_offset
= (type_node
->skeleton_die
!= NULL
11565 ? type_node
->skeleton_die
->die_offset
11566 : comp_unit_die ()->die_offset
);
11569 output_pubname (die_offset
, pub
);
11573 dw2_asm_output_data (DWARF_OFFSET_SIZE
, 0, NULL
);
11576 /* Output public names and types tables if necessary. */
11579 output_pubtables (void)
11581 if (!want_pubnames () || !info_section_emitted
)
11584 switch_to_section (debug_pubnames_section
);
11585 output_pubnames (pubname_table
);
11586 /* ??? Only defined by DWARF3, but emitted by Darwin for DWARF2.
11587 It shouldn't hurt to emit it always, since pure DWARF2 consumers
11588 simply won't look for the section. */
11589 switch_to_section (debug_pubtypes_section
);
11590 output_pubnames (pubtype_table
);
11594 /* Output the information that goes into the .debug_aranges table.
11595 Namely, define the beginning and ending address range of the
11596 text section generated for this compilation unit. */
11599 output_aranges (void)
11602 unsigned long aranges_length
= size_of_aranges ();
11604 if (!XCOFF_DEBUGGING_INFO
)
11606 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4)
11607 dw2_asm_output_data (4, 0xffffffff,
11608 "Initial length escape value indicating 64-bit DWARF extension");
11609 dw2_asm_output_data (DWARF_OFFSET_SIZE
, aranges_length
,
11610 "Length of Address Ranges Info");
11613 /* Version number for aranges is still 2, even up to DWARF5. */
11614 dw2_asm_output_data (2, 2, "DWARF aranges version");
11615 if (dwarf_split_debug_info
)
11616 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, debug_skeleton_info_section_label
,
11617 debug_skeleton_info_section
,
11618 "Offset of Compilation Unit Info");
11620 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, debug_info_section_label
,
11621 debug_info_section
,
11622 "Offset of Compilation Unit Info");
11623 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "Size of Address");
11624 dw2_asm_output_data (1, 0, "Size of Segment Descriptor");
11626 /* We need to align to twice the pointer size here. */
11627 if (DWARF_ARANGES_PAD_SIZE
)
11629 /* Pad using a 2 byte words so that padding is correct for any
11631 dw2_asm_output_data (2, 0, "Pad to %d byte boundary",
11632 2 * DWARF2_ADDR_SIZE
);
11633 for (i
= 2; i
< (unsigned) DWARF_ARANGES_PAD_SIZE
; i
+= 2)
11634 dw2_asm_output_data (2, 0, NULL
);
11637 /* It is necessary not to output these entries if the sections were
11638 not used; if the sections were not used, the length will be 0 and
11639 the address may end up as 0 if the section is discarded by ld
11640 --gc-sections, leaving an invalid (0, 0) entry that can be
11641 confused with the terminator. */
11642 if (text_section_used
)
11644 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, text_section_label
, "Address");
11645 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, text_end_label
,
11646 text_section_label
, "Length");
11648 if (cold_text_section_used
)
11650 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, cold_text_section_label
,
11652 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, cold_end_label
,
11653 cold_text_section_label
, "Length");
11656 if (have_multiple_function_sections
)
11661 FOR_EACH_VEC_ELT (*fde_vec
, fde_idx
, fde
)
11663 if (DECL_IGNORED_P (fde
->decl
))
11665 if (!fde
->in_std_section
)
11667 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, fde
->dw_fde_begin
,
11669 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, fde
->dw_fde_end
,
11670 fde
->dw_fde_begin
, "Length");
11672 if (fde
->dw_fde_second_begin
&& !fde
->second_in_std_section
)
11674 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, fde
->dw_fde_second_begin
,
11676 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, fde
->dw_fde_second_end
,
11677 fde
->dw_fde_second_begin
, "Length");
11682 /* Output the terminator words. */
11683 dw2_asm_output_data (DWARF2_ADDR_SIZE
, 0, NULL
);
11684 dw2_asm_output_data (DWARF2_ADDR_SIZE
, 0, NULL
);
11687 /* Add a new entry to .debug_ranges. Return its index into
11688 ranges_table vector. */
11690 static unsigned int
11691 add_ranges_num (int num
, bool maybe_new_sec
)
11693 dw_ranges r
= { NULL
, num
, 0, maybe_new_sec
};
11694 vec_safe_push (ranges_table
, r
);
11695 return vec_safe_length (ranges_table
) - 1;
11698 /* Add a new entry to .debug_ranges corresponding to a block, or a
11699 range terminator if BLOCK is NULL. MAYBE_NEW_SEC is true if
11700 this entry might be in a different section from previous range. */
11702 static unsigned int
11703 add_ranges (const_tree block
, bool maybe_new_sec
)
11705 return add_ranges_num (block
? BLOCK_NUMBER (block
) : 0, maybe_new_sec
);
11708 /* Note that (*rnglist_table)[offset] is either a head of a rnglist
11709 chain, or middle entry of a chain that will be directly referred to. */
11712 note_rnglist_head (unsigned int offset
)
11714 if (dwarf_version
< 5 || (*ranges_table
)[offset
].label
)
11716 (*ranges_table
)[offset
].label
= gen_internal_sym ("LLRL");
11719 /* Add a new entry to .debug_ranges corresponding to a pair of labels.
11720 When using dwarf_split_debug_info, address attributes in dies destined
11721 for the final executable should be direct references--setting the
11722 parameter force_direct ensures this behavior. */
11725 add_ranges_by_labels (dw_die_ref die
, const char *begin
, const char *end
,
11726 bool *added
, bool force_direct
)
11728 unsigned int in_use
= vec_safe_length (ranges_by_label
);
11729 unsigned int offset
;
11730 dw_ranges_by_label rbl
= { begin
, end
};
11731 vec_safe_push (ranges_by_label
, rbl
);
11732 offset
= add_ranges_num (-(int)in_use
- 1, true);
11735 add_AT_range_list (die
, DW_AT_ranges
, offset
, force_direct
);
11737 note_rnglist_head (offset
);
11741 /* Emit .debug_ranges section. */
11744 output_ranges (void)
11747 static const char *const start_fmt
= "Offset %#x";
11748 const char *fmt
= start_fmt
;
11751 switch_to_section (debug_ranges_section
);
11752 ASM_OUTPUT_LABEL (asm_out_file
, ranges_section_label
);
11753 FOR_EACH_VEC_SAFE_ELT (ranges_table
, i
, r
)
11755 int block_num
= r
->num
;
11759 char blabel
[MAX_ARTIFICIAL_LABEL_BYTES
];
11760 char elabel
[MAX_ARTIFICIAL_LABEL_BYTES
];
11762 ASM_GENERATE_INTERNAL_LABEL (blabel
, BLOCK_BEGIN_LABEL
, block_num
);
11763 ASM_GENERATE_INTERNAL_LABEL (elabel
, BLOCK_END_LABEL
, block_num
);
11765 /* If all code is in the text section, then the compilation
11766 unit base address defaults to DW_AT_low_pc, which is the
11767 base of the text section. */
11768 if (!have_multiple_function_sections
)
11770 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, blabel
,
11771 text_section_label
,
11772 fmt
, i
* 2 * DWARF2_ADDR_SIZE
);
11773 dw2_asm_output_delta (DWARF2_ADDR_SIZE
, elabel
,
11774 text_section_label
, NULL
);
11777 /* Otherwise, the compilation unit base address is zero,
11778 which allows us to use absolute addresses, and not worry
11779 about whether the target supports cross-section
11783 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, blabel
,
11784 fmt
, i
* 2 * DWARF2_ADDR_SIZE
);
11785 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, elabel
, NULL
);
11791 /* Negative block_num stands for an index into ranges_by_label. */
11792 else if (block_num
< 0)
11794 int lab_idx
= - block_num
- 1;
11796 if (!have_multiple_function_sections
)
11798 gcc_unreachable ();
11800 /* If we ever use add_ranges_by_labels () for a single
11801 function section, all we have to do is to take out
11802 the #if 0 above. */
11803 dw2_asm_output_delta (DWARF2_ADDR_SIZE
,
11804 (*ranges_by_label
)[lab_idx
].begin
,
11805 text_section_label
,
11806 fmt
, i
* 2 * DWARF2_ADDR_SIZE
);
11807 dw2_asm_output_delta (DWARF2_ADDR_SIZE
,
11808 (*ranges_by_label
)[lab_idx
].end
,
11809 text_section_label
, NULL
);
11814 dw2_asm_output_addr (DWARF2_ADDR_SIZE
,
11815 (*ranges_by_label
)[lab_idx
].begin
,
11816 fmt
, i
* 2 * DWARF2_ADDR_SIZE
);
11817 dw2_asm_output_addr (DWARF2_ADDR_SIZE
,
11818 (*ranges_by_label
)[lab_idx
].end
,
11824 dw2_asm_output_data (DWARF2_ADDR_SIZE
, 0, NULL
);
11825 dw2_asm_output_data (DWARF2_ADDR_SIZE
, 0, NULL
);
11831 /* Non-zero if .debug_line_str should be used for .debug_line section
11832 strings or strings that are likely shareable with those. */
11833 #define DWARF5_USE_DEBUG_LINE_STR \
11834 (!DWARF2_INDIRECT_STRING_SUPPORT_MISSING_ON_TARGET \
11835 && (DEBUG_STR_SECTION_FLAGS & SECTION_MERGE) != 0 \
11836 /* FIXME: there is no .debug_line_str.dwo section, \
11837 for -gsplit-dwarf we should use DW_FORM_strx instead. */ \
11838 && !dwarf_split_debug_info)
11840 /* Assign .debug_rnglists indexes. */
11843 index_rnglists (void)
11848 FOR_EACH_VEC_SAFE_ELT (ranges_table
, i
, r
)
11850 r
->idx
= rnglist_idx
++;
11853 /* Emit .debug_rnglists section. */
11856 output_rnglists (unsigned generation
)
11860 char l1
[MAX_ARTIFICIAL_LABEL_BYTES
];
11861 char l2
[MAX_ARTIFICIAL_LABEL_BYTES
];
11862 char basebuf
[MAX_ARTIFICIAL_LABEL_BYTES
];
11864 switch_to_section (debug_ranges_section
);
11865 ASM_OUTPUT_LABEL (asm_out_file
, ranges_section_label
);
11866 /* There are up to 4 unique ranges labels per generation.
11867 See also init_sections_and_labels. */
11868 ASM_GENERATE_INTERNAL_LABEL (l1
, DEBUG_RANGES_SECTION_LABEL
,
11869 2 + generation
* 4);
11870 ASM_GENERATE_INTERNAL_LABEL (l2
, DEBUG_RANGES_SECTION_LABEL
,
11871 3 + generation
* 4);
11872 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4)
11873 dw2_asm_output_data (4, 0xffffffff,
11874 "Initial length escape value indicating "
11875 "64-bit DWARF extension");
11876 dw2_asm_output_delta (DWARF_OFFSET_SIZE
, l2
, l1
,
11877 "Length of Range Lists");
11878 ASM_OUTPUT_LABEL (asm_out_file
, l1
);
11879 output_dwarf_version ();
11880 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "Address Size");
11881 dw2_asm_output_data (1, 0, "Segment Size");
11882 /* Emit the offset table only for -gsplit-dwarf. If we don't care
11883 about relocation sizes and primarily care about the size of .debug*
11884 sections in linked shared libraries and executables, then
11885 the offset table plus corresponding DW_FORM_rnglistx uleb128 indexes
11886 into it are usually larger than just DW_FORM_sec_offset offsets
11887 into the .debug_rnglists section. */
11888 dw2_asm_output_data (4, dwarf_split_debug_info
? rnglist_idx
: 0,
11889 "Offset Entry Count");
11890 if (dwarf_split_debug_info
)
11892 ASM_OUTPUT_LABEL (asm_out_file
, ranges_base_label
);
11893 FOR_EACH_VEC_SAFE_ELT (ranges_table
, i
, r
)
11895 dw2_asm_output_delta (DWARF_OFFSET_SIZE
, r
->label
,
11896 ranges_base_label
, NULL
);
11899 const char *lab
= "";
11900 unsigned int len
= vec_safe_length (ranges_table
);
11901 const char *base
= NULL
;
11902 FOR_EACH_VEC_SAFE_ELT (ranges_table
, i
, r
)
11904 int block_num
= r
->num
;
11908 ASM_OUTPUT_LABEL (asm_out_file
, r
->label
);
11911 if (HAVE_AS_LEB128
&& (r
->label
|| r
->maybe_new_sec
))
11915 char blabel
[MAX_ARTIFICIAL_LABEL_BYTES
];
11916 char elabel
[MAX_ARTIFICIAL_LABEL_BYTES
];
11918 ASM_GENERATE_INTERNAL_LABEL (blabel
, BLOCK_BEGIN_LABEL
, block_num
);
11919 ASM_GENERATE_INTERNAL_LABEL (elabel
, BLOCK_END_LABEL
, block_num
);
11921 if (HAVE_AS_LEB128
)
11923 /* If all code is in the text section, then the compilation
11924 unit base address defaults to DW_AT_low_pc, which is the
11925 base of the text section. */
11926 if (!have_multiple_function_sections
)
11928 dw2_asm_output_data (1, DW_RLE_offset_pair
,
11929 "DW_RLE_offset_pair (%s)", lab
);
11930 dw2_asm_output_delta_uleb128 (blabel
, text_section_label
,
11931 "Range begin address (%s)", lab
);
11932 dw2_asm_output_delta_uleb128 (elabel
, text_section_label
,
11933 "Range end address (%s)", lab
);
11938 dw_ranges
*r2
= NULL
;
11940 r2
= &(*ranges_table
)[i
+ 1];
11943 && r2
->label
== NULL
11944 && !r2
->maybe_new_sec
)
11946 dw2_asm_output_data (1, DW_RLE_base_address
,
11947 "DW_RLE_base_address (%s)", lab
);
11948 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, blabel
,
11949 "Base address (%s)", lab
);
11950 strcpy (basebuf
, blabel
);
11956 dw2_asm_output_data (1, DW_RLE_offset_pair
,
11957 "DW_RLE_offset_pair (%s)", lab
);
11958 dw2_asm_output_delta_uleb128 (blabel
, base
,
11959 "Range begin address (%s)", lab
);
11960 dw2_asm_output_delta_uleb128 (elabel
, base
,
11961 "Range end address (%s)", lab
);
11964 dw2_asm_output_data (1, DW_RLE_start_length
,
11965 "DW_RLE_start_length (%s)", lab
);
11966 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, blabel
,
11967 "Range begin address (%s)", lab
);
11968 dw2_asm_output_delta_uleb128 (elabel
, blabel
,
11969 "Range length (%s)", lab
);
11973 dw2_asm_output_data (1, DW_RLE_start_end
,
11974 "DW_RLE_start_end (%s)", lab
);
11975 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, blabel
,
11976 "Range begin address (%s)", lab
);
11977 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, elabel
,
11978 "Range end address (%s)", lab
);
11982 /* Negative block_num stands for an index into ranges_by_label. */
11983 else if (block_num
< 0)
11985 int lab_idx
= - block_num
- 1;
11986 const char *blabel
= (*ranges_by_label
)[lab_idx
].begin
;
11987 const char *elabel
= (*ranges_by_label
)[lab_idx
].end
;
11989 if (!have_multiple_function_sections
)
11990 gcc_unreachable ();
11991 if (HAVE_AS_LEB128
)
11993 dw2_asm_output_data (1, DW_RLE_start_length
,
11994 "DW_RLE_start_length (%s)", lab
);
11995 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, blabel
,
11996 "Range begin address (%s)", lab
);
11997 dw2_asm_output_delta_uleb128 (elabel
, blabel
,
11998 "Range length (%s)", lab
);
12002 dw2_asm_output_data (1, DW_RLE_start_end
,
12003 "DW_RLE_start_end (%s)", lab
);
12004 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, blabel
,
12005 "Range begin address (%s)", lab
);
12006 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, elabel
,
12007 "Range end address (%s)", lab
);
12011 dw2_asm_output_data (1, DW_RLE_end_of_list
,
12012 "DW_RLE_end_of_list (%s)", lab
);
12014 ASM_OUTPUT_LABEL (asm_out_file
, l2
);
12017 /* Data structure containing information about input files. */
12020 const char *path
; /* Complete file name. */
12021 const char *fname
; /* File name part. */
12022 int length
; /* Length of entire string. */
12023 struct dwarf_file_data
* file_idx
; /* Index in input file table. */
12024 int dir_idx
; /* Index in directory table. */
12027 /* Data structure containing information about directories with source
12031 const char *path
; /* Path including directory name. */
12032 int length
; /* Path length. */
12033 int prefix
; /* Index of directory entry which is a prefix. */
12034 int count
; /* Number of files in this directory. */
12035 int dir_idx
; /* Index of directory used as base. */
12038 /* Callback function for file_info comparison. We sort by looking at
12039 the directories in the path. */
12042 file_info_cmp (const void *p1
, const void *p2
)
12044 const struct file_info
*const s1
= (const struct file_info
*) p1
;
12045 const struct file_info
*const s2
= (const struct file_info
*) p2
;
12046 const unsigned char *cp1
;
12047 const unsigned char *cp2
;
12049 /* Take care of file names without directories. We need to make sure that
12050 we return consistent values to qsort since some will get confused if
12051 we return the same value when identical operands are passed in opposite
12052 orders. So if neither has a directory, return 0 and otherwise return
12053 1 or -1 depending on which one has the directory. We want the one with
12054 the directory to sort after the one without, so all no directory files
12055 are at the start (normally only the compilation unit file). */
12056 if ((s1
->path
== s1
->fname
|| s2
->path
== s2
->fname
))
12057 return (s2
->path
== s2
->fname
) - (s1
->path
== s1
->fname
);
12059 cp1
= (const unsigned char *) s1
->path
;
12060 cp2
= (const unsigned char *) s2
->path
;
12066 /* Reached the end of the first path? If so, handle like above,
12067 but now we want longer directory prefixes before shorter ones. */
12068 if ((cp1
== (const unsigned char *) s1
->fname
)
12069 || (cp2
== (const unsigned char *) s2
->fname
))
12070 return ((cp1
== (const unsigned char *) s1
->fname
)
12071 - (cp2
== (const unsigned char *) s2
->fname
));
12073 /* Character of current path component the same? */
12074 else if (*cp1
!= *cp2
)
12075 return *cp1
- *cp2
;
12079 struct file_name_acquire_data
12081 struct file_info
*files
;
12086 /* Traversal function for the hash table. */
12089 file_name_acquire (dwarf_file_data
**slot
, file_name_acquire_data
*fnad
)
12091 struct dwarf_file_data
*d
= *slot
;
12092 struct file_info
*fi
;
12095 gcc_assert (fnad
->max_files
>= d
->emitted_number
);
12097 if (! d
->emitted_number
)
12100 gcc_assert (fnad
->max_files
!= fnad
->used_files
);
12102 fi
= fnad
->files
+ fnad
->used_files
++;
12104 /* Skip all leading "./". */
12106 while (f
[0] == '.' && IS_DIR_SEPARATOR (f
[1]))
12109 /* Create a new array entry. */
12111 fi
->length
= strlen (f
);
12114 /* Search for the file name part. */
12115 f
= strrchr (f
, DIR_SEPARATOR
);
12116 #if defined (DIR_SEPARATOR_2)
12118 char *g
= strrchr (fi
->path
, DIR_SEPARATOR_2
);
12122 if (f
== NULL
|| f
< g
)
12128 fi
->fname
= f
== NULL
? fi
->path
: f
+ 1;
12132 /* Helper function for output_file_names. Emit a FORM encoded
12133 string STR, with assembly comment start ENTRY_KIND and
12137 output_line_string (enum dwarf_form form
, const char *str
,
12138 const char *entry_kind
, unsigned int idx
)
12142 case DW_FORM_string
:
12143 dw2_asm_output_nstring (str
, -1, "%s: %#x", entry_kind
, idx
);
12145 case DW_FORM_line_strp
:
12146 if (!debug_line_str_hash
)
12147 debug_line_str_hash
12148 = hash_table
<indirect_string_hasher
>::create_ggc (10);
12150 struct indirect_string_node
*node
;
12151 node
= find_AT_string_in_table (str
, debug_line_str_hash
);
12152 set_indirect_string (node
);
12154 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, node
->label
,
12155 debug_line_str_section
, "%s: %#x: \"%s\"",
12156 entry_kind
, 0, node
->str
);
12159 gcc_unreachable ();
12163 /* Output the directory table and the file name table. We try to minimize
12164 the total amount of memory needed. A heuristic is used to avoid large
12165 slowdowns with many input files. */
12168 output_file_names (void)
12170 struct file_name_acquire_data fnad
;
12172 struct file_info
*files
;
12173 struct dir_info
*dirs
;
12181 if (!last_emitted_file
)
12183 if (dwarf_version
>= 5)
12185 dw2_asm_output_data (1, 0, "Directory entry format count");
12186 dw2_asm_output_data_uleb128 (0, "Directories count");
12187 dw2_asm_output_data (1, 0, "File name entry format count");
12188 dw2_asm_output_data_uleb128 (0, "File names count");
12192 dw2_asm_output_data (1, 0, "End directory table");
12193 dw2_asm_output_data (1, 0, "End file name table");
12198 numfiles
= last_emitted_file
->emitted_number
;
12200 /* Allocate the various arrays we need. */
12201 files
= XALLOCAVEC (struct file_info
, numfiles
);
12202 dirs
= XALLOCAVEC (struct dir_info
, numfiles
);
12204 fnad
.files
= files
;
12205 fnad
.used_files
= 0;
12206 fnad
.max_files
= numfiles
;
12207 file_table
->traverse
<file_name_acquire_data
*, file_name_acquire
> (&fnad
);
12208 gcc_assert (fnad
.used_files
== fnad
.max_files
);
12210 qsort (files
, numfiles
, sizeof (files
[0]), file_info_cmp
);
12212 /* Find all the different directories used. */
12213 dirs
[0].path
= files
[0].path
;
12214 dirs
[0].length
= files
[0].fname
- files
[0].path
;
12215 dirs
[0].prefix
= -1;
12217 dirs
[0].dir_idx
= 0;
12218 files
[0].dir_idx
= 0;
12221 for (i
= 1; i
< numfiles
; i
++)
12222 if (files
[i
].fname
- files
[i
].path
== dirs
[ndirs
- 1].length
12223 && memcmp (dirs
[ndirs
- 1].path
, files
[i
].path
,
12224 dirs
[ndirs
- 1].length
) == 0)
12226 /* Same directory as last entry. */
12227 files
[i
].dir_idx
= ndirs
- 1;
12228 ++dirs
[ndirs
- 1].count
;
12234 /* This is a new directory. */
12235 dirs
[ndirs
].path
= files
[i
].path
;
12236 dirs
[ndirs
].length
= files
[i
].fname
- files
[i
].path
;
12237 dirs
[ndirs
].count
= 1;
12238 dirs
[ndirs
].dir_idx
= ndirs
;
12239 files
[i
].dir_idx
= ndirs
;
12241 /* Search for a prefix. */
12242 dirs
[ndirs
].prefix
= -1;
12243 for (j
= 0; j
< ndirs
; j
++)
12244 if (dirs
[j
].length
< dirs
[ndirs
].length
12245 && dirs
[j
].length
> 1
12246 && (dirs
[ndirs
].prefix
== -1
12247 || dirs
[j
].length
> dirs
[dirs
[ndirs
].prefix
].length
)
12248 && memcmp (dirs
[j
].path
, dirs
[ndirs
].path
, dirs
[j
].length
) == 0)
12249 dirs
[ndirs
].prefix
= j
;
12254 /* Now to the actual work. We have to find a subset of the directories which
12255 allow expressing the file name using references to the directory table
12256 with the least amount of characters. We do not do an exhaustive search
12257 where we would have to check out every combination of every single
12258 possible prefix. Instead we use a heuristic which provides nearly optimal
12259 results in most cases and never is much off. */
12260 saved
= XALLOCAVEC (int, ndirs
);
12261 savehere
= XALLOCAVEC (int, ndirs
);
12263 memset (saved
, '\0', ndirs
* sizeof (saved
[0]));
12264 for (i
= 0; i
< ndirs
; i
++)
12269 /* We can always save some space for the current directory. But this
12270 does not mean it will be enough to justify adding the directory. */
12271 savehere
[i
] = dirs
[i
].length
;
12272 total
= (savehere
[i
] - saved
[i
]) * dirs
[i
].count
;
12274 for (j
= i
+ 1; j
< ndirs
; j
++)
12277 if (saved
[j
] < dirs
[i
].length
)
12279 /* Determine whether the dirs[i] path is a prefix of the
12283 k
= dirs
[j
].prefix
;
12284 while (k
!= -1 && k
!= (int) i
)
12285 k
= dirs
[k
].prefix
;
12289 /* Yes it is. We can possibly save some memory by
12290 writing the filenames in dirs[j] relative to
12292 savehere
[j
] = dirs
[i
].length
;
12293 total
+= (savehere
[j
] - saved
[j
]) * dirs
[j
].count
;
12298 /* Check whether we can save enough to justify adding the dirs[i]
12300 if (total
> dirs
[i
].length
+ 1)
12302 /* It's worthwhile adding. */
12303 for (j
= i
; j
< ndirs
; j
++)
12304 if (savehere
[j
] > 0)
12306 /* Remember how much we saved for this directory so far. */
12307 saved
[j
] = savehere
[j
];
12309 /* Remember the prefix directory. */
12310 dirs
[j
].dir_idx
= i
;
12315 /* Emit the directory name table. */
12316 idx_offset
= dirs
[0].length
> 0 ? 1 : 0;
12317 enum dwarf_form str_form
= DW_FORM_string
;
12318 enum dwarf_form idx_form
= DW_FORM_udata
;
12319 if (dwarf_version
>= 5)
12321 const char *comp_dir
= comp_dir_string ();
12322 if (comp_dir
== NULL
)
12324 dw2_asm_output_data (1, 1, "Directory entry format count");
12325 if (DWARF5_USE_DEBUG_LINE_STR
)
12326 str_form
= DW_FORM_line_strp
;
12327 dw2_asm_output_data_uleb128 (DW_LNCT_path
, "DW_LNCT_path");
12328 dw2_asm_output_data_uleb128 (str_form
, "%s",
12329 get_DW_FORM_name (str_form
));
12330 dw2_asm_output_data_uleb128 (ndirs
+ idx_offset
, "Directories count");
12331 if (str_form
== DW_FORM_string
)
12333 dw2_asm_output_nstring (comp_dir
, -1, "Directory Entry: %#x", 0);
12334 for (i
= 1 - idx_offset
; i
< ndirs
; i
++)
12335 dw2_asm_output_nstring (dirs
[i
].path
,
12337 - !DWARF2_DIR_SHOULD_END_WITH_SEPARATOR
,
12338 "Directory Entry: %#x", i
+ idx_offset
);
12342 output_line_string (str_form
, comp_dir
, "Directory Entry", 0);
12343 for (i
= 1 - idx_offset
; i
< ndirs
; i
++)
12346 = ggc_alloc_string (dirs
[i
].path
,
12348 - !DWARF2_DIR_SHOULD_END_WITH_SEPARATOR
);
12349 output_line_string (str_form
, str
, "Directory Entry",
12350 (unsigned) i
+ idx_offset
);
12356 for (i
= 1 - idx_offset
; i
< ndirs
; i
++)
12357 dw2_asm_output_nstring (dirs
[i
].path
,
12359 - !DWARF2_DIR_SHOULD_END_WITH_SEPARATOR
,
12360 "Directory Entry: %#x", i
+ idx_offset
);
12362 dw2_asm_output_data (1, 0, "End directory table");
12365 /* We have to emit them in the order of emitted_number since that's
12366 used in the debug info generation. To do this efficiently we
12367 generate a back-mapping of the indices first. */
12368 backmap
= XALLOCAVEC (int, numfiles
);
12369 for (i
= 0; i
< numfiles
; i
++)
12370 backmap
[files
[i
].file_idx
->emitted_number
- 1] = i
;
12372 if (dwarf_version
>= 5)
12374 const char *filename0
= get_AT_string (comp_unit_die (), DW_AT_name
);
12375 if (filename0
== NULL
)
12377 /* DW_LNCT_directory_index can use DW_FORM_udata, DW_FORM_data1 and
12378 DW_FORM_data2. Choose one based on the number of directories
12379 and how much space would they occupy in each encoding.
12380 If we have at most 256 directories, all indexes fit into
12381 a single byte, so DW_FORM_data1 is most compact (if there
12382 are at most 128 directories, DW_FORM_udata would be as
12383 compact as that, but not shorter and slower to decode). */
12384 if (ndirs
+ idx_offset
<= 256)
12385 idx_form
= DW_FORM_data1
;
12386 /* If there are more than 65536 directories, we have to use
12387 DW_FORM_udata, DW_FORM_data2 can't refer to them.
12388 Otherwise, compute what space would occupy if all the indexes
12389 used DW_FORM_udata - sum - and compare that to how large would
12390 be DW_FORM_data2 encoding, and pick the more efficient one. */
12391 else if (ndirs
+ idx_offset
<= 65536)
12393 unsigned HOST_WIDE_INT sum
= 1;
12394 for (i
= 0; i
< numfiles
; i
++)
12396 int file_idx
= backmap
[i
];
12397 int dir_idx
= dirs
[files
[file_idx
].dir_idx
].dir_idx
;
12398 sum
+= size_of_uleb128 (dir_idx
);
12400 if (sum
>= HOST_WIDE_INT_UC (2) * (numfiles
+ 1))
12401 idx_form
= DW_FORM_data2
;
12403 #ifdef VMS_DEBUGGING_INFO
12404 dw2_asm_output_data (1, 4, "File name entry format count");
12406 dw2_asm_output_data (1, 2, "File name entry format count");
12408 dw2_asm_output_data_uleb128 (DW_LNCT_path
, "DW_LNCT_path");
12409 dw2_asm_output_data_uleb128 (str_form
, "%s",
12410 get_DW_FORM_name (str_form
));
12411 dw2_asm_output_data_uleb128 (DW_LNCT_directory_index
,
12412 "DW_LNCT_directory_index");
12413 dw2_asm_output_data_uleb128 (idx_form
, "%s",
12414 get_DW_FORM_name (idx_form
));
12415 #ifdef VMS_DEBUGGING_INFO
12416 dw2_asm_output_data_uleb128 (DW_LNCT_timestamp
, "DW_LNCT_timestamp");
12417 dw2_asm_output_data_uleb128 (DW_FORM_udata
, "DW_FORM_udata");
12418 dw2_asm_output_data_uleb128 (DW_LNCT_size
, "DW_LNCT_size");
12419 dw2_asm_output_data_uleb128 (DW_FORM_udata
, "DW_FORM_udata");
12421 dw2_asm_output_data_uleb128 (numfiles
+ 1, "File names count");
12423 output_line_string (str_form
, filename0
, "File Entry", 0);
12425 /* Include directory index. */
12426 if (idx_form
!= DW_FORM_udata
)
12427 dw2_asm_output_data (idx_form
== DW_FORM_data1
? 1 : 2,
12430 dw2_asm_output_data_uleb128 (0, NULL
);
12432 #ifdef VMS_DEBUGGING_INFO
12433 dw2_asm_output_data_uleb128 (0, NULL
);
12434 dw2_asm_output_data_uleb128 (0, NULL
);
12438 /* Now write all the file names. */
12439 for (i
= 0; i
< numfiles
; i
++)
12441 int file_idx
= backmap
[i
];
12442 int dir_idx
= dirs
[files
[file_idx
].dir_idx
].dir_idx
;
12444 #ifdef VMS_DEBUGGING_INFO
12445 #define MAX_VMS_VERSION_LEN 6 /* ";32768" */
12447 /* Setting these fields can lead to debugger miscomparisons,
12448 but VMS Debug requires them to be set correctly. */
12453 int maxfilelen
= (strlen (files
[file_idx
].path
)
12454 + dirs
[dir_idx
].length
12455 + MAX_VMS_VERSION_LEN
+ 1);
12456 char *filebuf
= XALLOCAVEC (char, maxfilelen
);
12458 vms_file_stats_name (files
[file_idx
].path
, 0, 0, 0, &ver
);
12459 snprintf (filebuf
, maxfilelen
, "%s;%d",
12460 files
[file_idx
].path
+ dirs
[dir_idx
].length
, ver
);
12462 output_line_string (str_form
, filebuf
, "File Entry", (unsigned) i
+ 1);
12464 /* Include directory index. */
12465 if (dwarf_version
>= 5 && idx_form
!= DW_FORM_udata
)
12466 dw2_asm_output_data (idx_form
== DW_FORM_data1
? 1 : 2,
12467 dir_idx
+ idx_offset
, NULL
);
12469 dw2_asm_output_data_uleb128 (dir_idx
+ idx_offset
, NULL
);
12471 /* Modification time. */
12472 dw2_asm_output_data_uleb128 ((vms_file_stats_name (files
[file_idx
].path
,
12473 &cdt
, 0, 0, 0) == 0)
12476 /* File length in bytes. */
12477 dw2_asm_output_data_uleb128 ((vms_file_stats_name (files
[file_idx
].path
,
12478 0, &siz
, 0, 0) == 0)
12481 output_line_string (str_form
,
12482 files
[file_idx
].path
+ dirs
[dir_idx
].length
,
12483 "File Entry", (unsigned) i
+ 1);
12485 /* Include directory index. */
12486 if (dwarf_version
>= 5 && idx_form
!= DW_FORM_udata
)
12487 dw2_asm_output_data (idx_form
== DW_FORM_data1
? 1 : 2,
12488 dir_idx
+ idx_offset
, NULL
);
12490 dw2_asm_output_data_uleb128 (dir_idx
+ idx_offset
, NULL
);
12492 if (dwarf_version
>= 5)
12495 /* Modification time. */
12496 dw2_asm_output_data_uleb128 (0, NULL
);
12498 /* File length in bytes. */
12499 dw2_asm_output_data_uleb128 (0, NULL
);
12500 #endif /* VMS_DEBUGGING_INFO */
12503 if (dwarf_version
< 5)
12504 dw2_asm_output_data (1, 0, "End file name table");
12508 /* Output one line number table into the .debug_line section. */
12511 output_one_line_info_table (dw_line_info_table
*table
)
12513 char line_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
12514 unsigned int current_line
= 1;
12515 bool current_is_stmt
= DWARF_LINE_DEFAULT_IS_STMT_START
;
12516 dw_line_info_entry
*ent
, *prev_addr
;
12522 FOR_EACH_VEC_SAFE_ELT (table
->entries
, i
, ent
)
12524 switch (ent
->opcode
)
12526 case LI_set_address
:
12527 /* ??? Unfortunately, we have little choice here currently, and
12528 must always use the most general form. GCC does not know the
12529 address delta itself, so we can't use DW_LNS_advance_pc. Many
12530 ports do have length attributes which will give an upper bound
12531 on the address range. We could perhaps use length attributes
12532 to determine when it is safe to use DW_LNS_fixed_advance_pc. */
12533 ASM_GENERATE_INTERNAL_LABEL (line_label
, LINE_CODE_LABEL
, ent
->val
);
12537 /* This can handle any delta. This takes
12538 4+DWARF2_ADDR_SIZE bytes. */
12539 dw2_asm_output_data (1, 0, "set address %s%s", line_label
,
12540 debug_variable_location_views
12541 ? ", reset view to 0" : "");
12542 dw2_asm_output_data_uleb128 (1 + DWARF2_ADDR_SIZE
, NULL
);
12543 dw2_asm_output_data (1, DW_LNE_set_address
, NULL
);
12544 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, line_label
, NULL
);
12549 case LI_adv_address
:
12551 ASM_GENERATE_INTERNAL_LABEL (line_label
, LINE_CODE_LABEL
, ent
->val
);
12552 char prev_label
[MAX_ARTIFICIAL_LABEL_BYTES
];
12553 ASM_GENERATE_INTERNAL_LABEL (prev_label
, LINE_CODE_LABEL
, prev_addr
->val
);
12557 dw2_asm_output_data (1, DW_LNS_fixed_advance_pc
, "fixed advance PC, increment view to %i", view
);
12558 dw2_asm_output_delta (2, line_label
, prev_label
,
12559 "from %s to %s", prev_label
, line_label
);
12566 if (ent
->val
== current_line
)
12568 /* We still need to start a new row, so output a copy insn. */
12569 dw2_asm_output_data (1, DW_LNS_copy
,
12570 "copy line %u", current_line
);
12574 int line_offset
= ent
->val
- current_line
;
12575 int line_delta
= line_offset
- DWARF_LINE_BASE
;
12577 current_line
= ent
->val
;
12578 if (line_delta
>= 0 && line_delta
< (DWARF_LINE_RANGE
- 1))
12580 /* This can handle deltas from -10 to 234, using the current
12581 definitions of DWARF_LINE_BASE and DWARF_LINE_RANGE.
12582 This takes 1 byte. */
12583 dw2_asm_output_data (1, DWARF_LINE_OPCODE_BASE
+ line_delta
,
12584 "line %u", current_line
);
12588 /* This can handle any delta. This takes at least 4 bytes,
12589 depending on the value being encoded. */
12590 dw2_asm_output_data (1, DW_LNS_advance_line
,
12591 "advance to line %u", current_line
);
12592 dw2_asm_output_data_sleb128 (line_offset
, NULL
);
12593 dw2_asm_output_data (1, DW_LNS_copy
, NULL
);
12599 dw2_asm_output_data (1, DW_LNS_set_file
, "set file %u", ent
->val
);
12600 dw2_asm_output_data_uleb128 (ent
->val
, "%u", ent
->val
);
12603 case LI_set_column
:
12604 dw2_asm_output_data (1, DW_LNS_set_column
, "column %u", ent
->val
);
12605 dw2_asm_output_data_uleb128 (ent
->val
, "%u", ent
->val
);
12608 case LI_negate_stmt
:
12609 current_is_stmt
= !current_is_stmt
;
12610 dw2_asm_output_data (1, DW_LNS_negate_stmt
,
12611 "is_stmt %d", current_is_stmt
);
12614 case LI_set_prologue_end
:
12615 dw2_asm_output_data (1, DW_LNS_set_prologue_end
,
12616 "set prologue end");
12619 case LI_set_epilogue_begin
:
12620 dw2_asm_output_data (1, DW_LNS_set_epilogue_begin
,
12621 "set epilogue begin");
12624 case LI_set_discriminator
:
12625 dw2_asm_output_data (1, 0, "discriminator %u", ent
->val
);
12626 dw2_asm_output_data_uleb128 (1 + size_of_uleb128 (ent
->val
), NULL
);
12627 dw2_asm_output_data (1, DW_LNE_set_discriminator
, NULL
);
12628 dw2_asm_output_data_uleb128 (ent
->val
, NULL
);
12633 /* Emit debug info for the address of the end of the table. */
12634 dw2_asm_output_data (1, 0, "set address %s", table
->end_label
);
12635 dw2_asm_output_data_uleb128 (1 + DWARF2_ADDR_SIZE
, NULL
);
12636 dw2_asm_output_data (1, DW_LNE_set_address
, NULL
);
12637 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, table
->end_label
, NULL
);
12639 dw2_asm_output_data (1, 0, "end sequence");
12640 dw2_asm_output_data_uleb128 (1, NULL
);
12641 dw2_asm_output_data (1, DW_LNE_end_sequence
, NULL
);
12644 /* Output the source line number correspondence information. This
12645 information goes into the .debug_line section. */
12648 output_line_info (bool prologue_only
)
12650 static unsigned int generation
;
12651 char l1
[MAX_ARTIFICIAL_LABEL_BYTES
], l2
[MAX_ARTIFICIAL_LABEL_BYTES
];
12652 char p1
[MAX_ARTIFICIAL_LABEL_BYTES
], p2
[MAX_ARTIFICIAL_LABEL_BYTES
];
12653 bool saw_one
= false;
12656 ASM_GENERATE_INTERNAL_LABEL (l1
, LINE_NUMBER_BEGIN_LABEL
, generation
);
12657 ASM_GENERATE_INTERNAL_LABEL (l2
, LINE_NUMBER_END_LABEL
, generation
);
12658 ASM_GENERATE_INTERNAL_LABEL (p1
, LN_PROLOG_AS_LABEL
, generation
);
12659 ASM_GENERATE_INTERNAL_LABEL (p2
, LN_PROLOG_END_LABEL
, generation
++);
12661 if (!XCOFF_DEBUGGING_INFO
)
12663 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4)
12664 dw2_asm_output_data (4, 0xffffffff,
12665 "Initial length escape value indicating 64-bit DWARF extension");
12666 dw2_asm_output_delta (DWARF_OFFSET_SIZE
, l2
, l1
,
12667 "Length of Source Line Info");
12670 ASM_OUTPUT_LABEL (asm_out_file
, l1
);
12672 output_dwarf_version ();
12673 if (dwarf_version
>= 5)
12675 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "Address Size");
12676 dw2_asm_output_data (1, 0, "Segment Size");
12678 dw2_asm_output_delta (DWARF_OFFSET_SIZE
, p2
, p1
, "Prolog Length");
12679 ASM_OUTPUT_LABEL (asm_out_file
, p1
);
12681 /* Define the architecture-dependent minimum instruction length (in bytes).
12682 In this implementation of DWARF, this field is used for information
12683 purposes only. Since GCC generates assembly language, we have no
12684 a priori knowledge of how many instruction bytes are generated for each
12685 source line, and therefore can use only the DW_LNE_set_address and
12686 DW_LNS_fixed_advance_pc line information commands. Accordingly, we fix
12687 this as '1', which is "correct enough" for all architectures,
12688 and don't let the target override. */
12689 dw2_asm_output_data (1, 1, "Minimum Instruction Length");
12691 if (dwarf_version
>= 4)
12692 dw2_asm_output_data (1, DWARF_LINE_DEFAULT_MAX_OPS_PER_INSN
,
12693 "Maximum Operations Per Instruction");
12694 dw2_asm_output_data (1, DWARF_LINE_DEFAULT_IS_STMT_START
,
12695 "Default is_stmt_start flag");
12696 dw2_asm_output_data (1, DWARF_LINE_BASE
,
12697 "Line Base Value (Special Opcodes)");
12698 dw2_asm_output_data (1, DWARF_LINE_RANGE
,
12699 "Line Range Value (Special Opcodes)");
12700 dw2_asm_output_data (1, DWARF_LINE_OPCODE_BASE
,
12701 "Special Opcode Base");
12703 for (opc
= 1; opc
< DWARF_LINE_OPCODE_BASE
; opc
++)
12708 case DW_LNS_advance_pc
:
12709 case DW_LNS_advance_line
:
12710 case DW_LNS_set_file
:
12711 case DW_LNS_set_column
:
12712 case DW_LNS_fixed_advance_pc
:
12713 case DW_LNS_set_isa
:
12721 dw2_asm_output_data (1, n_op_args
, "opcode: %#x has %d args",
12725 /* Write out the information about the files we use. */
12726 output_file_names ();
12727 ASM_OUTPUT_LABEL (asm_out_file
, p2
);
12730 /* Output the marker for the end of the line number info. */
12731 ASM_OUTPUT_LABEL (asm_out_file
, l2
);
12735 if (separate_line_info
)
12737 dw_line_info_table
*table
;
12740 FOR_EACH_VEC_ELT (*separate_line_info
, i
, table
)
12743 output_one_line_info_table (table
);
12747 if (cold_text_section_line_info
&& cold_text_section_line_info
->in_use
)
12749 output_one_line_info_table (cold_text_section_line_info
);
12753 /* ??? Some Darwin linkers crash on a .debug_line section with no
12754 sequences. Further, merely a DW_LNE_end_sequence entry is not
12755 sufficient -- the address column must also be initialized.
12756 Make sure to output at least one set_address/end_sequence pair,
12757 choosing .text since that section is always present. */
12758 if (text_section_line_info
->in_use
|| !saw_one
)
12759 output_one_line_info_table (text_section_line_info
);
12761 /* Output the marker for the end of the line number info. */
12762 ASM_OUTPUT_LABEL (asm_out_file
, l2
);
12765 /* Return true if DW_AT_endianity should be emitted according to REVERSE. */
12768 need_endianity_attribute_p (bool reverse
)
12770 return reverse
&& (dwarf_version
>= 3 || !dwarf_strict
);
12773 /* Given a pointer to a tree node for some base type, return a pointer to
12774 a DIE that describes the given type. REVERSE is true if the type is
12775 to be interpreted in the reverse storage order wrt the target order.
12777 This routine must only be called for GCC type nodes that correspond to
12778 Dwarf base (fundamental) types. */
12781 base_type_die (tree type
, bool reverse
)
12783 dw_die_ref base_type_result
;
12784 enum dwarf_type encoding
;
12785 bool fpt_used
= false;
12786 struct fixed_point_type_info fpt_info
;
12787 tree type_bias
= NULL_TREE
;
12789 /* If this is a subtype that should not be emitted as a subrange type,
12790 use the base type. See subrange_type_for_debug_p. */
12791 if (TREE_CODE (type
) == INTEGER_TYPE
&& TREE_TYPE (type
) != NULL_TREE
)
12792 type
= TREE_TYPE (type
);
12794 switch (TREE_CODE (type
))
12797 if ((dwarf_version
>= 4 || !dwarf_strict
)
12798 && TYPE_NAME (type
)
12799 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
12800 && DECL_IS_BUILTIN (TYPE_NAME (type
))
12801 && DECL_NAME (TYPE_NAME (type
)))
12803 const char *name
= IDENTIFIER_POINTER (DECL_NAME (TYPE_NAME (type
)));
12804 if (strcmp (name
, "char16_t") == 0
12805 || strcmp (name
, "char32_t") == 0)
12807 encoding
= DW_ATE_UTF
;
12811 if ((dwarf_version
>= 3 || !dwarf_strict
)
12812 && lang_hooks
.types
.get_fixed_point_type_info
)
12814 memset (&fpt_info
, 0, sizeof (fpt_info
));
12815 if (lang_hooks
.types
.get_fixed_point_type_info (type
, &fpt_info
))
12818 encoding
= ((TYPE_UNSIGNED (type
))
12819 ? DW_ATE_unsigned_fixed
12820 : DW_ATE_signed_fixed
);
12824 if (TYPE_STRING_FLAG (type
))
12826 if (TYPE_UNSIGNED (type
))
12827 encoding
= DW_ATE_unsigned_char
;
12829 encoding
= DW_ATE_signed_char
;
12831 else if (TYPE_UNSIGNED (type
))
12832 encoding
= DW_ATE_unsigned
;
12834 encoding
= DW_ATE_signed
;
12837 && lang_hooks
.types
.get_type_bias
)
12838 type_bias
= lang_hooks
.types
.get_type_bias (type
);
12842 if (DECIMAL_FLOAT_MODE_P (TYPE_MODE (type
)))
12844 if (dwarf_version
>= 3 || !dwarf_strict
)
12845 encoding
= DW_ATE_decimal_float
;
12847 encoding
= DW_ATE_lo_user
;
12850 encoding
= DW_ATE_float
;
12853 case FIXED_POINT_TYPE
:
12854 if (!(dwarf_version
>= 3 || !dwarf_strict
))
12855 encoding
= DW_ATE_lo_user
;
12856 else if (TYPE_UNSIGNED (type
))
12857 encoding
= DW_ATE_unsigned_fixed
;
12859 encoding
= DW_ATE_signed_fixed
;
12862 /* Dwarf2 doesn't know anything about complex ints, so use
12863 a user defined type for it. */
12865 if (TREE_CODE (TREE_TYPE (type
)) == REAL_TYPE
)
12866 encoding
= DW_ATE_complex_float
;
12868 encoding
= DW_ATE_lo_user
;
12872 /* GNU FORTRAN/Ada/C++ BOOLEAN type. */
12873 encoding
= DW_ATE_boolean
;
12877 /* No other TREE_CODEs are Dwarf fundamental types. */
12878 gcc_unreachable ();
12881 base_type_result
= new_die_raw (DW_TAG_base_type
);
12883 add_AT_unsigned (base_type_result
, DW_AT_byte_size
,
12884 int_size_in_bytes (type
));
12885 add_AT_unsigned (base_type_result
, DW_AT_encoding
, encoding
);
12887 if (need_endianity_attribute_p (reverse
))
12888 add_AT_unsigned (base_type_result
, DW_AT_endianity
,
12889 BYTES_BIG_ENDIAN
? DW_END_little
: DW_END_big
);
12891 add_alignment_attribute (base_type_result
, type
);
12895 switch (fpt_info
.scale_factor_kind
)
12897 case fixed_point_scale_factor_binary
:
12898 add_AT_int (base_type_result
, DW_AT_binary_scale
,
12899 fpt_info
.scale_factor
.binary
);
12902 case fixed_point_scale_factor_decimal
:
12903 add_AT_int (base_type_result
, DW_AT_decimal_scale
,
12904 fpt_info
.scale_factor
.decimal
);
12907 case fixed_point_scale_factor_arbitrary
:
12908 /* Arbitrary scale factors cannot be described in standard DWARF,
12912 /* Describe the scale factor as a rational constant. */
12913 const dw_die_ref scale_factor
12914 = new_die (DW_TAG_constant
, comp_unit_die (), type
);
12916 add_AT_unsigned (scale_factor
, DW_AT_GNU_numerator
,
12917 fpt_info
.scale_factor
.arbitrary
.numerator
);
12918 add_AT_int (scale_factor
, DW_AT_GNU_denominator
,
12919 fpt_info
.scale_factor
.arbitrary
.denominator
);
12921 add_AT_die_ref (base_type_result
, DW_AT_small
, scale_factor
);
12926 gcc_unreachable ();
12931 add_scalar_info (base_type_result
, DW_AT_GNU_bias
, type_bias
,
12932 dw_scalar_form_constant
12933 | dw_scalar_form_exprloc
12934 | dw_scalar_form_reference
,
12937 return base_type_result
;
12940 /* A C++ function with deduced return type can have a TEMPLATE_TYPE_PARM
12941 named 'auto' in its type: return true for it, false otherwise. */
12944 is_cxx_auto (tree type
)
12948 tree name
= TYPE_IDENTIFIER (type
);
12949 if (name
== get_identifier ("auto")
12950 || name
== get_identifier ("decltype(auto)"))
12956 /* Given a pointer to an arbitrary ..._TYPE tree node, return nonzero if the
12957 given input type is a Dwarf "fundamental" type. Otherwise return null. */
12960 is_base_type (tree type
)
12962 switch (TREE_CODE (type
))
12966 case FIXED_POINT_TYPE
:
12975 case QUAL_UNION_TYPE
:
12976 case ENUMERAL_TYPE
:
12977 case FUNCTION_TYPE
:
12980 case REFERENCE_TYPE
:
12988 if (is_cxx_auto (type
))
12990 gcc_unreachable ();
12996 /* Given a pointer to a tree node, assumed to be some kind of a ..._TYPE
12997 node, return the size in bits for the type if it is a constant, or else
12998 return the alignment for the type if the type's size is not constant, or
12999 else return BITS_PER_WORD if the type actually turns out to be an
13000 ERROR_MARK node. */
13002 static inline unsigned HOST_WIDE_INT
13003 simple_type_size_in_bits (const_tree type
)
13005 if (TREE_CODE (type
) == ERROR_MARK
)
13006 return BITS_PER_WORD
;
13007 else if (TYPE_SIZE (type
) == NULL_TREE
)
13009 else if (tree_fits_uhwi_p (TYPE_SIZE (type
)))
13010 return tree_to_uhwi (TYPE_SIZE (type
));
13012 return TYPE_ALIGN (type
);
13015 /* Similarly, but return an offset_int instead of UHWI. */
13017 static inline offset_int
13018 offset_int_type_size_in_bits (const_tree type
)
13020 if (TREE_CODE (type
) == ERROR_MARK
)
13021 return BITS_PER_WORD
;
13022 else if (TYPE_SIZE (type
) == NULL_TREE
)
13024 else if (TREE_CODE (TYPE_SIZE (type
)) == INTEGER_CST
)
13025 return wi::to_offset (TYPE_SIZE (type
));
13027 return TYPE_ALIGN (type
);
13030 /* Given a pointer to a tree node for a subrange type, return a pointer
13031 to a DIE that describes the given type. */
13034 subrange_type_die (tree type
, tree low
, tree high
, tree bias
,
13035 dw_die_ref context_die
)
13037 dw_die_ref subrange_die
;
13038 const HOST_WIDE_INT size_in_bytes
= int_size_in_bytes (type
);
13040 if (context_die
== NULL
)
13041 context_die
= comp_unit_die ();
13043 subrange_die
= new_die (DW_TAG_subrange_type
, context_die
, type
);
13045 if (int_size_in_bytes (TREE_TYPE (type
)) != size_in_bytes
)
13047 /* The size of the subrange type and its base type do not match,
13048 so we need to generate a size attribute for the subrange type. */
13049 add_AT_unsigned (subrange_die
, DW_AT_byte_size
, size_in_bytes
);
13052 add_alignment_attribute (subrange_die
, type
);
13055 add_bound_info (subrange_die
, DW_AT_lower_bound
, low
, NULL
);
13057 add_bound_info (subrange_die
, DW_AT_upper_bound
, high
, NULL
);
13058 if (bias
&& !dwarf_strict
)
13059 add_scalar_info (subrange_die
, DW_AT_GNU_bias
, bias
,
13060 dw_scalar_form_constant
13061 | dw_scalar_form_exprloc
13062 | dw_scalar_form_reference
,
13065 return subrange_die
;
13068 /* Returns the (const and/or volatile) cv_qualifiers associated with
13069 the decl node. This will normally be augmented with the
13070 cv_qualifiers of the underlying type in add_type_attribute. */
13073 decl_quals (const_tree decl
)
13075 return ((TREE_READONLY (decl
)
13076 /* The C++ front-end correctly marks reference-typed
13077 variables as readonly, but from a language (and debug
13078 info) standpoint they are not const-qualified. */
13079 && TREE_CODE (TREE_TYPE (decl
)) != REFERENCE_TYPE
13080 ? TYPE_QUAL_CONST
: TYPE_UNQUALIFIED
)
13081 | (TREE_THIS_VOLATILE (decl
)
13082 ? TYPE_QUAL_VOLATILE
: TYPE_UNQUALIFIED
));
13085 /* Determine the TYPE whose qualifiers match the largest strict subset
13086 of the given TYPE_QUALS, and return its qualifiers. Ignore all
13087 qualifiers outside QUAL_MASK. */
13090 get_nearest_type_subqualifiers (tree type
, int type_quals
, int qual_mask
)
13093 int best_rank
= 0, best_qual
= 0, max_rank
;
13095 type_quals
&= qual_mask
;
13096 max_rank
= popcount_hwi (type_quals
) - 1;
13098 for (t
= TYPE_MAIN_VARIANT (type
); t
&& best_rank
< max_rank
;
13099 t
= TYPE_NEXT_VARIANT (t
))
13101 int q
= TYPE_QUALS (t
) & qual_mask
;
13103 if ((q
& type_quals
) == q
&& q
!= type_quals
13104 && check_base_type (t
, type
))
13106 int rank
= popcount_hwi (q
);
13108 if (rank
> best_rank
)
13119 struct dwarf_qual_info_t
{ int q
; enum dwarf_tag t
; };
13120 static const dwarf_qual_info_t dwarf_qual_info
[] =
13122 { TYPE_QUAL_CONST
, DW_TAG_const_type
},
13123 { TYPE_QUAL_VOLATILE
, DW_TAG_volatile_type
},
13124 { TYPE_QUAL_RESTRICT
, DW_TAG_restrict_type
},
13125 { TYPE_QUAL_ATOMIC
, DW_TAG_atomic_type
}
13127 static const unsigned int dwarf_qual_info_size
13128 = sizeof (dwarf_qual_info
) / sizeof (dwarf_qual_info
[0]);
13130 /* If DIE is a qualified DIE of some base DIE with the same parent,
13131 return the base DIE, otherwise return NULL. Set MASK to the
13132 qualifiers added compared to the returned DIE. */
13135 qualified_die_p (dw_die_ref die
, int *mask
, unsigned int depth
)
13138 for (i
= 0; i
< dwarf_qual_info_size
; i
++)
13139 if (die
->die_tag
== dwarf_qual_info
[i
].t
)
13141 if (i
== dwarf_qual_info_size
)
13143 if (vec_safe_length (die
->die_attr
) != 1)
13145 dw_die_ref type
= get_AT_ref (die
, DW_AT_type
);
13146 if (type
== NULL
|| type
->die_parent
!= die
->die_parent
)
13148 *mask
|= dwarf_qual_info
[i
].q
;
13151 dw_die_ref ret
= qualified_die_p (type
, mask
, depth
- 1);
13158 /* Given a pointer to an arbitrary ..._TYPE tree node, return a debugging
13159 entry that chains the modifiers specified by CV_QUALS in front of the
13160 given type. REVERSE is true if the type is to be interpreted in the
13161 reverse storage order wrt the target order. */
13164 modified_type_die (tree type
, int cv_quals
, bool reverse
,
13165 dw_die_ref context_die
)
13167 enum tree_code code
= TREE_CODE (type
);
13168 dw_die_ref mod_type_die
;
13169 dw_die_ref sub_die
= NULL
;
13170 tree item_type
= NULL
;
13171 tree qualified_type
;
13172 tree name
, low
, high
;
13173 dw_die_ref mod_scope
;
13174 /* Only these cv-qualifiers are currently handled. */
13175 const int cv_qual_mask
= (TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
13176 | TYPE_QUAL_RESTRICT
| TYPE_QUAL_ATOMIC
|
13177 ENCODE_QUAL_ADDR_SPACE(~0U));
13178 const bool reverse_base_type
13179 = need_endianity_attribute_p (reverse
) && is_base_type (type
);
13181 if (code
== ERROR_MARK
)
13184 if (lang_hooks
.types
.get_debug_type
)
13186 tree debug_type
= lang_hooks
.types
.get_debug_type (type
);
13188 if (debug_type
!= NULL_TREE
&& debug_type
!= type
)
13189 return modified_type_die (debug_type
, cv_quals
, reverse
, context_die
);
13192 cv_quals
&= cv_qual_mask
;
13194 /* Don't emit DW_TAG_restrict_type for DWARFv2, since it is a type
13195 tag modifier (and not an attribute) old consumers won't be able
13197 if (dwarf_version
< 3)
13198 cv_quals
&= ~TYPE_QUAL_RESTRICT
;
13200 /* Likewise for DW_TAG_atomic_type for DWARFv5. */
13201 if (dwarf_version
< 5)
13202 cv_quals
&= ~TYPE_QUAL_ATOMIC
;
13204 /* See if we already have the appropriately qualified variant of
13206 qualified_type
= get_qualified_type (type
, cv_quals
);
13208 if (qualified_type
== sizetype
)
13210 /* Try not to expose the internal sizetype type's name. */
13211 if (TYPE_NAME (qualified_type
)
13212 && TREE_CODE (TYPE_NAME (qualified_type
)) == TYPE_DECL
)
13214 tree t
= TREE_TYPE (TYPE_NAME (qualified_type
));
13216 gcc_checking_assert (TREE_CODE (t
) == INTEGER_TYPE
13217 && (TYPE_PRECISION (t
)
13218 == TYPE_PRECISION (qualified_type
))
13219 && (TYPE_UNSIGNED (t
)
13220 == TYPE_UNSIGNED (qualified_type
)));
13221 qualified_type
= t
;
13223 else if (qualified_type
== sizetype
13224 && TREE_CODE (sizetype
) == TREE_CODE (size_type_node
)
13225 && TYPE_PRECISION (sizetype
) == TYPE_PRECISION (size_type_node
)
13226 && TYPE_UNSIGNED (sizetype
) == TYPE_UNSIGNED (size_type_node
))
13227 qualified_type
= size_type_node
;
13228 if (type
== sizetype
)
13229 type
= qualified_type
;
13232 /* If we do, then we can just use its DIE, if it exists. */
13233 if (qualified_type
)
13235 mod_type_die
= lookup_type_die (qualified_type
);
13237 /* DW_AT_endianity doesn't come from a qualifier on the type, so it is
13238 dealt with specially: the DIE with the attribute, if it exists, is
13239 placed immediately after the regular DIE for the same base type. */
13241 && (!reverse_base_type
13242 || ((mod_type_die
= mod_type_die
->die_sib
) != NULL
13243 && get_AT_unsigned (mod_type_die
, DW_AT_endianity
))))
13244 return mod_type_die
;
13247 name
= qualified_type
? TYPE_NAME (qualified_type
) : NULL
;
13249 /* Handle C typedef types. */
13251 && TREE_CODE (name
) == TYPE_DECL
13252 && DECL_ORIGINAL_TYPE (name
)
13253 && !DECL_ARTIFICIAL (name
))
13255 tree dtype
= TREE_TYPE (name
);
13257 /* Skip the typedef for base types with DW_AT_endianity, no big deal. */
13258 if (qualified_type
== dtype
&& !reverse_base_type
)
13260 tree origin
= decl_ultimate_origin (name
);
13262 /* Typedef variants that have an abstract origin don't get their own
13263 type DIE (see gen_typedef_die), so fall back on the ultimate
13264 abstract origin instead. */
13265 if (origin
!= NULL
&& origin
!= name
)
13266 return modified_type_die (TREE_TYPE (origin
), cv_quals
, reverse
,
13269 /* For a named type, use the typedef. */
13270 gen_type_die (qualified_type
, context_die
);
13271 return lookup_type_die (qualified_type
);
13275 int dquals
= TYPE_QUALS_NO_ADDR_SPACE (dtype
);
13276 dquals
&= cv_qual_mask
;
13277 if ((dquals
& ~cv_quals
) != TYPE_UNQUALIFIED
13278 || (cv_quals
== dquals
&& DECL_ORIGINAL_TYPE (name
) != type
))
13279 /* cv-unqualified version of named type. Just use
13280 the unnamed type to which it refers. */
13281 return modified_type_die (DECL_ORIGINAL_TYPE (name
), cv_quals
,
13282 reverse
, context_die
);
13283 /* Else cv-qualified version of named type; fall through. */
13287 mod_scope
= scope_die_for (type
, context_die
);
13291 int sub_quals
= 0, first_quals
= 0;
13293 dw_die_ref first
= NULL
, last
= NULL
;
13295 /* Determine a lesser qualified type that most closely matches
13296 this one. Then generate DW_TAG_* entries for the remaining
13298 sub_quals
= get_nearest_type_subqualifiers (type
, cv_quals
,
13300 if (sub_quals
&& use_debug_types
)
13302 bool needed
= false;
13303 /* If emitting type units, make sure the order of qualifiers
13304 is canonical. Thus, start from unqualified type if
13305 an earlier qualifier is missing in sub_quals, but some later
13306 one is present there. */
13307 for (i
= 0; i
< dwarf_qual_info_size
; i
++)
13308 if (dwarf_qual_info
[i
].q
& cv_quals
& ~sub_quals
)
13310 else if (needed
&& (dwarf_qual_info
[i
].q
& cv_quals
))
13316 mod_type_die
= modified_type_die (type
, sub_quals
, reverse
, context_die
);
13317 if (mod_scope
&& mod_type_die
&& mod_type_die
->die_parent
== mod_scope
)
13319 /* As not all intermediate qualified DIEs have corresponding
13320 tree types, ensure that qualified DIEs in the same scope
13321 as their DW_AT_type are emitted after their DW_AT_type,
13322 only with other qualified DIEs for the same type possibly
13323 in between them. Determine the range of such qualified
13324 DIEs now (first being the base type, last being corresponding
13325 last qualified DIE for it). */
13326 unsigned int count
= 0;
13327 first
= qualified_die_p (mod_type_die
, &first_quals
,
13328 dwarf_qual_info_size
);
13330 first
= mod_type_die
;
13331 gcc_assert ((first_quals
& ~sub_quals
) == 0);
13332 for (count
= 0, last
= first
;
13333 count
< (1U << dwarf_qual_info_size
);
13334 count
++, last
= last
->die_sib
)
13337 if (last
== mod_scope
->die_child
)
13339 if (qualified_die_p (last
->die_sib
, &quals
, dwarf_qual_info_size
)
13345 for (i
= 0; i
< dwarf_qual_info_size
; i
++)
13346 if (dwarf_qual_info
[i
].q
& cv_quals
& ~sub_quals
)
13349 if (first
&& first
!= last
)
13351 for (d
= first
->die_sib
; ; d
= d
->die_sib
)
13354 qualified_die_p (d
, &quals
, dwarf_qual_info_size
);
13355 if (quals
== (first_quals
| dwarf_qual_info
[i
].q
))
13371 d
= new_die_raw (dwarf_qual_info
[i
].t
);
13372 add_child_die_after (mod_scope
, d
, last
);
13376 d
= new_die (dwarf_qual_info
[i
].t
, mod_scope
, type
);
13378 add_AT_die_ref (d
, DW_AT_type
, mod_type_die
);
13380 first_quals
|= dwarf_qual_info
[i
].q
;
13383 else if (code
== POINTER_TYPE
|| code
== REFERENCE_TYPE
)
13385 dwarf_tag tag
= DW_TAG_pointer_type
;
13386 if (code
== REFERENCE_TYPE
)
13388 if (TYPE_REF_IS_RVALUE (type
) && dwarf_version
>= 4)
13389 tag
= DW_TAG_rvalue_reference_type
;
13391 tag
= DW_TAG_reference_type
;
13393 mod_type_die
= new_die (tag
, mod_scope
, type
);
13395 add_AT_unsigned (mod_type_die
, DW_AT_byte_size
,
13396 simple_type_size_in_bits (type
) / BITS_PER_UNIT
);
13397 add_alignment_attribute (mod_type_die
, type
);
13398 item_type
= TREE_TYPE (type
);
13400 addr_space_t as
= TYPE_ADDR_SPACE (item_type
);
13401 if (!ADDR_SPACE_GENERIC_P (as
))
13403 int action
= targetm
.addr_space
.debug (as
);
13406 /* Positive values indicate an address_class. */
13407 add_AT_unsigned (mod_type_die
, DW_AT_address_class
, action
);
13411 /* Negative values indicate an (inverted) segment base reg. */
13413 = one_reg_loc_descriptor (~action
, VAR_INIT_STATUS_INITIALIZED
);
13414 add_AT_loc (mod_type_die
, DW_AT_segment
, d
);
13418 else if (code
== INTEGER_TYPE
13419 && TREE_TYPE (type
) != NULL_TREE
13420 && subrange_type_for_debug_p (type
, &low
, &high
))
13422 tree bias
= NULL_TREE
;
13423 if (lang_hooks
.types
.get_type_bias
)
13424 bias
= lang_hooks
.types
.get_type_bias (type
);
13425 mod_type_die
= subrange_type_die (type
, low
, high
, bias
, context_die
);
13426 item_type
= TREE_TYPE (type
);
13428 else if (is_base_type (type
))
13430 mod_type_die
= base_type_die (type
, reverse
);
13432 /* The DIE with DW_AT_endianity is placed right after the naked DIE. */
13433 if (reverse_base_type
)
13435 dw_die_ref after_die
13436 = modified_type_die (type
, cv_quals
, false, context_die
);
13437 add_child_die_after (comp_unit_die (), mod_type_die
, after_die
);
13440 add_child_die (comp_unit_die (), mod_type_die
);
13442 add_pubtype (type
, mod_type_die
);
13446 gen_type_die (type
, context_die
);
13448 /* We have to get the type_main_variant here (and pass that to the
13449 `lookup_type_die' routine) because the ..._TYPE node we have
13450 might simply be a *copy* of some original type node (where the
13451 copy was created to help us keep track of typedef names) and
13452 that copy might have a different TYPE_UID from the original
13454 if (TREE_CODE (type
) == FUNCTION_TYPE
13455 || TREE_CODE (type
) == METHOD_TYPE
)
13457 /* For function/method types, can't just use type_main_variant here,
13458 because that can have different ref-qualifiers for C++,
13459 but try to canonicalize. */
13460 tree main
= TYPE_MAIN_VARIANT (type
);
13461 for (tree t
= main
; t
; t
= TYPE_NEXT_VARIANT (t
))
13462 if (TYPE_QUALS_NO_ADDR_SPACE (t
) == 0
13463 && check_base_type (t
, main
)
13464 && check_lang_type (t
, type
))
13465 return lookup_type_die (t
);
13466 return lookup_type_die (type
);
13468 else if (TREE_CODE (type
) != VECTOR_TYPE
13469 && TREE_CODE (type
) != ARRAY_TYPE
)
13470 return lookup_type_die (type_main_variant (type
));
13472 /* Vectors have the debugging information in the type,
13473 not the main variant. */
13474 return lookup_type_die (type
);
13477 /* Builtin types don't have a DECL_ORIGINAL_TYPE. For those,
13478 don't output a DW_TAG_typedef, since there isn't one in the
13479 user's program; just attach a DW_AT_name to the type.
13480 Don't attach a DW_AT_name to DW_TAG_const_type or DW_TAG_volatile_type
13481 if the base type already has the same name. */
13483 && ((TREE_CODE (name
) != TYPE_DECL
13484 && (qualified_type
== TYPE_MAIN_VARIANT (type
)
13485 || (cv_quals
== TYPE_UNQUALIFIED
)))
13486 || (TREE_CODE (name
) == TYPE_DECL
13487 && TREE_TYPE (name
) == qualified_type
13488 && DECL_NAME (name
))))
13490 if (TREE_CODE (name
) == TYPE_DECL
)
13491 /* Could just call add_name_and_src_coords_attributes here,
13492 but since this is a builtin type it doesn't have any
13493 useful source coordinates anyway. */
13494 name
= DECL_NAME (name
);
13495 add_name_attribute (mod_type_die
, IDENTIFIER_POINTER (name
));
13497 /* This probably indicates a bug. */
13498 else if (mod_type_die
&& mod_type_die
->die_tag
== DW_TAG_base_type
)
13500 name
= TYPE_IDENTIFIER (type
);
13501 add_name_attribute (mod_type_die
,
13502 name
? IDENTIFIER_POINTER (name
) : "__unknown__");
13505 if (qualified_type
&& !reverse_base_type
)
13506 equate_type_number_to_die (qualified_type
, mod_type_die
);
13509 /* We must do this after the equate_type_number_to_die call, in case
13510 this is a recursive type. This ensures that the modified_type_die
13511 recursion will terminate even if the type is recursive. Recursive
13512 types are possible in Ada. */
13513 sub_die
= modified_type_die (item_type
,
13514 TYPE_QUALS_NO_ADDR_SPACE (item_type
),
13518 if (sub_die
!= NULL
)
13519 add_AT_die_ref (mod_type_die
, DW_AT_type
, sub_die
);
13521 add_gnat_descriptive_type_attribute (mod_type_die
, type
, context_die
);
13522 if (TYPE_ARTIFICIAL (type
))
13523 add_AT_flag (mod_type_die
, DW_AT_artificial
, 1);
13525 return mod_type_die
;
13528 /* Generate DIEs for the generic parameters of T.
13529 T must be either a generic type or a generic function.
13530 See http://gcc.gnu.org/wiki/TemplateParmsDwarf for more. */
13533 gen_generic_params_dies (tree t
)
13537 dw_die_ref die
= NULL
;
13540 if (!t
|| (TYPE_P (t
) && !COMPLETE_TYPE_P (t
)))
13544 die
= lookup_type_die (t
);
13545 else if (DECL_P (t
))
13546 die
= lookup_decl_die (t
);
13550 parms
= lang_hooks
.get_innermost_generic_parms (t
);
13552 /* T has no generic parameter. It means T is neither a generic type
13553 or function. End of story. */
13556 parms_num
= TREE_VEC_LENGTH (parms
);
13557 args
= lang_hooks
.get_innermost_generic_args (t
);
13558 if (TREE_CHAIN (args
) && TREE_CODE (TREE_CHAIN (args
)) == INTEGER_CST
)
13559 non_default
= int_cst_value (TREE_CHAIN (args
));
13561 non_default
= TREE_VEC_LENGTH (args
);
13562 for (i
= 0; i
< parms_num
; i
++)
13564 tree parm
, arg
, arg_pack_elems
;
13565 dw_die_ref parm_die
;
13567 parm
= TREE_VEC_ELT (parms
, i
);
13568 arg
= TREE_VEC_ELT (args
, i
);
13569 arg_pack_elems
= lang_hooks
.types
.get_argument_pack_elems (arg
);
13570 gcc_assert (parm
&& TREE_VALUE (parm
) && arg
);
13572 if (parm
&& TREE_VALUE (parm
) && arg
)
13574 /* If PARM represents a template parameter pack,
13575 emit a DW_TAG_GNU_template_parameter_pack DIE, followed
13576 by DW_TAG_template_*_parameter DIEs for the argument
13577 pack elements of ARG. Note that ARG would then be
13578 an argument pack. */
13579 if (arg_pack_elems
)
13580 parm_die
= template_parameter_pack_die (TREE_VALUE (parm
),
13584 parm_die
= generic_parameter_die (TREE_VALUE (parm
), arg
,
13585 true /* emit name */, die
);
13586 if (i
>= non_default
)
13587 add_AT_flag (parm_die
, DW_AT_default_value
, 1);
13592 /* Create and return a DIE for PARM which should be
13593 the representation of a generic type parameter.
13594 For instance, in the C++ front end, PARM would be a template parameter.
13595 ARG is the argument to PARM.
13596 EMIT_NAME_P if tree, the DIE will have DW_AT_name attribute set to the
13598 PARENT_DIE is the parent DIE which the new created DIE should be added to,
13599 as a child node. */
13602 generic_parameter_die (tree parm
, tree arg
,
13604 dw_die_ref parent_die
)
13606 dw_die_ref tmpl_die
= NULL
;
13607 const char *name
= NULL
;
13609 /* C++2a accepts class literals as template parameters, and var
13610 decls with initializers represent them. The VAR_DECLs would be
13611 rejected, but we can take the DECL_INITIAL constructor and
13612 attempt to expand it. */
13613 if (arg
&& VAR_P (arg
))
13614 arg
= DECL_INITIAL (arg
);
13616 if (!parm
|| !DECL_NAME (parm
) || !arg
)
13619 /* We support non-type generic parameters and arguments,
13620 type generic parameters and arguments, as well as
13621 generic generic parameters (a.k.a. template template parameters in C++)
13623 if (TREE_CODE (parm
) == PARM_DECL
)
13624 /* PARM is a nontype generic parameter */
13625 tmpl_die
= new_die (DW_TAG_template_value_param
, parent_die
, parm
);
13626 else if (TREE_CODE (parm
) == TYPE_DECL
)
13627 /* PARM is a type generic parameter. */
13628 tmpl_die
= new_die (DW_TAG_template_type_param
, parent_die
, parm
);
13629 else if (lang_hooks
.decls
.generic_generic_parameter_decl_p (parm
))
13630 /* PARM is a generic generic parameter.
13631 Its DIE is a GNU extension. It shall have a
13632 DW_AT_name attribute to represent the name of the template template
13633 parameter, and a DW_AT_GNU_template_name attribute to represent the
13634 name of the template template argument. */
13635 tmpl_die
= new_die (DW_TAG_GNU_template_template_param
,
13638 gcc_unreachable ();
13644 /* If PARM is a generic parameter pack, it means we are
13645 emitting debug info for a template argument pack element.
13646 In other terms, ARG is a template argument pack element.
13647 In that case, we don't emit any DW_AT_name attribute for
13651 name
= IDENTIFIER_POINTER (DECL_NAME (parm
));
13653 add_AT_string (tmpl_die
, DW_AT_name
, name
);
13656 if (!lang_hooks
.decls
.generic_generic_parameter_decl_p (parm
))
13658 /* DWARF3, 5.6.8 says if PARM is a non-type generic parameter
13659 TMPL_DIE should have a child DW_AT_type attribute that is set
13660 to the type of the argument to PARM, which is ARG.
13661 If PARM is a type generic parameter, TMPL_DIE should have a
13662 child DW_AT_type that is set to ARG. */
13663 tmpl_type
= TYPE_P (arg
) ? arg
: TREE_TYPE (arg
);
13664 add_type_attribute (tmpl_die
, tmpl_type
,
13665 (TREE_THIS_VOLATILE (tmpl_type
)
13666 ? TYPE_QUAL_VOLATILE
: TYPE_UNQUALIFIED
),
13667 false, parent_die
);
13671 /* So TMPL_DIE is a DIE representing a
13672 a generic generic template parameter, a.k.a template template
13673 parameter in C++ and arg is a template. */
13675 /* The DW_AT_GNU_template_name attribute of the DIE must be set
13676 to the name of the argument. */
13677 name
= dwarf2_name (TYPE_P (arg
) ? TYPE_NAME (arg
) : arg
, 1);
13679 add_AT_string (tmpl_die
, DW_AT_GNU_template_name
, name
);
13682 if (TREE_CODE (parm
) == PARM_DECL
)
13683 /* So PARM is a non-type generic parameter.
13684 DWARF3 5.6.8 says we must set a DW_AT_const_value child
13685 attribute of TMPL_DIE which value represents the value
13687 We must be careful here:
13688 The value of ARG might reference some function decls.
13689 We might currently be emitting debug info for a generic
13690 type and types are emitted before function decls, we don't
13691 know if the function decls referenced by ARG will actually be
13692 emitted after cgraph computations.
13693 So must defer the generation of the DW_AT_const_value to
13694 after cgraph is ready. */
13695 append_entry_to_tmpl_value_parm_die_table (tmpl_die
, arg
);
13701 /* Generate and return a DW_TAG_GNU_template_parameter_pack DIE representing.
13702 PARM_PACK must be a template parameter pack. The returned DIE
13703 will be child DIE of PARENT_DIE. */
13706 template_parameter_pack_die (tree parm_pack
,
13707 tree parm_pack_args
,
13708 dw_die_ref parent_die
)
13713 gcc_assert (parent_die
&& parm_pack
);
13715 die
= new_die (DW_TAG_GNU_template_parameter_pack
, parent_die
, parm_pack
);
13716 add_name_and_src_coords_attributes (die
, parm_pack
);
13717 for (j
= 0; j
< TREE_VEC_LENGTH (parm_pack_args
); j
++)
13718 generic_parameter_die (parm_pack
,
13719 TREE_VEC_ELT (parm_pack_args
, j
),
13720 false /* Don't emit DW_AT_name */,
13725 /* Return the DBX register number described by a given RTL node. */
13727 static unsigned int
13728 dbx_reg_number (const_rtx rtl
)
13730 unsigned regno
= REGNO (rtl
);
13732 gcc_assert (regno
< FIRST_PSEUDO_REGISTER
);
13734 #ifdef LEAF_REG_REMAP
13735 if (crtl
->uses_only_leaf_regs
)
13737 int leaf_reg
= LEAF_REG_REMAP (regno
);
13738 if (leaf_reg
!= -1)
13739 regno
= (unsigned) leaf_reg
;
13743 regno
= DBX_REGISTER_NUMBER (regno
);
13744 gcc_assert (regno
!= INVALID_REGNUM
);
13748 /* Optionally add a DW_OP_piece term to a location description expression.
13749 DW_OP_piece is only added if the location description expression already
13750 doesn't end with DW_OP_piece. */
13753 add_loc_descr_op_piece (dw_loc_descr_ref
*list_head
, int size
)
13755 dw_loc_descr_ref loc
;
13757 if (*list_head
!= NULL
)
13759 /* Find the end of the chain. */
13760 for (loc
= *list_head
; loc
->dw_loc_next
!= NULL
; loc
= loc
->dw_loc_next
)
13763 if (loc
->dw_loc_opc
!= DW_OP_piece
)
13764 loc
->dw_loc_next
= new_loc_descr (DW_OP_piece
, size
, 0);
13768 /* Return a location descriptor that designates a machine register or
13769 zero if there is none. */
13771 static dw_loc_descr_ref
13772 reg_loc_descriptor (rtx rtl
, enum var_init_status initialized
)
13776 if (REGNO (rtl
) >= FIRST_PSEUDO_REGISTER
)
13779 /* We only use "frame base" when we're sure we're talking about the
13780 post-prologue local stack frame. We do this by *not* running
13781 register elimination until this point, and recognizing the special
13782 argument pointer and soft frame pointer rtx's.
13783 Use DW_OP_fbreg offset DW_OP_stack_value in this case. */
13784 if ((rtl
== arg_pointer_rtx
|| rtl
== frame_pointer_rtx
)
13785 && eliminate_regs (rtl
, VOIDmode
, NULL_RTX
) != rtl
)
13787 dw_loc_descr_ref result
= NULL
;
13789 if (dwarf_version
>= 4 || !dwarf_strict
)
13791 result
= mem_loc_descriptor (rtl
, GET_MODE (rtl
), VOIDmode
,
13794 add_loc_descr (&result
,
13795 new_loc_descr (DW_OP_stack_value
, 0, 0));
13800 regs
= targetm
.dwarf_register_span (rtl
);
13802 if (REG_NREGS (rtl
) > 1 || regs
)
13803 return multiple_reg_loc_descriptor (rtl
, regs
, initialized
);
13806 unsigned int dbx_regnum
= dbx_reg_number (rtl
);
13807 if (dbx_regnum
== IGNORED_DWARF_REGNUM
)
13809 return one_reg_loc_descriptor (dbx_regnum
, initialized
);
13813 /* Return a location descriptor that designates a machine register for
13814 a given hard register number. */
13816 static dw_loc_descr_ref
13817 one_reg_loc_descriptor (unsigned int regno
, enum var_init_status initialized
)
13819 dw_loc_descr_ref reg_loc_descr
;
13823 = new_loc_descr ((enum dwarf_location_atom
) (DW_OP_reg0
+ regno
), 0, 0);
13825 reg_loc_descr
= new_loc_descr (DW_OP_regx
, regno
, 0);
13827 if (initialized
== VAR_INIT_STATUS_UNINITIALIZED
)
13828 add_loc_descr (®_loc_descr
, new_loc_descr (DW_OP_GNU_uninit
, 0, 0));
13830 return reg_loc_descr
;
13833 /* Given an RTL of a register, return a location descriptor that
13834 designates a value that spans more than one register. */
13836 static dw_loc_descr_ref
13837 multiple_reg_loc_descriptor (rtx rtl
, rtx regs
,
13838 enum var_init_status initialized
)
13841 dw_loc_descr_ref loc_result
= NULL
;
13843 /* Simple, contiguous registers. */
13844 if (regs
== NULL_RTX
)
13846 unsigned reg
= REGNO (rtl
);
13849 #ifdef LEAF_REG_REMAP
13850 if (crtl
->uses_only_leaf_regs
)
13852 int leaf_reg
= LEAF_REG_REMAP (reg
);
13853 if (leaf_reg
!= -1)
13854 reg
= (unsigned) leaf_reg
;
13858 gcc_assert ((unsigned) DBX_REGISTER_NUMBER (reg
) == dbx_reg_number (rtl
));
13859 nregs
= REG_NREGS (rtl
);
13861 /* At present we only track constant-sized pieces. */
13862 if (!GET_MODE_SIZE (GET_MODE (rtl
)).is_constant (&size
))
13869 dw_loc_descr_ref t
;
13871 t
= one_reg_loc_descriptor (DBX_REGISTER_NUMBER (reg
),
13872 VAR_INIT_STATUS_INITIALIZED
);
13873 add_loc_descr (&loc_result
, t
);
13874 add_loc_descr_op_piece (&loc_result
, size
);
13880 /* Now onto stupid register sets in non contiguous locations. */
13882 gcc_assert (GET_CODE (regs
) == PARALLEL
);
13884 /* At present we only track constant-sized pieces. */
13885 if (!GET_MODE_SIZE (GET_MODE (XVECEXP (regs
, 0, 0))).is_constant (&size
))
13889 for (i
= 0; i
< XVECLEN (regs
, 0); ++i
)
13891 dw_loc_descr_ref t
;
13893 t
= one_reg_loc_descriptor (dbx_reg_number (XVECEXP (regs
, 0, i
)),
13894 VAR_INIT_STATUS_INITIALIZED
);
13895 add_loc_descr (&loc_result
, t
);
13896 add_loc_descr_op_piece (&loc_result
, size
);
13899 if (loc_result
&& initialized
== VAR_INIT_STATUS_UNINITIALIZED
)
13900 add_loc_descr (&loc_result
, new_loc_descr (DW_OP_GNU_uninit
, 0, 0));
13904 static unsigned long size_of_int_loc_descriptor (HOST_WIDE_INT
);
13906 /* Return a location descriptor that designates a constant i,
13907 as a compound operation from constant (i >> shift), constant shift
13910 static dw_loc_descr_ref
13911 int_shift_loc_descriptor (HOST_WIDE_INT i
, int shift
)
13913 dw_loc_descr_ref ret
= int_loc_descriptor (i
>> shift
);
13914 add_loc_descr (&ret
, int_loc_descriptor (shift
));
13915 add_loc_descr (&ret
, new_loc_descr (DW_OP_shl
, 0, 0));
13919 /* Return a location descriptor that designates constant POLY_I. */
13921 static dw_loc_descr_ref
13922 int_loc_descriptor (poly_int64 poly_i
)
13924 enum dwarf_location_atom op
;
13927 if (!poly_i
.is_constant (&i
))
13929 /* Create location descriptions for the non-constant part and
13930 add any constant offset at the end. */
13931 dw_loc_descr_ref ret
= NULL
;
13932 HOST_WIDE_INT constant
= poly_i
.coeffs
[0];
13933 for (unsigned int j
= 1; j
< NUM_POLY_INT_COEFFS
; ++j
)
13935 HOST_WIDE_INT coeff
= poly_i
.coeffs
[j
];
13938 dw_loc_descr_ref start
= ret
;
13939 unsigned int factor
;
13941 unsigned int regno
= targetm
.dwarf_poly_indeterminate_value
13942 (j
, &factor
, &bias
);
13944 /* Add COEFF * ((REGNO / FACTOR) - BIAS) to the value:
13945 add COEFF * (REGNO / FACTOR) now and subtract
13946 COEFF * BIAS from the final constant part. */
13947 constant
-= coeff
* bias
;
13948 add_loc_descr (&ret
, new_reg_loc_descr (regno
, 0));
13949 if (coeff
% factor
== 0)
13953 int amount
= exact_log2 (factor
);
13954 gcc_assert (amount
>= 0);
13955 add_loc_descr (&ret
, int_loc_descriptor (amount
));
13956 add_loc_descr (&ret
, new_loc_descr (DW_OP_shr
, 0, 0));
13960 add_loc_descr (&ret
, int_loc_descriptor (coeff
));
13961 add_loc_descr (&ret
, new_loc_descr (DW_OP_mul
, 0, 0));
13964 add_loc_descr (&ret
, new_loc_descr (DW_OP_plus
, 0, 0));
13967 loc_descr_plus_const (&ret
, constant
);
13971 /* Pick the smallest representation of a constant, rather than just
13972 defaulting to the LEB encoding. */
13975 int clz
= clz_hwi (i
);
13976 int ctz
= ctz_hwi (i
);
13978 op
= (enum dwarf_location_atom
) (DW_OP_lit0
+ i
);
13979 else if (i
<= 0xff)
13980 op
= DW_OP_const1u
;
13981 else if (i
<= 0xffff)
13982 op
= DW_OP_const2u
;
13983 else if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 5
13984 && clz
+ 5 + 255 >= HOST_BITS_PER_WIDE_INT
)
13985 /* DW_OP_litX DW_OP_litY DW_OP_shl takes just 3 bytes and
13986 DW_OP_litX DW_OP_const1u Y DW_OP_shl takes just 4 bytes,
13987 while DW_OP_const4u is 5 bytes. */
13988 return int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
- clz
- 5);
13989 else if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 8
13990 && clz
+ 8 + 31 >= HOST_BITS_PER_WIDE_INT
)
13991 /* DW_OP_const1u X DW_OP_litY DW_OP_shl takes just 4 bytes,
13992 while DW_OP_const4u is 5 bytes. */
13993 return int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
- clz
- 8);
13995 else if (DWARF2_ADDR_SIZE
== 4 && i
> 0x7fffffff
13996 && size_of_int_loc_descriptor ((HOST_WIDE_INT
) (int32_t) i
)
13999 /* As i >= 2**31, the double cast above will yield a negative number.
14000 Since wrapping is defined in DWARF expressions we can output big
14001 positive integers as small negative ones, regardless of the size
14004 Here, since the evaluator will handle 32-bit values and since i >=
14005 2**31, we know it's going to be interpreted as a negative literal:
14006 store it this way if we can do better than 5 bytes this way. */
14007 return int_loc_descriptor ((HOST_WIDE_INT
) (int32_t) i
);
14009 else if (HOST_BITS_PER_WIDE_INT
== 32 || i
<= 0xffffffff)
14010 op
= DW_OP_const4u
;
14012 /* Past this point, i >= 0x100000000 and thus DW_OP_constu will take at
14013 least 6 bytes: see if we can do better before falling back to it. */
14014 else if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 8
14015 && clz
+ 8 + 255 >= HOST_BITS_PER_WIDE_INT
)
14016 /* DW_OP_const1u X DW_OP_const1u Y DW_OP_shl takes just 5 bytes. */
14017 return int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
- clz
- 8);
14018 else if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 16
14019 && clz
+ 16 + (size_of_uleb128 (i
) > 5 ? 255 : 31)
14020 >= HOST_BITS_PER_WIDE_INT
)
14021 /* DW_OP_const2u X DW_OP_litY DW_OP_shl takes just 5 bytes,
14022 DW_OP_const2u X DW_OP_const1u Y DW_OP_shl takes 6 bytes. */
14023 return int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
- clz
- 16);
14024 else if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 32
14025 && clz
+ 32 + 31 >= HOST_BITS_PER_WIDE_INT
14026 && size_of_uleb128 (i
) > 6)
14027 /* DW_OP_const4u X DW_OP_litY DW_OP_shl takes just 7 bytes. */
14028 return int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
- clz
- 32);
14035 op
= DW_OP_const1s
;
14036 else if (i
>= -0x8000)
14037 op
= DW_OP_const2s
;
14038 else if (HOST_BITS_PER_WIDE_INT
== 32 || i
>= -0x80000000)
14040 if (size_of_int_loc_descriptor (i
) < 5)
14042 dw_loc_descr_ref ret
= int_loc_descriptor (-i
);
14043 add_loc_descr (&ret
, new_loc_descr (DW_OP_neg
, 0, 0));
14046 op
= DW_OP_const4s
;
14050 if (size_of_int_loc_descriptor (i
)
14051 < (unsigned long) 1 + size_of_sleb128 (i
))
14053 dw_loc_descr_ref ret
= int_loc_descriptor (-i
);
14054 add_loc_descr (&ret
, new_loc_descr (DW_OP_neg
, 0, 0));
14061 return new_loc_descr (op
, i
, 0);
14064 /* Likewise, for unsigned constants. */
14066 static dw_loc_descr_ref
14067 uint_loc_descriptor (unsigned HOST_WIDE_INT i
)
14069 const unsigned HOST_WIDE_INT max_int
= INTTYPE_MAXIMUM (HOST_WIDE_INT
);
14070 const unsigned HOST_WIDE_INT max_uint
14071 = INTTYPE_MAXIMUM (unsigned HOST_WIDE_INT
);
14073 /* If possible, use the clever signed constants handling. */
14075 return int_loc_descriptor ((HOST_WIDE_INT
) i
);
14077 /* Here, we are left with positive numbers that cannot be represented as
14078 HOST_WIDE_INT, i.e.:
14079 max (HOST_WIDE_INT) < i <= max (unsigned HOST_WIDE_INT)
14081 Using DW_OP_const4/8/./u operation to encode them consumes a lot of bytes
14082 whereas may be better to output a negative integer: thanks to integer
14083 wrapping, we know that:
14084 x = x - 2 ** DWARF2_ADDR_SIZE
14085 = x - 2 * (max (HOST_WIDE_INT) + 1)
14086 So numbers close to max (unsigned HOST_WIDE_INT) could be represented as
14087 small negative integers. Let's try that in cases it will clearly improve
14088 the encoding: there is no gain turning DW_OP_const4u into
14090 if (DWARF2_ADDR_SIZE
* 8 == HOST_BITS_PER_WIDE_INT
14091 && ((DWARF2_ADDR_SIZE
== 4 && i
> max_uint
- 0x8000)
14092 || (DWARF2_ADDR_SIZE
== 8 && i
> max_uint
- 0x80000000)))
14094 const unsigned HOST_WIDE_INT first_shift
= i
- max_int
- 1;
14096 /* Now, -1 < first_shift <= max (HOST_WIDE_INT)
14097 i.e. 0 <= first_shift <= max (HOST_WIDE_INT). */
14098 const HOST_WIDE_INT second_shift
14099 = (HOST_WIDE_INT
) first_shift
- (HOST_WIDE_INT
) max_int
- 1;
14101 /* So we finally have:
14102 -max (HOST_WIDE_INT) - 1 <= second_shift <= -1.
14103 i.e. min (HOST_WIDE_INT) <= second_shift < 0. */
14104 return int_loc_descriptor (second_shift
);
14107 /* Last chance: fallback to a simple constant operation. */
14108 return new_loc_descr
14109 ((HOST_BITS_PER_WIDE_INT
== 32 || i
<= 0xffffffff)
14115 /* Generate and return a location description that computes the unsigned
14116 comparison of the two stack top entries (a OP b where b is the top-most
14117 entry and a is the second one). The KIND of comparison can be LT_EXPR,
14118 LE_EXPR, GT_EXPR or GE_EXPR. */
14120 static dw_loc_descr_ref
14121 uint_comparison_loc_list (enum tree_code kind
)
14123 enum dwarf_location_atom op
, flip_op
;
14124 dw_loc_descr_ref ret
, bra_node
, jmp_node
, tmp
;
14141 gcc_unreachable ();
14144 bra_node
= new_loc_descr (DW_OP_bra
, 0, 0);
14145 jmp_node
= new_loc_descr (DW_OP_skip
, 0, 0);
14147 /* Until DWARFv4, operations all work on signed integers. It is nevertheless
14148 possible to perform unsigned comparisons: we just have to distinguish
14151 1. when a and b have the same sign (as signed integers); then we should
14152 return: a OP(signed) b;
14154 2. when a is a negative signed integer while b is a positive one, then a
14155 is a greater unsigned integer than b; likewise when a and b's roles
14158 So first, compare the sign of the two operands. */
14159 ret
= new_loc_descr (DW_OP_over
, 0, 0);
14160 add_loc_descr (&ret
, new_loc_descr (DW_OP_over
, 0, 0));
14161 add_loc_descr (&ret
, new_loc_descr (DW_OP_xor
, 0, 0));
14162 /* If they have different signs (i.e. they have different sign bits), then
14163 the stack top value has now the sign bit set and thus it's smaller than
14165 add_loc_descr (&ret
, new_loc_descr (DW_OP_lit0
, 0, 0));
14166 add_loc_descr (&ret
, new_loc_descr (DW_OP_lt
, 0, 0));
14167 add_loc_descr (&ret
, bra_node
);
14169 /* We are in case 1. At this point, we know both operands have the same
14170 sign, to it's safe to use the built-in signed comparison. */
14171 add_loc_descr (&ret
, new_loc_descr (op
, 0, 0));
14172 add_loc_descr (&ret
, jmp_node
);
14174 /* We are in case 2. Here, we know both operands do not have the same sign,
14175 so we have to flip the signed comparison. */
14176 flip_op
= (kind
== LT_EXPR
|| kind
== LE_EXPR
) ? DW_OP_gt
: DW_OP_lt
;
14177 tmp
= new_loc_descr (flip_op
, 0, 0);
14178 bra_node
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
14179 bra_node
->dw_loc_oprnd1
.v
.val_loc
= tmp
;
14180 add_loc_descr (&ret
, tmp
);
14182 /* This dummy operation is necessary to make the two branches join. */
14183 tmp
= new_loc_descr (DW_OP_nop
, 0, 0);
14184 jmp_node
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
14185 jmp_node
->dw_loc_oprnd1
.v
.val_loc
= tmp
;
14186 add_loc_descr (&ret
, tmp
);
14191 /* Likewise, but takes the location description lists (might be destructive on
14192 them). Return NULL if either is NULL or if concatenation fails. */
14194 static dw_loc_list_ref
14195 loc_list_from_uint_comparison (dw_loc_list_ref left
, dw_loc_list_ref right
,
14196 enum tree_code kind
)
14198 if (left
== NULL
|| right
== NULL
)
14201 add_loc_list (&left
, right
);
14205 add_loc_descr_to_each (left
, uint_comparison_loc_list (kind
));
14209 /* Return size_of_locs (int_shift_loc_descriptor (i, shift))
14210 without actually allocating it. */
14212 static unsigned long
14213 size_of_int_shift_loc_descriptor (HOST_WIDE_INT i
, int shift
)
14215 return size_of_int_loc_descriptor (i
>> shift
)
14216 + size_of_int_loc_descriptor (shift
)
14220 /* Return size_of_locs (int_loc_descriptor (i)) without
14221 actually allocating it. */
14223 static unsigned long
14224 size_of_int_loc_descriptor (HOST_WIDE_INT i
)
14233 else if (i
<= 0xff)
14235 else if (i
<= 0xffff)
14239 if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 5
14240 && clz
+ 5 + 255 >= HOST_BITS_PER_WIDE_INT
)
14241 return size_of_int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
14243 else if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 8
14244 && clz
+ 8 + 31 >= HOST_BITS_PER_WIDE_INT
)
14245 return size_of_int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
14247 else if (DWARF2_ADDR_SIZE
== 4 && i
> 0x7fffffff
14248 && size_of_int_loc_descriptor ((HOST_WIDE_INT
) (int32_t) i
)
14250 return size_of_int_loc_descriptor ((HOST_WIDE_INT
) (int32_t) i
);
14251 else if (HOST_BITS_PER_WIDE_INT
== 32 || i
<= 0xffffffff)
14253 s
= size_of_uleb128 ((unsigned HOST_WIDE_INT
) i
);
14254 if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 8
14255 && clz
+ 8 + 255 >= HOST_BITS_PER_WIDE_INT
)
14256 return size_of_int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
14258 else if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 16
14259 && clz
+ 16 + (s
> 5 ? 255 : 31) >= HOST_BITS_PER_WIDE_INT
)
14260 return size_of_int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
14262 else if (clz
+ ctz
>= HOST_BITS_PER_WIDE_INT
- 32
14263 && clz
+ 32 + 31 >= HOST_BITS_PER_WIDE_INT
14265 return size_of_int_shift_loc_descriptor (i
, HOST_BITS_PER_WIDE_INT
14274 else if (i
>= -0x8000)
14276 else if (HOST_BITS_PER_WIDE_INT
== 32 || i
>= -0x80000000)
14278 if (-(unsigned HOST_WIDE_INT
) i
!= (unsigned HOST_WIDE_INT
) i
)
14280 s
= size_of_int_loc_descriptor (-i
) + 1;
14288 unsigned long r
= 1 + size_of_sleb128 (i
);
14289 if (-(unsigned HOST_WIDE_INT
) i
!= (unsigned HOST_WIDE_INT
) i
)
14291 s
= size_of_int_loc_descriptor (-i
) + 1;
14300 /* Return loc description representing "address" of integer value.
14301 This can appear only as toplevel expression. */
14303 static dw_loc_descr_ref
14304 address_of_int_loc_descriptor (int size
, HOST_WIDE_INT i
)
14307 dw_loc_descr_ref loc_result
= NULL
;
14309 if (!(dwarf_version
>= 4 || !dwarf_strict
))
14312 litsize
= size_of_int_loc_descriptor (i
);
14313 /* Determine if DW_OP_stack_value or DW_OP_implicit_value
14314 is more compact. For DW_OP_stack_value we need:
14315 litsize + 1 (DW_OP_stack_value)
14316 and for DW_OP_implicit_value:
14317 1 (DW_OP_implicit_value) + 1 (length) + size. */
14318 if ((int) DWARF2_ADDR_SIZE
>= size
&& litsize
+ 1 <= 1 + 1 + size
)
14320 loc_result
= int_loc_descriptor (i
);
14321 add_loc_descr (&loc_result
,
14322 new_loc_descr (DW_OP_stack_value
, 0, 0));
14326 loc_result
= new_loc_descr (DW_OP_implicit_value
,
14328 loc_result
->dw_loc_oprnd2
.val_class
= dw_val_class_const
;
14329 loc_result
->dw_loc_oprnd2
.v
.val_int
= i
;
14333 /* Return a location descriptor that designates a base+offset location. */
14335 static dw_loc_descr_ref
14336 based_loc_descr (rtx reg
, poly_int64 offset
,
14337 enum var_init_status initialized
)
14339 unsigned int regno
;
14340 dw_loc_descr_ref result
;
14341 dw_fde_ref fde
= cfun
->fde
;
14343 /* We only use "frame base" when we're sure we're talking about the
14344 post-prologue local stack frame. We do this by *not* running
14345 register elimination until this point, and recognizing the special
14346 argument pointer and soft frame pointer rtx's. */
14347 if (reg
== arg_pointer_rtx
|| reg
== frame_pointer_rtx
)
14349 rtx elim
= (ira_use_lra_p
14350 ? lra_eliminate_regs (reg
, VOIDmode
, NULL_RTX
)
14351 : eliminate_regs (reg
, VOIDmode
, NULL_RTX
));
14355 /* Allow hard frame pointer here even if frame pointer
14356 isn't used since hard frame pointer is encoded with
14357 DW_OP_fbreg which uses the DW_AT_frame_base attribute,
14358 not hard frame pointer directly. */
14359 elim
= strip_offset_and_add (elim
, &offset
);
14360 gcc_assert (elim
== hard_frame_pointer_rtx
14361 || elim
== stack_pointer_rtx
);
14363 /* If drap register is used to align stack, use frame
14364 pointer + offset to access stack variables. If stack
14365 is aligned without drap, use stack pointer + offset to
14366 access stack variables. */
14367 if (crtl
->stack_realign_tried
14368 && reg
== frame_pointer_rtx
)
14371 = DWARF_FRAME_REGNUM ((fde
&& fde
->drap_reg
!= INVALID_REGNUM
)
14372 ? HARD_FRAME_POINTER_REGNUM
14374 return new_reg_loc_descr (base_reg
, offset
);
14377 gcc_assert (frame_pointer_fb_offset_valid
);
14378 offset
+= frame_pointer_fb_offset
;
14379 HOST_WIDE_INT const_offset
;
14380 if (offset
.is_constant (&const_offset
))
14381 return new_loc_descr (DW_OP_fbreg
, const_offset
, 0);
14384 dw_loc_descr_ref ret
= new_loc_descr (DW_OP_fbreg
, 0, 0);
14385 loc_descr_plus_const (&ret
, offset
);
14391 regno
= REGNO (reg
);
14392 #ifdef LEAF_REG_REMAP
14393 if (crtl
->uses_only_leaf_regs
)
14395 int leaf_reg
= LEAF_REG_REMAP (regno
);
14396 if (leaf_reg
!= -1)
14397 regno
= (unsigned) leaf_reg
;
14400 regno
= DWARF_FRAME_REGNUM (regno
);
14402 HOST_WIDE_INT const_offset
;
14403 if (!optimize
&& fde
14404 && (fde
->drap_reg
== regno
|| fde
->vdrap_reg
== regno
)
14405 && offset
.is_constant (&const_offset
))
14407 /* Use cfa+offset to represent the location of arguments passed
14408 on the stack when drap is used to align stack.
14409 Only do this when not optimizing, for optimized code var-tracking
14410 is supposed to track where the arguments live and the register
14411 used as vdrap or drap in some spot might be used for something
14412 else in other part of the routine. */
14413 return new_loc_descr (DW_OP_fbreg
, const_offset
, 0);
14416 result
= new_reg_loc_descr (regno
, offset
);
14418 if (initialized
== VAR_INIT_STATUS_UNINITIALIZED
)
14419 add_loc_descr (&result
, new_loc_descr (DW_OP_GNU_uninit
, 0, 0));
14424 /* Return true if this RTL expression describes a base+offset calculation. */
14427 is_based_loc (const_rtx rtl
)
14429 return (GET_CODE (rtl
) == PLUS
14430 && ((REG_P (XEXP (rtl
, 0))
14431 && REGNO (XEXP (rtl
, 0)) < FIRST_PSEUDO_REGISTER
14432 && CONST_INT_P (XEXP (rtl
, 1)))));
14435 /* Try to handle TLS MEMs, for which mem_loc_descriptor on XEXP (mem, 0)
14438 static dw_loc_descr_ref
14439 tls_mem_loc_descriptor (rtx mem
)
14442 dw_loc_descr_ref loc_result
;
14444 if (MEM_EXPR (mem
) == NULL_TREE
|| !MEM_OFFSET_KNOWN_P (mem
))
14447 base
= get_base_address (MEM_EXPR (mem
));
14450 || !DECL_THREAD_LOCAL_P (base
))
14453 loc_result
= loc_descriptor_from_tree (MEM_EXPR (mem
), 1, NULL
);
14454 if (loc_result
== NULL
)
14457 if (maybe_ne (MEM_OFFSET (mem
), 0))
14458 loc_descr_plus_const (&loc_result
, MEM_OFFSET (mem
));
14463 /* Output debug info about reason why we failed to expand expression as dwarf
14467 expansion_failed (tree expr
, rtx rtl
, char const *reason
)
14469 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
14471 fprintf (dump_file
, "Failed to expand as dwarf: ");
14473 print_generic_expr (dump_file
, expr
, dump_flags
);
14476 fprintf (dump_file
, "\n");
14477 print_rtl (dump_file
, rtl
);
14479 fprintf (dump_file
, "\nReason: %s\n", reason
);
14483 /* Helper function for const_ok_for_output. */
14486 const_ok_for_output_1 (rtx rtl
)
14488 if (targetm
.const_not_ok_for_debug_p (rtl
))
14490 if (GET_CODE (rtl
) != UNSPEC
)
14492 expansion_failed (NULL_TREE
, rtl
,
14493 "Expression rejected for debug by the backend.\n");
14497 /* If delegitimize_address couldn't do anything with the UNSPEC, and
14498 the target hook doesn't explicitly allow it in debug info, assume
14499 we can't express it in the debug info. */
14500 /* Don't complain about TLS UNSPECs, those are just too hard to
14501 delegitimize. Note this could be a non-decl SYMBOL_REF such as
14502 one in a constant pool entry, so testing SYMBOL_REF_TLS_MODEL
14503 rather than DECL_THREAD_LOCAL_P is not just an optimization. */
14505 && (XVECLEN (rtl
, 0) == 0
14506 || GET_CODE (XVECEXP (rtl
, 0, 0)) != SYMBOL_REF
14507 || SYMBOL_REF_TLS_MODEL (XVECEXP (rtl
, 0, 0)) == TLS_MODEL_NONE
))
14508 inform (current_function_decl
14509 ? DECL_SOURCE_LOCATION (current_function_decl
)
14510 : UNKNOWN_LOCATION
,
14511 #if NUM_UNSPEC_VALUES > 0
14512 "non-delegitimized UNSPEC %s (%d) found in variable location",
14513 ((XINT (rtl
, 1) >= 0 && XINT (rtl
, 1) < NUM_UNSPEC_VALUES
)
14514 ? unspec_strings
[XINT (rtl
, 1)] : "unknown"),
14516 "non-delegitimized UNSPEC %d found in variable location",
14519 expansion_failed (NULL_TREE
, rtl
,
14520 "UNSPEC hasn't been delegitimized.\n");
14524 if (CONST_POLY_INT_P (rtl
))
14527 /* FIXME: Refer to PR60655. It is possible for simplification
14528 of rtl expressions in var tracking to produce such expressions.
14529 We should really identify / validate expressions
14530 enclosed in CONST that can be handled by assemblers on various
14531 targets and only handle legitimate cases here. */
14532 switch (GET_CODE (rtl
))
14541 /* Make sure SYMBOL_REFs/UNSPECs are at most in one of the
14543 subrtx_var_iterator::array_type array
;
14544 bool first
= false;
14545 FOR_EACH_SUBRTX_VAR (iter
, array
, XEXP (rtl
, 0), ALL
)
14546 if (SYMBOL_REF_P (*iter
)
14548 || GET_CODE (*iter
) == UNSPEC
)
14555 FOR_EACH_SUBRTX_VAR (iter
, array
, XEXP (rtl
, 1), ALL
)
14556 if (SYMBOL_REF_P (*iter
)
14558 || GET_CODE (*iter
) == UNSPEC
)
14564 /* Disallow negation of SYMBOL_REFs or UNSPECs when they
14565 appear in the second operand of MINUS. */
14566 subrtx_var_iterator::array_type array
;
14567 FOR_EACH_SUBRTX_VAR (iter
, array
, XEXP (rtl
, 1), ALL
)
14568 if (SYMBOL_REF_P (*iter
)
14570 || GET_CODE (*iter
) == UNSPEC
)
14578 if (CONSTANT_POOL_ADDRESS_P (rtl
))
14581 get_pool_constant_mark (rtl
, &marked
);
14582 /* If all references to this pool constant were optimized away,
14583 it was not output and thus we can't represent it. */
14586 expansion_failed (NULL_TREE
, rtl
,
14587 "Constant was removed from constant pool.\n");
14592 if (SYMBOL_REF_TLS_MODEL (rtl
) != TLS_MODEL_NONE
)
14595 /* Avoid references to external symbols in debug info, on several targets
14596 the linker might even refuse to link when linking a shared library,
14597 and in many other cases the relocations for .debug_info/.debug_loc are
14598 dropped, so the address becomes zero anyway. Hidden symbols, guaranteed
14599 to be defined within the same shared library or executable are fine. */
14600 if (SYMBOL_REF_EXTERNAL_P (rtl
))
14602 tree decl
= SYMBOL_REF_DECL (rtl
);
14604 if (decl
== NULL
|| !targetm
.binds_local_p (decl
))
14606 expansion_failed (NULL_TREE
, rtl
,
14607 "Symbol not defined in current TU.\n");
14615 /* Return true if constant RTL can be emitted in DW_OP_addr or
14616 DW_AT_const_value. TLS SYMBOL_REFs, external SYMBOL_REFs or
14617 non-marked constant pool SYMBOL_REFs can't be referenced in it. */
14620 const_ok_for_output (rtx rtl
)
14622 if (GET_CODE (rtl
) == SYMBOL_REF
)
14623 return const_ok_for_output_1 (rtl
);
14625 if (GET_CODE (rtl
) == CONST
)
14627 subrtx_var_iterator::array_type array
;
14628 FOR_EACH_SUBRTX_VAR (iter
, array
, XEXP (rtl
, 0), ALL
)
14629 if (!const_ok_for_output_1 (*iter
))
14637 /* Return a reference to DW_TAG_base_type corresponding to MODE and UNSIGNEDP
14638 if possible, NULL otherwise. */
14641 base_type_for_mode (machine_mode mode
, bool unsignedp
)
14643 dw_die_ref type_die
;
14644 tree type
= lang_hooks
.types
.type_for_mode (mode
, unsignedp
);
14648 switch (TREE_CODE (type
))
14656 type_die
= lookup_type_die (type
);
14658 type_die
= modified_type_die (type
, TYPE_UNQUALIFIED
, false,
14660 if (type_die
== NULL
|| type_die
->die_tag
!= DW_TAG_base_type
)
14665 /* For OP descriptor assumed to be in unsigned MODE, convert it to a unsigned
14666 type matching MODE, or, if MODE is narrower than or as wide as
14667 DWARF2_ADDR_SIZE, untyped. Return NULL if the conversion is not
14670 static dw_loc_descr_ref
14671 convert_descriptor_to_mode (scalar_int_mode mode
, dw_loc_descr_ref op
)
14673 machine_mode outer_mode
= mode
;
14674 dw_die_ref type_die
;
14675 dw_loc_descr_ref cvt
;
14677 if (GET_MODE_SIZE (mode
) <= DWARF2_ADDR_SIZE
)
14679 add_loc_descr (&op
, new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0));
14682 type_die
= base_type_for_mode (outer_mode
, 1);
14683 if (type_die
== NULL
)
14685 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
14686 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
14687 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
14688 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
14689 add_loc_descr (&op
, cvt
);
14693 /* Return location descriptor for comparison OP with operands OP0 and OP1. */
14695 static dw_loc_descr_ref
14696 compare_loc_descriptor (enum dwarf_location_atom op
, dw_loc_descr_ref op0
,
14697 dw_loc_descr_ref op1
)
14699 dw_loc_descr_ref ret
= op0
;
14700 add_loc_descr (&ret
, op1
);
14701 add_loc_descr (&ret
, new_loc_descr (op
, 0, 0));
14702 if (STORE_FLAG_VALUE
!= 1)
14704 add_loc_descr (&ret
, int_loc_descriptor (STORE_FLAG_VALUE
));
14705 add_loc_descr (&ret
, new_loc_descr (DW_OP_mul
, 0, 0));
14710 /* Subroutine of scompare_loc_descriptor for the case in which we're
14711 comparing two scalar integer operands OP0 and OP1 that have mode OP_MODE,
14712 and in which OP_MODE is bigger than DWARF2_ADDR_SIZE. */
14714 static dw_loc_descr_ref
14715 scompare_loc_descriptor_wide (enum dwarf_location_atom op
,
14716 scalar_int_mode op_mode
,
14717 dw_loc_descr_ref op0
, dw_loc_descr_ref op1
)
14719 dw_die_ref type_die
= base_type_for_mode (op_mode
, 0);
14720 dw_loc_descr_ref cvt
;
14722 if (type_die
== NULL
)
14724 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
14725 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
14726 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
14727 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
14728 add_loc_descr (&op0
, cvt
);
14729 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
14730 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
14731 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
14732 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
14733 add_loc_descr (&op1
, cvt
);
14734 return compare_loc_descriptor (op
, op0
, op1
);
14737 /* Subroutine of scompare_loc_descriptor for the case in which we're
14738 comparing two scalar integer operands OP0 and OP1 that have mode OP_MODE,
14739 and in which OP_MODE is smaller than DWARF2_ADDR_SIZE. */
14741 static dw_loc_descr_ref
14742 scompare_loc_descriptor_narrow (enum dwarf_location_atom op
, rtx rtl
,
14743 scalar_int_mode op_mode
,
14744 dw_loc_descr_ref op0
, dw_loc_descr_ref op1
)
14746 int shift
= (DWARF2_ADDR_SIZE
- GET_MODE_SIZE (op_mode
)) * BITS_PER_UNIT
;
14747 /* For eq/ne, if the operands are known to be zero-extended,
14748 there is no need to do the fancy shifting up. */
14749 if (op
== DW_OP_eq
|| op
== DW_OP_ne
)
14751 dw_loc_descr_ref last0
, last1
;
14752 for (last0
= op0
; last0
->dw_loc_next
!= NULL
; last0
= last0
->dw_loc_next
)
14754 for (last1
= op1
; last1
->dw_loc_next
!= NULL
; last1
= last1
->dw_loc_next
)
14756 /* deref_size zero extends, and for constants we can check
14757 whether they are zero extended or not. */
14758 if (((last0
->dw_loc_opc
== DW_OP_deref_size
14759 && last0
->dw_loc_oprnd1
.v
.val_int
<= GET_MODE_SIZE (op_mode
))
14760 || (CONST_INT_P (XEXP (rtl
, 0))
14761 && (unsigned HOST_WIDE_INT
) INTVAL (XEXP (rtl
, 0))
14762 == (INTVAL (XEXP (rtl
, 0)) & GET_MODE_MASK (op_mode
))))
14763 && ((last1
->dw_loc_opc
== DW_OP_deref_size
14764 && last1
->dw_loc_oprnd1
.v
.val_int
<= GET_MODE_SIZE (op_mode
))
14765 || (CONST_INT_P (XEXP (rtl
, 1))
14766 && (unsigned HOST_WIDE_INT
) INTVAL (XEXP (rtl
, 1))
14767 == (INTVAL (XEXP (rtl
, 1)) & GET_MODE_MASK (op_mode
)))))
14768 return compare_loc_descriptor (op
, op0
, op1
);
14770 /* EQ/NE comparison against constant in narrower type than
14771 DWARF2_ADDR_SIZE can be performed either as
14772 DW_OP_const1u <shift> DW_OP_shl DW_OP_const* <cst << shift>
14775 DW_OP_const*u <mode_mask> DW_OP_and DW_OP_const* <cst & mode_mask>
14776 DW_OP_{eq,ne}. Pick whatever is shorter. */
14777 if (CONST_INT_P (XEXP (rtl
, 1))
14778 && GET_MODE_BITSIZE (op_mode
) < HOST_BITS_PER_WIDE_INT
14779 && (size_of_int_loc_descriptor (shift
) + 1
14780 + size_of_int_loc_descriptor (UINTVAL (XEXP (rtl
, 1)) << shift
)
14781 >= size_of_int_loc_descriptor (GET_MODE_MASK (op_mode
)) + 1
14782 + size_of_int_loc_descriptor (INTVAL (XEXP (rtl
, 1))
14783 & GET_MODE_MASK (op_mode
))))
14785 add_loc_descr (&op0
, int_loc_descriptor (GET_MODE_MASK (op_mode
)));
14786 add_loc_descr (&op0
, new_loc_descr (DW_OP_and
, 0, 0));
14787 op1
= int_loc_descriptor (INTVAL (XEXP (rtl
, 1))
14788 & GET_MODE_MASK (op_mode
));
14789 return compare_loc_descriptor (op
, op0
, op1
);
14792 add_loc_descr (&op0
, int_loc_descriptor (shift
));
14793 add_loc_descr (&op0
, new_loc_descr (DW_OP_shl
, 0, 0));
14794 if (CONST_INT_P (XEXP (rtl
, 1)))
14795 op1
= int_loc_descriptor (UINTVAL (XEXP (rtl
, 1)) << shift
);
14798 add_loc_descr (&op1
, int_loc_descriptor (shift
));
14799 add_loc_descr (&op1
, new_loc_descr (DW_OP_shl
, 0, 0));
14801 return compare_loc_descriptor (op
, op0
, op1
);
14804 /* Return location descriptor for unsigned comparison OP RTL. */
14806 static dw_loc_descr_ref
14807 scompare_loc_descriptor (enum dwarf_location_atom op
, rtx rtl
,
14808 machine_mode mem_mode
)
14810 machine_mode op_mode
= GET_MODE (XEXP (rtl
, 0));
14811 dw_loc_descr_ref op0
, op1
;
14813 if (op_mode
== VOIDmode
)
14814 op_mode
= GET_MODE (XEXP (rtl
, 1));
14815 if (op_mode
== VOIDmode
)
14818 scalar_int_mode int_op_mode
;
14820 && dwarf_version
< 5
14821 && (!is_a
<scalar_int_mode
> (op_mode
, &int_op_mode
)
14822 || GET_MODE_SIZE (int_op_mode
) > DWARF2_ADDR_SIZE
))
14825 op0
= mem_loc_descriptor (XEXP (rtl
, 0), op_mode
, mem_mode
,
14826 VAR_INIT_STATUS_INITIALIZED
);
14827 op1
= mem_loc_descriptor (XEXP (rtl
, 1), op_mode
, mem_mode
,
14828 VAR_INIT_STATUS_INITIALIZED
);
14830 if (op0
== NULL
|| op1
== NULL
)
14833 if (is_a
<scalar_int_mode
> (op_mode
, &int_op_mode
))
14835 if (GET_MODE_SIZE (int_op_mode
) < DWARF2_ADDR_SIZE
)
14836 return scompare_loc_descriptor_narrow (op
, rtl
, int_op_mode
, op0
, op1
);
14838 if (GET_MODE_SIZE (int_op_mode
) > DWARF2_ADDR_SIZE
)
14839 return scompare_loc_descriptor_wide (op
, int_op_mode
, op0
, op1
);
14841 return compare_loc_descriptor (op
, op0
, op1
);
14844 /* Return location descriptor for unsigned comparison OP RTL. */
14846 static dw_loc_descr_ref
14847 ucompare_loc_descriptor (enum dwarf_location_atom op
, rtx rtl
,
14848 machine_mode mem_mode
)
14850 dw_loc_descr_ref op0
, op1
;
14852 machine_mode test_op_mode
= GET_MODE (XEXP (rtl
, 0));
14853 if (test_op_mode
== VOIDmode
)
14854 test_op_mode
= GET_MODE (XEXP (rtl
, 1));
14856 scalar_int_mode op_mode
;
14857 if (!is_a
<scalar_int_mode
> (test_op_mode
, &op_mode
))
14861 && dwarf_version
< 5
14862 && GET_MODE_SIZE (op_mode
) > DWARF2_ADDR_SIZE
)
14865 op0
= mem_loc_descriptor (XEXP (rtl
, 0), op_mode
, mem_mode
,
14866 VAR_INIT_STATUS_INITIALIZED
);
14867 op1
= mem_loc_descriptor (XEXP (rtl
, 1), op_mode
, mem_mode
,
14868 VAR_INIT_STATUS_INITIALIZED
);
14870 if (op0
== NULL
|| op1
== NULL
)
14873 if (GET_MODE_SIZE (op_mode
) < DWARF2_ADDR_SIZE
)
14875 HOST_WIDE_INT mask
= GET_MODE_MASK (op_mode
);
14876 dw_loc_descr_ref last0
, last1
;
14877 for (last0
= op0
; last0
->dw_loc_next
!= NULL
; last0
= last0
->dw_loc_next
)
14879 for (last1
= op1
; last1
->dw_loc_next
!= NULL
; last1
= last1
->dw_loc_next
)
14881 if (CONST_INT_P (XEXP (rtl
, 0)))
14882 op0
= int_loc_descriptor (INTVAL (XEXP (rtl
, 0)) & mask
);
14883 /* deref_size zero extends, so no need to mask it again. */
14884 else if (last0
->dw_loc_opc
!= DW_OP_deref_size
14885 || last0
->dw_loc_oprnd1
.v
.val_int
> GET_MODE_SIZE (op_mode
))
14887 add_loc_descr (&op0
, int_loc_descriptor (mask
));
14888 add_loc_descr (&op0
, new_loc_descr (DW_OP_and
, 0, 0));
14890 if (CONST_INT_P (XEXP (rtl
, 1)))
14891 op1
= int_loc_descriptor (INTVAL (XEXP (rtl
, 1)) & mask
);
14892 /* deref_size zero extends, so no need to mask it again. */
14893 else if (last1
->dw_loc_opc
!= DW_OP_deref_size
14894 || last1
->dw_loc_oprnd1
.v
.val_int
> GET_MODE_SIZE (op_mode
))
14896 add_loc_descr (&op1
, int_loc_descriptor (mask
));
14897 add_loc_descr (&op1
, new_loc_descr (DW_OP_and
, 0, 0));
14900 else if (GET_MODE_SIZE (op_mode
) == DWARF2_ADDR_SIZE
)
14902 HOST_WIDE_INT bias
= 1;
14903 bias
<<= (DWARF2_ADDR_SIZE
* BITS_PER_UNIT
- 1);
14904 add_loc_descr (&op0
, new_loc_descr (DW_OP_plus_uconst
, bias
, 0));
14905 if (CONST_INT_P (XEXP (rtl
, 1)))
14906 op1
= int_loc_descriptor ((unsigned HOST_WIDE_INT
) bias
14907 + INTVAL (XEXP (rtl
, 1)));
14909 add_loc_descr (&op1
, new_loc_descr (DW_OP_plus_uconst
,
14912 return compare_loc_descriptor (op
, op0
, op1
);
14915 /* Return location descriptor for {U,S}{MIN,MAX}. */
14917 static dw_loc_descr_ref
14918 minmax_loc_descriptor (rtx rtl
, machine_mode mode
,
14919 machine_mode mem_mode
)
14921 enum dwarf_location_atom op
;
14922 dw_loc_descr_ref op0
, op1
, ret
;
14923 dw_loc_descr_ref bra_node
, drop_node
;
14925 scalar_int_mode int_mode
;
14927 && dwarf_version
< 5
14928 && (!is_a
<scalar_int_mode
> (mode
, &int_mode
)
14929 || GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
))
14932 op0
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
14933 VAR_INIT_STATUS_INITIALIZED
);
14934 op1
= mem_loc_descriptor (XEXP (rtl
, 1), mode
, mem_mode
,
14935 VAR_INIT_STATUS_INITIALIZED
);
14937 if (op0
== NULL
|| op1
== NULL
)
14940 add_loc_descr (&op0
, new_loc_descr (DW_OP_dup
, 0, 0));
14941 add_loc_descr (&op1
, new_loc_descr (DW_OP_swap
, 0, 0));
14942 add_loc_descr (&op1
, new_loc_descr (DW_OP_over
, 0, 0));
14943 if (GET_CODE (rtl
) == UMIN
|| GET_CODE (rtl
) == UMAX
)
14945 /* Checked by the caller. */
14946 int_mode
= as_a
<scalar_int_mode
> (mode
);
14947 if (GET_MODE_SIZE (int_mode
) < DWARF2_ADDR_SIZE
)
14949 HOST_WIDE_INT mask
= GET_MODE_MASK (int_mode
);
14950 add_loc_descr (&op0
, int_loc_descriptor (mask
));
14951 add_loc_descr (&op0
, new_loc_descr (DW_OP_and
, 0, 0));
14952 add_loc_descr (&op1
, int_loc_descriptor (mask
));
14953 add_loc_descr (&op1
, new_loc_descr (DW_OP_and
, 0, 0));
14955 else if (GET_MODE_SIZE (int_mode
) == DWARF2_ADDR_SIZE
)
14957 HOST_WIDE_INT bias
= 1;
14958 bias
<<= (DWARF2_ADDR_SIZE
* BITS_PER_UNIT
- 1);
14959 add_loc_descr (&op0
, new_loc_descr (DW_OP_plus_uconst
, bias
, 0));
14960 add_loc_descr (&op1
, new_loc_descr (DW_OP_plus_uconst
, bias
, 0));
14963 else if (is_a
<scalar_int_mode
> (mode
, &int_mode
)
14964 && GET_MODE_SIZE (int_mode
) < DWARF2_ADDR_SIZE
)
14966 int shift
= (DWARF2_ADDR_SIZE
- GET_MODE_SIZE (int_mode
)) * BITS_PER_UNIT
;
14967 add_loc_descr (&op0
, int_loc_descriptor (shift
));
14968 add_loc_descr (&op0
, new_loc_descr (DW_OP_shl
, 0, 0));
14969 add_loc_descr (&op1
, int_loc_descriptor (shift
));
14970 add_loc_descr (&op1
, new_loc_descr (DW_OP_shl
, 0, 0));
14972 else if (is_a
<scalar_int_mode
> (mode
, &int_mode
)
14973 && GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
)
14975 dw_die_ref type_die
= base_type_for_mode (int_mode
, 0);
14976 dw_loc_descr_ref cvt
;
14977 if (type_die
== NULL
)
14979 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
14980 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
14981 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
14982 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
14983 add_loc_descr (&op0
, cvt
);
14984 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
14985 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
14986 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
14987 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
14988 add_loc_descr (&op1
, cvt
);
14991 if (GET_CODE (rtl
) == SMIN
|| GET_CODE (rtl
) == UMIN
)
14996 add_loc_descr (&ret
, op1
);
14997 add_loc_descr (&ret
, new_loc_descr (op
, 0, 0));
14998 bra_node
= new_loc_descr (DW_OP_bra
, 0, 0);
14999 add_loc_descr (&ret
, bra_node
);
15000 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15001 drop_node
= new_loc_descr (DW_OP_drop
, 0, 0);
15002 add_loc_descr (&ret
, drop_node
);
15003 bra_node
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15004 bra_node
->dw_loc_oprnd1
.v
.val_loc
= drop_node
;
15005 if ((GET_CODE (rtl
) == SMIN
|| GET_CODE (rtl
) == SMAX
)
15006 && is_a
<scalar_int_mode
> (mode
, &int_mode
)
15007 && GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
)
15008 ret
= convert_descriptor_to_mode (int_mode
, ret
);
15012 /* Helper function for mem_loc_descriptor. Perform OP binary op,
15013 but after converting arguments to type_die, afterwards
15014 convert back to unsigned. */
15016 static dw_loc_descr_ref
15017 typed_binop (enum dwarf_location_atom op
, rtx rtl
, dw_die_ref type_die
,
15018 scalar_int_mode mode
, machine_mode mem_mode
)
15020 dw_loc_descr_ref cvt
, op0
, op1
;
15022 if (type_die
== NULL
)
15024 op0
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
15025 VAR_INIT_STATUS_INITIALIZED
);
15026 op1
= mem_loc_descriptor (XEXP (rtl
, 1), mode
, mem_mode
,
15027 VAR_INIT_STATUS_INITIALIZED
);
15028 if (op0
== NULL
|| op1
== NULL
)
15030 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
15031 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
15032 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
15033 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
15034 add_loc_descr (&op0
, cvt
);
15035 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
15036 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
15037 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
15038 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
15039 add_loc_descr (&op1
, cvt
);
15040 add_loc_descr (&op0
, op1
);
15041 add_loc_descr (&op0
, new_loc_descr (op
, 0, 0));
15042 return convert_descriptor_to_mode (mode
, op0
);
15045 /* CLZ (where constV is CLZ_DEFINED_VALUE_AT_ZERO computed value,
15046 const0 is DW_OP_lit0 or corresponding typed constant,
15047 const1 is DW_OP_lit1 or corresponding typed constant
15048 and constMSB is constant with just the MSB bit set
15050 DW_OP_dup DW_OP_bra <L1> DW_OP_drop constV DW_OP_skip <L4>
15051 L1: const0 DW_OP_swap
15052 L2: DW_OP_dup constMSB DW_OP_and DW_OP_bra <L3> const1 DW_OP_shl
15053 DW_OP_swap DW_OP_plus_uconst <1> DW_OP_swap DW_OP_skip <L2>
15058 DW_OP_dup DW_OP_bra <L1> DW_OP_drop constV DW_OP_skip <L4>
15059 L1: const0 DW_OP_swap
15060 L2: DW_OP_dup const1 DW_OP_and DW_OP_bra <L3> const1 DW_OP_shr
15061 DW_OP_swap DW_OP_plus_uconst <1> DW_OP_swap DW_OP_skip <L2>
15066 DW_OP_dup DW_OP_bra <L1> DW_OP_drop const0 DW_OP_skip <L4>
15067 L1: const1 DW_OP_swap
15068 L2: DW_OP_dup const1 DW_OP_and DW_OP_bra <L3> const1 DW_OP_shr
15069 DW_OP_swap DW_OP_plus_uconst <1> DW_OP_swap DW_OP_skip <L2>
15073 static dw_loc_descr_ref
15074 clz_loc_descriptor (rtx rtl
, scalar_int_mode mode
,
15075 machine_mode mem_mode
)
15077 dw_loc_descr_ref op0
, ret
, tmp
;
15078 HOST_WIDE_INT valv
;
15079 dw_loc_descr_ref l1jump
, l1label
;
15080 dw_loc_descr_ref l2jump
, l2label
;
15081 dw_loc_descr_ref l3jump
, l3label
;
15082 dw_loc_descr_ref l4jump
, l4label
;
15085 if (GET_MODE (XEXP (rtl
, 0)) != mode
)
15088 op0
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
15089 VAR_INIT_STATUS_INITIALIZED
);
15093 if (GET_CODE (rtl
) == CLZ
)
15095 if (!CLZ_DEFINED_VALUE_AT_ZERO (mode
, valv
))
15096 valv
= GET_MODE_BITSIZE (mode
);
15098 else if (GET_CODE (rtl
) == FFS
)
15100 else if (!CTZ_DEFINED_VALUE_AT_ZERO (mode
, valv
))
15101 valv
= GET_MODE_BITSIZE (mode
);
15102 add_loc_descr (&ret
, new_loc_descr (DW_OP_dup
, 0, 0));
15103 l1jump
= new_loc_descr (DW_OP_bra
, 0, 0);
15104 add_loc_descr (&ret
, l1jump
);
15105 add_loc_descr (&ret
, new_loc_descr (DW_OP_drop
, 0, 0));
15106 tmp
= mem_loc_descriptor (GEN_INT (valv
), mode
, mem_mode
,
15107 VAR_INIT_STATUS_INITIALIZED
);
15110 add_loc_descr (&ret
, tmp
);
15111 l4jump
= new_loc_descr (DW_OP_skip
, 0, 0);
15112 add_loc_descr (&ret
, l4jump
);
15113 l1label
= mem_loc_descriptor (GET_CODE (rtl
) == FFS
15114 ? const1_rtx
: const0_rtx
,
15116 VAR_INIT_STATUS_INITIALIZED
);
15117 if (l1label
== NULL
)
15119 add_loc_descr (&ret
, l1label
);
15120 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15121 l2label
= new_loc_descr (DW_OP_dup
, 0, 0);
15122 add_loc_descr (&ret
, l2label
);
15123 if (GET_CODE (rtl
) != CLZ
)
15125 else if (GET_MODE_BITSIZE (mode
) <= HOST_BITS_PER_WIDE_INT
)
15126 msb
= GEN_INT (HOST_WIDE_INT_1U
15127 << (GET_MODE_BITSIZE (mode
) - 1));
15129 msb
= immed_wide_int_const
15130 (wi::set_bit_in_zero (GET_MODE_PRECISION (mode
) - 1,
15131 GET_MODE_PRECISION (mode
)), mode
);
15132 if (GET_CODE (msb
) == CONST_INT
&& INTVAL (msb
) < 0)
15133 tmp
= new_loc_descr (HOST_BITS_PER_WIDE_INT
== 32
15134 ? DW_OP_const4u
: HOST_BITS_PER_WIDE_INT
== 64
15135 ? DW_OP_const8u
: DW_OP_constu
, INTVAL (msb
), 0);
15137 tmp
= mem_loc_descriptor (msb
, mode
, mem_mode
,
15138 VAR_INIT_STATUS_INITIALIZED
);
15141 add_loc_descr (&ret
, tmp
);
15142 add_loc_descr (&ret
, new_loc_descr (DW_OP_and
, 0, 0));
15143 l3jump
= new_loc_descr (DW_OP_bra
, 0, 0);
15144 add_loc_descr (&ret
, l3jump
);
15145 tmp
= mem_loc_descriptor (const1_rtx
, mode
, mem_mode
,
15146 VAR_INIT_STATUS_INITIALIZED
);
15149 add_loc_descr (&ret
, tmp
);
15150 add_loc_descr (&ret
, new_loc_descr (GET_CODE (rtl
) == CLZ
15151 ? DW_OP_shl
: DW_OP_shr
, 0, 0));
15152 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15153 add_loc_descr (&ret
, new_loc_descr (DW_OP_plus_uconst
, 1, 0));
15154 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15155 l2jump
= new_loc_descr (DW_OP_skip
, 0, 0);
15156 add_loc_descr (&ret
, l2jump
);
15157 l3label
= new_loc_descr (DW_OP_drop
, 0, 0);
15158 add_loc_descr (&ret
, l3label
);
15159 l4label
= new_loc_descr (DW_OP_nop
, 0, 0);
15160 add_loc_descr (&ret
, l4label
);
15161 l1jump
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15162 l1jump
->dw_loc_oprnd1
.v
.val_loc
= l1label
;
15163 l2jump
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15164 l2jump
->dw_loc_oprnd1
.v
.val_loc
= l2label
;
15165 l3jump
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15166 l3jump
->dw_loc_oprnd1
.v
.val_loc
= l3label
;
15167 l4jump
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15168 l4jump
->dw_loc_oprnd1
.v
.val_loc
= l4label
;
15172 /* POPCOUNT (const0 is DW_OP_lit0 or corresponding typed constant,
15173 const1 is DW_OP_lit1 or corresponding typed constant):
15175 L1: DW_OP_dup DW_OP_bra <L2> DW_OP_dup DW_OP_rot const1 DW_OP_and
15176 DW_OP_plus DW_OP_swap const1 DW_OP_shr DW_OP_skip <L1>
15180 L1: DW_OP_dup DW_OP_bra <L2> DW_OP_dup DW_OP_rot const1 DW_OP_and
15181 DW_OP_xor DW_OP_swap const1 DW_OP_shr DW_OP_skip <L1>
15184 static dw_loc_descr_ref
15185 popcount_loc_descriptor (rtx rtl
, scalar_int_mode mode
,
15186 machine_mode mem_mode
)
15188 dw_loc_descr_ref op0
, ret
, tmp
;
15189 dw_loc_descr_ref l1jump
, l1label
;
15190 dw_loc_descr_ref l2jump
, l2label
;
15192 if (GET_MODE (XEXP (rtl
, 0)) != mode
)
15195 op0
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
15196 VAR_INIT_STATUS_INITIALIZED
);
15200 tmp
= mem_loc_descriptor (const0_rtx
, mode
, mem_mode
,
15201 VAR_INIT_STATUS_INITIALIZED
);
15204 add_loc_descr (&ret
, tmp
);
15205 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15206 l1label
= new_loc_descr (DW_OP_dup
, 0, 0);
15207 add_loc_descr (&ret
, l1label
);
15208 l2jump
= new_loc_descr (DW_OP_bra
, 0, 0);
15209 add_loc_descr (&ret
, l2jump
);
15210 add_loc_descr (&ret
, new_loc_descr (DW_OP_dup
, 0, 0));
15211 add_loc_descr (&ret
, new_loc_descr (DW_OP_rot
, 0, 0));
15212 tmp
= mem_loc_descriptor (const1_rtx
, mode
, mem_mode
,
15213 VAR_INIT_STATUS_INITIALIZED
);
15216 add_loc_descr (&ret
, tmp
);
15217 add_loc_descr (&ret
, new_loc_descr (DW_OP_and
, 0, 0));
15218 add_loc_descr (&ret
, new_loc_descr (GET_CODE (rtl
) == POPCOUNT
15219 ? DW_OP_plus
: DW_OP_xor
, 0, 0));
15220 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15221 tmp
= mem_loc_descriptor (const1_rtx
, mode
, mem_mode
,
15222 VAR_INIT_STATUS_INITIALIZED
);
15223 add_loc_descr (&ret
, tmp
);
15224 add_loc_descr (&ret
, new_loc_descr (DW_OP_shr
, 0, 0));
15225 l1jump
= new_loc_descr (DW_OP_skip
, 0, 0);
15226 add_loc_descr (&ret
, l1jump
);
15227 l2label
= new_loc_descr (DW_OP_drop
, 0, 0);
15228 add_loc_descr (&ret
, l2label
);
15229 l1jump
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15230 l1jump
->dw_loc_oprnd1
.v
.val_loc
= l1label
;
15231 l2jump
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15232 l2jump
->dw_loc_oprnd1
.v
.val_loc
= l2label
;
15236 /* BSWAP (constS is initial shift count, either 56 or 24):
15238 L1: DW_OP_pick <2> constS DW_OP_pick <3> DW_OP_minus DW_OP_shr
15239 const255 DW_OP_and DW_OP_pick <2> DW_OP_shl DW_OP_or
15240 DW_OP_swap DW_OP_dup const0 DW_OP_eq DW_OP_bra <L2> const8
15241 DW_OP_minus DW_OP_swap DW_OP_skip <L1>
15242 L2: DW_OP_drop DW_OP_swap DW_OP_drop */
15244 static dw_loc_descr_ref
15245 bswap_loc_descriptor (rtx rtl
, scalar_int_mode mode
,
15246 machine_mode mem_mode
)
15248 dw_loc_descr_ref op0
, ret
, tmp
;
15249 dw_loc_descr_ref l1jump
, l1label
;
15250 dw_loc_descr_ref l2jump
, l2label
;
15252 if (BITS_PER_UNIT
!= 8
15253 || (GET_MODE_BITSIZE (mode
) != 32
15254 && GET_MODE_BITSIZE (mode
) != 64))
15257 op0
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
15258 VAR_INIT_STATUS_INITIALIZED
);
15263 tmp
= mem_loc_descriptor (GEN_INT (GET_MODE_BITSIZE (mode
) - 8),
15265 VAR_INIT_STATUS_INITIALIZED
);
15268 add_loc_descr (&ret
, tmp
);
15269 tmp
= mem_loc_descriptor (const0_rtx
, mode
, mem_mode
,
15270 VAR_INIT_STATUS_INITIALIZED
);
15273 add_loc_descr (&ret
, tmp
);
15274 l1label
= new_loc_descr (DW_OP_pick
, 2, 0);
15275 add_loc_descr (&ret
, l1label
);
15276 tmp
= mem_loc_descriptor (GEN_INT (GET_MODE_BITSIZE (mode
) - 8),
15278 VAR_INIT_STATUS_INITIALIZED
);
15279 add_loc_descr (&ret
, tmp
);
15280 add_loc_descr (&ret
, new_loc_descr (DW_OP_pick
, 3, 0));
15281 add_loc_descr (&ret
, new_loc_descr (DW_OP_minus
, 0, 0));
15282 add_loc_descr (&ret
, new_loc_descr (DW_OP_shr
, 0, 0));
15283 tmp
= mem_loc_descriptor (GEN_INT (255), mode
, mem_mode
,
15284 VAR_INIT_STATUS_INITIALIZED
);
15287 add_loc_descr (&ret
, tmp
);
15288 add_loc_descr (&ret
, new_loc_descr (DW_OP_and
, 0, 0));
15289 add_loc_descr (&ret
, new_loc_descr (DW_OP_pick
, 2, 0));
15290 add_loc_descr (&ret
, new_loc_descr (DW_OP_shl
, 0, 0));
15291 add_loc_descr (&ret
, new_loc_descr (DW_OP_or
, 0, 0));
15292 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15293 add_loc_descr (&ret
, new_loc_descr (DW_OP_dup
, 0, 0));
15294 tmp
= mem_loc_descriptor (const0_rtx
, mode
, mem_mode
,
15295 VAR_INIT_STATUS_INITIALIZED
);
15296 add_loc_descr (&ret
, tmp
);
15297 add_loc_descr (&ret
, new_loc_descr (DW_OP_eq
, 0, 0));
15298 l2jump
= new_loc_descr (DW_OP_bra
, 0, 0);
15299 add_loc_descr (&ret
, l2jump
);
15300 tmp
= mem_loc_descriptor (GEN_INT (8), mode
, mem_mode
,
15301 VAR_INIT_STATUS_INITIALIZED
);
15302 add_loc_descr (&ret
, tmp
);
15303 add_loc_descr (&ret
, new_loc_descr (DW_OP_minus
, 0, 0));
15304 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15305 l1jump
= new_loc_descr (DW_OP_skip
, 0, 0);
15306 add_loc_descr (&ret
, l1jump
);
15307 l2label
= new_loc_descr (DW_OP_drop
, 0, 0);
15308 add_loc_descr (&ret
, l2label
);
15309 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15310 add_loc_descr (&ret
, new_loc_descr (DW_OP_drop
, 0, 0));
15311 l1jump
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15312 l1jump
->dw_loc_oprnd1
.v
.val_loc
= l1label
;
15313 l2jump
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15314 l2jump
->dw_loc_oprnd1
.v
.val_loc
= l2label
;
15318 /* ROTATE (constMASK is mode mask, BITSIZE is bitsize of mode):
15319 DW_OP_over DW_OP_over DW_OP_shl [ constMASK DW_OP_and ] DW_OP_rot
15320 [ DW_OP_swap constMASK DW_OP_and DW_OP_swap ] DW_OP_neg
15321 DW_OP_plus_uconst <BITSIZE> DW_OP_shr DW_OP_or
15323 ROTATERT is similar:
15324 DW_OP_over DW_OP_over DW_OP_neg DW_OP_plus_uconst <BITSIZE>
15325 DW_OP_shl [ constMASK DW_OP_and ] DW_OP_rot
15326 [ DW_OP_swap constMASK DW_OP_and DW_OP_swap ] DW_OP_shr DW_OP_or */
15328 static dw_loc_descr_ref
15329 rotate_loc_descriptor (rtx rtl
, scalar_int_mode mode
,
15330 machine_mode mem_mode
)
15332 rtx rtlop1
= XEXP (rtl
, 1);
15333 dw_loc_descr_ref op0
, op1
, ret
, mask
[2] = { NULL
, NULL
};
15336 if (is_narrower_int_mode (GET_MODE (rtlop1
), mode
))
15337 rtlop1
= gen_rtx_ZERO_EXTEND (mode
, rtlop1
);
15338 op0
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
15339 VAR_INIT_STATUS_INITIALIZED
);
15340 op1
= mem_loc_descriptor (rtlop1
, mode
, mem_mode
,
15341 VAR_INIT_STATUS_INITIALIZED
);
15342 if (op0
== NULL
|| op1
== NULL
)
15344 if (GET_MODE_SIZE (mode
) < DWARF2_ADDR_SIZE
)
15345 for (i
= 0; i
< 2; i
++)
15347 if (GET_MODE_BITSIZE (mode
) < HOST_BITS_PER_WIDE_INT
)
15348 mask
[i
] = mem_loc_descriptor (GEN_INT (GET_MODE_MASK (mode
)),
15350 VAR_INIT_STATUS_INITIALIZED
);
15351 else if (GET_MODE_BITSIZE (mode
) == HOST_BITS_PER_WIDE_INT
)
15352 mask
[i
] = new_loc_descr (HOST_BITS_PER_WIDE_INT
== 32
15354 : HOST_BITS_PER_WIDE_INT
== 64
15355 ? DW_OP_const8u
: DW_OP_constu
,
15356 GET_MODE_MASK (mode
), 0);
15359 if (mask
[i
] == NULL
)
15361 add_loc_descr (&mask
[i
], new_loc_descr (DW_OP_and
, 0, 0));
15364 add_loc_descr (&ret
, op1
);
15365 add_loc_descr (&ret
, new_loc_descr (DW_OP_over
, 0, 0));
15366 add_loc_descr (&ret
, new_loc_descr (DW_OP_over
, 0, 0));
15367 if (GET_CODE (rtl
) == ROTATERT
)
15369 add_loc_descr (&ret
, new_loc_descr (DW_OP_neg
, 0, 0));
15370 add_loc_descr (&ret
, new_loc_descr (DW_OP_plus_uconst
,
15371 GET_MODE_BITSIZE (mode
), 0));
15373 add_loc_descr (&ret
, new_loc_descr (DW_OP_shl
, 0, 0));
15374 if (mask
[0] != NULL
)
15375 add_loc_descr (&ret
, mask
[0]);
15376 add_loc_descr (&ret
, new_loc_descr (DW_OP_rot
, 0, 0));
15377 if (mask
[1] != NULL
)
15379 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15380 add_loc_descr (&ret
, mask
[1]);
15381 add_loc_descr (&ret
, new_loc_descr (DW_OP_swap
, 0, 0));
15383 if (GET_CODE (rtl
) == ROTATE
)
15385 add_loc_descr (&ret
, new_loc_descr (DW_OP_neg
, 0, 0));
15386 add_loc_descr (&ret
, new_loc_descr (DW_OP_plus_uconst
,
15387 GET_MODE_BITSIZE (mode
), 0));
15389 add_loc_descr (&ret
, new_loc_descr (DW_OP_shr
, 0, 0));
15390 add_loc_descr (&ret
, new_loc_descr (DW_OP_or
, 0, 0));
15394 /* Helper function for mem_loc_descriptor. Return DW_OP_GNU_parameter_ref
15395 for DEBUG_PARAMETER_REF RTL. */
15397 static dw_loc_descr_ref
15398 parameter_ref_descriptor (rtx rtl
)
15400 dw_loc_descr_ref ret
;
15405 gcc_assert (TREE_CODE (DEBUG_PARAMETER_REF_DECL (rtl
)) == PARM_DECL
);
15406 /* With LTO during LTRANS we get the late DIE that refers to the early
15407 DIE, thus we add another indirection here. This seems to confuse
15408 gdb enough to make gcc.dg/guality/pr68860-1.c FAIL with LTO. */
15409 ref
= lookup_decl_die (DEBUG_PARAMETER_REF_DECL (rtl
));
15410 ret
= new_loc_descr (DW_OP_GNU_parameter_ref
, 0, 0);
15413 ret
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
15414 ret
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
15415 ret
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
15419 ret
->dw_loc_oprnd1
.val_class
= dw_val_class_decl_ref
;
15420 ret
->dw_loc_oprnd1
.v
.val_decl_ref
= DEBUG_PARAMETER_REF_DECL (rtl
);
15425 /* The following routine converts the RTL for a variable or parameter
15426 (resident in memory) into an equivalent Dwarf representation of a
15427 mechanism for getting the address of that same variable onto the top of a
15428 hypothetical "address evaluation" stack.
15430 When creating memory location descriptors, we are effectively transforming
15431 the RTL for a memory-resident object into its Dwarf postfix expression
15432 equivalent. This routine recursively descends an RTL tree, turning
15433 it into Dwarf postfix code as it goes.
15435 MODE is the mode that should be assumed for the rtl if it is VOIDmode.
15437 MEM_MODE is the mode of the memory reference, needed to handle some
15438 autoincrement addressing modes.
15440 Return 0 if we can't represent the location. */
15443 mem_loc_descriptor (rtx rtl
, machine_mode mode
,
15444 machine_mode mem_mode
,
15445 enum var_init_status initialized
)
15447 dw_loc_descr_ref mem_loc_result
= NULL
;
15448 enum dwarf_location_atom op
;
15449 dw_loc_descr_ref op0
, op1
;
15450 rtx inner
= NULL_RTX
;
15453 if (mode
== VOIDmode
)
15454 mode
= GET_MODE (rtl
);
15456 /* Note that for a dynamically sized array, the location we will generate a
15457 description of here will be the lowest numbered location which is
15458 actually within the array. That's *not* necessarily the same as the
15459 zeroth element of the array. */
15461 rtl
= targetm
.delegitimize_address (rtl
);
15463 if (mode
!= GET_MODE (rtl
) && GET_MODE (rtl
) != VOIDmode
)
15466 scalar_int_mode int_mode
= BImode
, inner_mode
, op1_mode
;
15467 switch (GET_CODE (rtl
))
15472 return mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
, initialized
);
15475 /* The case of a subreg may arise when we have a local (register)
15476 variable or a formal (register) parameter which doesn't quite fill
15477 up an entire register. For now, just assume that it is
15478 legitimate to make the Dwarf info refer to the whole register which
15479 contains the given subreg. */
15480 if (!subreg_lowpart_p (rtl
))
15482 inner
= SUBREG_REG (rtl
);
15485 if (inner
== NULL_RTX
)
15486 inner
= XEXP (rtl
, 0);
15487 if (is_a
<scalar_int_mode
> (mode
, &int_mode
)
15488 && is_a
<scalar_int_mode
> (GET_MODE (inner
), &inner_mode
)
15489 && (GET_MODE_SIZE (int_mode
) <= DWARF2_ADDR_SIZE
15490 #ifdef POINTERS_EXTEND_UNSIGNED
15491 || (int_mode
== Pmode
&& mem_mode
!= VOIDmode
)
15494 && GET_MODE_SIZE (inner_mode
) <= DWARF2_ADDR_SIZE
)
15496 mem_loc_result
= mem_loc_descriptor (inner
,
15498 mem_mode
, initialized
);
15501 if (dwarf_strict
&& dwarf_version
< 5)
15503 if (is_a
<scalar_int_mode
> (mode
, &int_mode
)
15504 && is_a
<scalar_int_mode
> (GET_MODE (inner
), &inner_mode
)
15505 ? GET_MODE_SIZE (int_mode
) <= GET_MODE_SIZE (inner_mode
)
15506 : known_eq (GET_MODE_SIZE (mode
), GET_MODE_SIZE (GET_MODE (inner
))))
15508 dw_die_ref type_die
;
15509 dw_loc_descr_ref cvt
;
15511 mem_loc_result
= mem_loc_descriptor (inner
,
15513 mem_mode
, initialized
);
15514 if (mem_loc_result
== NULL
)
15516 type_die
= base_type_for_mode (mode
, SCALAR_INT_MODE_P (mode
));
15517 if (type_die
== NULL
)
15519 mem_loc_result
= NULL
;
15522 if (maybe_ne (GET_MODE_SIZE (mode
), GET_MODE_SIZE (GET_MODE (inner
))))
15523 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
15525 cvt
= new_loc_descr (dwarf_OP (DW_OP_reinterpret
), 0, 0);
15526 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
15527 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
15528 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
15529 add_loc_descr (&mem_loc_result
, cvt
);
15530 if (is_a
<scalar_int_mode
> (mode
, &int_mode
)
15531 && GET_MODE_SIZE (int_mode
) <= DWARF2_ADDR_SIZE
)
15533 /* Convert it to untyped afterwards. */
15534 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
15535 add_loc_descr (&mem_loc_result
, cvt
);
15541 if (!is_a
<scalar_int_mode
> (mode
, &int_mode
)
15542 || (GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
15543 && rtl
!= arg_pointer_rtx
15544 && rtl
!= frame_pointer_rtx
15545 #ifdef POINTERS_EXTEND_UNSIGNED
15546 && (int_mode
!= Pmode
|| mem_mode
== VOIDmode
)
15550 dw_die_ref type_die
;
15551 unsigned int dbx_regnum
;
15553 if (dwarf_strict
&& dwarf_version
< 5)
15555 if (REGNO (rtl
) >= FIRST_PSEUDO_REGISTER
)
15557 type_die
= base_type_for_mode (mode
, SCALAR_INT_MODE_P (mode
));
15558 if (type_die
== NULL
)
15561 dbx_regnum
= dbx_reg_number (rtl
);
15562 if (dbx_regnum
== IGNORED_DWARF_REGNUM
)
15564 mem_loc_result
= new_loc_descr (dwarf_OP (DW_OP_regval_type
),
15566 mem_loc_result
->dw_loc_oprnd2
.val_class
= dw_val_class_die_ref
;
15567 mem_loc_result
->dw_loc_oprnd2
.v
.val_die_ref
.die
= type_die
;
15568 mem_loc_result
->dw_loc_oprnd2
.v
.val_die_ref
.external
= 0;
15571 /* Whenever a register number forms a part of the description of the
15572 method for calculating the (dynamic) address of a memory resident
15573 object, DWARF rules require the register number be referred to as
15574 a "base register". This distinction is not based in any way upon
15575 what category of register the hardware believes the given register
15576 belongs to. This is strictly DWARF terminology we're dealing with
15577 here. Note that in cases where the location of a memory-resident
15578 data object could be expressed as: OP_ADD (OP_BASEREG (basereg),
15579 OP_CONST (0)) the actual DWARF location descriptor that we generate
15580 may just be OP_BASEREG (basereg). This may look deceptively like
15581 the object in question was allocated to a register (rather than in
15582 memory) so DWARF consumers need to be aware of the subtle
15583 distinction between OP_REG and OP_BASEREG. */
15584 if (REGNO (rtl
) < FIRST_PSEUDO_REGISTER
)
15585 mem_loc_result
= based_loc_descr (rtl
, 0, VAR_INIT_STATUS_INITIALIZED
);
15586 else if (stack_realign_drap
15588 && crtl
->args
.internal_arg_pointer
== rtl
15589 && REGNO (crtl
->drap_reg
) < FIRST_PSEUDO_REGISTER
)
15591 /* If RTL is internal_arg_pointer, which has been optimized
15592 out, use DRAP instead. */
15593 mem_loc_result
= based_loc_descr (crtl
->drap_reg
, 0,
15594 VAR_INIT_STATUS_INITIALIZED
);
15600 if (!is_a
<scalar_int_mode
> (mode
, &int_mode
)
15601 || !is_a
<scalar_int_mode
> (GET_MODE (XEXP (rtl
, 0)), &inner_mode
))
15603 op0
= mem_loc_descriptor (XEXP (rtl
, 0), inner_mode
,
15604 mem_mode
, VAR_INIT_STATUS_INITIALIZED
);
15607 else if (GET_CODE (rtl
) == ZERO_EXTEND
15608 && GET_MODE_SIZE (int_mode
) <= DWARF2_ADDR_SIZE
15609 && GET_MODE_BITSIZE (inner_mode
) < HOST_BITS_PER_WIDE_INT
15610 /* If DW_OP_const{1,2,4}u won't be used, it is shorter
15611 to expand zero extend as two shifts instead of
15613 && GET_MODE_SIZE (inner_mode
) <= 4)
15615 mem_loc_result
= op0
;
15616 add_loc_descr (&mem_loc_result
,
15617 int_loc_descriptor (GET_MODE_MASK (inner_mode
)));
15618 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_and
, 0, 0));
15620 else if (GET_MODE_SIZE (int_mode
) <= DWARF2_ADDR_SIZE
)
15622 int shift
= DWARF2_ADDR_SIZE
- GET_MODE_SIZE (inner_mode
);
15623 shift
*= BITS_PER_UNIT
;
15624 if (GET_CODE (rtl
) == SIGN_EXTEND
)
15628 mem_loc_result
= op0
;
15629 add_loc_descr (&mem_loc_result
, int_loc_descriptor (shift
));
15630 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_shl
, 0, 0));
15631 add_loc_descr (&mem_loc_result
, int_loc_descriptor (shift
));
15632 add_loc_descr (&mem_loc_result
, new_loc_descr (op
, 0, 0));
15634 else if (!dwarf_strict
|| dwarf_version
>= 5)
15636 dw_die_ref type_die1
, type_die2
;
15637 dw_loc_descr_ref cvt
;
15639 type_die1
= base_type_for_mode (inner_mode
,
15640 GET_CODE (rtl
) == ZERO_EXTEND
);
15641 if (type_die1
== NULL
)
15643 type_die2
= base_type_for_mode (int_mode
, 1);
15644 if (type_die2
== NULL
)
15646 mem_loc_result
= op0
;
15647 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
15648 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
15649 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die1
;
15650 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
15651 add_loc_descr (&mem_loc_result
, cvt
);
15652 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
15653 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
15654 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die2
;
15655 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
15656 add_loc_descr (&mem_loc_result
, cvt
);
15662 rtx new_rtl
= avoid_constant_pool_reference (rtl
);
15663 if (new_rtl
!= rtl
)
15665 mem_loc_result
= mem_loc_descriptor (new_rtl
, mode
, mem_mode
,
15667 if (mem_loc_result
!= NULL
)
15668 return mem_loc_result
;
15671 mem_loc_result
= mem_loc_descriptor (XEXP (rtl
, 0),
15672 get_address_mode (rtl
), mode
,
15673 VAR_INIT_STATUS_INITIALIZED
);
15674 if (mem_loc_result
== NULL
)
15675 mem_loc_result
= tls_mem_loc_descriptor (rtl
);
15676 if (mem_loc_result
!= NULL
)
15678 if (!is_a
<scalar_int_mode
> (mode
, &int_mode
)
15679 || GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
)
15681 dw_die_ref type_die
;
15682 dw_loc_descr_ref deref
;
15683 HOST_WIDE_INT size
;
15685 if (dwarf_strict
&& dwarf_version
< 5)
15687 if (!GET_MODE_SIZE (mode
).is_constant (&size
))
15690 = base_type_for_mode (mode
, SCALAR_INT_MODE_P (mode
));
15691 if (type_die
== NULL
)
15693 deref
= new_loc_descr (dwarf_OP (DW_OP_deref_type
), size
, 0);
15694 deref
->dw_loc_oprnd2
.val_class
= dw_val_class_die_ref
;
15695 deref
->dw_loc_oprnd2
.v
.val_die_ref
.die
= type_die
;
15696 deref
->dw_loc_oprnd2
.v
.val_die_ref
.external
= 0;
15697 add_loc_descr (&mem_loc_result
, deref
);
15699 else if (GET_MODE_SIZE (int_mode
) == DWARF2_ADDR_SIZE
)
15700 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_deref
, 0, 0));
15702 add_loc_descr (&mem_loc_result
,
15703 new_loc_descr (DW_OP_deref_size
,
15704 GET_MODE_SIZE (int_mode
), 0));
15709 return mem_loc_descriptor (XEXP (rtl
, 1), mode
, mem_mode
, initialized
);
15712 /* Some ports can transform a symbol ref into a label ref, because
15713 the symbol ref is too far away and has to be dumped into a constant
15718 if (!is_a
<scalar_int_mode
> (mode
, &int_mode
)
15719 || (GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
15720 #ifdef POINTERS_EXTEND_UNSIGNED
15721 && (int_mode
!= Pmode
|| mem_mode
== VOIDmode
)
15726 if (GET_CODE (rtl
) == UNSPEC
)
15728 /* If delegitimize_address couldn't do anything with the UNSPEC, we
15729 can't express it in the debug info. This can happen e.g. with some
15730 TLS UNSPECs. Allow UNSPECs formerly from CONST that the backend
15732 bool not_ok
= false;
15733 subrtx_var_iterator::array_type array
;
15734 FOR_EACH_SUBRTX_VAR (iter
, array
, rtl
, ALL
)
15735 if (*iter
!= rtl
&& !CONSTANT_P (*iter
))
15744 FOR_EACH_SUBRTX_VAR (iter
, array
, rtl
, ALL
)
15745 if (!const_ok_for_output_1 (*iter
))
15754 rtl
= gen_rtx_CONST (GET_MODE (rtl
), rtl
);
15758 if (GET_CODE (rtl
) == SYMBOL_REF
15759 && SYMBOL_REF_TLS_MODEL (rtl
) != TLS_MODEL_NONE
)
15761 dw_loc_descr_ref temp
;
15763 /* If this is not defined, we have no way to emit the data. */
15764 if (!targetm
.have_tls
|| !targetm
.asm_out
.output_dwarf_dtprel
)
15767 temp
= new_addr_loc_descr (rtl
, dtprel_true
);
15769 /* We check for DWARF 5 here because gdb did not implement
15770 DW_OP_form_tls_address until after 7.12. */
15771 mem_loc_result
= new_loc_descr ((dwarf_version
>= 5
15772 ? DW_OP_form_tls_address
15773 : DW_OP_GNU_push_tls_address
),
15775 add_loc_descr (&mem_loc_result
, temp
);
15780 if (!const_ok_for_output (rtl
))
15782 if (GET_CODE (rtl
) == CONST
)
15783 switch (GET_CODE (XEXP (rtl
, 0)))
15787 goto try_const_unop
;
15790 goto try_const_unop
;
15793 arg
= XEXP (XEXP (rtl
, 0), 0);
15794 if (!CONSTANT_P (arg
))
15795 arg
= gen_rtx_CONST (int_mode
, arg
);
15796 op0
= mem_loc_descriptor (arg
, int_mode
, mem_mode
,
15800 mem_loc_result
= op0
;
15801 add_loc_descr (&mem_loc_result
, new_loc_descr (op
, 0, 0));
15805 mem_loc_result
= mem_loc_descriptor (XEXP (rtl
, 0), int_mode
,
15806 mem_mode
, initialized
);
15813 mem_loc_result
= new_addr_loc_descr (rtl
, dtprel_false
);
15814 vec_safe_push (used_rtx_array
, rtl
);
15820 case DEBUG_IMPLICIT_PTR
:
15821 expansion_failed (NULL_TREE
, rtl
,
15822 "CONCAT/CONCATN/VAR_LOCATION is handled only by loc_descriptor");
15826 if (dwarf_strict
&& dwarf_version
< 5)
15828 if (REG_P (ENTRY_VALUE_EXP (rtl
)))
15830 if (!is_a
<scalar_int_mode
> (mode
, &int_mode
)
15831 || GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
)
15832 op0
= mem_loc_descriptor (ENTRY_VALUE_EXP (rtl
), mode
,
15833 VOIDmode
, VAR_INIT_STATUS_INITIALIZED
);
15836 unsigned int dbx_regnum
= dbx_reg_number (ENTRY_VALUE_EXP (rtl
));
15837 if (dbx_regnum
== IGNORED_DWARF_REGNUM
)
15839 op0
= one_reg_loc_descriptor (dbx_regnum
,
15840 VAR_INIT_STATUS_INITIALIZED
);
15843 else if (MEM_P (ENTRY_VALUE_EXP (rtl
))
15844 && REG_P (XEXP (ENTRY_VALUE_EXP (rtl
), 0)))
15846 op0
= mem_loc_descriptor (ENTRY_VALUE_EXP (rtl
), mode
,
15847 VOIDmode
, VAR_INIT_STATUS_INITIALIZED
);
15848 if (op0
&& op0
->dw_loc_opc
== DW_OP_fbreg
)
15852 gcc_unreachable ();
15855 mem_loc_result
= new_loc_descr (dwarf_OP (DW_OP_entry_value
), 0, 0);
15856 mem_loc_result
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
15857 mem_loc_result
->dw_loc_oprnd1
.v
.val_loc
= op0
;
15860 case DEBUG_PARAMETER_REF
:
15861 mem_loc_result
= parameter_ref_descriptor (rtl
);
15865 /* Extract the PLUS expression nested inside and fall into
15866 PLUS code below. */
15867 rtl
= XEXP (rtl
, 1);
15872 /* Turn these into a PLUS expression and fall into the PLUS code
15874 rtl
= gen_rtx_PLUS (mode
, XEXP (rtl
, 0),
15875 gen_int_mode (GET_CODE (rtl
) == PRE_INC
15876 ? GET_MODE_UNIT_SIZE (mem_mode
)
15877 : -GET_MODE_UNIT_SIZE (mem_mode
),
15884 if (is_based_loc (rtl
)
15885 && is_a
<scalar_int_mode
> (mode
, &int_mode
)
15886 && (GET_MODE_SIZE (int_mode
) <= DWARF2_ADDR_SIZE
15887 || XEXP (rtl
, 0) == arg_pointer_rtx
15888 || XEXP (rtl
, 0) == frame_pointer_rtx
))
15889 mem_loc_result
= based_loc_descr (XEXP (rtl
, 0),
15890 INTVAL (XEXP (rtl
, 1)),
15891 VAR_INIT_STATUS_INITIALIZED
);
15894 mem_loc_result
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
15895 VAR_INIT_STATUS_INITIALIZED
);
15896 if (mem_loc_result
== 0)
15899 if (CONST_INT_P (XEXP (rtl
, 1))
15900 && (GET_MODE_SIZE (as_a
<scalar_int_mode
> (mode
))
15901 <= DWARF2_ADDR_SIZE
))
15902 loc_descr_plus_const (&mem_loc_result
, INTVAL (XEXP (rtl
, 1)));
15905 op1
= mem_loc_descriptor (XEXP (rtl
, 1), mode
, mem_mode
,
15906 VAR_INIT_STATUS_INITIALIZED
);
15909 add_loc_descr (&mem_loc_result
, op1
);
15910 add_loc_descr (&mem_loc_result
,
15911 new_loc_descr (DW_OP_plus
, 0, 0));
15916 /* If a pseudo-reg is optimized away, it is possible for it to
15917 be replaced with a MEM containing a multiply or shift. */
15927 if ((!dwarf_strict
|| dwarf_version
>= 5)
15928 && is_a
<scalar_int_mode
> (mode
, &int_mode
)
15929 && GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
)
15931 mem_loc_result
= typed_binop (DW_OP_div
, rtl
,
15932 base_type_for_mode (mode
, 0),
15933 int_mode
, mem_mode
);
15956 if (!is_a
<scalar_int_mode
> (mode
, &int_mode
))
15958 op0
= mem_loc_descriptor (XEXP (rtl
, 0), int_mode
, mem_mode
,
15959 VAR_INIT_STATUS_INITIALIZED
);
15961 rtx rtlop1
= XEXP (rtl
, 1);
15962 if (is_a
<scalar_int_mode
> (GET_MODE (rtlop1
), &op1_mode
)
15963 && GET_MODE_BITSIZE (op1_mode
) < GET_MODE_BITSIZE (int_mode
))
15964 rtlop1
= gen_rtx_ZERO_EXTEND (int_mode
, rtlop1
);
15965 op1
= mem_loc_descriptor (rtlop1
, int_mode
, mem_mode
,
15966 VAR_INIT_STATUS_INITIALIZED
);
15969 if (op0
== 0 || op1
== 0)
15972 mem_loc_result
= op0
;
15973 add_loc_descr (&mem_loc_result
, op1
);
15974 add_loc_descr (&mem_loc_result
, new_loc_descr (op
, 0, 0));
15990 op0
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
15991 VAR_INIT_STATUS_INITIALIZED
);
15992 op1
= mem_loc_descriptor (XEXP (rtl
, 1), mode
, mem_mode
,
15993 VAR_INIT_STATUS_INITIALIZED
);
15995 if (op0
== 0 || op1
== 0)
15998 mem_loc_result
= op0
;
15999 add_loc_descr (&mem_loc_result
, op1
);
16000 add_loc_descr (&mem_loc_result
, new_loc_descr (op
, 0, 0));
16004 if ((!dwarf_strict
|| dwarf_version
>= 5)
16005 && is_a
<scalar_int_mode
> (mode
, &int_mode
)
16006 && GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
)
16008 mem_loc_result
= typed_binop (DW_OP_mod
, rtl
,
16009 base_type_for_mode (mode
, 0),
16010 int_mode
, mem_mode
);
16014 op0
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
16015 VAR_INIT_STATUS_INITIALIZED
);
16016 op1
= mem_loc_descriptor (XEXP (rtl
, 1), mode
, mem_mode
,
16017 VAR_INIT_STATUS_INITIALIZED
);
16019 if (op0
== 0 || op1
== 0)
16022 mem_loc_result
= op0
;
16023 add_loc_descr (&mem_loc_result
, op1
);
16024 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_over
, 0, 0));
16025 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_over
, 0, 0));
16026 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_div
, 0, 0));
16027 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_mul
, 0, 0));
16028 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_minus
, 0, 0));
16032 if ((!dwarf_strict
|| dwarf_version
>= 5)
16033 && is_a
<scalar_int_mode
> (mode
, &int_mode
))
16035 if (GET_MODE_SIZE (int_mode
) > DWARF2_ADDR_SIZE
)
16040 mem_loc_result
= typed_binop (DW_OP_div
, rtl
,
16041 base_type_for_mode (int_mode
, 1),
16042 int_mode
, mem_mode
);
16059 op0
= mem_loc_descriptor (XEXP (rtl
, 0), mode
, mem_mode
,
16060 VAR_INIT_STATUS_INITIALIZED
);
16065 mem_loc_result
= op0
;
16066 add_loc_descr (&mem_loc_result
, new_loc_descr (op
, 0, 0));
16070 if (!is_a
<scalar_int_mode
> (mode
, &int_mode
)
16071 || GET_MODE_SIZE (int_mode
) <= DWARF2_ADDR_SIZE
16072 #ifdef POINTERS_EXTEND_UNSIGNED
16073 || (int_mode
== Pmode
16074 && mem_mode
!= VOIDmode
16075 && trunc_int_for_mode (INTVAL (rtl
), ptr_mode
) == INTVAL (rtl
))
16079 mem_loc_result
= int_loc_descriptor (INTVAL (rtl
));
16082 if ((!dwarf_strict
|| dwarf_version
>= 5)
16083 && (GET_MODE_BITSIZE (int_mode
) == HOST_BITS_PER_WIDE_INT
16084 || GET_MODE_BITSIZE (int_mode
) == HOST_BITS_PER_DOUBLE_INT
))
16086 dw_die_ref type_die
= base_type_for_mode (int_mode
, 1);
16087 scalar_int_mode amode
;
16088 if (type_die
== NULL
)
16090 if (INTVAL (rtl
) >= 0
16091 && (int_mode_for_size (DWARF2_ADDR_SIZE
* BITS_PER_UNIT
, 0)
16093 && trunc_int_for_mode (INTVAL (rtl
), amode
) == INTVAL (rtl
)
16094 /* const DW_OP_convert <XXX> vs.
16095 DW_OP_const_type <XXX, 1, const>. */
16096 && size_of_int_loc_descriptor (INTVAL (rtl
)) + 1 + 1
16097 < (unsigned long) 1 + 1 + 1 + GET_MODE_SIZE (int_mode
))
16099 mem_loc_result
= int_loc_descriptor (INTVAL (rtl
));
16100 op0
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
16101 op0
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
16102 op0
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
16103 op0
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
16104 add_loc_descr (&mem_loc_result
, op0
);
16105 return mem_loc_result
;
16107 mem_loc_result
= new_loc_descr (dwarf_OP (DW_OP_const_type
), 0,
16109 mem_loc_result
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
16110 mem_loc_result
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
16111 mem_loc_result
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
16112 if (GET_MODE_BITSIZE (int_mode
) == HOST_BITS_PER_WIDE_INT
)
16113 mem_loc_result
->dw_loc_oprnd2
.val_class
= dw_val_class_const
;
16116 mem_loc_result
->dw_loc_oprnd2
.val_class
16117 = dw_val_class_const_double
;
16118 mem_loc_result
->dw_loc_oprnd2
.v
.val_double
16119 = double_int::from_shwi (INTVAL (rtl
));
16125 if (!dwarf_strict
|| dwarf_version
>= 5)
16127 dw_die_ref type_die
;
16129 /* Note that if TARGET_SUPPORTS_WIDE_INT == 0, a
16130 CONST_DOUBLE rtx could represent either a large integer
16131 or a floating-point constant. If TARGET_SUPPORTS_WIDE_INT != 0,
16132 the value is always a floating point constant.
16134 When it is an integer, a CONST_DOUBLE is used whenever
16135 the constant requires 2 HWIs to be adequately represented.
16136 We output CONST_DOUBLEs as blocks. */
16137 if (mode
== VOIDmode
16138 || (GET_MODE (rtl
) == VOIDmode
16139 && maybe_ne (GET_MODE_BITSIZE (mode
),
16140 HOST_BITS_PER_DOUBLE_INT
)))
16142 type_die
= base_type_for_mode (mode
, SCALAR_INT_MODE_P (mode
));
16143 if (type_die
== NULL
)
16145 mem_loc_result
= new_loc_descr (dwarf_OP (DW_OP_const_type
), 0, 0);
16146 mem_loc_result
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
16147 mem_loc_result
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
16148 mem_loc_result
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
16149 #if TARGET_SUPPORTS_WIDE_INT == 0
16150 if (!SCALAR_FLOAT_MODE_P (mode
))
16152 mem_loc_result
->dw_loc_oprnd2
.val_class
16153 = dw_val_class_const_double
;
16154 mem_loc_result
->dw_loc_oprnd2
.v
.val_double
16155 = rtx_to_double_int (rtl
);
16160 scalar_float_mode float_mode
= as_a
<scalar_float_mode
> (mode
);
16161 unsigned int length
= GET_MODE_SIZE (float_mode
);
16162 unsigned char *array
= ggc_vec_alloc
<unsigned char> (length
);
16164 insert_float (rtl
, array
);
16165 mem_loc_result
->dw_loc_oprnd2
.val_class
= dw_val_class_vec
;
16166 mem_loc_result
->dw_loc_oprnd2
.v
.val_vec
.length
= length
/ 4;
16167 mem_loc_result
->dw_loc_oprnd2
.v
.val_vec
.elt_size
= 4;
16168 mem_loc_result
->dw_loc_oprnd2
.v
.val_vec
.array
= array
;
16173 case CONST_WIDE_INT
:
16174 if (!dwarf_strict
|| dwarf_version
>= 5)
16176 dw_die_ref type_die
;
16178 type_die
= base_type_for_mode (mode
, SCALAR_INT_MODE_P (mode
));
16179 if (type_die
== NULL
)
16181 mem_loc_result
= new_loc_descr (dwarf_OP (DW_OP_const_type
), 0, 0);
16182 mem_loc_result
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
16183 mem_loc_result
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
16184 mem_loc_result
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
16185 mem_loc_result
->dw_loc_oprnd2
.val_class
16186 = dw_val_class_wide_int
;
16187 mem_loc_result
->dw_loc_oprnd2
.v
.val_wide
= ggc_alloc
<wide_int
> ();
16188 *mem_loc_result
->dw_loc_oprnd2
.v
.val_wide
= rtx_mode_t (rtl
, mode
);
16192 case CONST_POLY_INT
:
16193 mem_loc_result
= int_loc_descriptor (rtx_to_poly_int64 (rtl
));
16197 mem_loc_result
= scompare_loc_descriptor (DW_OP_eq
, rtl
, mem_mode
);
16201 mem_loc_result
= scompare_loc_descriptor (DW_OP_ge
, rtl
, mem_mode
);
16205 mem_loc_result
= scompare_loc_descriptor (DW_OP_gt
, rtl
, mem_mode
);
16209 mem_loc_result
= scompare_loc_descriptor (DW_OP_le
, rtl
, mem_mode
);
16213 mem_loc_result
= scompare_loc_descriptor (DW_OP_lt
, rtl
, mem_mode
);
16217 mem_loc_result
= scompare_loc_descriptor (DW_OP_ne
, rtl
, mem_mode
);
16221 mem_loc_result
= ucompare_loc_descriptor (DW_OP_ge
, rtl
, mem_mode
);
16225 mem_loc_result
= ucompare_loc_descriptor (DW_OP_gt
, rtl
, mem_mode
);
16229 mem_loc_result
= ucompare_loc_descriptor (DW_OP_le
, rtl
, mem_mode
);
16233 mem_loc_result
= ucompare_loc_descriptor (DW_OP_lt
, rtl
, mem_mode
);
16238 if (!SCALAR_INT_MODE_P (mode
))
16243 mem_loc_result
= minmax_loc_descriptor (rtl
, mode
, mem_mode
);
16248 if (CONST_INT_P (XEXP (rtl
, 1))
16249 && CONST_INT_P (XEXP (rtl
, 2))
16250 && is_a
<scalar_int_mode
> (mode
, &int_mode
)
16251 && is_a
<scalar_int_mode
> (GET_MODE (XEXP (rtl
, 0)), &inner_mode
)
16252 && GET_MODE_SIZE (int_mode
) <= DWARF2_ADDR_SIZE
16253 && GET_MODE_SIZE (inner_mode
) <= DWARF2_ADDR_SIZE
16254 && ((unsigned) INTVAL (XEXP (rtl
, 1))
16255 + (unsigned) INTVAL (XEXP (rtl
, 2))
16256 <= GET_MODE_BITSIZE (int_mode
)))
16259 op0
= mem_loc_descriptor (XEXP (rtl
, 0), inner_mode
,
16260 mem_mode
, VAR_INIT_STATUS_INITIALIZED
);
16263 if (GET_CODE (rtl
) == SIGN_EXTRACT
)
16267 mem_loc_result
= op0
;
16268 size
= INTVAL (XEXP (rtl
, 1));
16269 shift
= INTVAL (XEXP (rtl
, 2));
16270 if (BITS_BIG_ENDIAN
)
16271 shift
= GET_MODE_BITSIZE (inner_mode
) - shift
- size
;
16272 if (shift
+ size
!= (int) DWARF2_ADDR_SIZE
)
16274 add_loc_descr (&mem_loc_result
,
16275 int_loc_descriptor (DWARF2_ADDR_SIZE
16277 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_shl
, 0, 0));
16279 if (size
!= (int) DWARF2_ADDR_SIZE
)
16281 add_loc_descr (&mem_loc_result
,
16282 int_loc_descriptor (DWARF2_ADDR_SIZE
- size
));
16283 add_loc_descr (&mem_loc_result
, new_loc_descr (op
, 0, 0));
16290 dw_loc_descr_ref op2
, bra_node
, drop_node
;
16291 op0
= mem_loc_descriptor (XEXP (rtl
, 0),
16292 GET_MODE (XEXP (rtl
, 0)) == VOIDmode
16293 ? word_mode
: GET_MODE (XEXP (rtl
, 0)),
16294 mem_mode
, VAR_INIT_STATUS_INITIALIZED
);
16295 op1
= mem_loc_descriptor (XEXP (rtl
, 1), mode
, mem_mode
,
16296 VAR_INIT_STATUS_INITIALIZED
);
16297 op2
= mem_loc_descriptor (XEXP (rtl
, 2), mode
, mem_mode
,
16298 VAR_INIT_STATUS_INITIALIZED
);
16299 if (op0
== NULL
|| op1
== NULL
|| op2
== NULL
)
16302 mem_loc_result
= op1
;
16303 add_loc_descr (&mem_loc_result
, op2
);
16304 add_loc_descr (&mem_loc_result
, op0
);
16305 bra_node
= new_loc_descr (DW_OP_bra
, 0, 0);
16306 add_loc_descr (&mem_loc_result
, bra_node
);
16307 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_swap
, 0, 0));
16308 drop_node
= new_loc_descr (DW_OP_drop
, 0, 0);
16309 add_loc_descr (&mem_loc_result
, drop_node
);
16310 bra_node
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
16311 bra_node
->dw_loc_oprnd1
.v
.val_loc
= drop_node
;
16316 case FLOAT_TRUNCATE
:
16318 case UNSIGNED_FLOAT
:
16321 if (!dwarf_strict
|| dwarf_version
>= 5)
16323 dw_die_ref type_die
;
16324 dw_loc_descr_ref cvt
;
16326 op0
= mem_loc_descriptor (XEXP (rtl
, 0), GET_MODE (XEXP (rtl
, 0)),
16327 mem_mode
, VAR_INIT_STATUS_INITIALIZED
);
16330 if (is_a
<scalar_int_mode
> (GET_MODE (XEXP (rtl
, 0)), &int_mode
)
16331 && (GET_CODE (rtl
) == FLOAT
16332 || GET_MODE_SIZE (int_mode
) <= DWARF2_ADDR_SIZE
))
16334 type_die
= base_type_for_mode (int_mode
,
16335 GET_CODE (rtl
) == UNSIGNED_FLOAT
);
16336 if (type_die
== NULL
)
16338 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
16339 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
16340 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
16341 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
16342 add_loc_descr (&op0
, cvt
);
16344 type_die
= base_type_for_mode (mode
, GET_CODE (rtl
) == UNSIGNED_FIX
);
16345 if (type_die
== NULL
)
16347 cvt
= new_loc_descr (dwarf_OP (DW_OP_convert
), 0, 0);
16348 cvt
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
16349 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.die
= type_die
;
16350 cvt
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
16351 add_loc_descr (&op0
, cvt
);
16352 if (is_a
<scalar_int_mode
> (mode
, &int_mode
)
16353 && (GET_CODE (rtl
) == FIX
16354 || GET_MODE_SIZE (int_mode
) < DWARF2_ADDR_SIZE
))
16356 op0
= convert_descriptor_to_mode (int_mode
, op0
);
16360 mem_loc_result
= op0
;
16367 if (is_a
<scalar_int_mode
> (mode
, &int_mode
))
16368 mem_loc_result
= clz_loc_descriptor (rtl
, int_mode
, mem_mode
);
16373 if (is_a
<scalar_int_mode
> (mode
, &int_mode
))
16374 mem_loc_result
= popcount_loc_descriptor (rtl
, int_mode
, mem_mode
);
16378 if (is_a
<scalar_int_mode
> (mode
, &int_mode
))
16379 mem_loc_result
= bswap_loc_descriptor (rtl
, int_mode
, mem_mode
);
16384 if (is_a
<scalar_int_mode
> (mode
, &int_mode
))
16385 mem_loc_result
= rotate_loc_descriptor (rtl
, int_mode
, mem_mode
);
16389 /* In theory, we could implement the above. */
16390 /* DWARF cannot represent the unsigned compare operations
16415 case FRACT_CONVERT
:
16416 case UNSIGNED_FRACT_CONVERT
:
16418 case UNSIGNED_SAT_FRACT
:
16424 case VEC_DUPLICATE
:
16428 case STRICT_LOW_PART
:
16436 resolve_one_addr (&rtl
);
16439 /* RTL sequences inside PARALLEL record a series of DWARF operations for
16440 the expression. An UNSPEC rtx represents a raw DWARF operation,
16441 new_loc_descr is called for it to build the operation directly.
16442 Otherwise mem_loc_descriptor is called recursively. */
16446 dw_loc_descr_ref exp_result
= NULL
;
16448 for (; index
< XVECLEN (rtl
, 0); index
++)
16450 rtx elem
= XVECEXP (rtl
, 0, index
);
16451 if (GET_CODE (elem
) == UNSPEC
)
16453 /* Each DWARF operation UNSPEC contain two operands, if
16454 one operand is not used for the operation, const0_rtx is
16456 gcc_assert (XVECLEN (elem
, 0) == 2);
16458 HOST_WIDE_INT dw_op
= XINT (elem
, 1);
16459 HOST_WIDE_INT oprnd1
= INTVAL (XVECEXP (elem
, 0, 0));
16460 HOST_WIDE_INT oprnd2
= INTVAL (XVECEXP (elem
, 0, 1));
16462 = new_loc_descr ((enum dwarf_location_atom
) dw_op
, oprnd1
,
16467 = mem_loc_descriptor (elem
, mode
, mem_mode
,
16468 VAR_INIT_STATUS_INITIALIZED
);
16470 if (!mem_loc_result
)
16471 mem_loc_result
= exp_result
;
16473 add_loc_descr (&mem_loc_result
, exp_result
);
16482 print_rtl (stderr
, rtl
);
16483 gcc_unreachable ();
16488 if (mem_loc_result
&& initialized
== VAR_INIT_STATUS_UNINITIALIZED
)
16489 add_loc_descr (&mem_loc_result
, new_loc_descr (DW_OP_GNU_uninit
, 0, 0));
16491 return mem_loc_result
;
16494 /* Return a descriptor that describes the concatenation of two locations.
16495 This is typically a complex variable. */
16497 static dw_loc_descr_ref
16498 concat_loc_descriptor (rtx x0
, rtx x1
, enum var_init_status initialized
)
16500 /* At present we only track constant-sized pieces. */
16501 unsigned int size0
, size1
;
16502 if (!GET_MODE_SIZE (GET_MODE (x0
)).is_constant (&size0
)
16503 || !GET_MODE_SIZE (GET_MODE (x1
)).is_constant (&size1
))
16506 dw_loc_descr_ref cc_loc_result
= NULL
;
16507 dw_loc_descr_ref x0_ref
16508 = loc_descriptor (x0
, VOIDmode
, VAR_INIT_STATUS_INITIALIZED
);
16509 dw_loc_descr_ref x1_ref
16510 = loc_descriptor (x1
, VOIDmode
, VAR_INIT_STATUS_INITIALIZED
);
16512 if (x0_ref
== 0 || x1_ref
== 0)
16515 cc_loc_result
= x0_ref
;
16516 add_loc_descr_op_piece (&cc_loc_result
, size0
);
16518 add_loc_descr (&cc_loc_result
, x1_ref
);
16519 add_loc_descr_op_piece (&cc_loc_result
, size1
);
16521 if (initialized
== VAR_INIT_STATUS_UNINITIALIZED
)
16522 add_loc_descr (&cc_loc_result
, new_loc_descr (DW_OP_GNU_uninit
, 0, 0));
16524 return cc_loc_result
;
16527 /* Return a descriptor that describes the concatenation of N
16530 static dw_loc_descr_ref
16531 concatn_loc_descriptor (rtx concatn
, enum var_init_status initialized
)
16534 dw_loc_descr_ref cc_loc_result
= NULL
;
16535 unsigned int n
= XVECLEN (concatn
, 0);
16538 for (i
= 0; i
< n
; ++i
)
16540 dw_loc_descr_ref ref
;
16541 rtx x
= XVECEXP (concatn
, 0, i
);
16543 /* At present we only track constant-sized pieces. */
16544 if (!GET_MODE_SIZE (GET_MODE (x
)).is_constant (&size
))
16547 ref
= loc_descriptor (x
, VOIDmode
, VAR_INIT_STATUS_INITIALIZED
);
16551 add_loc_descr (&cc_loc_result
, ref
);
16552 add_loc_descr_op_piece (&cc_loc_result
, size
);
16555 if (cc_loc_result
&& initialized
== VAR_INIT_STATUS_UNINITIALIZED
)
16556 add_loc_descr (&cc_loc_result
, new_loc_descr (DW_OP_GNU_uninit
, 0, 0));
16558 return cc_loc_result
;
16561 /* Helper function for loc_descriptor. Return DW_OP_implicit_pointer
16562 for DEBUG_IMPLICIT_PTR RTL. */
16564 static dw_loc_descr_ref
16565 implicit_ptr_descriptor (rtx rtl
, HOST_WIDE_INT offset
)
16567 dw_loc_descr_ref ret
;
16570 if (dwarf_strict
&& dwarf_version
< 5)
16572 gcc_assert (TREE_CODE (DEBUG_IMPLICIT_PTR_DECL (rtl
)) == VAR_DECL
16573 || TREE_CODE (DEBUG_IMPLICIT_PTR_DECL (rtl
)) == PARM_DECL
16574 || TREE_CODE (DEBUG_IMPLICIT_PTR_DECL (rtl
)) == RESULT_DECL
);
16575 ref
= lookup_decl_die (DEBUG_IMPLICIT_PTR_DECL (rtl
));
16576 ret
= new_loc_descr (dwarf_OP (DW_OP_implicit_pointer
), 0, offset
);
16577 ret
->dw_loc_oprnd2
.val_class
= dw_val_class_const
;
16580 ret
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
16581 ret
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
16582 ret
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
16586 ret
->dw_loc_oprnd1
.val_class
= dw_val_class_decl_ref
;
16587 ret
->dw_loc_oprnd1
.v
.val_decl_ref
= DEBUG_IMPLICIT_PTR_DECL (rtl
);
16592 /* Output a proper Dwarf location descriptor for a variable or parameter
16593 which is either allocated in a register or in a memory location. For a
16594 register, we just generate an OP_REG and the register number. For a
16595 memory location we provide a Dwarf postfix expression describing how to
16596 generate the (dynamic) address of the object onto the address stack.
16598 MODE is mode of the decl if this loc_descriptor is going to be used in
16599 .debug_loc section where DW_OP_stack_value and DW_OP_implicit_value are
16600 allowed, VOIDmode otherwise.
16602 If we don't know how to describe it, return 0. */
16604 static dw_loc_descr_ref
16605 loc_descriptor (rtx rtl
, machine_mode mode
,
16606 enum var_init_status initialized
)
16608 dw_loc_descr_ref loc_result
= NULL
;
16609 scalar_int_mode int_mode
;
16611 switch (GET_CODE (rtl
))
16614 /* The case of a subreg may arise when we have a local (register)
16615 variable or a formal (register) parameter which doesn't quite fill
16616 up an entire register. For now, just assume that it is
16617 legitimate to make the Dwarf info refer to the whole register which
16618 contains the given subreg. */
16619 if (REG_P (SUBREG_REG (rtl
)) && subreg_lowpart_p (rtl
))
16620 loc_result
= loc_descriptor (SUBREG_REG (rtl
),
16621 GET_MODE (SUBREG_REG (rtl
)), initialized
);
16627 loc_result
= reg_loc_descriptor (rtl
, initialized
);
16631 loc_result
= mem_loc_descriptor (XEXP (rtl
, 0), get_address_mode (rtl
),
16632 GET_MODE (rtl
), initialized
);
16633 if (loc_result
== NULL
)
16634 loc_result
= tls_mem_loc_descriptor (rtl
);
16635 if (loc_result
== NULL
)
16637 rtx new_rtl
= avoid_constant_pool_reference (rtl
);
16638 if (new_rtl
!= rtl
)
16639 loc_result
= loc_descriptor (new_rtl
, mode
, initialized
);
16644 loc_result
= concat_loc_descriptor (XEXP (rtl
, 0), XEXP (rtl
, 1),
16649 loc_result
= concatn_loc_descriptor (rtl
, initialized
);
16654 if (GET_CODE (PAT_VAR_LOCATION_LOC (rtl
)) != PARALLEL
)
16656 rtx loc
= PAT_VAR_LOCATION_LOC (rtl
);
16657 if (GET_CODE (loc
) == EXPR_LIST
)
16658 loc
= XEXP (loc
, 0);
16659 loc_result
= loc_descriptor (loc
, mode
, initialized
);
16663 rtl
= XEXP (rtl
, 1);
16668 rtvec par_elems
= XVEC (rtl
, 0);
16669 int num_elem
= GET_NUM_ELEM (par_elems
);
16673 /* Create the first one, so we have something to add to. */
16674 loc_result
= loc_descriptor (XEXP (RTVEC_ELT (par_elems
, 0), 0),
16675 VOIDmode
, initialized
);
16676 if (loc_result
== NULL
)
16678 mode
= GET_MODE (XEXP (RTVEC_ELT (par_elems
, 0), 0));
16679 /* At present we only track constant-sized pieces. */
16680 if (!GET_MODE_SIZE (mode
).is_constant (&size
))
16682 add_loc_descr_op_piece (&loc_result
, size
);
16683 for (i
= 1; i
< num_elem
; i
++)
16685 dw_loc_descr_ref temp
;
16687 temp
= loc_descriptor (XEXP (RTVEC_ELT (par_elems
, i
), 0),
16688 VOIDmode
, initialized
);
16691 add_loc_descr (&loc_result
, temp
);
16692 mode
= GET_MODE (XEXP (RTVEC_ELT (par_elems
, i
), 0));
16693 /* At present we only track constant-sized pieces. */
16694 if (!GET_MODE_SIZE (mode
).is_constant (&size
))
16696 add_loc_descr_op_piece (&loc_result
, size
);
16702 if (mode
!= VOIDmode
&& mode
!= BLKmode
)
16704 int_mode
= as_a
<scalar_int_mode
> (mode
);
16705 loc_result
= address_of_int_loc_descriptor (GET_MODE_SIZE (int_mode
),
16711 if (mode
== VOIDmode
)
16712 mode
= GET_MODE (rtl
);
16714 if (mode
!= VOIDmode
&& (dwarf_version
>= 4 || !dwarf_strict
))
16716 gcc_assert (mode
== GET_MODE (rtl
) || VOIDmode
== GET_MODE (rtl
));
16718 /* Note that a CONST_DOUBLE rtx could represent either an integer
16719 or a floating-point constant. A CONST_DOUBLE is used whenever
16720 the constant requires more than one word in order to be
16721 adequately represented. We output CONST_DOUBLEs as blocks. */
16722 scalar_mode smode
= as_a
<scalar_mode
> (mode
);
16723 loc_result
= new_loc_descr (DW_OP_implicit_value
,
16724 GET_MODE_SIZE (smode
), 0);
16725 #if TARGET_SUPPORTS_WIDE_INT == 0
16726 if (!SCALAR_FLOAT_MODE_P (smode
))
16728 loc_result
->dw_loc_oprnd2
.val_class
= dw_val_class_const_double
;
16729 loc_result
->dw_loc_oprnd2
.v
.val_double
16730 = rtx_to_double_int (rtl
);
16735 unsigned int length
= GET_MODE_SIZE (smode
);
16736 unsigned char *array
= ggc_vec_alloc
<unsigned char> (length
);
16738 insert_float (rtl
, array
);
16739 loc_result
->dw_loc_oprnd2
.val_class
= dw_val_class_vec
;
16740 loc_result
->dw_loc_oprnd2
.v
.val_vec
.length
= length
/ 4;
16741 loc_result
->dw_loc_oprnd2
.v
.val_vec
.elt_size
= 4;
16742 loc_result
->dw_loc_oprnd2
.v
.val_vec
.array
= array
;
16747 case CONST_WIDE_INT
:
16748 if (mode
== VOIDmode
)
16749 mode
= GET_MODE (rtl
);
16751 if (mode
!= VOIDmode
&& (dwarf_version
>= 4 || !dwarf_strict
))
16753 int_mode
= as_a
<scalar_int_mode
> (mode
);
16754 loc_result
= new_loc_descr (DW_OP_implicit_value
,
16755 GET_MODE_SIZE (int_mode
), 0);
16756 loc_result
->dw_loc_oprnd2
.val_class
= dw_val_class_wide_int
;
16757 loc_result
->dw_loc_oprnd2
.v
.val_wide
= ggc_alloc
<wide_int
> ();
16758 *loc_result
->dw_loc_oprnd2
.v
.val_wide
= rtx_mode_t (rtl
, int_mode
);
16763 if (mode
== VOIDmode
)
16764 mode
= GET_MODE (rtl
);
16766 if (mode
!= VOIDmode
16767 /* The combination of a length and byte elt_size doesn't extend
16768 naturally to boolean vectors, where several elements are packed
16769 into the same byte. */
16770 && GET_MODE_CLASS (mode
) != MODE_VECTOR_BOOL
16771 && (dwarf_version
>= 4 || !dwarf_strict
))
16773 unsigned int length
;
16774 if (!CONST_VECTOR_NUNITS (rtl
).is_constant (&length
))
16777 unsigned int elt_size
= GET_MODE_UNIT_SIZE (GET_MODE (rtl
));
16778 unsigned char *array
16779 = ggc_vec_alloc
<unsigned char> (length
* elt_size
);
16782 machine_mode imode
= GET_MODE_INNER (mode
);
16784 gcc_assert (mode
== GET_MODE (rtl
) || VOIDmode
== GET_MODE (rtl
));
16785 switch (GET_MODE_CLASS (mode
))
16787 case MODE_VECTOR_INT
:
16788 for (i
= 0, p
= array
; i
< length
; i
++, p
+= elt_size
)
16790 rtx elt
= CONST_VECTOR_ELT (rtl
, i
);
16791 insert_wide_int (rtx_mode_t (elt
, imode
), p
, elt_size
);
16795 case MODE_VECTOR_FLOAT
:
16796 for (i
= 0, p
= array
; i
< length
; i
++, p
+= elt_size
)
16798 rtx elt
= CONST_VECTOR_ELT (rtl
, i
);
16799 insert_float (elt
, p
);
16804 gcc_unreachable ();
16807 loc_result
= new_loc_descr (DW_OP_implicit_value
,
16808 length
* elt_size
, 0);
16809 loc_result
->dw_loc_oprnd2
.val_class
= dw_val_class_vec
;
16810 loc_result
->dw_loc_oprnd2
.v
.val_vec
.length
= length
;
16811 loc_result
->dw_loc_oprnd2
.v
.val_vec
.elt_size
= elt_size
;
16812 loc_result
->dw_loc_oprnd2
.v
.val_vec
.array
= array
;
16817 if (mode
== VOIDmode
16818 || CONST_SCALAR_INT_P (XEXP (rtl
, 0))
16819 || CONST_DOUBLE_AS_FLOAT_P (XEXP (rtl
, 0))
16820 || GET_CODE (XEXP (rtl
, 0)) == CONST_VECTOR
)
16822 loc_result
= loc_descriptor (XEXP (rtl
, 0), mode
, initialized
);
16827 if (!const_ok_for_output (rtl
))
16831 if (is_a
<scalar_int_mode
> (mode
, &int_mode
)
16832 && GET_MODE_SIZE (int_mode
) == DWARF2_ADDR_SIZE
16833 && (dwarf_version
>= 4 || !dwarf_strict
))
16835 loc_result
= new_addr_loc_descr (rtl
, dtprel_false
);
16836 add_loc_descr (&loc_result
, new_loc_descr (DW_OP_stack_value
, 0, 0));
16837 vec_safe_push (used_rtx_array
, rtl
);
16841 case DEBUG_IMPLICIT_PTR
:
16842 loc_result
= implicit_ptr_descriptor (rtl
, 0);
16846 if (GET_CODE (XEXP (rtl
, 0)) == DEBUG_IMPLICIT_PTR
16847 && CONST_INT_P (XEXP (rtl
, 1)))
16850 = implicit_ptr_descriptor (XEXP (rtl
, 0), INTVAL (XEXP (rtl
, 1)));
16856 if ((is_a
<scalar_int_mode
> (mode
, &int_mode
)
16857 && GET_MODE (rtl
) == int_mode
16858 && GET_MODE_SIZE (int_mode
) <= DWARF2_ADDR_SIZE
16859 && dwarf_version
>= 4)
16860 || (!dwarf_strict
&& mode
!= VOIDmode
&& mode
!= BLKmode
))
16862 /* Value expression. */
16863 loc_result
= mem_loc_descriptor (rtl
, mode
, VOIDmode
, initialized
);
16865 add_loc_descr (&loc_result
,
16866 new_loc_descr (DW_OP_stack_value
, 0, 0));
16874 /* We need to figure out what section we should use as the base for the
16875 address ranges where a given location is valid.
16876 1. If this particular DECL has a section associated with it, use that.
16877 2. If this function has a section associated with it, use that.
16878 3. Otherwise, use the text section.
16879 XXX: If you split a variable across multiple sections, we won't notice. */
16881 static const char *
16882 secname_for_decl (const_tree decl
)
16884 const char *secname
;
16886 if (VAR_OR_FUNCTION_DECL_P (decl
)
16887 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
) || TREE_STATIC (decl
))
16888 && DECL_SECTION_NAME (decl
))
16889 secname
= DECL_SECTION_NAME (decl
);
16890 else if (current_function_decl
&& DECL_SECTION_NAME (current_function_decl
))
16892 if (in_cold_section_p
)
16894 section
*sec
= current_function_section ();
16895 if (sec
->common
.flags
& SECTION_NAMED
)
16896 return sec
->named
.name
;
16898 secname
= DECL_SECTION_NAME (current_function_decl
);
16900 else if (cfun
&& in_cold_section_p
)
16901 secname
= crtl
->subsections
.cold_section_label
;
16903 secname
= text_section_label
;
16908 /* Return true when DECL_BY_REFERENCE is defined and set for DECL. */
16911 decl_by_reference_p (tree decl
)
16913 return ((TREE_CODE (decl
) == PARM_DECL
|| TREE_CODE (decl
) == RESULT_DECL
16915 && DECL_BY_REFERENCE (decl
));
16918 /* Helper function for dw_loc_list. Compute proper Dwarf location descriptor
16921 static dw_loc_descr_ref
16922 dw_loc_list_1 (tree loc
, rtx varloc
, int want_address
,
16923 enum var_init_status initialized
)
16925 int have_address
= 0;
16926 dw_loc_descr_ref descr
;
16929 if (want_address
!= 2)
16931 gcc_assert (GET_CODE (varloc
) == VAR_LOCATION
);
16933 if (GET_CODE (PAT_VAR_LOCATION_LOC (varloc
)) != PARALLEL
)
16935 varloc
= PAT_VAR_LOCATION_LOC (varloc
);
16936 if (GET_CODE (varloc
) == EXPR_LIST
)
16937 varloc
= XEXP (varloc
, 0);
16938 mode
= GET_MODE (varloc
);
16939 if (MEM_P (varloc
))
16941 rtx addr
= XEXP (varloc
, 0);
16942 descr
= mem_loc_descriptor (addr
, get_address_mode (varloc
),
16943 mode
, initialized
);
16948 rtx x
= avoid_constant_pool_reference (varloc
);
16950 descr
= mem_loc_descriptor (x
, mode
, VOIDmode
,
16955 descr
= mem_loc_descriptor (varloc
, mode
, VOIDmode
, initialized
);
16962 if (GET_CODE (varloc
) == VAR_LOCATION
)
16963 mode
= DECL_MODE (PAT_VAR_LOCATION_DECL (varloc
));
16965 mode
= DECL_MODE (loc
);
16966 descr
= loc_descriptor (varloc
, mode
, initialized
);
16973 if (want_address
== 2 && !have_address
16974 && (dwarf_version
>= 4 || !dwarf_strict
))
16976 if (int_size_in_bytes (TREE_TYPE (loc
)) > DWARF2_ADDR_SIZE
)
16978 expansion_failed (loc
, NULL_RTX
,
16979 "DWARF address size mismatch");
16982 add_loc_descr (&descr
, new_loc_descr (DW_OP_stack_value
, 0, 0));
16985 /* Show if we can't fill the request for an address. */
16986 if (want_address
&& !have_address
)
16988 expansion_failed (loc
, NULL_RTX
,
16989 "Want address and only have value");
16993 /* If we've got an address and don't want one, dereference. */
16994 if (!want_address
&& have_address
)
16996 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (loc
));
16997 enum dwarf_location_atom op
;
16999 if (size
> DWARF2_ADDR_SIZE
|| size
== -1)
17001 expansion_failed (loc
, NULL_RTX
,
17002 "DWARF address size mismatch");
17005 else if (size
== DWARF2_ADDR_SIZE
)
17008 op
= DW_OP_deref_size
;
17010 add_loc_descr (&descr
, new_loc_descr (op
, size
, 0));
17016 /* Create a DW_OP_piece or DW_OP_bit_piece for bitsize, or return NULL
17017 if it is not possible. */
17019 static dw_loc_descr_ref
17020 new_loc_descr_op_bit_piece (HOST_WIDE_INT bitsize
, HOST_WIDE_INT offset
)
17022 if ((bitsize
% BITS_PER_UNIT
) == 0 && offset
== 0)
17023 return new_loc_descr (DW_OP_piece
, bitsize
/ BITS_PER_UNIT
, 0);
17024 else if (dwarf_version
>= 3 || !dwarf_strict
)
17025 return new_loc_descr (DW_OP_bit_piece
, bitsize
, offset
);
17030 /* Helper function for dw_loc_list. Compute proper Dwarf location descriptor
17031 for VAR_LOC_NOTE for variable DECL that has been optimized by SRA. */
17033 static dw_loc_descr_ref
17034 dw_sra_loc_expr (tree decl
, rtx loc
)
17037 unsigned HOST_WIDE_INT padsize
= 0;
17038 dw_loc_descr_ref descr
, *descr_tail
;
17039 unsigned HOST_WIDE_INT decl_size
;
17041 enum var_init_status initialized
;
17043 if (DECL_SIZE (decl
) == NULL
17044 || !tree_fits_uhwi_p (DECL_SIZE (decl
)))
17047 decl_size
= tree_to_uhwi (DECL_SIZE (decl
));
17049 descr_tail
= &descr
;
17051 for (p
= loc
; p
; p
= XEXP (p
, 1))
17053 unsigned HOST_WIDE_INT bitsize
= decl_piece_bitsize (p
);
17054 rtx loc_note
= *decl_piece_varloc_ptr (p
);
17055 dw_loc_descr_ref cur_descr
;
17056 dw_loc_descr_ref
*tail
, last
= NULL
;
17057 unsigned HOST_WIDE_INT opsize
= 0;
17059 if (loc_note
== NULL_RTX
17060 || NOTE_VAR_LOCATION_LOC (loc_note
) == NULL_RTX
)
17062 padsize
+= bitsize
;
17065 initialized
= NOTE_VAR_LOCATION_STATUS (loc_note
);
17066 varloc
= NOTE_VAR_LOCATION (loc_note
);
17067 cur_descr
= dw_loc_list_1 (decl
, varloc
, 2, initialized
);
17068 if (cur_descr
== NULL
)
17070 padsize
+= bitsize
;
17074 /* Check that cur_descr either doesn't use
17075 DW_OP_*piece operations, or their sum is equal
17076 to bitsize. Otherwise we can't embed it. */
17077 for (tail
= &cur_descr
; *tail
!= NULL
;
17078 tail
= &(*tail
)->dw_loc_next
)
17079 if ((*tail
)->dw_loc_opc
== DW_OP_piece
)
17081 opsize
+= (*tail
)->dw_loc_oprnd1
.v
.val_unsigned
17085 else if ((*tail
)->dw_loc_opc
== DW_OP_bit_piece
)
17087 opsize
+= (*tail
)->dw_loc_oprnd1
.v
.val_unsigned
;
17091 if (last
!= NULL
&& opsize
!= bitsize
)
17093 padsize
+= bitsize
;
17094 /* Discard the current piece of the descriptor and release any
17095 addr_table entries it uses. */
17096 remove_loc_list_addr_table_entries (cur_descr
);
17100 /* If there is a hole, add DW_OP_*piece after empty DWARF
17101 expression, which means that those bits are optimized out. */
17104 if (padsize
> decl_size
)
17106 remove_loc_list_addr_table_entries (cur_descr
);
17107 goto discard_descr
;
17109 decl_size
-= padsize
;
17110 *descr_tail
= new_loc_descr_op_bit_piece (padsize
, 0);
17111 if (*descr_tail
== NULL
)
17113 remove_loc_list_addr_table_entries (cur_descr
);
17114 goto discard_descr
;
17116 descr_tail
= &(*descr_tail
)->dw_loc_next
;
17119 *descr_tail
= cur_descr
;
17121 if (bitsize
> decl_size
)
17122 goto discard_descr
;
17123 decl_size
-= bitsize
;
17126 HOST_WIDE_INT offset
= 0;
17127 if (GET_CODE (varloc
) == VAR_LOCATION
17128 && GET_CODE (PAT_VAR_LOCATION_LOC (varloc
)) != PARALLEL
)
17130 varloc
= PAT_VAR_LOCATION_LOC (varloc
);
17131 if (GET_CODE (varloc
) == EXPR_LIST
)
17132 varloc
= XEXP (varloc
, 0);
17136 if (GET_CODE (varloc
) == CONST
17137 || GET_CODE (varloc
) == SIGN_EXTEND
17138 || GET_CODE (varloc
) == ZERO_EXTEND
)
17139 varloc
= XEXP (varloc
, 0);
17140 else if (GET_CODE (varloc
) == SUBREG
)
17141 varloc
= SUBREG_REG (varloc
);
17146 /* DW_OP_bit_size offset should be zero for register
17147 or implicit location descriptions and empty location
17148 descriptions, but for memory addresses needs big endian
17150 if (MEM_P (varloc
))
17152 unsigned HOST_WIDE_INT memsize
;
17153 if (!poly_uint64 (MEM_SIZE (varloc
)).is_constant (&memsize
))
17154 goto discard_descr
;
17155 memsize
*= BITS_PER_UNIT
;
17156 if (memsize
!= bitsize
)
17158 if (BYTES_BIG_ENDIAN
!= WORDS_BIG_ENDIAN
17159 && (memsize
> BITS_PER_WORD
|| bitsize
> BITS_PER_WORD
))
17160 goto discard_descr
;
17161 if (memsize
< bitsize
)
17162 goto discard_descr
;
17163 if (BITS_BIG_ENDIAN
)
17164 offset
= memsize
- bitsize
;
17168 *descr_tail
= new_loc_descr_op_bit_piece (bitsize
, offset
);
17169 if (*descr_tail
== NULL
)
17170 goto discard_descr
;
17171 descr_tail
= &(*descr_tail
)->dw_loc_next
;
17175 /* If there were any non-empty expressions, add padding till the end of
17177 if (descr
!= NULL
&& decl_size
!= 0)
17179 *descr_tail
= new_loc_descr_op_bit_piece (decl_size
, 0);
17180 if (*descr_tail
== NULL
)
17181 goto discard_descr
;
17186 /* Discard the descriptor and release any addr_table entries it uses. */
17187 remove_loc_list_addr_table_entries (descr
);
17191 /* Return the dwarf representation of the location list LOC_LIST of
17192 DECL. WANT_ADDRESS has the same meaning as in loc_list_from_tree
17195 static dw_loc_list_ref
17196 dw_loc_list (var_loc_list
*loc_list
, tree decl
, int want_address
)
17198 const char *endname
, *secname
;
17199 var_loc_view endview
;
17201 enum var_init_status initialized
;
17202 struct var_loc_node
*node
;
17203 dw_loc_descr_ref descr
;
17204 char label_id
[MAX_ARTIFICIAL_LABEL_BYTES
];
17205 dw_loc_list_ref list
= NULL
;
17206 dw_loc_list_ref
*listp
= &list
;
17208 /* Now that we know what section we are using for a base,
17209 actually construct the list of locations.
17210 The first location information is what is passed to the
17211 function that creates the location list, and the remaining
17212 locations just get added on to that list.
17213 Note that we only know the start address for a location
17214 (IE location changes), so to build the range, we use
17215 the range [current location start, next location start].
17216 This means we have to special case the last node, and generate
17217 a range of [last location start, end of function label]. */
17219 if (cfun
&& crtl
->has_bb_partition
)
17221 bool save_in_cold_section_p
= in_cold_section_p
;
17222 in_cold_section_p
= first_function_block_is_cold
;
17223 if (loc_list
->last_before_switch
== NULL
)
17224 in_cold_section_p
= !in_cold_section_p
;
17225 secname
= secname_for_decl (decl
);
17226 in_cold_section_p
= save_in_cold_section_p
;
17229 secname
= secname_for_decl (decl
);
17231 for (node
= loc_list
->first
; node
; node
= node
->next
)
17233 bool range_across_switch
= false;
17234 if (GET_CODE (node
->loc
) == EXPR_LIST
17235 || NOTE_VAR_LOCATION_LOC (node
->loc
) != NULL_RTX
)
17237 if (GET_CODE (node
->loc
) == EXPR_LIST
)
17240 /* This requires DW_OP_{,bit_}piece, which is not usable
17241 inside DWARF expressions. */
17242 if (want_address
== 2)
17243 descr
= dw_sra_loc_expr (decl
, node
->loc
);
17247 initialized
= NOTE_VAR_LOCATION_STATUS (node
->loc
);
17248 varloc
= NOTE_VAR_LOCATION (node
->loc
);
17249 descr
= dw_loc_list_1 (decl
, varloc
, want_address
, initialized
);
17253 /* If section switch happens in between node->label
17254 and node->next->label (or end of function) and
17255 we can't emit it as a single entry list,
17256 emit two ranges, first one ending at the end
17257 of first partition and second one starting at the
17258 beginning of second partition. */
17259 if (node
== loc_list
->last_before_switch
17260 && (node
!= loc_list
->first
|| loc_list
->first
->next
17261 /* If we are to emit a view number, we will emit
17262 a loclist rather than a single location
17263 expression for the entire function (see
17264 loc_list_has_views), so we have to split the
17265 range that straddles across partitions. */
17266 || !ZERO_VIEW_P (node
->view
))
17267 && current_function_decl
)
17269 endname
= cfun
->fde
->dw_fde_end
;
17271 range_across_switch
= true;
17273 /* The variable has a location between NODE->LABEL and
17274 NODE->NEXT->LABEL. */
17275 else if (node
->next
)
17276 endname
= node
->next
->label
, endview
= node
->next
->view
;
17277 /* If the variable has a location at the last label
17278 it keeps its location until the end of function. */
17279 else if (!current_function_decl
)
17280 endname
= text_end_label
, endview
= 0;
17283 ASM_GENERATE_INTERNAL_LABEL (label_id
, FUNC_END_LABEL
,
17284 current_function_funcdef_no
);
17285 endname
= ggc_strdup (label_id
);
17289 *listp
= new_loc_list (descr
, node
->label
, node
->view
,
17290 endname
, endview
, secname
);
17291 if (TREE_CODE (decl
) == PARM_DECL
17292 && node
== loc_list
->first
17293 && NOTE_P (node
->loc
)
17294 && strcmp (node
->label
, endname
) == 0)
17295 (*listp
)->force
= true;
17296 listp
= &(*listp
)->dw_loc_next
;
17301 && crtl
->has_bb_partition
17302 && node
== loc_list
->last_before_switch
)
17304 bool save_in_cold_section_p
= in_cold_section_p
;
17305 in_cold_section_p
= !first_function_block_is_cold
;
17306 secname
= secname_for_decl (decl
);
17307 in_cold_section_p
= save_in_cold_section_p
;
17310 if (range_across_switch
)
17312 if (GET_CODE (node
->loc
) == EXPR_LIST
)
17313 descr
= dw_sra_loc_expr (decl
, node
->loc
);
17316 initialized
= NOTE_VAR_LOCATION_STATUS (node
->loc
);
17317 varloc
= NOTE_VAR_LOCATION (node
->loc
);
17318 descr
= dw_loc_list_1 (decl
, varloc
, want_address
,
17321 gcc_assert (descr
);
17322 /* The variable has a location between NODE->LABEL and
17323 NODE->NEXT->LABEL. */
17325 endname
= node
->next
->label
, endview
= node
->next
->view
;
17327 endname
= cfun
->fde
->dw_fde_second_end
, endview
= 0;
17328 *listp
= new_loc_list (descr
, cfun
->fde
->dw_fde_second_begin
, 0,
17329 endname
, endview
, secname
);
17330 listp
= &(*listp
)->dw_loc_next
;
17334 /* Try to avoid the overhead of a location list emitting a location
17335 expression instead, but only if we didn't have more than one
17336 location entry in the first place. If some entries were not
17337 representable, we don't want to pretend a single entry that was
17338 applies to the entire scope in which the variable is
17340 if (list
&& loc_list
->first
->next
)
17343 maybe_gen_llsym (list
);
17348 /* Return if the loc_list has only single element and thus can be represented
17349 as location description. */
17352 single_element_loc_list_p (dw_loc_list_ref list
)
17354 gcc_assert (!list
->dw_loc_next
|| list
->ll_symbol
);
17355 return !list
->ll_symbol
;
17358 /* Duplicate a single element of location list. */
17360 static inline dw_loc_descr_ref
17361 copy_loc_descr (dw_loc_descr_ref ref
)
17363 dw_loc_descr_ref copy
= ggc_alloc
<dw_loc_descr_node
> ();
17364 memcpy (copy
, ref
, sizeof (dw_loc_descr_node
));
17368 /* To each location in list LIST append loc descr REF. */
17371 add_loc_descr_to_each (dw_loc_list_ref list
, dw_loc_descr_ref ref
)
17373 dw_loc_descr_ref copy
;
17374 add_loc_descr (&list
->expr
, ref
);
17375 list
= list
->dw_loc_next
;
17378 copy
= copy_loc_descr (ref
);
17379 add_loc_descr (&list
->expr
, copy
);
17380 while (copy
->dw_loc_next
)
17381 copy
= copy
->dw_loc_next
= copy_loc_descr (copy
->dw_loc_next
);
17382 list
= list
->dw_loc_next
;
17386 /* To each location in list LIST prepend loc descr REF. */
17389 prepend_loc_descr_to_each (dw_loc_list_ref list
, dw_loc_descr_ref ref
)
17391 dw_loc_descr_ref copy
;
17392 dw_loc_descr_ref ref_end
= list
->expr
;
17393 add_loc_descr (&ref
, list
->expr
);
17395 list
= list
->dw_loc_next
;
17398 dw_loc_descr_ref end
= list
->expr
;
17399 list
->expr
= copy
= copy_loc_descr (ref
);
17400 while (copy
->dw_loc_next
!= ref_end
)
17401 copy
= copy
->dw_loc_next
= copy_loc_descr (copy
->dw_loc_next
);
17402 copy
->dw_loc_next
= end
;
17403 list
= list
->dw_loc_next
;
17407 /* Given two lists RET and LIST
17408 produce location list that is result of adding expression in LIST
17409 to expression in RET on each position in program.
17410 Might be destructive on both RET and LIST.
17412 TODO: We handle only simple cases of RET or LIST having at most one
17413 element. General case would involve sorting the lists in program order
17414 and merging them that will need some additional work.
17415 Adding that will improve quality of debug info especially for SRA-ed
17419 add_loc_list (dw_loc_list_ref
*ret
, dw_loc_list_ref list
)
17428 if (!list
->dw_loc_next
)
17430 add_loc_descr_to_each (*ret
, list
->expr
);
17433 if (!(*ret
)->dw_loc_next
)
17435 prepend_loc_descr_to_each (list
, (*ret
)->expr
);
17439 expansion_failed (NULL_TREE
, NULL_RTX
,
17440 "Don't know how to merge two non-trivial"
17441 " location lists.\n");
17446 /* LOC is constant expression. Try a luck, look it up in constant
17447 pool and return its loc_descr of its address. */
17449 static dw_loc_descr_ref
17450 cst_pool_loc_descr (tree loc
)
17452 /* Get an RTL for this, if something has been emitted. */
17453 rtx rtl
= lookup_constant_def (loc
);
17455 if (!rtl
|| !MEM_P (rtl
))
17460 gcc_assert (GET_CODE (XEXP (rtl
, 0)) == SYMBOL_REF
);
17462 /* TODO: We might get more coverage if we was actually delaying expansion
17463 of all expressions till end of compilation when constant pools are fully
17465 if (!TREE_ASM_WRITTEN (SYMBOL_REF_DECL (XEXP (rtl
, 0))))
17467 expansion_failed (loc
, NULL_RTX
,
17468 "CST value in contant pool but not marked.");
17471 return mem_loc_descriptor (XEXP (rtl
, 0), get_address_mode (rtl
),
17472 GET_MODE (rtl
), VAR_INIT_STATUS_INITIALIZED
);
17475 /* Return dw_loc_list representing address of addr_expr LOC
17476 by looking for inner INDIRECT_REF expression and turning
17477 it into simple arithmetics.
17479 See loc_list_from_tree for the meaning of CONTEXT. */
17481 static dw_loc_list_ref
17482 loc_list_for_address_of_addr_expr_of_indirect_ref (tree loc
, bool toplev
,
17483 loc_descr_context
*context
)
17486 poly_int64 bitsize
, bitpos
, bytepos
;
17488 int unsignedp
, reversep
, volatilep
= 0;
17489 dw_loc_list_ref list_ret
= NULL
, list_ret1
= NULL
;
17491 obj
= get_inner_reference (TREE_OPERAND (loc
, 0),
17492 &bitsize
, &bitpos
, &offset
, &mode
,
17493 &unsignedp
, &reversep
, &volatilep
);
17495 if (!multiple_p (bitpos
, BITS_PER_UNIT
, &bytepos
))
17497 expansion_failed (loc
, NULL_RTX
, "bitfield access");
17500 if (!INDIRECT_REF_P (obj
))
17502 expansion_failed (obj
,
17503 NULL_RTX
, "no indirect ref in inner refrence");
17506 if (!offset
&& known_eq (bitpos
, 0))
17507 list_ret
= loc_list_from_tree (TREE_OPERAND (obj
, 0), toplev
? 2 : 1,
17510 && int_size_in_bytes (TREE_TYPE (loc
)) <= DWARF2_ADDR_SIZE
17511 && (dwarf_version
>= 4 || !dwarf_strict
))
17513 list_ret
= loc_list_from_tree (TREE_OPERAND (obj
, 0), 0, context
);
17518 /* Variable offset. */
17519 list_ret1
= loc_list_from_tree (offset
, 0, context
);
17520 if (list_ret1
== 0)
17522 add_loc_list (&list_ret
, list_ret1
);
17525 add_loc_descr_to_each (list_ret
,
17526 new_loc_descr (DW_OP_plus
, 0, 0));
17528 HOST_WIDE_INT value
;
17529 if (bytepos
.is_constant (&value
) && value
> 0)
17530 add_loc_descr_to_each (list_ret
,
17531 new_loc_descr (DW_OP_plus_uconst
, value
, 0));
17532 else if (maybe_ne (bytepos
, 0))
17533 loc_list_plus_const (list_ret
, bytepos
);
17534 add_loc_descr_to_each (list_ret
,
17535 new_loc_descr (DW_OP_stack_value
, 0, 0));
17540 /* Set LOC to the next operation that is not a DW_OP_nop operation. In the case
17541 all operations from LOC are nops, move to the last one. Insert in NOPS all
17542 operations that are skipped. */
17545 loc_descr_to_next_no_nop (dw_loc_descr_ref
&loc
,
17546 hash_set
<dw_loc_descr_ref
> &nops
)
17548 while (loc
->dw_loc_next
!= NULL
&& loc
->dw_loc_opc
== DW_OP_nop
)
17551 loc
= loc
->dw_loc_next
;
17555 /* Helper for loc_descr_without_nops: free the location description operation
17559 free_loc_descr (const dw_loc_descr_ref
&loc
, void *data ATTRIBUTE_UNUSED
)
17565 /* Remove all DW_OP_nop operations from LOC except, if it exists, the one that
17569 loc_descr_without_nops (dw_loc_descr_ref
&loc
)
17571 if (loc
->dw_loc_opc
== DW_OP_nop
&& loc
->dw_loc_next
== NULL
)
17574 /* Set of all DW_OP_nop operations we remove. */
17575 hash_set
<dw_loc_descr_ref
> nops
;
17577 /* First, strip all prefix NOP operations in order to keep the head of the
17578 operations list. */
17579 loc_descr_to_next_no_nop (loc
, nops
);
17581 for (dw_loc_descr_ref cur
= loc
; cur
!= NULL
;)
17583 /* For control flow operations: strip "prefix" nops in destination
17585 if (cur
->dw_loc_oprnd1
.val_class
== dw_val_class_loc
)
17586 loc_descr_to_next_no_nop (cur
->dw_loc_oprnd1
.v
.val_loc
, nops
);
17587 if (cur
->dw_loc_oprnd2
.val_class
== dw_val_class_loc
)
17588 loc_descr_to_next_no_nop (cur
->dw_loc_oprnd2
.v
.val_loc
, nops
);
17590 /* Do the same for the operations that follow, then move to the next
17592 if (cur
->dw_loc_next
!= NULL
)
17593 loc_descr_to_next_no_nop (cur
->dw_loc_next
, nops
);
17594 cur
= cur
->dw_loc_next
;
17597 nops
.traverse
<void *, free_loc_descr
> (NULL
);
17601 struct dwarf_procedure_info
;
17603 /* Helper structure for location descriptions generation. */
17604 struct loc_descr_context
17606 /* The type that is implicitly referenced by DW_OP_push_object_address, or
17607 NULL_TREE if DW_OP_push_object_address in invalid for this location
17608 description. This is used when processing PLACEHOLDER_EXPR nodes. */
17610 /* The ..._DECL node that should be translated as a
17611 DW_OP_push_object_address operation. */
17613 /* Information about the DWARF procedure we are currently generating. NULL if
17614 we are not generating a DWARF procedure. */
17615 struct dwarf_procedure_info
*dpi
;
17616 /* True if integral PLACEHOLDER_EXPR stands for the first argument passed
17617 by consumer. Used for DW_TAG_generic_subrange attributes. */
17618 bool placeholder_arg
;
17619 /* True if PLACEHOLDER_EXPR has been seen. */
17620 bool placeholder_seen
;
17623 /* DWARF procedures generation
17625 DWARF expressions (aka. location descriptions) are used to encode variable
17626 things such as sizes or offsets. Such computations can have redundant parts
17627 that can be factorized in order to reduce the size of the output debug
17628 information. This is the whole point of DWARF procedures.
17630 Thanks to stor-layout.c, size and offset expressions in GENERIC trees are
17631 already factorized into functions ("size functions") in order to handle very
17632 big and complex types. Such functions are quite simple: they have integral
17633 arguments, they return an integral result and their body contains only a
17634 return statement with arithmetic expressions. This is the only kind of
17635 function we are interested in translating into DWARF procedures, here.
17637 DWARF expressions and DWARF procedure are executed using a stack, so we have
17638 to define some calling convention for them to interact. Let's say that:
17640 - Before calling a DWARF procedure, DWARF expressions must push on the stack
17641 all arguments in reverse order (right-to-left) so that when the DWARF
17642 procedure execution starts, the first argument is the top of the stack.
17644 - Then, when returning, the DWARF procedure must have consumed all arguments
17645 on the stack, must have pushed the result and touched nothing else.
17647 - Each integral argument and the result are integral types can be hold in a
17650 - We call "frame offset" the number of stack slots that are "under DWARF
17651 procedure control": it includes the arguments slots, the temporaries and
17652 the result slot. Thus, it is equal to the number of arguments when the
17653 procedure execution starts and must be equal to one (the result) when it
17656 /* Helper structure used when generating operations for a DWARF procedure. */
17657 struct dwarf_procedure_info
17659 /* The FUNCTION_DECL node corresponding to the DWARF procedure that is
17660 currently translated. */
17662 /* The number of arguments FNDECL takes. */
17663 unsigned args_count
;
17666 /* Return a pointer to a newly created DIE node for a DWARF procedure. Add
17667 LOCATION as its DW_AT_location attribute. If FNDECL is not NULL_TREE,
17668 equate it to this DIE. */
17671 new_dwarf_proc_die (dw_loc_descr_ref location
, tree fndecl
,
17672 dw_die_ref parent_die
)
17674 dw_die_ref dwarf_proc_die
;
17676 if ((dwarf_version
< 3 && dwarf_strict
)
17677 || location
== NULL
)
17680 dwarf_proc_die
= new_die (DW_TAG_dwarf_procedure
, parent_die
, fndecl
);
17682 equate_decl_number_to_die (fndecl
, dwarf_proc_die
);
17683 add_AT_loc (dwarf_proc_die
, DW_AT_location
, location
);
17684 return dwarf_proc_die
;
17687 /* Return whether TYPE is a supported type as a DWARF procedure argument
17688 type or return type (we handle only scalar types and pointer types that
17689 aren't wider than the DWARF expression evaluation stack. */
17692 is_handled_procedure_type (tree type
)
17694 return ((INTEGRAL_TYPE_P (type
)
17695 || TREE_CODE (type
) == OFFSET_TYPE
17696 || TREE_CODE (type
) == POINTER_TYPE
)
17697 && int_size_in_bytes (type
) <= DWARF2_ADDR_SIZE
);
17700 /* Helper for resolve_args_picking: do the same but stop when coming across
17701 visited nodes. For each node we visit, register in FRAME_OFFSETS the frame
17702 offset *before* evaluating the corresponding operation. */
17705 resolve_args_picking_1 (dw_loc_descr_ref loc
, unsigned initial_frame_offset
,
17706 struct dwarf_procedure_info
*dpi
,
17707 hash_map
<dw_loc_descr_ref
, unsigned> &frame_offsets
)
17709 /* The "frame_offset" identifier is already used to name a macro... */
17710 unsigned frame_offset_
= initial_frame_offset
;
17711 dw_loc_descr_ref l
;
17713 for (l
= loc
; l
!= NULL
;)
17716 unsigned &l_frame_offset
= frame_offsets
.get_or_insert (l
, &existed
);
17718 /* If we already met this node, there is nothing to compute anymore. */
17721 /* Make sure that the stack size is consistent wherever the execution
17722 flow comes from. */
17723 gcc_assert ((unsigned) l_frame_offset
== frame_offset_
);
17726 l_frame_offset
= frame_offset_
;
17728 /* If needed, relocate the picking offset with respect to the frame
17730 if (l
->frame_offset_rel
)
17732 unsigned HOST_WIDE_INT off
;
17733 switch (l
->dw_loc_opc
)
17736 off
= l
->dw_loc_oprnd1
.v
.val_unsigned
;
17745 gcc_unreachable ();
17747 /* frame_offset_ is the size of the current stack frame, including
17748 incoming arguments. Besides, the arguments are pushed
17749 right-to-left. Thus, in order to access the Nth argument from
17750 this operation node, the picking has to skip temporaries *plus*
17751 one stack slot per argument (0 for the first one, 1 for the second
17754 The targetted argument number (N) is already set as the operand,
17755 and the number of temporaries can be computed with:
17756 frame_offsets_ - dpi->args_count */
17757 off
+= frame_offset_
- dpi
->args_count
;
17759 /* DW_OP_pick handles only offsets from 0 to 255 (inclusive)... */
17765 l
->dw_loc_opc
= DW_OP_dup
;
17766 l
->dw_loc_oprnd1
.v
.val_unsigned
= 0;
17770 l
->dw_loc_opc
= DW_OP_over
;
17771 l
->dw_loc_oprnd1
.v
.val_unsigned
= 0;
17775 l
->dw_loc_opc
= DW_OP_pick
;
17776 l
->dw_loc_oprnd1
.v
.val_unsigned
= off
;
17780 /* Update frame_offset according to the effect the current operation has
17782 switch (l
->dw_loc_opc
)
17790 case DW_OP_plus_uconst
:
17826 case DW_OP_deref_size
:
17828 case DW_OP_bit_piece
:
17829 case DW_OP_implicit_value
:
17830 case DW_OP_stack_value
:
17834 case DW_OP_const1u
:
17835 case DW_OP_const1s
:
17836 case DW_OP_const2u
:
17837 case DW_OP_const2s
:
17838 case DW_OP_const4u
:
17839 case DW_OP_const4s
:
17840 case DW_OP_const8u
:
17841 case DW_OP_const8s
:
17912 case DW_OP_push_object_address
:
17913 case DW_OP_call_frame_cfa
:
17914 case DW_OP_GNU_variable_value
:
17915 case DW_OP_GNU_addr_index
:
17916 case DW_OP_GNU_const_index
:
17941 case DW_OP_xderef_size
:
17947 case DW_OP_call_ref
:
17949 dw_die_ref dwarf_proc
= l
->dw_loc_oprnd1
.v
.val_die_ref
.die
;
17950 int *stack_usage
= dwarf_proc_stack_usage_map
->get (dwarf_proc
);
17952 if (stack_usage
== NULL
)
17954 frame_offset_
+= *stack_usage
;
17958 case DW_OP_implicit_pointer
:
17959 case DW_OP_entry_value
:
17960 case DW_OP_const_type
:
17961 case DW_OP_regval_type
:
17962 case DW_OP_deref_type
:
17963 case DW_OP_convert
:
17964 case DW_OP_reinterpret
:
17965 case DW_OP_form_tls_address
:
17966 case DW_OP_GNU_push_tls_address
:
17967 case DW_OP_GNU_uninit
:
17968 case DW_OP_GNU_encoded_addr
:
17969 case DW_OP_GNU_implicit_pointer
:
17970 case DW_OP_GNU_entry_value
:
17971 case DW_OP_GNU_const_type
:
17972 case DW_OP_GNU_regval_type
:
17973 case DW_OP_GNU_deref_type
:
17974 case DW_OP_GNU_convert
:
17975 case DW_OP_GNU_reinterpret
:
17976 case DW_OP_GNU_parameter_ref
:
17977 /* loc_list_from_tree will probably not output these operations for
17978 size functions, so assume they will not appear here. */
17979 /* Fall through... */
17982 gcc_unreachable ();
17985 /* Now, follow the control flow (except subroutine calls). */
17986 switch (l
->dw_loc_opc
)
17989 if (!resolve_args_picking_1 (l
->dw_loc_next
, frame_offset_
, dpi
,
17992 /* Fall through. */
17995 l
= l
->dw_loc_oprnd1
.v
.val_loc
;
17998 case DW_OP_stack_value
:
18002 l
= l
->dw_loc_next
;
18010 /* Make a DFS over operations reachable through LOC (i.e. follow branch
18011 operations) in order to resolve the operand of DW_OP_pick operations that
18012 target DWARF procedure arguments (DPI). INITIAL_FRAME_OFFSET is the frame
18013 offset *before* LOC is executed. Return if all relocations were
18017 resolve_args_picking (dw_loc_descr_ref loc
, unsigned initial_frame_offset
,
18018 struct dwarf_procedure_info
*dpi
)
18020 /* Associate to all visited operations the frame offset *before* evaluating
18022 hash_map
<dw_loc_descr_ref
, unsigned> frame_offsets
;
18024 return resolve_args_picking_1 (loc
, initial_frame_offset
, dpi
,
18028 /* Try to generate a DWARF procedure that computes the same result as FNDECL.
18029 Return NULL if it is not possible. */
18032 function_to_dwarf_procedure (tree fndecl
)
18034 struct loc_descr_context ctx
;
18035 struct dwarf_procedure_info dpi
;
18036 dw_die_ref dwarf_proc_die
;
18037 tree tree_body
= DECL_SAVED_TREE (fndecl
);
18038 dw_loc_descr_ref loc_body
, epilogue
;
18043 /* Do not generate multiple DWARF procedures for the same function
18045 dwarf_proc_die
= lookup_decl_die (fndecl
);
18046 if (dwarf_proc_die
!= NULL
)
18047 return dwarf_proc_die
;
18049 /* DWARF procedures are available starting with the DWARFv3 standard. */
18050 if (dwarf_version
< 3 && dwarf_strict
)
18053 /* We handle only functions for which we still have a body, that return a
18054 supported type and that takes arguments with supported types. Note that
18055 there is no point translating functions that return nothing. */
18056 if (tree_body
== NULL_TREE
18057 || DECL_RESULT (fndecl
) == NULL_TREE
18058 || !is_handled_procedure_type (TREE_TYPE (DECL_RESULT (fndecl
))))
18061 for (cursor
= DECL_ARGUMENTS (fndecl
);
18062 cursor
!= NULL_TREE
;
18063 cursor
= TREE_CHAIN (cursor
))
18064 if (!is_handled_procedure_type (TREE_TYPE (cursor
)))
18067 /* Match only "expr" in: RETURN_EXPR (MODIFY_EXPR (RESULT_DECL, expr)). */
18068 if (TREE_CODE (tree_body
) != RETURN_EXPR
)
18070 tree_body
= TREE_OPERAND (tree_body
, 0);
18071 if (TREE_CODE (tree_body
) != MODIFY_EXPR
18072 || TREE_OPERAND (tree_body
, 0) != DECL_RESULT (fndecl
))
18074 tree_body
= TREE_OPERAND (tree_body
, 1);
18076 /* Try to translate the body expression itself. Note that this will probably
18077 cause an infinite recursion if its call graph has a cycle. This is very
18078 unlikely for size functions, however, so don't bother with such things at
18080 ctx
.context_type
= NULL_TREE
;
18081 ctx
.base_decl
= NULL_TREE
;
18083 ctx
.placeholder_arg
= false;
18084 ctx
.placeholder_seen
= false;
18085 dpi
.fndecl
= fndecl
;
18086 dpi
.args_count
= list_length (DECL_ARGUMENTS (fndecl
));
18087 loc_body
= loc_descriptor_from_tree (tree_body
, 0, &ctx
);
18091 /* After evaluating all operands in "loc_body", we should still have on the
18092 stack all arguments plus the desired function result (top of the stack).
18093 Generate code in order to keep only the result in our stack frame. */
18095 for (i
= 0; i
< dpi
.args_count
; ++i
)
18097 dw_loc_descr_ref op_couple
= new_loc_descr (DW_OP_swap
, 0, 0);
18098 op_couple
->dw_loc_next
= new_loc_descr (DW_OP_drop
, 0, 0);
18099 op_couple
->dw_loc_next
->dw_loc_next
= epilogue
;
18100 epilogue
= op_couple
;
18102 add_loc_descr (&loc_body
, epilogue
);
18103 if (!resolve_args_picking (loc_body
, dpi
.args_count
, &dpi
))
18106 /* Trailing nops from loc_descriptor_from_tree (if any) cannot be removed
18107 because they are considered useful. Now there is an epilogue, they are
18108 not anymore, so give it another try. */
18109 loc_descr_without_nops (loc_body
);
18111 /* fndecl may be used both as a regular DW_TAG_subprogram DIE and as
18112 a DW_TAG_dwarf_procedure, so we may have a conflict, here. It's unlikely,
18113 though, given that size functions do not come from source, so they should
18114 not have a dedicated DW_TAG_subprogram DIE. */
18116 = new_dwarf_proc_die (loc_body
, fndecl
,
18117 get_context_die (DECL_CONTEXT (fndecl
)));
18119 /* The called DWARF procedure consumes one stack slot per argument and
18120 returns one stack slot. */
18121 dwarf_proc_stack_usage_map
->put (dwarf_proc_die
, 1 - dpi
.args_count
);
18123 return dwarf_proc_die
;
18127 /* Generate Dwarf location list representing LOC.
18128 If WANT_ADDRESS is false, expression computing LOC will be computed
18129 If WANT_ADDRESS is 1, expression computing address of LOC will be returned
18130 if WANT_ADDRESS is 2, expression computing address useable in location
18131 will be returned (i.e. DW_OP_reg can be used
18132 to refer to register values).
18134 CONTEXT provides information to customize the location descriptions
18135 generation. Its context_type field specifies what type is implicitly
18136 referenced by DW_OP_push_object_address. If it is NULL_TREE, this operation
18137 will not be generated.
18139 Its DPI field determines whether we are generating a DWARF expression for a
18140 DWARF procedure, so PARM_DECL references are processed specifically.
18142 If CONTEXT is NULL, the behavior is the same as if context_type, base_decl
18143 and dpi fields were null. */
18145 static dw_loc_list_ref
18146 loc_list_from_tree_1 (tree loc
, int want_address
,
18147 struct loc_descr_context
*context
)
18149 dw_loc_descr_ref ret
= NULL
, ret1
= NULL
;
18150 dw_loc_list_ref list_ret
= NULL
, list_ret1
= NULL
;
18151 int have_address
= 0;
18152 enum dwarf_location_atom op
;
18154 /* ??? Most of the time we do not take proper care for sign/zero
18155 extending the values properly. Hopefully this won't be a real
18158 if (context
!= NULL
18159 && context
->base_decl
== loc
18160 && want_address
== 0)
18162 if (dwarf_version
>= 3 || !dwarf_strict
)
18163 return new_loc_list (new_loc_descr (DW_OP_push_object_address
, 0, 0),
18164 NULL
, 0, NULL
, 0, NULL
);
18169 switch (TREE_CODE (loc
))
18172 expansion_failed (loc
, NULL_RTX
, "ERROR_MARK");
18175 case PLACEHOLDER_EXPR
:
18176 /* This case involves extracting fields from an object to determine the
18177 position of other fields. It is supposed to appear only as the first
18178 operand of COMPONENT_REF nodes and to reference precisely the type
18179 that the context allows. */
18180 if (context
!= NULL
18181 && TREE_TYPE (loc
) == context
->context_type
18182 && want_address
>= 1)
18184 if (dwarf_version
>= 3 || !dwarf_strict
)
18186 ret
= new_loc_descr (DW_OP_push_object_address
, 0, 0);
18193 /* For DW_TAG_generic_subrange attributes, PLACEHOLDER_EXPR stands for
18194 the single argument passed by consumer. */
18195 else if (context
!= NULL
18196 && context
->placeholder_arg
18197 && INTEGRAL_TYPE_P (TREE_TYPE (loc
))
18198 && want_address
== 0)
18200 ret
= new_loc_descr (DW_OP_pick
, 0, 0);
18201 ret
->frame_offset_rel
= 1;
18202 context
->placeholder_seen
= true;
18206 expansion_failed (loc
, NULL_RTX
,
18207 "PLACEHOLDER_EXPR for an unexpected type");
18212 const int nargs
= call_expr_nargs (loc
);
18213 tree callee
= get_callee_fndecl (loc
);
18215 dw_die_ref dwarf_proc
;
18217 if (callee
== NULL_TREE
)
18218 goto call_expansion_failed
;
18220 /* We handle only functions that return an integer. */
18221 if (!is_handled_procedure_type (TREE_TYPE (TREE_TYPE (callee
))))
18222 goto call_expansion_failed
;
18224 dwarf_proc
= function_to_dwarf_procedure (callee
);
18225 if (dwarf_proc
== NULL
)
18226 goto call_expansion_failed
;
18228 /* Evaluate arguments right-to-left so that the first argument will
18229 be the top-most one on the stack. */
18230 for (i
= nargs
- 1; i
>= 0; --i
)
18232 dw_loc_descr_ref loc_descr
18233 = loc_descriptor_from_tree (CALL_EXPR_ARG (loc
, i
), 0,
18236 if (loc_descr
== NULL
)
18237 goto call_expansion_failed
;
18239 add_loc_descr (&ret
, loc_descr
);
18242 ret1
= new_loc_descr (DW_OP_call4
, 0, 0);
18243 ret1
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
18244 ret1
->dw_loc_oprnd1
.v
.val_die_ref
.die
= dwarf_proc
;
18245 ret1
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
18246 add_loc_descr (&ret
, ret1
);
18249 call_expansion_failed
:
18250 expansion_failed (loc
, NULL_RTX
, "CALL_EXPR");
18251 /* There are no opcodes for these operations. */
18255 case PREINCREMENT_EXPR
:
18256 case PREDECREMENT_EXPR
:
18257 case POSTINCREMENT_EXPR
:
18258 case POSTDECREMENT_EXPR
:
18259 expansion_failed (loc
, NULL_RTX
, "PRE/POST INDCREMENT/DECREMENT");
18260 /* There are no opcodes for these operations. */
18264 /* If we already want an address, see if there is INDIRECT_REF inside
18265 e.g. for &this->field. */
18268 list_ret
= loc_list_for_address_of_addr_expr_of_indirect_ref
18269 (loc
, want_address
== 2, context
);
18272 else if (decl_address_ip_invariant_p (TREE_OPERAND (loc
, 0))
18273 && (ret
= cst_pool_loc_descr (loc
)))
18276 /* Otherwise, process the argument and look for the address. */
18277 if (!list_ret
&& !ret
)
18278 list_ret
= loc_list_from_tree_1 (TREE_OPERAND (loc
, 0), 1, context
);
18282 expansion_failed (loc
, NULL_RTX
, "need address of ADDR_EXPR");
18288 if (DECL_THREAD_LOCAL_P (loc
))
18291 enum dwarf_location_atom tls_op
;
18292 enum dtprel_bool dtprel
= dtprel_false
;
18294 if (targetm
.have_tls
)
18296 /* If this is not defined, we have no way to emit the
18298 if (!targetm
.asm_out
.output_dwarf_dtprel
)
18301 /* The way DW_OP_GNU_push_tls_address is specified, we
18302 can only look up addresses of objects in the current
18303 module. We used DW_OP_addr as first op, but that's
18304 wrong, because DW_OP_addr is relocated by the debug
18305 info consumer, while DW_OP_GNU_push_tls_address
18306 operand shouldn't be. */
18307 if (DECL_EXTERNAL (loc
) && !targetm
.binds_local_p (loc
))
18309 dtprel
= dtprel_true
;
18310 /* We check for DWARF 5 here because gdb did not implement
18311 DW_OP_form_tls_address until after 7.12. */
18312 tls_op
= (dwarf_version
>= 5 ? DW_OP_form_tls_address
18313 : DW_OP_GNU_push_tls_address
);
18317 if (!targetm
.emutls
.debug_form_tls_address
18318 || !(dwarf_version
>= 3 || !dwarf_strict
))
18320 /* We stuffed the control variable into the DECL_VALUE_EXPR
18321 to signal (via DECL_HAS_VALUE_EXPR_P) that the decl should
18322 no longer appear in gimple code. We used the control
18323 variable in specific so that we could pick it up here. */
18324 loc
= DECL_VALUE_EXPR (loc
);
18325 tls_op
= DW_OP_form_tls_address
;
18328 rtl
= rtl_for_decl_location (loc
);
18329 if (rtl
== NULL_RTX
)
18334 rtl
= XEXP (rtl
, 0);
18335 if (! CONSTANT_P (rtl
))
18338 ret
= new_addr_loc_descr (rtl
, dtprel
);
18339 ret1
= new_loc_descr (tls_op
, 0, 0);
18340 add_loc_descr (&ret
, ret1
);
18348 if (context
!= NULL
&& context
->dpi
!= NULL
18349 && DECL_CONTEXT (loc
) == context
->dpi
->fndecl
)
18351 /* We are generating code for a DWARF procedure and we want to access
18352 one of its arguments: find the appropriate argument offset and let
18353 the resolve_args_picking pass compute the offset that complies
18354 with the stack frame size. */
18358 for (cursor
= DECL_ARGUMENTS (context
->dpi
->fndecl
);
18359 cursor
!= NULL_TREE
&& cursor
!= loc
;
18360 cursor
= TREE_CHAIN (cursor
), ++i
)
18362 /* If we are translating a DWARF procedure, all referenced parameters
18363 must belong to the current function. */
18364 gcc_assert (cursor
!= NULL_TREE
);
18366 ret
= new_loc_descr (DW_OP_pick
, i
, 0);
18367 ret
->frame_offset_rel
= 1;
18373 if (DECL_HAS_VALUE_EXPR_P (loc
))
18374 return loc_list_from_tree_1 (DECL_VALUE_EXPR (loc
),
18375 want_address
, context
);
18378 case FUNCTION_DECL
:
18381 var_loc_list
*loc_list
= lookup_decl_loc (loc
);
18383 if (loc_list
&& loc_list
->first
)
18385 list_ret
= dw_loc_list (loc_list
, loc
, want_address
);
18386 have_address
= want_address
!= 0;
18389 rtl
= rtl_for_decl_location (loc
);
18390 if (rtl
== NULL_RTX
)
18392 if (TREE_CODE (loc
) != FUNCTION_DECL
18394 && current_function_decl
18395 && want_address
!= 1
18396 && ! DECL_IGNORED_P (loc
)
18397 && (INTEGRAL_TYPE_P (TREE_TYPE (loc
))
18398 || POINTER_TYPE_P (TREE_TYPE (loc
)))
18399 && DECL_CONTEXT (loc
) == current_function_decl
18400 && (GET_MODE_SIZE (SCALAR_INT_TYPE_MODE (TREE_TYPE (loc
)))
18401 <= DWARF2_ADDR_SIZE
))
18403 dw_die_ref ref
= lookup_decl_die (loc
);
18404 ret
= new_loc_descr (DW_OP_GNU_variable_value
, 0, 0);
18407 ret
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
18408 ret
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
18409 ret
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
18413 ret
->dw_loc_oprnd1
.val_class
= dw_val_class_decl_ref
;
18414 ret
->dw_loc_oprnd1
.v
.val_decl_ref
= loc
;
18418 expansion_failed (loc
, NULL_RTX
, "DECL has no RTL");
18421 else if (CONST_INT_P (rtl
))
18423 HOST_WIDE_INT val
= INTVAL (rtl
);
18424 if (TYPE_UNSIGNED (TREE_TYPE (loc
)))
18425 val
&= GET_MODE_MASK (DECL_MODE (loc
));
18426 ret
= int_loc_descriptor (val
);
18428 else if (GET_CODE (rtl
) == CONST_STRING
)
18430 expansion_failed (loc
, NULL_RTX
, "CONST_STRING");
18433 else if (CONSTANT_P (rtl
) && const_ok_for_output (rtl
))
18434 ret
= new_addr_loc_descr (rtl
, dtprel_false
);
18437 machine_mode mode
, mem_mode
;
18439 /* Certain constructs can only be represented at top-level. */
18440 if (want_address
== 2)
18442 ret
= loc_descriptor (rtl
, VOIDmode
,
18443 VAR_INIT_STATUS_INITIALIZED
);
18448 mode
= GET_MODE (rtl
);
18449 mem_mode
= VOIDmode
;
18453 mode
= get_address_mode (rtl
);
18454 rtl
= XEXP (rtl
, 0);
18457 ret
= mem_loc_descriptor (rtl
, mode
, mem_mode
,
18458 VAR_INIT_STATUS_INITIALIZED
);
18461 expansion_failed (loc
, rtl
,
18462 "failed to produce loc descriptor for rtl");
18468 if (!integer_zerop (TREE_OPERAND (loc
, 1)))
18475 list_ret
= loc_list_from_tree_1 (TREE_OPERAND (loc
, 0), 0, context
);
18479 case TARGET_MEM_REF
:
18481 case DEBUG_EXPR_DECL
:
18484 case COMPOUND_EXPR
:
18485 return loc_list_from_tree_1 (TREE_OPERAND (loc
, 1), want_address
,
18489 case VIEW_CONVERT_EXPR
:
18492 case NON_LVALUE_EXPR
:
18493 return loc_list_from_tree_1 (TREE_OPERAND (loc
, 0), want_address
,
18496 case COMPONENT_REF
:
18497 case BIT_FIELD_REF
:
18499 case ARRAY_RANGE_REF
:
18500 case REALPART_EXPR
:
18501 case IMAGPART_EXPR
:
18504 poly_int64 bitsize
, bitpos
, bytepos
;
18506 int unsignedp
, reversep
, volatilep
= 0;
18508 obj
= get_inner_reference (loc
, &bitsize
, &bitpos
, &offset
, &mode
,
18509 &unsignedp
, &reversep
, &volatilep
);
18511 gcc_assert (obj
!= loc
);
18513 list_ret
= loc_list_from_tree_1 (obj
,
18515 && known_eq (bitpos
, 0)
18516 && !offset
? 2 : 1,
18518 /* TODO: We can extract value of the small expression via shifting even
18519 for nonzero bitpos. */
18522 if (!multiple_p (bitpos
, BITS_PER_UNIT
, &bytepos
)
18523 || !multiple_p (bitsize
, BITS_PER_UNIT
))
18525 expansion_failed (loc
, NULL_RTX
,
18526 "bitfield access");
18530 if (offset
!= NULL_TREE
)
18532 /* Variable offset. */
18533 list_ret1
= loc_list_from_tree_1 (offset
, 0, context
);
18534 if (list_ret1
== 0)
18536 add_loc_list (&list_ret
, list_ret1
);
18539 add_loc_descr_to_each (list_ret
, new_loc_descr (DW_OP_plus
, 0, 0));
18542 HOST_WIDE_INT value
;
18543 if (bytepos
.is_constant (&value
) && value
> 0)
18544 add_loc_descr_to_each (list_ret
, new_loc_descr (DW_OP_plus_uconst
,
18546 else if (maybe_ne (bytepos
, 0))
18547 loc_list_plus_const (list_ret
, bytepos
);
18554 if ((want_address
|| !tree_fits_shwi_p (loc
))
18555 && (ret
= cst_pool_loc_descr (loc
)))
18557 else if (want_address
== 2
18558 && tree_fits_shwi_p (loc
)
18559 && (ret
= address_of_int_loc_descriptor
18560 (int_size_in_bytes (TREE_TYPE (loc
)),
18561 tree_to_shwi (loc
))))
18563 else if (tree_fits_shwi_p (loc
))
18564 ret
= int_loc_descriptor (tree_to_shwi (loc
));
18565 else if (tree_fits_uhwi_p (loc
))
18566 ret
= uint_loc_descriptor (tree_to_uhwi (loc
));
18569 expansion_failed (loc
, NULL_RTX
,
18570 "Integer operand is not host integer");
18579 expansion_failed (loc
, NULL_RTX
,
18580 "constant address with a runtime component");
18584 if (!poly_int_tree_p (loc
, &value
))
18586 expansion_failed (loc
, NULL_RTX
, "constant too big");
18589 ret
= int_loc_descriptor (value
);
18597 if ((ret
= cst_pool_loc_descr (loc
)))
18599 else if (TREE_CODE (loc
) == CONSTRUCTOR
)
18601 tree type
= TREE_TYPE (loc
);
18602 unsigned HOST_WIDE_INT size
= int_size_in_bytes (type
);
18603 unsigned HOST_WIDE_INT offset
= 0;
18604 unsigned HOST_WIDE_INT cnt
;
18605 constructor_elt
*ce
;
18607 if (TREE_CODE (type
) == RECORD_TYPE
)
18609 /* This is very limited, but it's enough to output
18610 pointers to member functions, as long as the
18611 referenced function is defined in the current
18612 translation unit. */
18613 FOR_EACH_VEC_SAFE_ELT (CONSTRUCTOR_ELTS (loc
), cnt
, ce
)
18615 tree val
= ce
->value
;
18617 tree field
= ce
->index
;
18622 if (!field
|| DECL_BIT_FIELD (field
))
18624 expansion_failed (loc
, NULL_RTX
,
18625 "bitfield in record type constructor");
18626 size
= offset
= (unsigned HOST_WIDE_INT
)-1;
18631 HOST_WIDE_INT fieldsize
= tree_to_shwi (DECL_SIZE_UNIT (field
));
18632 unsigned HOST_WIDE_INT pos
= int_byte_position (field
);
18633 gcc_assert (pos
+ fieldsize
<= size
);
18636 expansion_failed (loc
, NULL_RTX
,
18637 "out-of-order fields in record constructor");
18638 size
= offset
= (unsigned HOST_WIDE_INT
)-1;
18644 ret1
= new_loc_descr (DW_OP_piece
, pos
- offset
, 0);
18645 add_loc_descr (&ret
, ret1
);
18648 if (val
&& fieldsize
!= 0)
18650 ret1
= loc_descriptor_from_tree (val
, want_address
, context
);
18653 expansion_failed (loc
, NULL_RTX
,
18654 "unsupported expression in field");
18655 size
= offset
= (unsigned HOST_WIDE_INT
)-1;
18659 add_loc_descr (&ret
, ret1
);
18663 ret1
= new_loc_descr (DW_OP_piece
, fieldsize
, 0);
18664 add_loc_descr (&ret
, ret1
);
18665 offset
= pos
+ fieldsize
;
18669 if (offset
!= size
)
18671 ret1
= new_loc_descr (DW_OP_piece
, size
- offset
, 0);
18672 add_loc_descr (&ret
, ret1
);
18676 have_address
= !!want_address
;
18679 expansion_failed (loc
, NULL_RTX
,
18680 "constructor of non-record type");
18683 /* We can construct small constants here using int_loc_descriptor. */
18684 expansion_failed (loc
, NULL_RTX
,
18685 "constructor or constant not in constant pool");
18688 case TRUTH_AND_EXPR
:
18689 case TRUTH_ANDIF_EXPR
:
18694 case TRUTH_XOR_EXPR
:
18699 case TRUTH_OR_EXPR
:
18700 case TRUTH_ORIF_EXPR
:
18705 case FLOOR_DIV_EXPR
:
18706 case CEIL_DIV_EXPR
:
18707 case ROUND_DIV_EXPR
:
18708 case TRUNC_DIV_EXPR
:
18709 case EXACT_DIV_EXPR
:
18710 if (TYPE_UNSIGNED (TREE_TYPE (loc
)))
18719 case FLOOR_MOD_EXPR
:
18720 case CEIL_MOD_EXPR
:
18721 case ROUND_MOD_EXPR
:
18722 case TRUNC_MOD_EXPR
:
18723 if (TYPE_UNSIGNED (TREE_TYPE (loc
)))
18728 list_ret
= loc_list_from_tree_1 (TREE_OPERAND (loc
, 0), 0, context
);
18729 list_ret1
= loc_list_from_tree_1 (TREE_OPERAND (loc
, 1), 0, context
);
18730 if (list_ret
== 0 || list_ret1
== 0)
18733 add_loc_list (&list_ret
, list_ret1
);
18736 add_loc_descr_to_each (list_ret
, new_loc_descr (DW_OP_over
, 0, 0));
18737 add_loc_descr_to_each (list_ret
, new_loc_descr (DW_OP_over
, 0, 0));
18738 add_loc_descr_to_each (list_ret
, new_loc_descr (DW_OP_div
, 0, 0));
18739 add_loc_descr_to_each (list_ret
, new_loc_descr (DW_OP_mul
, 0, 0));
18740 add_loc_descr_to_each (list_ret
, new_loc_descr (DW_OP_minus
, 0, 0));
18752 op
= (TYPE_UNSIGNED (TREE_TYPE (loc
)) ? DW_OP_shr
: DW_OP_shra
);
18755 case POINTER_PLUS_EXPR
:
18758 if (tree_fits_shwi_p (TREE_OPERAND (loc
, 1)))
18760 /* Big unsigned numbers can fit in HOST_WIDE_INT but it may be
18761 smarter to encode their opposite. The DW_OP_plus_uconst operation
18762 takes 1 + X bytes, X being the size of the ULEB128 addend. On the
18763 other hand, a "<push literal>; DW_OP_minus" pattern takes 1 + Y
18764 bytes, Y being the size of the operation that pushes the opposite
18765 of the addend. So let's choose the smallest representation. */
18766 const tree tree_addend
= TREE_OPERAND (loc
, 1);
18767 offset_int wi_addend
;
18768 HOST_WIDE_INT shwi_addend
;
18769 dw_loc_descr_ref loc_naddend
;
18771 list_ret
= loc_list_from_tree_1 (TREE_OPERAND (loc
, 0), 0, context
);
18775 /* Try to get the literal to push. It is the opposite of the addend,
18776 so as we rely on wrapping during DWARF evaluation, first decode
18777 the literal as a "DWARF-sized" signed number. */
18778 wi_addend
= wi::to_offset (tree_addend
);
18779 wi_addend
= wi::sext (wi_addend
, DWARF2_ADDR_SIZE
* 8);
18780 shwi_addend
= wi_addend
.to_shwi ();
18781 loc_naddend
= (shwi_addend
!= INTTYPE_MINIMUM (HOST_WIDE_INT
))
18782 ? int_loc_descriptor (-shwi_addend
)
18785 if (loc_naddend
!= NULL
18786 && ((unsigned) size_of_uleb128 (shwi_addend
)
18787 > size_of_loc_descr (loc_naddend
)))
18789 add_loc_descr_to_each (list_ret
, loc_naddend
);
18790 add_loc_descr_to_each (list_ret
,
18791 new_loc_descr (DW_OP_minus
, 0, 0));
18795 for (dw_loc_descr_ref loc_cur
= loc_naddend
; loc_cur
!= NULL
; )
18797 loc_naddend
= loc_cur
;
18798 loc_cur
= loc_cur
->dw_loc_next
;
18799 ggc_free (loc_naddend
);
18801 loc_list_plus_const (list_ret
, wi_addend
.to_shwi ());
18811 goto do_comp_binop
;
18815 goto do_comp_binop
;
18819 goto do_comp_binop
;
18823 goto do_comp_binop
;
18826 if (TYPE_UNSIGNED (TREE_TYPE (TREE_OPERAND (loc
, 0))))
18828 list_ret
= loc_list_from_tree (TREE_OPERAND (loc
, 0), 0, context
);
18829 list_ret1
= loc_list_from_tree (TREE_OPERAND (loc
, 1), 0, context
);
18830 list_ret
= loc_list_from_uint_comparison (list_ret
, list_ret1
,
18846 list_ret
= loc_list_from_tree_1 (TREE_OPERAND (loc
, 0), 0, context
);
18847 list_ret1
= loc_list_from_tree_1 (TREE_OPERAND (loc
, 1), 0, context
);
18848 if (list_ret
== 0 || list_ret1
== 0)
18851 add_loc_list (&list_ret
, list_ret1
);
18854 add_loc_descr_to_each (list_ret
, new_loc_descr (op
, 0, 0));
18857 case TRUTH_NOT_EXPR
:
18871 list_ret
= loc_list_from_tree_1 (TREE_OPERAND (loc
, 0), 0, context
);
18875 add_loc_descr_to_each (list_ret
, new_loc_descr (op
, 0, 0));
18881 const enum tree_code code
=
18882 TREE_CODE (loc
) == MIN_EXPR
? GT_EXPR
: LT_EXPR
;
18884 loc
= build3 (COND_EXPR
, TREE_TYPE (loc
),
18885 build2 (code
, integer_type_node
,
18886 TREE_OPERAND (loc
, 0), TREE_OPERAND (loc
, 1)),
18887 TREE_OPERAND (loc
, 1), TREE_OPERAND (loc
, 0));
18894 dw_loc_descr_ref lhs
18895 = loc_descriptor_from_tree (TREE_OPERAND (loc
, 1), 0, context
);
18896 dw_loc_list_ref rhs
18897 = loc_list_from_tree_1 (TREE_OPERAND (loc
, 2), 0, context
);
18898 dw_loc_descr_ref bra_node
, jump_node
, tmp
;
18900 list_ret
= loc_list_from_tree_1 (TREE_OPERAND (loc
, 0), 0, context
);
18901 if (list_ret
== 0 || lhs
== 0 || rhs
== 0)
18904 bra_node
= new_loc_descr (DW_OP_bra
, 0, 0);
18905 add_loc_descr_to_each (list_ret
, bra_node
);
18907 add_loc_list (&list_ret
, rhs
);
18908 jump_node
= new_loc_descr (DW_OP_skip
, 0, 0);
18909 add_loc_descr_to_each (list_ret
, jump_node
);
18911 add_loc_descr_to_each (list_ret
, lhs
);
18912 bra_node
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
18913 bra_node
->dw_loc_oprnd1
.v
.val_loc
= lhs
;
18915 /* ??? Need a node to point the skip at. Use a nop. */
18916 tmp
= new_loc_descr (DW_OP_nop
, 0, 0);
18917 add_loc_descr_to_each (list_ret
, tmp
);
18918 jump_node
->dw_loc_oprnd1
.val_class
= dw_val_class_loc
;
18919 jump_node
->dw_loc_oprnd1
.v
.val_loc
= tmp
;
18923 case FIX_TRUNC_EXPR
:
18927 /* Leave front-end specific codes as simply unknown. This comes
18928 up, for instance, with the C STMT_EXPR. */
18929 if ((unsigned int) TREE_CODE (loc
)
18930 >= (unsigned int) LAST_AND_UNUSED_TREE_CODE
)
18932 expansion_failed (loc
, NULL_RTX
,
18933 "language specific tree node");
18937 /* Otherwise this is a generic code; we should just lists all of
18938 these explicitly. We forgot one. */
18940 gcc_unreachable ();
18942 /* In a release build, we want to degrade gracefully: better to
18943 generate incomplete debugging information than to crash. */
18947 if (!ret
&& !list_ret
)
18950 if (want_address
== 2 && !have_address
18951 && (dwarf_version
>= 4 || !dwarf_strict
))
18953 if (int_size_in_bytes (TREE_TYPE (loc
)) > DWARF2_ADDR_SIZE
)
18955 expansion_failed (loc
, NULL_RTX
,
18956 "DWARF address size mismatch");
18960 add_loc_descr (&ret
, new_loc_descr (DW_OP_stack_value
, 0, 0));
18962 add_loc_descr_to_each (list_ret
,
18963 new_loc_descr (DW_OP_stack_value
, 0, 0));
18966 /* Show if we can't fill the request for an address. */
18967 if (want_address
&& !have_address
)
18969 expansion_failed (loc
, NULL_RTX
,
18970 "Want address and only have value");
18974 gcc_assert (!ret
|| !list_ret
);
18976 /* If we've got an address and don't want one, dereference. */
18977 if (!want_address
&& have_address
)
18979 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (loc
));
18981 if (size
> DWARF2_ADDR_SIZE
|| size
== -1)
18983 expansion_failed (loc
, NULL_RTX
,
18984 "DWARF address size mismatch");
18987 else if (size
== DWARF2_ADDR_SIZE
)
18990 op
= DW_OP_deref_size
;
18993 add_loc_descr (&ret
, new_loc_descr (op
, size
, 0));
18995 add_loc_descr_to_each (list_ret
, new_loc_descr (op
, size
, 0));
18998 list_ret
= new_loc_list (ret
, NULL
, 0, NULL
, 0, NULL
);
19003 /* Likewise, but strip useless DW_OP_nop operations in the resulting
19006 static dw_loc_list_ref
19007 loc_list_from_tree (tree loc
, int want_address
,
19008 struct loc_descr_context
*context
)
19010 dw_loc_list_ref result
= loc_list_from_tree_1 (loc
, want_address
, context
);
19012 for (dw_loc_list_ref loc_cur
= result
;
19013 loc_cur
!= NULL
; loc_cur
= loc_cur
->dw_loc_next
)
19014 loc_descr_without_nops (loc_cur
->expr
);
19018 /* Same as above but return only single location expression. */
19019 static dw_loc_descr_ref
19020 loc_descriptor_from_tree (tree loc
, int want_address
,
19021 struct loc_descr_context
*context
)
19023 dw_loc_list_ref ret
= loc_list_from_tree (loc
, want_address
, context
);
19026 if (ret
->dw_loc_next
)
19028 expansion_failed (loc
, NULL_RTX
,
19029 "Location list where only loc descriptor needed");
19035 /* Given a pointer to what is assumed to be a FIELD_DECL node, return a
19036 pointer to the declared type for the relevant field variable, or return
19037 `integer_type_node' if the given node turns out to be an
19038 ERROR_MARK node. */
19041 field_type (const_tree decl
)
19045 if (TREE_CODE (decl
) == ERROR_MARK
)
19046 return integer_type_node
;
19048 type
= DECL_BIT_FIELD_TYPE (decl
);
19049 if (type
== NULL_TREE
)
19050 type
= TREE_TYPE (decl
);
19055 /* Given a pointer to a tree node, return the alignment in bits for
19056 it, or else return BITS_PER_WORD if the node actually turns out to
19057 be an ERROR_MARK node. */
19059 static inline unsigned
19060 simple_type_align_in_bits (const_tree type
)
19062 return (TREE_CODE (type
) != ERROR_MARK
) ? TYPE_ALIGN (type
) : BITS_PER_WORD
;
19065 static inline unsigned
19066 simple_decl_align_in_bits (const_tree decl
)
19068 return (TREE_CODE (decl
) != ERROR_MARK
) ? DECL_ALIGN (decl
) : BITS_PER_WORD
;
19071 /* Return the result of rounding T up to ALIGN. */
19073 static inline offset_int
19074 round_up_to_align (const offset_int
&t
, unsigned int align
)
19076 return wi::udiv_trunc (t
+ align
- 1, align
) * align
;
19079 /* Compute the size of TYPE in bytes. If possible, return NULL and store the
19080 size as an integer constant in CST_SIZE. Otherwise, if possible, return a
19081 DWARF expression that computes the size. Return NULL and set CST_SIZE to -1
19082 if we fail to return the size in one of these two forms. */
19084 static dw_loc_descr_ref
19085 type_byte_size (const_tree type
, HOST_WIDE_INT
*cst_size
)
19088 struct loc_descr_context ctx
;
19090 /* Return a constant integer in priority, if possible. */
19091 *cst_size
= int_size_in_bytes (type
);
19092 if (*cst_size
!= -1)
19095 ctx
.context_type
= const_cast<tree
> (type
);
19096 ctx
.base_decl
= NULL_TREE
;
19098 ctx
.placeholder_arg
= false;
19099 ctx
.placeholder_seen
= false;
19101 type
= TYPE_MAIN_VARIANT (type
);
19102 tree_size
= TYPE_SIZE_UNIT (type
);
19103 return ((tree_size
!= NULL_TREE
)
19104 ? loc_descriptor_from_tree (tree_size
, 0, &ctx
)
19108 /* Helper structure for RECORD_TYPE processing. */
19111 /* Root RECORD_TYPE. It is needed to generate data member location
19112 descriptions in variable-length records (VLR), but also to cope with
19113 variants, which are composed of nested structures multiplexed with
19114 QUAL_UNION_TYPE nodes. Each time such a structure is passed to a
19115 function processing a FIELD_DECL, it is required to be non null. */
19117 /* When generating a variant part in a RECORD_TYPE (i.e. a nested
19118 QUAL_UNION_TYPE), this holds an expression that computes the offset for
19119 this variant part as part of the root record (in storage units). For
19120 regular records, it must be NULL_TREE. */
19121 tree variant_part_offset
;
19124 /* Given a pointer to a FIELD_DECL, compute the byte offset of the lowest
19125 addressed byte of the "containing object" for the given FIELD_DECL. If
19126 possible, return a native constant through CST_OFFSET (in which case NULL is
19127 returned); otherwise return a DWARF expression that computes the offset.
19129 Set *CST_OFFSET to 0 and return NULL if we are unable to determine what
19130 that offset is, either because the argument turns out to be a pointer to an
19131 ERROR_MARK node, or because the offset expression is too complex for us.
19133 CTX is required: see the comment for VLR_CONTEXT. */
19135 static dw_loc_descr_ref
19136 field_byte_offset (const_tree decl
, struct vlr_context
*ctx
,
19137 HOST_WIDE_INT
*cst_offset
)
19140 dw_loc_list_ref loc_result
;
19144 if (TREE_CODE (decl
) == ERROR_MARK
)
19147 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
19149 /* We cannot handle variable bit offsets at the moment, so abort if it's the
19151 if (TREE_CODE (DECL_FIELD_BIT_OFFSET (decl
)) != INTEGER_CST
)
19154 /* We used to handle only constant offsets in all cases. Now, we handle
19155 properly dynamic byte offsets only when PCC bitfield type doesn't
19157 if (PCC_BITFIELD_TYPE_MATTERS
19158 && TREE_CODE (DECL_FIELD_OFFSET (decl
)) == INTEGER_CST
)
19160 offset_int object_offset_in_bits
;
19161 offset_int object_offset_in_bytes
;
19162 offset_int bitpos_int
;
19164 tree field_size_tree
;
19165 offset_int deepest_bitpos
;
19166 offset_int field_size_in_bits
;
19167 unsigned int type_align_in_bits
;
19168 unsigned int decl_align_in_bits
;
19169 offset_int type_size_in_bits
;
19171 bitpos_int
= wi::to_offset (bit_position (decl
));
19172 type
= field_type (decl
);
19173 type_size_in_bits
= offset_int_type_size_in_bits (type
);
19174 type_align_in_bits
= simple_type_align_in_bits (type
);
19176 field_size_tree
= DECL_SIZE (decl
);
19178 /* The size could be unspecified if there was an error, or for
19179 a flexible array member. */
19180 if (!field_size_tree
)
19181 field_size_tree
= bitsize_zero_node
;
19183 /* If the size of the field is not constant, use the type size. */
19184 if (TREE_CODE (field_size_tree
) == INTEGER_CST
)
19185 field_size_in_bits
= wi::to_offset (field_size_tree
);
19187 field_size_in_bits
= type_size_in_bits
;
19189 decl_align_in_bits
= simple_decl_align_in_bits (decl
);
19191 /* The GCC front-end doesn't make any attempt to keep track of the
19192 starting bit offset (relative to the start of the containing
19193 structure type) of the hypothetical "containing object" for a
19194 bit-field. Thus, when computing the byte offset value for the
19195 start of the "containing object" of a bit-field, we must deduce
19196 this information on our own. This can be rather tricky to do in
19197 some cases. For example, handling the following structure type
19198 definition when compiling for an i386/i486 target (which only
19199 aligns long long's to 32-bit boundaries) can be very tricky:
19201 struct S { int field1; long long field2:31; };
19203 Fortunately, there is a simple rule-of-thumb which can be used
19204 in such cases. When compiling for an i386/i486, GCC will
19205 allocate 8 bytes for the structure shown above. It decides to
19206 do this based upon one simple rule for bit-field allocation.
19207 GCC allocates each "containing object" for each bit-field at
19208 the first (i.e. lowest addressed) legitimate alignment boundary
19209 (based upon the required minimum alignment for the declared
19210 type of the field) which it can possibly use, subject to the
19211 condition that there is still enough available space remaining
19212 in the containing object (when allocated at the selected point)
19213 to fully accommodate all of the bits of the bit-field itself.
19215 This simple rule makes it obvious why GCC allocates 8 bytes for
19216 each object of the structure type shown above. When looking
19217 for a place to allocate the "containing object" for `field2',
19218 the compiler simply tries to allocate a 64-bit "containing
19219 object" at each successive 32-bit boundary (starting at zero)
19220 until it finds a place to allocate that 64- bit field such that
19221 at least 31 contiguous (and previously unallocated) bits remain
19222 within that selected 64 bit field. (As it turns out, for the
19223 example above, the compiler finds it is OK to allocate the
19224 "containing object" 64-bit field at bit-offset zero within the
19227 Here we attempt to work backwards from the limited set of facts
19228 we're given, and we try to deduce from those facts, where GCC
19229 must have believed that the containing object started (within
19230 the structure type). The value we deduce is then used (by the
19231 callers of this routine) to generate DW_AT_location and
19232 DW_AT_bit_offset attributes for fields (both bit-fields and, in
19233 the case of DW_AT_location, regular fields as well). */
19235 /* Figure out the bit-distance from the start of the structure to
19236 the "deepest" bit of the bit-field. */
19237 deepest_bitpos
= bitpos_int
+ field_size_in_bits
;
19239 /* This is the tricky part. Use some fancy footwork to deduce
19240 where the lowest addressed bit of the containing object must
19242 object_offset_in_bits
= deepest_bitpos
- type_size_in_bits
;
19244 /* Round up to type_align by default. This works best for
19246 object_offset_in_bits
19247 = round_up_to_align (object_offset_in_bits
, type_align_in_bits
);
19249 if (wi::gtu_p (object_offset_in_bits
, bitpos_int
))
19251 object_offset_in_bits
= deepest_bitpos
- type_size_in_bits
;
19253 /* Round up to decl_align instead. */
19254 object_offset_in_bits
19255 = round_up_to_align (object_offset_in_bits
, decl_align_in_bits
);
19258 object_offset_in_bytes
19259 = wi::lrshift (object_offset_in_bits
, LOG2_BITS_PER_UNIT
);
19260 if (ctx
->variant_part_offset
== NULL_TREE
)
19262 *cst_offset
= object_offset_in_bytes
.to_shwi ();
19265 tree_result
= wide_int_to_tree (sizetype
, object_offset_in_bytes
);
19268 tree_result
= byte_position (decl
);
19270 if (ctx
->variant_part_offset
!= NULL_TREE
)
19271 tree_result
= fold_build2 (PLUS_EXPR
, TREE_TYPE (tree_result
),
19272 ctx
->variant_part_offset
, tree_result
);
19274 /* If the byte offset is a constant, it's simplier to handle a native
19275 constant rather than a DWARF expression. */
19276 if (TREE_CODE (tree_result
) == INTEGER_CST
)
19278 *cst_offset
= wi::to_offset (tree_result
).to_shwi ();
19281 struct loc_descr_context loc_ctx
= {
19282 ctx
->struct_type
, /* context_type */
19283 NULL_TREE
, /* base_decl */
19285 false, /* placeholder_arg */
19286 false /* placeholder_seen */
19288 loc_result
= loc_list_from_tree (tree_result
, 0, &loc_ctx
);
19290 /* We want a DWARF expression: abort if we only have a location list with
19291 multiple elements. */
19292 if (!loc_result
|| !single_element_loc_list_p (loc_result
))
19295 return loc_result
->expr
;
19298 /* The following routines define various Dwarf attributes and any data
19299 associated with them. */
19301 /* Add a location description attribute value to a DIE.
19303 This emits location attributes suitable for whole variables and
19304 whole parameters. Note that the location attributes for struct fields are
19305 generated by the routine `data_member_location_attribute' below. */
19308 add_AT_location_description (dw_die_ref die
, enum dwarf_attribute attr_kind
,
19309 dw_loc_list_ref descr
)
19311 bool check_no_locviews
= true;
19314 if (single_element_loc_list_p (descr
))
19315 add_AT_loc (die
, attr_kind
, descr
->expr
);
19318 add_AT_loc_list (die
, attr_kind
, descr
);
19319 gcc_assert (descr
->ll_symbol
);
19320 if (attr_kind
== DW_AT_location
&& descr
->vl_symbol
19321 && dwarf2out_locviews_in_attribute ())
19323 add_AT_view_list (die
, DW_AT_GNU_locviews
);
19324 check_no_locviews
= false;
19328 if (check_no_locviews
)
19329 gcc_assert (!get_AT (die
, DW_AT_GNU_locviews
));
19332 /* Add DW_AT_accessibility attribute to DIE if needed. */
19335 add_accessibility_attribute (dw_die_ref die
, tree decl
)
19337 /* In DWARF3+ the default is DW_ACCESS_private only in DW_TAG_class_type
19338 children, otherwise the default is DW_ACCESS_public. In DWARF2
19339 the default has always been DW_ACCESS_public. */
19340 if (TREE_PROTECTED (decl
))
19341 add_AT_unsigned (die
, DW_AT_accessibility
, DW_ACCESS_protected
);
19342 else if (TREE_PRIVATE (decl
))
19344 if (dwarf_version
== 2
19345 || die
->die_parent
== NULL
19346 || die
->die_parent
->die_tag
!= DW_TAG_class_type
)
19347 add_AT_unsigned (die
, DW_AT_accessibility
, DW_ACCESS_private
);
19349 else if (dwarf_version
> 2
19351 && die
->die_parent
->die_tag
== DW_TAG_class_type
)
19352 add_AT_unsigned (die
, DW_AT_accessibility
, DW_ACCESS_public
);
19355 /* Attach the specialized form of location attribute used for data members of
19356 struct and union types. In the special case of a FIELD_DECL node which
19357 represents a bit-field, the "offset" part of this special location
19358 descriptor must indicate the distance in bytes from the lowest-addressed
19359 byte of the containing struct or union type to the lowest-addressed byte of
19360 the "containing object" for the bit-field. (See the `field_byte_offset'
19363 For any given bit-field, the "containing object" is a hypothetical object
19364 (of some integral or enum type) within which the given bit-field lives. The
19365 type of this hypothetical "containing object" is always the same as the
19366 declared type of the individual bit-field itself (for GCC anyway... the
19367 DWARF spec doesn't actually mandate this). Note that it is the size (in
19368 bytes) of the hypothetical "containing object" which will be given in the
19369 DW_AT_byte_size attribute for this bit-field. (See the
19370 `byte_size_attribute' function below.) It is also used when calculating the
19371 value of the DW_AT_bit_offset attribute. (See the `bit_offset_attribute'
19374 CTX is required: see the comment for VLR_CONTEXT. */
19377 add_data_member_location_attribute (dw_die_ref die
,
19379 struct vlr_context
*ctx
)
19381 HOST_WIDE_INT offset
;
19382 dw_loc_descr_ref loc_descr
= 0;
19384 if (TREE_CODE (decl
) == TREE_BINFO
)
19386 /* We're working on the TAG_inheritance for a base class. */
19387 if (BINFO_VIRTUAL_P (decl
) && is_cxx ())
19389 /* For C++ virtual bases we can't just use BINFO_OFFSET, as they
19390 aren't at a fixed offset from all (sub)objects of the same
19391 type. We need to extract the appropriate offset from our
19392 vtable. The following dwarf expression means
19394 BaseAddr = ObAddr + *((*ObAddr) - Offset)
19396 This is specific to the V3 ABI, of course. */
19398 dw_loc_descr_ref tmp
;
19400 /* Make a copy of the object address. */
19401 tmp
= new_loc_descr (DW_OP_dup
, 0, 0);
19402 add_loc_descr (&loc_descr
, tmp
);
19404 /* Extract the vtable address. */
19405 tmp
= new_loc_descr (DW_OP_deref
, 0, 0);
19406 add_loc_descr (&loc_descr
, tmp
);
19408 /* Calculate the address of the offset. */
19409 offset
= tree_to_shwi (BINFO_VPTR_FIELD (decl
));
19410 gcc_assert (offset
< 0);
19412 tmp
= int_loc_descriptor (-offset
);
19413 add_loc_descr (&loc_descr
, tmp
);
19414 tmp
= new_loc_descr (DW_OP_minus
, 0, 0);
19415 add_loc_descr (&loc_descr
, tmp
);
19417 /* Extract the offset. */
19418 tmp
= new_loc_descr (DW_OP_deref
, 0, 0);
19419 add_loc_descr (&loc_descr
, tmp
);
19421 /* Add it to the object address. */
19422 tmp
= new_loc_descr (DW_OP_plus
, 0, 0);
19423 add_loc_descr (&loc_descr
, tmp
);
19426 offset
= tree_to_shwi (BINFO_OFFSET (decl
));
19430 loc_descr
= field_byte_offset (decl
, ctx
, &offset
);
19432 /* If loc_descr is available then we know the field offset is dynamic.
19433 However, GDB does not handle dynamic field offsets very well at the
19435 if (loc_descr
!= NULL
&& gnat_encodings
!= DWARF_GNAT_ENCODINGS_MINIMAL
)
19441 /* Data member location evalutation starts with the base address on the
19442 stack. Compute the field offset and add it to this base address. */
19443 else if (loc_descr
!= NULL
)
19444 add_loc_descr (&loc_descr
, new_loc_descr (DW_OP_plus
, 0, 0));
19449 /* While DW_AT_data_bit_offset has been added already in DWARF4,
19450 e.g. GDB only added support to it in November 2016. For DWARF5
19451 we need newer debug info consumers anyway. We might change this
19452 to dwarf_version >= 4 once most consumers catched up. */
19453 if (dwarf_version
>= 5
19454 && TREE_CODE (decl
) == FIELD_DECL
19455 && DECL_BIT_FIELD_TYPE (decl
))
19457 tree off
= bit_position (decl
);
19458 if (tree_fits_uhwi_p (off
) && get_AT (die
, DW_AT_bit_size
))
19460 remove_AT (die
, DW_AT_byte_size
);
19461 remove_AT (die
, DW_AT_bit_offset
);
19462 add_AT_unsigned (die
, DW_AT_data_bit_offset
, tree_to_uhwi (off
));
19466 if (dwarf_version
> 2)
19468 /* Don't need to output a location expression, just the constant. */
19470 add_AT_int (die
, DW_AT_data_member_location
, offset
);
19472 add_AT_unsigned (die
, DW_AT_data_member_location
, offset
);
19477 enum dwarf_location_atom op
;
19479 /* The DWARF2 standard says that we should assume that the structure
19480 address is already on the stack, so we can specify a structure
19481 field address by using DW_OP_plus_uconst. */
19482 op
= DW_OP_plus_uconst
;
19483 loc_descr
= new_loc_descr (op
, offset
, 0);
19487 add_AT_loc (die
, DW_AT_data_member_location
, loc_descr
);
19490 /* Writes integer values to dw_vec_const array. */
19493 insert_int (HOST_WIDE_INT val
, unsigned int size
, unsigned char *dest
)
19497 *dest
++ = val
& 0xff;
19503 /* Reads integers from dw_vec_const array. Inverse of insert_int. */
19505 static HOST_WIDE_INT
19506 extract_int (const unsigned char *src
, unsigned int size
)
19508 HOST_WIDE_INT val
= 0;
19514 val
|= *--src
& 0xff;
19520 /* Writes wide_int values to dw_vec_const array. */
19523 insert_wide_int (const wide_int
&val
, unsigned char *dest
, int elt_size
)
19527 if (elt_size
<= HOST_BITS_PER_WIDE_INT
/BITS_PER_UNIT
)
19529 insert_int ((HOST_WIDE_INT
) val
.elt (0), elt_size
, dest
);
19533 /* We'd have to extend this code to support odd sizes. */
19534 gcc_assert (elt_size
% (HOST_BITS_PER_WIDE_INT
/ BITS_PER_UNIT
) == 0);
19536 int n
= elt_size
/ (HOST_BITS_PER_WIDE_INT
/ BITS_PER_UNIT
);
19538 if (WORDS_BIG_ENDIAN
)
19539 for (i
= n
- 1; i
>= 0; i
--)
19541 insert_int ((HOST_WIDE_INT
) val
.elt (i
), sizeof (HOST_WIDE_INT
), dest
);
19542 dest
+= sizeof (HOST_WIDE_INT
);
19545 for (i
= 0; i
< n
; i
++)
19547 insert_int ((HOST_WIDE_INT
) val
.elt (i
), sizeof (HOST_WIDE_INT
), dest
);
19548 dest
+= sizeof (HOST_WIDE_INT
);
19552 /* Writes floating point values to dw_vec_const array. */
19555 insert_float (const_rtx rtl
, unsigned char *array
)
19559 scalar_float_mode mode
= as_a
<scalar_float_mode
> (GET_MODE (rtl
));
19561 real_to_target (val
, CONST_DOUBLE_REAL_VALUE (rtl
), mode
);
19563 /* real_to_target puts 32-bit pieces in each long. Pack them. */
19564 for (i
= 0; i
< GET_MODE_SIZE (mode
) / 4; i
++)
19566 insert_int (val
[i
], 4, array
);
19571 /* Attach a DW_AT_const_value attribute for a variable or a parameter which
19572 does not have a "location" either in memory or in a register. These
19573 things can arise in GNU C when a constant is passed as an actual parameter
19574 to an inlined function. They can also arise in C++ where declared
19575 constants do not necessarily get memory "homes". */
19578 add_const_value_attribute (dw_die_ref die
, rtx rtl
)
19580 switch (GET_CODE (rtl
))
19584 HOST_WIDE_INT val
= INTVAL (rtl
);
19587 add_AT_int (die
, DW_AT_const_value
, val
);
19589 add_AT_unsigned (die
, DW_AT_const_value
, (unsigned HOST_WIDE_INT
) val
);
19593 case CONST_WIDE_INT
:
19595 wide_int w1
= rtx_mode_t (rtl
, MAX_MODE_INT
);
19596 unsigned int prec
= MIN (wi::min_precision (w1
, UNSIGNED
),
19597 (unsigned int)CONST_WIDE_INT_NUNITS (rtl
) * HOST_BITS_PER_WIDE_INT
);
19598 wide_int w
= wi::zext (w1
, prec
);
19599 add_AT_wide (die
, DW_AT_const_value
, w
);
19604 /* Note that a CONST_DOUBLE rtx could represent either an integer or a
19605 floating-point constant. A CONST_DOUBLE is used whenever the
19606 constant requires more than one word in order to be adequately
19608 if (TARGET_SUPPORTS_WIDE_INT
== 0
19609 && !SCALAR_FLOAT_MODE_P (GET_MODE (rtl
)))
19610 add_AT_double (die
, DW_AT_const_value
,
19611 CONST_DOUBLE_HIGH (rtl
), CONST_DOUBLE_LOW (rtl
));
19614 scalar_float_mode mode
= as_a
<scalar_float_mode
> (GET_MODE (rtl
));
19615 unsigned int length
= GET_MODE_SIZE (mode
);
19616 unsigned char *array
= ggc_vec_alloc
<unsigned char> (length
);
19618 insert_float (rtl
, array
);
19619 add_AT_vec (die
, DW_AT_const_value
, length
/ 4, 4, array
);
19625 unsigned int length
;
19626 if (!CONST_VECTOR_NUNITS (rtl
).is_constant (&length
))
19629 machine_mode mode
= GET_MODE (rtl
);
19630 /* The combination of a length and byte elt_size doesn't extend
19631 naturally to boolean vectors, where several elements are packed
19632 into the same byte. */
19633 if (GET_MODE_CLASS (mode
) == MODE_VECTOR_BOOL
)
19636 unsigned int elt_size
= GET_MODE_UNIT_SIZE (mode
);
19637 unsigned char *array
19638 = ggc_vec_alloc
<unsigned char> (length
* elt_size
);
19641 machine_mode imode
= GET_MODE_INNER (mode
);
19643 switch (GET_MODE_CLASS (mode
))
19645 case MODE_VECTOR_INT
:
19646 for (i
= 0, p
= array
; i
< length
; i
++, p
+= elt_size
)
19648 rtx elt
= CONST_VECTOR_ELT (rtl
, i
);
19649 insert_wide_int (rtx_mode_t (elt
, imode
), p
, elt_size
);
19653 case MODE_VECTOR_FLOAT
:
19654 for (i
= 0, p
= array
; i
< length
; i
++, p
+= elt_size
)
19656 rtx elt
= CONST_VECTOR_ELT (rtl
, i
);
19657 insert_float (elt
, p
);
19662 gcc_unreachable ();
19665 add_AT_vec (die
, DW_AT_const_value
, length
, elt_size
, array
);
19670 if (dwarf_version
>= 4 || !dwarf_strict
)
19672 dw_loc_descr_ref loc_result
;
19673 resolve_one_addr (&rtl
);
19675 loc_result
= new_addr_loc_descr (rtl
, dtprel_false
);
19676 add_loc_descr (&loc_result
, new_loc_descr (DW_OP_stack_value
, 0, 0));
19677 add_AT_loc (die
, DW_AT_location
, loc_result
);
19678 vec_safe_push (used_rtx_array
, rtl
);
19684 if (CONSTANT_P (XEXP (rtl
, 0)))
19685 return add_const_value_attribute (die
, XEXP (rtl
, 0));
19688 if (!const_ok_for_output (rtl
))
19692 if (dwarf_version
>= 4 || !dwarf_strict
)
19697 /* In cases where an inlined instance of an inline function is passed
19698 the address of an `auto' variable (which is local to the caller) we
19699 can get a situation where the DECL_RTL of the artificial local
19700 variable (for the inlining) which acts as a stand-in for the
19701 corresponding formal parameter (of the inline function) will look
19702 like (plus:SI (reg:SI FRAME_PTR) (const_int ...)). This is not
19703 exactly a compile-time constant expression, but it isn't the address
19704 of the (artificial) local variable either. Rather, it represents the
19705 *value* which the artificial local variable always has during its
19706 lifetime. We currently have no way to represent such quasi-constant
19707 values in Dwarf, so for now we just punt and generate nothing. */
19715 case CONST_POLY_INT
:
19719 if (GET_CODE (XEXP (rtl
, 0)) == CONST_STRING
19720 && MEM_READONLY_P (rtl
)
19721 && GET_MODE (rtl
) == BLKmode
)
19723 add_AT_string (die
, DW_AT_const_value
, XSTR (XEXP (rtl
, 0), 0));
19729 /* No other kinds of rtx should be possible here. */
19730 gcc_unreachable ();
19735 /* Determine whether the evaluation of EXPR references any variables
19736 or functions which aren't otherwise used (and therefore may not be
19739 reference_to_unused (tree
* tp
, int * walk_subtrees
,
19740 void * data ATTRIBUTE_UNUSED
)
19742 if (! EXPR_P (*tp
) && ! CONSTANT_CLASS_P (*tp
))
19743 *walk_subtrees
= 0;
19745 if (DECL_P (*tp
) && ! TREE_PUBLIC (*tp
) && ! TREE_USED (*tp
)
19746 && ! TREE_ASM_WRITTEN (*tp
))
19748 /* ??? The C++ FE emits debug information for using decls, so
19749 putting gcc_unreachable here falls over. See PR31899. For now
19750 be conservative. */
19751 else if (!symtab
->global_info_ready
&& VAR_OR_FUNCTION_DECL_P (*tp
))
19753 else if (VAR_P (*tp
))
19755 varpool_node
*node
= varpool_node::get (*tp
);
19756 if (!node
|| !node
->definition
)
19759 else if (TREE_CODE (*tp
) == FUNCTION_DECL
19760 && (!DECL_EXTERNAL (*tp
) || DECL_DECLARED_INLINE_P (*tp
)))
19762 /* The call graph machinery must have finished analyzing,
19763 optimizing and gimplifying the CU by now.
19764 So if *TP has no call graph node associated
19765 to it, it means *TP will not be emitted. */
19766 if (!cgraph_node::get (*tp
))
19769 else if (TREE_CODE (*tp
) == STRING_CST
&& !TREE_ASM_WRITTEN (*tp
))
19775 /* Generate an RTL constant from a decl initializer INIT with decl type TYPE,
19776 for use in a later add_const_value_attribute call. */
19779 rtl_for_decl_init (tree init
, tree type
)
19781 rtx rtl
= NULL_RTX
;
19785 /* If a variable is initialized with a string constant without embedded
19786 zeros, build CONST_STRING. */
19787 if (TREE_CODE (init
) == STRING_CST
&& TREE_CODE (type
) == ARRAY_TYPE
)
19789 tree enttype
= TREE_TYPE (type
);
19790 tree domain
= TYPE_DOMAIN (type
);
19791 scalar_int_mode mode
;
19793 if (is_int_mode (TYPE_MODE (enttype
), &mode
)
19794 && GET_MODE_SIZE (mode
) == 1
19796 && TYPE_MAX_VALUE (domain
)
19797 && TREE_CODE (TYPE_MAX_VALUE (domain
)) == INTEGER_CST
19798 && integer_zerop (TYPE_MIN_VALUE (domain
))
19799 && compare_tree_int (TYPE_MAX_VALUE (domain
),
19800 TREE_STRING_LENGTH (init
) - 1) == 0
19801 && ((size_t) TREE_STRING_LENGTH (init
)
19802 == strlen (TREE_STRING_POINTER (init
)) + 1))
19804 rtl
= gen_rtx_CONST_STRING (VOIDmode
,
19805 ggc_strdup (TREE_STRING_POINTER (init
)));
19806 rtl
= gen_rtx_MEM (BLKmode
, rtl
);
19807 MEM_READONLY_P (rtl
) = 1;
19810 /* Other aggregates, and complex values, could be represented using
19812 else if (AGGREGATE_TYPE_P (type
)
19813 || (TREE_CODE (init
) == VIEW_CONVERT_EXPR
19814 && AGGREGATE_TYPE_P (TREE_TYPE (TREE_OPERAND (init
, 0))))
19815 || TREE_CODE (type
) == COMPLEX_TYPE
)
19817 /* Vectors only work if their mode is supported by the target.
19818 FIXME: generic vectors ought to work too. */
19819 else if (TREE_CODE (type
) == VECTOR_TYPE
19820 && !VECTOR_MODE_P (TYPE_MODE (type
)))
19822 /* If the initializer is something that we know will expand into an
19823 immediate RTL constant, expand it now. We must be careful not to
19824 reference variables which won't be output. */
19825 else if (initializer_constant_valid_p (init
, type
)
19826 && ! walk_tree (&init
, reference_to_unused
, NULL
, NULL
))
19828 /* Convert vector CONSTRUCTOR initializers to VECTOR_CST if
19830 if (TREE_CODE (type
) == VECTOR_TYPE
)
19831 switch (TREE_CODE (init
))
19836 if (TREE_CONSTANT (init
))
19838 vec
<constructor_elt
, va_gc
> *elts
= CONSTRUCTOR_ELTS (init
);
19839 bool constant_p
= true;
19841 unsigned HOST_WIDE_INT ix
;
19843 /* Even when ctor is constant, it might contain non-*_CST
19844 elements (e.g. { 1.0/0.0 - 1.0/0.0, 0.0 }) and those don't
19845 belong into VECTOR_CST nodes. */
19846 FOR_EACH_CONSTRUCTOR_VALUE (elts
, ix
, value
)
19847 if (!CONSTANT_CLASS_P (value
))
19849 constant_p
= false;
19855 init
= build_vector_from_ctor (type
, elts
);
19865 rtl
= expand_expr (init
, NULL_RTX
, VOIDmode
, EXPAND_INITIALIZER
);
19867 /* If expand_expr returns a MEM, it wasn't immediate. */
19868 gcc_assert (!rtl
|| !MEM_P (rtl
));
19874 /* Generate RTL for the variable DECL to represent its location. */
19877 rtl_for_decl_location (tree decl
)
19881 /* Here we have to decide where we are going to say the parameter "lives"
19882 (as far as the debugger is concerned). We only have a couple of
19883 choices. GCC provides us with DECL_RTL and with DECL_INCOMING_RTL.
19885 DECL_RTL normally indicates where the parameter lives during most of the
19886 activation of the function. If optimization is enabled however, this
19887 could be either NULL or else a pseudo-reg. Both of those cases indicate
19888 that the parameter doesn't really live anywhere (as far as the code
19889 generation parts of GCC are concerned) during most of the function's
19890 activation. That will happen (for example) if the parameter is never
19891 referenced within the function.
19893 We could just generate a location descriptor here for all non-NULL
19894 non-pseudo values of DECL_RTL and ignore all of the rest, but we can be
19895 a little nicer than that if we also consider DECL_INCOMING_RTL in cases
19896 where DECL_RTL is NULL or is a pseudo-reg.
19898 Note however that we can only get away with using DECL_INCOMING_RTL as
19899 a backup substitute for DECL_RTL in certain limited cases. In cases
19900 where DECL_ARG_TYPE (decl) indicates the same type as TREE_TYPE (decl),
19901 we can be sure that the parameter was passed using the same type as it is
19902 declared to have within the function, and that its DECL_INCOMING_RTL
19903 points us to a place where a value of that type is passed.
19905 In cases where DECL_ARG_TYPE (decl) and TREE_TYPE (decl) are different,
19906 we cannot (in general) use DECL_INCOMING_RTL as a substitute for DECL_RTL
19907 because in these cases DECL_INCOMING_RTL points us to a value of some
19908 type which is *different* from the type of the parameter itself. Thus,
19909 if we tried to use DECL_INCOMING_RTL to generate a location attribute in
19910 such cases, the debugger would end up (for example) trying to fetch a
19911 `float' from a place which actually contains the first part of a
19912 `double'. That would lead to really incorrect and confusing
19913 output at debug-time.
19915 So, in general, we *do not* use DECL_INCOMING_RTL as a backup for DECL_RTL
19916 in cases where DECL_ARG_TYPE (decl) != TREE_TYPE (decl). There
19917 are a couple of exceptions however. On little-endian machines we can
19918 get away with using DECL_INCOMING_RTL even when DECL_ARG_TYPE (decl) is
19919 not the same as TREE_TYPE (decl), but only when DECL_ARG_TYPE (decl) is
19920 an integral type that is smaller than TREE_TYPE (decl). These cases arise
19921 when (on a little-endian machine) a non-prototyped function has a
19922 parameter declared to be of type `short' or `char'. In such cases,
19923 TREE_TYPE (decl) will be `short' or `char', DECL_ARG_TYPE (decl) will
19924 be `int', and DECL_INCOMING_RTL will point to the lowest-order byte of the
19925 passed `int' value. If the debugger then uses that address to fetch
19926 a `short' or a `char' (on a little-endian machine) the result will be
19927 the correct data, so we allow for such exceptional cases below.
19929 Note that our goal here is to describe the place where the given formal
19930 parameter lives during most of the function's activation (i.e. between the
19931 end of the prologue and the start of the epilogue). We'll do that as best
19932 as we can. Note however that if the given formal parameter is modified
19933 sometime during the execution of the function, then a stack backtrace (at
19934 debug-time) will show the function as having been called with the *new*
19935 value rather than the value which was originally passed in. This happens
19936 rarely enough that it is not a major problem, but it *is* a problem, and
19937 I'd like to fix it.
19939 A future version of dwarf2out.c may generate two additional attributes for
19940 any given DW_TAG_formal_parameter DIE which will describe the "passed
19941 type" and the "passed location" for the given formal parameter in addition
19942 to the attributes we now generate to indicate the "declared type" and the
19943 "active location" for each parameter. This additional set of attributes
19944 could be used by debuggers for stack backtraces. Separately, note that
19945 sometimes DECL_RTL can be NULL and DECL_INCOMING_RTL can be NULL also.
19946 This happens (for example) for inlined-instances of inline function formal
19947 parameters which are never referenced. This really shouldn't be
19948 happening. All PARM_DECL nodes should get valid non-NULL
19949 DECL_INCOMING_RTL values. FIXME. */
19951 /* Use DECL_RTL as the "location" unless we find something better. */
19952 rtl
= DECL_RTL_IF_SET (decl
);
19954 /* When generating abstract instances, ignore everything except
19955 constants, symbols living in memory, and symbols living in
19956 fixed registers. */
19957 if (! reload_completed
)
19960 && (CONSTANT_P (rtl
)
19962 && CONSTANT_P (XEXP (rtl
, 0)))
19965 && TREE_STATIC (decl
))))
19967 rtl
= targetm
.delegitimize_address (rtl
);
19972 else if (TREE_CODE (decl
) == PARM_DECL
)
19974 if (rtl
== NULL_RTX
19975 || is_pseudo_reg (rtl
)
19977 && is_pseudo_reg (XEXP (rtl
, 0))
19978 && DECL_INCOMING_RTL (decl
)
19979 && MEM_P (DECL_INCOMING_RTL (decl
))
19980 && GET_MODE (rtl
) == GET_MODE (DECL_INCOMING_RTL (decl
))))
19982 tree declared_type
= TREE_TYPE (decl
);
19983 tree passed_type
= DECL_ARG_TYPE (decl
);
19984 machine_mode dmode
= TYPE_MODE (declared_type
);
19985 machine_mode pmode
= TYPE_MODE (passed_type
);
19987 /* This decl represents a formal parameter which was optimized out.
19988 Note that DECL_INCOMING_RTL may be NULL in here, but we handle
19989 all cases where (rtl == NULL_RTX) just below. */
19990 if (dmode
== pmode
)
19991 rtl
= DECL_INCOMING_RTL (decl
);
19992 else if ((rtl
== NULL_RTX
|| is_pseudo_reg (rtl
))
19993 && SCALAR_INT_MODE_P (dmode
)
19994 && known_le (GET_MODE_SIZE (dmode
), GET_MODE_SIZE (pmode
))
19995 && DECL_INCOMING_RTL (decl
))
19997 rtx inc
= DECL_INCOMING_RTL (decl
);
20000 else if (MEM_P (inc
))
20002 if (BYTES_BIG_ENDIAN
)
20003 rtl
= adjust_address_nv (inc
, dmode
,
20004 GET_MODE_SIZE (pmode
)
20005 - GET_MODE_SIZE (dmode
));
20012 /* If the parm was passed in registers, but lives on the stack, then
20013 make a big endian correction if the mode of the type of the
20014 parameter is not the same as the mode of the rtl. */
20015 /* ??? This is the same series of checks that are made in dbxout.c before
20016 we reach the big endian correction code there. It isn't clear if all
20017 of these checks are necessary here, but keeping them all is the safe
20019 else if (MEM_P (rtl
)
20020 && XEXP (rtl
, 0) != const0_rtx
20021 && ! CONSTANT_P (XEXP (rtl
, 0))
20022 /* Not passed in memory. */
20023 && !MEM_P (DECL_INCOMING_RTL (decl
))
20024 /* Not passed by invisible reference. */
20025 && (!REG_P (XEXP (rtl
, 0))
20026 || REGNO (XEXP (rtl
, 0)) == HARD_FRAME_POINTER_REGNUM
20027 || REGNO (XEXP (rtl
, 0)) == STACK_POINTER_REGNUM
20028 #if !HARD_FRAME_POINTER_IS_ARG_POINTER
20029 || REGNO (XEXP (rtl
, 0)) == ARG_POINTER_REGNUM
20032 /* Big endian correction check. */
20033 && BYTES_BIG_ENDIAN
20034 && TYPE_MODE (TREE_TYPE (decl
)) != GET_MODE (rtl
)
20035 && known_lt (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (decl
))),
20038 machine_mode addr_mode
= get_address_mode (rtl
);
20039 poly_int64 offset
= (UNITS_PER_WORD
20040 - GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (decl
))));
20042 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (decl
)),
20043 plus_constant (addr_mode
, XEXP (rtl
, 0), offset
));
20046 else if (VAR_P (decl
)
20049 && GET_MODE (rtl
) != TYPE_MODE (TREE_TYPE (decl
)))
20051 machine_mode addr_mode
= get_address_mode (rtl
);
20052 poly_int64 offset
= byte_lowpart_offset (TYPE_MODE (TREE_TYPE (decl
)),
20055 /* If a variable is declared "register" yet is smaller than
20056 a register, then if we store the variable to memory, it
20057 looks like we're storing a register-sized value, when in
20058 fact we are not. We need to adjust the offset of the
20059 storage location to reflect the actual value's bytes,
20060 else gdb will not be able to display it. */
20061 if (maybe_ne (offset
, 0))
20062 rtl
= gen_rtx_MEM (TYPE_MODE (TREE_TYPE (decl
)),
20063 plus_constant (addr_mode
, XEXP (rtl
, 0), offset
));
20066 /* A variable with no DECL_RTL but a DECL_INITIAL is a compile-time constant,
20067 and will have been substituted directly into all expressions that use it.
20068 C does not have such a concept, but C++ and other languages do. */
20069 if (!rtl
&& VAR_P (decl
) && DECL_INITIAL (decl
))
20070 rtl
= rtl_for_decl_init (DECL_INITIAL (decl
), TREE_TYPE (decl
));
20073 rtl
= targetm
.delegitimize_address (rtl
);
20075 /* If we don't look past the constant pool, we risk emitting a
20076 reference to a constant pool entry that isn't referenced from
20077 code, and thus is not emitted. */
20079 rtl
= avoid_constant_pool_reference (rtl
);
20081 /* Try harder to get a rtl. If this symbol ends up not being emitted
20082 in the current CU, resolve_addr will remove the expression referencing
20084 if (rtl
== NULL_RTX
20085 && !(early_dwarf
&& (flag_generate_lto
|| flag_generate_offload
))
20087 && !DECL_EXTERNAL (decl
)
20088 && TREE_STATIC (decl
)
20089 && DECL_NAME (decl
)
20090 && !DECL_HARD_REGISTER (decl
)
20091 && DECL_MODE (decl
) != VOIDmode
)
20093 rtl
= make_decl_rtl_for_debug (decl
);
20095 || GET_CODE (XEXP (rtl
, 0)) != SYMBOL_REF
20096 || SYMBOL_REF_DECL (XEXP (rtl
, 0)) != decl
)
20103 /* Check whether decl is a Fortran COMMON symbol. If not, NULL_TREE is
20104 returned. If so, the decl for the COMMON block is returned, and the
20105 value is the offset into the common block for the symbol. */
20108 fortran_common (tree decl
, HOST_WIDE_INT
*value
)
20110 tree val_expr
, cvar
;
20112 poly_int64 bitsize
, bitpos
;
20114 HOST_WIDE_INT cbitpos
;
20115 int unsignedp
, reversep
, volatilep
= 0;
20117 /* If the decl isn't a VAR_DECL, or if it isn't static, or if
20118 it does not have a value (the offset into the common area), or if it
20119 is thread local (as opposed to global) then it isn't common, and shouldn't
20120 be handled as such. */
20122 || !TREE_STATIC (decl
)
20123 || !DECL_HAS_VALUE_EXPR_P (decl
)
20127 val_expr
= DECL_VALUE_EXPR (decl
);
20128 if (TREE_CODE (val_expr
) != COMPONENT_REF
)
20131 cvar
= get_inner_reference (val_expr
, &bitsize
, &bitpos
, &offset
, &mode
,
20132 &unsignedp
, &reversep
, &volatilep
);
20134 if (cvar
== NULL_TREE
20136 || DECL_ARTIFICIAL (cvar
)
20137 || !TREE_PUBLIC (cvar
)
20138 /* We don't expect to have to cope with variable offsets,
20139 since at present all static data must have a constant size. */
20140 || !bitpos
.is_constant (&cbitpos
))
20144 if (offset
!= NULL
)
20146 if (!tree_fits_shwi_p (offset
))
20148 *value
= tree_to_shwi (offset
);
20151 *value
+= cbitpos
/ BITS_PER_UNIT
;
20156 /* Generate *either* a DW_AT_location attribute or else a DW_AT_const_value
20157 data attribute for a variable or a parameter. We generate the
20158 DW_AT_const_value attribute only in those cases where the given variable
20159 or parameter does not have a true "location" either in memory or in a
20160 register. This can happen (for example) when a constant is passed as an
20161 actual argument in a call to an inline function. (It's possible that
20162 these things can crop up in other ways also.) Note that one type of
20163 constant value which can be passed into an inlined function is a constant
20164 pointer. This can happen for example if an actual argument in an inlined
20165 function call evaluates to a compile-time constant address.
20167 CACHE_P is true if it is worth caching the location list for DECL,
20168 so that future calls can reuse it rather than regenerate it from scratch.
20169 This is true for BLOCK_NONLOCALIZED_VARS in inlined subroutines,
20170 since we will need to refer to them each time the function is inlined. */
20173 add_location_or_const_value_attribute (dw_die_ref die
, tree decl
, bool cache_p
)
20176 dw_loc_list_ref list
;
20177 var_loc_list
*loc_list
;
20178 cached_dw_loc_list
*cache
;
20183 if (TREE_CODE (decl
) == ERROR_MARK
)
20186 if (get_AT (die
, DW_AT_location
)
20187 || get_AT (die
, DW_AT_const_value
))
20190 gcc_assert (VAR_P (decl
) || TREE_CODE (decl
) == PARM_DECL
20191 || TREE_CODE (decl
) == RESULT_DECL
);
20193 /* Try to get some constant RTL for this decl, and use that as the value of
20196 rtl
= rtl_for_decl_location (decl
);
20197 if (rtl
&& (CONSTANT_P (rtl
) || GET_CODE (rtl
) == CONST_STRING
)
20198 && add_const_value_attribute (die
, rtl
))
20201 /* See if we have single element location list that is equivalent to
20202 a constant value. That way we are better to use add_const_value_attribute
20203 rather than expanding constant value equivalent. */
20204 loc_list
= lookup_decl_loc (decl
);
20207 && loc_list
->first
->next
== NULL
20208 && NOTE_P (loc_list
->first
->loc
)
20209 && NOTE_VAR_LOCATION (loc_list
->first
->loc
)
20210 && NOTE_VAR_LOCATION_LOC (loc_list
->first
->loc
))
20212 struct var_loc_node
*node
;
20214 node
= loc_list
->first
;
20215 rtl
= NOTE_VAR_LOCATION_LOC (node
->loc
);
20216 if (GET_CODE (rtl
) == EXPR_LIST
)
20217 rtl
= XEXP (rtl
, 0);
20218 if ((CONSTANT_P (rtl
) || GET_CODE (rtl
) == CONST_STRING
)
20219 && add_const_value_attribute (die
, rtl
))
20222 /* If this decl is from BLOCK_NONLOCALIZED_VARS, we might need its
20223 list several times. See if we've already cached the contents. */
20225 if (loc_list
== NULL
|| cached_dw_loc_list_table
== NULL
)
20229 cache
= cached_dw_loc_list_table
->find_with_hash (decl
, DECL_UID (decl
));
20231 list
= cache
->loc_list
;
20235 list
= loc_list_from_tree (decl
, decl_by_reference_p (decl
) ? 0 : 2,
20237 /* It is usually worth caching this result if the decl is from
20238 BLOCK_NONLOCALIZED_VARS and if the list has at least two elements. */
20239 if (cache_p
&& list
&& list
->dw_loc_next
)
20241 cached_dw_loc_list
**slot
20242 = cached_dw_loc_list_table
->find_slot_with_hash (decl
,
20245 cache
= ggc_cleared_alloc
<cached_dw_loc_list
> ();
20246 cache
->decl_id
= DECL_UID (decl
);
20247 cache
->loc_list
= list
;
20253 add_AT_location_description (die
, DW_AT_location
, list
);
20256 /* None of that worked, so it must not really have a location;
20257 try adding a constant value attribute from the DECL_INITIAL. */
20258 return tree_add_const_value_attribute_for_decl (die
, decl
);
20261 /* Attach a DW_AT_const_value attribute to DIE. The value of the
20262 attribute is the const value T. */
20265 tree_add_const_value_attribute (dw_die_ref die
, tree t
)
20268 tree type
= TREE_TYPE (t
);
20271 if (!t
|| !TREE_TYPE (t
) || TREE_TYPE (t
) == error_mark_node
)
20275 gcc_assert (!DECL_P (init
));
20277 if (TREE_CODE (init
) == INTEGER_CST
)
20279 if (tree_fits_uhwi_p (init
))
20281 add_AT_unsigned (die
, DW_AT_const_value
, tree_to_uhwi (init
));
20284 if (tree_fits_shwi_p (init
))
20286 add_AT_int (die
, DW_AT_const_value
, tree_to_shwi (init
));
20292 rtl
= rtl_for_decl_init (init
, type
);
20294 return add_const_value_attribute (die
, rtl
);
20296 /* If the host and target are sane, try harder. */
20297 if (CHAR_BIT
== 8 && BITS_PER_UNIT
== 8
20298 && initializer_constant_valid_p (init
, type
))
20300 HOST_WIDE_INT size
= int_size_in_bytes (TREE_TYPE (init
));
20301 if (size
> 0 && (int) size
== size
)
20303 unsigned char *array
= ggc_cleared_vec_alloc
<unsigned char> (size
);
20305 if (native_encode_initializer (init
, array
, size
) == size
)
20307 add_AT_vec (die
, DW_AT_const_value
, size
, 1, array
);
20316 /* Attach a DW_AT_const_value attribute to VAR_DIE. The value of the
20317 attribute is the const value of T, where T is an integral constant
20318 variable with static storage duration
20319 (so it can't be a PARM_DECL or a RESULT_DECL). */
20322 tree_add_const_value_attribute_for_decl (dw_die_ref var_die
, tree decl
)
20326 || (!VAR_P (decl
) && TREE_CODE (decl
) != CONST_DECL
)
20327 || (VAR_P (decl
) && !TREE_STATIC (decl
)))
20330 if (TREE_READONLY (decl
)
20331 && ! TREE_THIS_VOLATILE (decl
)
20332 && DECL_INITIAL (decl
))
20337 /* Don't add DW_AT_const_value if abstract origin already has one. */
20338 if (get_AT (var_die
, DW_AT_const_value
))
20341 return tree_add_const_value_attribute (var_die
, DECL_INITIAL (decl
));
20344 /* Convert the CFI instructions for the current function into a
20345 location list. This is used for DW_AT_frame_base when we targeting
20346 a dwarf2 consumer that does not support the dwarf3
20347 DW_OP_call_frame_cfa. OFFSET is a constant to be added to all CFA
20350 static dw_loc_list_ref
20351 convert_cfa_to_fb_loc_list (HOST_WIDE_INT offset
)
20355 dw_loc_list_ref list
, *list_tail
;
20357 dw_cfa_location last_cfa
, next_cfa
;
20358 const char *start_label
, *last_label
, *section
;
20359 dw_cfa_location remember
;
20362 gcc_assert (fde
!= NULL
);
20364 section
= secname_for_decl (current_function_decl
);
20368 memset (&next_cfa
, 0, sizeof (next_cfa
));
20369 next_cfa
.reg
= INVALID_REGNUM
;
20370 remember
= next_cfa
;
20372 start_label
= fde
->dw_fde_begin
;
20374 /* ??? Bald assumption that the CIE opcode list does not contain
20375 advance opcodes. */
20376 FOR_EACH_VEC_ELT (*cie_cfi_vec
, ix
, cfi
)
20377 lookup_cfa_1 (cfi
, &next_cfa
, &remember
);
20379 last_cfa
= next_cfa
;
20380 last_label
= start_label
;
20382 if (fde
->dw_fde_second_begin
&& fde
->dw_fde_switch_cfi_index
== 0)
20384 /* If the first partition contained no CFI adjustments, the
20385 CIE opcodes apply to the whole first partition. */
20386 *list_tail
= new_loc_list (build_cfa_loc (&last_cfa
, offset
),
20387 fde
->dw_fde_begin
, 0, fde
->dw_fde_end
, 0, section
);
20388 list_tail
=&(*list_tail
)->dw_loc_next
;
20389 start_label
= last_label
= fde
->dw_fde_second_begin
;
20392 FOR_EACH_VEC_SAFE_ELT (fde
->dw_fde_cfi
, ix
, cfi
)
20394 switch (cfi
->dw_cfi_opc
)
20396 case DW_CFA_set_loc
:
20397 case DW_CFA_advance_loc1
:
20398 case DW_CFA_advance_loc2
:
20399 case DW_CFA_advance_loc4
:
20400 if (!cfa_equal_p (&last_cfa
, &next_cfa
))
20402 *list_tail
= new_loc_list (build_cfa_loc (&last_cfa
, offset
),
20403 start_label
, 0, last_label
, 0, section
);
20405 list_tail
= &(*list_tail
)->dw_loc_next
;
20406 last_cfa
= next_cfa
;
20407 start_label
= last_label
;
20409 last_label
= cfi
->dw_cfi_oprnd1
.dw_cfi_addr
;
20412 case DW_CFA_advance_loc
:
20413 /* The encoding is complex enough that we should never emit this. */
20414 gcc_unreachable ();
20417 lookup_cfa_1 (cfi
, &next_cfa
, &remember
);
20420 if (ix
+ 1 == fde
->dw_fde_switch_cfi_index
)
20422 if (!cfa_equal_p (&last_cfa
, &next_cfa
))
20424 *list_tail
= new_loc_list (build_cfa_loc (&last_cfa
, offset
),
20425 start_label
, 0, last_label
, 0, section
);
20427 list_tail
= &(*list_tail
)->dw_loc_next
;
20428 last_cfa
= next_cfa
;
20429 start_label
= last_label
;
20431 *list_tail
= new_loc_list (build_cfa_loc (&last_cfa
, offset
),
20432 start_label
, 0, fde
->dw_fde_end
, 0, section
);
20433 list_tail
= &(*list_tail
)->dw_loc_next
;
20434 start_label
= last_label
= fde
->dw_fde_second_begin
;
20438 if (!cfa_equal_p (&last_cfa
, &next_cfa
))
20440 *list_tail
= new_loc_list (build_cfa_loc (&last_cfa
, offset
),
20441 start_label
, 0, last_label
, 0, section
);
20442 list_tail
= &(*list_tail
)->dw_loc_next
;
20443 start_label
= last_label
;
20446 *list_tail
= new_loc_list (build_cfa_loc (&next_cfa
, offset
),
20448 fde
->dw_fde_second_begin
20449 ? fde
->dw_fde_second_end
: fde
->dw_fde_end
, 0,
20452 maybe_gen_llsym (list
);
20457 /* Compute a displacement from the "steady-state frame pointer" to the
20458 frame base (often the same as the CFA), and store it in
20459 frame_pointer_fb_offset. OFFSET is added to the displacement
20460 before the latter is negated. */
20463 compute_frame_pointer_to_fb_displacement (poly_int64 offset
)
20467 #ifdef FRAME_POINTER_CFA_OFFSET
20468 reg
= frame_pointer_rtx
;
20469 offset
+= FRAME_POINTER_CFA_OFFSET (current_function_decl
);
20471 reg
= arg_pointer_rtx
;
20472 offset
+= ARG_POINTER_CFA_OFFSET (current_function_decl
);
20475 elim
= (ira_use_lra_p
20476 ? lra_eliminate_regs (reg
, VOIDmode
, NULL_RTX
)
20477 : eliminate_regs (reg
, VOIDmode
, NULL_RTX
));
20478 elim
= strip_offset_and_add (elim
, &offset
);
20480 frame_pointer_fb_offset
= -offset
;
20482 /* ??? AVR doesn't set up valid eliminations when there is no stack frame
20483 in which to eliminate. This is because it's stack pointer isn't
20484 directly accessible as a register within the ISA. To work around
20485 this, assume that while we cannot provide a proper value for
20486 frame_pointer_fb_offset, we won't need one either. We can use
20487 hard frame pointer in debug info even if frame pointer isn't used
20488 since hard frame pointer in debug info is encoded with DW_OP_fbreg
20489 which uses the DW_AT_frame_base attribute, not hard frame pointer
20491 frame_pointer_fb_offset_valid
20492 = (elim
== hard_frame_pointer_rtx
|| elim
== stack_pointer_rtx
);
20495 /* Generate a DW_AT_name attribute given some string value to be included as
20496 the value of the attribute. */
20499 add_name_attribute (dw_die_ref die
, const char *name_string
)
20501 if (name_string
!= NULL
&& *name_string
!= 0)
20503 if (demangle_name_func
)
20504 name_string
= (*demangle_name_func
) (name_string
);
20506 add_AT_string (die
, DW_AT_name
, name_string
);
20510 /* Generate a DW_AT_description attribute given some string value to be included
20511 as the value of the attribute. */
20514 add_desc_attribute (dw_die_ref die
, const char *name_string
)
20516 if (!flag_describe_dies
|| (dwarf_version
< 3 && dwarf_strict
))
20519 if (name_string
== NULL
|| *name_string
== 0)
20522 if (demangle_name_func
)
20523 name_string
= (*demangle_name_func
) (name_string
);
20525 add_AT_string (die
, DW_AT_description
, name_string
);
20528 /* Generate a DW_AT_description attribute given some decl to be included
20529 as the value of the attribute. */
20532 add_desc_attribute (dw_die_ref die
, tree decl
)
20536 if (!flag_describe_dies
|| (dwarf_version
< 3 && dwarf_strict
))
20539 if (decl
== NULL_TREE
|| !DECL_P (decl
))
20541 decl_name
= DECL_NAME (decl
);
20543 if (decl_name
!= NULL
&& IDENTIFIER_POINTER (decl_name
) != NULL
)
20545 const char *name
= dwarf2_name (decl
, 0);
20546 add_desc_attribute (die
, name
? name
: IDENTIFIER_POINTER (decl_name
));
20550 char *desc
= print_generic_expr_to_str (decl
);
20551 add_desc_attribute (die
, desc
);
20556 /* Retrieve the descriptive type of TYPE, if any, make sure it has a
20557 DIE and attach a DW_AT_GNAT_descriptive_type attribute to the DIE
20558 of TYPE accordingly.
20560 ??? This is a temporary measure until after we're able to generate
20561 regular DWARF for the complex Ada type system. */
20564 add_gnat_descriptive_type_attribute (dw_die_ref die
, tree type
,
20565 dw_die_ref context_die
)
20568 dw_die_ref dtype_die
;
20570 if (!lang_hooks
.types
.descriptive_type
)
20573 dtype
= lang_hooks
.types
.descriptive_type (type
);
20577 dtype_die
= lookup_type_die (dtype
);
20580 gen_type_die (dtype
, context_die
);
20581 dtype_die
= lookup_type_die (dtype
);
20582 gcc_assert (dtype_die
);
20585 add_AT_die_ref (die
, DW_AT_GNAT_descriptive_type
, dtype_die
);
20588 /* Retrieve the comp_dir string suitable for use with DW_AT_comp_dir. */
20590 static const char *
20591 comp_dir_string (void)
20594 char *wd_plus_sep
= NULL
;
20595 static const char *cached_wd
= NULL
;
20597 if (cached_wd
!= NULL
)
20600 wd
= get_src_pwd ();
20604 if (DWARF2_DIR_SHOULD_END_WITH_SEPARATOR
)
20606 size_t wdlen
= strlen (wd
);
20607 wd_plus_sep
= XNEWVEC (char, wdlen
+ 2);
20608 strcpy (wd_plus_sep
, wd
);
20609 wd_plus_sep
[wdlen
] = DIR_SEPARATOR
;
20610 wd_plus_sep
[wdlen
+ 1] = 0;
20614 cached_wd
= remap_debug_filename (wd
);
20616 /* remap_debug_filename can just pass through wd or return a new gc string.
20617 These two types can't be both stored in a GTY(())-tagged string, but since
20618 the cached value lives forever just copy it if needed. */
20619 if (cached_wd
!= wd
)
20621 cached_wd
= xstrdup (cached_wd
);
20622 if (DWARF2_DIR_SHOULD_END_WITH_SEPARATOR
&& wd_plus_sep
!= NULL
)
20623 free (wd_plus_sep
);
20629 /* Generate a DW_AT_comp_dir attribute for DIE. */
20632 add_comp_dir_attribute (dw_die_ref die
)
20634 const char * wd
= comp_dir_string ();
20636 add_AT_string (die
, DW_AT_comp_dir
, wd
);
20639 /* Given a tree node VALUE describing a scalar attribute ATTR (i.e. a bound, a
20640 pointer computation, ...), output a representation for that bound according
20641 to the accepted FORMS (see enum dw_scalar_form) and add it to DIE. See
20642 loc_list_from_tree for the meaning of CONTEXT. */
20645 add_scalar_info (dw_die_ref die
, enum dwarf_attribute attr
, tree value
,
20646 int forms
, struct loc_descr_context
*context
)
20648 dw_die_ref context_die
, decl_die
= NULL
;
20649 dw_loc_list_ref list
;
20650 bool strip_conversions
= true;
20651 bool placeholder_seen
= false;
20653 while (strip_conversions
)
20654 switch (TREE_CODE (value
))
20661 case VIEW_CONVERT_EXPR
:
20662 value
= TREE_OPERAND (value
, 0);
20666 strip_conversions
= false;
20670 /* If possible and permitted, output the attribute as a constant. */
20671 if ((forms
& dw_scalar_form_constant
) != 0
20672 && TREE_CODE (value
) == INTEGER_CST
)
20674 unsigned int prec
= simple_type_size_in_bits (TREE_TYPE (value
));
20676 /* If HOST_WIDE_INT is big enough then represent the bound as
20677 a constant value. We need to choose a form based on
20678 whether the type is signed or unsigned. We cannot just
20679 call add_AT_unsigned if the value itself is positive
20680 (add_AT_unsigned might add the unsigned value encoded as
20681 DW_FORM_data[1248]). Some DWARF consumers will lookup the
20682 bounds type and then sign extend any unsigned values found
20683 for signed types. This is needed only for
20684 DW_AT_{lower,upper}_bound, since for most other attributes,
20685 consumers will treat DW_FORM_data[1248] as unsigned values,
20686 regardless of the underlying type. */
20687 if (prec
<= HOST_BITS_PER_WIDE_INT
20688 || tree_fits_uhwi_p (value
))
20690 if (TYPE_UNSIGNED (TREE_TYPE (value
)))
20691 add_AT_unsigned (die
, attr
, TREE_INT_CST_LOW (value
));
20693 add_AT_int (die
, attr
, TREE_INT_CST_LOW (value
));
20696 /* Otherwise represent the bound as an unsigned value with
20697 the precision of its type. The precision and signedness
20698 of the type will be necessary to re-interpret it
20700 add_AT_wide (die
, attr
, wi::to_wide (value
));
20704 /* Otherwise, if it's possible and permitted too, output a reference to
20706 if ((forms
& dw_scalar_form_reference
) != 0)
20708 tree decl
= NULL_TREE
;
20710 /* Some type attributes reference an outer type. For instance, the upper
20711 bound of an array may reference an embedding record (this happens in
20713 if (TREE_CODE (value
) == COMPONENT_REF
20714 && TREE_CODE (TREE_OPERAND (value
, 0)) == PLACEHOLDER_EXPR
20715 && TREE_CODE (TREE_OPERAND (value
, 1)) == FIELD_DECL
)
20716 decl
= TREE_OPERAND (value
, 1);
20718 else if (VAR_P (value
)
20719 || TREE_CODE (value
) == PARM_DECL
20720 || TREE_CODE (value
) == RESULT_DECL
)
20723 if (decl
!= NULL_TREE
)
20725 decl_die
= lookup_decl_die (decl
);
20727 /* ??? Can this happen, or should the variable have been bound
20728 first? Probably it can, since I imagine that we try to create
20729 the types of parameters in the order in which they exist in
20730 the list, and won't have created a forward reference to a
20731 later parameter. */
20732 if (decl_die
!= NULL
)
20734 if (get_AT (decl_die
, DW_AT_location
)
20735 || get_AT (decl_die
, DW_AT_data_member_location
)
20736 || get_AT (decl_die
, DW_AT_const_value
))
20738 add_AT_die_ref (die
, attr
, decl_die
);
20745 /* Last chance: try to create a stack operation procedure to evaluate the
20746 value. Do nothing if even that is not possible or permitted. */
20747 if ((forms
& dw_scalar_form_exprloc
) == 0)
20750 list
= loc_list_from_tree (value
, 2, context
);
20751 if (context
&& context
->placeholder_arg
)
20753 placeholder_seen
= context
->placeholder_seen
;
20754 context
->placeholder_seen
= false;
20756 if (list
== NULL
|| single_element_loc_list_p (list
))
20758 /* If this attribute is not a reference nor constant, it is
20759 a DWARF expression rather than location description. For that
20760 loc_list_from_tree (value, 0, &context) is needed. */
20761 dw_loc_list_ref list2
= loc_list_from_tree (value
, 0, context
);
20762 if (list2
&& single_element_loc_list_p (list2
))
20764 if (placeholder_seen
)
20766 struct dwarf_procedure_info dpi
;
20767 dpi
.fndecl
= NULL_TREE
;
20768 dpi
.args_count
= 1;
20769 if (!resolve_args_picking (list2
->expr
, 1, &dpi
))
20772 add_AT_loc (die
, attr
, list2
->expr
);
20777 /* If that failed to give a single element location list, fall back to
20778 outputting this as a reference... still if permitted. */
20780 || (forms
& dw_scalar_form_reference
) == 0
20781 || placeholder_seen
)
20786 if (current_function_decl
== 0)
20787 context_die
= comp_unit_die ();
20789 context_die
= lookup_decl_die (current_function_decl
);
20791 decl_die
= new_die (DW_TAG_variable
, context_die
, value
);
20792 add_AT_flag (decl_die
, DW_AT_artificial
, 1);
20793 add_type_attribute (decl_die
, TREE_TYPE (value
), TYPE_QUAL_CONST
, false,
20797 add_AT_location_description (decl_die
, DW_AT_location
, list
);
20798 add_AT_die_ref (die
, attr
, decl_die
);
20801 /* Return the default for DW_AT_lower_bound, or -1 if there is not any
20805 lower_bound_default (void)
20807 switch (get_AT_unsigned (comp_unit_die (), DW_AT_language
))
20813 case DW_LANG_C_plus_plus
:
20814 case DW_LANG_C_plus_plus_11
:
20815 case DW_LANG_C_plus_plus_14
:
20817 case DW_LANG_ObjC_plus_plus
:
20819 case DW_LANG_Fortran77
:
20820 case DW_LANG_Fortran90
:
20821 case DW_LANG_Fortran95
:
20822 case DW_LANG_Fortran03
:
20823 case DW_LANG_Fortran08
:
20827 case DW_LANG_Python
:
20828 return dwarf_version
>= 4 ? 0 : -1;
20829 case DW_LANG_Ada95
:
20830 case DW_LANG_Ada83
:
20831 case DW_LANG_Cobol74
:
20832 case DW_LANG_Cobol85
:
20833 case DW_LANG_Modula2
:
20835 return dwarf_version
>= 4 ? 1 : -1;
20841 /* Given a tree node describing an array bound (either lower or upper) output
20842 a representation for that bound. */
20845 add_bound_info (dw_die_ref subrange_die
, enum dwarf_attribute bound_attr
,
20846 tree bound
, struct loc_descr_context
*context
)
20851 switch (TREE_CODE (bound
))
20853 /* Strip all conversions. */
20855 case VIEW_CONVERT_EXPR
:
20856 bound
= TREE_OPERAND (bound
, 0);
20859 /* All fixed-bounds are represented by INTEGER_CST nodes. Lower bounds
20860 are even omitted when they are the default. */
20862 /* If the value for this bound is the default one, we can even omit the
20864 if (bound_attr
== DW_AT_lower_bound
20865 && tree_fits_shwi_p (bound
)
20866 && (dflt
= lower_bound_default ()) != -1
20867 && tree_to_shwi (bound
) == dflt
)
20873 /* Because of the complex interaction there can be with other GNAT
20874 encodings, GDB isn't ready yet to handle proper DWARF description
20875 for self-referencial subrange bounds: let GNAT encodings do the
20876 magic in such a case. */
20878 && gnat_encodings
!= DWARF_GNAT_ENCODINGS_MINIMAL
20879 && contains_placeholder_p (bound
))
20882 add_scalar_info (subrange_die
, bound_attr
, bound
,
20883 dw_scalar_form_constant
20884 | dw_scalar_form_exprloc
20885 | dw_scalar_form_reference
,
20891 /* Add subscript info to TYPE_DIE, describing an array TYPE, collapsing
20892 possibly nested array subscripts in a flat sequence if COLLAPSE_P is true.
20893 Note that the block of subscript information for an array type also
20894 includes information about the element type of the given array type.
20896 This function reuses previously set type and bound information if
20900 add_subscript_info (dw_die_ref type_die
, tree type
, bool collapse_p
)
20902 unsigned dimension_number
;
20904 dw_die_ref child
= type_die
->die_child
;
20906 for (dimension_number
= 0;
20907 TREE_CODE (type
) == ARRAY_TYPE
&& (dimension_number
== 0 || collapse_p
);
20908 type
= TREE_TYPE (type
), dimension_number
++)
20910 tree domain
= TYPE_DOMAIN (type
);
20912 if (TYPE_STRING_FLAG (type
) && is_fortran () && dimension_number
> 0)
20915 /* Arrays come in three flavors: Unspecified bounds, fixed bounds,
20916 and (in GNU C only) variable bounds. Handle all three forms
20919 /* Find and reuse a previously generated DW_TAG_subrange_type if
20922 For multi-dimensional arrays, as we iterate through the
20923 various dimensions in the enclosing for loop above, we also
20924 iterate through the DIE children and pick at each
20925 DW_TAG_subrange_type previously generated (if available).
20926 Each child DW_TAG_subrange_type DIE describes the range of
20927 the current dimension. At this point we should have as many
20928 DW_TAG_subrange_type's as we have dimensions in the
20930 dw_die_ref subrange_die
= NULL
;
20934 child
= child
->die_sib
;
20935 if (child
->die_tag
== DW_TAG_subrange_type
)
20936 subrange_die
= child
;
20937 if (child
== type_die
->die_child
)
20939 /* If we wrapped around, stop looking next time. */
20943 if (child
->die_tag
== DW_TAG_subrange_type
)
20947 subrange_die
= new_die (DW_TAG_subrange_type
, type_die
, NULL
);
20951 /* We have an array type with specified bounds. */
20952 lower
= TYPE_MIN_VALUE (domain
);
20953 upper
= TYPE_MAX_VALUE (domain
);
20955 /* Define the index type. */
20956 if (TREE_TYPE (domain
)
20957 && !get_AT (subrange_die
, DW_AT_type
))
20959 /* ??? This is probably an Ada unnamed subrange type. Ignore the
20960 TREE_TYPE field. We can't emit debug info for this
20961 because it is an unnamed integral type. */
20962 if (TREE_CODE (domain
) == INTEGER_TYPE
20963 && TYPE_NAME (domain
) == NULL_TREE
20964 && TREE_CODE (TREE_TYPE (domain
)) == INTEGER_TYPE
20965 && TYPE_NAME (TREE_TYPE (domain
)) == NULL_TREE
)
20968 add_type_attribute (subrange_die
, TREE_TYPE (domain
),
20969 TYPE_UNQUALIFIED
, false, type_die
);
20972 /* ??? If upper is NULL, the array has unspecified length,
20973 but it does have a lower bound. This happens with Fortran
20975 Since the debugger is definitely going to need to know N
20976 to produce useful results, go ahead and output the lower
20977 bound solo, and hope the debugger can cope. */
20979 if (!get_AT (subrange_die
, DW_AT_lower_bound
))
20980 add_bound_info (subrange_die
, DW_AT_lower_bound
, lower
, NULL
);
20981 if (!get_AT (subrange_die
, DW_AT_upper_bound
)
20982 && !get_AT (subrange_die
, DW_AT_count
))
20985 add_bound_info (subrange_die
, DW_AT_upper_bound
, upper
, NULL
);
20986 else if ((is_c () || is_cxx ()) && COMPLETE_TYPE_P (type
))
20987 /* Zero-length array. */
20988 add_bound_info (subrange_die
, DW_AT_count
,
20989 build_int_cst (TREE_TYPE (lower
), 0), NULL
);
20993 /* Otherwise we have an array type with an unspecified length. The
20994 DWARF-2 spec does not say how to handle this; let's just leave out the
20999 /* Add a DW_AT_byte_size attribute to DIE with TREE_NODE's size. */
21002 add_byte_size_attribute (dw_die_ref die
, tree tree_node
)
21004 dw_die_ref decl_die
;
21005 HOST_WIDE_INT size
;
21006 dw_loc_descr_ref size_expr
= NULL
;
21008 switch (TREE_CODE (tree_node
))
21013 case ENUMERAL_TYPE
:
21016 case QUAL_UNION_TYPE
:
21017 if (TREE_CODE (TYPE_SIZE_UNIT (tree_node
)) == VAR_DECL
21018 && (decl_die
= lookup_decl_die (TYPE_SIZE_UNIT (tree_node
))))
21020 add_AT_die_ref (die
, DW_AT_byte_size
, decl_die
);
21023 size_expr
= type_byte_size (tree_node
, &size
);
21026 /* For a data member of a struct or union, the DW_AT_byte_size is
21027 generally given as the number of bytes normally allocated for an
21028 object of the *declared* type of the member itself. This is true
21029 even for bit-fields. */
21030 size
= int_size_in_bytes (field_type (tree_node
));
21033 gcc_unreachable ();
21036 /* Support for dynamically-sized objects was introduced by DWARFv3.
21037 At the moment, GDB does not handle variable byte sizes very well,
21039 if ((dwarf_version
>= 3 || !dwarf_strict
)
21040 && gnat_encodings
== DWARF_GNAT_ENCODINGS_MINIMAL
21041 && size_expr
!= NULL
)
21042 add_AT_loc (die
, DW_AT_byte_size
, size_expr
);
21044 /* Note that `size' might be -1 when we get to this point. If it is, that
21045 indicates that the byte size of the entity in question is variable and
21046 that we could not generate a DWARF expression that computes it. */
21048 add_AT_unsigned (die
, DW_AT_byte_size
, size
);
21051 /* Add a DW_AT_alignment attribute to DIE with TREE_NODE's non-default
21055 add_alignment_attribute (dw_die_ref die
, tree tree_node
)
21057 if (dwarf_version
< 5 && dwarf_strict
)
21062 if (DECL_P (tree_node
))
21064 if (!DECL_USER_ALIGN (tree_node
))
21067 align
= DECL_ALIGN_UNIT (tree_node
);
21069 else if (TYPE_P (tree_node
))
21071 if (!TYPE_USER_ALIGN (tree_node
))
21074 align
= TYPE_ALIGN_UNIT (tree_node
);
21077 gcc_unreachable ();
21079 add_AT_unsigned (die
, DW_AT_alignment
, align
);
21082 /* For a FIELD_DECL node which represents a bit-field, output an attribute
21083 which specifies the distance in bits from the highest order bit of the
21084 "containing object" for the bit-field to the highest order bit of the
21087 For any given bit-field, the "containing object" is a hypothetical object
21088 (of some integral or enum type) within which the given bit-field lives. The
21089 type of this hypothetical "containing object" is always the same as the
21090 declared type of the individual bit-field itself. The determination of the
21091 exact location of the "containing object" for a bit-field is rather
21092 complicated. It's handled by the `field_byte_offset' function (above).
21094 CTX is required: see the comment for VLR_CONTEXT.
21096 Note that it is the size (in bytes) of the hypothetical "containing object"
21097 which will be given in the DW_AT_byte_size attribute for this bit-field.
21098 (See `byte_size_attribute' above). */
21101 add_bit_offset_attribute (dw_die_ref die
, tree decl
, struct vlr_context
*ctx
)
21103 HOST_WIDE_INT object_offset_in_bytes
;
21104 tree original_type
= DECL_BIT_FIELD_TYPE (decl
);
21105 HOST_WIDE_INT bitpos_int
;
21106 HOST_WIDE_INT highest_order_object_bit_offset
;
21107 HOST_WIDE_INT highest_order_field_bit_offset
;
21108 HOST_WIDE_INT bit_offset
;
21110 field_byte_offset (decl
, ctx
, &object_offset_in_bytes
);
21112 /* Must be a field and a bit field. */
21113 gcc_assert (original_type
&& TREE_CODE (decl
) == FIELD_DECL
);
21115 /* We can't yet handle bit-fields whose offsets are variable, so if we
21116 encounter such things, just return without generating any attribute
21117 whatsoever. Likewise for variable or too large size. */
21118 if (! tree_fits_shwi_p (bit_position (decl
))
21119 || ! tree_fits_uhwi_p (DECL_SIZE (decl
)))
21122 bitpos_int
= int_bit_position (decl
);
21124 /* Note that the bit offset is always the distance (in bits) from the
21125 highest-order bit of the "containing object" to the highest-order bit of
21126 the bit-field itself. Since the "high-order end" of any object or field
21127 is different on big-endian and little-endian machines, the computation
21128 below must take account of these differences. */
21129 highest_order_object_bit_offset
= object_offset_in_bytes
* BITS_PER_UNIT
;
21130 highest_order_field_bit_offset
= bitpos_int
;
21132 if (! BYTES_BIG_ENDIAN
)
21134 highest_order_field_bit_offset
+= tree_to_shwi (DECL_SIZE (decl
));
21135 highest_order_object_bit_offset
+=
21136 simple_type_size_in_bits (original_type
);
21140 = (! BYTES_BIG_ENDIAN
21141 ? highest_order_object_bit_offset
- highest_order_field_bit_offset
21142 : highest_order_field_bit_offset
- highest_order_object_bit_offset
);
21144 if (bit_offset
< 0)
21145 add_AT_int (die
, DW_AT_bit_offset
, bit_offset
);
21147 add_AT_unsigned (die
, DW_AT_bit_offset
, (unsigned HOST_WIDE_INT
) bit_offset
);
21150 /* For a FIELD_DECL node which represents a bit field, output an attribute
21151 which specifies the length in bits of the given field. */
21154 add_bit_size_attribute (dw_die_ref die
, tree decl
)
21156 /* Must be a field and a bit field. */
21157 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
21158 && DECL_BIT_FIELD_TYPE (decl
));
21160 if (tree_fits_uhwi_p (DECL_SIZE (decl
)))
21161 add_AT_unsigned (die
, DW_AT_bit_size
, tree_to_uhwi (DECL_SIZE (decl
)));
21164 /* If the compiled language is ANSI C, then add a 'prototyped'
21165 attribute, if arg types are given for the parameters of a function. */
21168 add_prototyped_attribute (dw_die_ref die
, tree func_type
)
21170 switch (get_AT_unsigned (comp_unit_die (), DW_AT_language
))
21177 if (prototype_p (func_type
))
21178 add_AT_flag (die
, DW_AT_prototyped
, 1);
21185 /* Add an 'abstract_origin' attribute below a given DIE. The DIE is found
21186 by looking in the type declaration, the object declaration equate table or
21187 the block mapping. */
21190 add_abstract_origin_attribute (dw_die_ref die
, tree origin
)
21192 dw_die_ref origin_die
= NULL
;
21194 /* For late LTO debug output we want to refer directly to the abstract
21195 DIE in the early debug rather to the possibly existing concrete
21196 instance and avoid creating that just for this purpose. */
21197 sym_off_pair
*desc
;
21199 && external_die_map
21200 && (desc
= external_die_map
->get (origin
)))
21202 add_AT_external_die_ref (die
, DW_AT_abstract_origin
,
21203 desc
->sym
, desc
->off
);
21207 if (DECL_P (origin
))
21208 origin_die
= lookup_decl_die (origin
);
21209 else if (TYPE_P (origin
))
21210 origin_die
= lookup_type_die (origin
);
21211 else if (TREE_CODE (origin
) == BLOCK
)
21212 origin_die
= lookup_block_die (origin
);
21214 /* XXX: Functions that are never lowered don't always have correct block
21215 trees (in the case of java, they simply have no block tree, in some other
21216 languages). For these functions, there is nothing we can really do to
21217 output correct debug info for inlined functions in all cases. Rather
21218 than die, we'll just produce deficient debug info now, in that we will
21219 have variables without a proper abstract origin. In the future, when all
21220 functions are lowered, we should re-add a gcc_assert (origin_die)
21224 add_AT_die_ref (die
, DW_AT_abstract_origin
, origin_die
);
21227 /* We do not currently support the pure_virtual attribute. */
21230 add_pure_or_virtual_attribute (dw_die_ref die
, tree func_decl
)
21232 if (DECL_VINDEX (func_decl
))
21234 add_AT_unsigned (die
, DW_AT_virtuality
, DW_VIRTUALITY_virtual
);
21236 if (tree_fits_shwi_p (DECL_VINDEX (func_decl
)))
21237 add_AT_loc (die
, DW_AT_vtable_elem_location
,
21238 new_loc_descr (DW_OP_constu
,
21239 tree_to_shwi (DECL_VINDEX (func_decl
)),
21242 /* GNU extension: Record what type this method came from originally. */
21243 if (debug_info_level
> DINFO_LEVEL_TERSE
21244 && DECL_CONTEXT (func_decl
))
21245 add_AT_die_ref (die
, DW_AT_containing_type
,
21246 lookup_type_die (DECL_CONTEXT (func_decl
)));
21250 /* Add a DW_AT_linkage_name or DW_AT_MIPS_linkage_name attribute for the
21251 given decl. This used to be a vendor extension until after DWARF 4
21252 standardized it. */
21255 add_linkage_attr (dw_die_ref die
, tree decl
)
21257 const char *name
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
21259 /* Mimic what assemble_name_raw does with a leading '*'. */
21260 if (name
[0] == '*')
21263 if (dwarf_version
>= 4)
21264 add_AT_string (die
, DW_AT_linkage_name
, name
);
21266 add_AT_string (die
, DW_AT_MIPS_linkage_name
, name
);
21269 /* Add source coordinate attributes for the given decl. */
21272 add_src_coords_attributes (dw_die_ref die
, tree decl
)
21274 expanded_location s
;
21276 if (LOCATION_LOCUS (DECL_SOURCE_LOCATION (decl
)) == UNKNOWN_LOCATION
)
21278 s
= expand_location (DECL_SOURCE_LOCATION (decl
));
21279 add_AT_file (die
, DW_AT_decl_file
, lookup_filename (s
.file
));
21280 add_AT_unsigned (die
, DW_AT_decl_line
, s
.line
);
21281 if (debug_column_info
&& s
.column
)
21282 add_AT_unsigned (die
, DW_AT_decl_column
, s
.column
);
21285 /* Add DW_AT_{,MIPS_}linkage_name attribute for the given decl. */
21288 add_linkage_name_raw (dw_die_ref die
, tree decl
)
21290 /* Defer until we have an assembler name set. */
21291 if (!DECL_ASSEMBLER_NAME_SET_P (decl
))
21293 limbo_die_node
*asm_name
;
21295 asm_name
= ggc_cleared_alloc
<limbo_die_node
> ();
21296 asm_name
->die
= die
;
21297 asm_name
->created_for
= decl
;
21298 asm_name
->next
= deferred_asm_name
;
21299 deferred_asm_name
= asm_name
;
21301 else if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
21302 add_linkage_attr (die
, decl
);
21305 /* Add DW_AT_{,MIPS_}linkage_name attribute for the given decl if desired. */
21308 add_linkage_name (dw_die_ref die
, tree decl
)
21310 if (debug_info_level
> DINFO_LEVEL_NONE
21311 && VAR_OR_FUNCTION_DECL_P (decl
)
21312 && TREE_PUBLIC (decl
)
21313 && !(VAR_P (decl
) && DECL_REGISTER (decl
))
21314 && die
->die_tag
!= DW_TAG_member
)
21315 add_linkage_name_raw (die
, decl
);
21318 /* Add a DW_AT_name attribute and source coordinate attribute for the
21319 given decl, but only if it actually has a name. */
21322 add_name_and_src_coords_attributes (dw_die_ref die
, tree decl
,
21323 bool no_linkage_name
)
21327 decl_name
= DECL_NAME (decl
);
21328 if (decl_name
!= NULL
&& IDENTIFIER_POINTER (decl_name
) != NULL
)
21330 const char *name
= dwarf2_name (decl
, 0);
21332 add_name_attribute (die
, name
);
21334 add_desc_attribute (die
, decl
);
21336 if (! DECL_ARTIFICIAL (decl
))
21337 add_src_coords_attributes (die
, decl
);
21339 if (!no_linkage_name
)
21340 add_linkage_name (die
, decl
);
21343 add_desc_attribute (die
, decl
);
21345 #ifdef VMS_DEBUGGING_INFO
21346 /* Get the function's name, as described by its RTL. This may be different
21347 from the DECL_NAME name used in the source file. */
21348 if (TREE_CODE (decl
) == FUNCTION_DECL
&& TREE_ASM_WRITTEN (decl
))
21350 add_AT_addr (die
, DW_AT_VMS_rtnbeg_pd_address
,
21351 XEXP (DECL_RTL (decl
), 0), false);
21352 vec_safe_push (used_rtx_array
, XEXP (DECL_RTL (decl
), 0));
21354 #endif /* VMS_DEBUGGING_INFO */
21357 /* Add VALUE as a DW_AT_discr_value attribute to DIE. */
21360 add_discr_value (dw_die_ref die
, dw_discr_value
*value
)
21364 attr
.dw_attr
= DW_AT_discr_value
;
21365 attr
.dw_attr_val
.val_class
= dw_val_class_discr_value
;
21366 attr
.dw_attr_val
.val_entry
= NULL
;
21367 attr
.dw_attr_val
.v
.val_discr_value
.pos
= value
->pos
;
21369 attr
.dw_attr_val
.v
.val_discr_value
.v
.uval
= value
->v
.uval
;
21371 attr
.dw_attr_val
.v
.val_discr_value
.v
.sval
= value
->v
.sval
;
21372 add_dwarf_attr (die
, &attr
);
21375 /* Add DISCR_LIST as a DW_AT_discr_list to DIE. */
21378 add_discr_list (dw_die_ref die
, dw_discr_list_ref discr_list
)
21382 attr
.dw_attr
= DW_AT_discr_list
;
21383 attr
.dw_attr_val
.val_class
= dw_val_class_discr_list
;
21384 attr
.dw_attr_val
.val_entry
= NULL
;
21385 attr
.dw_attr_val
.v
.val_discr_list
= discr_list
;
21386 add_dwarf_attr (die
, &attr
);
21389 static inline dw_discr_list_ref
21390 AT_discr_list (dw_attr_node
*attr
)
21392 return attr
->dw_attr_val
.v
.val_discr_list
;
21395 #ifdef VMS_DEBUGGING_INFO
21396 /* Output the debug main pointer die for VMS */
21399 dwarf2out_vms_debug_main_pointer (void)
21401 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
21404 /* Allocate the VMS debug main subprogram die. */
21405 die
= new_die_raw (DW_TAG_subprogram
);
21406 add_name_attribute (die
, VMS_DEBUG_MAIN_POINTER
);
21407 ASM_GENERATE_INTERNAL_LABEL (label
, PROLOGUE_END_LABEL
,
21408 current_function_funcdef_no
);
21409 add_AT_lbl_id (die
, DW_AT_entry_pc
, label
);
21411 /* Make it the first child of comp_unit_die (). */
21412 die
->die_parent
= comp_unit_die ();
21413 if (comp_unit_die ()->die_child
)
21415 die
->die_sib
= comp_unit_die ()->die_child
->die_sib
;
21416 comp_unit_die ()->die_child
->die_sib
= die
;
21420 die
->die_sib
= die
;
21421 comp_unit_die ()->die_child
= die
;
21424 #endif /* VMS_DEBUGGING_INFO */
21426 /* walk_tree helper function for uses_local_type, below. */
21429 uses_local_type_r (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
21432 *walk_subtrees
= 0;
21435 tree name
= TYPE_NAME (*tp
);
21436 if (name
&& DECL_P (name
) && decl_function_context (name
))
21442 /* If TYPE involves a function-local type (including a local typedef to a
21443 non-local type), returns that type; otherwise returns NULL_TREE. */
21446 uses_local_type (tree type
)
21448 tree used
= walk_tree_without_duplicates (&type
, uses_local_type_r
, NULL
);
21452 /* Return the DIE for the scope that immediately contains this type.
21453 Non-named types that do not involve a function-local type get global
21454 scope. Named types nested in namespaces or other types get their
21455 containing scope. All other types (i.e. function-local named types) get
21456 the current active scope. */
21459 scope_die_for (tree t
, dw_die_ref context_die
)
21461 dw_die_ref scope_die
= NULL
;
21462 tree containing_scope
;
21464 /* Non-types always go in the current scope. */
21465 gcc_assert (TYPE_P (t
));
21467 /* Use the scope of the typedef, rather than the scope of the type
21469 if (TYPE_NAME (t
) && DECL_P (TYPE_NAME (t
)))
21470 containing_scope
= DECL_CONTEXT (TYPE_NAME (t
));
21472 containing_scope
= TYPE_CONTEXT (t
);
21474 /* Use the containing namespace if there is one. */
21475 if (containing_scope
&& TREE_CODE (containing_scope
) == NAMESPACE_DECL
)
21477 if (context_die
== lookup_decl_die (containing_scope
))
21479 else if (debug_info_level
> DINFO_LEVEL_TERSE
)
21480 context_die
= get_context_die (containing_scope
);
21482 containing_scope
= NULL_TREE
;
21485 /* Ignore function type "scopes" from the C frontend. They mean that
21486 a tagged type is local to a parmlist of a function declarator, but
21487 that isn't useful to DWARF. */
21488 if (containing_scope
&& TREE_CODE (containing_scope
) == FUNCTION_TYPE
)
21489 containing_scope
= NULL_TREE
;
21491 if (SCOPE_FILE_SCOPE_P (containing_scope
))
21493 /* If T uses a local type keep it local as well, to avoid references
21494 to function-local DIEs from outside the function. */
21495 if (current_function_decl
&& uses_local_type (t
))
21496 scope_die
= context_die
;
21498 scope_die
= comp_unit_die ();
21500 else if (TYPE_P (containing_scope
))
21502 /* For types, we can just look up the appropriate DIE. */
21503 if (debug_info_level
> DINFO_LEVEL_TERSE
)
21504 scope_die
= get_context_die (containing_scope
);
21507 scope_die
= lookup_type_die_strip_naming_typedef (containing_scope
);
21508 if (scope_die
== NULL
)
21509 scope_die
= comp_unit_die ();
21513 scope_die
= context_die
;
21518 /* Returns nonzero if CONTEXT_DIE is internal to a function. */
21521 local_scope_p (dw_die_ref context_die
)
21523 for (; context_die
; context_die
= context_die
->die_parent
)
21524 if (context_die
->die_tag
== DW_TAG_inlined_subroutine
21525 || context_die
->die_tag
== DW_TAG_subprogram
)
21531 /* Returns nonzero if CONTEXT_DIE is a class. */
21534 class_scope_p (dw_die_ref context_die
)
21536 return (context_die
21537 && (context_die
->die_tag
== DW_TAG_structure_type
21538 || context_die
->die_tag
== DW_TAG_class_type
21539 || context_die
->die_tag
== DW_TAG_interface_type
21540 || context_die
->die_tag
== DW_TAG_union_type
));
21543 /* Returns nonzero if CONTEXT_DIE is a class or namespace, for deciding
21544 whether or not to treat a DIE in this context as a declaration. */
21547 class_or_namespace_scope_p (dw_die_ref context_die
)
21549 return (class_scope_p (context_die
)
21550 || (context_die
&& context_die
->die_tag
== DW_TAG_namespace
));
21553 /* Many forms of DIEs require a "type description" attribute. This
21554 routine locates the proper "type descriptor" die for the type given
21555 by 'type' plus any additional qualifiers given by 'cv_quals', and
21556 adds a DW_AT_type attribute below the given die. */
21559 add_type_attribute (dw_die_ref object_die
, tree type
, int cv_quals
,
21560 bool reverse
, dw_die_ref context_die
)
21562 enum tree_code code
= TREE_CODE (type
);
21563 dw_die_ref type_die
= NULL
;
21565 /* ??? If this type is an unnamed subrange type of an integral, floating-point
21566 or fixed-point type, use the inner type. This is because we have no
21567 support for unnamed types in base_type_die. This can happen if this is
21568 an Ada subrange type. Correct solution is emit a subrange type die. */
21569 if ((code
== INTEGER_TYPE
|| code
== REAL_TYPE
|| code
== FIXED_POINT_TYPE
)
21570 && TREE_TYPE (type
) != 0 && TYPE_NAME (type
) == 0)
21571 type
= TREE_TYPE (type
), code
= TREE_CODE (type
);
21573 if (code
== ERROR_MARK
21574 /* Handle a special case. For functions whose return type is void, we
21575 generate *no* type attribute. (Note that no object may have type
21576 `void', so this only applies to function return types). */
21577 || code
== VOID_TYPE
)
21580 type_die
= modified_type_die (type
,
21581 cv_quals
| TYPE_QUALS (type
),
21585 if (type_die
!= NULL
)
21586 add_AT_die_ref (object_die
, DW_AT_type
, type_die
);
21589 /* Given an object die, add the calling convention attribute for the
21590 function call type. */
21592 add_calling_convention_attribute (dw_die_ref subr_die
, tree decl
)
21594 enum dwarf_calling_convention value
= DW_CC_normal
;
21596 value
= ((enum dwarf_calling_convention
)
21597 targetm
.dwarf_calling_convention (TREE_TYPE (decl
)));
21600 && id_equal (DECL_ASSEMBLER_NAME (decl
), "MAIN__"))
21602 /* DWARF 2 doesn't provide a way to identify a program's source-level
21603 entry point. DW_AT_calling_convention attributes are only meant
21604 to describe functions' calling conventions. However, lacking a
21605 better way to signal the Fortran main program, we used this for
21606 a long time, following existing custom. Now, DWARF 4 has
21607 DW_AT_main_subprogram, which we add below, but some tools still
21608 rely on the old way, which we thus keep. */
21609 value
= DW_CC_program
;
21611 if (dwarf_version
>= 4 || !dwarf_strict
)
21612 add_AT_flag (subr_die
, DW_AT_main_subprogram
, 1);
21615 /* Only add the attribute if the backend requests it, and
21616 is not DW_CC_normal. */
21617 if (value
&& (value
!= DW_CC_normal
))
21618 add_AT_unsigned (subr_die
, DW_AT_calling_convention
, value
);
21621 /* Given a tree pointer to a struct, class, union, or enum type node, return
21622 a pointer to the (string) tag name for the given type, or zero if the type
21623 was declared without a tag. */
21625 static const char *
21626 type_tag (const_tree type
)
21628 const char *name
= 0;
21630 if (TYPE_NAME (type
) != 0)
21634 /* Find the IDENTIFIER_NODE for the type name. */
21635 if (TREE_CODE (TYPE_NAME (type
)) == IDENTIFIER_NODE
21636 && !TYPE_NAMELESS (type
))
21637 t
= TYPE_NAME (type
);
21639 /* The g++ front end makes the TYPE_NAME of *each* tagged type point to
21640 a TYPE_DECL node, regardless of whether or not a `typedef' was
21642 else if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
21643 && ! DECL_IGNORED_P (TYPE_NAME (type
)))
21645 /* We want to be extra verbose. Don't call dwarf_name if
21646 DECL_NAME isn't set. The default hook for decl_printable_name
21647 doesn't like that, and in this context it's correct to return
21648 0, instead of "<anonymous>" or the like. */
21649 if (DECL_NAME (TYPE_NAME (type
))
21650 && !DECL_NAMELESS (TYPE_NAME (type
)))
21651 name
= lang_hooks
.dwarf_name (TYPE_NAME (type
), 2);
21654 /* Now get the name as a string, or invent one. */
21655 if (!name
&& t
!= 0)
21656 name
= IDENTIFIER_POINTER (t
);
21659 return (name
== 0 || *name
== '\0') ? 0 : name
;
21662 /* Return the type associated with a data member, make a special check
21663 for bit field types. */
21666 member_declared_type (const_tree member
)
21668 return (DECL_BIT_FIELD_TYPE (member
)
21669 ? DECL_BIT_FIELD_TYPE (member
) : TREE_TYPE (member
));
21672 /* Get the decl's label, as described by its RTL. This may be different
21673 from the DECL_NAME name used in the source file. */
21676 static const char *
21677 decl_start_label (tree decl
)
21680 const char *fnname
;
21682 x
= DECL_RTL (decl
);
21683 gcc_assert (MEM_P (x
));
21686 gcc_assert (GET_CODE (x
) == SYMBOL_REF
);
21688 fnname
= XSTR (x
, 0);
21693 /* For variable-length arrays that have been previously generated, but
21694 may be incomplete due to missing subscript info, fill the subscript
21695 info. Return TRUE if this is one of those cases. */
21697 fill_variable_array_bounds (tree type
)
21699 if (TREE_ASM_WRITTEN (type
)
21700 && TREE_CODE (type
) == ARRAY_TYPE
21701 && variably_modified_type_p (type
, NULL
))
21703 dw_die_ref array_die
= lookup_type_die (type
);
21706 add_subscript_info (array_die
, type
, !is_ada ());
21712 /* These routines generate the internal representation of the DIE's for
21713 the compilation unit. Debugging information is collected by walking
21714 the declaration trees passed in from dwarf2out_decl(). */
21717 gen_array_type_die (tree type
, dw_die_ref context_die
)
21719 dw_die_ref array_die
;
21721 /* GNU compilers represent multidimensional array types as sequences of one
21722 dimensional array types whose element types are themselves array types.
21723 We sometimes squish that down to a single array_type DIE with multiple
21724 subscripts in the Dwarf debugging info. The draft Dwarf specification
21725 say that we are allowed to do this kind of compression in C, because
21726 there is no difference between an array of arrays and a multidimensional
21727 array. We don't do this for Ada to remain as close as possible to the
21728 actual representation, which is especially important against the language
21729 flexibilty wrt arrays of variable size. */
21731 bool collapse_nested_arrays
= !is_ada ();
21733 if (fill_variable_array_bounds (type
))
21736 dw_die_ref scope_die
= scope_die_for (type
, context_die
);
21739 /* Emit DW_TAG_string_type for Fortran character types (with kind 1 only, as
21740 DW_TAG_string_type doesn't have DW_AT_type attribute). */
21741 if (TREE_CODE (type
) == ARRAY_TYPE
21742 && TYPE_STRING_FLAG (type
)
21744 && TYPE_MODE (TREE_TYPE (type
)) == TYPE_MODE (char_type_node
))
21746 HOST_WIDE_INT size
;
21748 array_die
= new_die (DW_TAG_string_type
, scope_die
, type
);
21749 add_name_attribute (array_die
, type_tag (type
));
21750 equate_type_number_to_die (type
, array_die
);
21751 size
= int_size_in_bytes (type
);
21753 add_AT_unsigned (array_die
, DW_AT_byte_size
, size
);
21754 /* ??? We can't annotate types late, but for LTO we may not
21755 generate a location early either (gfortran.dg/save_6.f90). */
21756 else if (! (early_dwarf
&& (flag_generate_lto
|| flag_generate_offload
))
21757 && TYPE_DOMAIN (type
) != NULL_TREE
21758 && TYPE_MAX_VALUE (TYPE_DOMAIN (type
)) != NULL_TREE
)
21760 tree szdecl
= TYPE_MAX_VALUE (TYPE_DOMAIN (type
));
21761 tree rszdecl
= szdecl
;
21763 size
= int_size_in_bytes (TREE_TYPE (szdecl
));
21764 if (!DECL_P (szdecl
))
21766 if (TREE_CODE (szdecl
) == INDIRECT_REF
21767 && DECL_P (TREE_OPERAND (szdecl
, 0)))
21769 rszdecl
= TREE_OPERAND (szdecl
, 0);
21770 if (int_size_in_bytes (TREE_TYPE (rszdecl
))
21771 != DWARF2_ADDR_SIZE
)
21779 dw_loc_list_ref loc
21780 = loc_list_from_tree (rszdecl
, szdecl
== rszdecl
? 2 : 0,
21784 add_AT_location_description (array_die
, DW_AT_string_length
,
21786 if (size
!= DWARF2_ADDR_SIZE
)
21787 add_AT_unsigned (array_die
, dwarf_version
>= 5
21788 ? DW_AT_string_length_byte_size
21789 : DW_AT_byte_size
, size
);
21796 array_die
= new_die (DW_TAG_array_type
, scope_die
, type
);
21797 add_name_attribute (array_die
, type_tag (type
));
21798 equate_type_number_to_die (type
, array_die
);
21800 if (TREE_CODE (type
) == VECTOR_TYPE
)
21801 add_AT_flag (array_die
, DW_AT_GNU_vector
, 1);
21803 /* For Fortran multidimensional arrays use DW_ORD_col_major ordering. */
21805 && TREE_CODE (type
) == ARRAY_TYPE
21806 && TREE_CODE (TREE_TYPE (type
)) == ARRAY_TYPE
21807 && !TYPE_STRING_FLAG (TREE_TYPE (type
)))
21808 add_AT_unsigned (array_die
, DW_AT_ordering
, DW_ORD_col_major
);
21811 /* We default the array ordering. Debuggers will probably do the right
21812 things even if DW_AT_ordering is not present. It's not even an issue
21813 until we start to get into multidimensional arrays anyway. If a debugger
21814 is ever caught doing the Wrong Thing for multi-dimensional arrays,
21815 then we'll have to put the DW_AT_ordering attribute back in. (But if
21816 and when we find out that we need to put these in, we will only do so
21817 for multidimensional arrays. */
21818 add_AT_unsigned (array_die
, DW_AT_ordering
, DW_ORD_row_major
);
21821 if (TREE_CODE (type
) == VECTOR_TYPE
)
21823 /* For VECTOR_TYPEs we use an array die with appropriate bounds. */
21824 dw_die_ref subrange_die
= new_die (DW_TAG_subrange_type
, array_die
, NULL
);
21825 add_bound_info (subrange_die
, DW_AT_lower_bound
, size_zero_node
, NULL
);
21826 add_bound_info (subrange_die
, DW_AT_upper_bound
,
21827 size_int (TYPE_VECTOR_SUBPARTS (type
) - 1), NULL
);
21830 add_subscript_info (array_die
, type
, collapse_nested_arrays
);
21832 /* Add representation of the type of the elements of this array type and
21833 emit the corresponding DIE if we haven't done it already. */
21834 element_type
= TREE_TYPE (type
);
21835 if (collapse_nested_arrays
)
21836 while (TREE_CODE (element_type
) == ARRAY_TYPE
)
21838 if (TYPE_STRING_FLAG (element_type
) && is_fortran ())
21840 element_type
= TREE_TYPE (element_type
);
21843 add_type_attribute (array_die
, element_type
, TYPE_UNQUALIFIED
,
21844 TREE_CODE (type
) == ARRAY_TYPE
21845 && TYPE_REVERSE_STORAGE_ORDER (type
),
21848 add_gnat_descriptive_type_attribute (array_die
, type
, context_die
);
21849 if (TYPE_ARTIFICIAL (type
))
21850 add_AT_flag (array_die
, DW_AT_artificial
, 1);
21852 if (get_AT (array_die
, DW_AT_name
))
21853 add_pubtype (type
, array_die
);
21855 add_alignment_attribute (array_die
, type
);
21858 /* This routine generates DIE for array with hidden descriptor, details
21859 are filled into *info by a langhook. */
21862 gen_descr_array_type_die (tree type
, struct array_descr_info
*info
,
21863 dw_die_ref context_die
)
21865 const dw_die_ref scope_die
= scope_die_for (type
, context_die
);
21866 const dw_die_ref array_die
= new_die (DW_TAG_array_type
, scope_die
, type
);
21867 struct loc_descr_context context
= { type
, info
->base_decl
, NULL
,
21869 enum dwarf_tag subrange_tag
= DW_TAG_subrange_type
;
21872 add_name_attribute (array_die
, type_tag (type
));
21873 equate_type_number_to_die (type
, array_die
);
21875 if (info
->ndimensions
> 1)
21876 switch (info
->ordering
)
21878 case array_descr_ordering_row_major
:
21879 add_AT_unsigned (array_die
, DW_AT_ordering
, DW_ORD_row_major
);
21881 case array_descr_ordering_column_major
:
21882 add_AT_unsigned (array_die
, DW_AT_ordering
, DW_ORD_col_major
);
21888 if (dwarf_version
>= 3 || !dwarf_strict
)
21890 if (info
->data_location
)
21891 add_scalar_info (array_die
, DW_AT_data_location
, info
->data_location
,
21892 dw_scalar_form_exprloc
, &context
);
21893 if (info
->associated
)
21894 add_scalar_info (array_die
, DW_AT_associated
, info
->associated
,
21895 dw_scalar_form_constant
21896 | dw_scalar_form_exprloc
21897 | dw_scalar_form_reference
, &context
);
21898 if (info
->allocated
)
21899 add_scalar_info (array_die
, DW_AT_allocated
, info
->allocated
,
21900 dw_scalar_form_constant
21901 | dw_scalar_form_exprloc
21902 | dw_scalar_form_reference
, &context
);
21905 const enum dwarf_attribute attr
21906 = (info
->stride_in_bits
) ? DW_AT_bit_stride
: DW_AT_byte_stride
;
21908 = (info
->stride_in_bits
)
21909 ? dw_scalar_form_constant
21910 : (dw_scalar_form_constant
21911 | dw_scalar_form_exprloc
21912 | dw_scalar_form_reference
);
21914 add_scalar_info (array_die
, attr
, info
->stride
, forms
, &context
);
21917 if (dwarf_version
>= 5)
21921 add_scalar_info (array_die
, DW_AT_rank
, info
->rank
,
21922 dw_scalar_form_constant
21923 | dw_scalar_form_exprloc
, &context
);
21924 subrange_tag
= DW_TAG_generic_subrange
;
21925 context
.placeholder_arg
= true;
21929 add_gnat_descriptive_type_attribute (array_die
, type
, context_die
);
21931 for (dim
= 0; dim
< info
->ndimensions
; dim
++)
21933 dw_die_ref subrange_die
= new_die (subrange_tag
, array_die
, NULL
);
21935 if (info
->dimen
[dim
].bounds_type
)
21936 add_type_attribute (subrange_die
,
21937 info
->dimen
[dim
].bounds_type
, TYPE_UNQUALIFIED
,
21938 false, context_die
);
21939 if (info
->dimen
[dim
].lower_bound
)
21940 add_bound_info (subrange_die
, DW_AT_lower_bound
,
21941 info
->dimen
[dim
].lower_bound
, &context
);
21942 if (info
->dimen
[dim
].upper_bound
)
21943 add_bound_info (subrange_die
, DW_AT_upper_bound
,
21944 info
->dimen
[dim
].upper_bound
, &context
);
21945 if ((dwarf_version
>= 3 || !dwarf_strict
) && info
->dimen
[dim
].stride
)
21946 add_scalar_info (subrange_die
, DW_AT_byte_stride
,
21947 info
->dimen
[dim
].stride
,
21948 dw_scalar_form_constant
21949 | dw_scalar_form_exprloc
21950 | dw_scalar_form_reference
,
21954 gen_type_die (info
->element_type
, context_die
);
21955 add_type_attribute (array_die
, info
->element_type
, TYPE_UNQUALIFIED
,
21956 TREE_CODE (type
) == ARRAY_TYPE
21957 && TYPE_REVERSE_STORAGE_ORDER (type
),
21960 if (get_AT (array_die
, DW_AT_name
))
21961 add_pubtype (type
, array_die
);
21963 add_alignment_attribute (array_die
, type
);
21968 gen_entry_point_die (tree decl
, dw_die_ref context_die
)
21970 tree origin
= decl_ultimate_origin (decl
);
21971 dw_die_ref decl_die
= new_die (DW_TAG_entry_point
, context_die
, decl
);
21973 if (origin
!= NULL
)
21974 add_abstract_origin_attribute (decl_die
, origin
);
21977 add_name_and_src_coords_attributes (decl_die
, decl
);
21978 add_type_attribute (decl_die
, TREE_TYPE (TREE_TYPE (decl
)),
21979 TYPE_UNQUALIFIED
, false, context_die
);
21982 if (DECL_ABSTRACT_P (decl
))
21983 equate_decl_number_to_die (decl
, decl_die
);
21985 add_AT_lbl_id (decl_die
, DW_AT_low_pc
, decl_start_label (decl
));
21989 /* Walk through the list of incomplete types again, trying once more to
21990 emit full debugging info for them. */
21993 retry_incomplete_types (void)
21998 for (i
= vec_safe_length (incomplete_types
) - 1; i
>= 0; i
--)
21999 if (should_emit_struct_debug ((*incomplete_types
)[i
], DINFO_USAGE_DIR_USE
))
22000 gen_type_die ((*incomplete_types
)[i
], comp_unit_die ());
22001 vec_safe_truncate (incomplete_types
, 0);
22004 /* Determine what tag to use for a record type. */
22006 static enum dwarf_tag
22007 record_type_tag (tree type
)
22009 if (! lang_hooks
.types
.classify_record
)
22010 return DW_TAG_structure_type
;
22012 switch (lang_hooks
.types
.classify_record (type
))
22014 case RECORD_IS_STRUCT
:
22015 return DW_TAG_structure_type
;
22017 case RECORD_IS_CLASS
:
22018 return DW_TAG_class_type
;
22020 case RECORD_IS_INTERFACE
:
22021 if (dwarf_version
>= 3 || !dwarf_strict
)
22022 return DW_TAG_interface_type
;
22023 return DW_TAG_structure_type
;
22026 gcc_unreachable ();
22030 /* Generate a DIE to represent an enumeration type. Note that these DIEs
22031 include all of the information about the enumeration values also. Each
22032 enumerated type name/value is listed as a child of the enumerated type
22036 gen_enumeration_type_die (tree type
, dw_die_ref context_die
)
22038 dw_die_ref type_die
= lookup_type_die (type
);
22039 dw_die_ref orig_type_die
= type_die
;
22041 if (type_die
== NULL
)
22043 type_die
= new_die (DW_TAG_enumeration_type
,
22044 scope_die_for (type
, context_die
), type
);
22045 equate_type_number_to_die (type
, type_die
);
22046 add_name_attribute (type_die
, type_tag (type
));
22047 if ((dwarf_version
>= 4 || !dwarf_strict
)
22048 && ENUM_IS_SCOPED (type
))
22049 add_AT_flag (type_die
, DW_AT_enum_class
, 1);
22050 if (ENUM_IS_OPAQUE (type
) && TYPE_SIZE (type
))
22051 add_AT_flag (type_die
, DW_AT_declaration
, 1);
22053 add_AT_unsigned (type_die
, DW_AT_encoding
,
22054 TYPE_UNSIGNED (type
)
22058 else if (! TYPE_SIZE (type
) || ENUM_IS_OPAQUE (type
))
22061 remove_AT (type_die
, DW_AT_declaration
);
22063 /* Handle a GNU C/C++ extension, i.e. incomplete enum types. If the
22064 given enum type is incomplete, do not generate the DW_AT_byte_size
22065 attribute or the DW_AT_element_list attribute. */
22066 if (TYPE_SIZE (type
))
22070 if (!ENUM_IS_OPAQUE (type
))
22071 TREE_ASM_WRITTEN (type
) = 1;
22072 if (!orig_type_die
|| !get_AT (type_die
, DW_AT_byte_size
))
22073 add_byte_size_attribute (type_die
, type
);
22074 if (!orig_type_die
|| !get_AT (type_die
, DW_AT_alignment
))
22075 add_alignment_attribute (type_die
, type
);
22076 if ((dwarf_version
>= 3 || !dwarf_strict
)
22077 && (!orig_type_die
|| !get_AT (type_die
, DW_AT_type
)))
22079 tree underlying
= lang_hooks
.types
.enum_underlying_base_type (type
);
22080 add_type_attribute (type_die
, underlying
, TYPE_UNQUALIFIED
, false,
22083 if (TYPE_STUB_DECL (type
) != NULL_TREE
)
22085 if (!orig_type_die
|| !get_AT (type_die
, DW_AT_decl_file
))
22086 add_src_coords_attributes (type_die
, TYPE_STUB_DECL (type
));
22087 if (!orig_type_die
|| !get_AT (type_die
, DW_AT_accessibility
))
22088 add_accessibility_attribute (type_die
, TYPE_STUB_DECL (type
));
22091 /* If the first reference to this type was as the return type of an
22092 inline function, then it may not have a parent. Fix this now. */
22093 if (type_die
->die_parent
== NULL
)
22094 add_child_die (scope_die_for (type
, context_die
), type_die
);
22096 for (link
= TYPE_VALUES (type
);
22097 link
!= NULL
; link
= TREE_CHAIN (link
))
22099 dw_die_ref enum_die
= new_die (DW_TAG_enumerator
, type_die
, link
);
22100 tree value
= TREE_VALUE (link
);
22102 gcc_assert (!ENUM_IS_OPAQUE (type
));
22103 add_name_attribute (enum_die
,
22104 IDENTIFIER_POINTER (TREE_PURPOSE (link
)));
22106 if (TREE_CODE (value
) == CONST_DECL
)
22107 value
= DECL_INITIAL (value
);
22109 if (simple_type_size_in_bits (TREE_TYPE (value
))
22110 <= HOST_BITS_PER_WIDE_INT
|| tree_fits_shwi_p (value
))
22112 /* For constant forms created by add_AT_unsigned DWARF
22113 consumers (GDB, elfutils, etc.) always zero extend
22114 the value. Only when the actual value is negative
22115 do we need to use add_AT_int to generate a constant
22116 form that can represent negative values. */
22117 HOST_WIDE_INT val
= TREE_INT_CST_LOW (value
);
22118 if (TYPE_UNSIGNED (TREE_TYPE (value
)) || val
>= 0)
22119 add_AT_unsigned (enum_die
, DW_AT_const_value
,
22120 (unsigned HOST_WIDE_INT
) val
);
22122 add_AT_int (enum_die
, DW_AT_const_value
, val
);
22125 /* Enumeration constants may be wider than HOST_WIDE_INT. Handle
22126 that here. TODO: This should be re-worked to use correct
22127 signed/unsigned double tags for all cases. */
22128 add_AT_wide (enum_die
, DW_AT_const_value
, wi::to_wide (value
));
22131 add_gnat_descriptive_type_attribute (type_die
, type
, context_die
);
22132 if (TYPE_ARTIFICIAL (type
)
22133 && (!orig_type_die
|| !get_AT (type_die
, DW_AT_artificial
)))
22134 add_AT_flag (type_die
, DW_AT_artificial
, 1);
22137 add_AT_flag (type_die
, DW_AT_declaration
, 1);
22139 add_pubtype (type
, type_die
);
22144 /* Generate a DIE to represent either a real live formal parameter decl or to
22145 represent just the type of some formal parameter position in some function
22148 Note that this routine is a bit unusual because its argument may be a
22149 ..._DECL node (i.e. either a PARM_DECL or perhaps a VAR_DECL which
22150 represents an inlining of some PARM_DECL) or else some sort of a ..._TYPE
22151 node. If it's the former then this function is being called to output a
22152 DIE to represent a formal parameter object (or some inlining thereof). If
22153 it's the latter, then this function is only being called to output a
22154 DW_TAG_formal_parameter DIE to stand as a placeholder for some formal
22155 argument type of some subprogram type.
22156 If EMIT_NAME_P is true, name and source coordinate attributes
22160 gen_formal_parameter_die (tree node
, tree origin
, bool emit_name_p
,
22161 dw_die_ref context_die
)
22163 tree node_or_origin
= node
? node
: origin
;
22164 tree ultimate_origin
;
22165 dw_die_ref parm_die
= NULL
;
22167 if (DECL_P (node_or_origin
))
22169 parm_die
= lookup_decl_die (node
);
22171 /* If the contexts differ, we may not be talking about the same
22173 ??? When in LTO the DIE parent is the "abstract" copy and the
22174 context_die is the specification "copy". */
22176 && parm_die
->die_parent
!= context_die
22177 && (parm_die
->die_parent
->die_tag
!= DW_TAG_GNU_formal_parameter_pack
22178 || parm_die
->die_parent
->die_parent
!= context_die
)
22181 gcc_assert (!DECL_ABSTRACT_P (node
));
22182 /* This can happen when creating a concrete instance, in
22183 which case we need to create a new DIE that will get
22184 annotated with DW_AT_abstract_origin. */
22188 if (parm_die
&& parm_die
->die_parent
== NULL
)
22190 /* Check that parm_die already has the right attributes that
22191 we would have added below. If any attributes are
22192 missing, fall through to add them. */
22193 if (! DECL_ABSTRACT_P (node_or_origin
)
22194 && !get_AT (parm_die
, DW_AT_location
)
22195 && !get_AT (parm_die
, DW_AT_const_value
))
22196 /* We are missing location info, and are about to add it. */
22200 add_child_die (context_die
, parm_die
);
22206 /* If we have a previously generated DIE, use it, unless this is an
22207 concrete instance (origin != NULL), in which case we need a new
22208 DIE with a corresponding DW_AT_abstract_origin. */
22210 if (parm_die
&& origin
== NULL
)
22211 reusing_die
= true;
22214 parm_die
= new_die (DW_TAG_formal_parameter
, context_die
, node
);
22215 reusing_die
= false;
22218 switch (TREE_CODE_CLASS (TREE_CODE (node_or_origin
)))
22220 case tcc_declaration
:
22221 ultimate_origin
= decl_ultimate_origin (node_or_origin
);
22222 if (node
|| ultimate_origin
)
22223 origin
= ultimate_origin
;
22228 if (origin
!= NULL
)
22229 add_abstract_origin_attribute (parm_die
, origin
);
22230 else if (emit_name_p
)
22231 add_name_and_src_coords_attributes (parm_die
, node
);
22233 || (! DECL_ABSTRACT_P (node_or_origin
)
22234 && variably_modified_type_p (TREE_TYPE (node_or_origin
),
22235 decl_function_context
22236 (node_or_origin
))))
22238 tree type
= TREE_TYPE (node_or_origin
);
22239 if (decl_by_reference_p (node_or_origin
))
22240 add_type_attribute (parm_die
, TREE_TYPE (type
),
22242 false, context_die
);
22244 add_type_attribute (parm_die
, type
,
22245 decl_quals (node_or_origin
),
22246 false, context_die
);
22248 if (origin
== NULL
&& DECL_ARTIFICIAL (node
))
22249 add_AT_flag (parm_die
, DW_AT_artificial
, 1);
22251 if (node
&& node
!= origin
)
22252 equate_decl_number_to_die (node
, parm_die
);
22253 if (! DECL_ABSTRACT_P (node_or_origin
))
22254 add_location_or_const_value_attribute (parm_die
, node_or_origin
,
22260 /* We were called with some kind of a ..._TYPE node. */
22261 add_type_attribute (parm_die
, node_or_origin
, TYPE_UNQUALIFIED
, false,
22266 gcc_unreachable ();
22272 /* Generate and return a DW_TAG_GNU_formal_parameter_pack. Also generate
22273 children DW_TAG_formal_parameter DIEs representing the arguments of the
22276 PARM_PACK must be a function parameter pack.
22277 PACK_ARG is the first argument of the parameter pack. Its TREE_CHAIN
22278 must point to the subsequent arguments of the function PACK_ARG belongs to.
22279 SUBR_DIE is the DIE of the function PACK_ARG belongs to.
22280 If NEXT_ARG is non NULL, *NEXT_ARG is set to the function argument
22281 following the last one for which a DIE was generated. */
22284 gen_formal_parameter_pack_die (tree parm_pack
,
22286 dw_die_ref subr_die
,
22290 dw_die_ref parm_pack_die
;
22292 gcc_assert (parm_pack
22293 && lang_hooks
.function_parameter_pack_p (parm_pack
)
22296 parm_pack_die
= new_die (DW_TAG_GNU_formal_parameter_pack
, subr_die
, parm_pack
);
22297 add_src_coords_attributes (parm_pack_die
, parm_pack
);
22299 for (arg
= pack_arg
; arg
; arg
= DECL_CHAIN (arg
))
22301 if (! lang_hooks
.decls
.function_parm_expanded_from_pack_p (arg
,
22304 gen_formal_parameter_die (arg
, NULL
,
22305 false /* Don't emit name attribute. */,
22310 return parm_pack_die
;
22313 /* Generate a special type of DIE used as a stand-in for a trailing ellipsis
22314 at the end of an (ANSI prototyped) formal parameters list. */
22317 gen_unspecified_parameters_die (tree decl_or_type
, dw_die_ref context_die
)
22319 new_die (DW_TAG_unspecified_parameters
, context_die
, decl_or_type
);
22322 /* Generate a list of nameless DW_TAG_formal_parameter DIEs (and perhaps a
22323 DW_TAG_unspecified_parameters DIE) to represent the types of the formal
22324 parameters as specified in some function type specification (except for
22325 those which appear as part of a function *definition*). */
22328 gen_formal_types_die (tree function_or_method_type
, dw_die_ref context_die
)
22331 tree formal_type
= NULL
;
22332 tree first_parm_type
;
22335 if (TREE_CODE (function_or_method_type
) == FUNCTION_DECL
)
22337 arg
= DECL_ARGUMENTS (function_or_method_type
);
22338 function_or_method_type
= TREE_TYPE (function_or_method_type
);
22343 first_parm_type
= TYPE_ARG_TYPES (function_or_method_type
);
22345 /* Make our first pass over the list of formal parameter types and output a
22346 DW_TAG_formal_parameter DIE for each one. */
22347 for (link
= first_parm_type
; link
; )
22349 dw_die_ref parm_die
;
22351 formal_type
= TREE_VALUE (link
);
22352 if (formal_type
== void_type_node
)
22355 /* Output a (nameless) DIE to represent the formal parameter itself. */
22356 parm_die
= gen_formal_parameter_die (formal_type
, NULL
,
22357 true /* Emit name attribute. */,
22359 if (TREE_CODE (function_or_method_type
) == METHOD_TYPE
22360 && link
== first_parm_type
)
22362 add_AT_flag (parm_die
, DW_AT_artificial
, 1);
22363 if (dwarf_version
>= 3 || !dwarf_strict
)
22364 add_AT_die_ref (context_die
, DW_AT_object_pointer
, parm_die
);
22366 else if (arg
&& DECL_ARTIFICIAL (arg
))
22367 add_AT_flag (parm_die
, DW_AT_artificial
, 1);
22369 link
= TREE_CHAIN (link
);
22371 arg
= DECL_CHAIN (arg
);
22374 /* If this function type has an ellipsis, add a
22375 DW_TAG_unspecified_parameters DIE to the end of the parameter list. */
22376 if (formal_type
!= void_type_node
)
22377 gen_unspecified_parameters_die (function_or_method_type
, context_die
);
22379 /* Make our second (and final) pass over the list of formal parameter types
22380 and output DIEs to represent those types (as necessary). */
22381 for (link
= TYPE_ARG_TYPES (function_or_method_type
);
22382 link
&& TREE_VALUE (link
);
22383 link
= TREE_CHAIN (link
))
22384 gen_type_die (TREE_VALUE (link
), context_die
);
22387 /* We want to generate the DIE for TYPE so that we can generate the
22388 die for MEMBER, which has been defined; we will need to refer back
22389 to the member declaration nested within TYPE. If we're trying to
22390 generate minimal debug info for TYPE, processing TYPE won't do the
22391 trick; we need to attach the member declaration by hand. */
22394 gen_type_die_for_member (tree type
, tree member
, dw_die_ref context_die
)
22396 gen_type_die (type
, context_die
);
22398 /* If we're trying to avoid duplicate debug info, we may not have
22399 emitted the member decl for this function. Emit it now. */
22400 if (TYPE_STUB_DECL (type
)
22401 && TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
))
22402 && ! lookup_decl_die (member
))
22404 dw_die_ref type_die
;
22405 gcc_assert (!decl_ultimate_origin (member
));
22407 type_die
= lookup_type_die_strip_naming_typedef (type
);
22408 if (TREE_CODE (member
) == FUNCTION_DECL
)
22409 gen_subprogram_die (member
, type_die
);
22410 else if (TREE_CODE (member
) == FIELD_DECL
)
22412 /* Ignore the nameless fields that are used to skip bits but handle
22413 C++ anonymous unions and structs. */
22414 if (DECL_NAME (member
) != NULL_TREE
22415 || TREE_CODE (TREE_TYPE (member
)) == UNION_TYPE
22416 || TREE_CODE (TREE_TYPE (member
)) == RECORD_TYPE
)
22418 struct vlr_context vlr_ctx
= {
22419 DECL_CONTEXT (member
), /* struct_type */
22420 NULL_TREE
/* variant_part_offset */
22422 gen_type_die (member_declared_type (member
), type_die
);
22423 gen_field_die (member
, &vlr_ctx
, type_die
);
22427 gen_variable_die (member
, NULL_TREE
, type_die
);
22431 /* Forward declare these functions, because they are mutually recursive
22432 with their set_block_* pairing functions. */
22433 static void set_decl_origin_self (tree
);
22435 /* Given a pointer to some BLOCK node, if the BLOCK_ABSTRACT_ORIGIN for the
22436 given BLOCK node is NULL, set the BLOCK_ABSTRACT_ORIGIN for the node so
22437 that it points to the node itself, thus indicating that the node is its
22438 own (abstract) origin. Additionally, if the BLOCK_ABSTRACT_ORIGIN for
22439 the given node is NULL, recursively descend the decl/block tree which
22440 it is the root of, and for each other ..._DECL or BLOCK node contained
22441 therein whose DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also
22442 still NULL, set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN
22443 values to point to themselves. */
22446 set_block_origin_self (tree stmt
)
22448 if (BLOCK_ABSTRACT_ORIGIN (stmt
) == NULL_TREE
)
22450 BLOCK_ABSTRACT_ORIGIN (stmt
) = stmt
;
22455 for (local_decl
= BLOCK_VARS (stmt
);
22456 local_decl
!= NULL_TREE
;
22457 local_decl
= DECL_CHAIN (local_decl
))
22458 /* Do not recurse on nested functions since the inlining status
22459 of parent and child can be different as per the DWARF spec. */
22460 if (TREE_CODE (local_decl
) != FUNCTION_DECL
22461 && !DECL_EXTERNAL (local_decl
))
22462 set_decl_origin_self (local_decl
);
22468 for (subblock
= BLOCK_SUBBLOCKS (stmt
);
22469 subblock
!= NULL_TREE
;
22470 subblock
= BLOCK_CHAIN (subblock
))
22471 set_block_origin_self (subblock
); /* Recurse. */
22476 /* Given a pointer to some ..._DECL node, if the DECL_ABSTRACT_ORIGIN for
22477 the given ..._DECL node is NULL, set the DECL_ABSTRACT_ORIGIN for the
22478 node to so that it points to the node itself, thus indicating that the
22479 node represents its own (abstract) origin. Additionally, if the
22480 DECL_ABSTRACT_ORIGIN for the given node is NULL, recursively descend
22481 the decl/block tree of which the given node is the root of, and for
22482 each other ..._DECL or BLOCK node contained therein whose
22483 DECL_ABSTRACT_ORIGINs or BLOCK_ABSTRACT_ORIGINs are also still NULL,
22484 set *their* DECL_ABSTRACT_ORIGIN or BLOCK_ABSTRACT_ORIGIN values to
22485 point to themselves. */
22488 set_decl_origin_self (tree decl
)
22490 if (DECL_ABSTRACT_ORIGIN (decl
) == NULL_TREE
)
22492 DECL_ABSTRACT_ORIGIN (decl
) = decl
;
22493 if (TREE_CODE (decl
) == FUNCTION_DECL
)
22497 for (arg
= DECL_ARGUMENTS (decl
); arg
; arg
= DECL_CHAIN (arg
))
22498 DECL_ABSTRACT_ORIGIN (arg
) = arg
;
22499 if (DECL_INITIAL (decl
) != NULL_TREE
22500 && DECL_INITIAL (decl
) != error_mark_node
)
22501 set_block_origin_self (DECL_INITIAL (decl
));
22506 /* Mark the early DIE for DECL as the abstract instance. */
22509 dwarf2out_abstract_function (tree decl
)
22511 dw_die_ref old_die
;
22513 /* Make sure we have the actual abstract inline, not a clone. */
22514 decl
= DECL_ORIGIN (decl
);
22516 if (DECL_IGNORED_P (decl
))
22519 /* In LTO we're all set. We already created abstract instances
22520 early and we want to avoid creating a concrete instance of that
22521 if we don't output it. */
22525 old_die
= lookup_decl_die (decl
);
22526 gcc_assert (old_die
!= NULL
);
22527 if (get_AT (old_die
, DW_AT_inline
))
22528 /* We've already generated the abstract instance. */
22531 /* Go ahead and put DW_AT_inline on the DIE. */
22532 if (DECL_DECLARED_INLINE_P (decl
))
22534 if (cgraph_function_possibly_inlined_p (decl
))
22535 add_AT_unsigned (old_die
, DW_AT_inline
, DW_INL_declared_inlined
);
22537 add_AT_unsigned (old_die
, DW_AT_inline
, DW_INL_declared_not_inlined
);
22541 if (cgraph_function_possibly_inlined_p (decl
))
22542 add_AT_unsigned (old_die
, DW_AT_inline
, DW_INL_inlined
);
22544 add_AT_unsigned (old_die
, DW_AT_inline
, DW_INL_not_inlined
);
22547 if (DECL_DECLARED_INLINE_P (decl
)
22548 && lookup_attribute ("artificial", DECL_ATTRIBUTES (decl
)))
22549 add_AT_flag (old_die
, DW_AT_artificial
, 1);
22551 set_decl_origin_self (decl
);
22554 /* Helper function of premark_used_types() which gets called through
22557 Marks the DIE of a given type in *SLOT as perennial, so it never gets
22558 marked as unused by prune_unused_types. */
22561 premark_used_types_helper (tree
const &type
, void *)
22565 die
= lookup_type_die (type
);
22567 die
->die_perennial_p
= 1;
22571 /* Helper function of premark_types_used_by_global_vars which gets called
22572 through htab_traverse.
22574 Marks the DIE of a given type in *SLOT as perennial, so it never gets
22575 marked as unused by prune_unused_types. The DIE of the type is marked
22576 only if the global variable using the type will actually be emitted. */
22579 premark_types_used_by_global_vars_helper (types_used_by_vars_entry
**slot
,
22582 struct types_used_by_vars_entry
*entry
;
22585 entry
= (struct types_used_by_vars_entry
*) *slot
;
22586 gcc_assert (entry
->type
!= NULL
22587 && entry
->var_decl
!= NULL
);
22588 die
= lookup_type_die (entry
->type
);
22591 /* Ask cgraph if the global variable really is to be emitted.
22592 If yes, then we'll keep the DIE of ENTRY->TYPE. */
22593 varpool_node
*node
= varpool_node::get (entry
->var_decl
);
22594 if (node
&& node
->definition
)
22596 die
->die_perennial_p
= 1;
22597 /* Keep the parent DIEs as well. */
22598 while ((die
= die
->die_parent
) && die
->die_perennial_p
== 0)
22599 die
->die_perennial_p
= 1;
22605 /* Mark all members of used_types_hash as perennial. */
22608 premark_used_types (struct function
*fun
)
22610 if (fun
&& fun
->used_types_hash
)
22611 fun
->used_types_hash
->traverse
<void *, premark_used_types_helper
> (NULL
);
22614 /* Mark all members of types_used_by_vars_entry as perennial. */
22617 premark_types_used_by_global_vars (void)
22619 if (types_used_by_vars_hash
)
22620 types_used_by_vars_hash
22621 ->traverse
<void *, premark_types_used_by_global_vars_helper
> (NULL
);
22624 /* Mark all variables used by the symtab as perennial. */
22627 premark_used_variables (void)
22629 /* Mark DIEs in the symtab as used. */
22631 FOR_EACH_VARIABLE (var
)
22633 dw_die_ref die
= lookup_decl_die (var
->decl
);
22635 die
->die_perennial_p
= 1;
22639 /* Generate a DW_TAG_call_site DIE in function DECL under SUBR_DIE
22640 for CA_LOC call arg loc node. */
22643 gen_call_site_die (tree decl
, dw_die_ref subr_die
,
22644 struct call_arg_loc_node
*ca_loc
)
22646 dw_die_ref stmt_die
= NULL
, die
;
22647 tree block
= ca_loc
->block
;
22650 && block
!= DECL_INITIAL (decl
)
22651 && TREE_CODE (block
) == BLOCK
)
22653 stmt_die
= lookup_block_die (block
);
22656 block
= BLOCK_SUPERCONTEXT (block
);
22658 if (stmt_die
== NULL
)
22659 stmt_die
= subr_die
;
22660 die
= new_die (dwarf_TAG (DW_TAG_call_site
), stmt_die
, NULL_TREE
);
22661 add_AT_lbl_id (die
, dwarf_AT (DW_AT_call_return_pc
), ca_loc
->label
);
22662 if (ca_loc
->tail_call_p
)
22663 add_AT_flag (die
, dwarf_AT (DW_AT_call_tail_call
), 1);
22664 if (ca_loc
->symbol_ref
)
22666 dw_die_ref tdie
= lookup_decl_die (SYMBOL_REF_DECL (ca_loc
->symbol_ref
));
22668 add_AT_die_ref (die
, dwarf_AT (DW_AT_call_origin
), tdie
);
22670 add_AT_addr (die
, dwarf_AT (DW_AT_call_origin
), ca_loc
->symbol_ref
,
22676 /* Generate a DIE to represent a declared function (either file-scope or
22680 gen_subprogram_die (tree decl
, dw_die_ref context_die
)
22682 tree origin
= decl_ultimate_origin (decl
);
22683 dw_die_ref subr_die
;
22684 dw_die_ref old_die
= lookup_decl_die (decl
);
22686 /* This function gets called multiple times for different stages of
22687 the debug process. For example, for func() in this code:
22691 void func() { ... }
22694 ...we get called 4 times. Twice in early debug and twice in
22700 1. Once while generating func() within the namespace. This is
22701 the declaration. The declaration bit below is set, as the
22702 context is the namespace.
22704 A new DIE will be generated with DW_AT_declaration set.
22706 2. Once for func() itself. This is the specification. The
22707 declaration bit below is clear as the context is the CU.
22709 We will use the cached DIE from (1) to create a new DIE with
22710 DW_AT_specification pointing to the declaration in (1).
22712 Late debug via rest_of_handle_final()
22713 -------------------------------------
22715 3. Once generating func() within the namespace. This is also the
22716 declaration, as in (1), but this time we will early exit below
22717 as we have a cached DIE and a declaration needs no additional
22718 annotations (no locations), as the source declaration line
22721 4. Once for func() itself. As in (2), this is the specification,
22722 but this time we will re-use the cached DIE, and just annotate
22723 it with the location information that should now be available.
22725 For something without namespaces, but with abstract instances, we
22726 are also called a multiple times:
22731 Base (); // constructor declaration (1)
22734 Base::Base () { } // constructor specification (2)
22739 1. Once for the Base() constructor by virtue of it being a
22740 member of the Base class. This is done via
22741 rest_of_type_compilation.
22743 This is a declaration, so a new DIE will be created with
22746 2. Once for the Base() constructor definition, but this time
22747 while generating the abstract instance of the base
22748 constructor (__base_ctor) which is being generated via early
22749 debug of reachable functions.
22751 Even though we have a cached version of the declaration (1),
22752 we will create a DW_AT_specification of the declaration DIE
22755 3. Once for the __base_ctor itself, but this time, we generate
22756 an DW_AT_abstract_origin version of the DW_AT_specification in
22759 Late debug via rest_of_handle_final
22760 -----------------------------------
22762 4. One final time for the __base_ctor (which will have a cached
22763 DIE with DW_AT_abstract_origin created in (3). This time,
22764 we will just annotate the location information now
22767 int declaration
= (current_function_decl
!= decl
22768 || class_or_namespace_scope_p (context_die
));
22770 /* A declaration that has been previously dumped needs no
22771 additional information. */
22772 if (old_die
&& declaration
)
22775 /* Now that the C++ front end lazily declares artificial member fns, we
22776 might need to retrofit the declaration into its class. */
22777 if (!declaration
&& !origin
&& !old_die
22778 && DECL_CONTEXT (decl
) && TYPE_P (DECL_CONTEXT (decl
))
22779 && !class_or_namespace_scope_p (context_die
)
22780 && debug_info_level
> DINFO_LEVEL_TERSE
)
22781 old_die
= force_decl_die (decl
);
22783 /* A concrete instance, tag a new DIE with DW_AT_abstract_origin. */
22784 if (origin
!= NULL
)
22786 gcc_assert (!declaration
|| local_scope_p (context_die
));
22788 /* Fixup die_parent for the abstract instance of a nested
22789 inline function. */
22790 if (old_die
&& old_die
->die_parent
== NULL
)
22791 add_child_die (context_die
, old_die
);
22793 if (old_die
&& get_AT_ref (old_die
, DW_AT_abstract_origin
))
22795 /* If we have a DW_AT_abstract_origin we have a working
22797 subr_die
= old_die
;
22801 subr_die
= new_die (DW_TAG_subprogram
, context_die
, decl
);
22802 add_abstract_origin_attribute (subr_die
, origin
);
22803 /* This is where the actual code for a cloned function is.
22804 Let's emit linkage name attribute for it. This helps
22805 debuggers to e.g, set breakpoints into
22806 constructors/destructors when the user asks "break
22808 add_linkage_name (subr_die
, decl
);
22811 /* A cached copy, possibly from early dwarf generation. Reuse as
22812 much as possible. */
22815 if (!get_AT_flag (old_die
, DW_AT_declaration
)
22816 /* We can have a normal definition following an inline one in the
22817 case of redefinition of GNU C extern inlines.
22818 It seems reasonable to use AT_specification in this case. */
22819 && !get_AT (old_die
, DW_AT_inline
))
22821 /* Detect and ignore this case, where we are trying to output
22822 something we have already output. */
22823 if (get_AT (old_die
, DW_AT_low_pc
)
22824 || get_AT (old_die
, DW_AT_ranges
))
22827 /* If we have no location information, this must be a
22828 partially generated DIE from early dwarf generation.
22829 Fall through and generate it. */
22832 /* If the definition comes from the same place as the declaration,
22833 maybe use the old DIE. We always want the DIE for this function
22834 that has the *_pc attributes to be under comp_unit_die so the
22835 debugger can find it. We also need to do this for abstract
22836 instances of inlines, since the spec requires the out-of-line copy
22837 to have the same parent. For local class methods, this doesn't
22838 apply; we just use the old DIE. */
22839 expanded_location s
= expand_location (DECL_SOURCE_LOCATION (decl
));
22840 struct dwarf_file_data
* file_index
= lookup_filename (s
.file
);
22841 if (((is_unit_die (old_die
->die_parent
)
22842 /* This condition fixes the inconsistency/ICE with the
22843 following Fortran test (or some derivative thereof) while
22844 building libgfortran:
22848 logical function funky (FLAG)
22853 || (old_die
->die_parent
22854 && old_die
->die_parent
->die_tag
== DW_TAG_module
)
22855 || local_scope_p (old_die
->die_parent
)
22856 || context_die
== NULL
)
22857 && (DECL_ARTIFICIAL (decl
)
22858 || (get_AT_file (old_die
, DW_AT_decl_file
) == file_index
22859 && (get_AT_unsigned (old_die
, DW_AT_decl_line
)
22860 == (unsigned) s
.line
)
22861 && (!debug_column_info
22863 || (get_AT_unsigned (old_die
, DW_AT_decl_column
)
22864 == (unsigned) s
.column
)))))
22865 /* With LTO if there's an abstract instance for
22866 the old DIE, this is a concrete instance and
22867 thus re-use the DIE. */
22868 || get_AT (old_die
, DW_AT_abstract_origin
))
22870 subr_die
= old_die
;
22872 /* Clear out the declaration attribute, but leave the
22873 parameters so they can be augmented with location
22874 information later. Unless this was a declaration, in
22875 which case, wipe out the nameless parameters and recreate
22876 them further down. */
22877 if (remove_AT (subr_die
, DW_AT_declaration
))
22880 remove_AT (subr_die
, DW_AT_object_pointer
);
22881 remove_child_TAG (subr_die
, DW_TAG_formal_parameter
);
22884 /* Make a specification pointing to the previously built
22888 subr_die
= new_die (DW_TAG_subprogram
, context_die
, decl
);
22889 add_AT_specification (subr_die
, old_die
);
22890 add_pubname (decl
, subr_die
);
22891 if (get_AT_file (old_die
, DW_AT_decl_file
) != file_index
)
22892 add_AT_file (subr_die
, DW_AT_decl_file
, file_index
);
22893 if (get_AT_unsigned (old_die
, DW_AT_decl_line
) != (unsigned) s
.line
)
22894 add_AT_unsigned (subr_die
, DW_AT_decl_line
, s
.line
);
22895 if (debug_column_info
22897 && (get_AT_unsigned (old_die
, DW_AT_decl_column
)
22898 != (unsigned) s
.column
))
22899 add_AT_unsigned (subr_die
, DW_AT_decl_column
, s
.column
);
22901 /* If the prototype had an 'auto' or 'decltype(auto)' return type,
22902 emit the real type on the definition die. */
22903 if (is_cxx () && debug_info_level
> DINFO_LEVEL_TERSE
)
22905 dw_die_ref die
= get_AT_ref (old_die
, DW_AT_type
);
22906 if (die
== auto_die
|| die
== decltype_auto_die
)
22907 add_type_attribute (subr_die
, TREE_TYPE (TREE_TYPE (decl
)),
22908 TYPE_UNQUALIFIED
, false, context_die
);
22911 /* When we process the method declaration, we haven't seen
22912 the out-of-class defaulted definition yet, so we have to
22914 if ((dwarf_version
>= 5 || ! dwarf_strict
)
22915 && !get_AT (subr_die
, DW_AT_defaulted
))
22918 = lang_hooks
.decls
.decl_dwarf_attribute (decl
,
22920 if (defaulted
!= -1)
22922 /* Other values must have been handled before. */
22923 gcc_assert (defaulted
== DW_DEFAULTED_out_of_class
);
22924 add_AT_unsigned (subr_die
, DW_AT_defaulted
, defaulted
);
22929 /* Create a fresh DIE for anything else. */
22932 subr_die
= new_die (DW_TAG_subprogram
, context_die
, decl
);
22934 if (TREE_PUBLIC (decl
))
22935 add_AT_flag (subr_die
, DW_AT_external
, 1);
22937 add_name_and_src_coords_attributes (subr_die
, decl
);
22938 add_pubname (decl
, subr_die
);
22939 if (debug_info_level
> DINFO_LEVEL_TERSE
)
22941 add_prototyped_attribute (subr_die
, TREE_TYPE (decl
));
22942 add_type_attribute (subr_die
, TREE_TYPE (TREE_TYPE (decl
)),
22943 TYPE_UNQUALIFIED
, false, context_die
);
22946 add_pure_or_virtual_attribute (subr_die
, decl
);
22947 if (DECL_ARTIFICIAL (decl
))
22948 add_AT_flag (subr_die
, DW_AT_artificial
, 1);
22950 if (TREE_THIS_VOLATILE (decl
) && (dwarf_version
>= 5 || !dwarf_strict
))
22951 add_AT_flag (subr_die
, DW_AT_noreturn
, 1);
22953 add_alignment_attribute (subr_die
, decl
);
22955 add_accessibility_attribute (subr_die
, decl
);
22958 /* Unless we have an existing non-declaration DIE, equate the new
22960 if (!old_die
|| is_declaration_die (old_die
))
22961 equate_decl_number_to_die (decl
, subr_die
);
22965 if (!old_die
|| !get_AT (old_die
, DW_AT_inline
))
22967 add_AT_flag (subr_die
, DW_AT_declaration
, 1);
22969 /* If this is an explicit function declaration then generate
22970 a DW_AT_explicit attribute. */
22971 if ((dwarf_version
>= 3 || !dwarf_strict
)
22972 && lang_hooks
.decls
.decl_dwarf_attribute (decl
,
22973 DW_AT_explicit
) == 1)
22974 add_AT_flag (subr_die
, DW_AT_explicit
, 1);
22976 /* If this is a C++11 deleted special function member then generate
22977 a DW_AT_deleted attribute. */
22978 if ((dwarf_version
>= 5 || !dwarf_strict
)
22979 && lang_hooks
.decls
.decl_dwarf_attribute (decl
,
22980 DW_AT_deleted
) == 1)
22981 add_AT_flag (subr_die
, DW_AT_deleted
, 1);
22983 /* If this is a C++11 defaulted special function member then
22984 generate a DW_AT_defaulted attribute. */
22985 if (dwarf_version
>= 5 || !dwarf_strict
)
22988 = lang_hooks
.decls
.decl_dwarf_attribute (decl
,
22990 if (defaulted
!= -1)
22991 add_AT_unsigned (subr_die
, DW_AT_defaulted
, defaulted
);
22994 /* If this is a C++11 non-static member function with & ref-qualifier
22995 then generate a DW_AT_reference attribute. */
22996 if ((dwarf_version
>= 5 || !dwarf_strict
)
22997 && lang_hooks
.decls
.decl_dwarf_attribute (decl
,
22998 DW_AT_reference
) == 1)
22999 add_AT_flag (subr_die
, DW_AT_reference
, 1);
23001 /* If this is a C++11 non-static member function with &&
23002 ref-qualifier then generate a DW_AT_reference attribute. */
23003 if ((dwarf_version
>= 5 || !dwarf_strict
)
23004 && lang_hooks
.decls
.decl_dwarf_attribute (decl
,
23005 DW_AT_rvalue_reference
)
23007 add_AT_flag (subr_die
, DW_AT_rvalue_reference
, 1);
23010 /* For non DECL_EXTERNALs, if range information is available, fill
23011 the DIE with it. */
23012 else if (!DECL_EXTERNAL (decl
) && !early_dwarf
)
23014 HOST_WIDE_INT cfa_fb_offset
;
23016 struct function
*fun
= DECL_STRUCT_FUNCTION (decl
);
23018 if (!crtl
->has_bb_partition
)
23020 dw_fde_ref fde
= fun
->fde
;
23021 if (fde
->dw_fde_begin
)
23023 /* We have already generated the labels. */
23024 add_AT_low_high_pc (subr_die
, fde
->dw_fde_begin
,
23025 fde
->dw_fde_end
, false);
23029 /* Create start/end labels and add the range. */
23030 char label_id_low
[MAX_ARTIFICIAL_LABEL_BYTES
];
23031 char label_id_high
[MAX_ARTIFICIAL_LABEL_BYTES
];
23032 ASM_GENERATE_INTERNAL_LABEL (label_id_low
, FUNC_BEGIN_LABEL
,
23033 current_function_funcdef_no
);
23034 ASM_GENERATE_INTERNAL_LABEL (label_id_high
, FUNC_END_LABEL
,
23035 current_function_funcdef_no
);
23036 add_AT_low_high_pc (subr_die
, label_id_low
, label_id_high
,
23040 #if VMS_DEBUGGING_INFO
23041 /* HP OpenVMS Industry Standard 64: DWARF Extensions
23042 Section 2.3 Prologue and Epilogue Attributes:
23043 When a breakpoint is set on entry to a function, it is generally
23044 desirable for execution to be suspended, not on the very first
23045 instruction of the function, but rather at a point after the
23046 function's frame has been set up, after any language defined local
23047 declaration processing has been completed, and before execution of
23048 the first statement of the function begins. Debuggers generally
23049 cannot properly determine where this point is. Similarly for a
23050 breakpoint set on exit from a function. The prologue and epilogue
23051 attributes allow a compiler to communicate the location(s) to use. */
23054 if (fde
->dw_fde_vms_end_prologue
)
23055 add_AT_vms_delta (subr_die
, DW_AT_HP_prologue
,
23056 fde
->dw_fde_begin
, fde
->dw_fde_vms_end_prologue
);
23058 if (fde
->dw_fde_vms_begin_epilogue
)
23059 add_AT_vms_delta (subr_die
, DW_AT_HP_epilogue
,
23060 fde
->dw_fde_begin
, fde
->dw_fde_vms_begin_epilogue
);
23067 /* Generate pubnames entries for the split function code ranges. */
23068 dw_fde_ref fde
= fun
->fde
;
23070 if (fde
->dw_fde_second_begin
)
23072 if (dwarf_version
>= 3 || !dwarf_strict
)
23074 /* We should use ranges for non-contiguous code section
23075 addresses. Use the actual code range for the initial
23076 section, since the HOT/COLD labels might precede an
23077 alignment offset. */
23078 bool range_list_added
= false;
23079 add_ranges_by_labels (subr_die
, fde
->dw_fde_begin
,
23080 fde
->dw_fde_end
, &range_list_added
,
23082 add_ranges_by_labels (subr_die
, fde
->dw_fde_second_begin
,
23083 fde
->dw_fde_second_end
,
23084 &range_list_added
, false);
23085 if (range_list_added
)
23090 /* There is no real support in DW2 for this .. so we make
23091 a work-around. First, emit the pub name for the segment
23092 containing the function label. Then make and emit a
23093 simplified subprogram DIE for the second segment with the
23094 name pre-fixed by __hot/cold_sect_of_. We use the same
23095 linkage name for the second die so that gdb will find both
23096 sections when given "b foo". */
23097 const char *name
= NULL
;
23098 tree decl_name
= DECL_NAME (decl
);
23099 dw_die_ref seg_die
;
23101 /* Do the 'primary' section. */
23102 add_AT_low_high_pc (subr_die
, fde
->dw_fde_begin
,
23103 fde
->dw_fde_end
, false);
23105 /* Build a minimal DIE for the secondary section. */
23106 seg_die
= new_die (DW_TAG_subprogram
,
23107 subr_die
->die_parent
, decl
);
23109 if (TREE_PUBLIC (decl
))
23110 add_AT_flag (seg_die
, DW_AT_external
, 1);
23112 if (decl_name
!= NULL
23113 && IDENTIFIER_POINTER (decl_name
) != NULL
)
23115 name
= dwarf2_name (decl
, 1);
23116 if (! DECL_ARTIFICIAL (decl
))
23117 add_src_coords_attributes (seg_die
, decl
);
23119 add_linkage_name (seg_die
, decl
);
23121 gcc_assert (name
!= NULL
);
23122 add_pure_or_virtual_attribute (seg_die
, decl
);
23123 if (DECL_ARTIFICIAL (decl
))
23124 add_AT_flag (seg_die
, DW_AT_artificial
, 1);
23126 name
= concat ("__second_sect_of_", name
, NULL
);
23127 add_AT_low_high_pc (seg_die
, fde
->dw_fde_second_begin
,
23128 fde
->dw_fde_second_end
, false);
23129 add_name_attribute (seg_die
, name
);
23130 if (want_pubnames ())
23131 add_pubname_string (name
, seg_die
);
23135 add_AT_low_high_pc (subr_die
, fde
->dw_fde_begin
, fde
->dw_fde_end
,
23139 cfa_fb_offset
= CFA_FRAME_BASE_OFFSET (decl
);
23141 /* We define the "frame base" as the function's CFA. This is more
23142 convenient for several reasons: (1) It's stable across the prologue
23143 and epilogue, which makes it better than just a frame pointer,
23144 (2) With dwarf3, there exists a one-byte encoding that allows us
23145 to reference the .debug_frame data by proxy, but failing that,
23146 (3) We can at least reuse the code inspection and interpretation
23147 code that determines the CFA position at various points in the
23149 if (dwarf_version
>= 3 && targetm
.debug_unwind_info () == UI_DWARF2
)
23151 dw_loc_descr_ref op
= new_loc_descr (DW_OP_call_frame_cfa
, 0, 0);
23152 add_AT_loc (subr_die
, DW_AT_frame_base
, op
);
23156 dw_loc_list_ref list
= convert_cfa_to_fb_loc_list (cfa_fb_offset
);
23157 if (list
->dw_loc_next
)
23158 add_AT_loc_list (subr_die
, DW_AT_frame_base
, list
);
23160 add_AT_loc (subr_die
, DW_AT_frame_base
, list
->expr
);
23163 /* Compute a displacement from the "steady-state frame pointer" to
23164 the CFA. The former is what all stack slots and argument slots
23165 will reference in the rtl; the latter is what we've told the
23166 debugger about. We'll need to adjust all frame_base references
23167 by this displacement. */
23168 compute_frame_pointer_to_fb_displacement (cfa_fb_offset
);
23170 if (fun
->static_chain_decl
)
23172 /* DWARF requires here a location expression that computes the
23173 address of the enclosing subprogram's frame base. The machinery
23174 in tree-nested.c is supposed to store this specific address in the
23175 last field of the FRAME record. */
23176 const tree frame_type
23177 = TREE_TYPE (TREE_TYPE (fun
->static_chain_decl
));
23178 const tree fb_decl
= tree_last (TYPE_FIELDS (frame_type
));
23181 = build1 (INDIRECT_REF
, frame_type
, fun
->static_chain_decl
);
23182 fb_expr
= build3 (COMPONENT_REF
, TREE_TYPE (fb_decl
),
23183 fb_expr
, fb_decl
, NULL_TREE
);
23185 add_AT_location_description (subr_die
, DW_AT_static_link
,
23186 loc_list_from_tree (fb_expr
, 0, NULL
));
23189 resolve_variable_values ();
23192 /* Generate child dies for template paramaters. */
23193 if (early_dwarf
&& debug_info_level
> DINFO_LEVEL_TERSE
)
23194 gen_generic_params_dies (decl
);
23196 /* Now output descriptions of the arguments for this function. This gets
23197 (unnecessarily?) complex because of the fact that the DECL_ARGUMENT list
23198 for a FUNCTION_DECL doesn't indicate cases where there was a trailing
23199 `...' at the end of the formal parameter list. In order to find out if
23200 there was a trailing ellipsis or not, we must instead look at the type
23201 associated with the FUNCTION_DECL. This will be a node of type
23202 FUNCTION_TYPE. If the chain of type nodes hanging off of this
23203 FUNCTION_TYPE node ends with a void_type_node then there should *not* be
23204 an ellipsis at the end. */
23206 /* In the case where we are describing a mere function declaration, all we
23207 need to do here (and all we *can* do here) is to describe the *types* of
23208 its formal parameters. */
23209 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
23211 else if (declaration
)
23212 gen_formal_types_die (decl
, subr_die
);
23215 /* Generate DIEs to represent all known formal parameters. */
23216 tree parm
= DECL_ARGUMENTS (decl
);
23217 tree generic_decl
= early_dwarf
23218 ? lang_hooks
.decls
.get_generic_function_decl (decl
) : NULL
;
23219 tree generic_decl_parm
= generic_decl
23220 ? DECL_ARGUMENTS (generic_decl
)
23223 /* Now we want to walk the list of parameters of the function and
23224 emit their relevant DIEs.
23226 We consider the case of DECL being an instance of a generic function
23227 as well as it being a normal function.
23229 If DECL is an instance of a generic function we walk the
23230 parameters of the generic function declaration _and_ the parameters of
23231 DECL itself. This is useful because we want to emit specific DIEs for
23232 function parameter packs and those are declared as part of the
23233 generic function declaration. In that particular case,
23234 the parameter pack yields a DW_TAG_GNU_formal_parameter_pack DIE.
23235 That DIE has children DIEs representing the set of arguments
23236 of the pack. Note that the set of pack arguments can be empty.
23237 In that case, the DW_TAG_GNU_formal_parameter_pack DIE will not have any
23240 Otherwise, we just consider the parameters of DECL. */
23241 while (generic_decl_parm
|| parm
)
23243 if (generic_decl_parm
23244 && lang_hooks
.function_parameter_pack_p (generic_decl_parm
))
23245 gen_formal_parameter_pack_die (generic_decl_parm
,
23250 dw_die_ref parm_die
= gen_decl_die (parm
, NULL
, NULL
, subr_die
);
23253 && parm
== DECL_ARGUMENTS (decl
)
23254 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
23256 && (dwarf_version
>= 3 || !dwarf_strict
))
23257 add_AT_die_ref (subr_die
, DW_AT_object_pointer
, parm_die
);
23259 parm
= DECL_CHAIN (parm
);
23262 if (generic_decl_parm
)
23263 generic_decl_parm
= DECL_CHAIN (generic_decl_parm
);
23266 /* Decide whether we need an unspecified_parameters DIE at the end.
23267 There are 2 more cases to do this for: 1) the ansi ... declaration -
23268 this is detectable when the end of the arg list is not a
23269 void_type_node 2) an unprototyped function declaration (not a
23270 definition). This just means that we have no info about the
23271 parameters at all. */
23274 if (prototype_p (TREE_TYPE (decl
)))
23276 /* This is the prototyped case, check for.... */
23277 if (stdarg_p (TREE_TYPE (decl
)))
23278 gen_unspecified_parameters_die (decl
, subr_die
);
23280 else if (DECL_INITIAL (decl
) == NULL_TREE
)
23281 gen_unspecified_parameters_die (decl
, subr_die
);
23285 if (subr_die
!= old_die
)
23286 /* Add the calling convention attribute if requested. */
23287 add_calling_convention_attribute (subr_die
, decl
);
23289 /* Output Dwarf info for all of the stuff within the body of the function
23290 (if it has one - it may be just a declaration).
23292 OUTER_SCOPE is a pointer to the outermost BLOCK node created to represent
23293 a function. This BLOCK actually represents the outermost binding contour
23294 for the function, i.e. the contour in which the function's formal
23295 parameters and labels get declared. Curiously, it appears that the front
23296 end doesn't actually put the PARM_DECL nodes for the current function onto
23297 the BLOCK_VARS list for this outer scope, but are strung off of the
23298 DECL_ARGUMENTS list for the function instead.
23300 The BLOCK_VARS list for the `outer_scope' does provide us with a list of
23301 the LABEL_DECL nodes for the function however, and we output DWARF info
23302 for those in decls_for_scope. Just within the `outer_scope' there will be
23303 a BLOCK node representing the function's outermost pair of curly braces,
23304 and any blocks used for the base and member initializers of a C++
23305 constructor function. */
23306 tree outer_scope
= DECL_INITIAL (decl
);
23307 if (! declaration
&& outer_scope
&& TREE_CODE (outer_scope
) != ERROR_MARK
)
23309 int call_site_note_count
= 0;
23310 int tail_call_site_note_count
= 0;
23312 /* Emit a DW_TAG_variable DIE for a named return value. */
23313 if (DECL_NAME (DECL_RESULT (decl
)))
23314 gen_decl_die (DECL_RESULT (decl
), NULL
, NULL
, subr_die
);
23316 /* The first time through decls_for_scope we will generate the
23317 DIEs for the locals. The second time, we fill in the
23319 decls_for_scope (outer_scope
, subr_die
);
23321 if (call_arg_locations
&& (!dwarf_strict
|| dwarf_version
>= 5))
23323 struct call_arg_loc_node
*ca_loc
;
23324 for (ca_loc
= call_arg_locations
; ca_loc
; ca_loc
= ca_loc
->next
)
23326 dw_die_ref die
= NULL
;
23327 rtx tloc
= NULL_RTX
, tlocc
= NULL_RTX
;
23329 tree arg_decl
= NULL_TREE
;
23331 for (arg
= (ca_loc
->call_arg_loc_note
!= NULL_RTX
23332 ? XEXP (ca_loc
->call_arg_loc_note
, 0)
23334 arg
; arg
= next_arg
)
23336 dw_loc_descr_ref reg
, val
;
23337 machine_mode mode
= GET_MODE (XEXP (XEXP (arg
, 0), 1));
23338 dw_die_ref cdie
, tdie
= NULL
;
23340 next_arg
= XEXP (arg
, 1);
23341 if (REG_P (XEXP (XEXP (arg
, 0), 0))
23343 && MEM_P (XEXP (XEXP (next_arg
, 0), 0))
23344 && REG_P (XEXP (XEXP (XEXP (next_arg
, 0), 0), 0))
23345 && REGNO (XEXP (XEXP (arg
, 0), 0))
23346 == REGNO (XEXP (XEXP (XEXP (next_arg
, 0), 0), 0)))
23347 next_arg
= XEXP (next_arg
, 1);
23348 if (mode
== VOIDmode
)
23350 mode
= GET_MODE (XEXP (XEXP (arg
, 0), 0));
23351 if (mode
== VOIDmode
)
23352 mode
= GET_MODE (XEXP (arg
, 0));
23354 if (mode
== VOIDmode
|| mode
== BLKmode
)
23356 /* Get dynamic information about call target only if we
23357 have no static information: we cannot generate both
23358 DW_AT_call_origin and DW_AT_call_target
23360 if (ca_loc
->symbol_ref
== NULL_RTX
)
23362 if (XEXP (XEXP (arg
, 0), 0) == pc_rtx
)
23364 tloc
= XEXP (XEXP (arg
, 0), 1);
23367 else if (GET_CODE (XEXP (XEXP (arg
, 0), 0)) == CLOBBER
23368 && XEXP (XEXP (XEXP (arg
, 0), 0), 0) == pc_rtx
)
23370 tlocc
= XEXP (XEXP (arg
, 0), 1);
23375 if (REG_P (XEXP (XEXP (arg
, 0), 0)))
23376 reg
= reg_loc_descriptor (XEXP (XEXP (arg
, 0), 0),
23377 VAR_INIT_STATUS_INITIALIZED
);
23378 else if (MEM_P (XEXP (XEXP (arg
, 0), 0)))
23380 rtx mem
= XEXP (XEXP (arg
, 0), 0);
23381 reg
= mem_loc_descriptor (XEXP (mem
, 0),
23382 get_address_mode (mem
),
23384 VAR_INIT_STATUS_INITIALIZED
);
23386 else if (GET_CODE (XEXP (XEXP (arg
, 0), 0))
23387 == DEBUG_PARAMETER_REF
)
23390 = DEBUG_PARAMETER_REF_DECL (XEXP (XEXP (arg
, 0), 0));
23391 tdie
= lookup_decl_die (tdecl
);
23399 && GET_CODE (XEXP (XEXP (arg
, 0), 0))
23400 != DEBUG_PARAMETER_REF
)
23402 val
= mem_loc_descriptor (XEXP (XEXP (arg
, 0), 1), mode
,
23404 VAR_INIT_STATUS_INITIALIZED
);
23408 die
= gen_call_site_die (decl
, subr_die
, ca_loc
);
23409 cdie
= new_die (dwarf_TAG (DW_TAG_call_site_parameter
), die
,
23411 add_desc_attribute (cdie
, arg_decl
);
23413 add_AT_loc (cdie
, DW_AT_location
, reg
);
23414 else if (tdie
!= NULL
)
23415 add_AT_die_ref (cdie
, dwarf_AT (DW_AT_call_parameter
),
23417 add_AT_loc (cdie
, dwarf_AT (DW_AT_call_value
), val
);
23418 if (next_arg
!= XEXP (arg
, 1))
23420 mode
= GET_MODE (XEXP (XEXP (XEXP (arg
, 1), 0), 1));
23421 if (mode
== VOIDmode
)
23422 mode
= GET_MODE (XEXP (XEXP (XEXP (arg
, 1), 0), 0));
23423 val
= mem_loc_descriptor (XEXP (XEXP (XEXP (arg
, 1),
23426 VAR_INIT_STATUS_INITIALIZED
);
23428 add_AT_loc (cdie
, dwarf_AT (DW_AT_call_data_value
),
23433 && (ca_loc
->symbol_ref
|| tloc
))
23434 die
= gen_call_site_die (decl
, subr_die
, ca_loc
);
23435 if (die
!= NULL
&& (tloc
!= NULL_RTX
|| tlocc
!= NULL_RTX
))
23437 dw_loc_descr_ref tval
= NULL
;
23439 if (tloc
!= NULL_RTX
)
23440 tval
= mem_loc_descriptor (tloc
,
23441 GET_MODE (tloc
) == VOIDmode
23442 ? Pmode
: GET_MODE (tloc
),
23444 VAR_INIT_STATUS_INITIALIZED
);
23446 add_AT_loc (die
, dwarf_AT (DW_AT_call_target
), tval
);
23447 else if (tlocc
!= NULL_RTX
)
23449 tval
= mem_loc_descriptor (tlocc
,
23450 GET_MODE (tlocc
) == VOIDmode
23451 ? Pmode
: GET_MODE (tlocc
),
23453 VAR_INIT_STATUS_INITIALIZED
);
23456 dwarf_AT (DW_AT_call_target_clobbered
),
23462 call_site_note_count
++;
23463 if (ca_loc
->tail_call_p
)
23464 tail_call_site_note_count
++;
23468 call_arg_locations
= NULL
;
23469 call_arg_loc_last
= NULL
;
23470 if (tail_call_site_count
>= 0
23471 && tail_call_site_count
== tail_call_site_note_count
23472 && (!dwarf_strict
|| dwarf_version
>= 5))
23474 if (call_site_count
>= 0
23475 && call_site_count
== call_site_note_count
)
23476 add_AT_flag (subr_die
, dwarf_AT (DW_AT_call_all_calls
), 1);
23478 add_AT_flag (subr_die
, dwarf_AT (DW_AT_call_all_tail_calls
), 1);
23480 call_site_count
= -1;
23481 tail_call_site_count
= -1;
23484 /* Mark used types after we have created DIEs for the functions scopes. */
23485 premark_used_types (DECL_STRUCT_FUNCTION (decl
));
23488 /* Returns a hash value for X (which really is a die_struct). */
23491 block_die_hasher::hash (die_struct
*d
)
23493 return (hashval_t
) d
->decl_id
^ htab_hash_pointer (d
->die_parent
);
23496 /* Return nonzero if decl_id and die_parent of die_struct X is the same
23497 as decl_id and die_parent of die_struct Y. */
23500 block_die_hasher::equal (die_struct
*x
, die_struct
*y
)
23502 return x
->decl_id
== y
->decl_id
&& x
->die_parent
== y
->die_parent
;
23505 /* Hold information about markers for inlined entry points. */
23506 struct GTY ((for_user
)) inline_entry_data
23508 /* The block that's the inlined_function_outer_scope for an inlined
23512 /* The label at the inlined entry point. */
23513 const char *label_pfx
;
23514 unsigned int label_num
;
23516 /* The view number to be used as the inlined entry point. */
23520 struct inline_entry_data_hasher
: ggc_ptr_hash
<inline_entry_data
>
23522 typedef tree compare_type
;
23523 static inline hashval_t
hash (const inline_entry_data
*);
23524 static inline bool equal (const inline_entry_data
*, const_tree
);
23527 /* Hash table routines for inline_entry_data. */
23530 inline_entry_data_hasher::hash (const inline_entry_data
*data
)
23532 return htab_hash_pointer (data
->block
);
23536 inline_entry_data_hasher::equal (const inline_entry_data
*data
,
23539 return data
->block
== block
;
23542 /* Inlined entry points pending DIE creation in this compilation unit. */
23544 static GTY(()) hash_table
<inline_entry_data_hasher
> *inline_entry_data_table
;
23547 /* Return TRUE if DECL, which may have been previously generated as
23548 OLD_DIE, is a candidate for a DW_AT_specification. DECLARATION is
23549 true if decl (or its origin) is either an extern declaration or a
23550 class/namespace scoped declaration.
23552 The declare_in_namespace support causes us to get two DIEs for one
23553 variable, both of which are declarations. We want to avoid
23554 considering one to be a specification, so we must test for
23555 DECLARATION and DW_AT_declaration. */
23557 decl_will_get_specification_p (dw_die_ref old_die
, tree decl
, bool declaration
)
23559 return (old_die
&& TREE_STATIC (decl
) && !declaration
23560 && get_AT_flag (old_die
, DW_AT_declaration
) == 1);
23563 /* Return true if DECL is a local static. */
23566 local_function_static (tree decl
)
23568 gcc_assert (VAR_P (decl
));
23569 return TREE_STATIC (decl
)
23570 && DECL_CONTEXT (decl
)
23571 && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
;
23574 /* Return true iff DECL overrides (presumably completes) the type of
23575 OLD_DIE within CONTEXT_DIE. */
23578 override_type_for_decl_p (tree decl
, dw_die_ref old_die
,
23579 dw_die_ref context_die
)
23581 tree type
= TREE_TYPE (decl
);
23584 if (decl_by_reference_p (decl
))
23586 type
= TREE_TYPE (type
);
23587 cv_quals
= TYPE_UNQUALIFIED
;
23590 cv_quals
= decl_quals (decl
);
23592 dw_die_ref type_die
= modified_type_die (type
,
23593 cv_quals
| TYPE_QUALS (type
),
23597 dw_die_ref old_type_die
= get_AT_ref (old_die
, DW_AT_type
);
23599 return type_die
!= old_type_die
;
23602 /* Generate a DIE to represent a declared data object.
23603 Either DECL or ORIGIN must be non-null. */
23606 gen_variable_die (tree decl
, tree origin
, dw_die_ref context_die
)
23608 HOST_WIDE_INT off
= 0;
23610 tree decl_or_origin
= decl
? decl
: origin
;
23611 tree ultimate_origin
;
23612 dw_die_ref var_die
;
23613 dw_die_ref old_die
= decl
? lookup_decl_die (decl
) : NULL
;
23614 bool declaration
= (DECL_EXTERNAL (decl_or_origin
)
23615 || class_or_namespace_scope_p (context_die
));
23616 bool specialization_p
= false;
23617 bool no_linkage_name
= false;
23619 /* While C++ inline static data members have definitions inside of the
23620 class, force the first DIE to be a declaration, then let gen_member_die
23621 reparent it to the class context and call gen_variable_die again
23622 to create the outside of the class DIE for the definition. */
23626 && DECL_CONTEXT (decl
)
23627 && TYPE_P (DECL_CONTEXT (decl
))
23628 && lang_hooks
.decls
.decl_dwarf_attribute (decl
, DW_AT_inline
) != -1)
23630 declaration
= true;
23631 if (dwarf_version
< 5)
23632 no_linkage_name
= true;
23635 ultimate_origin
= decl_ultimate_origin (decl_or_origin
);
23636 if (decl
|| ultimate_origin
)
23637 origin
= ultimate_origin
;
23638 com_decl
= fortran_common (decl_or_origin
, &off
);
23640 /* Symbol in common gets emitted as a child of the common block, in the form
23641 of a data member. */
23644 dw_die_ref com_die
;
23645 dw_loc_list_ref loc
= NULL
;
23646 die_node com_die_arg
;
23648 var_die
= lookup_decl_die (decl_or_origin
);
23651 if (! early_dwarf
&& get_AT (var_die
, DW_AT_location
) == NULL
)
23653 loc
= loc_list_from_tree (com_decl
, off
? 1 : 2, NULL
);
23658 /* Optimize the common case. */
23659 if (single_element_loc_list_p (loc
)
23660 && loc
->expr
->dw_loc_opc
== DW_OP_addr
23661 && loc
->expr
->dw_loc_next
== NULL
23662 && GET_CODE (loc
->expr
->dw_loc_oprnd1
.v
.val_addr
)
23665 rtx x
= loc
->expr
->dw_loc_oprnd1
.v
.val_addr
;
23666 loc
->expr
->dw_loc_oprnd1
.v
.val_addr
23667 = plus_constant (GET_MODE (x
), x
, off
);
23670 loc_list_plus_const (loc
, off
);
23672 add_AT_location_description (var_die
, DW_AT_location
, loc
);
23673 remove_AT (var_die
, DW_AT_declaration
);
23679 if (common_block_die_table
== NULL
)
23680 common_block_die_table
= hash_table
<block_die_hasher
>::create_ggc (10);
23682 com_die_arg
.decl_id
= DECL_UID (com_decl
);
23683 com_die_arg
.die_parent
= context_die
;
23684 com_die
= common_block_die_table
->find (&com_die_arg
);
23686 loc
= loc_list_from_tree (com_decl
, 2, NULL
);
23687 if (com_die
== NULL
)
23690 = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (com_decl
));
23693 com_die
= new_die (DW_TAG_common_block
, context_die
, decl
);
23694 add_name_and_src_coords_attributes (com_die
, com_decl
);
23697 add_AT_location_description (com_die
, DW_AT_location
, loc
);
23698 /* Avoid sharing the same loc descriptor between
23699 DW_TAG_common_block and DW_TAG_variable. */
23700 loc
= loc_list_from_tree (com_decl
, 2, NULL
);
23702 else if (DECL_EXTERNAL (decl_or_origin
))
23703 add_AT_flag (com_die
, DW_AT_declaration
, 1);
23704 if (want_pubnames ())
23705 add_pubname_string (cnam
, com_die
); /* ??? needed? */
23706 com_die
->decl_id
= DECL_UID (com_decl
);
23707 slot
= common_block_die_table
->find_slot (com_die
, INSERT
);
23710 else if (get_AT (com_die
, DW_AT_location
) == NULL
&& loc
)
23712 add_AT_location_description (com_die
, DW_AT_location
, loc
);
23713 loc
= loc_list_from_tree (com_decl
, 2, NULL
);
23714 remove_AT (com_die
, DW_AT_declaration
);
23716 var_die
= new_die (DW_TAG_variable
, com_die
, decl
);
23717 add_name_and_src_coords_attributes (var_die
, decl_or_origin
);
23718 add_type_attribute (var_die
, TREE_TYPE (decl_or_origin
),
23719 decl_quals (decl_or_origin
), false,
23721 add_alignment_attribute (var_die
, decl
);
23722 add_AT_flag (var_die
, DW_AT_external
, 1);
23727 /* Optimize the common case. */
23728 if (single_element_loc_list_p (loc
)
23729 && loc
->expr
->dw_loc_opc
== DW_OP_addr
23730 && loc
->expr
->dw_loc_next
== NULL
23731 && GET_CODE (loc
->expr
->dw_loc_oprnd1
.v
.val_addr
) == SYMBOL_REF
)
23733 rtx x
= loc
->expr
->dw_loc_oprnd1
.v
.val_addr
;
23734 loc
->expr
->dw_loc_oprnd1
.v
.val_addr
23735 = plus_constant (GET_MODE (x
), x
, off
);
23738 loc_list_plus_const (loc
, off
);
23740 add_AT_location_description (var_die
, DW_AT_location
, loc
);
23742 else if (DECL_EXTERNAL (decl_or_origin
))
23743 add_AT_flag (var_die
, DW_AT_declaration
, 1);
23745 equate_decl_number_to_die (decl
, var_die
);
23753 /* A declaration that has been previously dumped, needs no
23754 further annotations, since it doesn't need location on
23755 the second pass. */
23758 else if (decl_will_get_specification_p (old_die
, decl
, declaration
)
23759 && !get_AT (old_die
, DW_AT_specification
))
23761 /* Fall-thru so we can make a new variable die along with a
23762 DW_AT_specification. */
23764 else if (origin
&& old_die
->die_parent
!= context_die
)
23766 /* If we will be creating an inlined instance, we need a
23767 new DIE that will get annotated with
23768 DW_AT_abstract_origin. */
23769 gcc_assert (!DECL_ABSTRACT_P (decl
));
23773 /* If a DIE was dumped early, it still needs location info.
23774 Skip to where we fill the location bits. */
23777 /* ??? In LTRANS we cannot annotate early created variably
23778 modified type DIEs without copying them and adjusting all
23779 references to them. Thus we dumped them again. Also add a
23780 reference to them but beware of -g0 compile and -g link
23781 in which case the reference will be already present. */
23782 tree type
= TREE_TYPE (decl_or_origin
);
23784 && ! get_AT (var_die
, DW_AT_type
)
23785 && variably_modified_type_p
23786 (type
, decl_function_context (decl_or_origin
)))
23788 if (decl_by_reference_p (decl_or_origin
))
23789 add_type_attribute (var_die
, TREE_TYPE (type
),
23790 TYPE_UNQUALIFIED
, false, context_die
);
23792 add_type_attribute (var_die
, type
, decl_quals (decl_or_origin
),
23793 false, context_die
);
23796 goto gen_variable_die_location
;
23800 /* For static data members, the declaration in the class is supposed
23801 to have DW_TAG_member tag in DWARF{3,4} and we emit it for compatibility
23802 also in DWARF2; the specification should still be DW_TAG_variable
23803 referencing the DW_TAG_member DIE. */
23804 if (declaration
&& class_scope_p (context_die
) && dwarf_version
< 5)
23805 var_die
= new_die (DW_TAG_member
, context_die
, decl
);
23807 var_die
= new_die (DW_TAG_variable
, context_die
, decl
);
23809 if (origin
!= NULL
)
23810 add_abstract_origin_attribute (var_die
, origin
);
23812 /* Loop unrolling can create multiple blocks that refer to the same
23813 static variable, so we must test for the DW_AT_declaration flag.
23815 ??? Loop unrolling/reorder_blocks should perhaps be rewritten to
23816 copy decls and set the DECL_ABSTRACT_P flag on them instead of
23819 ??? Duplicated blocks have been rewritten to use .debug_ranges. */
23820 else if (decl_will_get_specification_p (old_die
, decl
, declaration
))
23822 /* This is a definition of a C++ class level static. */
23823 add_AT_specification (var_die
, old_die
);
23824 specialization_p
= true;
23825 if (DECL_NAME (decl
))
23827 expanded_location s
= expand_location (DECL_SOURCE_LOCATION (decl
));
23828 struct dwarf_file_data
* file_index
= lookup_filename (s
.file
);
23830 if (get_AT_file (old_die
, DW_AT_decl_file
) != file_index
)
23831 add_AT_file (var_die
, DW_AT_decl_file
, file_index
);
23833 if (get_AT_unsigned (old_die
, DW_AT_decl_line
) != (unsigned) s
.line
)
23834 add_AT_unsigned (var_die
, DW_AT_decl_line
, s
.line
);
23836 if (debug_column_info
23838 && (get_AT_unsigned (old_die
, DW_AT_decl_column
)
23839 != (unsigned) s
.column
))
23840 add_AT_unsigned (var_die
, DW_AT_decl_column
, s
.column
);
23842 if (old_die
->die_tag
== DW_TAG_member
)
23843 add_linkage_name (var_die
, decl
);
23847 add_name_and_src_coords_attributes (var_die
, decl
, no_linkage_name
);
23849 if ((origin
== NULL
&& !specialization_p
)
23851 && !DECL_ABSTRACT_P (decl_or_origin
)
23852 && variably_modified_type_p (TREE_TYPE (decl_or_origin
),
23853 decl_function_context
23855 || (old_die
&& specialization_p
23856 && override_type_for_decl_p (decl_or_origin
, old_die
, context_die
)))
23858 tree type
= TREE_TYPE (decl_or_origin
);
23860 if (decl_by_reference_p (decl_or_origin
))
23861 add_type_attribute (var_die
, TREE_TYPE (type
), TYPE_UNQUALIFIED
, false,
23864 add_type_attribute (var_die
, type
, decl_quals (decl_or_origin
), false,
23868 if (origin
== NULL
&& !specialization_p
)
23870 if (TREE_PUBLIC (decl
))
23871 add_AT_flag (var_die
, DW_AT_external
, 1);
23873 if (DECL_ARTIFICIAL (decl
))
23874 add_AT_flag (var_die
, DW_AT_artificial
, 1);
23876 add_alignment_attribute (var_die
, decl
);
23878 add_accessibility_attribute (var_die
, decl
);
23882 add_AT_flag (var_die
, DW_AT_declaration
, 1);
23884 if (decl
&& (DECL_ABSTRACT_P (decl
)
23885 || !old_die
|| is_declaration_die (old_die
)))
23886 equate_decl_number_to_die (decl
, var_die
);
23888 gen_variable_die_location
:
23890 && (! DECL_ABSTRACT_P (decl_or_origin
)
23891 /* Local static vars are shared between all clones/inlines,
23892 so emit DW_AT_location on the abstract DIE if DECL_RTL is
23894 || (VAR_P (decl_or_origin
)
23895 && TREE_STATIC (decl_or_origin
)
23896 && DECL_RTL_SET_P (decl_or_origin
))))
23899 add_pubname (decl_or_origin
, var_die
);
23901 add_location_or_const_value_attribute (var_die
, decl_or_origin
,
23905 tree_add_const_value_attribute_for_decl (var_die
, decl_or_origin
);
23907 if ((dwarf_version
>= 4 || !dwarf_strict
)
23908 && lang_hooks
.decls
.decl_dwarf_attribute (decl_or_origin
,
23909 DW_AT_const_expr
) == 1
23910 && !get_AT (var_die
, DW_AT_const_expr
)
23911 && !specialization_p
)
23912 add_AT_flag (var_die
, DW_AT_const_expr
, 1);
23916 int inl
= lang_hooks
.decls
.decl_dwarf_attribute (decl_or_origin
,
23919 && !get_AT (var_die
, DW_AT_inline
)
23920 && !specialization_p
)
23921 add_AT_unsigned (var_die
, DW_AT_inline
, inl
);
23925 /* Generate a DIE to represent a named constant. */
23928 gen_const_die (tree decl
, dw_die_ref context_die
)
23930 dw_die_ref const_die
;
23931 tree type
= TREE_TYPE (decl
);
23933 const_die
= lookup_decl_die (decl
);
23937 const_die
= new_die (DW_TAG_constant
, context_die
, decl
);
23938 equate_decl_number_to_die (decl
, const_die
);
23939 add_name_and_src_coords_attributes (const_die
, decl
);
23940 add_type_attribute (const_die
, type
, TYPE_QUAL_CONST
, false, context_die
);
23941 if (TREE_PUBLIC (decl
))
23942 add_AT_flag (const_die
, DW_AT_external
, 1);
23943 if (DECL_ARTIFICIAL (decl
))
23944 add_AT_flag (const_die
, DW_AT_artificial
, 1);
23945 tree_add_const_value_attribute_for_decl (const_die
, decl
);
23948 /* Generate a DIE to represent a label identifier. */
23951 gen_label_die (tree decl
, dw_die_ref context_die
)
23953 tree origin
= decl_ultimate_origin (decl
);
23954 dw_die_ref lbl_die
= lookup_decl_die (decl
);
23956 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
23960 lbl_die
= new_die (DW_TAG_label
, context_die
, decl
);
23961 equate_decl_number_to_die (decl
, lbl_die
);
23963 if (origin
!= NULL
)
23964 add_abstract_origin_attribute (lbl_die
, origin
);
23966 add_name_and_src_coords_attributes (lbl_die
, decl
);
23969 if (DECL_ABSTRACT_P (decl
))
23970 equate_decl_number_to_die (decl
, lbl_die
);
23971 else if (! early_dwarf
)
23973 insn
= DECL_RTL_IF_SET (decl
);
23975 /* Deleted labels are programmer specified labels which have been
23976 eliminated because of various optimizations. We still emit them
23977 here so that it is possible to put breakpoints on them. */
23981 && NOTE_KIND (insn
) == NOTE_INSN_DELETED_LABEL
))))
23983 /* When optimization is enabled (via -O) some parts of the compiler
23984 (e.g. jump.c and cse.c) may try to delete CODE_LABEL insns which
23985 represent source-level labels which were explicitly declared by
23986 the user. This really shouldn't be happening though, so catch
23987 it if it ever does happen. */
23988 gcc_assert (!as_a
<rtx_insn
*> (insn
)->deleted ());
23990 ASM_GENERATE_INTERNAL_LABEL (label
, "L", CODE_LABEL_NUMBER (insn
));
23991 add_AT_lbl_id (lbl_die
, DW_AT_low_pc
, label
);
23995 && NOTE_KIND (insn
) == NOTE_INSN_DELETED_DEBUG_LABEL
23996 && CODE_LABEL_NUMBER (insn
) != -1)
23998 ASM_GENERATE_INTERNAL_LABEL (label
, "LDL", CODE_LABEL_NUMBER (insn
));
23999 add_AT_lbl_id (lbl_die
, DW_AT_low_pc
, label
);
24004 /* A helper function for gen_inlined_subroutine_die. Add source coordinate
24005 attributes to the DIE for a block STMT, to describe where the inlined
24006 function was called from. This is similar to add_src_coords_attributes. */
24009 add_call_src_coords_attributes (tree stmt
, dw_die_ref die
)
24011 /* We can end up with BUILTINS_LOCATION here. */
24012 if (RESERVED_LOCATION_P (BLOCK_SOURCE_LOCATION (stmt
)))
24015 expanded_location s
= expand_location (BLOCK_SOURCE_LOCATION (stmt
));
24017 if (dwarf_version
>= 3 || !dwarf_strict
)
24019 add_AT_file (die
, DW_AT_call_file
, lookup_filename (s
.file
));
24020 add_AT_unsigned (die
, DW_AT_call_line
, s
.line
);
24021 if (debug_column_info
&& s
.column
)
24022 add_AT_unsigned (die
, DW_AT_call_column
, s
.column
);
24027 /* A helper function for gen_lexical_block_die and gen_inlined_subroutine_die.
24028 Add low_pc and high_pc attributes to the DIE for a block STMT. */
24031 add_high_low_attributes (tree stmt
, dw_die_ref die
)
24033 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
24035 if (inline_entry_data
**iedp
24036 = !inline_entry_data_table
? NULL
24037 : inline_entry_data_table
->find_slot_with_hash (stmt
,
24038 htab_hash_pointer (stmt
),
24041 inline_entry_data
*ied
= *iedp
;
24042 gcc_assert (MAY_HAVE_DEBUG_MARKER_INSNS
);
24043 gcc_assert (debug_inline_points
);
24044 gcc_assert (inlined_function_outer_scope_p (stmt
));
24046 ASM_GENERATE_INTERNAL_LABEL (label
, ied
->label_pfx
, ied
->label_num
);
24047 add_AT_lbl_id (die
, DW_AT_entry_pc
, label
);
24049 if (debug_variable_location_views
&& !ZERO_VIEW_P (ied
->view
)
24052 if (!output_asm_line_debug_info ())
24053 add_AT_unsigned (die
, DW_AT_GNU_entry_view
, ied
->view
);
24056 ASM_GENERATE_INTERNAL_LABEL (label
, "LVU", ied
->view
);
24057 /* FIXME: this will resolve to a small number. Could we
24058 possibly emit smaller data? Ideally we'd emit a
24059 uleb128, but that would make the size of DIEs
24060 impossible for the compiler to compute, since it's
24061 the assembler that computes the value of the view
24062 label in this case. Ideally, we'd have a single form
24063 encompassing both the address and the view, and
24064 indirecting them through a table might make things
24065 easier, but even that would be more wasteful,
24066 space-wise, than what we have now. */
24067 add_AT_symview (die
, DW_AT_GNU_entry_view
, label
);
24071 inline_entry_data_table
->clear_slot (iedp
);
24074 if (BLOCK_FRAGMENT_CHAIN (stmt
)
24075 && (dwarf_version
>= 3 || !dwarf_strict
))
24077 tree chain
, superblock
= NULL_TREE
;
24079 dw_attr_node
*attr
= NULL
;
24081 if (!debug_inline_points
&& inlined_function_outer_scope_p (stmt
))
24083 ASM_GENERATE_INTERNAL_LABEL (label
, BLOCK_BEGIN_LABEL
,
24084 BLOCK_NUMBER (stmt
));
24085 add_AT_lbl_id (die
, DW_AT_entry_pc
, label
);
24088 /* Optimize duplicate .debug_ranges lists or even tails of
24089 lists. If this BLOCK has same ranges as its supercontext,
24090 lookup DW_AT_ranges attribute in the supercontext (and
24091 recursively so), verify that the ranges_table contains the
24092 right values and use it instead of adding a new .debug_range. */
24093 for (chain
= stmt
, pdie
= die
;
24094 BLOCK_SAME_RANGE (chain
);
24095 chain
= BLOCK_SUPERCONTEXT (chain
))
24097 dw_attr_node
*new_attr
;
24099 pdie
= pdie
->die_parent
;
24102 if (BLOCK_SUPERCONTEXT (chain
) == NULL_TREE
)
24104 new_attr
= get_AT (pdie
, DW_AT_ranges
);
24105 if (new_attr
== NULL
24106 || new_attr
->dw_attr_val
.val_class
!= dw_val_class_range_list
)
24109 superblock
= BLOCK_SUPERCONTEXT (chain
);
24112 && ((*ranges_table
)[attr
->dw_attr_val
.v
.val_offset
].num
24113 == (int)BLOCK_NUMBER (superblock
))
24114 && BLOCK_FRAGMENT_CHAIN (superblock
))
24116 unsigned long off
= attr
->dw_attr_val
.v
.val_offset
;
24117 unsigned long supercnt
= 0, thiscnt
= 0;
24118 for (chain
= BLOCK_FRAGMENT_CHAIN (superblock
);
24119 chain
; chain
= BLOCK_FRAGMENT_CHAIN (chain
))
24122 gcc_checking_assert ((*ranges_table
)[off
+ supercnt
].num
24123 == (int)BLOCK_NUMBER (chain
));
24125 gcc_checking_assert ((*ranges_table
)[off
+ supercnt
+ 1].num
== 0);
24126 for (chain
= BLOCK_FRAGMENT_CHAIN (stmt
);
24127 chain
; chain
= BLOCK_FRAGMENT_CHAIN (chain
))
24129 gcc_assert (supercnt
>= thiscnt
);
24130 add_AT_range_list (die
, DW_AT_ranges
, off
+ supercnt
- thiscnt
,
24132 note_rnglist_head (off
+ supercnt
- thiscnt
);
24136 unsigned int offset
= add_ranges (stmt
, true);
24137 add_AT_range_list (die
, DW_AT_ranges
, offset
, false);
24138 note_rnglist_head (offset
);
24140 bool prev_in_cold
= BLOCK_IN_COLD_SECTION_P (stmt
);
24141 chain
= BLOCK_FRAGMENT_CHAIN (stmt
);
24144 add_ranges (chain
, prev_in_cold
!= BLOCK_IN_COLD_SECTION_P (chain
));
24145 prev_in_cold
= BLOCK_IN_COLD_SECTION_P (chain
);
24146 chain
= BLOCK_FRAGMENT_CHAIN (chain
);
24153 char label_high
[MAX_ARTIFICIAL_LABEL_BYTES
];
24154 ASM_GENERATE_INTERNAL_LABEL (label
, BLOCK_BEGIN_LABEL
,
24155 BLOCK_NUMBER (stmt
));
24156 ASM_GENERATE_INTERNAL_LABEL (label_high
, BLOCK_END_LABEL
,
24157 BLOCK_NUMBER (stmt
));
24158 add_AT_low_high_pc (die
, label
, label_high
, false);
24162 /* Generate a DIE for a lexical block. */
24165 gen_lexical_block_die (tree stmt
, dw_die_ref context_die
)
24167 dw_die_ref old_die
= lookup_block_die (stmt
);
24168 dw_die_ref stmt_die
= NULL
;
24171 stmt_die
= new_die (DW_TAG_lexical_block
, context_die
, stmt
);
24172 equate_block_to_die (stmt
, stmt_die
);
24175 if (BLOCK_ABSTRACT_ORIGIN (stmt
))
24177 /* If this is an inlined or conrecte instance, create a new lexical
24178 die for anything below to attach DW_AT_abstract_origin to. */
24180 stmt_die
= new_die (DW_TAG_lexical_block
, context_die
, stmt
);
24182 tree origin
= block_ultimate_origin (stmt
);
24183 if (origin
!= NULL_TREE
&& (origin
!= stmt
|| old_die
))
24184 add_abstract_origin_attribute (stmt_die
, origin
);
24190 stmt_die
= old_die
;
24192 /* A non abstract block whose blocks have already been reordered
24193 should have the instruction range for this block. If so, set the
24194 high/low attributes. */
24195 if (!early_dwarf
&& TREE_ASM_WRITTEN (stmt
))
24197 gcc_assert (stmt_die
);
24198 add_high_low_attributes (stmt
, stmt_die
);
24201 decls_for_scope (stmt
, stmt_die
);
24204 /* Generate a DIE for an inlined subprogram. */
24207 gen_inlined_subroutine_die (tree stmt
, dw_die_ref context_die
)
24209 tree decl
= block_ultimate_origin (stmt
);
24211 /* Make sure any inlined functions are known to be inlineable. */
24212 gcc_checking_assert (DECL_ABSTRACT_P (decl
)
24213 || cgraph_function_possibly_inlined_p (decl
));
24215 dw_die_ref subr_die
= new_die (DW_TAG_inlined_subroutine
, context_die
, stmt
);
24217 if (call_arg_locations
|| debug_inline_points
)
24218 equate_block_to_die (stmt
, subr_die
);
24219 add_abstract_origin_attribute (subr_die
, decl
);
24220 if (TREE_ASM_WRITTEN (stmt
))
24221 add_high_low_attributes (stmt
, subr_die
);
24222 add_call_src_coords_attributes (stmt
, subr_die
);
24224 /* The inliner creates an extra BLOCK for the parameter setup,
24225 we want to merge that with the actual outermost BLOCK of the
24226 inlined function to avoid duplicate locals in consumers.
24227 Do that by doing the recursion to subblocks on the single subblock
24229 bool unwrap_one
= false;
24230 if (BLOCK_SUBBLOCKS (stmt
) && !BLOCK_CHAIN (BLOCK_SUBBLOCKS (stmt
)))
24232 tree origin
= block_ultimate_origin (BLOCK_SUBBLOCKS (stmt
));
24234 && TREE_CODE (origin
) == BLOCK
24235 && BLOCK_SUPERCONTEXT (origin
) == decl
)
24238 decls_for_scope (stmt
, subr_die
, !unwrap_one
);
24240 decls_for_scope (BLOCK_SUBBLOCKS (stmt
), subr_die
);
24243 /* Generate a DIE for a field in a record, or structure. CTX is required: see
24244 the comment for VLR_CONTEXT. */
24247 gen_field_die (tree decl
, struct vlr_context
*ctx
, dw_die_ref context_die
)
24249 dw_die_ref decl_die
;
24251 if (TREE_TYPE (decl
) == error_mark_node
)
24254 decl_die
= new_die (DW_TAG_member
, context_die
, decl
);
24255 add_name_and_src_coords_attributes (decl_die
, decl
);
24256 add_type_attribute (decl_die
, member_declared_type (decl
), decl_quals (decl
),
24257 TYPE_REVERSE_STORAGE_ORDER (DECL_FIELD_CONTEXT (decl
)),
24260 if (DECL_BIT_FIELD_TYPE (decl
))
24262 add_byte_size_attribute (decl_die
, decl
);
24263 add_bit_size_attribute (decl_die
, decl
);
24264 add_bit_offset_attribute (decl_die
, decl
, ctx
);
24267 add_alignment_attribute (decl_die
, decl
);
24269 /* If we have a variant part offset, then we are supposed to process a member
24270 of a QUAL_UNION_TYPE, which is how we represent variant parts in
24272 gcc_assert (ctx
->variant_part_offset
== NULL_TREE
24273 || TREE_CODE (DECL_FIELD_CONTEXT (decl
)) != QUAL_UNION_TYPE
);
24274 if (TREE_CODE (DECL_FIELD_CONTEXT (decl
)) != UNION_TYPE
)
24275 add_data_member_location_attribute (decl_die
, decl
, ctx
);
24277 if (DECL_ARTIFICIAL (decl
))
24278 add_AT_flag (decl_die
, DW_AT_artificial
, 1);
24280 add_accessibility_attribute (decl_die
, decl
);
24282 /* Equate decl number to die, so that we can look up this decl later on. */
24283 equate_decl_number_to_die (decl
, decl_die
);
24286 /* Generate a DIE for a pointer to a member type. TYPE can be an
24287 OFFSET_TYPE, for a pointer to data member, or a RECORD_TYPE, for a
24288 pointer to member function. */
24291 gen_ptr_to_mbr_type_die (tree type
, dw_die_ref context_die
)
24293 if (lookup_type_die (type
))
24296 dw_die_ref ptr_die
= new_die (DW_TAG_ptr_to_member_type
,
24297 scope_die_for (type
, context_die
), type
);
24299 equate_type_number_to_die (type
, ptr_die
);
24300 add_AT_die_ref (ptr_die
, DW_AT_containing_type
,
24301 lookup_type_die (TYPE_OFFSET_BASETYPE (type
)));
24302 add_type_attribute (ptr_die
, TREE_TYPE (type
), TYPE_UNQUALIFIED
, false,
24304 add_alignment_attribute (ptr_die
, type
);
24306 if (TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
24307 && TREE_CODE (TREE_TYPE (type
)) != METHOD_TYPE
)
24309 dw_loc_descr_ref op
= new_loc_descr (DW_OP_plus
, 0, 0);
24310 add_AT_loc (ptr_die
, DW_AT_use_location
, op
);
24314 static char *producer_string
;
24316 /* Return a heap allocated producer string including command line options
24317 if -grecord-gcc-switches. */
24320 gen_producer_string (void)
24323 auto_vec
<const char *> switches
;
24324 const char *language_string
= lang_hooks
.name
;
24325 char *producer
, *tail
;
24327 size_t len
= dwarf_record_gcc_switches
? 0 : 3;
24328 size_t plen
= strlen (language_string
) + 1 + strlen (version_string
);
24330 for (j
= 1; dwarf_record_gcc_switches
&& j
< save_decoded_options_count
; j
++)
24331 switch (save_decoded_options
[j
].opt_index
)
24338 case OPT_auxbase_strip
:
24347 case OPT_SPECIAL_unknown
:
24348 case OPT_SPECIAL_ignore
:
24349 case OPT_SPECIAL_warn_removed
:
24350 case OPT_SPECIAL_program_name
:
24351 case OPT_SPECIAL_input_file
:
24352 case OPT_grecord_gcc_switches
:
24353 case OPT__output_pch_
:
24354 case OPT_fdiagnostics_show_location_
:
24355 case OPT_fdiagnostics_show_option
:
24356 case OPT_fdiagnostics_show_caret
:
24357 case OPT_fdiagnostics_show_labels
:
24358 case OPT_fdiagnostics_show_line_numbers
:
24359 case OPT_fdiagnostics_color_
:
24360 case OPT_fdiagnostics_format_
:
24361 case OPT_fverbose_asm
:
24363 case OPT__sysroot_
:
24365 case OPT_nostdinc__
:
24366 case OPT_fpreprocessed
:
24367 case OPT_fltrans_output_list_
:
24368 case OPT_fresolution_
:
24369 case OPT_fdebug_prefix_map_
:
24370 case OPT_fmacro_prefix_map_
:
24371 case OPT_ffile_prefix_map_
:
24372 case OPT_fcompare_debug
:
24373 case OPT_fchecking
:
24374 case OPT_fchecking_
:
24375 /* Ignore these. */
24379 const char *lto_canonical
= "-flto";
24380 switches
.safe_push (lto_canonical
);
24381 len
+= strlen (lto_canonical
) + 1;
24385 if (cl_options
[save_decoded_options
[j
].opt_index
].flags
24386 & CL_NO_DWARF_RECORD
)
24388 gcc_checking_assert (save_decoded_options
[j
].canonical_option
[0][0]
24390 switch (save_decoded_options
[j
].canonical_option
[0][1])
24397 if (strncmp (save_decoded_options
[j
].canonical_option
[0] + 2,
24404 switches
.safe_push (save_decoded_options
[j
].orig_option_with_args_text
);
24405 len
+= strlen (save_decoded_options
[j
].orig_option_with_args_text
) + 1;
24409 producer
= XNEWVEC (char, plen
+ 1 + len
+ 1);
24411 sprintf (tail
, "%s %s", language_string
, version_string
);
24414 FOR_EACH_VEC_ELT (switches
, j
, p
)
24418 memcpy (tail
+ 1, p
, len
);
24426 /* Given a C and/or C++ language/version string return the "highest".
24427 C++ is assumed to be "higher" than C in this case. Used for merging
24428 LTO translation unit languages. */
24429 static const char *
24430 highest_c_language (const char *lang1
, const char *lang2
)
24432 if (strcmp ("GNU C++17", lang1
) == 0 || strcmp ("GNU C++17", lang2
) == 0)
24433 return "GNU C++17";
24434 if (strcmp ("GNU C++14", lang1
) == 0 || strcmp ("GNU C++14", lang2
) == 0)
24435 return "GNU C++14";
24436 if (strcmp ("GNU C++11", lang1
) == 0 || strcmp ("GNU C++11", lang2
) == 0)
24437 return "GNU C++11";
24438 if (strcmp ("GNU C++98", lang1
) == 0 || strcmp ("GNU C++98", lang2
) == 0)
24439 return "GNU C++98";
24441 if (strcmp ("GNU C2X", lang1
) == 0 || strcmp ("GNU C2X", lang2
) == 0)
24443 if (strcmp ("GNU C17", lang1
) == 0 || strcmp ("GNU C17", lang2
) == 0)
24445 if (strcmp ("GNU C11", lang1
) == 0 || strcmp ("GNU C11", lang2
) == 0)
24447 if (strcmp ("GNU C99", lang1
) == 0 || strcmp ("GNU C99", lang2
) == 0)
24449 if (strcmp ("GNU C89", lang1
) == 0 || strcmp ("GNU C89", lang2
) == 0)
24452 gcc_unreachable ();
24456 /* Generate the DIE for the compilation unit. */
24459 gen_compile_unit_die (const char *filename
)
24462 const char *language_string
= lang_hooks
.name
;
24465 die
= new_die (DW_TAG_compile_unit
, NULL
, NULL
);
24469 add_name_attribute (die
, filename
);
24470 /* Don't add cwd for <built-in>. */
24471 if (filename
[0] != '<')
24472 add_comp_dir_attribute (die
);
24475 add_AT_string (die
, DW_AT_producer
, producer_string
? producer_string
: "");
24477 /* If our producer is LTO try to figure out a common language to use
24478 from the global list of translation units. */
24479 if (strcmp (language_string
, "GNU GIMPLE") == 0)
24483 const char *common_lang
= NULL
;
24485 FOR_EACH_VEC_SAFE_ELT (all_translation_units
, i
, t
)
24487 if (!TRANSLATION_UNIT_LANGUAGE (t
))
24490 common_lang
= TRANSLATION_UNIT_LANGUAGE (t
);
24491 else if (strcmp (common_lang
, TRANSLATION_UNIT_LANGUAGE (t
)) == 0)
24493 else if (strncmp (common_lang
, "GNU C", 5) == 0
24494 && strncmp (TRANSLATION_UNIT_LANGUAGE (t
), "GNU C", 5) == 0)
24495 /* Mixing C and C++ is ok, use C++ in that case. */
24496 common_lang
= highest_c_language (common_lang
,
24497 TRANSLATION_UNIT_LANGUAGE (t
));
24500 /* Fall back to C. */
24501 common_lang
= NULL
;
24507 language_string
= common_lang
;
24510 language
= DW_LANG_C
;
24511 if (strncmp (language_string
, "GNU C", 5) == 0
24512 && ISDIGIT (language_string
[5]))
24514 language
= DW_LANG_C89
;
24515 if (dwarf_version
>= 3 || !dwarf_strict
)
24517 if (strcmp (language_string
, "GNU C89") != 0)
24518 language
= DW_LANG_C99
;
24520 if (dwarf_version
>= 5 /* || !dwarf_strict */)
24521 if (strcmp (language_string
, "GNU C11") == 0
24522 || strcmp (language_string
, "GNU C17") == 0
24523 || strcmp (language_string
, "GNU C2X"))
24524 language
= DW_LANG_C11
;
24527 else if (strncmp (language_string
, "GNU C++", 7) == 0)
24529 language
= DW_LANG_C_plus_plus
;
24530 if (dwarf_version
>= 5 /* || !dwarf_strict */)
24532 if (strcmp (language_string
, "GNU C++11") == 0)
24533 language
= DW_LANG_C_plus_plus_11
;
24534 else if (strcmp (language_string
, "GNU C++14") == 0)
24535 language
= DW_LANG_C_plus_plus_14
;
24536 else if (strcmp (language_string
, "GNU C++17") == 0)
24538 language
= DW_LANG_C_plus_plus_14
;
24541 else if (strcmp (language_string
, "GNU F77") == 0)
24542 language
= DW_LANG_Fortran77
;
24543 else if (dwarf_version
>= 3 || !dwarf_strict
)
24545 if (strcmp (language_string
, "GNU Ada") == 0)
24546 language
= DW_LANG_Ada95
;
24547 else if (strncmp (language_string
, "GNU Fortran", 11) == 0)
24549 language
= DW_LANG_Fortran95
;
24550 if (dwarf_version
>= 5 /* || !dwarf_strict */)
24552 if (strcmp (language_string
, "GNU Fortran2003") == 0)
24553 language
= DW_LANG_Fortran03
;
24554 else if (strcmp (language_string
, "GNU Fortran2008") == 0)
24555 language
= DW_LANG_Fortran08
;
24558 else if (strcmp (language_string
, "GNU Objective-C") == 0)
24559 language
= DW_LANG_ObjC
;
24560 else if (strcmp (language_string
, "GNU Objective-C++") == 0)
24561 language
= DW_LANG_ObjC_plus_plus
;
24562 else if (strcmp (language_string
, "GNU D") == 0)
24563 language
= DW_LANG_D
;
24564 else if (dwarf_version
>= 5 || !dwarf_strict
)
24566 if (strcmp (language_string
, "GNU Go") == 0)
24567 language
= DW_LANG_Go
;
24570 /* Use a degraded Fortran setting in strict DWARF2 so is_fortran works. */
24571 else if (strncmp (language_string
, "GNU Fortran", 11) == 0)
24572 language
= DW_LANG_Fortran90
;
24573 /* Likewise for Ada. */
24574 else if (strcmp (language_string
, "GNU Ada") == 0)
24575 language
= DW_LANG_Ada83
;
24577 add_AT_unsigned (die
, DW_AT_language
, language
);
24581 case DW_LANG_Fortran77
:
24582 case DW_LANG_Fortran90
:
24583 case DW_LANG_Fortran95
:
24584 case DW_LANG_Fortran03
:
24585 case DW_LANG_Fortran08
:
24586 /* Fortran has case insensitive identifiers and the front-end
24587 lowercases everything. */
24588 add_AT_unsigned (die
, DW_AT_identifier_case
, DW_ID_down_case
);
24591 /* The default DW_ID_case_sensitive doesn't need to be specified. */
24597 /* Generate the DIE for a base class. */
24600 gen_inheritance_die (tree binfo
, tree access
, tree type
,
24601 dw_die_ref context_die
)
24603 dw_die_ref die
= new_die (DW_TAG_inheritance
, context_die
, binfo
);
24604 struct vlr_context ctx
= { type
, NULL
};
24606 add_type_attribute (die
, BINFO_TYPE (binfo
), TYPE_UNQUALIFIED
, false,
24608 add_data_member_location_attribute (die
, binfo
, &ctx
);
24610 if (BINFO_VIRTUAL_P (binfo
))
24611 add_AT_unsigned (die
, DW_AT_virtuality
, DW_VIRTUALITY_virtual
);
24613 /* In DWARF3+ the default is DW_ACCESS_private only in DW_TAG_class_type
24614 children, otherwise the default is DW_ACCESS_public. In DWARF2
24615 the default has always been DW_ACCESS_private. */
24616 if (access
== access_public_node
)
24618 if (dwarf_version
== 2
24619 || context_die
->die_tag
== DW_TAG_class_type
)
24620 add_AT_unsigned (die
, DW_AT_accessibility
, DW_ACCESS_public
);
24622 else if (access
== access_protected_node
)
24623 add_AT_unsigned (die
, DW_AT_accessibility
, DW_ACCESS_protected
);
24624 else if (dwarf_version
> 2
24625 && context_die
->die_tag
!= DW_TAG_class_type
)
24626 add_AT_unsigned (die
, DW_AT_accessibility
, DW_ACCESS_private
);
24629 /* Return whether DECL is a FIELD_DECL that represents the variant part of a
24633 is_variant_part (tree decl
)
24635 return (TREE_CODE (decl
) == FIELD_DECL
24636 && TREE_CODE (TREE_TYPE (decl
)) == QUAL_UNION_TYPE
);
24639 /* Check that OPERAND is a reference to a field in STRUCT_TYPE. If it is,
24640 return the FIELD_DECL. Return NULL_TREE otherwise. */
24643 analyze_discr_in_predicate (tree operand
, tree struct_type
)
24645 while (CONVERT_EXPR_P (operand
))
24646 operand
= TREE_OPERAND (operand
, 0);
24648 /* Match field access to members of struct_type only. */
24649 if (TREE_CODE (operand
) == COMPONENT_REF
24650 && TREE_CODE (TREE_OPERAND (operand
, 0)) == PLACEHOLDER_EXPR
24651 && TREE_TYPE (TREE_OPERAND (operand
, 0)) == struct_type
24652 && TREE_CODE (TREE_OPERAND (operand
, 1)) == FIELD_DECL
)
24653 return TREE_OPERAND (operand
, 1);
24658 /* Check that SRC is a constant integer that can be represented as a native
24659 integer constant (either signed or unsigned). If so, store it into DEST and
24660 return true. Return false otherwise. */
24663 get_discr_value (tree src
, dw_discr_value
*dest
)
24665 tree discr_type
= TREE_TYPE (src
);
24667 if (lang_hooks
.types
.get_debug_type
)
24669 tree debug_type
= lang_hooks
.types
.get_debug_type (discr_type
);
24670 if (debug_type
!= NULL
)
24671 discr_type
= debug_type
;
24674 if (TREE_CODE (src
) != INTEGER_CST
|| !INTEGRAL_TYPE_P (discr_type
))
24677 /* Signedness can vary between the original type and the debug type. This
24678 can happen for character types in Ada for instance: the character type
24679 used for code generation can be signed, to be compatible with the C one,
24680 but from a debugger point of view, it must be unsigned. */
24681 bool is_orig_unsigned
= TYPE_UNSIGNED (TREE_TYPE (src
));
24682 bool is_debug_unsigned
= TYPE_UNSIGNED (discr_type
);
24684 if (is_orig_unsigned
!= is_debug_unsigned
)
24685 src
= fold_convert (discr_type
, src
);
24687 if (!(is_debug_unsigned
? tree_fits_uhwi_p (src
) : tree_fits_shwi_p (src
)))
24690 dest
->pos
= is_debug_unsigned
;
24691 if (is_debug_unsigned
)
24692 dest
->v
.uval
= tree_to_uhwi (src
);
24694 dest
->v
.sval
= tree_to_shwi (src
);
24699 /* Try to extract synthetic properties out of VARIANT_PART_DECL, which is a
24700 FIELD_DECL in STRUCT_TYPE that represents a variant part. If unsuccessful,
24701 store NULL_TREE in DISCR_DECL. Otherwise:
24703 - store the discriminant field in STRUCT_TYPE that controls the variant
24704 part to *DISCR_DECL
24706 - put in *DISCR_LISTS_P an array where for each variant, the item
24707 represents the corresponding matching list of discriminant values.
24709 - put in *DISCR_LISTS_LENGTH the number of variants, which is the size of
24712 Note that when the array is allocated (i.e. when the analysis is
24713 successful), it is up to the caller to free the array. */
24716 analyze_variants_discr (tree variant_part_decl
,
24719 dw_discr_list_ref
**discr_lists_p
,
24720 unsigned *discr_lists_length
)
24722 tree variant_part_type
= TREE_TYPE (variant_part_decl
);
24724 dw_discr_list_ref
*discr_lists
;
24727 /* Compute how many variants there are in this variant part. */
24728 *discr_lists_length
= 0;
24729 for (variant
= TYPE_FIELDS (variant_part_type
);
24730 variant
!= NULL_TREE
;
24731 variant
= DECL_CHAIN (variant
))
24732 ++*discr_lists_length
;
24734 *discr_decl
= NULL_TREE
;
24736 = (dw_discr_list_ref
*) xcalloc (*discr_lists_length
,
24737 sizeof (**discr_lists_p
));
24738 discr_lists
= *discr_lists_p
;
24740 /* And then analyze all variants to extract discriminant information for all
24741 of them. This analysis is conservative: as soon as we detect something we
24742 do not support, abort everything and pretend we found nothing. */
24743 for (variant
= TYPE_FIELDS (variant_part_type
), i
= 0;
24744 variant
!= NULL_TREE
;
24745 variant
= DECL_CHAIN (variant
), ++i
)
24747 tree match_expr
= DECL_QUALIFIER (variant
);
24749 /* Now, try to analyze the predicate and deduce a discriminant for
24751 if (match_expr
== boolean_true_node
)
24752 /* Typically happens for the default variant: it matches all cases that
24753 previous variants rejected. Don't output any matching value for
24757 /* The following loop tries to iterate over each discriminant
24758 possibility: single values or ranges. */
24759 while (match_expr
!= NULL_TREE
)
24761 tree next_round_match_expr
;
24762 tree candidate_discr
= NULL_TREE
;
24763 dw_discr_list_ref new_node
= NULL
;
24765 /* Possibilities are matched one after the other by nested
24766 TRUTH_ORIF_EXPR expressions. Process the current possibility and
24767 continue with the rest at next iteration. */
24768 if (TREE_CODE (match_expr
) == TRUTH_ORIF_EXPR
)
24770 next_round_match_expr
= TREE_OPERAND (match_expr
, 0);
24771 match_expr
= TREE_OPERAND (match_expr
, 1);
24774 next_round_match_expr
= NULL_TREE
;
24776 if (match_expr
== boolean_false_node
)
24777 /* This sub-expression matches nothing: just wait for the next
24781 else if (TREE_CODE (match_expr
) == EQ_EXPR
)
24783 /* We are matching: <discr_field> == <integer_cst>
24784 This sub-expression matches a single value. */
24785 tree integer_cst
= TREE_OPERAND (match_expr
, 1);
24788 = analyze_discr_in_predicate (TREE_OPERAND (match_expr
, 0),
24791 new_node
= ggc_cleared_alloc
<dw_discr_list_node
> ();
24792 if (!get_discr_value (integer_cst
,
24793 &new_node
->dw_discr_lower_bound
))
24795 new_node
->dw_discr_range
= false;
24798 else if (TREE_CODE (match_expr
) == TRUTH_ANDIF_EXPR
)
24800 /* We are matching:
24801 <discr_field> > <integer_cst>
24802 && <discr_field> < <integer_cst>.
24803 This sub-expression matches the range of values between the
24804 two matched integer constants. Note that comparisons can be
24805 inclusive or exclusive. */
24806 tree candidate_discr_1
, candidate_discr_2
;
24807 tree lower_cst
, upper_cst
;
24808 bool lower_cst_included
, upper_cst_included
;
24809 tree lower_op
= TREE_OPERAND (match_expr
, 0);
24810 tree upper_op
= TREE_OPERAND (match_expr
, 1);
24812 /* When the comparison is exclusive, the integer constant is not
24813 the discriminant range bound we are looking for: we will have
24814 to increment or decrement it. */
24815 if (TREE_CODE (lower_op
) == GE_EXPR
)
24816 lower_cst_included
= true;
24817 else if (TREE_CODE (lower_op
) == GT_EXPR
)
24818 lower_cst_included
= false;
24822 if (TREE_CODE (upper_op
) == LE_EXPR
)
24823 upper_cst_included
= true;
24824 else if (TREE_CODE (upper_op
) == LT_EXPR
)
24825 upper_cst_included
= false;
24829 /* Extract the discriminant from the first operand and check it
24830 is consistant with the same analysis in the second
24833 = analyze_discr_in_predicate (TREE_OPERAND (lower_op
, 0),
24836 = analyze_discr_in_predicate (TREE_OPERAND (upper_op
, 0),
24838 if (candidate_discr_1
== candidate_discr_2
)
24839 candidate_discr
= candidate_discr_1
;
24843 /* Extract bounds from both. */
24844 new_node
= ggc_cleared_alloc
<dw_discr_list_node
> ();
24845 lower_cst
= TREE_OPERAND (lower_op
, 1);
24846 upper_cst
= TREE_OPERAND (upper_op
, 1);
24848 if (!lower_cst_included
)
24850 = fold_build2 (PLUS_EXPR
, TREE_TYPE (lower_cst
), lower_cst
,
24851 build_int_cst (TREE_TYPE (lower_cst
), 1));
24852 if (!upper_cst_included
)
24854 = fold_build2 (MINUS_EXPR
, TREE_TYPE (upper_cst
), upper_cst
,
24855 build_int_cst (TREE_TYPE (upper_cst
), 1));
24857 if (!get_discr_value (lower_cst
,
24858 &new_node
->dw_discr_lower_bound
)
24859 || !get_discr_value (upper_cst
,
24860 &new_node
->dw_discr_upper_bound
))
24863 new_node
->dw_discr_range
= true;
24866 else if ((candidate_discr
24867 = analyze_discr_in_predicate (match_expr
, struct_type
))
24868 && TREE_TYPE (candidate_discr
) == boolean_type_node
)
24870 /* We are matching: <discr_field> for a boolean discriminant.
24871 This sub-expression matches boolean_true_node. */
24872 new_node
= ggc_cleared_alloc
<dw_discr_list_node
> ();
24873 if (!get_discr_value (boolean_true_node
,
24874 &new_node
->dw_discr_lower_bound
))
24876 new_node
->dw_discr_range
= false;
24880 /* Unsupported sub-expression: we cannot determine the set of
24881 matching discriminant values. Abort everything. */
24884 /* If the discriminant info is not consistant with what we saw so
24885 far, consider the analysis failed and abort everything. */
24886 if (candidate_discr
== NULL_TREE
24887 || (*discr_decl
!= NULL_TREE
&& candidate_discr
!= *discr_decl
))
24890 *discr_decl
= candidate_discr
;
24892 if (new_node
!= NULL
)
24894 new_node
->dw_discr_next
= discr_lists
[i
];
24895 discr_lists
[i
] = new_node
;
24897 match_expr
= next_round_match_expr
;
24901 /* If we reach this point, we could match everything we were interested
24906 /* Clean all data structure and return no result. */
24907 free (*discr_lists_p
);
24908 *discr_lists_p
= NULL
;
24909 *discr_decl
= NULL_TREE
;
24912 /* Generate a DIE to represent VARIANT_PART_DECL, a variant part that is part
24913 of STRUCT_TYPE, a record type. This new DIE is emitted as the next child
24916 Variant parts are supposed to be implemented as a FIELD_DECL whose type is a
24917 QUAL_UNION_TYPE: this is the VARIANT_PART_DECL parameter. The members for
24918 this type, which are record types, represent the available variants and each
24919 has a DECL_QUALIFIER attribute. The discriminant and the discriminant
24920 values are inferred from these attributes.
24922 In trees, the offsets for the fields inside these sub-records are relative
24923 to the variant part itself, whereas the corresponding DIEs should have
24924 offset attributes that are relative to the embedding record base address.
24925 This is why the caller must provide a VARIANT_PART_OFFSET expression: it
24926 must be an expression that computes the offset of the variant part to
24927 describe in DWARF. */
24930 gen_variant_part (tree variant_part_decl
, struct vlr_context
*vlr_ctx
,
24931 dw_die_ref context_die
)
24933 const tree variant_part_type
= TREE_TYPE (variant_part_decl
);
24934 tree variant_part_offset
= vlr_ctx
->variant_part_offset
;
24935 struct loc_descr_context ctx
= {
24936 vlr_ctx
->struct_type
, /* context_type */
24937 NULL_TREE
, /* base_decl */
24939 false, /* placeholder_arg */
24940 false /* placeholder_seen */
24943 /* The FIELD_DECL node in STRUCT_TYPE that acts as the discriminant, or
24944 NULL_TREE if there is no such field. */
24945 tree discr_decl
= NULL_TREE
;
24946 dw_discr_list_ref
*discr_lists
;
24947 unsigned discr_lists_length
= 0;
24950 dw_die_ref dwarf_proc_die
= NULL
;
24951 dw_die_ref variant_part_die
24952 = new_die (DW_TAG_variant_part
, context_die
, variant_part_type
);
24954 equate_decl_number_to_die (variant_part_decl
, variant_part_die
);
24956 analyze_variants_discr (variant_part_decl
, vlr_ctx
->struct_type
,
24957 &discr_decl
, &discr_lists
, &discr_lists_length
);
24959 if (discr_decl
!= NULL_TREE
)
24961 dw_die_ref discr_die
= lookup_decl_die (discr_decl
);
24964 add_AT_die_ref (variant_part_die
, DW_AT_discr
, discr_die
);
24966 /* We have no DIE for the discriminant, so just discard all
24967 discrimimant information in the output. */
24968 discr_decl
= NULL_TREE
;
24971 /* If the offset for this variant part is more complex than a constant,
24972 create a DWARF procedure for it so that we will not have to generate DWARF
24973 expressions for it for each member. */
24974 if (TREE_CODE (variant_part_offset
) != INTEGER_CST
24975 && (dwarf_version
>= 3 || !dwarf_strict
))
24977 const tree dwarf_proc_fndecl
24978 = build_decl (UNKNOWN_LOCATION
, FUNCTION_DECL
, NULL_TREE
,
24979 build_function_type (TREE_TYPE (variant_part_offset
),
24981 const tree dwarf_proc_call
= build_call_expr (dwarf_proc_fndecl
, 0);
24982 const dw_loc_descr_ref dwarf_proc_body
24983 = loc_descriptor_from_tree (variant_part_offset
, 0, &ctx
);
24985 dwarf_proc_die
= new_dwarf_proc_die (dwarf_proc_body
,
24986 dwarf_proc_fndecl
, context_die
);
24987 if (dwarf_proc_die
!= NULL
)
24988 variant_part_offset
= dwarf_proc_call
;
24991 /* Output DIEs for all variants. */
24993 for (tree variant
= TYPE_FIELDS (variant_part_type
);
24994 variant
!= NULL_TREE
;
24995 variant
= DECL_CHAIN (variant
), ++i
)
24997 tree variant_type
= TREE_TYPE (variant
);
24998 dw_die_ref variant_die
;
25000 /* All variants (i.e. members of a variant part) are supposed to be
25001 encoded as structures. Sub-variant parts are QUAL_UNION_TYPE fields
25002 under these records. */
25003 gcc_assert (TREE_CODE (variant_type
) == RECORD_TYPE
);
25005 variant_die
= new_die (DW_TAG_variant
, variant_part_die
, variant_type
);
25006 equate_decl_number_to_die (variant
, variant_die
);
25008 /* Output discriminant values this variant matches, if any. */
25009 if (discr_decl
== NULL
|| discr_lists
[i
] == NULL
)
25010 /* In the case we have discriminant information at all, this is
25011 probably the default variant: as the standard says, don't
25012 output any discriminant value/list attribute. */
25014 else if (discr_lists
[i
]->dw_discr_next
== NULL
25015 && !discr_lists
[i
]->dw_discr_range
)
25016 /* If there is only one accepted value, don't bother outputting a
25018 add_discr_value (variant_die
, &discr_lists
[i
]->dw_discr_lower_bound
);
25020 add_discr_list (variant_die
, discr_lists
[i
]);
25022 for (tree member
= TYPE_FIELDS (variant_type
);
25023 member
!= NULL_TREE
;
25024 member
= DECL_CHAIN (member
))
25026 struct vlr_context vlr_sub_ctx
= {
25027 vlr_ctx
->struct_type
, /* struct_type */
25028 NULL
/* variant_part_offset */
25030 if (is_variant_part (member
))
25032 /* All offsets for fields inside variant parts are relative to
25033 the top-level embedding RECORD_TYPE's base address. On the
25034 other hand, offsets in GCC's types are relative to the
25035 nested-most variant part. So we have to sum offsets each time
25038 vlr_sub_ctx
.variant_part_offset
25039 = fold_build2 (PLUS_EXPR
, TREE_TYPE (variant_part_offset
),
25040 variant_part_offset
, byte_position (member
));
25041 gen_variant_part (member
, &vlr_sub_ctx
, variant_die
);
25045 vlr_sub_ctx
.variant_part_offset
= variant_part_offset
;
25046 gen_decl_die (member
, NULL
, &vlr_sub_ctx
, variant_die
);
25051 free (discr_lists
);
25054 /* Generate a DIE for a class member. */
25057 gen_member_die (tree type
, dw_die_ref context_die
)
25060 tree binfo
= TYPE_BINFO (type
);
25062 gcc_assert (TYPE_MAIN_VARIANT (type
) == type
);
25064 /* If this is not an incomplete type, output descriptions of each of its
25065 members. Note that as we output the DIEs necessary to represent the
25066 members of this record or union type, we will also be trying to output
25067 DIEs to represent the *types* of those members. However the `type'
25068 function (above) will specifically avoid generating type DIEs for member
25069 types *within* the list of member DIEs for this (containing) type except
25070 for those types (of members) which are explicitly marked as also being
25071 members of this (containing) type themselves. The g++ front- end can
25072 force any given type to be treated as a member of some other (containing)
25073 type by setting the TYPE_CONTEXT of the given (member) type to point to
25074 the TREE node representing the appropriate (containing) type. */
25076 /* First output info about the base classes. */
25077 if (binfo
&& early_dwarf
)
25079 vec
<tree
, va_gc
> *accesses
= BINFO_BASE_ACCESSES (binfo
);
25083 for (i
= 0; BINFO_BASE_ITERATE (binfo
, i
, base
); i
++)
25084 gen_inheritance_die (base
,
25085 (accesses
? (*accesses
)[i
] : access_public_node
),
25090 /* Now output info about the members. */
25091 for (member
= TYPE_FIELDS (type
); member
; member
= DECL_CHAIN (member
))
25093 /* Ignore clones. */
25094 if (DECL_ABSTRACT_ORIGIN (member
))
25097 struct vlr_context vlr_ctx
= { type
, NULL_TREE
};
25098 bool static_inline_p
25100 && TREE_STATIC (member
)
25101 && (lang_hooks
.decls
.decl_dwarf_attribute (member
, DW_AT_inline
)
25104 /* If we thought we were generating minimal debug info for TYPE
25105 and then changed our minds, some of the member declarations
25106 may have already been defined. Don't define them again, but
25107 do put them in the right order. */
25109 if (dw_die_ref child
= lookup_decl_die (member
))
25111 /* Handle inline static data members, which only have in-class
25113 bool splice
= true;
25115 dw_die_ref ref
= NULL
;
25116 if (child
->die_tag
== DW_TAG_variable
25117 && child
->die_parent
== comp_unit_die ())
25119 ref
= get_AT_ref (child
, DW_AT_specification
);
25121 /* For C++17 inline static data members followed by redundant
25122 out of class redeclaration, we might get here with
25123 child being the DIE created for the out of class
25124 redeclaration and with its DW_AT_specification being
25125 the DIE created for in-class definition. We want to
25126 reparent the latter, and don't want to create another
25127 DIE with DW_AT_specification in that case, because
25128 we already have one. */
25131 && ref
->die_tag
== DW_TAG_variable
25132 && ref
->die_parent
== comp_unit_die ()
25133 && get_AT (ref
, DW_AT_specification
) == NULL
)
25137 static_inline_p
= false;
25142 reparent_child (child
, context_die
);
25143 if (dwarf_version
< 5)
25144 child
->die_tag
= DW_TAG_member
;
25150 splice_child_die (context_die
, child
);
25153 /* Do not generate standard DWARF for variant parts if we are generating
25154 the corresponding GNAT encodings: DIEs generated for both would
25155 conflict in our mappings. */
25156 else if (is_variant_part (member
)
25157 && gnat_encodings
== DWARF_GNAT_ENCODINGS_MINIMAL
)
25159 vlr_ctx
.variant_part_offset
= byte_position (member
);
25160 gen_variant_part (member
, &vlr_ctx
, context_die
);
25164 vlr_ctx
.variant_part_offset
= NULL_TREE
;
25165 gen_decl_die (member
, NULL
, &vlr_ctx
, context_die
);
25168 /* For C++ inline static data members emit immediately a DW_TAG_variable
25169 DIE that will refer to that DW_TAG_member/DW_TAG_variable through
25170 DW_AT_specification. */
25171 if (static_inline_p
)
25173 int old_extern
= DECL_EXTERNAL (member
);
25174 DECL_EXTERNAL (member
) = 0;
25175 gen_decl_die (member
, NULL
, NULL
, comp_unit_die ());
25176 DECL_EXTERNAL (member
) = old_extern
;
25181 /* Generate a DIE for a structure or union type. If TYPE_DECL_SUPPRESS_DEBUG
25182 is set, we pretend that the type was never defined, so we only get the
25183 member DIEs needed by later specification DIEs. */
25186 gen_struct_or_union_type_die (tree type
, dw_die_ref context_die
,
25187 enum debug_info_usage usage
)
25189 if (TREE_ASM_WRITTEN (type
))
25191 /* Fill in the bound of variable-length fields in late dwarf if
25192 still incomplete. */
25193 if (!early_dwarf
&& variably_modified_type_p (type
, NULL
))
25194 for (tree member
= TYPE_FIELDS (type
);
25196 member
= DECL_CHAIN (member
))
25197 fill_variable_array_bounds (TREE_TYPE (member
));
25201 dw_die_ref type_die
= lookup_type_die (type
);
25202 dw_die_ref scope_die
= 0;
25204 int complete
= (TYPE_SIZE (type
)
25205 && (! TYPE_STUB_DECL (type
)
25206 || ! TYPE_DECL_SUPPRESS_DEBUG (TYPE_STUB_DECL (type
))));
25207 int ns_decl
= (context_die
&& context_die
->die_tag
== DW_TAG_namespace
);
25208 complete
= complete
&& should_emit_struct_debug (type
, usage
);
25210 if (type_die
&& ! complete
)
25213 if (TYPE_CONTEXT (type
) != NULL_TREE
25214 && (AGGREGATE_TYPE_P (TYPE_CONTEXT (type
))
25215 || TREE_CODE (TYPE_CONTEXT (type
)) == NAMESPACE_DECL
))
25218 scope_die
= scope_die_for (type
, context_die
);
25220 /* Generate child dies for template paramaters. */
25221 if (!type_die
&& debug_info_level
> DINFO_LEVEL_TERSE
)
25222 schedule_generic_params_dies_gen (type
);
25224 if (! type_die
|| (nested
&& is_cu_die (scope_die
)))
25225 /* First occurrence of type or toplevel definition of nested class. */
25227 dw_die_ref old_die
= type_die
;
25229 type_die
= new_die (TREE_CODE (type
) == RECORD_TYPE
25230 ? record_type_tag (type
) : DW_TAG_union_type
,
25232 equate_type_number_to_die (type
, type_die
);
25234 add_AT_specification (type_die
, old_die
);
25236 add_name_attribute (type_die
, type_tag (type
));
25239 remove_AT (type_die
, DW_AT_declaration
);
25241 /* If this type has been completed, then give it a byte_size attribute and
25242 then give a list of members. */
25243 if (complete
&& !ns_decl
)
25245 /* Prevent infinite recursion in cases where the type of some member of
25246 this type is expressed in terms of this type itself. */
25247 TREE_ASM_WRITTEN (type
) = 1;
25248 add_byte_size_attribute (type_die
, type
);
25249 add_alignment_attribute (type_die
, type
);
25250 if (TYPE_STUB_DECL (type
) != NULL_TREE
)
25252 add_src_coords_attributes (type_die
, TYPE_STUB_DECL (type
));
25253 add_accessibility_attribute (type_die
, TYPE_STUB_DECL (type
));
25256 /* If the first reference to this type was as the return type of an
25257 inline function, then it may not have a parent. Fix this now. */
25258 if (type_die
->die_parent
== NULL
)
25259 add_child_die (scope_die
, type_die
);
25261 gen_member_die (type
, type_die
);
25263 add_gnat_descriptive_type_attribute (type_die
, type
, context_die
);
25264 if (TYPE_ARTIFICIAL (type
))
25265 add_AT_flag (type_die
, DW_AT_artificial
, 1);
25267 /* GNU extension: Record what type our vtable lives in. */
25268 if (TYPE_VFIELD (type
))
25270 tree vtype
= DECL_FCONTEXT (TYPE_VFIELD (type
));
25272 gen_type_die (vtype
, context_die
);
25273 add_AT_die_ref (type_die
, DW_AT_containing_type
,
25274 lookup_type_die (vtype
));
25279 add_AT_flag (type_die
, DW_AT_declaration
, 1);
25281 /* We don't need to do this for function-local types. */
25282 if (TYPE_STUB_DECL (type
)
25283 && ! decl_function_context (TYPE_STUB_DECL (type
)))
25284 vec_safe_push (incomplete_types
, type
);
25287 if (get_AT (type_die
, DW_AT_name
))
25288 add_pubtype (type
, type_die
);
25291 /* Generate a DIE for a subroutine _type_. */
25294 gen_subroutine_type_die (tree type
, dw_die_ref context_die
)
25296 tree return_type
= TREE_TYPE (type
);
25297 dw_die_ref subr_die
25298 = new_die (DW_TAG_subroutine_type
,
25299 scope_die_for (type
, context_die
), type
);
25301 equate_type_number_to_die (type
, subr_die
);
25302 add_prototyped_attribute (subr_die
, type
);
25303 add_type_attribute (subr_die
, return_type
, TYPE_UNQUALIFIED
, false,
25305 add_alignment_attribute (subr_die
, type
);
25306 gen_formal_types_die (type
, subr_die
);
25308 if (get_AT (subr_die
, DW_AT_name
))
25309 add_pubtype (type
, subr_die
);
25310 if ((dwarf_version
>= 5 || !dwarf_strict
)
25311 && lang_hooks
.types
.type_dwarf_attribute (type
, DW_AT_reference
) != -1)
25312 add_AT_flag (subr_die
, DW_AT_reference
, 1);
25313 if ((dwarf_version
>= 5 || !dwarf_strict
)
25314 && lang_hooks
.types
.type_dwarf_attribute (type
,
25315 DW_AT_rvalue_reference
) != -1)
25316 add_AT_flag (subr_die
, DW_AT_rvalue_reference
, 1);
25319 /* Generate a DIE for a type definition. */
25322 gen_typedef_die (tree decl
, dw_die_ref context_die
)
25324 dw_die_ref type_die
;
25327 if (TREE_ASM_WRITTEN (decl
))
25329 if (DECL_ORIGINAL_TYPE (decl
))
25330 fill_variable_array_bounds (DECL_ORIGINAL_TYPE (decl
));
25334 /* As we avoid creating DIEs for local typedefs (see decl_ultimate_origin
25335 checks in process_scope_var and modified_type_die), this should be called
25336 only for original types. */
25337 gcc_assert (decl_ultimate_origin (decl
) == NULL
25338 || decl_ultimate_origin (decl
) == decl
);
25340 TREE_ASM_WRITTEN (decl
) = 1;
25341 type_die
= new_die (DW_TAG_typedef
, context_die
, decl
);
25343 add_name_and_src_coords_attributes (type_die
, decl
);
25344 if (DECL_ORIGINAL_TYPE (decl
))
25346 type
= DECL_ORIGINAL_TYPE (decl
);
25347 if (type
== error_mark_node
)
25350 gcc_assert (type
!= TREE_TYPE (decl
));
25351 equate_type_number_to_die (TREE_TYPE (decl
), type_die
);
25355 type
= TREE_TYPE (decl
);
25356 if (type
== error_mark_node
)
25359 if (is_naming_typedef_decl (TYPE_NAME (type
)))
25361 /* Here, we are in the case of decl being a typedef naming
25362 an anonymous type, e.g:
25363 typedef struct {...} foo;
25364 In that case TREE_TYPE (decl) is not a typedef variant
25365 type and TYPE_NAME of the anonymous type is set to the
25366 TYPE_DECL of the typedef. This construct is emitted by
25369 TYPE is the anonymous struct named by the typedef
25370 DECL. As we need the DW_AT_type attribute of the
25371 DW_TAG_typedef to point to the DIE of TYPE, let's
25372 generate that DIE right away. add_type_attribute
25373 called below will then pick (via lookup_type_die) that
25374 anonymous struct DIE. */
25375 if (!TREE_ASM_WRITTEN (type
))
25376 gen_tagged_type_die (type
, context_die
, DINFO_USAGE_DIR_USE
);
25378 /* This is a GNU Extension. We are adding a
25379 DW_AT_linkage_name attribute to the DIE of the
25380 anonymous struct TYPE. The value of that attribute
25381 is the name of the typedef decl naming the anonymous
25382 struct. This greatly eases the work of consumers of
25383 this debug info. */
25384 add_linkage_name_raw (lookup_type_die (type
), decl
);
25388 add_type_attribute (type_die
, type
, decl_quals (decl
), false,
25391 if (is_naming_typedef_decl (decl
))
25392 /* We want that all subsequent calls to lookup_type_die with
25393 TYPE in argument yield the DW_TAG_typedef we have just
25395 equate_type_number_to_die (type
, type_die
);
25397 add_alignment_attribute (type_die
, TREE_TYPE (decl
));
25399 add_accessibility_attribute (type_die
, decl
);
25401 if (DECL_ABSTRACT_P (decl
))
25402 equate_decl_number_to_die (decl
, type_die
);
25404 if (get_AT (type_die
, DW_AT_name
))
25405 add_pubtype (decl
, type_die
);
25408 /* Generate a DIE for a struct, class, enum or union type. */
25411 gen_tagged_type_die (tree type
,
25412 dw_die_ref context_die
,
25413 enum debug_info_usage usage
)
25415 if (type
== NULL_TREE
25416 || !is_tagged_type (type
))
25419 if (TREE_ASM_WRITTEN (type
))
25421 /* If this is a nested type whose containing class hasn't been written
25422 out yet, writing it out will cover this one, too. This does not apply
25423 to instantiations of member class templates; they need to be added to
25424 the containing class as they are generated. FIXME: This hurts the
25425 idea of combining type decls from multiple TUs, since we can't predict
25426 what set of template instantiations we'll get. */
25427 else if (TYPE_CONTEXT (type
)
25428 && AGGREGATE_TYPE_P (TYPE_CONTEXT (type
))
25429 && ! TREE_ASM_WRITTEN (TYPE_CONTEXT (type
)))
25431 gen_type_die_with_usage (TYPE_CONTEXT (type
), context_die
, usage
);
25433 if (TREE_ASM_WRITTEN (type
))
25436 /* If that failed, attach ourselves to the stub. */
25437 context_die
= lookup_type_die (TYPE_CONTEXT (type
));
25439 else if (TYPE_CONTEXT (type
) != NULL_TREE
25440 && (TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
))
25442 /* If this type is local to a function that hasn't been written
25443 out yet, use a NULL context for now; it will be fixed up in
25444 decls_for_scope. */
25445 context_die
= lookup_decl_die (TYPE_CONTEXT (type
));
25446 /* A declaration DIE doesn't count; nested types need to go in the
25448 if (context_die
&& is_declaration_die (context_die
))
25449 context_die
= NULL
;
25452 context_die
= declare_in_namespace (type
, context_die
);
25454 if (TREE_CODE (type
) == ENUMERAL_TYPE
)
25456 /* This might have been written out by the call to
25457 declare_in_namespace. */
25458 if (!TREE_ASM_WRITTEN (type
))
25459 gen_enumeration_type_die (type
, context_die
);
25462 gen_struct_or_union_type_die (type
, context_die
, usage
);
25464 /* Don't set TREE_ASM_WRITTEN on an incomplete struct; we want to fix
25465 it up if it is ever completed. gen_*_type_die will set it for us
25466 when appropriate. */
25469 /* Generate a type description DIE. */
25472 gen_type_die_with_usage (tree type
, dw_die_ref context_die
,
25473 enum debug_info_usage usage
)
25475 struct array_descr_info info
;
25477 if (type
== NULL_TREE
|| type
== error_mark_node
)
25480 if (flag_checking
&& type
)
25481 verify_type (type
);
25483 if (TYPE_NAME (type
) != NULL_TREE
25484 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
25485 && is_redundant_typedef (TYPE_NAME (type
))
25486 && DECL_ORIGINAL_TYPE (TYPE_NAME (type
)))
25487 /* The DECL of this type is a typedef we don't want to emit debug
25488 info for but we want debug info for its underlying typedef.
25489 This can happen for e.g, the injected-class-name of a C++
25491 type
= DECL_ORIGINAL_TYPE (TYPE_NAME (type
));
25493 /* If TYPE is a typedef type variant, let's generate debug info
25494 for the parent typedef which TYPE is a type of. */
25495 if (typedef_variant_p (type
))
25497 if (TREE_ASM_WRITTEN (type
))
25500 tree name
= TYPE_NAME (type
);
25501 tree origin
= decl_ultimate_origin (name
);
25502 if (origin
!= NULL
&& origin
!= name
)
25504 gen_decl_die (origin
, NULL
, NULL
, context_die
);
25508 /* Prevent broken recursion; we can't hand off to the same type. */
25509 gcc_assert (DECL_ORIGINAL_TYPE (name
) != type
);
25511 /* Give typedefs the right scope. */
25512 context_die
= scope_die_for (type
, context_die
);
25514 TREE_ASM_WRITTEN (type
) = 1;
25516 gen_decl_die (name
, NULL
, NULL
, context_die
);
25520 /* If type is an anonymous tagged type named by a typedef, let's
25521 generate debug info for the typedef. */
25522 if (is_naming_typedef_decl (TYPE_NAME (type
)))
25524 /* Give typedefs the right scope. */
25525 context_die
= scope_die_for (type
, context_die
);
25527 gen_decl_die (TYPE_NAME (type
), NULL
, NULL
, context_die
);
25531 if (lang_hooks
.types
.get_debug_type
)
25533 tree debug_type
= lang_hooks
.types
.get_debug_type (type
);
25535 if (debug_type
!= NULL_TREE
&& debug_type
!= type
)
25537 gen_type_die_with_usage (debug_type
, context_die
, usage
);
25542 /* We are going to output a DIE to represent the unqualified version
25543 of this type (i.e. without any const or volatile qualifiers) so
25544 get the main variant (i.e. the unqualified version) of this type
25545 now. (Vectors and arrays are special because the debugging info is in the
25546 cloned type itself. Similarly function/method types can contain extra
25547 ref-qualification). */
25548 if (TREE_CODE (type
) == FUNCTION_TYPE
25549 || TREE_CODE (type
) == METHOD_TYPE
)
25551 /* For function/method types, can't use type_main_variant here,
25552 because that can have different ref-qualifiers for C++,
25553 but try to canonicalize. */
25554 tree main
= TYPE_MAIN_VARIANT (type
);
25555 for (tree t
= main
; t
; t
= TYPE_NEXT_VARIANT (t
))
25556 if (TYPE_QUALS_NO_ADDR_SPACE (t
) == 0
25557 && check_base_type (t
, main
)
25558 && check_lang_type (t
, type
))
25564 else if (TREE_CODE (type
) != VECTOR_TYPE
25565 && TREE_CODE (type
) != ARRAY_TYPE
)
25566 type
= type_main_variant (type
);
25568 /* If this is an array type with hidden descriptor, handle it first. */
25569 if (!TREE_ASM_WRITTEN (type
)
25570 && lang_hooks
.types
.get_array_descr_info
)
25572 memset (&info
, 0, sizeof (info
));
25573 if (lang_hooks
.types
.get_array_descr_info (type
, &info
))
25575 /* Fortran sometimes emits array types with no dimension. */
25576 gcc_assert (info
.ndimensions
>= 0
25577 && (info
.ndimensions
25578 <= DWARF2OUT_ARRAY_DESCR_INFO_MAX_DIMEN
));
25579 gen_descr_array_type_die (type
, &info
, context_die
);
25580 TREE_ASM_WRITTEN (type
) = 1;
25585 if (TREE_ASM_WRITTEN (type
))
25587 /* Variable-length types may be incomplete even if
25588 TREE_ASM_WRITTEN. For such types, fall through to
25589 gen_array_type_die() and possibly fill in
25590 DW_AT_{upper,lower}_bound attributes. */
25591 if ((TREE_CODE (type
) != ARRAY_TYPE
25592 && TREE_CODE (type
) != RECORD_TYPE
25593 && TREE_CODE (type
) != UNION_TYPE
25594 && TREE_CODE (type
) != QUAL_UNION_TYPE
)
25595 || !variably_modified_type_p (type
, NULL
))
25599 switch (TREE_CODE (type
))
25605 case REFERENCE_TYPE
:
25606 /* We must set TREE_ASM_WRITTEN in case this is a recursive type. This
25607 ensures that the gen_type_die recursion will terminate even if the
25608 type is recursive. Recursive types are possible in Ada. */
25609 /* ??? We could perhaps do this for all types before the switch
25611 TREE_ASM_WRITTEN (type
) = 1;
25613 /* For these types, all that is required is that we output a DIE (or a
25614 set of DIEs) to represent the "basis" type. */
25615 gen_type_die_with_usage (TREE_TYPE (type
), context_die
,
25616 DINFO_USAGE_IND_USE
);
25620 /* This code is used for C++ pointer-to-data-member types.
25621 Output a description of the relevant class type. */
25622 gen_type_die_with_usage (TYPE_OFFSET_BASETYPE (type
), context_die
,
25623 DINFO_USAGE_IND_USE
);
25625 /* Output a description of the type of the object pointed to. */
25626 gen_type_die_with_usage (TREE_TYPE (type
), context_die
,
25627 DINFO_USAGE_IND_USE
);
25629 /* Now output a DIE to represent this pointer-to-data-member type
25631 gen_ptr_to_mbr_type_die (type
, context_die
);
25634 case FUNCTION_TYPE
:
25635 /* Force out return type (in case it wasn't forced out already). */
25636 gen_type_die_with_usage (TREE_TYPE (type
), context_die
,
25637 DINFO_USAGE_DIR_USE
);
25638 gen_subroutine_type_die (type
, context_die
);
25642 /* Force out return type (in case it wasn't forced out already). */
25643 gen_type_die_with_usage (TREE_TYPE (type
), context_die
,
25644 DINFO_USAGE_DIR_USE
);
25645 gen_subroutine_type_die (type
, context_die
);
25650 gen_array_type_die (type
, context_die
);
25653 case ENUMERAL_TYPE
:
25656 case QUAL_UNION_TYPE
:
25657 gen_tagged_type_die (type
, context_die
, usage
);
25663 case FIXED_POINT_TYPE
:
25666 /* No DIEs needed for fundamental types. */
25671 /* Just use DW_TAG_unspecified_type. */
25673 dw_die_ref type_die
= lookup_type_die (type
);
25674 if (type_die
== NULL
)
25676 tree name
= TYPE_IDENTIFIER (type
);
25677 type_die
= new_die (DW_TAG_unspecified_type
, comp_unit_die (),
25679 add_name_attribute (type_die
, IDENTIFIER_POINTER (name
));
25680 equate_type_number_to_die (type
, type_die
);
25686 if (is_cxx_auto (type
))
25688 tree name
= TYPE_IDENTIFIER (type
);
25689 dw_die_ref
*die
= (name
== get_identifier ("auto")
25690 ? &auto_die
: &decltype_auto_die
);
25693 *die
= new_die (DW_TAG_unspecified_type
,
25694 comp_unit_die (), NULL_TREE
);
25695 add_name_attribute (*die
, IDENTIFIER_POINTER (name
));
25697 equate_type_number_to_die (type
, *die
);
25700 gcc_unreachable ();
25703 TREE_ASM_WRITTEN (type
) = 1;
25707 gen_type_die (tree type
, dw_die_ref context_die
)
25709 if (type
!= error_mark_node
)
25711 gen_type_die_with_usage (type
, context_die
, DINFO_USAGE_DIR_USE
);
25714 dw_die_ref die
= lookup_type_die (type
);
25721 /* Generate a DW_TAG_lexical_block DIE followed by DIEs to represent all of the
25722 things which are local to the given block. */
25725 gen_block_die (tree stmt
, dw_die_ref context_die
)
25727 int must_output_die
= 0;
25730 /* Ignore blocks that are NULL. */
25731 if (stmt
== NULL_TREE
)
25734 inlined_func
= inlined_function_outer_scope_p (stmt
);
25736 /* If the block is one fragment of a non-contiguous block, do not
25737 process the variables, since they will have been done by the
25738 origin block. Do process subblocks. */
25739 if (BLOCK_FRAGMENT_ORIGIN (stmt
))
25743 for (sub
= BLOCK_SUBBLOCKS (stmt
); sub
; sub
= BLOCK_CHAIN (sub
))
25744 gen_block_die (sub
, context_die
);
25749 /* Determine if we need to output any Dwarf DIEs at all to represent this
25752 /* The outer scopes for inlinings *must* always be represented. We
25753 generate DW_TAG_inlined_subroutine DIEs for them. (See below.) */
25754 must_output_die
= 1;
25755 else if (lookup_block_die (stmt
))
25756 /* If we already have a DIE then it was filled early. Meanwhile
25757 we might have pruned all BLOCK_VARS as optimized out but we
25758 still want to generate high/low PC attributes so output it. */
25759 must_output_die
= 1;
25760 else if (TREE_USED (stmt
)
25761 || TREE_ASM_WRITTEN (stmt
))
25763 /* Determine if this block directly contains any "significant"
25764 local declarations which we will need to output DIEs for. */
25765 if (debug_info_level
> DINFO_LEVEL_TERSE
)
25767 /* We are not in terse mode so any local declaration that
25768 is not ignored for debug purposes counts as being a
25769 "significant" one. */
25770 if (BLOCK_NUM_NONLOCALIZED_VARS (stmt
))
25771 must_output_die
= 1;
25773 for (tree var
= BLOCK_VARS (stmt
); var
; var
= DECL_CHAIN (var
))
25774 if (!DECL_IGNORED_P (var
))
25776 must_output_die
= 1;
25780 else if (!dwarf2out_ignore_block (stmt
))
25781 must_output_die
= 1;
25784 /* It would be a waste of space to generate a Dwarf DW_TAG_lexical_block
25785 DIE for any block which contains no significant local declarations at
25786 all. Rather, in such cases we just call `decls_for_scope' so that any
25787 needed Dwarf info for any sub-blocks will get properly generated. Note
25788 that in terse mode, our definition of what constitutes a "significant"
25789 local declaration gets restricted to include only inlined function
25790 instances and local (nested) function definitions. */
25791 if (must_output_die
)
25794 gen_inlined_subroutine_die (stmt
, context_die
);
25796 gen_lexical_block_die (stmt
, context_die
);
25799 decls_for_scope (stmt
, context_die
);
25802 /* Process variable DECL (or variable with origin ORIGIN) within
25803 block STMT and add it to CONTEXT_DIE. */
25805 process_scope_var (tree stmt
, tree decl
, tree origin
, dw_die_ref context_die
)
25808 tree decl_or_origin
= decl
? decl
: origin
;
25810 if (TREE_CODE (decl_or_origin
) == FUNCTION_DECL
)
25811 die
= lookup_decl_die (decl_or_origin
);
25812 else if (TREE_CODE (decl_or_origin
) == TYPE_DECL
)
25814 if (TYPE_DECL_IS_STUB (decl_or_origin
))
25815 die
= lookup_type_die (TREE_TYPE (decl_or_origin
));
25817 die
= lookup_decl_die (decl_or_origin
);
25818 /* Avoid re-creating the DIE late if it was optimized as unused early. */
25819 if (! die
&& ! early_dwarf
)
25825 /* Avoid creating DIEs for local typedefs and concrete static variables that
25826 will only be pruned later. */
25827 if ((origin
|| decl_ultimate_origin (decl
))
25828 && (TREE_CODE (decl_or_origin
) == TYPE_DECL
25829 || (VAR_P (decl_or_origin
) && TREE_STATIC (decl_or_origin
))))
25831 origin
= decl_ultimate_origin (decl_or_origin
);
25832 if (decl
&& VAR_P (decl
) && die
!= NULL
)
25834 die
= lookup_decl_die (origin
);
25836 equate_decl_number_to_die (decl
, die
);
25841 if (die
!= NULL
&& die
->die_parent
== NULL
)
25842 add_child_die (context_die
, die
);
25843 else if (TREE_CODE (decl_or_origin
) == IMPORTED_DECL
)
25846 dwarf2out_imported_module_or_decl_1 (decl_or_origin
, DECL_NAME (decl_or_origin
),
25847 stmt
, context_die
);
25851 if (decl
&& DECL_P (decl
))
25853 die
= lookup_decl_die (decl
);
25855 /* Early created DIEs do not have a parent as the decls refer
25856 to the function as DECL_CONTEXT rather than the BLOCK. */
25857 if (die
&& die
->die_parent
== NULL
)
25859 gcc_assert (in_lto_p
);
25860 add_child_die (context_die
, die
);
25864 gen_decl_die (decl
, origin
, NULL
, context_die
);
25868 /* Generate all of the decls declared within a given scope and (recursively)
25869 all of its sub-blocks. */
25872 decls_for_scope (tree stmt
, dw_die_ref context_die
, bool recurse
)
25878 /* Ignore NULL blocks. */
25879 if (stmt
== NULL_TREE
)
25882 /* Output the DIEs to represent all of the data objects and typedefs
25883 declared directly within this block but not within any nested
25884 sub-blocks. Also, nested function and tag DIEs have been
25885 generated with a parent of NULL; fix that up now. We don't
25886 have to do this if we're at -g1. */
25887 if (debug_info_level
> DINFO_LEVEL_TERSE
)
25889 for (decl
= BLOCK_VARS (stmt
); decl
!= NULL
; decl
= DECL_CHAIN (decl
))
25890 process_scope_var (stmt
, decl
, NULL_TREE
, context_die
);
25891 /* BLOCK_NONLOCALIZED_VARs simply generate DIE stubs with abstract
25892 origin - avoid doing this twice as we have no good way to see
25893 if we've done it once already. */
25895 for (i
= 0; i
< BLOCK_NUM_NONLOCALIZED_VARS (stmt
); i
++)
25897 decl
= BLOCK_NONLOCALIZED_VAR (stmt
, i
);
25898 if (decl
== current_function_decl
)
25899 /* Ignore declarations of the current function, while they
25900 are declarations, gen_subprogram_die would treat them
25901 as definitions again, because they are equal to
25902 current_function_decl and endlessly recurse. */;
25903 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
25904 process_scope_var (stmt
, decl
, NULL_TREE
, context_die
);
25906 process_scope_var (stmt
, NULL_TREE
, decl
, context_die
);
25910 /* Even if we're at -g1, we need to process the subblocks in order to get
25911 inlined call information. */
25913 /* Output the DIEs to represent all sub-blocks (and the items declared
25914 therein) of this block. */
25916 for (subblocks
= BLOCK_SUBBLOCKS (stmt
);
25918 subblocks
= BLOCK_CHAIN (subblocks
))
25919 gen_block_die (subblocks
, context_die
);
25922 /* Is this a typedef we can avoid emitting? */
25925 is_redundant_typedef (const_tree decl
)
25927 if (TYPE_DECL_IS_STUB (decl
))
25930 if (DECL_ARTIFICIAL (decl
)
25931 && DECL_CONTEXT (decl
)
25932 && is_tagged_type (DECL_CONTEXT (decl
))
25933 && TREE_CODE (TYPE_NAME (DECL_CONTEXT (decl
))) == TYPE_DECL
25934 && DECL_NAME (decl
) == DECL_NAME (TYPE_NAME (DECL_CONTEXT (decl
))))
25935 /* Also ignore the artificial member typedef for the class name. */
25941 /* Return TRUE if TYPE is a typedef that names a type for linkage
25942 purposes. This kind of typedefs is produced by the C++ FE for
25945 typedef struct {...} foo;
25947 In that case, there is no typedef variant type produced for foo.
25948 Rather, the TREE_TYPE of the TYPE_DECL of foo is the anonymous
25952 is_naming_typedef_decl (const_tree decl
)
25954 if (decl
== NULL_TREE
25955 || TREE_CODE (decl
) != TYPE_DECL
25956 || DECL_NAMELESS (decl
)
25957 || !is_tagged_type (TREE_TYPE (decl
))
25958 || DECL_IS_BUILTIN (decl
)
25959 || is_redundant_typedef (decl
)
25960 /* It looks like Ada produces TYPE_DECLs that are very similar
25961 to C++ naming typedefs but that have different
25962 semantics. Let's be specific to c++ for now. */
25966 return (DECL_ORIGINAL_TYPE (decl
) == NULL_TREE
25967 && TYPE_NAME (TREE_TYPE (decl
)) == decl
25968 && (TYPE_STUB_DECL (TREE_TYPE (decl
))
25969 != TYPE_NAME (TREE_TYPE (decl
))));
25972 /* Looks up the DIE for a context. */
25974 static inline dw_die_ref
25975 lookup_context_die (tree context
)
25979 /* Find die that represents this context. */
25980 if (TYPE_P (context
))
25982 context
= TYPE_MAIN_VARIANT (context
);
25983 dw_die_ref ctx
= lookup_type_die (context
);
25986 return strip_naming_typedef (context
, ctx
);
25989 return lookup_decl_die (context
);
25991 return comp_unit_die ();
25994 /* Returns the DIE for a context. */
25996 static inline dw_die_ref
25997 get_context_die (tree context
)
26001 /* Find die that represents this context. */
26002 if (TYPE_P (context
))
26004 context
= TYPE_MAIN_VARIANT (context
);
26005 return strip_naming_typedef (context
, force_type_die (context
));
26008 return force_decl_die (context
);
26010 return comp_unit_die ();
26013 /* Returns the DIE for decl. A DIE will always be returned. */
26016 force_decl_die (tree decl
)
26018 dw_die_ref decl_die
;
26019 unsigned saved_external_flag
;
26020 tree save_fn
= NULL_TREE
;
26021 decl_die
= lookup_decl_die (decl
);
26024 dw_die_ref context_die
= get_context_die (DECL_CONTEXT (decl
));
26026 decl_die
= lookup_decl_die (decl
);
26030 switch (TREE_CODE (decl
))
26032 case FUNCTION_DECL
:
26033 /* Clear current_function_decl, so that gen_subprogram_die thinks
26034 that this is a declaration. At this point, we just want to force
26035 declaration die. */
26036 save_fn
= current_function_decl
;
26037 current_function_decl
= NULL_TREE
;
26038 gen_subprogram_die (decl
, context_die
);
26039 current_function_decl
= save_fn
;
26043 /* Set external flag to force declaration die. Restore it after
26044 gen_decl_die() call. */
26045 saved_external_flag
= DECL_EXTERNAL (decl
);
26046 DECL_EXTERNAL (decl
) = 1;
26047 gen_decl_die (decl
, NULL
, NULL
, context_die
);
26048 DECL_EXTERNAL (decl
) = saved_external_flag
;
26051 case NAMESPACE_DECL
:
26052 if (dwarf_version
>= 3 || !dwarf_strict
)
26053 dwarf2out_decl (decl
);
26055 /* DWARF2 has neither DW_TAG_module, nor DW_TAG_namespace. */
26056 decl_die
= comp_unit_die ();
26059 case TRANSLATION_UNIT_DECL
:
26060 decl_die
= comp_unit_die ();
26064 gcc_unreachable ();
26067 /* We should be able to find the DIE now. */
26069 decl_die
= lookup_decl_die (decl
);
26070 gcc_assert (decl_die
);
26076 /* Returns the DIE for TYPE, that must not be a base type. A DIE is
26077 always returned. */
26080 force_type_die (tree type
)
26082 dw_die_ref type_die
;
26084 type_die
= lookup_type_die (type
);
26087 dw_die_ref context_die
= get_context_die (TYPE_CONTEXT (type
));
26089 type_die
= modified_type_die (type
, TYPE_QUALS_NO_ADDR_SPACE (type
),
26090 false, context_die
);
26091 gcc_assert (type_die
);
26096 /* Force out any required namespaces to be able to output DECL,
26097 and return the new context_die for it, if it's changed. */
26100 setup_namespace_context (tree thing
, dw_die_ref context_die
)
26102 tree context
= (DECL_P (thing
)
26103 ? DECL_CONTEXT (thing
) : TYPE_CONTEXT (thing
));
26104 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
26105 /* Force out the namespace. */
26106 context_die
= force_decl_die (context
);
26108 return context_die
;
26111 /* Emit a declaration DIE for THING (which is either a DECL or a tagged
26112 type) within its namespace, if appropriate.
26114 For compatibility with older debuggers, namespace DIEs only contain
26115 declarations; all definitions are emitted at CU scope, with
26116 DW_AT_specification pointing to the declaration (like with class
26120 declare_in_namespace (tree thing
, dw_die_ref context_die
)
26122 dw_die_ref ns_context
;
26124 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
26125 return context_die
;
26127 /* External declarations in the local scope only need to be emitted
26128 once, not once in the namespace and once in the scope.
26130 This avoids declaring the `extern' below in the
26131 namespace DIE as well as in the innermost scope:
26144 if (DECL_P (thing
) && DECL_EXTERNAL (thing
) && local_scope_p (context_die
))
26145 return context_die
;
26147 /* If this decl is from an inlined function, then don't try to emit it in its
26148 namespace, as we will get confused. It would have already been emitted
26149 when the abstract instance of the inline function was emitted anyways. */
26150 if (DECL_P (thing
) && DECL_ABSTRACT_ORIGIN (thing
))
26151 return context_die
;
26153 ns_context
= setup_namespace_context (thing
, context_die
);
26155 if (ns_context
!= context_die
)
26157 if (is_fortran () || is_dlang ())
26159 if (DECL_P (thing
))
26160 gen_decl_die (thing
, NULL
, NULL
, ns_context
);
26162 gen_type_die (thing
, ns_context
);
26164 return context_die
;
26167 /* Generate a DIE for a namespace or namespace alias. */
26170 gen_namespace_die (tree decl
, dw_die_ref context_die
)
26172 dw_die_ref namespace_die
;
26174 /* Namespace aliases have a DECL_ABSTRACT_ORIGIN of the namespace
26175 they are an alias of. */
26176 if (DECL_ABSTRACT_ORIGIN (decl
) == NULL
)
26178 /* Output a real namespace or module. */
26179 context_die
= setup_namespace_context (decl
, comp_unit_die ());
26180 namespace_die
= new_die (is_fortran () || is_dlang ()
26181 ? DW_TAG_module
: DW_TAG_namespace
,
26182 context_die
, decl
);
26183 /* For Fortran modules defined in different CU don't add src coords. */
26184 if (namespace_die
->die_tag
== DW_TAG_module
&& DECL_EXTERNAL (decl
))
26186 const char *name
= dwarf2_name (decl
, 0);
26188 add_name_attribute (namespace_die
, name
);
26191 add_name_and_src_coords_attributes (namespace_die
, decl
);
26192 if (DECL_EXTERNAL (decl
))
26193 add_AT_flag (namespace_die
, DW_AT_declaration
, 1);
26194 equate_decl_number_to_die (decl
, namespace_die
);
26198 /* Output a namespace alias. */
26200 /* Force out the namespace we are an alias of, if necessary. */
26201 dw_die_ref origin_die
26202 = force_decl_die (DECL_ABSTRACT_ORIGIN (decl
));
26204 if (DECL_FILE_SCOPE_P (decl
)
26205 || TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
)
26206 context_die
= setup_namespace_context (decl
, comp_unit_die ());
26207 /* Now create the namespace alias DIE. */
26208 namespace_die
= new_die (DW_TAG_imported_declaration
, context_die
, decl
);
26209 add_name_and_src_coords_attributes (namespace_die
, decl
);
26210 add_AT_die_ref (namespace_die
, DW_AT_import
, origin_die
);
26211 equate_decl_number_to_die (decl
, namespace_die
);
26213 if ((dwarf_version
>= 5 || !dwarf_strict
)
26214 && lang_hooks
.decls
.decl_dwarf_attribute (decl
,
26215 DW_AT_export_symbols
) == 1)
26216 add_AT_flag (namespace_die
, DW_AT_export_symbols
, 1);
26218 /* Bypass dwarf2_name's check for DECL_NAMELESS. */
26219 if (want_pubnames ())
26220 add_pubname_string (lang_hooks
.dwarf_name (decl
, 1), namespace_die
);
26223 /* Generate Dwarf debug information for a decl described by DECL.
26224 The return value is currently only meaningful for PARM_DECLs,
26225 for all other decls it returns NULL.
26227 If DECL is a FIELD_DECL, CTX is required: see the comment for VLR_CONTEXT.
26228 It can be NULL otherwise. */
26231 gen_decl_die (tree decl
, tree origin
, struct vlr_context
*ctx
,
26232 dw_die_ref context_die
)
26234 tree decl_or_origin
= decl
? decl
: origin
;
26235 tree class_origin
= NULL
, ultimate_origin
;
26237 if (DECL_P (decl_or_origin
) && DECL_IGNORED_P (decl_or_origin
))
26240 switch (TREE_CODE (decl_or_origin
))
26246 if (!is_fortran () && !is_ada () && !is_dlang ())
26248 /* The individual enumerators of an enum type get output when we output
26249 the Dwarf representation of the relevant enum type itself. */
26253 /* Emit its type. */
26254 gen_type_die (TREE_TYPE (decl
), context_die
);
26256 /* And its containing namespace. */
26257 context_die
= declare_in_namespace (decl
, context_die
);
26259 gen_const_die (decl
, context_die
);
26262 case FUNCTION_DECL
:
26265 /* This doesn't work because the C frontend sets DECL_ABSTRACT_ORIGIN
26266 on local redeclarations of global functions. That seems broken. */
26267 if (current_function_decl
!= decl
)
26268 /* This is only a declaration. */;
26271 /* We should have abstract copies already and should not generate
26272 stray type DIEs in late LTO dumping. */
26276 /* If we're emitting a clone, emit info for the abstract instance. */
26277 else if (origin
|| DECL_ORIGIN (decl
) != decl
)
26278 dwarf2out_abstract_function (origin
26279 ? DECL_ORIGIN (origin
)
26280 : DECL_ABSTRACT_ORIGIN (decl
));
26282 /* If we're emitting a possibly inlined function emit it as
26283 abstract instance. */
26284 else if (cgraph_function_possibly_inlined_p (decl
)
26285 && ! DECL_ABSTRACT_P (decl
)
26286 && ! class_or_namespace_scope_p (context_die
)
26287 /* dwarf2out_abstract_function won't emit a die if this is just
26288 a declaration. We must avoid setting DECL_ABSTRACT_ORIGIN in
26289 that case, because that works only if we have a die. */
26290 && DECL_INITIAL (decl
) != NULL_TREE
)
26291 dwarf2out_abstract_function (decl
);
26293 /* Otherwise we're emitting the primary DIE for this decl. */
26294 else if (debug_info_level
> DINFO_LEVEL_TERSE
)
26296 /* Before we describe the FUNCTION_DECL itself, make sure that we
26297 have its containing type. */
26299 origin
= decl_class_context (decl
);
26300 if (origin
!= NULL_TREE
)
26301 gen_type_die (origin
, context_die
);
26303 /* And its return type. */
26304 gen_type_die (TREE_TYPE (TREE_TYPE (decl
)), context_die
);
26306 /* And its virtual context. */
26307 if (DECL_VINDEX (decl
) != NULL_TREE
)
26308 gen_type_die (DECL_CONTEXT (decl
), context_die
);
26310 /* Make sure we have a member DIE for decl. */
26311 if (origin
!= NULL_TREE
)
26312 gen_type_die_for_member (origin
, decl
, context_die
);
26314 /* And its containing namespace. */
26315 context_die
= declare_in_namespace (decl
, context_die
);
26318 /* Now output a DIE to represent the function itself. */
26320 gen_subprogram_die (decl
, context_die
);
26324 /* If we are in terse mode, don't generate any DIEs to represent any
26325 actual typedefs. */
26326 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
26329 /* In the special case of a TYPE_DECL node representing the declaration
26330 of some type tag, if the given TYPE_DECL is marked as having been
26331 instantiated from some other (original) TYPE_DECL node (e.g. one which
26332 was generated within the original definition of an inline function) we
26333 used to generate a special (abbreviated) DW_TAG_structure_type,
26334 DW_TAG_union_type, or DW_TAG_enumeration_type DIE here. But nothing
26335 should be actually referencing those DIEs, as variable DIEs with that
26336 type would be emitted already in the abstract origin, so it was always
26337 removed during unused type prunning. Don't add anything in this
26339 if (TYPE_DECL_IS_STUB (decl
) && decl_ultimate_origin (decl
) != NULL_TREE
)
26342 if (is_redundant_typedef (decl
))
26343 gen_type_die (TREE_TYPE (decl
), context_die
);
26345 /* Output a DIE to represent the typedef itself. */
26346 gen_typedef_die (decl
, context_die
);
26350 if (debug_info_level
>= DINFO_LEVEL_NORMAL
)
26351 gen_label_die (decl
, context_die
);
26356 /* If we are in terse mode, don't generate any DIEs to represent any
26357 variable declarations or definitions. */
26358 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
26361 /* Avoid generating stray type DIEs during late dwarf dumping.
26362 All types have been dumped early. */
26364 /* ??? But in LTRANS we cannot annotate early created variably
26365 modified type DIEs without copying them and adjusting all
26366 references to them. Dump them again as happens for inlining
26367 which copies both the decl and the types. */
26368 /* ??? And even non-LTO needs to re-visit type DIEs to fill
26369 in VLA bound information for example. */
26370 || (decl
&& variably_modified_type_p (TREE_TYPE (decl
),
26371 current_function_decl
)))
26373 /* Output any DIEs that are needed to specify the type of this data
26375 if (decl_by_reference_p (decl_or_origin
))
26376 gen_type_die (TREE_TYPE (TREE_TYPE (decl_or_origin
)), context_die
);
26378 gen_type_die (TREE_TYPE (decl_or_origin
), context_die
);
26383 /* And its containing type. */
26384 class_origin
= decl_class_context (decl_or_origin
);
26385 if (class_origin
!= NULL_TREE
)
26386 gen_type_die_for_member (class_origin
, decl_or_origin
, context_die
);
26388 /* And its containing namespace. */
26389 context_die
= declare_in_namespace (decl_or_origin
, context_die
);
26392 /* Now output the DIE to represent the data object itself. This gets
26393 complicated because of the possibility that the VAR_DECL really
26394 represents an inlined instance of a formal parameter for an inline
26396 ultimate_origin
= decl_ultimate_origin (decl_or_origin
);
26397 if (ultimate_origin
!= NULL_TREE
26398 && TREE_CODE (ultimate_origin
) == PARM_DECL
)
26399 gen_formal_parameter_die (decl
, origin
,
26400 true /* Emit name attribute. */,
26403 gen_variable_die (decl
, origin
, context_die
);
26407 gcc_assert (ctx
!= NULL
&& ctx
->struct_type
!= NULL
);
26408 /* Ignore the nameless fields that are used to skip bits but handle C++
26409 anonymous unions and structs. */
26410 if (DECL_NAME (decl
) != NULL_TREE
26411 || TREE_CODE (TREE_TYPE (decl
)) == UNION_TYPE
26412 || TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
)
26414 gen_type_die (member_declared_type (decl
), context_die
);
26415 gen_field_die (decl
, ctx
, context_die
);
26420 /* Avoid generating stray type DIEs during late dwarf dumping.
26421 All types have been dumped early. */
26423 /* ??? But in LTRANS we cannot annotate early created variably
26424 modified type DIEs without copying them and adjusting all
26425 references to them. Dump them again as happens for inlining
26426 which copies both the decl and the types. */
26427 /* ??? And even non-LTO needs to re-visit type DIEs to fill
26428 in VLA bound information for example. */
26429 || (decl
&& variably_modified_type_p (TREE_TYPE (decl
),
26430 current_function_decl
)))
26432 if (DECL_BY_REFERENCE (decl_or_origin
))
26433 gen_type_die (TREE_TYPE (TREE_TYPE (decl_or_origin
)), context_die
);
26435 gen_type_die (TREE_TYPE (decl_or_origin
), context_die
);
26437 return gen_formal_parameter_die (decl
, origin
,
26438 true /* Emit name attribute. */,
26441 case NAMESPACE_DECL
:
26442 if (dwarf_version
>= 3 || !dwarf_strict
)
26443 gen_namespace_die (decl
, context_die
);
26446 case IMPORTED_DECL
:
26447 dwarf2out_imported_module_or_decl_1 (decl
, DECL_NAME (decl
),
26448 DECL_CONTEXT (decl
), context_die
);
26451 case NAMELIST_DECL
:
26452 gen_namelist_decl (DECL_NAME (decl
), context_die
,
26453 NAMELIST_DECL_ASSOCIATED_DECL (decl
));
26457 /* Probably some frontend-internal decl. Assume we don't care. */
26458 gcc_assert ((int)TREE_CODE (decl
) > NUM_TREE_CODES
);
26465 /* Output initial debug information for global DECL. Called at the
26466 end of the parsing process.
26468 This is the initial debug generation process. As such, the DIEs
26469 generated may be incomplete. A later debug generation pass
26470 (dwarf2out_late_global_decl) will augment the information generated
26471 in this pass (e.g., with complete location info). */
26474 dwarf2out_early_global_decl (tree decl
)
26478 /* gen_decl_die() will set DECL_ABSTRACT because
26479 cgraph_function_possibly_inlined_p() returns true. This is in
26480 turn will cause DW_AT_inline attributes to be set.
26482 This happens because at early dwarf generation, there is no
26483 cgraph information, causing cgraph_function_possibly_inlined_p()
26484 to return true. Trick cgraph_function_possibly_inlined_p()
26485 while we generate dwarf early. */
26486 bool save
= symtab
->global_info_ready
;
26487 symtab
->global_info_ready
= true;
26489 /* We don't handle TYPE_DECLs. If required, they'll be reached via
26490 other DECLs and they can point to template types or other things
26491 that dwarf2out can't handle when done via dwarf2out_decl. */
26492 if (TREE_CODE (decl
) != TYPE_DECL
26493 && TREE_CODE (decl
) != PARM_DECL
)
26495 if (TREE_CODE (decl
) == FUNCTION_DECL
)
26497 tree save_fndecl
= current_function_decl
;
26499 /* For nested functions, make sure we have DIEs for the parents first
26500 so that all nested DIEs are generated at the proper scope in the
26502 tree context
= decl_function_context (decl
);
26503 if (context
!= NULL
)
26505 dw_die_ref context_die
= lookup_decl_die (context
);
26506 current_function_decl
= context
;
26508 /* Avoid emitting DIEs multiple times, but still process CONTEXT
26509 enough so that it lands in its own context. This avoids type
26510 pruning issues later on. */
26511 if (context_die
== NULL
|| is_declaration_die (context_die
))
26512 dwarf2out_early_global_decl (context
);
26515 /* Emit an abstract origin of a function first. This happens
26516 with C++ constructor clones for example and makes
26517 dwarf2out_abstract_function happy which requires the early
26518 DIE of the abstract instance to be present. */
26519 tree origin
= DECL_ABSTRACT_ORIGIN (decl
);
26520 dw_die_ref origin_die
;
26522 /* Do not emit the DIE multiple times but make sure to
26523 process it fully here in case we just saw a declaration. */
26524 && ((origin_die
= lookup_decl_die (origin
)) == NULL
26525 || is_declaration_die (origin_die
)))
26527 current_function_decl
= origin
;
26528 dwarf2out_decl (origin
);
26531 /* Emit the DIE for decl but avoid doing that multiple times. */
26532 dw_die_ref old_die
;
26533 if ((old_die
= lookup_decl_die (decl
)) == NULL
26534 || is_declaration_die (old_die
))
26536 current_function_decl
= decl
;
26537 dwarf2out_decl (decl
);
26540 current_function_decl
= save_fndecl
;
26543 dwarf2out_decl (decl
);
26545 symtab
->global_info_ready
= save
;
26548 /* Return whether EXPR is an expression with the following pattern:
26549 INDIRECT_REF (NOP_EXPR (INTEGER_CST)). */
26552 is_trivial_indirect_ref (tree expr
)
26554 if (expr
== NULL_TREE
|| TREE_CODE (expr
) != INDIRECT_REF
)
26557 tree nop
= TREE_OPERAND (expr
, 0);
26558 if (nop
== NULL_TREE
|| TREE_CODE (nop
) != NOP_EXPR
)
26561 tree int_cst
= TREE_OPERAND (nop
, 0);
26562 return int_cst
!= NULL_TREE
&& TREE_CODE (int_cst
) == INTEGER_CST
;
26565 /* Output debug information for global decl DECL. Called from
26566 toplev.c after compilation proper has finished. */
26569 dwarf2out_late_global_decl (tree decl
)
26571 /* Fill-in any location information we were unable to determine
26572 on the first pass. */
26575 dw_die_ref die
= lookup_decl_die (decl
);
26577 /* We may have to generate full debug late for LTO in case debug
26578 was not enabled at compile-time or the target doesn't support
26579 the LTO early debug scheme. */
26580 if (! die
&& in_lto_p
)
26581 dwarf2out_decl (decl
);
26584 /* We get called via the symtab code invoking late_global_decl
26585 for symbols that are optimized out.
26587 Do not add locations for those, except if they have a
26588 DECL_VALUE_EXPR, in which case they are relevant for debuggers.
26589 Still don't add a location if the DECL_VALUE_EXPR is not a trivial
26590 INDIRECT_REF expression, as this could generate relocations to
26591 text symbols in LTO object files, which is invalid. */
26592 varpool_node
*node
= varpool_node::get (decl
);
26593 if ((! node
|| ! node
->definition
)
26594 && ! (DECL_HAS_VALUE_EXPR_P (decl
)
26595 && is_trivial_indirect_ref (DECL_VALUE_EXPR (decl
))))
26596 tree_add_const_value_attribute_for_decl (die
, decl
);
26598 add_location_or_const_value_attribute (die
, decl
, false);
26603 /* Output debug information for type decl DECL. Called from toplev.c
26604 and from language front ends (to record built-in types). */
26606 dwarf2out_type_decl (tree decl
, int local
)
26611 dwarf2out_decl (decl
);
26615 /* Output debug information for imported module or decl DECL.
26616 NAME is non-NULL name in the lexical block if the decl has been renamed.
26617 LEXICAL_BLOCK is the lexical block (which TREE_CODE is a BLOCK)
26618 that DECL belongs to.
26619 LEXICAL_BLOCK_DIE is the DIE of LEXICAL_BLOCK. */
26621 dwarf2out_imported_module_or_decl_1 (tree decl
,
26623 tree lexical_block
,
26624 dw_die_ref lexical_block_die
)
26626 expanded_location xloc
;
26627 dw_die_ref imported_die
= NULL
;
26628 dw_die_ref at_import_die
;
26630 if (TREE_CODE (decl
) == IMPORTED_DECL
)
26632 xloc
= expand_location (DECL_SOURCE_LOCATION (decl
));
26633 decl
= IMPORTED_DECL_ASSOCIATED_DECL (decl
);
26637 xloc
= expand_location (input_location
);
26639 if (TREE_CODE (decl
) == TYPE_DECL
|| TREE_CODE (decl
) == CONST_DECL
)
26641 at_import_die
= force_type_die (TREE_TYPE (decl
));
26642 /* For namespace N { typedef void T; } using N::T; base_type_die
26643 returns NULL, but DW_TAG_imported_declaration requires
26644 the DW_AT_import tag. Force creation of DW_TAG_typedef. */
26645 if (!at_import_die
)
26647 gcc_assert (TREE_CODE (decl
) == TYPE_DECL
);
26648 gen_typedef_die (decl
, get_context_die (DECL_CONTEXT (decl
)));
26649 at_import_die
= lookup_type_die (TREE_TYPE (decl
));
26650 gcc_assert (at_import_die
);
26655 at_import_die
= lookup_decl_die (decl
);
26656 if (!at_import_die
)
26658 /* If we're trying to avoid duplicate debug info, we may not have
26659 emitted the member decl for this field. Emit it now. */
26660 if (TREE_CODE (decl
) == FIELD_DECL
)
26662 tree type
= DECL_CONTEXT (decl
);
26664 if (TYPE_CONTEXT (type
)
26665 && TYPE_P (TYPE_CONTEXT (type
))
26666 && !should_emit_struct_debug (TYPE_CONTEXT (type
),
26667 DINFO_USAGE_DIR_USE
))
26669 gen_type_die_for_member (type
, decl
,
26670 get_context_die (TYPE_CONTEXT (type
)));
26672 if (TREE_CODE (decl
) == NAMELIST_DECL
)
26673 at_import_die
= gen_namelist_decl (DECL_NAME (decl
),
26674 get_context_die (DECL_CONTEXT (decl
)),
26677 at_import_die
= force_decl_die (decl
);
26681 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
26683 if (dwarf_version
>= 3 || !dwarf_strict
)
26684 imported_die
= new_die (DW_TAG_imported_module
,
26691 imported_die
= new_die (DW_TAG_imported_declaration
,
26695 add_AT_file (imported_die
, DW_AT_decl_file
, lookup_filename (xloc
.file
));
26696 add_AT_unsigned (imported_die
, DW_AT_decl_line
, xloc
.line
);
26697 if (debug_column_info
&& xloc
.column
)
26698 add_AT_unsigned (imported_die
, DW_AT_decl_column
, xloc
.column
);
26700 add_AT_string (imported_die
, DW_AT_name
,
26701 IDENTIFIER_POINTER (name
));
26702 add_AT_die_ref (imported_die
, DW_AT_import
, at_import_die
);
26705 /* Output debug information for imported module or decl DECL.
26706 NAME is non-NULL name in context if the decl has been renamed.
26707 CHILD is true if decl is one of the renamed decls as part of
26708 importing whole module.
26709 IMPLICIT is set if this hook is called for an implicit import
26710 such as inline namespace. */
26713 dwarf2out_imported_module_or_decl (tree decl
, tree name
, tree context
,
26714 bool child
, bool implicit
)
26716 /* dw_die_ref at_import_die; */
26717 dw_die_ref scope_die
;
26719 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
26724 /* For DWARF5, just DW_AT_export_symbols on the DW_TAG_namespace
26725 should be enough, for DWARF4 and older even if we emit as extension
26726 DW_AT_export_symbols add the implicit DW_TAG_imported_module anyway
26727 for the benefit of consumers unaware of DW_AT_export_symbols. */
26729 && dwarf_version
>= 5
26730 && lang_hooks
.decls
.decl_dwarf_attribute (decl
,
26731 DW_AT_export_symbols
) == 1)
26736 /* To emit DW_TAG_imported_module or DW_TAG_imported_decl, we need two DIEs.
26737 We need decl DIE for reference and scope die. First, get DIE for the decl
26740 /* Get the scope die for decl context. Use comp_unit_die for global module
26741 or decl. If die is not found for non globals, force new die. */
26743 && TYPE_P (context
)
26744 && !should_emit_struct_debug (context
, DINFO_USAGE_DIR_USE
))
26747 scope_die
= get_context_die (context
);
26751 /* DW_TAG_imported_module was introduced in the DWARFv3 specification, so
26752 there is nothing we can do, here. */
26753 if (dwarf_version
< 3 && dwarf_strict
)
26756 gcc_assert (scope_die
->die_child
);
26757 gcc_assert (scope_die
->die_child
->die_tag
== DW_TAG_imported_module
);
26758 gcc_assert (TREE_CODE (decl
) != NAMESPACE_DECL
);
26759 scope_die
= scope_die
->die_child
;
26762 /* OK, now we have DIEs for decl as well as scope. Emit imported die. */
26763 dwarf2out_imported_module_or_decl_1 (decl
, name
, context
, scope_die
);
26766 /* Output debug information for namelists. */
26769 gen_namelist_decl (tree name
, dw_die_ref scope_die
, tree item_decls
)
26771 dw_die_ref nml_die
, nml_item_die
, nml_item_ref_die
;
26775 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
26778 gcc_assert (scope_die
!= NULL
);
26779 nml_die
= new_die (DW_TAG_namelist
, scope_die
, NULL
);
26780 add_AT_string (nml_die
, DW_AT_name
, IDENTIFIER_POINTER (name
));
26782 /* If there are no item_decls, we have a nondefining namelist, e.g.
26783 with USE association; hence, set DW_AT_declaration. */
26784 if (item_decls
== NULL_TREE
)
26786 add_AT_flag (nml_die
, DW_AT_declaration
, 1);
26790 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (item_decls
), i
, value
)
26792 nml_item_ref_die
= lookup_decl_die (value
);
26793 if (!nml_item_ref_die
)
26794 nml_item_ref_die
= force_decl_die (value
);
26796 nml_item_die
= new_die (DW_TAG_namelist_item
, nml_die
, NULL
);
26797 add_AT_die_ref (nml_item_die
, DW_AT_namelist_items
, nml_item_ref_die
);
26803 /* Write the debugging output for DECL and return the DIE. */
26806 dwarf2out_decl (tree decl
)
26808 dw_die_ref context_die
= comp_unit_die ();
26810 switch (TREE_CODE (decl
))
26815 case FUNCTION_DECL
:
26816 /* If we're a nested function, initially use a parent of NULL; if we're
26817 a plain function, this will be fixed up in decls_for_scope. If
26818 we're a method, it will be ignored, since we already have a DIE.
26819 Avoid doing this late though since clones of class methods may
26820 otherwise end up in limbo and create type DIEs late. */
26822 && decl_function_context (decl
)
26823 /* But if we're in terse mode, we don't care about scope. */
26824 && debug_info_level
> DINFO_LEVEL_TERSE
)
26825 context_die
= NULL
;
26829 /* For local statics lookup proper context die. */
26830 if (local_function_static (decl
))
26831 context_die
= lookup_decl_die (DECL_CONTEXT (decl
));
26833 /* If we are in terse mode, don't generate any DIEs to represent any
26834 variable declarations or definitions. */
26835 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
26840 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
26842 if (!is_fortran () && !is_ada () && !is_dlang ())
26844 if (TREE_STATIC (decl
) && decl_function_context (decl
))
26845 context_die
= lookup_decl_die (DECL_CONTEXT (decl
));
26848 case NAMESPACE_DECL
:
26849 case IMPORTED_DECL
:
26850 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
26852 if (lookup_decl_die (decl
) != NULL
)
26857 /* Don't emit stubs for types unless they are needed by other DIEs. */
26858 if (TYPE_DECL_SUPPRESS_DEBUG (decl
))
26861 /* Don't bother trying to generate any DIEs to represent any of the
26862 normal built-in types for the language we are compiling. */
26863 if (DECL_IS_BUILTIN (decl
))
26866 /* If we are in terse mode, don't generate any DIEs for types. */
26867 if (debug_info_level
<= DINFO_LEVEL_TERSE
)
26870 /* If we're a function-scope tag, initially use a parent of NULL;
26871 this will be fixed up in decls_for_scope. */
26872 if (decl_function_context (decl
))
26873 context_die
= NULL
;
26877 case NAMELIST_DECL
:
26884 gen_decl_die (decl
, NULL
, NULL
, context_die
);
26888 dw_die_ref die
= lookup_decl_die (decl
);
26894 /* Write the debugging output for DECL. */
26897 dwarf2out_function_decl (tree decl
)
26899 dwarf2out_decl (decl
);
26900 call_arg_locations
= NULL
;
26901 call_arg_loc_last
= NULL
;
26902 call_site_count
= -1;
26903 tail_call_site_count
= -1;
26904 decl_loc_table
->empty ();
26905 cached_dw_loc_list_table
->empty ();
26908 /* Output a marker (i.e. a label) for the beginning of the generated code for
26909 a lexical block. */
26912 dwarf2out_begin_block (unsigned int line ATTRIBUTE_UNUSED
,
26913 unsigned int blocknum
)
26915 switch_to_section (current_function_section ());
26916 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, BLOCK_BEGIN_LABEL
, blocknum
);
26919 /* Output a marker (i.e. a label) for the end of the generated code for a
26923 dwarf2out_end_block (unsigned int line ATTRIBUTE_UNUSED
, unsigned int blocknum
)
26925 switch_to_section (current_function_section ());
26926 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, BLOCK_END_LABEL
, blocknum
);
26929 /* Returns nonzero if it is appropriate not to emit any debugging
26930 information for BLOCK, because it doesn't contain any instructions.
26932 Don't allow this for blocks with nested functions or local classes
26933 as we would end up with orphans, and in the presence of scheduling
26934 we may end up calling them anyway. */
26937 dwarf2out_ignore_block (const_tree block
)
26942 for (decl
= BLOCK_VARS (block
); decl
; decl
= DECL_CHAIN (decl
))
26943 if (TREE_CODE (decl
) == FUNCTION_DECL
26944 || (TREE_CODE (decl
) == TYPE_DECL
&& TYPE_DECL_IS_STUB (decl
)))
26946 for (i
= 0; i
< BLOCK_NUM_NONLOCALIZED_VARS (block
); i
++)
26948 decl
= BLOCK_NONLOCALIZED_VAR (block
, i
);
26949 if (TREE_CODE (decl
) == FUNCTION_DECL
26950 || (TREE_CODE (decl
) == TYPE_DECL
&& TYPE_DECL_IS_STUB (decl
)))
26957 /* Hash table routines for file_hash. */
26960 dwarf_file_hasher::equal (dwarf_file_data
*p1
, const char *p2
)
26962 return filename_cmp (p1
->filename
, p2
) == 0;
26966 dwarf_file_hasher::hash (dwarf_file_data
*p
)
26968 return htab_hash_string (p
->filename
);
26971 /* Lookup FILE_NAME (in the list of filenames that we know about here in
26972 dwarf2out.c) and return its "index". The index of each (known) filename is
26973 just a unique number which is associated with only that one filename. We
26974 need such numbers for the sake of generating labels (in the .debug_sfnames
26975 section) and references to those files numbers (in the .debug_srcinfo
26976 and .debug_macinfo sections). If the filename given as an argument is not
26977 found in our current list, add it to the list and assign it the next
26978 available unique index number. */
26980 static struct dwarf_file_data
*
26981 lookup_filename (const char *file_name
)
26983 struct dwarf_file_data
* created
;
26989 file_name
= "<stdin>";
26991 dwarf_file_data
**slot
26992 = file_table
->find_slot_with_hash (file_name
, htab_hash_string (file_name
),
26997 created
= ggc_alloc
<dwarf_file_data
> ();
26998 created
->filename
= file_name
;
26999 created
->emitted_number
= 0;
27004 /* If the assembler will construct the file table, then translate the compiler
27005 internal file table number into the assembler file table number, and emit
27006 a .file directive if we haven't already emitted one yet. The file table
27007 numbers are different because we prune debug info for unused variables and
27008 types, which may include filenames. */
27011 maybe_emit_file (struct dwarf_file_data
* fd
)
27013 if (! fd
->emitted_number
)
27015 if (last_emitted_file
)
27016 fd
->emitted_number
= last_emitted_file
->emitted_number
+ 1;
27018 fd
->emitted_number
= 1;
27019 last_emitted_file
= fd
;
27021 if (output_asm_line_debug_info ())
27023 fprintf (asm_out_file
, "\t.file %u ", fd
->emitted_number
);
27024 output_quoted_string (asm_out_file
,
27025 remap_debug_filename (fd
->filename
));
27026 fputc ('\n', asm_out_file
);
27030 return fd
->emitted_number
;
27033 /* Schedule generation of a DW_AT_const_value attribute to DIE.
27034 That generation should happen after function debug info has been
27035 generated. The value of the attribute is the constant value of ARG. */
27038 append_entry_to_tmpl_value_parm_die_table (dw_die_ref die
, tree arg
)
27040 die_arg_entry entry
;
27045 gcc_assert (early_dwarf
);
27047 if (!tmpl_value_parm_die_table
)
27048 vec_alloc (tmpl_value_parm_die_table
, 32);
27052 vec_safe_push (tmpl_value_parm_die_table
, entry
);
27055 /* Return TRUE if T is an instance of generic type, FALSE
27059 generic_type_p (tree t
)
27061 if (t
== NULL_TREE
|| !TYPE_P (t
))
27063 return lang_hooks
.get_innermost_generic_parms (t
) != NULL_TREE
;
27066 /* Schedule the generation of the generic parameter dies for the
27067 instance of generic type T. The proper generation itself is later
27068 done by gen_scheduled_generic_parms_dies. */
27071 schedule_generic_params_dies_gen (tree t
)
27073 if (!generic_type_p (t
))
27076 gcc_assert (early_dwarf
);
27078 if (!generic_type_instances
)
27079 vec_alloc (generic_type_instances
, 256);
27081 vec_safe_push (generic_type_instances
, t
);
27084 /* Add a DW_AT_const_value attribute to DIEs that were scheduled
27085 by append_entry_to_tmpl_value_parm_die_table. This function must
27086 be called after function DIEs have been generated. */
27089 gen_remaining_tmpl_value_param_die_attribute (void)
27091 if (tmpl_value_parm_die_table
)
27096 /* We do this in two phases - first get the cases we can
27097 handle during early-finish, preserving those we cannot
27098 (containing symbolic constants where we don't yet know
27099 whether we are going to output the referenced symbols).
27100 For those we try again at late-finish. */
27102 FOR_EACH_VEC_ELT (*tmpl_value_parm_die_table
, i
, e
)
27104 if (!e
->die
->removed
27105 && !tree_add_const_value_attribute (e
->die
, e
->arg
))
27107 dw_loc_descr_ref loc
= NULL
;
27109 && (dwarf_version
>= 5 || !dwarf_strict
))
27110 loc
= loc_descriptor_from_tree (e
->arg
, 2, NULL
);
27112 add_AT_loc (e
->die
, DW_AT_location
, loc
);
27114 (*tmpl_value_parm_die_table
)[j
++] = *e
;
27117 tmpl_value_parm_die_table
->truncate (j
);
27121 /* Generate generic parameters DIEs for instances of generic types
27122 that have been previously scheduled by
27123 schedule_generic_params_dies_gen. This function must be called
27124 after all the types of the CU have been laid out. */
27127 gen_scheduled_generic_parms_dies (void)
27132 if (!generic_type_instances
)
27135 FOR_EACH_VEC_ELT (*generic_type_instances
, i
, t
)
27136 if (COMPLETE_TYPE_P (t
))
27137 gen_generic_params_dies (t
);
27139 generic_type_instances
= NULL
;
27143 /* Replace DW_AT_name for the decl with name. */
27146 dwarf2out_set_name (tree decl
, tree name
)
27149 dw_attr_node
*attr
;
27152 die
= TYPE_SYMTAB_DIE (decl
);
27156 dname
= dwarf2_name (name
, 0);
27160 attr
= get_AT (die
, DW_AT_name
);
27163 struct indirect_string_node
*node
;
27165 node
= find_AT_string (dname
);
27166 /* replace the string. */
27167 attr
->dw_attr_val
.v
.val_str
= node
;
27171 add_name_attribute (die
, dname
);
27174 /* True if before or during processing of the first function being emitted. */
27175 static bool in_first_function_p
= true;
27176 /* True if loc_note during dwarf2out_var_location call might still be
27177 before first real instruction at address equal to .Ltext0. */
27178 static bool maybe_at_text_label_p
= true;
27179 /* One above highest N where .LVLN label might be equal to .Ltext0 label. */
27180 static unsigned int first_loclabel_num_not_at_text_label
;
27182 /* Look ahead for a real insn, or for a begin stmt marker. */
27185 dwarf2out_next_real_insn (rtx_insn
*loc_note
)
27187 rtx_insn
*next_real
= NEXT_INSN (loc_note
);
27190 if (INSN_P (next_real
))
27193 next_real
= NEXT_INSN (next_real
);
27198 /* Called by the final INSN scan whenever we see a var location. We
27199 use it to drop labels in the right places, and throw the location in
27200 our lookup table. */
27203 dwarf2out_var_location (rtx_insn
*loc_note
)
27205 char loclabel
[MAX_ARTIFICIAL_LABEL_BYTES
+ 2];
27206 struct var_loc_node
*newloc
;
27207 rtx_insn
*next_real
, *next_note
;
27208 rtx_insn
*call_insn
= NULL
;
27209 static const char *last_label
;
27210 static const char *last_postcall_label
;
27211 static bool last_in_cold_section_p
;
27212 static rtx_insn
*expected_next_loc_note
;
27215 var_loc_view view
= 0;
27217 if (!NOTE_P (loc_note
))
27219 if (CALL_P (loc_note
))
27221 maybe_reset_location_view (loc_note
, cur_line_info_table
);
27223 if (SIBLING_CALL_P (loc_note
))
27224 tail_call_site_count
++;
27225 if (find_reg_note (loc_note
, REG_CALL_ARG_LOCATION
, NULL_RTX
))
27227 call_insn
= loc_note
;
27231 next_real
= dwarf2out_next_real_insn (call_insn
);
27233 cached_next_real_insn
= NULL
;
27236 if (optimize
== 0 && !flag_var_tracking
)
27238 /* When the var-tracking pass is not running, there is no note
27239 for indirect calls whose target is compile-time known. In this
27240 case, process such calls specifically so that we generate call
27241 sites for them anyway. */
27242 rtx x
= PATTERN (loc_note
);
27243 if (GET_CODE (x
) == PARALLEL
)
27244 x
= XVECEXP (x
, 0, 0);
27245 if (GET_CODE (x
) == SET
)
27247 if (GET_CODE (x
) == CALL
)
27250 || GET_CODE (XEXP (x
, 0)) != SYMBOL_REF
27251 || !SYMBOL_REF_DECL (XEXP (x
, 0))
27252 || (TREE_CODE (SYMBOL_REF_DECL (XEXP (x
, 0)))
27255 call_insn
= loc_note
;
27259 next_real
= dwarf2out_next_real_insn (call_insn
);
27261 cached_next_real_insn
= NULL
;
27266 else if (!debug_variable_location_views
)
27267 gcc_unreachable ();
27269 maybe_reset_location_view (loc_note
, cur_line_info_table
);
27274 var_loc_p
= NOTE_KIND (loc_note
) == NOTE_INSN_VAR_LOCATION
;
27275 if (var_loc_p
&& !DECL_P (NOTE_VAR_LOCATION_DECL (loc_note
)))
27278 /* Optimize processing a large consecutive sequence of location
27279 notes so we don't spend too much time in next_real_insn. If the
27280 next insn is another location note, remember the next_real_insn
27281 calculation for next time. */
27282 next_real
= cached_next_real_insn
;
27285 if (expected_next_loc_note
!= loc_note
)
27289 next_note
= NEXT_INSN (loc_note
);
27291 || next_note
->deleted ()
27292 || ! NOTE_P (next_note
)
27293 || (NOTE_KIND (next_note
) != NOTE_INSN_VAR_LOCATION
27294 && NOTE_KIND (next_note
) != NOTE_INSN_BEGIN_STMT
27295 && NOTE_KIND (next_note
) != NOTE_INSN_INLINE_ENTRY
))
27299 next_real
= dwarf2out_next_real_insn (loc_note
);
27303 expected_next_loc_note
= next_note
;
27304 cached_next_real_insn
= next_real
;
27307 cached_next_real_insn
= NULL
;
27309 /* If there are no instructions which would be affected by this note,
27310 don't do anything. */
27312 && next_real
== NULL_RTX
27313 && !NOTE_DURING_CALL_P (loc_note
))
27318 if (next_real
== NULL_RTX
)
27319 next_real
= get_last_insn ();
27321 /* If there were any real insns between note we processed last time
27322 and this note (or if it is the first note), clear
27323 last_{,postcall_}label so that they are not reused this time. */
27324 if (last_var_location_insn
== NULL_RTX
27325 || last_var_location_insn
!= next_real
27326 || last_in_cold_section_p
!= in_cold_section_p
)
27329 last_postcall_label
= NULL
;
27335 = NOTE_DURING_CALL_P (loc_note
) ? last_postcall_label
: last_label
;
27336 view
= cur_line_info_table
->view
;
27337 decl
= NOTE_VAR_LOCATION_DECL (loc_note
);
27338 newloc
= add_var_loc_to_decl (decl
, loc_note
, label
, view
);
27339 if (newloc
== NULL
)
27348 /* If there were no real insns between note we processed last time
27349 and this note, use the label we emitted last time. Otherwise
27350 create a new label and emit it. */
27351 if (last_label
== NULL
)
27353 ASM_GENERATE_INTERNAL_LABEL (loclabel
, "LVL", loclabel_num
);
27354 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, "LVL", loclabel_num
);
27356 last_label
= ggc_strdup (loclabel
);
27357 /* See if loclabel might be equal to .Ltext0. If yes,
27358 bump first_loclabel_num_not_at_text_label. */
27359 if (!have_multiple_function_sections
27360 && in_first_function_p
27361 && maybe_at_text_label_p
)
27363 static rtx_insn
*last_start
;
27365 for (insn
= loc_note
; insn
; insn
= previous_insn (insn
))
27366 if (insn
== last_start
)
27368 else if (!NONDEBUG_INSN_P (insn
))
27372 rtx body
= PATTERN (insn
);
27373 if (GET_CODE (body
) == USE
|| GET_CODE (body
) == CLOBBER
)
27375 /* Inline asm could occupy zero bytes. */
27376 else if (GET_CODE (body
) == ASM_INPUT
27377 || asm_noperands (body
) >= 0)
27379 #ifdef HAVE_ATTR_length /* ??? We don't include insn-attr.h. */
27380 else if (HAVE_ATTR_length
&& get_attr_min_length (insn
) == 0)
27385 /* Assume insn has non-zero length. */
27386 maybe_at_text_label_p
= false;
27390 if (maybe_at_text_label_p
)
27392 last_start
= loc_note
;
27393 first_loclabel_num_not_at_text_label
= loclabel_num
;
27398 gcc_assert ((loc_note
== NULL_RTX
&& call_insn
!= NULL_RTX
)
27399 || (loc_note
!= NULL_RTX
&& call_insn
== NULL_RTX
));
27403 struct call_arg_loc_node
*ca_loc
27404 = ggc_cleared_alloc
<call_arg_loc_node
> ();
27405 rtx_insn
*prev
= call_insn
;
27407 ca_loc
->call_arg_loc_note
27408 = find_reg_note (call_insn
, REG_CALL_ARG_LOCATION
, NULL_RTX
);
27409 ca_loc
->next
= NULL
;
27410 ca_loc
->label
= last_label
;
27413 || (NONJUMP_INSN_P (prev
)
27414 && GET_CODE (PATTERN (prev
)) == SEQUENCE
27415 && CALL_P (XVECEXP (PATTERN (prev
), 0, 0)))));
27416 if (!CALL_P (prev
))
27417 prev
= as_a
<rtx_sequence
*> (PATTERN (prev
))->insn (0);
27418 ca_loc
->tail_call_p
= SIBLING_CALL_P (prev
);
27420 /* Look for a SYMBOL_REF in the "prev" instruction. */
27421 rtx x
= get_call_rtx_from (prev
);
27424 /* Try to get the call symbol, if any. */
27425 if (MEM_P (XEXP (x
, 0)))
27427 /* First, look for a memory access to a symbol_ref. */
27428 if (GET_CODE (XEXP (x
, 0)) == SYMBOL_REF
27429 && SYMBOL_REF_DECL (XEXP (x
, 0))
27430 && TREE_CODE (SYMBOL_REF_DECL (XEXP (x
, 0))) == FUNCTION_DECL
)
27431 ca_loc
->symbol_ref
= XEXP (x
, 0);
27432 /* Otherwise, look at a compile-time known user-level function
27436 && TREE_CODE (MEM_EXPR (x
)) == FUNCTION_DECL
)
27437 ca_loc
->symbol_ref
= XEXP (DECL_RTL (MEM_EXPR (x
)), 0);
27440 ca_loc
->block
= insn_scope (prev
);
27441 if (call_arg_locations
)
27442 call_arg_loc_last
->next
= ca_loc
;
27444 call_arg_locations
= ca_loc
;
27445 call_arg_loc_last
= ca_loc
;
27447 else if (loc_note
!= NULL_RTX
&& !NOTE_DURING_CALL_P (loc_note
))
27449 newloc
->label
= last_label
;
27450 newloc
->view
= view
;
27454 if (!last_postcall_label
)
27456 sprintf (loclabel
, "%s-1", last_label
);
27457 last_postcall_label
= ggc_strdup (loclabel
);
27459 newloc
->label
= last_postcall_label
;
27460 /* ??? This view is at last_label, not last_label-1, but we
27461 could only assume view at last_label-1 is zero if we could
27462 assume calls always have length greater than one. This is
27463 probably true in general, though there might be a rare
27464 exception to this rule, e.g. if a call insn is optimized out
27465 by target magic. Then, even the -1 in the label will be
27466 wrong, which might invalidate the range. Anyway, using view,
27467 though technically possibly incorrect, will work as far as
27468 ranges go: since L-1 is in the middle of the call insn,
27469 (L-1).0 and (L-1).V shouldn't make any difference, and having
27470 the loclist entry refer to the .loc entry might be useful, so
27471 leave it like this. */
27472 newloc
->view
= view
;
27475 if (var_loc_p
&& flag_debug_asm
)
27477 const char *name
, *sep
, *patstr
;
27478 if (decl
&& DECL_NAME (decl
))
27479 name
= IDENTIFIER_POINTER (DECL_NAME (decl
));
27482 if (NOTE_VAR_LOCATION_LOC (loc_note
))
27485 patstr
= str_pattern_slim (NOTE_VAR_LOCATION_LOC (loc_note
));
27492 fprintf (asm_out_file
, "\t%s DEBUG %s%s%s\n", ASM_COMMENT_START
,
27493 name
, sep
, patstr
);
27496 last_var_location_insn
= next_real
;
27497 last_in_cold_section_p
= in_cold_section_p
;
27500 /* Check whether BLOCK, a lexical block, is nested within OUTER, or is
27501 OUTER itself. If BOTHWAYS, check not only that BLOCK can reach
27502 OUTER through BLOCK_SUPERCONTEXT links, but also that there is a
27503 path from OUTER to BLOCK through BLOCK_SUBBLOCKs and
27504 BLOCK_FRAGMENT_ORIGIN links. */
27506 block_within_block_p (tree block
, tree outer
, bool bothways
)
27508 if (block
== outer
)
27511 /* Quickly check that OUTER is up BLOCK's supercontext chain. */
27512 for (tree context
= BLOCK_SUPERCONTEXT (block
);
27514 context
= BLOCK_SUPERCONTEXT (context
))
27515 if (!context
|| TREE_CODE (context
) != BLOCK
)
27521 /* Now check that each block is actually referenced by its
27523 for (tree context
= BLOCK_SUPERCONTEXT (block
); ;
27524 context
= BLOCK_SUPERCONTEXT (context
))
27526 if (BLOCK_FRAGMENT_ORIGIN (context
))
27528 gcc_assert (!BLOCK_SUBBLOCKS (context
));
27529 context
= BLOCK_FRAGMENT_ORIGIN (context
);
27531 for (tree sub
= BLOCK_SUBBLOCKS (context
);
27533 sub
= BLOCK_CHAIN (sub
))
27536 if (context
== outer
)
27543 /* Called during final while assembling the marker of the entry point
27544 for an inlined function. */
27547 dwarf2out_inline_entry (tree block
)
27549 gcc_assert (debug_inline_points
);
27551 /* If we can't represent it, don't bother. */
27552 if (!(dwarf_version
>= 3 || !dwarf_strict
))
27555 gcc_assert (DECL_P (block_ultimate_origin (block
)));
27557 /* Sanity check the block tree. This would catch a case in which
27558 BLOCK got removed from the tree reachable from the outermost
27559 lexical block, but got retained in markers. It would still link
27560 back to its parents, but some ancestor would be missing a link
27561 down the path to the sub BLOCK. If the block got removed, its
27562 BLOCK_NUMBER will not be a usable value. */
27564 gcc_assert (block_within_block_p (block
,
27565 DECL_INITIAL (current_function_decl
),
27568 gcc_assert (inlined_function_outer_scope_p (block
));
27569 gcc_assert (!lookup_block_die (block
));
27571 if (BLOCK_FRAGMENT_ORIGIN (block
))
27572 block
= BLOCK_FRAGMENT_ORIGIN (block
);
27573 /* Can the entry point ever not be at the beginning of an
27574 unfragmented lexical block? */
27575 else if (!(BLOCK_FRAGMENT_CHAIN (block
)
27576 || (cur_line_info_table
27577 && !ZERO_VIEW_P (cur_line_info_table
->view
))))
27580 if (!inline_entry_data_table
)
27581 inline_entry_data_table
27582 = hash_table
<inline_entry_data_hasher
>::create_ggc (10);
27585 inline_entry_data
**iedp
27586 = inline_entry_data_table
->find_slot_with_hash (block
,
27587 htab_hash_pointer (block
),
27590 /* ??? Ideally, we'd record all entry points for the same inlined
27591 function (some may have been duplicated by e.g. unrolling), but
27592 we have no way to represent that ATM. */
27595 inline_entry_data
*ied
= *iedp
= ggc_cleared_alloc
<inline_entry_data
> ();
27596 ied
->block
= block
;
27597 ied
->label_pfx
= BLOCK_INLINE_ENTRY_LABEL
;
27598 ied
->label_num
= BLOCK_NUMBER (block
);
27599 if (cur_line_info_table
)
27600 ied
->view
= cur_line_info_table
->view
;
27602 ASM_OUTPUT_DEBUG_LABEL (asm_out_file
, BLOCK_INLINE_ENTRY_LABEL
,
27603 BLOCK_NUMBER (block
));
27606 /* Called from finalize_size_functions for size functions so that their body
27607 can be encoded in the debug info to describe the layout of variable-length
27611 dwarf2out_size_function (tree decl
)
27613 function_to_dwarf_procedure (decl
);
27616 /* Note in one location list that text section has changed. */
27619 var_location_switch_text_section_1 (var_loc_list
**slot
, void *)
27621 var_loc_list
*list
= *slot
;
27623 list
->last_before_switch
27624 = list
->last
->next
? list
->last
->next
: list
->last
;
27628 /* Note in all location lists that text section has changed. */
27631 var_location_switch_text_section (void)
27633 if (decl_loc_table
== NULL
)
27636 decl_loc_table
->traverse
<void *, var_location_switch_text_section_1
> (NULL
);
27639 /* Create a new line number table. */
27641 static dw_line_info_table
*
27642 new_line_info_table (void)
27644 dw_line_info_table
*table
;
27646 table
= ggc_cleared_alloc
<dw_line_info_table
> ();
27647 table
->file_num
= 1;
27648 table
->line_num
= 1;
27649 table
->is_stmt
= DWARF_LINE_DEFAULT_IS_STMT_START
;
27650 FORCE_RESET_NEXT_VIEW (table
->view
);
27651 table
->symviews_since_reset
= 0;
27656 /* Lookup the "current" table into which we emit line info, so
27657 that we don't have to do it for every source line. */
27660 set_cur_line_info_table (section
*sec
)
27662 dw_line_info_table
*table
;
27664 if (sec
== text_section
)
27665 table
= text_section_line_info
;
27666 else if (sec
== cold_text_section
)
27668 table
= cold_text_section_line_info
;
27671 cold_text_section_line_info
= table
= new_line_info_table ();
27672 table
->end_label
= cold_end_label
;
27677 const char *end_label
;
27679 if (crtl
->has_bb_partition
)
27681 if (in_cold_section_p
)
27682 end_label
= crtl
->subsections
.cold_section_end_label
;
27684 end_label
= crtl
->subsections
.hot_section_end_label
;
27688 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
27689 ASM_GENERATE_INTERNAL_LABEL (label
, FUNC_END_LABEL
,
27690 current_function_funcdef_no
);
27691 end_label
= ggc_strdup (label
);
27694 table
= new_line_info_table ();
27695 table
->end_label
= end_label
;
27697 vec_safe_push (separate_line_info
, table
);
27700 if (output_asm_line_debug_info ())
27701 table
->is_stmt
= (cur_line_info_table
27702 ? cur_line_info_table
->is_stmt
27703 : DWARF_LINE_DEFAULT_IS_STMT_START
);
27704 cur_line_info_table
= table
;
27708 /* We need to reset the locations at the beginning of each
27709 function. We can't do this in the end_function hook, because the
27710 declarations that use the locations won't have been output when
27711 that hook is called. Also compute have_multiple_function_sections here. */
27714 dwarf2out_begin_function (tree fun
)
27716 section
*sec
= function_section (fun
);
27718 if (sec
!= text_section
)
27719 have_multiple_function_sections
= true;
27721 if (crtl
->has_bb_partition
&& !cold_text_section
)
27723 gcc_assert (current_function_decl
== fun
);
27724 cold_text_section
= unlikely_text_section ();
27725 switch_to_section (cold_text_section
);
27726 ASM_OUTPUT_LABEL (asm_out_file
, cold_text_section_label
);
27727 switch_to_section (sec
);
27730 dwarf2out_note_section_used ();
27731 call_site_count
= 0;
27732 tail_call_site_count
= 0;
27734 set_cur_line_info_table (sec
);
27735 FORCE_RESET_NEXT_VIEW (cur_line_info_table
->view
);
27738 /* Helper function of dwarf2out_end_function, called only after emitting
27739 the very first function into assembly. Check if some .debug_loc range
27740 might end with a .LVL* label that could be equal to .Ltext0.
27741 In that case we must force using absolute addresses in .debug_loc ranges,
27742 because this range could be .LVLN-.Ltext0 .. .LVLM-.Ltext0 for
27743 .LVLN == .LVLM == .Ltext0, thus 0 .. 0, which is a .debug_loc
27745 Set have_multiple_function_sections to true in that case and
27746 terminate htab traversal. */
27749 find_empty_loc_ranges_at_text_label (var_loc_list
**slot
, int)
27751 var_loc_list
*entry
= *slot
;
27752 struct var_loc_node
*node
;
27754 node
= entry
->first
;
27755 if (node
&& node
->next
&& node
->next
->label
)
27758 const char *label
= node
->next
->label
;
27759 char loclabel
[MAX_ARTIFICIAL_LABEL_BYTES
];
27761 for (i
= 0; i
< first_loclabel_num_not_at_text_label
; i
++)
27763 ASM_GENERATE_INTERNAL_LABEL (loclabel
, "LVL", i
);
27764 if (strcmp (label
, loclabel
) == 0)
27766 have_multiple_function_sections
= true;
27774 /* Hook called after emitting a function into assembly.
27775 This does something only for the very first function emitted. */
27778 dwarf2out_end_function (unsigned int)
27780 if (in_first_function_p
27781 && !have_multiple_function_sections
27782 && first_loclabel_num_not_at_text_label
27784 decl_loc_table
->traverse
<int, find_empty_loc_ranges_at_text_label
> (0);
27785 in_first_function_p
= false;
27786 maybe_at_text_label_p
= false;
27789 /* Temporary holder for dwarf2out_register_main_translation_unit. Used to let
27790 front-ends register a translation unit even before dwarf2out_init is
27792 static tree main_translation_unit
= NULL_TREE
;
27794 /* Hook called by front-ends after they built their main translation unit.
27795 Associate comp_unit_die to UNIT. */
27798 dwarf2out_register_main_translation_unit (tree unit
)
27800 gcc_assert (TREE_CODE (unit
) == TRANSLATION_UNIT_DECL
27801 && main_translation_unit
== NULL_TREE
);
27802 main_translation_unit
= unit
;
27803 /* If dwarf2out_init has not been called yet, it will perform the association
27804 itself looking at main_translation_unit. */
27805 if (decl_die_table
!= NULL
)
27806 equate_decl_number_to_die (unit
, comp_unit_die ());
27809 /* Add OPCODE+VAL as an entry at the end of the opcode array in TABLE. */
27812 push_dw_line_info_entry (dw_line_info_table
*table
,
27813 enum dw_line_info_opcode opcode
, unsigned int val
)
27815 dw_line_info_entry e
;
27818 vec_safe_push (table
->entries
, e
);
27821 /* Output a label to mark the beginning of a source code line entry
27822 and record information relating to this source line, in
27823 'line_info_table' for later output of the .debug_line section. */
27824 /* ??? The discriminator parameter ought to be unsigned. */
27827 dwarf2out_source_line (unsigned int line
, unsigned int column
,
27828 const char *filename
,
27829 int discriminator
, bool is_stmt
)
27831 unsigned int file_num
;
27832 dw_line_info_table
*table
;
27833 static var_loc_view lvugid
;
27835 if (debug_info_level
< DINFO_LEVEL_TERSE
)
27838 table
= cur_line_info_table
;
27842 if (debug_variable_location_views
27843 && output_asm_line_debug_info ()
27844 && table
&& !RESETTING_VIEW_P (table
->view
))
27846 /* If we're using the assembler to compute view numbers, we
27847 can't issue a .loc directive for line zero, so we can't
27848 get a view number at this point. We might attempt to
27849 compute it from the previous view, or equate it to a
27850 subsequent view (though it might not be there!), but
27851 since we're omitting the line number entry, we might as
27852 well omit the view number as well. That means pretending
27853 it's a view number zero, which might very well turn out
27854 to be correct. ??? Extend the assembler so that the
27855 compiler could emit e.g. ".locview .LVU#", to output a
27856 view without changing line number information. We'd then
27857 have to count it in symviews_since_reset; when it's omitted,
27858 it doesn't count. */
27860 zero_view_p
= BITMAP_GGC_ALLOC ();
27861 bitmap_set_bit (zero_view_p
, table
->view
);
27862 if (flag_debug_asm
)
27864 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
27865 ASM_GENERATE_INTERNAL_LABEL (label
, "LVU", table
->view
);
27866 fprintf (asm_out_file
, "\t%s line 0, omitted view ",
27867 ASM_COMMENT_START
);
27868 assemble_name (asm_out_file
, label
);
27869 putc ('\n', asm_out_file
);
27871 table
->view
= ++lvugid
;
27876 /* The discriminator column was added in dwarf4. Simplify the below
27877 by simply removing it if we're not supposed to output it. */
27878 if (dwarf_version
< 4 && dwarf_strict
)
27881 if (!debug_column_info
)
27884 file_num
= maybe_emit_file (lookup_filename (filename
));
27886 /* ??? TODO: Elide duplicate line number entries. Traditionally,
27887 the debugger has used the second (possibly duplicate) line number
27888 at the beginning of the function to mark the end of the prologue.
27889 We could eliminate any other duplicates within the function. For
27890 Dwarf3, we ought to include the DW_LNS_set_prologue_end mark in
27891 that second line number entry. */
27892 /* Recall that this end-of-prologue indication is *not* the same thing
27893 as the end_prologue debug hook. The NOTE_INSN_PROLOGUE_END note,
27894 to which the hook corresponds, follows the last insn that was
27895 emitted by gen_prologue. What we need is to precede the first insn
27896 that had been emitted after NOTE_INSN_FUNCTION_BEG, i.e. the first
27897 insn that corresponds to something the user wrote. These may be
27898 very different locations once scheduling is enabled. */
27900 if (0 && file_num
== table
->file_num
27901 && line
== table
->line_num
27902 && column
== table
->column_num
27903 && discriminator
== table
->discrim_num
27904 && is_stmt
== table
->is_stmt
)
27907 switch_to_section (current_function_section ());
27909 /* If requested, emit something human-readable. */
27910 if (flag_debug_asm
)
27912 if (debug_column_info
)
27913 fprintf (asm_out_file
, "\t%s %s:%d:%d\n", ASM_COMMENT_START
,
27914 filename
, line
, column
);
27916 fprintf (asm_out_file
, "\t%s %s:%d\n", ASM_COMMENT_START
,
27920 if (output_asm_line_debug_info ())
27922 /* Emit the .loc directive understood by GNU as. */
27923 /* "\t.loc %u %u 0 is_stmt %u discriminator %u",
27924 file_num, line, is_stmt, discriminator */
27925 fputs ("\t.loc ", asm_out_file
);
27926 fprint_ul (asm_out_file
, file_num
);
27927 putc (' ', asm_out_file
);
27928 fprint_ul (asm_out_file
, line
);
27929 putc (' ', asm_out_file
);
27930 fprint_ul (asm_out_file
, column
);
27932 if (is_stmt
!= table
->is_stmt
)
27934 #if HAVE_GAS_LOC_STMT
27935 fputs (" is_stmt ", asm_out_file
);
27936 putc (is_stmt
? '1' : '0', asm_out_file
);
27939 if (SUPPORTS_DISCRIMINATOR
&& discriminator
!= 0)
27941 gcc_assert (discriminator
> 0);
27942 fputs (" discriminator ", asm_out_file
);
27943 fprint_ul (asm_out_file
, (unsigned long) discriminator
);
27945 if (debug_variable_location_views
)
27947 if (!RESETTING_VIEW_P (table
->view
))
27949 table
->symviews_since_reset
++;
27950 if (table
->symviews_since_reset
> symview_upper_bound
)
27951 symview_upper_bound
= table
->symviews_since_reset
;
27952 /* When we're using the assembler to compute view
27953 numbers, we output symbolic labels after "view" in
27954 .loc directives, and the assembler will set them for
27955 us, so that we can refer to the view numbers in
27956 location lists. The only exceptions are when we know
27957 a view will be zero: "-0" is a forced reset, used
27958 e.g. in the beginning of functions, whereas "0" tells
27959 the assembler to check that there was a PC change
27960 since the previous view, in a way that implicitly
27961 resets the next view. */
27962 fputs (" view ", asm_out_file
);
27963 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
27964 ASM_GENERATE_INTERNAL_LABEL (label
, "LVU", table
->view
);
27965 assemble_name (asm_out_file
, label
);
27966 table
->view
= ++lvugid
;
27970 table
->symviews_since_reset
= 0;
27971 if (FORCE_RESETTING_VIEW_P (table
->view
))
27972 fputs (" view -0", asm_out_file
);
27974 fputs (" view 0", asm_out_file
);
27975 /* Mark the present view as a zero view. Earlier debug
27976 binds may have already added its id to loclists to be
27977 emitted later, so we can't reuse the id for something
27978 else. However, it's good to know whether a view is
27979 known to be zero, because then we may be able to
27980 optimize out locviews that are all zeros, so take
27981 note of it in zero_view_p. */
27983 zero_view_p
= BITMAP_GGC_ALLOC ();
27984 bitmap_set_bit (zero_view_p
, lvugid
);
27985 table
->view
= ++lvugid
;
27988 putc ('\n', asm_out_file
);
27992 unsigned int label_num
= ++line_info_label_num
;
27994 targetm
.asm_out
.internal_label (asm_out_file
, LINE_CODE_LABEL
, label_num
);
27996 if (debug_variable_location_views
&& !RESETTING_VIEW_P (table
->view
))
27997 push_dw_line_info_entry (table
, LI_adv_address
, label_num
);
27999 push_dw_line_info_entry (table
, LI_set_address
, label_num
);
28000 if (debug_variable_location_views
)
28002 bool resetting
= FORCE_RESETTING_VIEW_P (table
->view
);
28006 if (flag_debug_asm
)
28007 fprintf (asm_out_file
, "\t%s view %s%d\n",
28009 resetting
? "-" : "",
28014 if (file_num
!= table
->file_num
)
28015 push_dw_line_info_entry (table
, LI_set_file
, file_num
);
28016 if (discriminator
!= table
->discrim_num
)
28017 push_dw_line_info_entry (table
, LI_set_discriminator
, discriminator
);
28018 if (is_stmt
!= table
->is_stmt
)
28019 push_dw_line_info_entry (table
, LI_negate_stmt
, 0);
28020 push_dw_line_info_entry (table
, LI_set_line
, line
);
28021 if (debug_column_info
)
28022 push_dw_line_info_entry (table
, LI_set_column
, column
);
28025 table
->file_num
= file_num
;
28026 table
->line_num
= line
;
28027 table
->column_num
= column
;
28028 table
->discrim_num
= discriminator
;
28029 table
->is_stmt
= is_stmt
;
28030 table
->in_use
= true;
28033 /* Record the beginning of a new source file. */
28036 dwarf2out_start_source_file (unsigned int lineno
, const char *filename
)
28038 if (debug_info_level
>= DINFO_LEVEL_VERBOSE
)
28041 e
.code
= DW_MACINFO_start_file
;
28043 e
.info
= ggc_strdup (filename
);
28044 vec_safe_push (macinfo_table
, e
);
28048 /* Record the end of a source file. */
28051 dwarf2out_end_source_file (unsigned int lineno ATTRIBUTE_UNUSED
)
28053 if (debug_info_level
>= DINFO_LEVEL_VERBOSE
)
28056 e
.code
= DW_MACINFO_end_file
;
28059 vec_safe_push (macinfo_table
, e
);
28063 /* Called from debug_define in toplev.c. The `buffer' parameter contains
28064 the tail part of the directive line, i.e. the part which is past the
28065 initial whitespace, #, whitespace, directive-name, whitespace part. */
28068 dwarf2out_define (unsigned int lineno ATTRIBUTE_UNUSED
,
28069 const char *buffer ATTRIBUTE_UNUSED
)
28071 if (debug_info_level
>= DINFO_LEVEL_VERBOSE
)
28074 /* Insert a dummy first entry to be able to optimize the whole
28075 predefined macro block using DW_MACRO_import. */
28076 if (macinfo_table
->is_empty () && lineno
<= 1)
28081 vec_safe_push (macinfo_table
, e
);
28083 e
.code
= DW_MACINFO_define
;
28085 e
.info
= ggc_strdup (buffer
);
28086 vec_safe_push (macinfo_table
, e
);
28090 /* Called from debug_undef in toplev.c. The `buffer' parameter contains
28091 the tail part of the directive line, i.e. the part which is past the
28092 initial whitespace, #, whitespace, directive-name, whitespace part. */
28095 dwarf2out_undef (unsigned int lineno ATTRIBUTE_UNUSED
,
28096 const char *buffer ATTRIBUTE_UNUSED
)
28098 if (debug_info_level
>= DINFO_LEVEL_VERBOSE
)
28101 /* Insert a dummy first entry to be able to optimize the whole
28102 predefined macro block using DW_MACRO_import. */
28103 if (macinfo_table
->is_empty () && lineno
<= 1)
28108 vec_safe_push (macinfo_table
, e
);
28110 e
.code
= DW_MACINFO_undef
;
28112 e
.info
= ggc_strdup (buffer
);
28113 vec_safe_push (macinfo_table
, e
);
28117 /* Helpers to manipulate hash table of CUs. */
28119 struct macinfo_entry_hasher
: nofree_ptr_hash
<macinfo_entry
>
28121 static inline hashval_t
hash (const macinfo_entry
*);
28122 static inline bool equal (const macinfo_entry
*, const macinfo_entry
*);
28126 macinfo_entry_hasher::hash (const macinfo_entry
*entry
)
28128 return htab_hash_string (entry
->info
);
28132 macinfo_entry_hasher::equal (const macinfo_entry
*entry1
,
28133 const macinfo_entry
*entry2
)
28135 return !strcmp (entry1
->info
, entry2
->info
);
28138 typedef hash_table
<macinfo_entry_hasher
> macinfo_hash_type
;
28140 /* Output a single .debug_macinfo entry. */
28143 output_macinfo_op (macinfo_entry
*ref
)
28147 struct indirect_string_node
*node
;
28148 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
28149 struct dwarf_file_data
*fd
;
28153 case DW_MACINFO_start_file
:
28154 fd
= lookup_filename (ref
->info
);
28155 file_num
= maybe_emit_file (fd
);
28156 dw2_asm_output_data (1, DW_MACINFO_start_file
, "Start new file");
28157 dw2_asm_output_data_uleb128 (ref
->lineno
,
28158 "Included from line number %lu",
28159 (unsigned long) ref
->lineno
);
28160 dw2_asm_output_data_uleb128 (file_num
, "file %s", ref
->info
);
28162 case DW_MACINFO_end_file
:
28163 dw2_asm_output_data (1, DW_MACINFO_end_file
, "End file");
28165 case DW_MACINFO_define
:
28166 case DW_MACINFO_undef
:
28167 len
= strlen (ref
->info
) + 1;
28169 && len
> DWARF_OFFSET_SIZE
28170 && !DWARF2_INDIRECT_STRING_SUPPORT_MISSING_ON_TARGET
28171 && (debug_str_section
->common
.flags
& SECTION_MERGE
) != 0)
28173 ref
->code
= ref
->code
== DW_MACINFO_define
28174 ? DW_MACRO_define_strp
: DW_MACRO_undef_strp
;
28175 output_macinfo_op (ref
);
28178 dw2_asm_output_data (1, ref
->code
,
28179 ref
->code
== DW_MACINFO_define
28180 ? "Define macro" : "Undefine macro");
28181 dw2_asm_output_data_uleb128 (ref
->lineno
, "At line number %lu",
28182 (unsigned long) ref
->lineno
);
28183 dw2_asm_output_nstring (ref
->info
, -1, "The macro");
28185 case DW_MACRO_define_strp
:
28186 case DW_MACRO_undef_strp
:
28187 /* NB: dwarf2out_finish performs:
28188 1. save_macinfo_strings
28189 2. hash table traverse of index_string
28190 3. output_macinfo -> output_macinfo_op
28191 4. output_indirect_strings
28192 -> hash table traverse of output_index_string
28194 When output_macinfo_op is called, all index strings have been
28195 added to hash table by save_macinfo_strings and we can't pass
28196 INSERT to find_slot_with_hash which may expand hash table, even
28197 if no insertion is needed, and change hash table traverse order
28198 between index_string and output_index_string. */
28199 node
= find_AT_string (ref
->info
, NO_INSERT
);
28201 && (node
->form
== DW_FORM_strp
28202 || node
->form
== dwarf_FORM (DW_FORM_strx
)));
28203 dw2_asm_output_data (1, ref
->code
,
28204 ref
->code
== DW_MACRO_define_strp
28205 ? "Define macro strp"
28206 : "Undefine macro strp");
28207 dw2_asm_output_data_uleb128 (ref
->lineno
, "At line number %lu",
28208 (unsigned long) ref
->lineno
);
28209 if (node
->form
== DW_FORM_strp
)
28210 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, node
->label
,
28211 debug_str_section
, "The macro: \"%s\"",
28214 dw2_asm_output_data_uleb128 (node
->index
, "The macro: \"%s\"",
28217 case DW_MACRO_import
:
28218 dw2_asm_output_data (1, ref
->code
, "Import");
28219 ASM_GENERATE_INTERNAL_LABEL (label
,
28220 DEBUG_MACRO_SECTION_LABEL
,
28221 ref
->lineno
+ macinfo_label_base
);
28222 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, label
, NULL
, NULL
);
28225 fprintf (asm_out_file
, "%s unrecognized macinfo code %lu\n",
28226 ASM_COMMENT_START
, (unsigned long) ref
->code
);
28231 /* Attempt to make a sequence of define/undef macinfo ops shareable with
28232 other compilation unit .debug_macinfo sections. IDX is the first
28233 index of a define/undef, return the number of ops that should be
28234 emitted in a comdat .debug_macinfo section and emit
28235 a DW_MACRO_import entry referencing it.
28236 If the define/undef entry should be emitted normally, return 0. */
28239 optimize_macinfo_range (unsigned int idx
, vec
<macinfo_entry
, va_gc
> *files
,
28240 macinfo_hash_type
**macinfo_htab
)
28242 macinfo_entry
*first
, *second
, *cur
, *inc
;
28243 char linebuf
[sizeof (HOST_WIDE_INT
) * 3 + 1];
28244 unsigned char checksum
[16];
28245 struct md5_ctx ctx
;
28246 char *grp_name
, *tail
;
28248 unsigned int i
, count
, encoded_filename_len
, linebuf_len
;
28249 macinfo_entry
**slot
;
28251 first
= &(*macinfo_table
)[idx
];
28252 second
= &(*macinfo_table
)[idx
+ 1];
28254 /* Optimize only if there are at least two consecutive define/undef ops,
28255 and either all of them are before first DW_MACINFO_start_file
28256 with lineno {0,1} (i.e. predefined macro block), or all of them are
28257 in some included header file. */
28258 if (second
->code
!= DW_MACINFO_define
&& second
->code
!= DW_MACINFO_undef
)
28260 if (vec_safe_is_empty (files
))
28262 if (first
->lineno
> 1 || second
->lineno
> 1)
28265 else if (first
->lineno
== 0)
28268 /* Find the last define/undef entry that can be grouped together
28269 with first and at the same time compute md5 checksum of their
28270 codes, linenumbers and strings. */
28271 md5_init_ctx (&ctx
);
28272 for (i
= idx
; macinfo_table
->iterate (i
, &cur
); i
++)
28273 if (cur
->code
!= DW_MACINFO_define
&& cur
->code
!= DW_MACINFO_undef
)
28275 else if (vec_safe_is_empty (files
) && cur
->lineno
> 1)
28279 unsigned char code
= cur
->code
;
28280 md5_process_bytes (&code
, 1, &ctx
);
28281 checksum_uleb128 (cur
->lineno
, &ctx
);
28282 md5_process_bytes (cur
->info
, strlen (cur
->info
) + 1, &ctx
);
28284 md5_finish_ctx (&ctx
, checksum
);
28287 /* From the containing include filename (if any) pick up just
28288 usable characters from its basename. */
28289 if (vec_safe_is_empty (files
))
28292 base
= lbasename (files
->last ().info
);
28293 for (encoded_filename_len
= 0, i
= 0; base
[i
]; i
++)
28294 if (ISIDNUM (base
[i
]) || base
[i
] == '.')
28295 encoded_filename_len
++;
28296 /* Count . at the end. */
28297 if (encoded_filename_len
)
28298 encoded_filename_len
++;
28300 sprintf (linebuf
, HOST_WIDE_INT_PRINT_UNSIGNED
, first
->lineno
);
28301 linebuf_len
= strlen (linebuf
);
28303 /* The group name format is: wmN.[<encoded filename>.]<lineno>.<md5sum> */
28304 grp_name
= XALLOCAVEC (char, 4 + encoded_filename_len
+ linebuf_len
+ 1
28306 memcpy (grp_name
, DWARF_OFFSET_SIZE
== 4 ? "wm4." : "wm8.", 4);
28307 tail
= grp_name
+ 4;
28308 if (encoded_filename_len
)
28310 for (i
= 0; base
[i
]; i
++)
28311 if (ISIDNUM (base
[i
]) || base
[i
] == '.')
28315 memcpy (tail
, linebuf
, linebuf_len
);
28316 tail
+= linebuf_len
;
28318 for (i
= 0; i
< 16; i
++)
28319 sprintf (tail
+ i
* 2, "%02x", checksum
[i
] & 0xff);
28321 /* Construct a macinfo_entry for DW_MACRO_import
28322 in the empty vector entry before the first define/undef. */
28323 inc
= &(*macinfo_table
)[idx
- 1];
28324 inc
->code
= DW_MACRO_import
;
28326 inc
->info
= ggc_strdup (grp_name
);
28327 if (!*macinfo_htab
)
28328 *macinfo_htab
= new macinfo_hash_type (10);
28329 /* Avoid emitting duplicates. */
28330 slot
= (*macinfo_htab
)->find_slot (inc
, INSERT
);
28335 /* If such an entry has been used before, just emit
28336 a DW_MACRO_import op. */
28338 output_macinfo_op (inc
);
28339 /* And clear all macinfo_entry in the range to avoid emitting them
28340 in the second pass. */
28341 for (i
= idx
; macinfo_table
->iterate (i
, &cur
) && i
< idx
+ count
; i
++)
28350 inc
->lineno
= (*macinfo_htab
)->elements ();
28351 output_macinfo_op (inc
);
28356 /* Save any strings needed by the macinfo table in the debug str
28357 table. All strings must be collected into the table by the time
28358 index_string is called. */
28361 save_macinfo_strings (void)
28365 macinfo_entry
*ref
;
28367 for (i
= 0; macinfo_table
&& macinfo_table
->iterate (i
, &ref
); i
++)
28371 /* Match the logic in output_macinfo_op to decide on
28372 indirect strings. */
28373 case DW_MACINFO_define
:
28374 case DW_MACINFO_undef
:
28375 len
= strlen (ref
->info
) + 1;
28377 && len
> DWARF_OFFSET_SIZE
28378 && !DWARF2_INDIRECT_STRING_SUPPORT_MISSING_ON_TARGET
28379 && (debug_str_section
->common
.flags
& SECTION_MERGE
) != 0)
28380 set_indirect_string (find_AT_string (ref
->info
));
28382 case DW_MACINFO_start_file
:
28383 /* -gsplit-dwarf -g3 will also output filename as indirect
28385 if (!dwarf_split_debug_info
)
28387 /* Fall through. */
28388 case DW_MACRO_define_strp
:
28389 case DW_MACRO_undef_strp
:
28390 set_indirect_string (find_AT_string (ref
->info
));
28398 /* Output macinfo section(s). */
28401 output_macinfo (const char *debug_line_label
, bool early_lto_debug
)
28404 unsigned long length
= vec_safe_length (macinfo_table
);
28405 macinfo_entry
*ref
;
28406 vec
<macinfo_entry
, va_gc
> *files
= NULL
;
28407 macinfo_hash_type
*macinfo_htab
= NULL
;
28408 char dl_section_ref
[MAX_ARTIFICIAL_LABEL_BYTES
];
28413 /* output_macinfo* uses these interchangeably. */
28414 gcc_assert ((int) DW_MACINFO_define
== (int) DW_MACRO_define
28415 && (int) DW_MACINFO_undef
== (int) DW_MACRO_undef
28416 && (int) DW_MACINFO_start_file
== (int) DW_MACRO_start_file
28417 && (int) DW_MACINFO_end_file
== (int) DW_MACRO_end_file
);
28419 /* AIX Assembler inserts the length, so adjust the reference to match the
28420 offset expected by debuggers. */
28421 strcpy (dl_section_ref
, debug_line_label
);
28422 if (XCOFF_DEBUGGING_INFO
)
28423 strcat (dl_section_ref
, DWARF_INITIAL_LENGTH_SIZE_STR
);
28425 /* For .debug_macro emit the section header. */
28426 if (!dwarf_strict
|| dwarf_version
>= 5)
28428 dw2_asm_output_data (2, dwarf_version
>= 5 ? 5 : 4,
28429 "DWARF macro version number");
28430 if (DWARF_OFFSET_SIZE
== 8)
28431 dw2_asm_output_data (1, 3, "Flags: 64-bit, lineptr present");
28433 dw2_asm_output_data (1, 2, "Flags: 32-bit, lineptr present");
28434 dw2_asm_output_offset (DWARF_OFFSET_SIZE
, debug_line_label
,
28435 debug_line_section
, NULL
);
28438 /* In the first loop, it emits the primary .debug_macinfo section
28439 and after each emitted op the macinfo_entry is cleared.
28440 If a longer range of define/undef ops can be optimized using
28441 DW_MACRO_import, the DW_MACRO_import op is emitted and kept in
28442 the vector before the first define/undef in the range and the
28443 whole range of define/undef ops is not emitted and kept. */
28444 for (i
= 0; macinfo_table
->iterate (i
, &ref
); i
++)
28448 case DW_MACINFO_start_file
:
28449 vec_safe_push (files
, *ref
);
28451 case DW_MACINFO_end_file
:
28452 if (!vec_safe_is_empty (files
))
28455 case DW_MACINFO_define
:
28456 case DW_MACINFO_undef
:
28457 if ((!dwarf_strict
|| dwarf_version
>= 5)
28458 && HAVE_COMDAT_GROUP
28459 && vec_safe_length (files
) != 1
28462 && (*macinfo_table
)[i
- 1].code
== 0)
28464 unsigned count
= optimize_macinfo_range (i
, files
, &macinfo_htab
);
28473 /* A dummy entry may be inserted at the beginning to be able
28474 to optimize the whole block of predefined macros. */
28480 output_macinfo_op (ref
);
28488 /* Save the number of transparent includes so we can adjust the
28489 label number for the fat LTO object DWARF. */
28490 unsigned macinfo_label_base_adj
= macinfo_htab
->elements ();
28492 delete macinfo_htab
;
28493 macinfo_htab
= NULL
;
28495 /* If any DW_MACRO_import were used, on those DW_MACRO_import entries
28496 terminate the current chain and switch to a new comdat .debug_macinfo
28497 section and emit the define/undef entries within it. */
28498 for (i
= 0; macinfo_table
->iterate (i
, &ref
); i
++)
28503 case DW_MACRO_import
:
28505 char label
[MAX_ARTIFICIAL_LABEL_BYTES
];
28506 tree comdat_key
= get_identifier (ref
->info
);
28507 /* Terminate the previous .debug_macinfo section. */
28508 dw2_asm_output_data (1, 0, "End compilation unit");
28509 targetm
.asm_out
.named_section (debug_macinfo_section_name
,
28513 ? SECTION_EXCLUDE
: 0),
28515 ASM_GENERATE_INTERNAL_LABEL (label
,
28516 DEBUG_MACRO_SECTION_LABEL
,
28517 ref
->lineno
+ macinfo_label_base
);
28518 ASM_OUTPUT_LABEL (asm_out_file
, label
);
28521 dw2_asm_output_data (2, dwarf_version
>= 5 ? 5 : 4,
28522 "DWARF macro version number");
28523 if (DWARF_OFFSET_SIZE
== 8)
28524 dw2_asm_output_data (1, 1, "Flags: 64-bit");
28526 dw2_asm_output_data (1, 0, "Flags: 32-bit");
28529 case DW_MACINFO_define
:
28530 case DW_MACINFO_undef
:
28531 output_macinfo_op (ref
);
28536 gcc_unreachable ();
28539 macinfo_label_base
+= macinfo_label_base_adj
;
28542 /* Initialize the various sections and labels for dwarf output and prefix
28543 them with PREFIX if non-NULL. Returns the generation (zero based
28544 number of times function was called). */
28547 init_sections_and_labels (bool early_lto_debug
)
28549 /* As we may get called multiple times have a generation count for
28551 static unsigned generation
= 0;
28553 if (early_lto_debug
)
28555 if (!dwarf_split_debug_info
)
28557 debug_info_section
= get_section (DEBUG_LTO_INFO_SECTION
,
28558 SECTION_DEBUG
| SECTION_EXCLUDE
,
28560 debug_abbrev_section
= get_section (DEBUG_LTO_ABBREV_SECTION
,
28561 SECTION_DEBUG
| SECTION_EXCLUDE
,
28563 debug_macinfo_section_name
28564 = ((dwarf_strict
&& dwarf_version
< 5)
28565 ? DEBUG_LTO_MACINFO_SECTION
: DEBUG_LTO_MACRO_SECTION
);
28566 debug_macinfo_section
= get_section (debug_macinfo_section_name
,
28568 | SECTION_EXCLUDE
, NULL
);
28572 /* ??? Which of the following do we need early? */
28573 debug_info_section
= get_section (DEBUG_LTO_DWO_INFO_SECTION
,
28574 SECTION_DEBUG
| SECTION_EXCLUDE
,
28576 debug_abbrev_section
= get_section (DEBUG_LTO_DWO_ABBREV_SECTION
,
28577 SECTION_DEBUG
| SECTION_EXCLUDE
,
28579 debug_skeleton_info_section
= get_section (DEBUG_LTO_INFO_SECTION
,
28581 | SECTION_EXCLUDE
, NULL
);
28582 debug_skeleton_abbrev_section
28583 = get_section (DEBUG_LTO_ABBREV_SECTION
,
28584 SECTION_DEBUG
| SECTION_EXCLUDE
, NULL
);
28585 ASM_GENERATE_INTERNAL_LABEL (debug_skeleton_abbrev_section_label
,
28586 DEBUG_SKELETON_ABBREV_SECTION_LABEL
,
28589 /* Somewhat confusing detail: The skeleton_[abbrev|info] sections
28590 stay in the main .o, but the skeleton_line goes into the split
28592 debug_skeleton_line_section
28593 = get_section (DEBUG_LTO_LINE_SECTION
,
28594 SECTION_DEBUG
| SECTION_EXCLUDE
, NULL
);
28595 ASM_GENERATE_INTERNAL_LABEL (debug_skeleton_line_section_label
,
28596 DEBUG_SKELETON_LINE_SECTION_LABEL
,
28598 debug_str_offsets_section
28599 = get_section (DEBUG_LTO_DWO_STR_OFFSETS_SECTION
,
28600 SECTION_DEBUG
| SECTION_EXCLUDE
,
28602 ASM_GENERATE_INTERNAL_LABEL (debug_skeleton_info_section_label
,
28603 DEBUG_SKELETON_INFO_SECTION_LABEL
,
28605 debug_str_dwo_section
= get_section (DEBUG_LTO_STR_DWO_SECTION
,
28606 DEBUG_STR_DWO_SECTION_FLAGS
,
28608 debug_macinfo_section_name
28609 = ((dwarf_strict
&& dwarf_version
< 5)
28610 ? DEBUG_LTO_DWO_MACINFO_SECTION
: DEBUG_LTO_DWO_MACRO_SECTION
);
28611 debug_macinfo_section
= get_section (debug_macinfo_section_name
,
28612 SECTION_DEBUG
| SECTION_EXCLUDE
,
28615 /* For macro info and the file table we have to refer to a
28616 debug_line section. */
28617 debug_line_section
= get_section (DEBUG_LTO_LINE_SECTION
,
28618 SECTION_DEBUG
| SECTION_EXCLUDE
, NULL
);
28619 ASM_GENERATE_INTERNAL_LABEL (debug_line_section_label
,
28620 DEBUG_LINE_SECTION_LABEL
, generation
);
28622 debug_str_section
= get_section (DEBUG_LTO_STR_SECTION
,
28623 DEBUG_STR_SECTION_FLAGS
28624 | SECTION_EXCLUDE
, NULL
);
28625 if (!dwarf_split_debug_info
)
28626 debug_line_str_section
28627 = get_section (DEBUG_LTO_LINE_STR_SECTION
,
28628 DEBUG_STR_SECTION_FLAGS
| SECTION_EXCLUDE
, NULL
);
28632 if (!dwarf_split_debug_info
)
28634 debug_info_section
= get_section (DEBUG_INFO_SECTION
,
28635 SECTION_DEBUG
, NULL
);
28636 debug_abbrev_section
= get_section (DEBUG_ABBREV_SECTION
,
28637 SECTION_DEBUG
, NULL
);
28638 debug_loc_section
= get_section (dwarf_version
>= 5
28639 ? DEBUG_LOCLISTS_SECTION
28640 : DEBUG_LOC_SECTION
,
28641 SECTION_DEBUG
, NULL
);
28642 debug_macinfo_section_name
28643 = ((dwarf_strict
&& dwarf_version
< 5)
28644 ? DEBUG_MACINFO_SECTION
: DEBUG_MACRO_SECTION
);
28645 debug_macinfo_section
= get_section (debug_macinfo_section_name
,
28646 SECTION_DEBUG
, NULL
);
28650 debug_info_section
= get_section (DEBUG_DWO_INFO_SECTION
,
28651 SECTION_DEBUG
| SECTION_EXCLUDE
,
28653 debug_abbrev_section
= get_section (DEBUG_DWO_ABBREV_SECTION
,
28654 SECTION_DEBUG
| SECTION_EXCLUDE
,
28656 debug_addr_section
= get_section (DEBUG_ADDR_SECTION
,
28657 SECTION_DEBUG
, NULL
);
28658 debug_skeleton_info_section
= get_section (DEBUG_INFO_SECTION
,
28659 SECTION_DEBUG
, NULL
);
28660 debug_skeleton_abbrev_section
= get_section (DEBUG_ABBREV_SECTION
,
28661 SECTION_DEBUG
, NULL
);
28662 ASM_GENERATE_INTERNAL_LABEL (debug_skeleton_abbrev_section_label
,
28663 DEBUG_SKELETON_ABBREV_SECTION_LABEL
,
28666 /* Somewhat confusing detail: The skeleton_[abbrev|info] sections
28667 stay in the main .o, but the skeleton_line goes into the
28669 debug_skeleton_line_section
28670 = get_section (DEBUG_DWO_LINE_SECTION
,
28671 SECTION_DEBUG
| SECTION_EXCLUDE
, NULL
);
28672 ASM_GENERATE_INTERNAL_LABEL (debug_skeleton_line_section_label
,
28673 DEBUG_SKELETON_LINE_SECTION_LABEL
,
28675 debug_str_offsets_section
28676 = get_section (DEBUG_DWO_STR_OFFSETS_SECTION
,
28677 SECTION_DEBUG
| SECTION_EXCLUDE
, NULL
);
28678 ASM_GENERATE_INTERNAL_LABEL (debug_skeleton_info_section_label
,
28679 DEBUG_SKELETON_INFO_SECTION_LABEL
,
28681 debug_loc_section
= get_section (dwarf_version
>= 5
28682 ? DEBUG_DWO_LOCLISTS_SECTION
28683 : DEBUG_DWO_LOC_SECTION
,
28684 SECTION_DEBUG
| SECTION_EXCLUDE
,
28686 debug_str_dwo_section
= get_section (DEBUG_STR_DWO_SECTION
,
28687 DEBUG_STR_DWO_SECTION_FLAGS
,
28689 debug_macinfo_section_name
28690 = ((dwarf_strict
&& dwarf_version
< 5)
28691 ? DEBUG_DWO_MACINFO_SECTION
: DEBUG_DWO_MACRO_SECTION
);
28692 debug_macinfo_section
= get_section (debug_macinfo_section_name
,
28693 SECTION_DEBUG
| SECTION_EXCLUDE
,
28696 debug_aranges_section
= get_section (DEBUG_ARANGES_SECTION
,
28697 SECTION_DEBUG
, NULL
);
28698 debug_line_section
= get_section (DEBUG_LINE_SECTION
,
28699 SECTION_DEBUG
, NULL
);
28700 debug_pubnames_section
= get_section (DEBUG_PUBNAMES_SECTION
,
28701 SECTION_DEBUG
, NULL
);
28702 debug_pubtypes_section
= get_section (DEBUG_PUBTYPES_SECTION
,
28703 SECTION_DEBUG
, NULL
);
28704 debug_str_section
= get_section (DEBUG_STR_SECTION
,
28705 DEBUG_STR_SECTION_FLAGS
, NULL
);
28706 if (!dwarf_split_debug_info
&& !output_asm_line_debug_info ())
28707 debug_line_str_section
= get_section (DEBUG_LINE_STR_SECTION
,
28708 DEBUG_STR_SECTION_FLAGS
, NULL
);
28710 debug_ranges_section
= get_section (dwarf_version
>= 5
28711 ? DEBUG_RNGLISTS_SECTION
28712 : DEBUG_RANGES_SECTION
,
28713 SECTION_DEBUG
, NULL
);
28714 debug_frame_section
= get_section (DEBUG_FRAME_SECTION
,
28715 SECTION_DEBUG
, NULL
);
28718 ASM_GENERATE_INTERNAL_LABEL (abbrev_section_label
,
28719 DEBUG_ABBREV_SECTION_LABEL
, generation
);
28720 ASM_GENERATE_INTERNAL_LABEL (debug_info_section_label
,
28721 DEBUG_INFO_SECTION_LABEL
, generation
);
28722 info_section_emitted
= false;
28723 ASM_GENERATE_INTERNAL_LABEL (debug_line_section_label
,
28724 DEBUG_LINE_SECTION_LABEL
, generation
);
28725 /* There are up to 4 unique ranges labels per generation.
28726 See also output_rnglists. */
28727 ASM_GENERATE_INTERNAL_LABEL (ranges_section_label
,
28728 DEBUG_RANGES_SECTION_LABEL
, generation
* 4);
28729 if (dwarf_version
>= 5 && dwarf_split_debug_info
)
28730 ASM_GENERATE_INTERNAL_LABEL (ranges_base_label
,
28731 DEBUG_RANGES_SECTION_LABEL
,
28732 1 + generation
* 4);
28733 ASM_GENERATE_INTERNAL_LABEL (debug_addr_section_label
,
28734 DEBUG_ADDR_SECTION_LABEL
, generation
);
28735 ASM_GENERATE_INTERNAL_LABEL (macinfo_section_label
,
28736 (dwarf_strict
&& dwarf_version
< 5)
28737 ? DEBUG_MACINFO_SECTION_LABEL
28738 : DEBUG_MACRO_SECTION_LABEL
, generation
);
28739 ASM_GENERATE_INTERNAL_LABEL (loc_section_label
, DEBUG_LOC_SECTION_LABEL
,
28743 return generation
- 1;
28746 /* Set up for Dwarf output at the start of compilation. */
28749 dwarf2out_init (const char *filename ATTRIBUTE_UNUSED
)
28751 /* Allocate the file_table. */
28752 file_table
= hash_table
<dwarf_file_hasher
>::create_ggc (50);
28754 #ifndef DWARF2_LINENO_DEBUGGING_INFO
28755 /* Allocate the decl_die_table. */
28756 decl_die_table
= hash_table
<decl_die_hasher
>::create_ggc (10);
28758 /* Allocate the decl_loc_table. */
28759 decl_loc_table
= hash_table
<decl_loc_hasher
>::create_ggc (10);
28761 /* Allocate the cached_dw_loc_list_table. */
28762 cached_dw_loc_list_table
= hash_table
<dw_loc_list_hasher
>::create_ggc (10);
28764 /* Allocate the initial hunk of the abbrev_die_table. */
28765 vec_alloc (abbrev_die_table
, 256);
28766 /* Zero-th entry is allocated, but unused. */
28767 abbrev_die_table
->quick_push (NULL
);
28769 /* Allocate the dwarf_proc_stack_usage_map. */
28770 dwarf_proc_stack_usage_map
= new hash_map
<dw_die_ref
, int>;
28772 /* Allocate the pubtypes and pubnames vectors. */
28773 vec_alloc (pubname_table
, 32);
28774 vec_alloc (pubtype_table
, 32);
28776 vec_alloc (incomplete_types
, 64);
28778 vec_alloc (used_rtx_array
, 32);
28780 if (debug_info_level
>= DINFO_LEVEL_VERBOSE
)
28781 vec_alloc (macinfo_table
, 64);
28784 /* If front-ends already registered a main translation unit but we were not
28785 ready to perform the association, do this now. */
28786 if (main_translation_unit
!= NULL_TREE
)
28787 equate_decl_number_to_die (main_translation_unit
, comp_unit_die ());
28790 /* Called before compile () starts outputtting functions, variables
28791 and toplevel asms into assembly. */
28794 dwarf2out_assembly_start (void)
28796 if (text_section_line_info
)
28799 #ifndef DWARF2_LINENO_DEBUGGING_INFO
28800 ASM_GENERATE_INTERNAL_LABEL (text_section_label
, TEXT_SECTION_LABEL
, 0);
28801 ASM_GENERATE_INTERNAL_LABEL (text_end_label
, TEXT_END_LABEL
, 0);
28802 ASM_GENERATE_INTERNAL_LABEL (cold_text_section_label
,
28803 COLD_TEXT_SECTION_LABEL
, 0);
28804 ASM_GENERATE_INTERNAL_LABEL (cold_end_label
, COLD_END_LABEL
, 0);
28806 switch_to_section (text_section
);
28807 ASM_OUTPUT_LABEL (asm_out_file
, text_section_label
);
28810 /* Make sure the line number table for .text always exists. */
28811 text_section_line_info
= new_line_info_table ();
28812 text_section_line_info
->end_label
= text_end_label
;
28814 #ifdef DWARF2_LINENO_DEBUGGING_INFO
28815 cur_line_info_table
= text_section_line_info
;
28818 if (HAVE_GAS_CFI_SECTIONS_DIRECTIVE
28819 && dwarf2out_do_cfi_asm ()
28820 && !dwarf2out_do_eh_frame ())
28821 fprintf (asm_out_file
, "\t.cfi_sections\t.debug_frame\n");
28824 /* A helper function for dwarf2out_finish called through
28825 htab_traverse. Assign a string its index. All strings must be
28826 collected into the table by the time index_string is called,
28827 because the indexing code relies on htab_traverse to traverse nodes
28828 in the same order for each run. */
28831 index_string (indirect_string_node
**h
, unsigned int *index
)
28833 indirect_string_node
*node
= *h
;
28835 find_string_form (node
);
28836 if (node
->form
== dwarf_FORM (DW_FORM_strx
) && node
->refcount
> 0)
28838 gcc_assert (node
->index
== NO_INDEX_ASSIGNED
);
28839 node
->index
= *index
;
28845 /* A helper function for output_indirect_strings called through
28846 htab_traverse. Output the offset to a string and update the
28850 output_index_string_offset (indirect_string_node
**h
, unsigned int *offset
)
28852 indirect_string_node
*node
= *h
;
28854 if (node
->form
== dwarf_FORM (DW_FORM_strx
) && node
->refcount
> 0)
28856 /* Assert that this node has been assigned an index. */
28857 gcc_assert (node
->index
!= NO_INDEX_ASSIGNED
28858 && node
->index
!= NOT_INDEXED
);
28859 dw2_asm_output_data (DWARF_OFFSET_SIZE
, *offset
,
28860 "indexed string 0x%x: %s", node
->index
, node
->str
);
28861 *offset
+= strlen (node
->str
) + 1;
28866 /* A helper function for dwarf2out_finish called through
28867 htab_traverse. Output the indexed string. */
28870 output_index_string (indirect_string_node
**h
, unsigned int *cur_idx
)
28872 struct indirect_string_node
*node
= *h
;
28874 if (node
->form
== dwarf_FORM (DW_FORM_strx
) && node
->refcount
> 0)
28876 /* Assert that the strings are output in the same order as their
28877 indexes were assigned. */
28878 gcc_assert (*cur_idx
== node
->index
);
28879 assemble_string (node
->str
, strlen (node
->str
) + 1);
28885 /* A helper function for output_indirect_strings. Counts the number
28886 of index strings offsets. Must match the logic of the functions
28887 output_index_string[_offsets] above. */
28889 count_index_strings (indirect_string_node
**h
, unsigned int *last_idx
)
28891 struct indirect_string_node
*node
= *h
;
28893 if (node
->form
== dwarf_FORM (DW_FORM_strx
) && node
->refcount
> 0)
28898 /* A helper function for dwarf2out_finish called through
28899 htab_traverse. Emit one queued .debug_str string. */
28902 output_indirect_string (indirect_string_node
**h
, enum dwarf_form form
)
28904 struct indirect_string_node
*node
= *h
;
28906 node
->form
= find_string_form (node
);
28907 if (node
->form
== form
&& node
->refcount
> 0)
28909 ASM_OUTPUT_LABEL (asm_out_file
, node
->label
);
28910 assemble_string (node
->str
, strlen (node
->str
) + 1);
28916 /* Output the indexed string table. */
28919 output_indirect_strings (void)
28921 switch_to_section (debug_str_section
);
28922 if (!dwarf_split_debug_info
)
28923 debug_str_hash
->traverse
<enum dwarf_form
,
28924 output_indirect_string
> (DW_FORM_strp
);
28927 unsigned int offset
= 0;
28928 unsigned int cur_idx
= 0;
28930 if (skeleton_debug_str_hash
)
28931 skeleton_debug_str_hash
->traverse
<enum dwarf_form
,
28932 output_indirect_string
> (DW_FORM_strp
);
28934 switch_to_section (debug_str_offsets_section
);
28935 /* For DWARF5 the .debug_str_offsets[.dwo] section needs a unit
28936 header. Note that we don't need to generate a label to the
28937 actual index table following the header here, because this is
28938 for the split dwarf case only. In an .dwo file there is only
28939 one string offsets table (and one debug info section). But
28940 if we would start using string offset tables for the main (or
28941 skeleton) unit, then we have to add a DW_AT_str_offsets_base
28942 pointing to the actual index after the header. Split dwarf
28943 units will never have a string offsets base attribute. When
28944 a split unit is moved into a .dwp file the string offsets can
28945 be found through the .debug_cu_index section table. */
28946 if (dwarf_version
>= 5)
28948 unsigned int last_idx
= 0;
28949 unsigned long str_offsets_length
;
28951 debug_str_hash
->traverse_noresize
28952 <unsigned int *, count_index_strings
> (&last_idx
);
28953 str_offsets_length
= last_idx
* DWARF_OFFSET_SIZE
+ 4;
28954 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4)
28955 dw2_asm_output_data (4, 0xffffffff,
28956 "Escape value for 64-bit DWARF extension");
28957 dw2_asm_output_data (DWARF_OFFSET_SIZE
, str_offsets_length
,
28958 "Length of string offsets unit");
28959 dw2_asm_output_data (2, 5, "DWARF string offsets version");
28960 dw2_asm_output_data (2, 0, "Header zero padding");
28962 debug_str_hash
->traverse_noresize
28963 <unsigned int *, output_index_string_offset
> (&offset
);
28964 switch_to_section (debug_str_dwo_section
);
28965 debug_str_hash
->traverse_noresize
<unsigned int *, output_index_string
>
28970 /* Callback for htab_traverse to assign an index to an entry in the
28971 table, and to write that entry to the .debug_addr section. */
28974 output_addr_table_entry (addr_table_entry
**slot
, unsigned int *cur_index
)
28976 addr_table_entry
*entry
= *slot
;
28978 if (entry
->refcount
== 0)
28980 gcc_assert (entry
->index
== NO_INDEX_ASSIGNED
28981 || entry
->index
== NOT_INDEXED
);
28985 gcc_assert (entry
->index
== *cur_index
);
28988 switch (entry
->kind
)
28991 dw2_asm_output_addr_rtx (DWARF2_ADDR_SIZE
, entry
->addr
.rtl
,
28992 "0x%x", entry
->index
);
28994 case ate_kind_rtx_dtprel
:
28995 gcc_assert (targetm
.asm_out
.output_dwarf_dtprel
);
28996 targetm
.asm_out
.output_dwarf_dtprel (asm_out_file
,
28999 fputc ('\n', asm_out_file
);
29001 case ate_kind_label
:
29002 dw2_asm_output_addr (DWARF2_ADDR_SIZE
, entry
->addr
.label
,
29003 "0x%x", entry
->index
);
29006 gcc_unreachable ();
29011 /* A helper function for dwarf2out_finish. Counts the number
29012 of indexed addresses. Must match the logic of the functions
29013 output_addr_table_entry above. */
29015 count_index_addrs (addr_table_entry
**slot
, unsigned int *last_idx
)
29017 addr_table_entry
*entry
= *slot
;
29019 if (entry
->refcount
> 0)
29024 /* Produce the .debug_addr section. */
29027 output_addr_table (void)
29029 unsigned int index
= 0;
29030 if (addr_index_table
== NULL
|| addr_index_table
->size () == 0)
29033 switch_to_section (debug_addr_section
);
29034 /* GNU DebugFission https://gcc.gnu.org/wiki/DebugFission
29035 which GCC uses to implement -gsplit-dwarf as DWARF GNU extension
29036 before DWARF5, didn't have a header for .debug_addr units.
29037 DWARF5 specifies a small header when address tables are used. */
29038 if (dwarf_version
>= 5)
29040 unsigned int last_idx
= 0;
29041 unsigned long addrs_length
;
29043 addr_index_table
->traverse_noresize
29044 <unsigned int *, count_index_addrs
> (&last_idx
);
29045 addrs_length
= last_idx
* DWARF2_ADDR_SIZE
+ 4;
29047 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4)
29048 dw2_asm_output_data (4, 0xffffffff,
29049 "Escape value for 64-bit DWARF extension");
29050 dw2_asm_output_data (DWARF_OFFSET_SIZE
, addrs_length
,
29051 "Length of Address Unit");
29052 dw2_asm_output_data (2, 5, "DWARF addr version");
29053 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "Size of Address");
29054 dw2_asm_output_data (1, 0, "Size of Segment Descriptor");
29056 ASM_OUTPUT_LABEL (asm_out_file
, debug_addr_section_label
);
29059 ->traverse_noresize
<unsigned int *, output_addr_table_entry
> (&index
);
29062 #if ENABLE_ASSERT_CHECKING
29063 /* Verify that all marks are clear. */
29066 verify_marks_clear (dw_die_ref die
)
29070 gcc_assert (! die
->die_mark
);
29071 FOR_EACH_CHILD (die
, c
, verify_marks_clear (c
));
29073 #endif /* ENABLE_ASSERT_CHECKING */
29075 /* Clear the marks for a die and its children.
29076 Be cool if the mark isn't set. */
29079 prune_unmark_dies (dw_die_ref die
)
29085 FOR_EACH_CHILD (die
, c
, prune_unmark_dies (c
));
29088 /* Given LOC that is referenced by a DIE we're marking as used, find all
29089 referenced DWARF procedures it references and mark them as used. */
29092 prune_unused_types_walk_loc_descr (dw_loc_descr_ref loc
)
29094 for (; loc
!= NULL
; loc
= loc
->dw_loc_next
)
29095 switch (loc
->dw_loc_opc
)
29097 case DW_OP_implicit_pointer
:
29098 case DW_OP_convert
:
29099 case DW_OP_reinterpret
:
29100 case DW_OP_GNU_implicit_pointer
:
29101 case DW_OP_GNU_convert
:
29102 case DW_OP_GNU_reinterpret
:
29103 if (loc
->dw_loc_oprnd1
.val_class
== dw_val_class_die_ref
)
29104 prune_unused_types_mark (loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
, 1);
29106 case DW_OP_GNU_variable_value
:
29107 if (loc
->dw_loc_oprnd1
.val_class
== dw_val_class_decl_ref
)
29110 = lookup_decl_die (loc
->dw_loc_oprnd1
.v
.val_decl_ref
);
29113 loc
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
29114 loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
29115 loc
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
29120 case DW_OP_call_ref
:
29121 case DW_OP_const_type
:
29122 case DW_OP_GNU_const_type
:
29123 case DW_OP_GNU_parameter_ref
:
29124 gcc_assert (loc
->dw_loc_oprnd1
.val_class
== dw_val_class_die_ref
);
29125 prune_unused_types_mark (loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
, 1);
29127 case DW_OP_regval_type
:
29128 case DW_OP_deref_type
:
29129 case DW_OP_GNU_regval_type
:
29130 case DW_OP_GNU_deref_type
:
29131 gcc_assert (loc
->dw_loc_oprnd2
.val_class
== dw_val_class_die_ref
);
29132 prune_unused_types_mark (loc
->dw_loc_oprnd2
.v
.val_die_ref
.die
, 1);
29134 case DW_OP_entry_value
:
29135 case DW_OP_GNU_entry_value
:
29136 gcc_assert (loc
->dw_loc_oprnd1
.val_class
== dw_val_class_loc
);
29137 prune_unused_types_walk_loc_descr (loc
->dw_loc_oprnd1
.v
.val_loc
);
29144 /* Given DIE that we're marking as used, find any other dies
29145 it references as attributes and mark them as used. */
29148 prune_unused_types_walk_attribs (dw_die_ref die
)
29153 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
29155 switch (AT_class (a
))
29157 /* Make sure DWARF procedures referenced by location descriptions will
29159 case dw_val_class_loc
:
29160 prune_unused_types_walk_loc_descr (AT_loc (a
));
29162 case dw_val_class_loc_list
:
29163 for (dw_loc_list_ref list
= AT_loc_list (a
);
29165 list
= list
->dw_loc_next
)
29166 prune_unused_types_walk_loc_descr (list
->expr
);
29169 case dw_val_class_view_list
:
29170 /* This points to a loc_list in another attribute, so it's
29171 already covered. */
29174 case dw_val_class_die_ref
:
29175 /* A reference to another DIE.
29176 Make sure that it will get emitted.
29177 If it was broken out into a comdat group, don't follow it. */
29178 if (! AT_ref (a
)->comdat_type_p
29179 || a
->dw_attr
== DW_AT_specification
)
29180 prune_unused_types_mark (a
->dw_attr_val
.v
.val_die_ref
.die
, 1);
29183 case dw_val_class_str
:
29184 /* Set the string's refcount to 0 so that prune_unused_types_mark
29185 accounts properly for it. */
29186 a
->dw_attr_val
.v
.val_str
->refcount
= 0;
29195 /* Mark the generic parameters and arguments children DIEs of DIE. */
29198 prune_unused_types_mark_generic_parms_dies (dw_die_ref die
)
29202 if (die
== NULL
|| die
->die_child
== NULL
)
29204 c
= die
->die_child
;
29207 if (is_template_parameter (c
))
29208 prune_unused_types_mark (c
, 1);
29210 } while (c
&& c
!= die
->die_child
);
29213 /* Mark DIE as being used. If DOKIDS is true, then walk down
29214 to DIE's children. */
29217 prune_unused_types_mark (dw_die_ref die
, int dokids
)
29221 if (die
->die_mark
== 0)
29223 /* We haven't done this node yet. Mark it as used. */
29225 /* If this is the DIE of a generic type instantiation,
29226 mark the children DIEs that describe its generic parms and
29228 prune_unused_types_mark_generic_parms_dies (die
);
29230 /* We also have to mark its parents as used.
29231 (But we don't want to mark our parent's kids due to this,
29232 unless it is a class.) */
29233 if (die
->die_parent
)
29234 prune_unused_types_mark (die
->die_parent
,
29235 class_scope_p (die
->die_parent
));
29237 /* Mark any referenced nodes. */
29238 prune_unused_types_walk_attribs (die
);
29240 /* If this node is a specification,
29241 also mark the definition, if it exists. */
29242 if (get_AT_flag (die
, DW_AT_declaration
) && die
->die_definition
)
29243 prune_unused_types_mark (die
->die_definition
, 1);
29246 if (dokids
&& die
->die_mark
!= 2)
29248 /* We need to walk the children, but haven't done so yet.
29249 Remember that we've walked the kids. */
29252 /* If this is an array type, we need to make sure our
29253 kids get marked, even if they're types. If we're
29254 breaking out types into comdat sections, do this
29255 for all type definitions. */
29256 if (die
->die_tag
== DW_TAG_array_type
29257 || (use_debug_types
29258 && is_type_die (die
) && ! is_declaration_die (die
)))
29259 FOR_EACH_CHILD (die
, c
, prune_unused_types_mark (c
, 1));
29261 FOR_EACH_CHILD (die
, c
, prune_unused_types_walk (c
));
29265 /* For local classes, look if any static member functions were emitted
29266 and if so, mark them. */
29269 prune_unused_types_walk_local_classes (dw_die_ref die
)
29273 if (die
->die_mark
== 2)
29276 switch (die
->die_tag
)
29278 case DW_TAG_structure_type
:
29279 case DW_TAG_union_type
:
29280 case DW_TAG_class_type
:
29281 case DW_TAG_interface_type
:
29284 case DW_TAG_subprogram
:
29285 if (!get_AT_flag (die
, DW_AT_declaration
)
29286 || die
->die_definition
!= NULL
)
29287 prune_unused_types_mark (die
, 1);
29294 /* Mark children. */
29295 FOR_EACH_CHILD (die
, c
, prune_unused_types_walk_local_classes (c
));
29298 /* Walk the tree DIE and mark types that we actually use. */
29301 prune_unused_types_walk (dw_die_ref die
)
29305 /* Don't do anything if this node is already marked and
29306 children have been marked as well. */
29307 if (die
->die_mark
== 2)
29310 switch (die
->die_tag
)
29312 case DW_TAG_structure_type
:
29313 case DW_TAG_union_type
:
29314 case DW_TAG_class_type
:
29315 case DW_TAG_interface_type
:
29316 if (die
->die_perennial_p
)
29319 for (c
= die
->die_parent
; c
; c
= c
->die_parent
)
29320 if (c
->die_tag
== DW_TAG_subprogram
)
29323 /* Finding used static member functions inside of classes
29324 is needed just for local classes, because for other classes
29325 static member function DIEs with DW_AT_specification
29326 are emitted outside of the DW_TAG_*_type. If we ever change
29327 it, we'd need to call this even for non-local classes. */
29329 prune_unused_types_walk_local_classes (die
);
29331 /* It's a type node --- don't mark it. */
29334 case DW_TAG_const_type
:
29335 case DW_TAG_packed_type
:
29336 case DW_TAG_pointer_type
:
29337 case DW_TAG_reference_type
:
29338 case DW_TAG_rvalue_reference_type
:
29339 case DW_TAG_volatile_type
:
29340 case DW_TAG_typedef
:
29341 case DW_TAG_array_type
:
29342 case DW_TAG_friend
:
29343 case DW_TAG_enumeration_type
:
29344 case DW_TAG_subroutine_type
:
29345 case DW_TAG_string_type
:
29346 case DW_TAG_set_type
:
29347 case DW_TAG_subrange_type
:
29348 case DW_TAG_ptr_to_member_type
:
29349 case DW_TAG_file_type
:
29350 /* Type nodes are useful only when other DIEs reference them --- don't
29354 case DW_TAG_dwarf_procedure
:
29355 /* Likewise for DWARF procedures. */
29357 if (die
->die_perennial_p
)
29362 case DW_TAG_variable
:
29363 if (flag_debug_only_used_symbols
)
29365 if (die
->die_perennial_p
)
29368 /* premark_used_variables marks external variables --- don't mark
29369 them here. But function-local externals are always considered
29371 if (get_AT (die
, DW_AT_external
))
29373 for (c
= die
->die_parent
; c
; c
= c
->die_parent
)
29374 if (c
->die_tag
== DW_TAG_subprogram
)
29383 /* Mark everything else. */
29387 if (die
->die_mark
== 0)
29391 /* Now, mark any dies referenced from here. */
29392 prune_unused_types_walk_attribs (die
);
29397 /* Mark children. */
29398 FOR_EACH_CHILD (die
, c
, prune_unused_types_walk (c
));
29401 /* Increment the string counts on strings referred to from DIE's
29405 prune_unused_types_update_strings (dw_die_ref die
)
29410 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
29411 if (AT_class (a
) == dw_val_class_str
)
29413 struct indirect_string_node
*s
= a
->dw_attr_val
.v
.val_str
;
29415 /* Avoid unnecessarily putting strings that are used less than
29416 twice in the hash table. */
29418 == ((DEBUG_STR_SECTION_FLAGS
& SECTION_MERGE
) ? 1 : 2))
29420 indirect_string_node
**slot
29421 = debug_str_hash
->find_slot_with_hash (s
->str
,
29422 htab_hash_string (s
->str
),
29424 gcc_assert (*slot
== NULL
);
29430 /* Mark DIE and its children as removed. */
29433 mark_removed (dw_die_ref die
)
29436 die
->removed
= true;
29437 FOR_EACH_CHILD (die
, c
, mark_removed (c
));
29440 /* Remove from the tree DIE any dies that aren't marked. */
29443 prune_unused_types_prune (dw_die_ref die
)
29447 gcc_assert (die
->die_mark
);
29448 prune_unused_types_update_strings (die
);
29450 if (! die
->die_child
)
29453 c
= die
->die_child
;
29455 dw_die_ref prev
= c
, next
;
29456 for (c
= c
->die_sib
; ! c
->die_mark
; c
= next
)
29457 if (c
== die
->die_child
)
29459 /* No marked children between 'prev' and the end of the list. */
29461 /* No marked children at all. */
29462 die
->die_child
= NULL
;
29465 prev
->die_sib
= c
->die_sib
;
29466 die
->die_child
= prev
;
29479 if (c
!= prev
->die_sib
)
29481 prune_unused_types_prune (c
);
29482 } while (c
!= die
->die_child
);
29485 /* Remove dies representing declarations that we never use. */
29488 prune_unused_types (void)
29491 limbo_die_node
*node
;
29492 comdat_type_node
*ctnode
;
29493 pubname_entry
*pub
;
29494 dw_die_ref base_type
;
29496 #if ENABLE_ASSERT_CHECKING
29497 /* All the marks should already be clear. */
29498 verify_marks_clear (comp_unit_die ());
29499 for (node
= limbo_die_list
; node
; node
= node
->next
)
29500 verify_marks_clear (node
->die
);
29501 for (ctnode
= comdat_type_list
; ctnode
; ctnode
= ctnode
->next
)
29502 verify_marks_clear (ctnode
->root_die
);
29503 #endif /* ENABLE_ASSERT_CHECKING */
29505 /* Mark types that are used in global variables. */
29506 premark_types_used_by_global_vars ();
29508 /* Mark variables used in the symtab. */
29509 if (flag_debug_only_used_symbols
)
29510 premark_used_variables ();
29512 /* Set the mark on nodes that are actually used. */
29513 prune_unused_types_walk (comp_unit_die ());
29514 for (node
= limbo_die_list
; node
; node
= node
->next
)
29515 prune_unused_types_walk (node
->die
);
29516 for (ctnode
= comdat_type_list
; ctnode
; ctnode
= ctnode
->next
)
29518 prune_unused_types_walk (ctnode
->root_die
);
29519 prune_unused_types_mark (ctnode
->type_die
, 1);
29522 /* Also set the mark on nodes referenced from the pubname_table. Enumerators
29523 are unusual in that they are pubnames that are the children of pubtypes.
29524 They should only be marked via their parent DW_TAG_enumeration_type die,
29525 not as roots in themselves. */
29526 FOR_EACH_VEC_ELT (*pubname_table
, i
, pub
)
29527 if (pub
->die
->die_tag
!= DW_TAG_enumerator
)
29528 prune_unused_types_mark (pub
->die
, 1);
29529 for (i
= 0; base_types
.iterate (i
, &base_type
); i
++)
29530 prune_unused_types_mark (base_type
, 1);
29532 /* For -fvar-tracking-assignments, also set the mark on nodes that could be
29533 referenced by DW_TAG_call_site DW_AT_call_origin (i.e. direct call
29535 cgraph_node
*cnode
;
29536 FOR_EACH_FUNCTION (cnode
)
29537 if (cnode
->referred_to_p (false))
29539 dw_die_ref die
= lookup_decl_die (cnode
->decl
);
29540 if (die
== NULL
|| die
->die_mark
)
29542 for (cgraph_edge
*e
= cnode
->callers
; e
; e
= e
->next_caller
)
29543 if (e
->caller
!= cnode
29544 && opt_for_fn (e
->caller
->decl
, flag_var_tracking_assignments
))
29546 prune_unused_types_mark (die
, 1);
29551 if (debug_str_hash
)
29552 debug_str_hash
->empty ();
29553 if (skeleton_debug_str_hash
)
29554 skeleton_debug_str_hash
->empty ();
29555 prune_unused_types_prune (comp_unit_die ());
29556 for (limbo_die_node
**pnode
= &limbo_die_list
; *pnode
; )
29559 if (!node
->die
->die_mark
)
29560 *pnode
= node
->next
;
29563 prune_unused_types_prune (node
->die
);
29564 pnode
= &node
->next
;
29567 for (ctnode
= comdat_type_list
; ctnode
; ctnode
= ctnode
->next
)
29568 prune_unused_types_prune (ctnode
->root_die
);
29570 /* Leave the marks clear. */
29571 prune_unmark_dies (comp_unit_die ());
29572 for (node
= limbo_die_list
; node
; node
= node
->next
)
29573 prune_unmark_dies (node
->die
);
29574 for (ctnode
= comdat_type_list
; ctnode
; ctnode
= ctnode
->next
)
29575 prune_unmark_dies (ctnode
->root_die
);
29578 /* Helpers to manipulate hash table of comdat type units. */
29580 struct comdat_type_hasher
: nofree_ptr_hash
<comdat_type_node
>
29582 static inline hashval_t
hash (const comdat_type_node
*);
29583 static inline bool equal (const comdat_type_node
*, const comdat_type_node
*);
29587 comdat_type_hasher::hash (const comdat_type_node
*type_node
)
29590 memcpy (&h
, type_node
->signature
, sizeof (h
));
29595 comdat_type_hasher::equal (const comdat_type_node
*type_node_1
,
29596 const comdat_type_node
*type_node_2
)
29598 return (! memcmp (type_node_1
->signature
, type_node_2
->signature
,
29599 DWARF_TYPE_SIGNATURE_SIZE
));
29602 /* Move a DW_AT_{,MIPS_}linkage_name attribute just added to dw_die_ref
29603 to the location it would have been added, should we know its
29604 DECL_ASSEMBLER_NAME when we added other attributes. This will
29605 probably improve compactness of debug info, removing equivalent
29606 abbrevs, and hide any differences caused by deferring the
29607 computation of the assembler name, triggered by e.g. PCH. */
29610 move_linkage_attr (dw_die_ref die
)
29612 unsigned ix
= vec_safe_length (die
->die_attr
);
29613 dw_attr_node linkage
= (*die
->die_attr
)[ix
- 1];
29615 gcc_assert (linkage
.dw_attr
== DW_AT_linkage_name
29616 || linkage
.dw_attr
== DW_AT_MIPS_linkage_name
);
29620 dw_attr_node
*prev
= &(*die
->die_attr
)[ix
- 1];
29622 if (prev
->dw_attr
== DW_AT_decl_line
29623 || prev
->dw_attr
== DW_AT_decl_column
29624 || prev
->dw_attr
== DW_AT_name
)
29628 if (ix
!= vec_safe_length (die
->die_attr
) - 1)
29630 die
->die_attr
->pop ();
29631 die
->die_attr
->quick_insert (ix
, linkage
);
29635 /* Helper function for resolve_addr, mark DW_TAG_base_type nodes
29636 referenced from typed stack ops and count how often they are used. */
29639 mark_base_types (dw_loc_descr_ref loc
)
29641 dw_die_ref base_type
= NULL
;
29643 for (; loc
; loc
= loc
->dw_loc_next
)
29645 switch (loc
->dw_loc_opc
)
29647 case DW_OP_regval_type
:
29648 case DW_OP_deref_type
:
29649 case DW_OP_GNU_regval_type
:
29650 case DW_OP_GNU_deref_type
:
29651 base_type
= loc
->dw_loc_oprnd2
.v
.val_die_ref
.die
;
29653 case DW_OP_convert
:
29654 case DW_OP_reinterpret
:
29655 case DW_OP_GNU_convert
:
29656 case DW_OP_GNU_reinterpret
:
29657 if (loc
->dw_loc_oprnd1
.val_class
== dw_val_class_unsigned_const
)
29660 case DW_OP_const_type
:
29661 case DW_OP_GNU_const_type
:
29662 base_type
= loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
;
29664 case DW_OP_entry_value
:
29665 case DW_OP_GNU_entry_value
:
29666 mark_base_types (loc
->dw_loc_oprnd1
.v
.val_loc
);
29671 gcc_assert (base_type
->die_parent
== comp_unit_die ());
29672 if (base_type
->die_mark
)
29673 base_type
->die_mark
++;
29676 base_types
.safe_push (base_type
);
29677 base_type
->die_mark
= 1;
29682 /* Comparison function for sorting marked base types. */
29685 base_type_cmp (const void *x
, const void *y
)
29687 dw_die_ref dx
= *(const dw_die_ref
*) x
;
29688 dw_die_ref dy
= *(const dw_die_ref
*) y
;
29689 unsigned int byte_size1
, byte_size2
;
29690 unsigned int encoding1
, encoding2
;
29691 unsigned int align1
, align2
;
29692 if (dx
->die_mark
> dy
->die_mark
)
29694 if (dx
->die_mark
< dy
->die_mark
)
29696 byte_size1
= get_AT_unsigned (dx
, DW_AT_byte_size
);
29697 byte_size2
= get_AT_unsigned (dy
, DW_AT_byte_size
);
29698 if (byte_size1
< byte_size2
)
29700 if (byte_size1
> byte_size2
)
29702 encoding1
= get_AT_unsigned (dx
, DW_AT_encoding
);
29703 encoding2
= get_AT_unsigned (dy
, DW_AT_encoding
);
29704 if (encoding1
< encoding2
)
29706 if (encoding1
> encoding2
)
29708 align1
= get_AT_unsigned (dx
, DW_AT_alignment
);
29709 align2
= get_AT_unsigned (dy
, DW_AT_alignment
);
29710 if (align1
< align2
)
29712 if (align1
> align2
)
29717 /* Move base types marked by mark_base_types as early as possible
29718 in the CU, sorted by decreasing usage count both to make the
29719 uleb128 references as small as possible and to make sure they
29720 will have die_offset already computed by calc_die_sizes when
29721 sizes of typed stack loc ops is computed. */
29724 move_marked_base_types (void)
29727 dw_die_ref base_type
, die
, c
;
29729 if (base_types
.is_empty ())
29732 /* Sort by decreasing usage count, they will be added again in that
29734 base_types
.qsort (base_type_cmp
);
29735 die
= comp_unit_die ();
29736 c
= die
->die_child
;
29739 dw_die_ref prev
= c
;
29741 while (c
->die_mark
)
29743 remove_child_with_prev (c
, prev
);
29744 /* As base types got marked, there must be at least
29745 one node other than DW_TAG_base_type. */
29746 gcc_assert (die
->die_child
!= NULL
);
29750 while (c
!= die
->die_child
);
29751 gcc_assert (die
->die_child
);
29752 c
= die
->die_child
;
29753 for (i
= 0; base_types
.iterate (i
, &base_type
); i
++)
29755 base_type
->die_mark
= 0;
29756 base_type
->die_sib
= c
->die_sib
;
29757 c
->die_sib
= base_type
;
29762 /* Helper function for resolve_addr, attempt to resolve
29763 one CONST_STRING, return true if successful. Similarly verify that
29764 SYMBOL_REFs refer to variables emitted in the current CU. */
29767 resolve_one_addr (rtx
*addr
)
29771 if (GET_CODE (rtl
) == CONST_STRING
)
29773 size_t len
= strlen (XSTR (rtl
, 0)) + 1;
29774 tree t
= build_string (len
, XSTR (rtl
, 0));
29775 tree tlen
= size_int (len
- 1);
29777 = build_array_type (char_type_node
, build_index_type (tlen
));
29778 rtl
= lookup_constant_def (t
);
29779 if (!rtl
|| !MEM_P (rtl
))
29781 rtl
= XEXP (rtl
, 0);
29782 if (GET_CODE (rtl
) == SYMBOL_REF
29783 && SYMBOL_REF_DECL (rtl
)
29784 && !TREE_ASM_WRITTEN (SYMBOL_REF_DECL (rtl
)))
29786 vec_safe_push (used_rtx_array
, rtl
);
29791 if (GET_CODE (rtl
) == SYMBOL_REF
29792 && SYMBOL_REF_DECL (rtl
))
29794 if (TREE_CONSTANT_POOL_ADDRESS_P (rtl
))
29796 if (!TREE_ASM_WRITTEN (DECL_INITIAL (SYMBOL_REF_DECL (rtl
))))
29799 else if (!TREE_ASM_WRITTEN (SYMBOL_REF_DECL (rtl
)))
29803 if (GET_CODE (rtl
) == CONST
)
29805 subrtx_ptr_iterator::array_type array
;
29806 FOR_EACH_SUBRTX_PTR (iter
, array
, &XEXP (rtl
, 0), ALL
)
29807 if (!resolve_one_addr (*iter
))
29814 /* For STRING_CST, return SYMBOL_REF of its constant pool entry,
29815 if possible, and create DW_TAG_dwarf_procedure that can be referenced
29816 from DW_OP_implicit_pointer if the string hasn't been seen yet. */
29819 string_cst_pool_decl (tree t
)
29821 rtx rtl
= output_constant_def (t
, 1);
29822 unsigned char *array
;
29823 dw_loc_descr_ref l
;
29828 if (!rtl
|| !MEM_P (rtl
))
29830 rtl
= XEXP (rtl
, 0);
29831 if (GET_CODE (rtl
) != SYMBOL_REF
29832 || SYMBOL_REF_DECL (rtl
) == NULL_TREE
)
29835 decl
= SYMBOL_REF_DECL (rtl
);
29836 if (!lookup_decl_die (decl
))
29838 len
= TREE_STRING_LENGTH (t
);
29839 vec_safe_push (used_rtx_array
, rtl
);
29840 ref
= new_die (DW_TAG_dwarf_procedure
, comp_unit_die (), decl
);
29841 array
= ggc_vec_alloc
<unsigned char> (len
);
29842 memcpy (array
, TREE_STRING_POINTER (t
), len
);
29843 l
= new_loc_descr (DW_OP_implicit_value
, len
, 0);
29844 l
->dw_loc_oprnd2
.val_class
= dw_val_class_vec
;
29845 l
->dw_loc_oprnd2
.v
.val_vec
.length
= len
;
29846 l
->dw_loc_oprnd2
.v
.val_vec
.elt_size
= 1;
29847 l
->dw_loc_oprnd2
.v
.val_vec
.array
= array
;
29848 add_AT_loc (ref
, DW_AT_location
, l
);
29849 equate_decl_number_to_die (decl
, ref
);
29854 /* Helper function of resolve_addr_in_expr. LOC is
29855 a DW_OP_addr followed by DW_OP_stack_value, either at the start
29856 of exprloc or after DW_OP_{,bit_}piece, and val_addr can't be
29857 resolved. Replace it (both DW_OP_addr and DW_OP_stack_value)
29858 with DW_OP_implicit_pointer if possible
29859 and return true, if unsuccessful, return false. */
29862 optimize_one_addr_into_implicit_ptr (dw_loc_descr_ref loc
)
29864 rtx rtl
= loc
->dw_loc_oprnd1
.v
.val_addr
;
29865 HOST_WIDE_INT offset
= 0;
29866 dw_die_ref ref
= NULL
;
29869 if (GET_CODE (rtl
) == CONST
29870 && GET_CODE (XEXP (rtl
, 0)) == PLUS
29871 && CONST_INT_P (XEXP (XEXP (rtl
, 0), 1)))
29873 offset
= INTVAL (XEXP (XEXP (rtl
, 0), 1));
29874 rtl
= XEXP (XEXP (rtl
, 0), 0);
29876 if (GET_CODE (rtl
) == CONST_STRING
)
29878 size_t len
= strlen (XSTR (rtl
, 0)) + 1;
29879 tree t
= build_string (len
, XSTR (rtl
, 0));
29880 tree tlen
= size_int (len
- 1);
29883 = build_array_type (char_type_node
, build_index_type (tlen
));
29884 rtl
= string_cst_pool_decl (t
);
29888 if (GET_CODE (rtl
) == SYMBOL_REF
&& SYMBOL_REF_DECL (rtl
))
29890 decl
= SYMBOL_REF_DECL (rtl
);
29891 if (VAR_P (decl
) && !DECL_EXTERNAL (decl
))
29893 ref
= lookup_decl_die (decl
);
29894 if (ref
&& (get_AT (ref
, DW_AT_location
)
29895 || get_AT (ref
, DW_AT_const_value
)))
29897 loc
->dw_loc_opc
= dwarf_OP (DW_OP_implicit_pointer
);
29898 loc
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
29899 loc
->dw_loc_oprnd1
.val_entry
= NULL
;
29900 loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
29901 loc
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
29902 loc
->dw_loc_next
= loc
->dw_loc_next
->dw_loc_next
;
29903 loc
->dw_loc_oprnd2
.v
.val_int
= offset
;
29911 /* Helper function for resolve_addr, handle one location
29912 expression, return false if at least one CONST_STRING or SYMBOL_REF in
29913 the location list couldn't be resolved. */
29916 resolve_addr_in_expr (dw_attr_node
*a
, dw_loc_descr_ref loc
)
29918 dw_loc_descr_ref keep
= NULL
;
29919 for (dw_loc_descr_ref prev
= NULL
; loc
; prev
= loc
, loc
= loc
->dw_loc_next
)
29920 switch (loc
->dw_loc_opc
)
29923 if (!resolve_one_addr (&loc
->dw_loc_oprnd1
.v
.val_addr
))
29926 || prev
->dw_loc_opc
== DW_OP_piece
29927 || prev
->dw_loc_opc
== DW_OP_bit_piece
)
29928 && loc
->dw_loc_next
29929 && loc
->dw_loc_next
->dw_loc_opc
== DW_OP_stack_value
29930 && (!dwarf_strict
|| dwarf_version
>= 5)
29931 && optimize_one_addr_into_implicit_ptr (loc
))
29936 case DW_OP_GNU_addr_index
:
29938 case DW_OP_GNU_const_index
:
29940 if ((loc
->dw_loc_opc
== DW_OP_GNU_addr_index
29941 || loc
->dw_loc_opc
== DW_OP_addrx
)
29942 || ((loc
->dw_loc_opc
== DW_OP_GNU_const_index
29943 || loc
->dw_loc_opc
== DW_OP_constx
)
29946 rtx rtl
= loc
->dw_loc_oprnd1
.val_entry
->addr
.rtl
;
29947 if (!resolve_one_addr (&rtl
))
29949 remove_addr_table_entry (loc
->dw_loc_oprnd1
.val_entry
);
29950 loc
->dw_loc_oprnd1
.val_entry
29951 = add_addr_table_entry (rtl
, ate_kind_rtx
);
29954 case DW_OP_const4u
:
29955 case DW_OP_const8u
:
29957 && !resolve_one_addr (&loc
->dw_loc_oprnd1
.v
.val_addr
))
29960 case DW_OP_plus_uconst
:
29961 if (size_of_loc_descr (loc
)
29962 > size_of_int_loc_descriptor (loc
->dw_loc_oprnd1
.v
.val_unsigned
)
29964 && loc
->dw_loc_oprnd1
.v
.val_unsigned
> 0)
29966 dw_loc_descr_ref repl
29967 = int_loc_descriptor (loc
->dw_loc_oprnd1
.v
.val_unsigned
);
29968 add_loc_descr (&repl
, new_loc_descr (DW_OP_plus
, 0, 0));
29969 add_loc_descr (&repl
, loc
->dw_loc_next
);
29973 case DW_OP_implicit_value
:
29974 if (loc
->dw_loc_oprnd2
.val_class
== dw_val_class_addr
29975 && !resolve_one_addr (&loc
->dw_loc_oprnd2
.v
.val_addr
))
29978 case DW_OP_implicit_pointer
:
29979 case DW_OP_GNU_implicit_pointer
:
29980 case DW_OP_GNU_parameter_ref
:
29981 case DW_OP_GNU_variable_value
:
29982 if (loc
->dw_loc_oprnd1
.val_class
== dw_val_class_decl_ref
)
29985 = lookup_decl_die (loc
->dw_loc_oprnd1
.v
.val_decl_ref
);
29988 loc
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
29989 loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
29990 loc
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
29992 if (loc
->dw_loc_opc
== DW_OP_GNU_variable_value
)
29995 && loc
->dw_loc_next
== NULL
29996 && AT_class (a
) == dw_val_class_loc
)
29997 switch (a
->dw_attr
)
29999 /* Following attributes allow both exprloc and reference,
30000 so if the whole expression is DW_OP_GNU_variable_value
30001 alone we could transform it into reference. */
30002 case DW_AT_byte_size
:
30003 case DW_AT_bit_size
:
30004 case DW_AT_lower_bound
:
30005 case DW_AT_upper_bound
:
30006 case DW_AT_bit_stride
:
30008 case DW_AT_allocated
:
30009 case DW_AT_associated
:
30010 case DW_AT_byte_stride
:
30011 a
->dw_attr_val
.val_class
= dw_val_class_die_ref
;
30012 a
->dw_attr_val
.val_entry
= NULL
;
30013 a
->dw_attr_val
.v
.val_die_ref
.die
30014 = loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
;
30015 a
->dw_attr_val
.v
.val_die_ref
.external
= 0;
30024 case DW_OP_const_type
:
30025 case DW_OP_regval_type
:
30026 case DW_OP_deref_type
:
30027 case DW_OP_convert
:
30028 case DW_OP_reinterpret
:
30029 case DW_OP_GNU_const_type
:
30030 case DW_OP_GNU_regval_type
:
30031 case DW_OP_GNU_deref_type
:
30032 case DW_OP_GNU_convert
:
30033 case DW_OP_GNU_reinterpret
:
30034 while (loc
->dw_loc_next
30035 && (loc
->dw_loc_next
->dw_loc_opc
== DW_OP_convert
30036 || loc
->dw_loc_next
->dw_loc_opc
== DW_OP_GNU_convert
))
30038 dw_die_ref base1
, base2
;
30039 unsigned enc1
, enc2
, size1
, size2
;
30040 if (loc
->dw_loc_opc
== DW_OP_regval_type
30041 || loc
->dw_loc_opc
== DW_OP_deref_type
30042 || loc
->dw_loc_opc
== DW_OP_GNU_regval_type
30043 || loc
->dw_loc_opc
== DW_OP_GNU_deref_type
)
30044 base1
= loc
->dw_loc_oprnd2
.v
.val_die_ref
.die
;
30045 else if (loc
->dw_loc_oprnd1
.val_class
30046 == dw_val_class_unsigned_const
)
30049 base1
= loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
;
30050 if (loc
->dw_loc_next
->dw_loc_oprnd1
.val_class
30051 == dw_val_class_unsigned_const
)
30053 base2
= loc
->dw_loc_next
->dw_loc_oprnd1
.v
.val_die_ref
.die
;
30054 gcc_assert (base1
->die_tag
== DW_TAG_base_type
30055 && base2
->die_tag
== DW_TAG_base_type
);
30056 enc1
= get_AT_unsigned (base1
, DW_AT_encoding
);
30057 enc2
= get_AT_unsigned (base2
, DW_AT_encoding
);
30058 size1
= get_AT_unsigned (base1
, DW_AT_byte_size
);
30059 size2
= get_AT_unsigned (base2
, DW_AT_byte_size
);
30061 && (((enc1
== DW_ATE_unsigned
|| enc1
== DW_ATE_signed
)
30062 && (enc2
== DW_ATE_unsigned
|| enc2
== DW_ATE_signed
)
30066 /* Optimize away next DW_OP_convert after
30067 adjusting LOC's base type die reference. */
30068 if (loc
->dw_loc_opc
== DW_OP_regval_type
30069 || loc
->dw_loc_opc
== DW_OP_deref_type
30070 || loc
->dw_loc_opc
== DW_OP_GNU_regval_type
30071 || loc
->dw_loc_opc
== DW_OP_GNU_deref_type
)
30072 loc
->dw_loc_oprnd2
.v
.val_die_ref
.die
= base2
;
30074 loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
= base2
;
30075 loc
->dw_loc_next
= loc
->dw_loc_next
->dw_loc_next
;
30078 /* Don't change integer DW_OP_convert after e.g. floating
30079 point typed stack entry. */
30080 else if (enc1
!= DW_ATE_unsigned
&& enc1
!= DW_ATE_signed
)
30081 keep
= loc
->dw_loc_next
;
30091 /* Helper function of resolve_addr. DIE had DW_AT_location of
30092 DW_OP_addr alone, which referred to DECL in DW_OP_addr's operand
30093 and DW_OP_addr couldn't be resolved. resolve_addr has already
30094 removed the DW_AT_location attribute. This function attempts to
30095 add a new DW_AT_location attribute with DW_OP_implicit_pointer
30096 to it or DW_AT_const_value attribute, if possible. */
30099 optimize_location_into_implicit_ptr (dw_die_ref die
, tree decl
)
30102 || lookup_decl_die (decl
) != die
30103 || DECL_EXTERNAL (decl
)
30104 || !TREE_STATIC (decl
)
30105 || DECL_INITIAL (decl
) == NULL_TREE
30106 || DECL_P (DECL_INITIAL (decl
))
30107 || get_AT (die
, DW_AT_const_value
))
30110 tree init
= DECL_INITIAL (decl
);
30111 HOST_WIDE_INT offset
= 0;
30112 /* For variables that have been optimized away and thus
30113 don't have a memory location, see if we can emit
30114 DW_AT_const_value instead. */
30115 if (tree_add_const_value_attribute (die
, init
))
30117 if (dwarf_strict
&& dwarf_version
< 5)
30119 /* If init is ADDR_EXPR or POINTER_PLUS_EXPR of ADDR_EXPR,
30120 and ADDR_EXPR refers to a decl that has DW_AT_location or
30121 DW_AT_const_value (but isn't addressable, otherwise
30122 resolving the original DW_OP_addr wouldn't fail), see if
30123 we can add DW_OP_implicit_pointer. */
30125 if (TREE_CODE (init
) == POINTER_PLUS_EXPR
30126 && tree_fits_shwi_p (TREE_OPERAND (init
, 1)))
30128 offset
= tree_to_shwi (TREE_OPERAND (init
, 1));
30129 init
= TREE_OPERAND (init
, 0);
30132 if (TREE_CODE (init
) != ADDR_EXPR
)
30134 if ((TREE_CODE (TREE_OPERAND (init
, 0)) == STRING_CST
30135 && !TREE_ASM_WRITTEN (TREE_OPERAND (init
, 0)))
30136 || (TREE_CODE (TREE_OPERAND (init
, 0)) == VAR_DECL
30137 && !DECL_EXTERNAL (TREE_OPERAND (init
, 0))
30138 && TREE_OPERAND (init
, 0) != decl
))
30141 dw_loc_descr_ref l
;
30143 if (TREE_CODE (TREE_OPERAND (init
, 0)) == STRING_CST
)
30145 rtx rtl
= string_cst_pool_decl (TREE_OPERAND (init
, 0));
30148 decl
= SYMBOL_REF_DECL (rtl
);
30151 decl
= TREE_OPERAND (init
, 0);
30152 ref
= lookup_decl_die (decl
);
30154 || (!get_AT (ref
, DW_AT_location
)
30155 && !get_AT (ref
, DW_AT_const_value
)))
30157 l
= new_loc_descr (dwarf_OP (DW_OP_implicit_pointer
), 0, offset
);
30158 l
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
30159 l
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
30160 l
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
30161 add_AT_loc (die
, DW_AT_location
, l
);
30165 /* Return NULL if l is a DWARF expression, or first op that is not
30166 valid DWARF expression. */
30168 static dw_loc_descr_ref
30169 non_dwarf_expression (dw_loc_descr_ref l
)
30173 if (l
->dw_loc_opc
>= DW_OP_reg0
&& l
->dw_loc_opc
<= DW_OP_reg31
)
30175 switch (l
->dw_loc_opc
)
30178 case DW_OP_implicit_value
:
30179 case DW_OP_stack_value
:
30180 case DW_OP_implicit_pointer
:
30181 case DW_OP_GNU_implicit_pointer
:
30182 case DW_OP_GNU_parameter_ref
:
30184 case DW_OP_bit_piece
:
30189 l
= l
->dw_loc_next
;
30194 /* Return adjusted copy of EXPR:
30195 If it is empty DWARF expression, return it.
30196 If it is valid non-empty DWARF expression,
30197 return copy of EXPR with DW_OP_deref appended to it.
30198 If it is DWARF expression followed by DW_OP_reg{N,x}, return
30199 copy of the DWARF expression with DW_OP_breg{N,x} <0> appended.
30200 If it is DWARF expression followed by DW_OP_stack_value, return
30201 copy of the DWARF expression without anything appended.
30202 Otherwise, return NULL. */
30204 static dw_loc_descr_ref
30205 copy_deref_exprloc (dw_loc_descr_ref expr
)
30207 dw_loc_descr_ref tail
= NULL
;
30212 dw_loc_descr_ref l
= non_dwarf_expression (expr
);
30213 if (l
&& l
->dw_loc_next
)
30218 if (l
->dw_loc_opc
>= DW_OP_reg0
&& l
->dw_loc_opc
<= DW_OP_reg31
)
30219 tail
= new_loc_descr ((enum dwarf_location_atom
)
30220 (DW_OP_breg0
+ (l
->dw_loc_opc
- DW_OP_reg0
)),
30223 switch (l
->dw_loc_opc
)
30226 tail
= new_loc_descr (DW_OP_bregx
,
30227 l
->dw_loc_oprnd1
.v
.val_unsigned
, 0);
30229 case DW_OP_stack_value
:
30236 tail
= new_loc_descr (DW_OP_deref
, 0, 0);
30238 dw_loc_descr_ref ret
= NULL
, *p
= &ret
;
30241 *p
= new_loc_descr (expr
->dw_loc_opc
, 0, 0);
30242 (*p
)->dw_loc_oprnd1
= expr
->dw_loc_oprnd1
;
30243 (*p
)->dw_loc_oprnd2
= expr
->dw_loc_oprnd2
;
30244 p
= &(*p
)->dw_loc_next
;
30245 expr
= expr
->dw_loc_next
;
30251 /* For DW_AT_string_length attribute with DW_OP_GNU_variable_value
30252 reference to a variable or argument, adjust it if needed and return:
30253 -1 if the DW_AT_string_length attribute and DW_AT_{string_length_,}byte_size
30254 attribute if present should be removed
30255 0 keep the attribute perhaps with minor modifications, no need to rescan
30256 1 if the attribute has been successfully adjusted. */
30259 optimize_string_length (dw_attr_node
*a
)
30261 dw_loc_descr_ref l
= AT_loc (a
), lv
;
30263 if (l
->dw_loc_oprnd1
.val_class
== dw_val_class_decl_ref
)
30265 tree decl
= l
->dw_loc_oprnd1
.v
.val_decl_ref
;
30266 die
= lookup_decl_die (decl
);
30269 l
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
30270 l
->dw_loc_oprnd1
.v
.val_die_ref
.die
= die
;
30271 l
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
30277 die
= l
->dw_loc_oprnd1
.v
.val_die_ref
.die
;
30279 /* DWARF5 allows reference class, so we can then reference the DIE.
30280 Only do this for DW_OP_GNU_variable_value DW_OP_stack_value. */
30281 if (l
->dw_loc_next
!= NULL
&& dwarf_version
>= 5)
30283 a
->dw_attr_val
.val_class
= dw_val_class_die_ref
;
30284 a
->dw_attr_val
.val_entry
= NULL
;
30285 a
->dw_attr_val
.v
.val_die_ref
.die
= die
;
30286 a
->dw_attr_val
.v
.val_die_ref
.external
= 0;
30290 dw_attr_node
*av
= get_AT (die
, DW_AT_location
);
30292 bool non_dwarf_expr
= false;
30295 return dwarf_strict
? -1 : 0;
30296 switch (AT_class (av
))
30298 case dw_val_class_loc_list
:
30299 for (d
= AT_loc_list (av
); d
!= NULL
; d
= d
->dw_loc_next
)
30300 if (d
->expr
&& non_dwarf_expression (d
->expr
))
30301 non_dwarf_expr
= true;
30303 case dw_val_class_view_list
:
30304 gcc_unreachable ();
30305 case dw_val_class_loc
:
30308 return dwarf_strict
? -1 : 0;
30309 if (non_dwarf_expression (lv
))
30310 non_dwarf_expr
= true;
30313 return dwarf_strict
? -1 : 0;
30316 /* If it is safe to transform DW_OP_GNU_variable_value DW_OP_stack_value
30317 into DW_OP_call4 or DW_OP_GNU_variable_value into
30318 DW_OP_call4 DW_OP_deref, do so. */
30319 if (!non_dwarf_expr
30320 && (l
->dw_loc_next
!= NULL
|| AT_class (av
) == dw_val_class_loc
))
30322 l
->dw_loc_opc
= DW_OP_call4
;
30323 if (l
->dw_loc_next
)
30324 l
->dw_loc_next
= NULL
;
30326 l
->dw_loc_next
= new_loc_descr (DW_OP_deref
, 0, 0);
30330 /* For DW_OP_GNU_variable_value DW_OP_stack_value, we can just
30331 copy over the DW_AT_location attribute from die to a. */
30332 if (l
->dw_loc_next
!= NULL
)
30334 a
->dw_attr_val
= av
->dw_attr_val
;
30338 dw_loc_list_ref list
, *p
;
30339 switch (AT_class (av
))
30341 case dw_val_class_loc_list
:
30344 for (d
= AT_loc_list (av
); d
!= NULL
; d
= d
->dw_loc_next
)
30346 lv
= copy_deref_exprloc (d
->expr
);
30349 *p
= new_loc_list (lv
, d
->begin
, d
->vbegin
, d
->end
, d
->vend
, d
->section
);
30350 p
= &(*p
)->dw_loc_next
;
30352 else if (!dwarf_strict
&& d
->expr
)
30356 return dwarf_strict
? -1 : 0;
30357 a
->dw_attr_val
.val_class
= dw_val_class_loc_list
;
30359 *AT_loc_list_ptr (a
) = list
;
30361 case dw_val_class_loc
:
30362 lv
= copy_deref_exprloc (AT_loc (av
));
30364 return dwarf_strict
? -1 : 0;
30365 a
->dw_attr_val
.v
.val_loc
= lv
;
30368 gcc_unreachable ();
30372 /* Resolve DW_OP_addr and DW_AT_const_value CONST_STRING arguments to
30373 an address in .rodata section if the string literal is emitted there,
30374 or remove the containing location list or replace DW_AT_const_value
30375 with DW_AT_location and empty location expression, if it isn't found
30376 in .rodata. Similarly for SYMBOL_REFs, keep only those that refer
30377 to something that has been emitted in the current CU. */
30380 resolve_addr (dw_die_ref die
)
30384 dw_loc_list_ref
*curr
, *start
, loc
;
30386 bool remove_AT_byte_size
= false;
30388 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
30389 switch (AT_class (a
))
30391 case dw_val_class_loc_list
:
30392 start
= curr
= AT_loc_list_ptr (a
);
30395 /* The same list can be referenced more than once. See if we have
30396 already recorded the result from a previous pass. */
30398 *curr
= loc
->dw_loc_next
;
30399 else if (!loc
->resolved_addr
)
30401 /* As things stand, we do not expect or allow one die to
30402 reference a suffix of another die's location list chain.
30403 References must be identical or completely separate.
30404 There is therefore no need to cache the result of this
30405 pass on any list other than the first; doing so
30406 would lead to unnecessary writes. */
30409 gcc_assert (!(*curr
)->replaced
&& !(*curr
)->resolved_addr
);
30410 if (!resolve_addr_in_expr (a
, (*curr
)->expr
))
30412 dw_loc_list_ref next
= (*curr
)->dw_loc_next
;
30413 dw_loc_descr_ref l
= (*curr
)->expr
;
30415 if (next
&& (*curr
)->ll_symbol
)
30417 gcc_assert (!next
->ll_symbol
);
30418 next
->ll_symbol
= (*curr
)->ll_symbol
;
30419 next
->vl_symbol
= (*curr
)->vl_symbol
;
30421 if (dwarf_split_debug_info
)
30422 remove_loc_list_addr_table_entries (l
);
30427 mark_base_types ((*curr
)->expr
);
30428 curr
= &(*curr
)->dw_loc_next
;
30432 loc
->resolved_addr
= 1;
30436 loc
->dw_loc_next
= *start
;
30441 remove_AT (die
, a
->dw_attr
);
30445 case dw_val_class_view_list
:
30447 gcc_checking_assert (a
->dw_attr
== DW_AT_GNU_locviews
);
30448 gcc_checking_assert (dwarf2out_locviews_in_attribute ());
30449 dw_val_node
*llnode
30450 = view_list_to_loc_list_val_node (&a
->dw_attr_val
);
30451 /* If we no longer have a loclist, or it no longer needs
30452 views, drop this attribute. */
30453 if (!llnode
|| !llnode
->v
.val_loc_list
->vl_symbol
)
30455 remove_AT (die
, a
->dw_attr
);
30460 case dw_val_class_loc
:
30462 dw_loc_descr_ref l
= AT_loc (a
);
30463 /* DW_OP_GNU_variable_value DW_OP_stack_value or
30464 DW_OP_GNU_variable_value in DW_AT_string_length can be converted
30465 into DW_OP_call4 or DW_OP_call4 DW_OP_deref, which is standard
30466 DWARF4 unlike DW_OP_GNU_variable_value. Or for DWARF5
30467 DW_OP_GNU_variable_value DW_OP_stack_value can be replaced
30468 with DW_FORM_ref referencing the same DIE as
30469 DW_OP_GNU_variable_value used to reference. */
30470 if (a
->dw_attr
== DW_AT_string_length
30472 && l
->dw_loc_opc
== DW_OP_GNU_variable_value
30473 && (l
->dw_loc_next
== NULL
30474 || (l
->dw_loc_next
->dw_loc_next
== NULL
30475 && l
->dw_loc_next
->dw_loc_opc
== DW_OP_stack_value
)))
30477 switch (optimize_string_length (a
))
30480 remove_AT (die
, a
->dw_attr
);
30482 /* If we drop DW_AT_string_length, we need to drop also
30483 DW_AT_{string_length_,}byte_size. */
30484 remove_AT_byte_size
= true;
30489 /* Even if we keep the optimized DW_AT_string_length,
30490 it might have changed AT_class, so process it again. */
30495 /* For -gdwarf-2 don't attempt to optimize
30496 DW_AT_data_member_location containing
30497 DW_OP_plus_uconst - older consumers might
30498 rely on it being that op instead of a more complex,
30499 but shorter, location description. */
30500 if ((dwarf_version
> 2
30501 || a
->dw_attr
!= DW_AT_data_member_location
30503 || l
->dw_loc_opc
!= DW_OP_plus_uconst
30504 || l
->dw_loc_next
!= NULL
)
30505 && !resolve_addr_in_expr (a
, l
))
30507 if (dwarf_split_debug_info
)
30508 remove_loc_list_addr_table_entries (l
);
30510 && l
->dw_loc_next
== NULL
30511 && l
->dw_loc_opc
== DW_OP_addr
30512 && GET_CODE (l
->dw_loc_oprnd1
.v
.val_addr
) == SYMBOL_REF
30513 && SYMBOL_REF_DECL (l
->dw_loc_oprnd1
.v
.val_addr
)
30514 && a
->dw_attr
== DW_AT_location
)
30516 tree decl
= SYMBOL_REF_DECL (l
->dw_loc_oprnd1
.v
.val_addr
);
30517 remove_AT (die
, a
->dw_attr
);
30519 optimize_location_into_implicit_ptr (die
, decl
);
30522 if (a
->dw_attr
== DW_AT_string_length
)
30523 /* If we drop DW_AT_string_length, we need to drop also
30524 DW_AT_{string_length_,}byte_size. */
30525 remove_AT_byte_size
= true;
30526 remove_AT (die
, a
->dw_attr
);
30530 mark_base_types (l
);
30533 case dw_val_class_addr
:
30534 if (a
->dw_attr
== DW_AT_const_value
30535 && !resolve_one_addr (&a
->dw_attr_val
.v
.val_addr
))
30537 if (AT_index (a
) != NOT_INDEXED
)
30538 remove_addr_table_entry (a
->dw_attr_val
.val_entry
);
30539 remove_AT (die
, a
->dw_attr
);
30542 if ((die
->die_tag
== DW_TAG_call_site
30543 && a
->dw_attr
== DW_AT_call_origin
)
30544 || (die
->die_tag
== DW_TAG_GNU_call_site
30545 && a
->dw_attr
== DW_AT_abstract_origin
))
30547 tree tdecl
= SYMBOL_REF_DECL (a
->dw_attr_val
.v
.val_addr
);
30548 dw_die_ref tdie
= lookup_decl_die (tdecl
);
30551 && DECL_EXTERNAL (tdecl
)
30552 && DECL_ABSTRACT_ORIGIN (tdecl
) == NULL_TREE
30553 && (cdie
= lookup_context_die (DECL_CONTEXT (tdecl
))))
30555 dw_die_ref pdie
= cdie
;
30556 /* Make sure we don't add these DIEs into type units.
30557 We could emit skeleton DIEs for context (namespaces,
30558 outer structs/classes) and a skeleton DIE for the
30559 innermost context with DW_AT_signature pointing to the
30560 type unit. See PR78835. */
30561 while (pdie
&& pdie
->die_tag
!= DW_TAG_type_unit
)
30562 pdie
= pdie
->die_parent
;
30565 /* Creating a full DIE for tdecl is overly expensive and
30566 at this point even wrong when in the LTO phase
30567 as it can end up generating new type DIEs we didn't
30568 output and thus optimize_external_refs will crash. */
30569 tdie
= new_die (DW_TAG_subprogram
, cdie
, NULL_TREE
);
30570 add_AT_flag (tdie
, DW_AT_external
, 1);
30571 add_AT_flag (tdie
, DW_AT_declaration
, 1);
30572 add_linkage_attr (tdie
, tdecl
);
30573 add_name_and_src_coords_attributes (tdie
, tdecl
, true);
30574 equate_decl_number_to_die (tdecl
, tdie
);
30579 a
->dw_attr_val
.val_class
= dw_val_class_die_ref
;
30580 a
->dw_attr_val
.v
.val_die_ref
.die
= tdie
;
30581 a
->dw_attr_val
.v
.val_die_ref
.external
= 0;
30585 if (AT_index (a
) != NOT_INDEXED
)
30586 remove_addr_table_entry (a
->dw_attr_val
.val_entry
);
30587 remove_AT (die
, a
->dw_attr
);
30596 if (remove_AT_byte_size
)
30597 remove_AT (die
, dwarf_version
>= 5
30598 ? DW_AT_string_length_byte_size
30599 : DW_AT_byte_size
);
30601 FOR_EACH_CHILD (die
, c
, resolve_addr (c
));
30604 /* Helper routines for optimize_location_lists.
30605 This pass tries to share identical local lists in .debug_loc
30608 /* Iteratively hash operands of LOC opcode into HSTATE. */
30611 hash_loc_operands (dw_loc_descr_ref loc
, inchash::hash
&hstate
)
30613 dw_val_ref val1
= &loc
->dw_loc_oprnd1
;
30614 dw_val_ref val2
= &loc
->dw_loc_oprnd2
;
30616 switch (loc
->dw_loc_opc
)
30618 case DW_OP_const4u
:
30619 case DW_OP_const8u
:
30623 case DW_OP_const1u
:
30624 case DW_OP_const1s
:
30625 case DW_OP_const2u
:
30626 case DW_OP_const2s
:
30627 case DW_OP_const4s
:
30628 case DW_OP_const8s
:
30632 case DW_OP_plus_uconst
:
30668 case DW_OP_deref_size
:
30669 case DW_OP_xderef_size
:
30670 hstate
.add_object (val1
->v
.val_int
);
30677 gcc_assert (val1
->val_class
== dw_val_class_loc
);
30678 offset
= val1
->v
.val_loc
->dw_loc_addr
- (loc
->dw_loc_addr
+ 3);
30679 hstate
.add_object (offset
);
30682 case DW_OP_implicit_value
:
30683 hstate
.add_object (val1
->v
.val_unsigned
);
30684 switch (val2
->val_class
)
30686 case dw_val_class_const
:
30687 hstate
.add_object (val2
->v
.val_int
);
30689 case dw_val_class_vec
:
30691 unsigned int elt_size
= val2
->v
.val_vec
.elt_size
;
30692 unsigned int len
= val2
->v
.val_vec
.length
;
30694 hstate
.add_int (elt_size
);
30695 hstate
.add_int (len
);
30696 hstate
.add (val2
->v
.val_vec
.array
, len
* elt_size
);
30699 case dw_val_class_const_double
:
30700 hstate
.add_object (val2
->v
.val_double
.low
);
30701 hstate
.add_object (val2
->v
.val_double
.high
);
30703 case dw_val_class_wide_int
:
30704 hstate
.add (val2
->v
.val_wide
->get_val (),
30705 get_full_len (*val2
->v
.val_wide
)
30706 * HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
);
30708 case dw_val_class_addr
:
30709 inchash::add_rtx (val2
->v
.val_addr
, hstate
);
30712 gcc_unreachable ();
30716 case DW_OP_bit_piece
:
30717 hstate
.add_object (val1
->v
.val_int
);
30718 hstate
.add_object (val2
->v
.val_int
);
30724 unsigned char dtprel
= 0xd1;
30725 hstate
.add_object (dtprel
);
30727 inchash::add_rtx (val1
->v
.val_addr
, hstate
);
30729 case DW_OP_GNU_addr_index
:
30731 case DW_OP_GNU_const_index
:
30736 unsigned char dtprel
= 0xd1;
30737 hstate
.add_object (dtprel
);
30739 inchash::add_rtx (val1
->val_entry
->addr
.rtl
, hstate
);
30742 case DW_OP_implicit_pointer
:
30743 case DW_OP_GNU_implicit_pointer
:
30744 hstate
.add_int (val2
->v
.val_int
);
30746 case DW_OP_entry_value
:
30747 case DW_OP_GNU_entry_value
:
30748 hstate
.add_object (val1
->v
.val_loc
);
30750 case DW_OP_regval_type
:
30751 case DW_OP_deref_type
:
30752 case DW_OP_GNU_regval_type
:
30753 case DW_OP_GNU_deref_type
:
30755 unsigned int byte_size
30756 = get_AT_unsigned (val2
->v
.val_die_ref
.die
, DW_AT_byte_size
);
30757 unsigned int encoding
30758 = get_AT_unsigned (val2
->v
.val_die_ref
.die
, DW_AT_encoding
);
30759 hstate
.add_object (val1
->v
.val_int
);
30760 hstate
.add_object (byte_size
);
30761 hstate
.add_object (encoding
);
30764 case DW_OP_convert
:
30765 case DW_OP_reinterpret
:
30766 case DW_OP_GNU_convert
:
30767 case DW_OP_GNU_reinterpret
:
30768 if (val1
->val_class
== dw_val_class_unsigned_const
)
30770 hstate
.add_object (val1
->v
.val_unsigned
);
30774 case DW_OP_const_type
:
30775 case DW_OP_GNU_const_type
:
30777 unsigned int byte_size
30778 = get_AT_unsigned (val1
->v
.val_die_ref
.die
, DW_AT_byte_size
);
30779 unsigned int encoding
30780 = get_AT_unsigned (val1
->v
.val_die_ref
.die
, DW_AT_encoding
);
30781 hstate
.add_object (byte_size
);
30782 hstate
.add_object (encoding
);
30783 if (loc
->dw_loc_opc
!= DW_OP_const_type
30784 && loc
->dw_loc_opc
!= DW_OP_GNU_const_type
)
30786 hstate
.add_object (val2
->val_class
);
30787 switch (val2
->val_class
)
30789 case dw_val_class_const
:
30790 hstate
.add_object (val2
->v
.val_int
);
30792 case dw_val_class_vec
:
30794 unsigned int elt_size
= val2
->v
.val_vec
.elt_size
;
30795 unsigned int len
= val2
->v
.val_vec
.length
;
30797 hstate
.add_object (elt_size
);
30798 hstate
.add_object (len
);
30799 hstate
.add (val2
->v
.val_vec
.array
, len
* elt_size
);
30802 case dw_val_class_const_double
:
30803 hstate
.add_object (val2
->v
.val_double
.low
);
30804 hstate
.add_object (val2
->v
.val_double
.high
);
30806 case dw_val_class_wide_int
:
30807 hstate
.add (val2
->v
.val_wide
->get_val (),
30808 get_full_len (*val2
->v
.val_wide
)
30809 * HOST_BITS_PER_WIDE_INT
/ HOST_BITS_PER_CHAR
);
30812 gcc_unreachable ();
30818 /* Other codes have no operands. */
30823 /* Iteratively hash the whole DWARF location expression LOC into HSTATE. */
30826 hash_locs (dw_loc_descr_ref loc
, inchash::hash
&hstate
)
30828 dw_loc_descr_ref l
;
30829 bool sizes_computed
= false;
30830 /* Compute sizes, so that DW_OP_skip/DW_OP_bra can be checksummed. */
30831 size_of_locs (loc
);
30833 for (l
= loc
; l
!= NULL
; l
= l
->dw_loc_next
)
30835 enum dwarf_location_atom opc
= l
->dw_loc_opc
;
30836 hstate
.add_object (opc
);
30837 if ((opc
== DW_OP_skip
|| opc
== DW_OP_bra
) && !sizes_computed
)
30839 size_of_locs (loc
);
30840 sizes_computed
= true;
30842 hash_loc_operands (l
, hstate
);
30846 /* Compute hash of the whole location list LIST_HEAD. */
30849 hash_loc_list (dw_loc_list_ref list_head
)
30851 dw_loc_list_ref curr
= list_head
;
30852 inchash::hash hstate
;
30854 for (curr
= list_head
; curr
!= NULL
; curr
= curr
->dw_loc_next
)
30856 hstate
.add (curr
->begin
, strlen (curr
->begin
) + 1);
30857 hstate
.add (curr
->end
, strlen (curr
->end
) + 1);
30858 hstate
.add_object (curr
->vbegin
);
30859 hstate
.add_object (curr
->vend
);
30861 hstate
.add (curr
->section
, strlen (curr
->section
) + 1);
30862 hash_locs (curr
->expr
, hstate
);
30864 list_head
->hash
= hstate
.end ();
30867 /* Return true if X and Y opcodes have the same operands. */
30870 compare_loc_operands (dw_loc_descr_ref x
, dw_loc_descr_ref y
)
30872 dw_val_ref valx1
= &x
->dw_loc_oprnd1
;
30873 dw_val_ref valx2
= &x
->dw_loc_oprnd2
;
30874 dw_val_ref valy1
= &y
->dw_loc_oprnd1
;
30875 dw_val_ref valy2
= &y
->dw_loc_oprnd2
;
30877 switch (x
->dw_loc_opc
)
30879 case DW_OP_const4u
:
30880 case DW_OP_const8u
:
30884 case DW_OP_const1u
:
30885 case DW_OP_const1s
:
30886 case DW_OP_const2u
:
30887 case DW_OP_const2s
:
30888 case DW_OP_const4s
:
30889 case DW_OP_const8s
:
30893 case DW_OP_plus_uconst
:
30929 case DW_OP_deref_size
:
30930 case DW_OP_xderef_size
:
30931 return valx1
->v
.val_int
== valy1
->v
.val_int
;
30934 /* If splitting debug info, the use of DW_OP_GNU_addr_index
30935 can cause irrelevant differences in dw_loc_addr. */
30936 gcc_assert (valx1
->val_class
== dw_val_class_loc
30937 && valy1
->val_class
== dw_val_class_loc
30938 && (dwarf_split_debug_info
30939 || x
->dw_loc_addr
== y
->dw_loc_addr
));
30940 return valx1
->v
.val_loc
->dw_loc_addr
== valy1
->v
.val_loc
->dw_loc_addr
;
30941 case DW_OP_implicit_value
:
30942 if (valx1
->v
.val_unsigned
!= valy1
->v
.val_unsigned
30943 || valx2
->val_class
!= valy2
->val_class
)
30945 switch (valx2
->val_class
)
30947 case dw_val_class_const
:
30948 return valx2
->v
.val_int
== valy2
->v
.val_int
;
30949 case dw_val_class_vec
:
30950 return valx2
->v
.val_vec
.elt_size
== valy2
->v
.val_vec
.elt_size
30951 && valx2
->v
.val_vec
.length
== valy2
->v
.val_vec
.length
30952 && memcmp (valx2
->v
.val_vec
.array
, valy2
->v
.val_vec
.array
,
30953 valx2
->v
.val_vec
.elt_size
30954 * valx2
->v
.val_vec
.length
) == 0;
30955 case dw_val_class_const_double
:
30956 return valx2
->v
.val_double
.low
== valy2
->v
.val_double
.low
30957 && valx2
->v
.val_double
.high
== valy2
->v
.val_double
.high
;
30958 case dw_val_class_wide_int
:
30959 return *valx2
->v
.val_wide
== *valy2
->v
.val_wide
;
30960 case dw_val_class_addr
:
30961 return rtx_equal_p (valx2
->v
.val_addr
, valy2
->v
.val_addr
);
30963 gcc_unreachable ();
30966 case DW_OP_bit_piece
:
30967 return valx1
->v
.val_int
== valy1
->v
.val_int
30968 && valx2
->v
.val_int
== valy2
->v
.val_int
;
30971 return rtx_equal_p (valx1
->v
.val_addr
, valy1
->v
.val_addr
);
30972 case DW_OP_GNU_addr_index
:
30974 case DW_OP_GNU_const_index
:
30977 rtx ax1
= valx1
->val_entry
->addr
.rtl
;
30978 rtx ay1
= valy1
->val_entry
->addr
.rtl
;
30979 return rtx_equal_p (ax1
, ay1
);
30981 case DW_OP_implicit_pointer
:
30982 case DW_OP_GNU_implicit_pointer
:
30983 return valx1
->val_class
== dw_val_class_die_ref
30984 && valx1
->val_class
== valy1
->val_class
30985 && valx1
->v
.val_die_ref
.die
== valy1
->v
.val_die_ref
.die
30986 && valx2
->v
.val_int
== valy2
->v
.val_int
;
30987 case DW_OP_entry_value
:
30988 case DW_OP_GNU_entry_value
:
30989 return compare_loc_operands (valx1
->v
.val_loc
, valy1
->v
.val_loc
);
30990 case DW_OP_const_type
:
30991 case DW_OP_GNU_const_type
:
30992 if (valx1
->v
.val_die_ref
.die
!= valy1
->v
.val_die_ref
.die
30993 || valx2
->val_class
!= valy2
->val_class
)
30995 switch (valx2
->val_class
)
30997 case dw_val_class_const
:
30998 return valx2
->v
.val_int
== valy2
->v
.val_int
;
30999 case dw_val_class_vec
:
31000 return valx2
->v
.val_vec
.elt_size
== valy2
->v
.val_vec
.elt_size
31001 && valx2
->v
.val_vec
.length
== valy2
->v
.val_vec
.length
31002 && memcmp (valx2
->v
.val_vec
.array
, valy2
->v
.val_vec
.array
,
31003 valx2
->v
.val_vec
.elt_size
31004 * valx2
->v
.val_vec
.length
) == 0;
31005 case dw_val_class_const_double
:
31006 return valx2
->v
.val_double
.low
== valy2
->v
.val_double
.low
31007 && valx2
->v
.val_double
.high
== valy2
->v
.val_double
.high
;
31008 case dw_val_class_wide_int
:
31009 return *valx2
->v
.val_wide
== *valy2
->v
.val_wide
;
31011 gcc_unreachable ();
31013 case DW_OP_regval_type
:
31014 case DW_OP_deref_type
:
31015 case DW_OP_GNU_regval_type
:
31016 case DW_OP_GNU_deref_type
:
31017 return valx1
->v
.val_int
== valy1
->v
.val_int
31018 && valx2
->v
.val_die_ref
.die
== valy2
->v
.val_die_ref
.die
;
31019 case DW_OP_convert
:
31020 case DW_OP_reinterpret
:
31021 case DW_OP_GNU_convert
:
31022 case DW_OP_GNU_reinterpret
:
31023 if (valx1
->val_class
!= valy1
->val_class
)
31025 if (valx1
->val_class
== dw_val_class_unsigned_const
)
31026 return valx1
->v
.val_unsigned
== valy1
->v
.val_unsigned
;
31027 return valx1
->v
.val_die_ref
.die
== valy1
->v
.val_die_ref
.die
;
31028 case DW_OP_GNU_parameter_ref
:
31029 return valx1
->val_class
== dw_val_class_die_ref
31030 && valx1
->val_class
== valy1
->val_class
31031 && valx1
->v
.val_die_ref
.die
== valy1
->v
.val_die_ref
.die
;
31033 /* Other codes have no operands. */
31038 /* Return true if DWARF location expressions X and Y are the same. */
31041 compare_locs (dw_loc_descr_ref x
, dw_loc_descr_ref y
)
31043 for (; x
!= NULL
&& y
!= NULL
; x
= x
->dw_loc_next
, y
= y
->dw_loc_next
)
31044 if (x
->dw_loc_opc
!= y
->dw_loc_opc
31045 || x
->dtprel
!= y
->dtprel
31046 || !compare_loc_operands (x
, y
))
31048 return x
== NULL
&& y
== NULL
;
31051 /* Hashtable helpers. */
31053 struct loc_list_hasher
: nofree_ptr_hash
<dw_loc_list_struct
>
31055 static inline hashval_t
hash (const dw_loc_list_struct
*);
31056 static inline bool equal (const dw_loc_list_struct
*,
31057 const dw_loc_list_struct
*);
31060 /* Return precomputed hash of location list X. */
31063 loc_list_hasher::hash (const dw_loc_list_struct
*x
)
31068 /* Return true if location lists A and B are the same. */
31071 loc_list_hasher::equal (const dw_loc_list_struct
*a
,
31072 const dw_loc_list_struct
*b
)
31076 if (a
->hash
!= b
->hash
)
31078 for (; a
!= NULL
&& b
!= NULL
; a
= a
->dw_loc_next
, b
= b
->dw_loc_next
)
31079 if (strcmp (a
->begin
, b
->begin
) != 0
31080 || strcmp (a
->end
, b
->end
) != 0
31081 || (a
->section
== NULL
) != (b
->section
== NULL
)
31082 || (a
->section
&& strcmp (a
->section
, b
->section
) != 0)
31083 || a
->vbegin
!= b
->vbegin
|| a
->vend
!= b
->vend
31084 || !compare_locs (a
->expr
, b
->expr
))
31086 return a
== NULL
&& b
== NULL
;
31089 typedef hash_table
<loc_list_hasher
> loc_list_hash_type
;
31092 /* Recursively optimize location lists referenced from DIE
31093 children and share them whenever possible. */
31096 optimize_location_lists_1 (dw_die_ref die
, loc_list_hash_type
*htab
)
31101 dw_loc_list_struct
**slot
;
31102 bool drop_locviews
= false;
31103 bool has_locviews
= false;
31105 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
31106 if (AT_class (a
) == dw_val_class_loc_list
)
31108 dw_loc_list_ref list
= AT_loc_list (a
);
31109 /* TODO: perform some optimizations here, before hashing
31110 it and storing into the hash table. */
31111 hash_loc_list (list
);
31112 slot
= htab
->find_slot_with_hash (list
, list
->hash
, INSERT
);
31116 if (loc_list_has_views (list
))
31117 gcc_assert (list
->vl_symbol
);
31118 else if (list
->vl_symbol
)
31120 drop_locviews
= true;
31121 list
->vl_symbol
= NULL
;
31126 if (list
->vl_symbol
&& !(*slot
)->vl_symbol
)
31127 drop_locviews
= true;
31128 a
->dw_attr_val
.v
.val_loc_list
= *slot
;
31131 else if (AT_class (a
) == dw_val_class_view_list
)
31133 gcc_checking_assert (a
->dw_attr
== DW_AT_GNU_locviews
);
31134 has_locviews
= true;
31138 if (drop_locviews
&& has_locviews
)
31139 remove_AT (die
, DW_AT_GNU_locviews
);
31141 FOR_EACH_CHILD (die
, c
, optimize_location_lists_1 (c
, htab
));
31145 /* Recursively assign each location list a unique index into the debug_addr
31149 index_location_lists (dw_die_ref die
)
31155 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
31156 if (AT_class (a
) == dw_val_class_loc_list
)
31158 dw_loc_list_ref list
= AT_loc_list (a
);
31159 dw_loc_list_ref curr
;
31160 for (curr
= list
; curr
!= NULL
; curr
= curr
->dw_loc_next
)
31162 /* Don't index an entry that has already been indexed
31163 or won't be output. Make sure skip_loc_list_entry doesn't
31164 call size_of_locs, because that might cause circular dependency,
31165 index_location_lists requiring address table indexes to be
31166 computed, but adding new indexes through add_addr_table_entry
31167 and address table index computation requiring no new additions
31168 to the hash table. In the rare case of DWARF[234] >= 64KB
31169 location expression, we'll just waste unused address table entry
31171 if (curr
->begin_entry
!= NULL
31172 || skip_loc_list_entry (curr
))
31176 = add_addr_table_entry (xstrdup (curr
->begin
), ate_kind_label
);
31180 FOR_EACH_CHILD (die
, c
, index_location_lists (c
));
31183 /* Optimize location lists referenced from DIE
31184 children and share them whenever possible. */
31187 optimize_location_lists (dw_die_ref die
)
31189 loc_list_hash_type
htab (500);
31190 optimize_location_lists_1 (die
, &htab
);
31193 /* Traverse the limbo die list, and add parent/child links. The only
31194 dies without parents that should be here are concrete instances of
31195 inline functions, and the comp_unit_die. We can ignore the comp_unit_die.
31196 For concrete instances, we can get the parent die from the abstract
31200 flush_limbo_die_list (void)
31202 limbo_die_node
*node
;
31204 /* get_context_die calls force_decl_die, which can put new DIEs on the
31205 limbo list in LTO mode when nested functions are put in a different
31206 partition than that of their parent function. */
31207 while ((node
= limbo_die_list
))
31209 dw_die_ref die
= node
->die
;
31210 limbo_die_list
= node
->next
;
31212 if (die
->die_parent
== NULL
)
31214 dw_die_ref origin
= get_AT_ref (die
, DW_AT_abstract_origin
);
31216 if (origin
&& origin
->die_parent
)
31217 add_child_die (origin
->die_parent
, die
);
31218 else if (is_cu_die (die
))
31220 else if (seen_error ())
31221 /* It's OK to be confused by errors in the input. */
31222 add_child_die (comp_unit_die (), die
);
31225 /* In certain situations, the lexical block containing a
31226 nested function can be optimized away, which results
31227 in the nested function die being orphaned. Likewise
31228 with the return type of that nested function. Force
31229 this to be a child of the containing function.
31231 It may happen that even the containing function got fully
31232 inlined and optimized out. In that case we are lost and
31233 assign the empty child. This should not be big issue as
31234 the function is likely unreachable too. */
31235 gcc_assert (node
->created_for
);
31237 if (DECL_P (node
->created_for
))
31238 origin
= get_context_die (DECL_CONTEXT (node
->created_for
));
31239 else if (TYPE_P (node
->created_for
))
31240 origin
= scope_die_for (node
->created_for
, comp_unit_die ());
31242 origin
= comp_unit_die ();
31244 add_child_die (origin
, die
);
31250 /* Reset DIEs so we can output them again. */
31253 reset_dies (dw_die_ref die
)
31257 /* Remove stuff we re-generate. */
31259 die
->die_offset
= 0;
31260 die
->die_abbrev
= 0;
31261 remove_AT (die
, DW_AT_sibling
);
31263 FOR_EACH_CHILD (die
, c
, reset_dies (c
));
31266 /* Output stuff that dwarf requires at the end of every file,
31267 and generate the DWARF-2 debugging info. */
31270 dwarf2out_finish (const char *filename
)
31272 comdat_type_node
*ctnode
;
31273 dw_die_ref main_comp_unit_die
;
31274 unsigned char checksum
[16];
31275 char dl_section_ref
[MAX_ARTIFICIAL_LABEL_BYTES
];
31277 /* Flush out any latecomers to the limbo party. */
31278 flush_limbo_die_list ();
31280 if (inline_entry_data_table
)
31281 gcc_assert (inline_entry_data_table
->is_empty ());
31285 verify_die (comp_unit_die ());
31286 for (limbo_die_node
*node
= cu_die_list
; node
; node
= node
->next
)
31287 verify_die (node
->die
);
31290 /* We shouldn't have any symbols with delayed asm names for
31291 DIEs generated after early finish. */
31292 gcc_assert (deferred_asm_name
== NULL
);
31294 gen_remaining_tmpl_value_param_die_attribute ();
31296 if (flag_generate_lto
|| flag_generate_offload
)
31298 gcc_assert (flag_fat_lto_objects
|| flag_generate_offload
);
31300 /* Prune stuff so that dwarf2out_finish runs successfully
31301 for the fat part of the object. */
31302 reset_dies (comp_unit_die ());
31303 for (limbo_die_node
*node
= cu_die_list
; node
; node
= node
->next
)
31304 reset_dies (node
->die
);
31306 hash_table
<comdat_type_hasher
> comdat_type_table (100);
31307 for (ctnode
= comdat_type_list
; ctnode
!= NULL
; ctnode
= ctnode
->next
)
31309 comdat_type_node
**slot
31310 = comdat_type_table
.find_slot (ctnode
, INSERT
);
31312 /* Don't reset types twice. */
31313 if (*slot
!= HTAB_EMPTY_ENTRY
)
31316 /* Remove the pointer to the line table. */
31317 remove_AT (ctnode
->root_die
, DW_AT_stmt_list
);
31319 if (debug_info_level
>= DINFO_LEVEL_TERSE
)
31320 reset_dies (ctnode
->root_die
);
31325 /* Reset die CU symbol so we don't output it twice. */
31326 comp_unit_die ()->die_id
.die_symbol
= NULL
;
31328 /* Remove DW_AT_macro and DW_AT_stmt_list from the early output. */
31329 remove_AT (comp_unit_die (), DW_AT_stmt_list
);
31331 remove_AT (comp_unit_die (), DEBUG_MACRO_ATTRIBUTE
);
31333 /* Remove indirect string decisions. */
31334 debug_str_hash
->traverse
<void *, reset_indirect_string
> (NULL
);
31335 if (debug_line_str_hash
)
31337 debug_line_str_hash
->traverse
<void *, reset_indirect_string
> (NULL
);
31338 debug_line_str_hash
= NULL
;
31342 #if ENABLE_ASSERT_CHECKING
31344 dw_die_ref die
= comp_unit_die (), c
;
31345 FOR_EACH_CHILD (die
, c
, gcc_assert (! c
->die_mark
));
31348 for (ctnode
= comdat_type_list
; ctnode
!= NULL
; ctnode
= ctnode
->next
)
31349 resolve_addr (ctnode
->root_die
);
31350 resolve_addr (comp_unit_die ());
31351 move_marked_base_types ();
31355 fprintf (dump_file
, "DWARF for %s\n", filename
);
31356 print_die (comp_unit_die (), dump_file
);
31359 /* Initialize sections and labels used for actual assembler output. */
31360 unsigned generation
= init_sections_and_labels (false);
31362 /* Traverse the DIE's and add sibling attributes to those DIE's that
31364 add_sibling_attributes (comp_unit_die ());
31365 limbo_die_node
*node
;
31366 for (node
= cu_die_list
; node
; node
= node
->next
)
31367 add_sibling_attributes (node
->die
);
31368 for (ctnode
= comdat_type_list
; ctnode
!= NULL
; ctnode
= ctnode
->next
)
31369 add_sibling_attributes (ctnode
->root_die
);
31371 /* When splitting DWARF info, we put some attributes in the
31372 skeleton compile_unit DIE that remains in the .o, while
31373 most attributes go in the DWO compile_unit_die. */
31374 if (dwarf_split_debug_info
)
31376 limbo_die_node
*cu
;
31377 main_comp_unit_die
= gen_compile_unit_die (NULL
);
31378 if (dwarf_version
>= 5)
31379 main_comp_unit_die
->die_tag
= DW_TAG_skeleton_unit
;
31380 cu
= limbo_die_list
;
31381 gcc_assert (cu
->die
== main_comp_unit_die
);
31382 limbo_die_list
= limbo_die_list
->next
;
31383 cu
->next
= cu_die_list
;
31387 main_comp_unit_die
= comp_unit_die ();
31389 /* Output a terminator label for the .text section. */
31390 switch_to_section (text_section
);
31391 targetm
.asm_out
.internal_label (asm_out_file
, TEXT_END_LABEL
, 0);
31392 if (cold_text_section
)
31394 switch_to_section (cold_text_section
);
31395 targetm
.asm_out
.internal_label (asm_out_file
, COLD_END_LABEL
, 0);
31398 /* We can only use the low/high_pc attributes if all of the code was
31400 if (!have_multiple_function_sections
31401 || (dwarf_version
< 3 && dwarf_strict
))
31403 /* Don't add if the CU has no associated code. */
31404 if (text_section_used
)
31405 add_AT_low_high_pc (main_comp_unit_die
, text_section_label
,
31406 text_end_label
, true);
31412 bool range_list_added
= false;
31414 if (text_section_used
)
31415 add_ranges_by_labels (main_comp_unit_die
, text_section_label
,
31416 text_end_label
, &range_list_added
, true);
31417 if (cold_text_section_used
)
31418 add_ranges_by_labels (main_comp_unit_die
, cold_text_section_label
,
31419 cold_end_label
, &range_list_added
, true);
31421 FOR_EACH_VEC_ELT (*fde_vec
, fde_idx
, fde
)
31423 if (DECL_IGNORED_P (fde
->decl
))
31425 if (!fde
->in_std_section
)
31426 add_ranges_by_labels (main_comp_unit_die
, fde
->dw_fde_begin
,
31427 fde
->dw_fde_end
, &range_list_added
,
31429 if (fde
->dw_fde_second_begin
&& !fde
->second_in_std_section
)
31430 add_ranges_by_labels (main_comp_unit_die
, fde
->dw_fde_second_begin
,
31431 fde
->dw_fde_second_end
, &range_list_added
,
31435 if (range_list_added
)
31437 /* We need to give .debug_loc and .debug_ranges an appropriate
31438 "base address". Use zero so that these addresses become
31439 absolute. Historically, we've emitted the unexpected
31440 DW_AT_entry_pc instead of DW_AT_low_pc for this purpose.
31441 Emit both to give time for other tools to adapt. */
31442 add_AT_addr (main_comp_unit_die
, DW_AT_low_pc
, const0_rtx
, true);
31443 if (! dwarf_strict
&& dwarf_version
< 4)
31444 add_AT_addr (main_comp_unit_die
, DW_AT_entry_pc
, const0_rtx
, true);
31450 /* AIX Assembler inserts the length, so adjust the reference to match the
31451 offset expected by debuggers. */
31452 strcpy (dl_section_ref
, debug_line_section_label
);
31453 if (XCOFF_DEBUGGING_INFO
)
31454 strcat (dl_section_ref
, DWARF_INITIAL_LENGTH_SIZE_STR
);
31456 if (debug_info_level
>= DINFO_LEVEL_TERSE
)
31457 add_AT_lineptr (main_comp_unit_die
, DW_AT_stmt_list
,
31461 add_AT_macptr (comp_unit_die (), DEBUG_MACRO_ATTRIBUTE
,
31462 macinfo_section_label
);
31464 if (dwarf_split_debug_info
)
31466 if (have_location_lists
)
31468 /* Since we generate the loclists in the split DWARF .dwo
31469 file itself, we don't need to generate a loclists_base
31470 attribute for the split compile unit DIE. That attribute
31471 (and using relocatable sec_offset FORMs) isn't allowed
31472 for a split compile unit. Only if the .debug_loclists
31473 section was in the main file, would we need to generate a
31474 loclists_base attribute here (for the full or skeleton
31477 /* optimize_location_lists calculates the size of the lists,
31478 so index them first, and assign indices to the entries.
31479 Although optimize_location_lists will remove entries from
31480 the table, it only does so for duplicates, and therefore
31481 only reduces ref_counts to 1. */
31482 index_location_lists (comp_unit_die ());
31485 if (addr_index_table
!= NULL
)
31487 unsigned int index
= 0;
31489 ->traverse_noresize
<unsigned int *, index_addr_table_entry
>
31495 if (have_location_lists
)
31497 optimize_location_lists (comp_unit_die ());
31498 /* And finally assign indexes to the entries for -gsplit-dwarf. */
31499 if (dwarf_version
>= 5 && dwarf_split_debug_info
)
31500 assign_location_list_indexes (comp_unit_die ());
31503 save_macinfo_strings ();
31505 if (dwarf_split_debug_info
)
31507 unsigned int index
= 0;
31509 /* Add attributes common to skeleton compile_units and
31510 type_units. Because these attributes include strings, it
31511 must be done before freezing the string table. Top-level
31512 skeleton die attrs are added when the skeleton type unit is
31513 created, so ensure it is created by this point. */
31514 add_top_level_skeleton_die_attrs (main_comp_unit_die
);
31515 debug_str_hash
->traverse_noresize
<unsigned int *, index_string
> (&index
);
31518 /* Output all of the compilation units. We put the main one last so that
31519 the offsets are available to output_pubnames. */
31520 for (node
= cu_die_list
; node
; node
= node
->next
)
31521 output_comp_unit (node
->die
, 0, NULL
);
31523 hash_table
<comdat_type_hasher
> comdat_type_table (100);
31524 for (ctnode
= comdat_type_list
; ctnode
!= NULL
; ctnode
= ctnode
->next
)
31526 comdat_type_node
**slot
= comdat_type_table
.find_slot (ctnode
, INSERT
);
31528 /* Don't output duplicate types. */
31529 if (*slot
!= HTAB_EMPTY_ENTRY
)
31532 /* Add a pointer to the line table for the main compilation unit
31533 so that the debugger can make sense of DW_AT_decl_file
31535 if (debug_info_level
>= DINFO_LEVEL_TERSE
)
31536 add_AT_lineptr (ctnode
->root_die
, DW_AT_stmt_list
,
31537 (!dwarf_split_debug_info
31539 : debug_skeleton_line_section_label
));
31541 output_comdat_type_unit (ctnode
, false);
31545 if (dwarf_split_debug_info
)
31548 struct md5_ctx ctx
;
31550 if (dwarf_version
>= 5 && !vec_safe_is_empty (ranges_table
))
31553 /* Compute a checksum of the comp_unit to use as the dwo_id. */
31554 md5_init_ctx (&ctx
);
31556 die_checksum (comp_unit_die (), &ctx
, &mark
);
31557 unmark_all_dies (comp_unit_die ());
31558 md5_finish_ctx (&ctx
, checksum
);
31560 if (dwarf_version
< 5)
31562 /* Use the first 8 bytes of the checksum as the dwo_id,
31563 and add it to both comp-unit DIEs. */
31564 add_AT_data8 (main_comp_unit_die
, DW_AT_GNU_dwo_id
, checksum
);
31565 add_AT_data8 (comp_unit_die (), DW_AT_GNU_dwo_id
, checksum
);
31568 /* Add the base offset of the ranges table to the skeleton
31570 if (!vec_safe_is_empty (ranges_table
))
31572 if (dwarf_version
>= 5)
31573 add_AT_lineptr (main_comp_unit_die
, DW_AT_rnglists_base
,
31574 ranges_base_label
);
31576 add_AT_lineptr (main_comp_unit_die
, DW_AT_GNU_ranges_base
,
31577 ranges_section_label
);
31580 output_addr_table ();
31583 /* Output the main compilation unit if non-empty or if .debug_macinfo
31584 or .debug_macro will be emitted. */
31585 output_comp_unit (comp_unit_die (), have_macinfo
,
31586 dwarf_split_debug_info
? checksum
: NULL
);
31588 if (dwarf_split_debug_info
&& info_section_emitted
)
31589 output_skeleton_debug_sections (main_comp_unit_die
, checksum
);
31591 /* Output the abbreviation table. */
31592 if (vec_safe_length (abbrev_die_table
) != 1)
31594 switch_to_section (debug_abbrev_section
);
31595 ASM_OUTPUT_LABEL (asm_out_file
, abbrev_section_label
);
31596 output_abbrev_section ();
31599 /* Output location list section if necessary. */
31600 if (have_location_lists
)
31602 char l1
[MAX_ARTIFICIAL_LABEL_BYTES
];
31603 char l2
[MAX_ARTIFICIAL_LABEL_BYTES
];
31604 /* Output the location lists info. */
31605 switch_to_section (debug_loc_section
);
31606 if (dwarf_version
>= 5)
31608 ASM_GENERATE_INTERNAL_LABEL (l1
, DEBUG_LOC_SECTION_LABEL
, 2);
31609 ASM_GENERATE_INTERNAL_LABEL (l2
, DEBUG_LOC_SECTION_LABEL
, 3);
31610 if (DWARF_INITIAL_LENGTH_SIZE
- DWARF_OFFSET_SIZE
== 4)
31611 dw2_asm_output_data (4, 0xffffffff,
31612 "Initial length escape value indicating "
31613 "64-bit DWARF extension");
31614 dw2_asm_output_delta (DWARF_OFFSET_SIZE
, l2
, l1
,
31615 "Length of Location Lists");
31616 ASM_OUTPUT_LABEL (asm_out_file
, l1
);
31617 output_dwarf_version ();
31618 dw2_asm_output_data (1, DWARF2_ADDR_SIZE
, "Address Size");
31619 dw2_asm_output_data (1, 0, "Segment Size");
31620 dw2_asm_output_data (4, dwarf_split_debug_info
? loc_list_idx
: 0,
31621 "Offset Entry Count");
31623 ASM_OUTPUT_LABEL (asm_out_file
, loc_section_label
);
31624 if (dwarf_version
>= 5 && dwarf_split_debug_info
)
31626 unsigned int save_loc_list_idx
= loc_list_idx
;
31628 output_loclists_offsets (comp_unit_die ());
31629 gcc_assert (save_loc_list_idx
== loc_list_idx
);
31631 output_location_lists (comp_unit_die ());
31632 if (dwarf_version
>= 5)
31633 ASM_OUTPUT_LABEL (asm_out_file
, l2
);
31636 output_pubtables ();
31638 /* Output the address range information if a CU (.debug_info section)
31639 was emitted. We output an empty table even if we had no functions
31640 to put in it. This because the consumer has no way to tell the
31641 difference between an empty table that we omitted and failure to
31642 generate a table that would have contained data. */
31643 if (info_section_emitted
)
31645 switch_to_section (debug_aranges_section
);
31649 /* Output ranges section if necessary. */
31650 if (!vec_safe_is_empty (ranges_table
))
31652 if (dwarf_version
>= 5)
31653 output_rnglists (generation
);
31658 /* Have to end the macro section. */
31661 switch_to_section (debug_macinfo_section
);
31662 ASM_OUTPUT_LABEL (asm_out_file
, macinfo_section_label
);
31663 output_macinfo (!dwarf_split_debug_info
? debug_line_section_label
31664 : debug_skeleton_line_section_label
, false);
31665 dw2_asm_output_data (1, 0, "End compilation unit");
31668 /* Output the source line correspondence table. We must do this
31669 even if there is no line information. Otherwise, on an empty
31670 translation unit, we will generate a present, but empty,
31671 .debug_info section. IRIX 6.5 `nm' will then complain when
31672 examining the file. This is done late so that any filenames
31673 used by the debug_info section are marked as 'used'. */
31674 switch_to_section (debug_line_section
);
31675 ASM_OUTPUT_LABEL (asm_out_file
, debug_line_section_label
);
31676 if (! output_asm_line_debug_info ())
31677 output_line_info (false);
31679 if (dwarf_split_debug_info
&& info_section_emitted
)
31681 switch_to_section (debug_skeleton_line_section
);
31682 ASM_OUTPUT_LABEL (asm_out_file
, debug_skeleton_line_section_label
);
31683 output_line_info (true);
31686 /* If we emitted any indirect strings, output the string table too. */
31687 if (debug_str_hash
|| skeleton_debug_str_hash
)
31688 output_indirect_strings ();
31689 if (debug_line_str_hash
)
31691 switch_to_section (debug_line_str_section
);
31692 const enum dwarf_form form
= DW_FORM_line_strp
;
31693 debug_line_str_hash
->traverse
<enum dwarf_form
,
31694 output_indirect_string
> (form
);
31697 /* ??? Move lvugid out of dwarf2out_source_line and reset it too? */
31698 symview_upper_bound
= 0;
31700 bitmap_clear (zero_view_p
);
31703 /* Returns a hash value for X (which really is a variable_value_struct). */
31706 variable_value_hasher::hash (variable_value_struct
*x
)
31708 return (hashval_t
) x
->decl_id
;
31711 /* Return nonzero if decl_id of variable_value_struct X is the same as
31715 variable_value_hasher::equal (variable_value_struct
*x
, tree y
)
31717 return x
->decl_id
== DECL_UID (y
);
31720 /* Helper function for resolve_variable_value, handle
31721 DW_OP_GNU_variable_value in one location expression.
31722 Return true if exprloc has been changed into loclist. */
31725 resolve_variable_value_in_expr (dw_attr_node
*a
, dw_loc_descr_ref loc
)
31727 dw_loc_descr_ref next
;
31728 for (dw_loc_descr_ref prev
= NULL
; loc
; prev
= loc
, loc
= next
)
31730 next
= loc
->dw_loc_next
;
31731 if (loc
->dw_loc_opc
!= DW_OP_GNU_variable_value
31732 || loc
->dw_loc_oprnd1
.val_class
!= dw_val_class_decl_ref
)
31735 tree decl
= loc
->dw_loc_oprnd1
.v
.val_decl_ref
;
31736 if (DECL_CONTEXT (decl
) != current_function_decl
)
31739 dw_die_ref ref
= lookup_decl_die (decl
);
31742 loc
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
31743 loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
31744 loc
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
31747 dw_loc_list_ref l
= loc_list_from_tree (decl
, 0, NULL
);
31750 if (l
->dw_loc_next
)
31752 if (AT_class (a
) != dw_val_class_loc
)
31754 switch (a
->dw_attr
)
31756 /* Following attributes allow both exprloc and loclist
31757 classes, so we can change them into a loclist. */
31758 case DW_AT_location
:
31759 case DW_AT_string_length
:
31760 case DW_AT_return_addr
:
31761 case DW_AT_data_member_location
:
31762 case DW_AT_frame_base
:
31763 case DW_AT_segment
:
31764 case DW_AT_static_link
:
31765 case DW_AT_use_location
:
31766 case DW_AT_vtable_elem_location
:
31769 prev
->dw_loc_next
= NULL
;
31770 prepend_loc_descr_to_each (l
, AT_loc (a
));
31773 add_loc_descr_to_each (l
, next
);
31774 a
->dw_attr_val
.val_class
= dw_val_class_loc_list
;
31775 a
->dw_attr_val
.val_entry
= NULL
;
31776 a
->dw_attr_val
.v
.val_loc_list
= l
;
31777 have_location_lists
= true;
31779 /* Following attributes allow both exprloc and reference,
31780 so if the whole expression is DW_OP_GNU_variable_value alone
31781 we could transform it into reference. */
31782 case DW_AT_byte_size
:
31783 case DW_AT_bit_size
:
31784 case DW_AT_lower_bound
:
31785 case DW_AT_upper_bound
:
31786 case DW_AT_bit_stride
:
31788 case DW_AT_allocated
:
31789 case DW_AT_associated
:
31790 case DW_AT_byte_stride
:
31791 if (prev
== NULL
&& next
== NULL
)
31799 /* Create DW_TAG_variable that we can refer to. */
31800 gen_decl_die (decl
, NULL_TREE
, NULL
,
31801 lookup_decl_die (current_function_decl
));
31802 ref
= lookup_decl_die (decl
);
31805 loc
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
31806 loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
31807 loc
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
31813 prev
->dw_loc_next
= l
->expr
;
31814 add_loc_descr (&prev
->dw_loc_next
, next
);
31815 free_loc_descr (loc
, NULL
);
31816 next
= prev
->dw_loc_next
;
31820 memcpy (loc
, l
->expr
, sizeof (dw_loc_descr_node
));
31821 add_loc_descr (&loc
, next
);
31829 /* Attempt to resolve DW_OP_GNU_variable_value using loc_list_from_tree. */
31832 resolve_variable_value (dw_die_ref die
)
31835 dw_loc_list_ref loc
;
31838 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
31839 switch (AT_class (a
))
31841 case dw_val_class_loc
:
31842 if (!resolve_variable_value_in_expr (a
, AT_loc (a
)))
31845 case dw_val_class_loc_list
:
31846 loc
= AT_loc_list (a
);
31848 for (; loc
; loc
= loc
->dw_loc_next
)
31849 resolve_variable_value_in_expr (a
, loc
->expr
);
31856 /* Attempt to optimize DW_OP_GNU_variable_value refering to
31857 temporaries in the current function. */
31860 resolve_variable_values (void)
31862 if (!variable_value_hash
|| !current_function_decl
)
31865 struct variable_value_struct
*node
31866 = variable_value_hash
->find_with_hash (current_function_decl
,
31867 DECL_UID (current_function_decl
));
31874 FOR_EACH_VEC_SAFE_ELT (node
->dies
, i
, die
)
31875 resolve_variable_value (die
);
31878 /* Helper function for note_variable_value, handle one location
31882 note_variable_value_in_expr (dw_die_ref die
, dw_loc_descr_ref loc
)
31884 for (; loc
; loc
= loc
->dw_loc_next
)
31885 if (loc
->dw_loc_opc
== DW_OP_GNU_variable_value
31886 && loc
->dw_loc_oprnd1
.val_class
== dw_val_class_decl_ref
)
31888 tree decl
= loc
->dw_loc_oprnd1
.v
.val_decl_ref
;
31889 dw_die_ref ref
= lookup_decl_die (decl
);
31890 if (! ref
&& (flag_generate_lto
|| flag_generate_offload
))
31892 /* ??? This is somewhat a hack because we do not create DIEs
31893 for variables not in BLOCK trees early but when generating
31894 early LTO output we need the dw_val_class_decl_ref to be
31895 fully resolved. For fat LTO objects we'd also like to
31896 undo this after LTO dwarf output. */
31897 gcc_assert (DECL_CONTEXT (decl
));
31898 dw_die_ref ctx
= lookup_decl_die (DECL_CONTEXT (decl
));
31899 gcc_assert (ctx
!= NULL
);
31900 gen_decl_die (decl
, NULL_TREE
, NULL
, ctx
);
31901 ref
= lookup_decl_die (decl
);
31902 gcc_assert (ref
!= NULL
);
31906 loc
->dw_loc_oprnd1
.val_class
= dw_val_class_die_ref
;
31907 loc
->dw_loc_oprnd1
.v
.val_die_ref
.die
= ref
;
31908 loc
->dw_loc_oprnd1
.v
.val_die_ref
.external
= 0;
31912 && DECL_CONTEXT (decl
)
31913 && TREE_CODE (DECL_CONTEXT (decl
)) == FUNCTION_DECL
31914 && lookup_decl_die (DECL_CONTEXT (decl
)))
31916 if (!variable_value_hash
)
31917 variable_value_hash
31918 = hash_table
<variable_value_hasher
>::create_ggc (10);
31920 tree fndecl
= DECL_CONTEXT (decl
);
31921 struct variable_value_struct
*node
;
31922 struct variable_value_struct
**slot
31923 = variable_value_hash
->find_slot_with_hash (fndecl
,
31928 node
= ggc_cleared_alloc
<variable_value_struct
> ();
31929 node
->decl_id
= DECL_UID (fndecl
);
31935 vec_safe_push (node
->dies
, die
);
31940 /* Walk the tree DIE and note DIEs with DW_OP_GNU_variable_value still
31941 with dw_val_class_decl_ref operand. */
31944 note_variable_value (dw_die_ref die
)
31948 dw_loc_list_ref loc
;
31951 FOR_EACH_VEC_SAFE_ELT (die
->die_attr
, ix
, a
)
31952 switch (AT_class (a
))
31954 case dw_val_class_loc_list
:
31955 loc
= AT_loc_list (a
);
31957 if (!loc
->noted_variable_value
)
31959 loc
->noted_variable_value
= 1;
31960 for (; loc
; loc
= loc
->dw_loc_next
)
31961 note_variable_value_in_expr (die
, loc
->expr
);
31964 case dw_val_class_loc
:
31965 note_variable_value_in_expr (die
, AT_loc (a
));
31971 /* Mark children. */
31972 FOR_EACH_CHILD (die
, c
, note_variable_value (c
));
31975 /* Perform any cleanups needed after the early debug generation pass
31979 dwarf2out_early_finish (const char *filename
)
31982 char dl_section_ref
[MAX_ARTIFICIAL_LABEL_BYTES
];
31984 /* PCH might result in DW_AT_producer string being restored from the
31985 header compilation, so always fill it with empty string initially
31986 and overwrite only here. */
31987 dw_attr_node
*producer
= get_AT (comp_unit_die (), DW_AT_producer
);
31988 producer_string
= gen_producer_string ();
31989 producer
->dw_attr_val
.v
.val_str
->refcount
--;
31990 producer
->dw_attr_val
.v
.val_str
= find_AT_string (producer_string
);
31992 /* Add the name for the main input file now. We delayed this from
31993 dwarf2out_init to avoid complications with PCH. */
31994 add_name_attribute (comp_unit_die (), remap_debug_filename (filename
));
31995 add_comp_dir_attribute (comp_unit_die ());
31997 /* When emitting DWARF5 .debug_line_str, move DW_AT_name and
31998 DW_AT_comp_dir into .debug_line_str section. */
31999 if (!output_asm_line_debug_info ()
32000 && dwarf_version
>= 5
32001 && DWARF5_USE_DEBUG_LINE_STR
)
32003 for (int i
= 0; i
< 2; i
++)
32005 dw_attr_node
*a
= get_AT (comp_unit_die (),
32006 i
? DW_AT_comp_dir
: DW_AT_name
);
32008 || AT_class (a
) != dw_val_class_str
32009 || strlen (AT_string (a
)) + 1 <= DWARF_OFFSET_SIZE
)
32012 if (! debug_line_str_hash
)
32013 debug_line_str_hash
32014 = hash_table
<indirect_string_hasher
>::create_ggc (10);
32016 struct indirect_string_node
*node
32017 = find_AT_string_in_table (AT_string (a
), debug_line_str_hash
);
32018 set_indirect_string (node
);
32019 node
->form
= DW_FORM_line_strp
;
32020 a
->dw_attr_val
.v
.val_str
->refcount
--;
32021 a
->dw_attr_val
.v
.val_str
= node
;
32025 /* With LTO early dwarf was really finished at compile-time, so make
32026 sure to adjust the phase after annotating the LTRANS CU DIE. */
32029 /* Force DW_TAG_imported_unit to be created now, otherwise
32030 we might end up without it or ordered after DW_TAG_inlined_subroutine
32031 referencing DIEs from it. */
32032 if (! flag_wpa
&& flag_incremental_link
!= INCREMENTAL_LINK_LTO
)
32036 if (external_die_map
)
32037 FOR_EACH_VEC_SAFE_ELT (all_translation_units
, i
, tu
)
32038 if (sym_off_pair
*desc
= external_die_map
->get (tu
))
32040 dw_die_ref import
= new_die (DW_TAG_imported_unit
,
32041 comp_unit_die (), NULL_TREE
);
32042 add_AT_external_die_ref (import
, DW_AT_import
,
32043 desc
->sym
, desc
->off
);
32047 early_dwarf_finished
= true;
32050 fprintf (dump_file
, "LTO EARLY DWARF for %s\n", filename
);
32051 print_die (comp_unit_die (), dump_file
);
32056 /* Walk through the list of incomplete types again, trying once more to
32057 emit full debugging info for them. */
32058 retry_incomplete_types ();
32060 /* The point here is to flush out the limbo list so that it is empty
32061 and we don't need to stream it for LTO. */
32062 flush_limbo_die_list ();
32064 gen_scheduled_generic_parms_dies ();
32065 gen_remaining_tmpl_value_param_die_attribute ();
32067 /* Add DW_AT_linkage_name for all deferred DIEs. */
32068 for (limbo_die_node
*node
= deferred_asm_name
; node
; node
= node
->next
)
32070 tree decl
= node
->created_for
;
32071 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
)
32072 /* A missing DECL_ASSEMBLER_NAME can be a constant DIE that
32073 ended up in deferred_asm_name before we knew it was
32074 constant and never written to disk. */
32075 && DECL_ASSEMBLER_NAME (decl
))
32077 add_linkage_attr (node
->die
, decl
);
32078 move_linkage_attr (node
->die
);
32081 deferred_asm_name
= NULL
;
32083 if (flag_eliminate_unused_debug_types
)
32084 prune_unused_types ();
32086 /* Generate separate COMDAT sections for type DIEs. */
32087 if (use_debug_types
)
32089 break_out_comdat_types (comp_unit_die ());
32091 /* Each new type_unit DIE was added to the limbo die list when created.
32092 Since these have all been added to comdat_type_list, clear the
32094 limbo_die_list
= NULL
;
32096 /* For each new comdat type unit, copy declarations for incomplete
32097 types to make the new unit self-contained (i.e., no direct
32098 references to the main compile unit). */
32099 for (comdat_type_node
*ctnode
= comdat_type_list
;
32100 ctnode
!= NULL
; ctnode
= ctnode
->next
)
32101 copy_decls_for_unworthy_types (ctnode
->root_die
);
32102 copy_decls_for_unworthy_types (comp_unit_die ());
32104 /* In the process of copying declarations from one unit to another,
32105 we may have left some declarations behind that are no longer
32106 referenced. Prune them. */
32107 prune_unused_types ();
32110 /* Traverse the DIE's and note DIEs with DW_OP_GNU_variable_value still
32111 with dw_val_class_decl_ref operand. */
32112 note_variable_value (comp_unit_die ());
32113 for (limbo_die_node
*node
= cu_die_list
; node
; node
= node
->next
)
32114 note_variable_value (node
->die
);
32115 for (comdat_type_node
*ctnode
= comdat_type_list
; ctnode
!= NULL
;
32116 ctnode
= ctnode
->next
)
32117 note_variable_value (ctnode
->root_die
);
32118 for (limbo_die_node
*node
= limbo_die_list
; node
; node
= node
->next
)
32119 note_variable_value (node
->die
);
32121 /* The AT_pubnames attribute needs to go in all skeleton dies, including
32122 both the main_cu and all skeleton TUs. Making this call unconditional
32123 would end up either adding a second copy of the AT_pubnames attribute, or
32124 requiring a special case in add_top_level_skeleton_die_attrs. */
32125 if (!dwarf_split_debug_info
)
32126 add_AT_pubnames (comp_unit_die ());
32128 /* The early debug phase is now finished. */
32129 early_dwarf_finished
= true;
32132 fprintf (dump_file
, "EARLY DWARF for %s\n", filename
);
32133 print_die (comp_unit_die (), dump_file
);
32136 /* Do not generate DWARF assembler now when not producing LTO bytecode. */
32137 if ((!flag_generate_lto
&& !flag_generate_offload
)
32138 /* FIXME: Disable debug info generation for (PE-)COFF targets since the
32139 copy_lto_debug_sections operation of the simple object support in
32140 libiberty is not implemented for them yet. */
32141 || TARGET_PECOFF
|| TARGET_COFF
)
32144 /* Now as we are going to output for LTO initialize sections and labels
32145 to the LTO variants. We don't need a random-seed postfix as other
32146 LTO sections as linking the LTO debug sections into one in a partial
32148 init_sections_and_labels (true);
32150 /* The output below is modeled after dwarf2out_finish with all
32151 location related output removed and some LTO specific changes.
32152 Some refactoring might make both smaller and easier to match up. */
32154 /* Traverse the DIE's and add add sibling attributes to those DIE's
32155 that have children. */
32156 add_sibling_attributes (comp_unit_die ());
32157 for (limbo_die_node
*node
= limbo_die_list
; node
; node
= node
->next
)
32158 add_sibling_attributes (node
->die
);
32159 for (comdat_type_node
*ctnode
= comdat_type_list
;
32160 ctnode
!= NULL
; ctnode
= ctnode
->next
)
32161 add_sibling_attributes (ctnode
->root_die
);
32163 /* AIX Assembler inserts the length, so adjust the reference to match the
32164 offset expected by debuggers. */
32165 strcpy (dl_section_ref
, debug_line_section_label
);
32166 if (XCOFF_DEBUGGING_INFO
)
32167 strcat (dl_section_ref
, DWARF_INITIAL_LENGTH_SIZE_STR
);
32169 if (debug_info_level
>= DINFO_LEVEL_TERSE
)
32170 add_AT_lineptr (comp_unit_die (), DW_AT_stmt_list
, dl_section_ref
);
32173 add_AT_macptr (comp_unit_die (), DEBUG_MACRO_ATTRIBUTE
,
32174 macinfo_section_label
);
32176 save_macinfo_strings ();
32178 if (dwarf_split_debug_info
)
32180 unsigned int index
= 0;
32181 debug_str_hash
->traverse_noresize
<unsigned int *, index_string
> (&index
);
32184 /* Output all of the compilation units. We put the main one last so that
32185 the offsets are available to output_pubnames. */
32186 for (limbo_die_node
*node
= limbo_die_list
; node
; node
= node
->next
)
32187 output_comp_unit (node
->die
, 0, NULL
);
32189 hash_table
<comdat_type_hasher
> comdat_type_table (100);
32190 for (comdat_type_node
*ctnode
= comdat_type_list
;
32191 ctnode
!= NULL
; ctnode
= ctnode
->next
)
32193 comdat_type_node
**slot
= comdat_type_table
.find_slot (ctnode
, INSERT
);
32195 /* Don't output duplicate types. */
32196 if (*slot
!= HTAB_EMPTY_ENTRY
)
32199 /* Add a pointer to the line table for the main compilation unit
32200 so that the debugger can make sense of DW_AT_decl_file
32202 if (debug_info_level
>= DINFO_LEVEL_TERSE
)
32203 add_AT_lineptr (ctnode
->root_die
, DW_AT_stmt_list
,
32204 (!dwarf_split_debug_info
32205 ? debug_line_section_label
32206 : debug_skeleton_line_section_label
));
32208 output_comdat_type_unit (ctnode
, true);
32212 /* Stick a unique symbol to the main debuginfo section. */
32213 compute_comp_unit_symbol (comp_unit_die ());
32215 /* Output the main compilation unit. We always need it if only for
32217 output_comp_unit (comp_unit_die (), true, NULL
);
32219 /* Output the abbreviation table. */
32220 if (vec_safe_length (abbrev_die_table
) != 1)
32222 switch_to_section (debug_abbrev_section
);
32223 ASM_OUTPUT_LABEL (asm_out_file
, abbrev_section_label
);
32224 output_abbrev_section ();
32227 /* Have to end the macro section. */
32230 /* We have to save macinfo state if we need to output it again
32231 for the FAT part of the object. */
32232 vec
<macinfo_entry
, va_gc
> *saved_macinfo_table
= macinfo_table
;
32233 if (flag_fat_lto_objects
)
32234 macinfo_table
= macinfo_table
->copy ();
32236 switch_to_section (debug_macinfo_section
);
32237 ASM_OUTPUT_LABEL (asm_out_file
, macinfo_section_label
);
32238 output_macinfo (debug_line_section_label
, true);
32239 dw2_asm_output_data (1, 0, "End compilation unit");
32241 if (flag_fat_lto_objects
)
32243 vec_free (macinfo_table
);
32244 macinfo_table
= saved_macinfo_table
;
32248 /* Emit a skeleton debug_line section. */
32249 switch_to_section (debug_line_section
);
32250 ASM_OUTPUT_LABEL (asm_out_file
, debug_line_section_label
);
32251 output_line_info (true);
32253 /* If we emitted any indirect strings, output the string table too. */
32254 if (debug_str_hash
|| skeleton_debug_str_hash
)
32255 output_indirect_strings ();
32256 if (debug_line_str_hash
)
32258 switch_to_section (debug_line_str_section
);
32259 const enum dwarf_form form
= DW_FORM_line_strp
;
32260 debug_line_str_hash
->traverse
<enum dwarf_form
,
32261 output_indirect_string
> (form
);
32264 /* Switch back to the text section. */
32265 switch_to_section (text_section
);
32268 /* Reset all state within dwarf2out.c so that we can rerun the compiler
32269 within the same process. For use by toplev::finalize. */
32272 dwarf2out_c_finalize (void)
32274 last_var_location_insn
= NULL
;
32275 cached_next_real_insn
= NULL
;
32276 used_rtx_array
= NULL
;
32277 incomplete_types
= NULL
;
32278 debug_info_section
= NULL
;
32279 debug_skeleton_info_section
= NULL
;
32280 debug_abbrev_section
= NULL
;
32281 debug_skeleton_abbrev_section
= NULL
;
32282 debug_aranges_section
= NULL
;
32283 debug_addr_section
= NULL
;
32284 debug_macinfo_section
= NULL
;
32285 debug_line_section
= NULL
;
32286 debug_skeleton_line_section
= NULL
;
32287 debug_loc_section
= NULL
;
32288 debug_pubnames_section
= NULL
;
32289 debug_pubtypes_section
= NULL
;
32290 debug_str_section
= NULL
;
32291 debug_line_str_section
= NULL
;
32292 debug_str_dwo_section
= NULL
;
32293 debug_str_offsets_section
= NULL
;
32294 debug_ranges_section
= NULL
;
32295 debug_frame_section
= NULL
;
32297 debug_str_hash
= NULL
;
32298 debug_line_str_hash
= NULL
;
32299 skeleton_debug_str_hash
= NULL
;
32300 dw2_string_counter
= 0;
32301 have_multiple_function_sections
= false;
32302 text_section_used
= false;
32303 cold_text_section_used
= false;
32304 cold_text_section
= NULL
;
32305 current_unit_personality
= NULL
;
32307 early_dwarf
= false;
32308 early_dwarf_finished
= false;
32310 next_die_offset
= 0;
32311 single_comp_unit_die
= NULL
;
32312 comdat_type_list
= NULL
;
32313 limbo_die_list
= NULL
;
32315 decl_die_table
= NULL
;
32316 common_block_die_table
= NULL
;
32317 decl_loc_table
= NULL
;
32318 call_arg_locations
= NULL
;
32319 call_arg_loc_last
= NULL
;
32320 call_site_count
= -1;
32321 tail_call_site_count
= -1;
32322 cached_dw_loc_list_table
= NULL
;
32323 abbrev_die_table
= NULL
;
32324 delete dwarf_proc_stack_usage_map
;
32325 dwarf_proc_stack_usage_map
= NULL
;
32326 line_info_label_num
= 0;
32327 cur_line_info_table
= NULL
;
32328 text_section_line_info
= NULL
;
32329 cold_text_section_line_info
= NULL
;
32330 separate_line_info
= NULL
;
32331 info_section_emitted
= false;
32332 pubname_table
= NULL
;
32333 pubtype_table
= NULL
;
32334 macinfo_table
= NULL
;
32335 ranges_table
= NULL
;
32336 ranges_by_label
= NULL
;
32338 have_location_lists
= false;
32341 last_emitted_file
= NULL
;
32343 tmpl_value_parm_die_table
= NULL
;
32344 generic_type_instances
= NULL
;
32345 frame_pointer_fb_offset
= 0;
32346 frame_pointer_fb_offset_valid
= false;
32347 base_types
.release ();
32348 XDELETEVEC (producer_string
);
32349 producer_string
= NULL
;
32352 #include "gt-dwarf2out.h"