1 /* Implements exception handling.
2 Copyright (C) 1989-2014 Free Software Foundation, Inc.
3 Contributed by Mike Stump <mrs@cygnus.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* An exception is an event that can be "thrown" from within a
23 function. This event can then be "caught" by the callers of
26 The representation of exceptions changes several times during
27 the compilation process:
29 In the beginning, in the front end, we have the GENERIC trees
30 TRY_CATCH_EXPR, TRY_FINALLY_EXPR, WITH_CLEANUP_EXPR,
31 CLEANUP_POINT_EXPR, CATCH_EXPR, and EH_FILTER_EXPR.
33 During initial gimplification (gimplify.c) these are lowered
34 to the GIMPLE_TRY, GIMPLE_CATCH, and GIMPLE_EH_FILTER nodes.
35 The WITH_CLEANUP_EXPR and CLEANUP_POINT_EXPR nodes are converted
36 into GIMPLE_TRY_FINALLY nodes; the others are a more direct 1-1
39 During pass_lower_eh (tree-eh.c) we record the nested structure
40 of the TRY nodes in EH_REGION nodes in CFUN->EH->REGION_TREE.
41 We expand the eh_protect_cleanup_actions langhook into MUST_NOT_THROW
42 regions at this time. We can then flatten the statements within
43 the TRY nodes to straight-line code. Statements that had been within
44 TRY nodes that can throw are recorded within CFUN->EH->THROW_STMT_TABLE,
45 so that we may remember what action is supposed to be taken if
46 a given statement does throw. During this lowering process,
47 we create an EH_LANDING_PAD node for each EH_REGION that has
48 some code within the function that needs to be executed if a
49 throw does happen. We also create RESX statements that are
50 used to transfer control from an inner EH_REGION to an outer
51 EH_REGION. We also create EH_DISPATCH statements as placeholders
52 for a runtime type comparison that should be made in order to
53 select the action to perform among different CATCH and EH_FILTER
56 During pass_lower_eh_dispatch (tree-eh.c), which is run after
57 all inlining is complete, we are able to run assign_filter_values,
58 which allows us to map the set of types manipulated by all of the
59 CATCH and EH_FILTER regions to a set of integers. This set of integers
60 will be how the exception runtime communicates with the code generated
61 within the function. We then expand the GIMPLE_EH_DISPATCH statements
62 to a switch or conditional branches that use the argument provided by
63 the runtime (__builtin_eh_filter) and the set of integers we computed
64 in assign_filter_values.
66 During pass_lower_resx (tree-eh.c), which is run near the end
67 of optimization, we expand RESX statements. If the eh region
68 that is outer to the RESX statement is a MUST_NOT_THROW, then
69 the RESX expands to some form of abort statement. If the eh
70 region that is outer to the RESX statement is within the current
71 function, then the RESX expands to a bookkeeping call
72 (__builtin_eh_copy_values) and a goto. Otherwise, the next
73 handler for the exception must be within a function somewhere
74 up the call chain, so we call back into the exception runtime
75 (__builtin_unwind_resume).
77 During pass_expand (cfgexpand.c), we generate REG_EH_REGION notes
78 that create an rtl to eh_region mapping that corresponds to the
79 gimple to eh_region mapping that had been recorded in the
82 Then, via finish_eh_generation, we generate the real landing pads
83 to which the runtime will actually transfer control. These new
84 landing pads perform whatever bookkeeping is needed by the target
85 backend in order to resume execution within the current function.
86 Each of these new landing pads falls through into the post_landing_pad
87 label which had been used within the CFG up to this point. All
88 exception edges within the CFG are redirected to the new landing pads.
89 If the target uses setjmp to implement exceptions, the various extra
90 calls into the runtime to register and unregister the current stack
91 frame are emitted at this time.
93 During pass_convert_to_eh_region_ranges (except.c), we transform
94 the REG_EH_REGION notes attached to individual insns into
95 non-overlapping ranges of insns bounded by NOTE_INSN_EH_REGION_BEG
96 and NOTE_INSN_EH_REGION_END. Each insn within such ranges has the
97 same associated action within the exception region tree, meaning
98 that (1) the exception is caught by the same landing pad within the
99 current function, (2) the exception is blocked by the runtime with
100 a MUST_NOT_THROW region, or (3) the exception is not handled at all
101 within the current function.
103 Finally, during assembly generation, we call
104 output_function_exception_table (except.c) to emit the tables with
105 which the exception runtime can determine if a given stack frame
106 handles a given exception, and if so what filter value to provide
107 to the function when the non-local control transfer is effected.
108 If the target uses dwarf2 unwinding to implement exceptions, then
109 output_call_frame_info (dwarf2out.c) emits the required unwind data. */
114 #include "coretypes.h"
118 #include "stringpool.h"
119 #include "stor-layout.h"
121 #include "function.h"
123 #include "libfuncs.h"
124 #include "insn-config.h"
126 #include "hard-reg-set.h"
128 #include "dwarf2asm.h"
129 #include "dwarf2out.h"
132 #include "hash-table.h"
136 #include "common/common-target.h"
137 #include "langhooks.h"
139 #include "diagnostic.h"
140 #include "tree-pretty-print.h"
141 #include "tree-pass.h"
142 #include "pointer-set.h"
145 /* Provide defaults for stuff that may not be defined when using
147 #ifndef EH_RETURN_DATA_REGNO
148 #define EH_RETURN_DATA_REGNO(N) INVALID_REGNUM
151 static GTY(()) int call_site_base
;
152 static GTY ((param_is (union tree_node
)))
153 htab_t type_to_runtime_map
;
155 /* Describe the SjLj_Function_Context structure. */
156 static GTY(()) tree sjlj_fc_type_node
;
157 static int sjlj_fc_call_site_ofs
;
158 static int sjlj_fc_data_ofs
;
159 static int sjlj_fc_personality_ofs
;
160 static int sjlj_fc_lsda_ofs
;
161 static int sjlj_fc_jbuf_ofs
;
164 struct GTY(()) call_site_record_d
170 /* In the following structure and associated functions,
171 we represent entries in the action table as 1-based indices.
174 0: null action record, non-null landing pad; implies cleanups
175 -1: null action record, null landing pad; implies no action
176 -2: no call-site entry; implies must_not_throw
177 -3: we have yet to process outer regions
179 Further, no special cases apply to the "next" field of the record.
180 For next, 0 means end of list. */
189 /* Hashtable helpers. */
191 struct action_record_hasher
: typed_free_remove
<action_record
>
193 typedef action_record value_type
;
194 typedef action_record compare_type
;
195 static inline hashval_t
hash (const value_type
*);
196 static inline bool equal (const value_type
*, const compare_type
*);
200 action_record_hasher::hash (const value_type
*entry
)
202 return entry
->next
* 1009 + entry
->filter
;
206 action_record_hasher::equal (const value_type
*entry
, const compare_type
*data
)
208 return entry
->filter
== data
->filter
&& entry
->next
== data
->next
;
211 typedef hash_table
<action_record_hasher
> action_hash_type
;
213 static bool get_eh_region_and_lp_from_rtx (const_rtx
, eh_region
*,
216 static int t2r_eq (const void *, const void *);
217 static hashval_t
t2r_hash (const void *);
219 static void dw2_build_landing_pads (void);
221 static int collect_one_action_chain (action_hash_type
, eh_region
);
222 static int add_call_site (rtx
, int, int);
224 static void push_uleb128 (vec
<uchar
, va_gc
> **, unsigned int);
225 static void push_sleb128 (vec
<uchar
, va_gc
> **, int);
226 #ifndef HAVE_AS_LEB128
227 static int dw2_size_of_call_site_table (int);
228 static int sjlj_size_of_call_site_table (void);
230 static void dw2_output_call_site_table (int, int);
231 static void sjlj_output_call_site_table (void);
237 if (! flag_exceptions
)
240 type_to_runtime_map
= htab_create_ggc (31, t2r_hash
, t2r_eq
, NULL
);
242 /* Create the SjLj_Function_Context structure. This should match
243 the definition in unwind-sjlj.c. */
244 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
246 tree f_jbuf
, f_per
, f_lsda
, f_prev
, f_cs
, f_data
, tmp
;
248 sjlj_fc_type_node
= lang_hooks
.types
.make_type (RECORD_TYPE
);
250 f_prev
= build_decl (BUILTINS_LOCATION
,
251 FIELD_DECL
, get_identifier ("__prev"),
252 build_pointer_type (sjlj_fc_type_node
));
253 DECL_FIELD_CONTEXT (f_prev
) = sjlj_fc_type_node
;
255 f_cs
= build_decl (BUILTINS_LOCATION
,
256 FIELD_DECL
, get_identifier ("__call_site"),
258 DECL_FIELD_CONTEXT (f_cs
) = sjlj_fc_type_node
;
260 tmp
= build_index_type (size_int (4 - 1));
261 tmp
= build_array_type (lang_hooks
.types
.type_for_mode
262 (targetm
.unwind_word_mode (), 1),
264 f_data
= build_decl (BUILTINS_LOCATION
,
265 FIELD_DECL
, get_identifier ("__data"), tmp
);
266 DECL_FIELD_CONTEXT (f_data
) = sjlj_fc_type_node
;
268 f_per
= build_decl (BUILTINS_LOCATION
,
269 FIELD_DECL
, get_identifier ("__personality"),
271 DECL_FIELD_CONTEXT (f_per
) = sjlj_fc_type_node
;
273 f_lsda
= build_decl (BUILTINS_LOCATION
,
274 FIELD_DECL
, get_identifier ("__lsda"),
276 DECL_FIELD_CONTEXT (f_lsda
) = sjlj_fc_type_node
;
278 #ifdef DONT_USE_BUILTIN_SETJMP
280 tmp
= size_int (JMP_BUF_SIZE
- 1);
282 /* Should be large enough for most systems, if it is not,
283 JMP_BUF_SIZE should be defined with the proper value. It will
284 also tend to be larger than necessary for most systems, a more
285 optimal port will define JMP_BUF_SIZE. */
286 tmp
= size_int (FIRST_PSEUDO_REGISTER
+ 2 - 1);
289 /* builtin_setjmp takes a pointer to 5 words. */
290 tmp
= size_int (5 * BITS_PER_WORD
/ POINTER_SIZE
- 1);
292 tmp
= build_index_type (tmp
);
293 tmp
= build_array_type (ptr_type_node
, tmp
);
294 f_jbuf
= build_decl (BUILTINS_LOCATION
,
295 FIELD_DECL
, get_identifier ("__jbuf"), tmp
);
296 #ifdef DONT_USE_BUILTIN_SETJMP
297 /* We don't know what the alignment requirements of the
298 runtime's jmp_buf has. Overestimate. */
299 DECL_ALIGN (f_jbuf
) = BIGGEST_ALIGNMENT
;
300 DECL_USER_ALIGN (f_jbuf
) = 1;
302 DECL_FIELD_CONTEXT (f_jbuf
) = sjlj_fc_type_node
;
304 TYPE_FIELDS (sjlj_fc_type_node
) = f_prev
;
305 TREE_CHAIN (f_prev
) = f_cs
;
306 TREE_CHAIN (f_cs
) = f_data
;
307 TREE_CHAIN (f_data
) = f_per
;
308 TREE_CHAIN (f_per
) = f_lsda
;
309 TREE_CHAIN (f_lsda
) = f_jbuf
;
311 layout_type (sjlj_fc_type_node
);
313 /* Cache the interesting field offsets so that we have
314 easy access from rtl. */
315 sjlj_fc_call_site_ofs
316 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_cs
))
317 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_cs
)) / BITS_PER_UNIT
);
319 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_data
))
320 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_data
)) / BITS_PER_UNIT
);
321 sjlj_fc_personality_ofs
322 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_per
))
323 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_per
)) / BITS_PER_UNIT
);
325 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_lsda
))
326 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_lsda
)) / BITS_PER_UNIT
);
328 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_jbuf
))
329 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_jbuf
)) / BITS_PER_UNIT
);
334 init_eh_for_function (void)
336 cfun
->eh
= ggc_cleared_alloc
<eh_status
> ();
338 /* Make sure zero'th entries are used. */
339 vec_safe_push (cfun
->eh
->region_array
, (eh_region
)0);
340 vec_safe_push (cfun
->eh
->lp_array
, (eh_landing_pad
)0);
343 /* Routines to generate the exception tree somewhat directly.
344 These are used from tree-eh.c when processing exception related
345 nodes during tree optimization. */
348 gen_eh_region (enum eh_region_type type
, eh_region outer
)
352 /* Insert a new blank region as a leaf in the tree. */
353 new_eh
= ggc_cleared_alloc
<eh_region_d
> ();
355 new_eh
->outer
= outer
;
358 new_eh
->next_peer
= outer
->inner
;
359 outer
->inner
= new_eh
;
363 new_eh
->next_peer
= cfun
->eh
->region_tree
;
364 cfun
->eh
->region_tree
= new_eh
;
367 new_eh
->index
= vec_safe_length (cfun
->eh
->region_array
);
368 vec_safe_push (cfun
->eh
->region_array
, new_eh
);
370 /* Copy the language's notion of whether to use __cxa_end_cleanup. */
371 if (targetm
.arm_eabi_unwinder
&& lang_hooks
.eh_use_cxa_end_cleanup
)
372 new_eh
->use_cxa_end_cleanup
= true;
378 gen_eh_region_cleanup (eh_region outer
)
380 return gen_eh_region (ERT_CLEANUP
, outer
);
384 gen_eh_region_try (eh_region outer
)
386 return gen_eh_region (ERT_TRY
, outer
);
390 gen_eh_region_catch (eh_region t
, tree type_or_list
)
393 tree type_list
, type_node
;
395 gcc_assert (t
->type
== ERT_TRY
);
397 /* Ensure to always end up with a type list to normalize further
398 processing, then register each type against the runtime types map. */
399 type_list
= type_or_list
;
402 if (TREE_CODE (type_or_list
) != TREE_LIST
)
403 type_list
= tree_cons (NULL_TREE
, type_or_list
, NULL_TREE
);
405 type_node
= type_list
;
406 for (; type_node
; type_node
= TREE_CHAIN (type_node
))
407 add_type_for_runtime (TREE_VALUE (type_node
));
410 c
= ggc_cleared_alloc
<eh_catch_d
> ();
411 c
->type_list
= type_list
;
412 l
= t
->u
.eh_try
.last_catch
;
417 t
->u
.eh_try
.first_catch
= c
;
418 t
->u
.eh_try
.last_catch
= c
;
424 gen_eh_region_allowed (eh_region outer
, tree allowed
)
426 eh_region region
= gen_eh_region (ERT_ALLOWED_EXCEPTIONS
, outer
);
427 region
->u
.allowed
.type_list
= allowed
;
429 for (; allowed
; allowed
= TREE_CHAIN (allowed
))
430 add_type_for_runtime (TREE_VALUE (allowed
));
436 gen_eh_region_must_not_throw (eh_region outer
)
438 return gen_eh_region (ERT_MUST_NOT_THROW
, outer
);
442 gen_eh_landing_pad (eh_region region
)
444 eh_landing_pad lp
= ggc_cleared_alloc
<eh_landing_pad_d
> ();
446 lp
->next_lp
= region
->landing_pads
;
448 lp
->index
= vec_safe_length (cfun
->eh
->lp_array
);
449 region
->landing_pads
= lp
;
451 vec_safe_push (cfun
->eh
->lp_array
, lp
);
457 get_eh_region_from_number_fn (struct function
*ifun
, int i
)
459 return (*ifun
->eh
->region_array
)[i
];
463 get_eh_region_from_number (int i
)
465 return get_eh_region_from_number_fn (cfun
, i
);
469 get_eh_landing_pad_from_number_fn (struct function
*ifun
, int i
)
471 return (*ifun
->eh
->lp_array
)[i
];
475 get_eh_landing_pad_from_number (int i
)
477 return get_eh_landing_pad_from_number_fn (cfun
, i
);
481 get_eh_region_from_lp_number_fn (struct function
*ifun
, int i
)
484 return (*ifun
->eh
->region_array
)[-i
];
490 lp
= (*ifun
->eh
->lp_array
)[i
];
496 get_eh_region_from_lp_number (int i
)
498 return get_eh_region_from_lp_number_fn (cfun
, i
);
501 /* Returns true if the current function has exception handling regions. */
504 current_function_has_exception_handlers (void)
506 return cfun
->eh
->region_tree
!= NULL
;
509 /* A subroutine of duplicate_eh_regions. Copy the eh_region tree at OLD.
510 Root it at OUTER, and apply LP_OFFSET to the lp numbers. */
512 struct duplicate_eh_regions_data
514 duplicate_eh_regions_map label_map
;
515 void *label_map_data
;
516 struct pointer_map_t
*eh_map
;
520 duplicate_eh_regions_1 (struct duplicate_eh_regions_data
*data
,
521 eh_region old_r
, eh_region outer
)
523 eh_landing_pad old_lp
, new_lp
;
527 new_r
= gen_eh_region (old_r
->type
, outer
);
528 slot
= pointer_map_insert (data
->eh_map
, (void *)old_r
);
529 gcc_assert (*slot
== NULL
);
530 *slot
= (void *)new_r
;
540 for (oc
= old_r
->u
.eh_try
.first_catch
; oc
; oc
= oc
->next_catch
)
542 /* We should be doing all our region duplication before and
543 during inlining, which is before filter lists are created. */
544 gcc_assert (oc
->filter_list
== NULL
);
545 nc
= gen_eh_region_catch (new_r
, oc
->type_list
);
546 nc
->label
= data
->label_map (oc
->label
, data
->label_map_data
);
551 case ERT_ALLOWED_EXCEPTIONS
:
552 new_r
->u
.allowed
.type_list
= old_r
->u
.allowed
.type_list
;
553 if (old_r
->u
.allowed
.label
)
554 new_r
->u
.allowed
.label
555 = data
->label_map (old_r
->u
.allowed
.label
, data
->label_map_data
);
557 new_r
->u
.allowed
.label
= NULL_TREE
;
560 case ERT_MUST_NOT_THROW
:
561 new_r
->u
.must_not_throw
.failure_loc
=
562 LOCATION_LOCUS (old_r
->u
.must_not_throw
.failure_loc
);
563 new_r
->u
.must_not_throw
.failure_decl
=
564 old_r
->u
.must_not_throw
.failure_decl
;
568 for (old_lp
= old_r
->landing_pads
; old_lp
; old_lp
= old_lp
->next_lp
)
570 /* Don't bother copying unused landing pads. */
571 if (old_lp
->post_landing_pad
== NULL
)
574 new_lp
= gen_eh_landing_pad (new_r
);
575 slot
= pointer_map_insert (data
->eh_map
, (void *)old_lp
);
576 gcc_assert (*slot
== NULL
);
577 *slot
= (void *)new_lp
;
579 new_lp
->post_landing_pad
580 = data
->label_map (old_lp
->post_landing_pad
, data
->label_map_data
);
581 EH_LANDING_PAD_NR (new_lp
->post_landing_pad
) = new_lp
->index
;
584 /* Make sure to preserve the original use of __cxa_end_cleanup. */
585 new_r
->use_cxa_end_cleanup
= old_r
->use_cxa_end_cleanup
;
587 for (old_r
= old_r
->inner
; old_r
; old_r
= old_r
->next_peer
)
588 duplicate_eh_regions_1 (data
, old_r
, new_r
);
591 /* Duplicate the EH regions from IFUN rooted at COPY_REGION into
592 the current function and root the tree below OUTER_REGION.
593 The special case of COPY_REGION of NULL means all regions.
594 Remap labels using MAP/MAP_DATA callback. Return a pointer map
595 that allows the caller to remap uses of both EH regions and
598 struct pointer_map_t
*
599 duplicate_eh_regions (struct function
*ifun
,
600 eh_region copy_region
, int outer_lp
,
601 duplicate_eh_regions_map map
, void *map_data
)
603 struct duplicate_eh_regions_data data
;
604 eh_region outer_region
;
606 #ifdef ENABLE_CHECKING
607 verify_eh_tree (ifun
);
610 data
.label_map
= map
;
611 data
.label_map_data
= map_data
;
612 data
.eh_map
= pointer_map_create ();
614 outer_region
= get_eh_region_from_lp_number (outer_lp
);
616 /* Copy all the regions in the subtree. */
618 duplicate_eh_regions_1 (&data
, copy_region
, outer_region
);
622 for (r
= ifun
->eh
->region_tree
; r
; r
= r
->next_peer
)
623 duplicate_eh_regions_1 (&data
, r
, outer_region
);
626 #ifdef ENABLE_CHECKING
627 verify_eh_tree (cfun
);
633 /* Return the region that is outer to both REGION_A and REGION_B in IFUN. */
636 eh_region_outermost (struct function
*ifun
, eh_region region_a
,
641 gcc_assert (ifun
->eh
->region_array
);
642 gcc_assert (ifun
->eh
->region_tree
);
644 b_outer
= sbitmap_alloc (ifun
->eh
->region_array
->length ());
645 bitmap_clear (b_outer
);
649 bitmap_set_bit (b_outer
, region_b
->index
);
650 region_b
= region_b
->outer
;
656 if (bitmap_bit_p (b_outer
, region_a
->index
))
658 region_a
= region_a
->outer
;
662 sbitmap_free (b_outer
);
667 t2r_eq (const void *pentry
, const void *pdata
)
669 const_tree
const entry
= (const_tree
) pentry
;
670 const_tree
const data
= (const_tree
) pdata
;
672 return TREE_PURPOSE (entry
) == data
;
676 t2r_hash (const void *pentry
)
678 const_tree
const entry
= (const_tree
) pentry
;
679 return TREE_HASH (TREE_PURPOSE (entry
));
683 add_type_for_runtime (tree type
)
687 /* If TYPE is NOP_EXPR, it means that it already is a runtime type. */
688 if (TREE_CODE (type
) == NOP_EXPR
)
691 slot
= (tree
*) htab_find_slot_with_hash (type_to_runtime_map
, type
,
692 TREE_HASH (type
), INSERT
);
695 tree runtime
= lang_hooks
.eh_runtime_type (type
);
696 *slot
= tree_cons (type
, runtime
, NULL_TREE
);
701 lookup_type_for_runtime (tree type
)
705 /* If TYPE is NOP_EXPR, it means that it already is a runtime type. */
706 if (TREE_CODE (type
) == NOP_EXPR
)
709 slot
= (tree
*) htab_find_slot_with_hash (type_to_runtime_map
, type
,
710 TREE_HASH (type
), NO_INSERT
);
712 /* We should have always inserted the data earlier. */
713 return TREE_VALUE (*slot
);
717 /* Represent an entry in @TTypes for either catch actions
718 or exception filter actions. */
719 struct ttypes_filter
{
724 /* Helper for ttypes_filter hashing. */
726 struct ttypes_filter_hasher
: typed_free_remove
<ttypes_filter
>
728 typedef ttypes_filter value_type
;
729 typedef tree_node compare_type
;
730 static inline hashval_t
hash (const value_type
*);
731 static inline bool equal (const value_type
*, const compare_type
*);
734 /* Compare ENTRY (a ttypes_filter entry in the hash table) with DATA
735 (a tree) for a @TTypes type node we are thinking about adding. */
738 ttypes_filter_hasher::equal (const value_type
*entry
, const compare_type
*data
)
740 return entry
->t
== data
;
744 ttypes_filter_hasher::hash (const value_type
*entry
)
746 return TREE_HASH (entry
->t
);
749 typedef hash_table
<ttypes_filter_hasher
> ttypes_hash_type
;
752 /* Helper for ehspec hashing. */
754 struct ehspec_hasher
: typed_free_remove
<ttypes_filter
>
756 typedef ttypes_filter value_type
;
757 typedef ttypes_filter compare_type
;
758 static inline hashval_t
hash (const value_type
*);
759 static inline bool equal (const value_type
*, const compare_type
*);
762 /* Compare ENTRY with DATA (both struct ttypes_filter) for a @TTypes
763 exception specification list we are thinking about adding. */
764 /* ??? Currently we use the type lists in the order given. Someone
765 should put these in some canonical order. */
768 ehspec_hasher::equal (const value_type
*entry
, const compare_type
*data
)
770 return type_list_equal (entry
->t
, data
->t
);
773 /* Hash function for exception specification lists. */
776 ehspec_hasher::hash (const value_type
*entry
)
781 for (list
= entry
->t
; list
; list
= TREE_CHAIN (list
))
782 h
= (h
<< 5) + (h
>> 27) + TREE_HASH (TREE_VALUE (list
));
786 typedef hash_table
<ehspec_hasher
> ehspec_hash_type
;
789 /* Add TYPE (which may be NULL) to cfun->eh->ttype_data, using TYPES_HASH
790 to speed up the search. Return the filter value to be used. */
793 add_ttypes_entry (ttypes_hash_type ttypes_hash
, tree type
)
795 struct ttypes_filter
**slot
, *n
;
797 slot
= ttypes_hash
.find_slot_with_hash (type
, (hashval_t
) TREE_HASH (type
),
800 if ((n
= *slot
) == NULL
)
802 /* Filter value is a 1 based table index. */
804 n
= XNEW (struct ttypes_filter
);
806 n
->filter
= vec_safe_length (cfun
->eh
->ttype_data
) + 1;
809 vec_safe_push (cfun
->eh
->ttype_data
, type
);
815 /* Add LIST to cfun->eh->ehspec_data, using EHSPEC_HASH and TYPES_HASH
816 to speed up the search. Return the filter value to be used. */
819 add_ehspec_entry (ehspec_hash_type ehspec_hash
, ttypes_hash_type ttypes_hash
,
822 struct ttypes_filter
**slot
, *n
;
823 struct ttypes_filter dummy
;
826 slot
= ehspec_hash
.find_slot (&dummy
, INSERT
);
828 if ((n
= *slot
) == NULL
)
832 if (targetm
.arm_eabi_unwinder
)
833 len
= vec_safe_length (cfun
->eh
->ehspec_data
.arm_eabi
);
835 len
= vec_safe_length (cfun
->eh
->ehspec_data
.other
);
837 /* Filter value is a -1 based byte index into a uleb128 buffer. */
839 n
= XNEW (struct ttypes_filter
);
841 n
->filter
= -(len
+ 1);
844 /* Generate a 0 terminated list of filter values. */
845 for (; list
; list
= TREE_CHAIN (list
))
847 if (targetm
.arm_eabi_unwinder
)
848 vec_safe_push (cfun
->eh
->ehspec_data
.arm_eabi
, TREE_VALUE (list
));
851 /* Look up each type in the list and encode its filter
852 value as a uleb128. */
853 push_uleb128 (&cfun
->eh
->ehspec_data
.other
,
854 add_ttypes_entry (ttypes_hash
, TREE_VALUE (list
)));
857 if (targetm
.arm_eabi_unwinder
)
858 vec_safe_push (cfun
->eh
->ehspec_data
.arm_eabi
, NULL_TREE
);
860 vec_safe_push (cfun
->eh
->ehspec_data
.other
, (uchar
)0);
866 /* Generate the action filter values to be used for CATCH and
867 ALLOWED_EXCEPTIONS regions. When using dwarf2 exception regions,
868 we use lots of landing pads, and so every type or list can share
869 the same filter value, which saves table space. */
872 assign_filter_values (void)
875 ttypes_hash_type ttypes
;
876 ehspec_hash_type ehspec
;
880 vec_alloc (cfun
->eh
->ttype_data
, 16);
881 if (targetm
.arm_eabi_unwinder
)
882 vec_alloc (cfun
->eh
->ehspec_data
.arm_eabi
, 64);
884 vec_alloc (cfun
->eh
->ehspec_data
.other
, 64);
889 for (i
= 1; vec_safe_iterate (cfun
->eh
->region_array
, i
, &r
); ++i
)
897 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
899 /* Whatever type_list is (NULL or true list), we build a list
900 of filters for the region. */
901 c
->filter_list
= NULL_TREE
;
903 if (c
->type_list
!= NULL
)
905 /* Get a filter value for each of the types caught and store
906 them in the region's dedicated list. */
907 tree tp_node
= c
->type_list
;
909 for ( ; tp_node
; tp_node
= TREE_CHAIN (tp_node
))
911 int flt
= add_ttypes_entry (ttypes
, TREE_VALUE (tp_node
));
912 tree flt_node
= build_int_cst (integer_type_node
, flt
);
915 = tree_cons (NULL_TREE
, flt_node
, c
->filter_list
);
920 /* Get a filter value for the NULL list also since it
921 will need an action record anyway. */
922 int flt
= add_ttypes_entry (ttypes
, NULL
);
923 tree flt_node
= build_int_cst (integer_type_node
, flt
);
926 = tree_cons (NULL_TREE
, flt_node
, NULL
);
931 case ERT_ALLOWED_EXCEPTIONS
:
933 = add_ehspec_entry (ehspec
, ttypes
, r
->u
.allowed
.type_list
);
945 /* Emit SEQ into basic block just before INSN (that is assumed to be
946 first instruction of some existing BB and return the newly
949 emit_to_new_bb_before (rtx seq
, rtx insn
)
956 /* If there happens to be a fallthru edge (possibly created by cleanup_cfg
957 call), we don't want it to go into newly created landing pad or other EH
959 for (ei
= ei_start (BLOCK_FOR_INSN (insn
)->preds
); (e
= ei_safe_edge (ei
)); )
960 if (e
->flags
& EDGE_FALLTHRU
)
961 force_nonfallthru (e
);
964 last
= emit_insn_before (seq
, insn
);
965 if (BARRIER_P (last
))
966 last
= PREV_INSN (last
);
967 bb
= create_basic_block (seq
, last
, BLOCK_FOR_INSN (insn
)->prev_bb
);
968 update_bb_for_insn (bb
);
969 bb
->flags
|= BB_SUPERBLOCK
;
973 /* A subroutine of dw2_build_landing_pads, also used for edge splitting
974 at the rtl level. Emit the code required by the target at a landing
975 pad for the given region. */
978 expand_dw2_landing_pad_for_region (eh_region region
)
980 #ifdef HAVE_exception_receiver
981 if (HAVE_exception_receiver
)
982 emit_insn (gen_exception_receiver ());
985 #ifdef HAVE_nonlocal_goto_receiver
986 if (HAVE_nonlocal_goto_receiver
)
987 emit_insn (gen_nonlocal_goto_receiver ());
992 if (region
->exc_ptr_reg
)
993 emit_move_insn (region
->exc_ptr_reg
,
994 gen_rtx_REG (ptr_mode
, EH_RETURN_DATA_REGNO (0)));
995 if (region
->filter_reg
)
996 emit_move_insn (region
->filter_reg
,
997 gen_rtx_REG (targetm
.eh_return_filter_mode (),
998 EH_RETURN_DATA_REGNO (1)));
1001 /* Expand the extra code needed at landing pads for dwarf2 unwinding. */
1004 dw2_build_landing_pads (void)
1008 int e_flags
= EDGE_FALLTHRU
;
1010 /* If we're going to partition blocks, we need to be able to add
1011 new landing pads later, which means that we need to hold on to
1012 the post-landing-pad block. Prevent it from being merged away.
1013 We'll remove this bit after partitioning. */
1014 if (flag_reorder_blocks_and_partition
)
1015 e_flags
|= EDGE_PRESERVE
;
1017 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1023 if (lp
== NULL
|| lp
->post_landing_pad
== NULL
)
1028 lp
->landing_pad
= gen_label_rtx ();
1029 emit_label (lp
->landing_pad
);
1030 LABEL_PRESERVE_P (lp
->landing_pad
) = 1;
1032 expand_dw2_landing_pad_for_region (lp
->region
);
1037 bb
= emit_to_new_bb_before (seq
, label_rtx (lp
->post_landing_pad
));
1038 e
= make_edge (bb
, bb
->next_bb
, e_flags
);
1039 e
->count
= bb
->count
;
1040 e
->probability
= REG_BR_PROB_BASE
;
1043 struct loop
*loop
= bb
->next_bb
->loop_father
;
1044 /* If we created a pre-header block, add the new block to the
1045 outer loop, otherwise to the loop itself. */
1046 if (bb
->next_bb
== loop
->header
)
1047 add_bb_to_loop (bb
, loop_outer (loop
));
1049 add_bb_to_loop (bb
, loop
);
1055 static vec
<int> sjlj_lp_call_site_index
;
1057 /* Process all active landing pads. Assign each one a compact dispatch
1058 index, and a call-site index. */
1061 sjlj_assign_call_site_values (void)
1063 action_hash_type ar_hash
;
1067 vec_alloc (crtl
->eh
.action_record_data
, 64);
1068 ar_hash
.create (31);
1072 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1073 if (lp
&& lp
->post_landing_pad
)
1075 int action
, call_site
;
1077 /* First: build the action table. */
1078 action
= collect_one_action_chain (ar_hash
, lp
->region
);
1080 /* Next: assign call-site values. If dwarf2 terms, this would be
1081 the region number assigned by convert_to_eh_region_ranges, but
1082 handles no-action and must-not-throw differently. */
1083 /* Map must-not-throw to otherwise unused call-site index 0. */
1086 /* Map no-action to otherwise unused call-site index -1. */
1087 else if (action
== -1)
1089 /* Otherwise, look it up in the table. */
1091 call_site
= add_call_site (GEN_INT (disp_index
), action
, 0);
1092 sjlj_lp_call_site_index
[i
] = call_site
;
1102 /* Emit code to record the current call-site index before every
1103 insn that can throw. */
1106 sjlj_mark_call_sites (void)
1108 int last_call_site
= -2;
1111 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1119 /* Reset value tracking at extended basic block boundaries. */
1121 last_call_site
= -2;
1123 if (! INSN_P (insn
))
1126 nothrow
= get_eh_region_and_lp_from_rtx (insn
, &r
, &lp
);
1130 this_call_site
= sjlj_lp_call_site_index
[lp
->index
];
1133 /* Calls (and trapping insns) without notes are outside any
1134 exception handling region in this function. Mark them as
1136 this_call_site
= -1;
1140 gcc_assert (r
->type
== ERT_MUST_NOT_THROW
);
1144 if (this_call_site
!= -1)
1145 crtl
->uses_eh_lsda
= 1;
1147 if (this_call_site
== last_call_site
)
1150 /* Don't separate a call from it's argument loads. */
1153 before
= find_first_parameter_load (insn
, NULL_RTX
);
1156 mem
= adjust_address (crtl
->eh
.sjlj_fc
, TYPE_MODE (integer_type_node
),
1157 sjlj_fc_call_site_ofs
);
1158 emit_move_insn (mem
, gen_int_mode (this_call_site
, GET_MODE (mem
)));
1162 emit_insn_before (p
, before
);
1163 last_call_site
= this_call_site
;
1167 /* Construct the SjLj_Function_Context. */
1170 sjlj_emit_function_enter (rtx dispatch_label
)
1172 rtx fn_begin
, fc
, mem
, seq
;
1173 bool fn_begin_outside_block
;
1174 rtx personality
= get_personality_function (current_function_decl
);
1176 fc
= crtl
->eh
.sjlj_fc
;
1180 /* We're storing this libcall's address into memory instead of
1181 calling it directly. Thus, we must call assemble_external_libcall
1182 here, as we can not depend on emit_library_call to do it for us. */
1183 assemble_external_libcall (personality
);
1184 mem
= adjust_address (fc
, Pmode
, sjlj_fc_personality_ofs
);
1185 emit_move_insn (mem
, personality
);
1187 mem
= adjust_address (fc
, Pmode
, sjlj_fc_lsda_ofs
);
1188 if (crtl
->uses_eh_lsda
)
1193 ASM_GENERATE_INTERNAL_LABEL (buf
, "LLSDA", current_function_funcdef_no
);
1194 sym
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (buf
));
1195 SYMBOL_REF_FLAGS (sym
) = SYMBOL_FLAG_LOCAL
;
1196 emit_move_insn (mem
, sym
);
1199 emit_move_insn (mem
, const0_rtx
);
1203 #ifdef DONT_USE_BUILTIN_SETJMP
1205 x
= emit_library_call_value (setjmp_libfunc
, NULL_RTX
, LCT_RETURNS_TWICE
,
1206 TYPE_MODE (integer_type_node
), 1,
1207 plus_constant (Pmode
, XEXP (fc
, 0),
1208 sjlj_fc_jbuf_ofs
), Pmode
);
1210 emit_cmp_and_jump_insns (x
, const0_rtx
, NE
, 0,
1211 TYPE_MODE (integer_type_node
), 0,
1212 dispatch_label
, REG_BR_PROB_BASE
/ 100);
1214 expand_builtin_setjmp_setup (plus_constant (Pmode
, XEXP (fc
, 0),
1220 emit_library_call (unwind_sjlj_register_libfunc
, LCT_NORMAL
, VOIDmode
,
1221 1, XEXP (fc
, 0), Pmode
);
1226 /* ??? Instead of doing this at the beginning of the function,
1227 do this in a block that is at loop level 0 and dominates all
1228 can_throw_internal instructions. */
1230 fn_begin_outside_block
= true;
1231 for (fn_begin
= get_insns (); ; fn_begin
= NEXT_INSN (fn_begin
))
1232 if (NOTE_P (fn_begin
))
1234 if (NOTE_KIND (fn_begin
) == NOTE_INSN_FUNCTION_BEG
)
1236 else if (NOTE_INSN_BASIC_BLOCK_P (fn_begin
))
1237 fn_begin_outside_block
= false;
1240 if (fn_begin_outside_block
)
1241 insert_insn_on_edge (seq
, single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
1243 emit_insn_after (seq
, fn_begin
);
1246 /* Call back from expand_function_end to know where we should put
1247 the call to unwind_sjlj_unregister_libfunc if needed. */
1250 sjlj_emit_function_exit_after (rtx after
)
1252 crtl
->eh
.sjlj_exit_after
= after
;
1256 sjlj_emit_function_exit (void)
1262 emit_library_call (unwind_sjlj_unregister_libfunc
, LCT_NORMAL
, VOIDmode
,
1263 1, XEXP (crtl
->eh
.sjlj_fc
, 0), Pmode
);
1268 /* ??? Really this can be done in any block at loop level 0 that
1269 post-dominates all can_throw_internal instructions. This is
1270 the last possible moment. */
1272 insn
= crtl
->eh
.sjlj_exit_after
;
1274 insn
= NEXT_INSN (insn
);
1276 emit_insn_after (seq
, insn
);
1280 sjlj_emit_dispatch_table (rtx dispatch_label
, int num_dispatch
)
1282 enum machine_mode unwind_word_mode
= targetm
.unwind_word_mode ();
1283 enum machine_mode filter_mode
= targetm
.eh_return_filter_mode ();
1285 rtx mem
, seq
, fc
, before
, exc_ptr_reg
, filter_reg
;
1286 rtx first_reachable_label
;
1291 vec
<tree
> dispatch_labels
= vNULL
;
1293 fc
= crtl
->eh
.sjlj_fc
;
1297 emit_label (dispatch_label
);
1299 #ifndef DONT_USE_BUILTIN_SETJMP
1300 expand_builtin_setjmp_receiver (dispatch_label
);
1302 /* The caller of expand_builtin_setjmp_receiver is responsible for
1303 making sure that the label doesn't vanish. The only other caller
1304 is the expander for __builtin_setjmp_receiver, which places this
1305 label on the nonlocal_goto_label list. Since we're modeling these
1306 CFG edges more exactly, we can use the forced_labels list instead. */
1307 LABEL_PRESERVE_P (dispatch_label
) = 1;
1309 = gen_rtx_EXPR_LIST (VOIDmode
, dispatch_label
, forced_labels
);
1312 /* Load up exc_ptr and filter values from the function context. */
1313 mem
= adjust_address (fc
, unwind_word_mode
, sjlj_fc_data_ofs
);
1314 if (unwind_word_mode
!= ptr_mode
)
1316 #ifdef POINTERS_EXTEND_UNSIGNED
1317 mem
= convert_memory_address (ptr_mode
, mem
);
1319 mem
= convert_to_mode (ptr_mode
, mem
, 0);
1322 exc_ptr_reg
= force_reg (ptr_mode
, mem
);
1324 mem
= adjust_address (fc
, unwind_word_mode
,
1325 sjlj_fc_data_ofs
+ GET_MODE_SIZE (unwind_word_mode
));
1326 if (unwind_word_mode
!= filter_mode
)
1327 mem
= convert_to_mode (filter_mode
, mem
, 0);
1328 filter_reg
= force_reg (filter_mode
, mem
);
1330 /* Jump to one of the directly reachable regions. */
1333 first_reachable_label
= NULL
;
1335 /* If there's exactly one call site in the function, don't bother
1336 generating a switch statement. */
1337 if (num_dispatch
> 1)
1338 dispatch_labels
.create (num_dispatch
);
1340 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1341 if (lp
&& lp
->post_landing_pad
)
1347 lp
->landing_pad
= dispatch_label
;
1349 if (num_dispatch
> 1)
1351 tree t_label
, case_elt
, t
;
1353 t_label
= create_artificial_label (UNKNOWN_LOCATION
);
1354 t
= build_int_cst (integer_type_node
, disp_index
);
1355 case_elt
= build_case_label (t
, NULL
, t_label
);
1356 dispatch_labels
.quick_push (case_elt
);
1357 label
= label_rtx (t_label
);
1360 label
= gen_label_rtx ();
1362 if (disp_index
== 0)
1363 first_reachable_label
= label
;
1368 emit_move_insn (r
->exc_ptr_reg
, exc_ptr_reg
);
1370 emit_move_insn (r
->filter_reg
, filter_reg
);
1372 seq2
= get_insns ();
1375 before
= label_rtx (lp
->post_landing_pad
);
1376 bb
= emit_to_new_bb_before (seq2
, before
);
1377 e
= make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
1378 e
->count
= bb
->count
;
1379 e
->probability
= REG_BR_PROB_BASE
;
1382 struct loop
*loop
= bb
->next_bb
->loop_father
;
1383 /* If we created a pre-header block, add the new block to the
1384 outer loop, otherwise to the loop itself. */
1385 if (bb
->next_bb
== loop
->header
)
1386 add_bb_to_loop (bb
, loop_outer (loop
));
1388 add_bb_to_loop (bb
, loop
);
1389 /* ??? For multiple dispatches we will end up with edges
1390 from the loop tree root into this loop, making it a
1391 multiple-entry loop. Discard all affected loops. */
1392 if (num_dispatch
> 1)
1394 for (loop
= bb
->loop_father
;
1395 loop_outer (loop
); loop
= loop_outer (loop
))
1397 loop
->header
= NULL
;
1405 gcc_assert (disp_index
== num_dispatch
);
1407 if (num_dispatch
> 1)
1409 rtx disp
= adjust_address (fc
, TYPE_MODE (integer_type_node
),
1410 sjlj_fc_call_site_ofs
);
1411 expand_sjlj_dispatch_table (disp
, dispatch_labels
);
1417 bb
= emit_to_new_bb_before (seq
, first_reachable_label
);
1418 if (num_dispatch
== 1)
1420 e
= make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
1421 e
->count
= bb
->count
;
1422 e
->probability
= REG_BR_PROB_BASE
;
1425 struct loop
*loop
= bb
->next_bb
->loop_father
;
1426 /* If we created a pre-header block, add the new block to the
1427 outer loop, otherwise to the loop itself. */
1428 if (bb
->next_bb
== loop
->header
)
1429 add_bb_to_loop (bb
, loop_outer (loop
));
1431 add_bb_to_loop (bb
, loop
);
1436 /* We are not wiring up edges here, but as the dispatcher call
1437 is at function begin simply associate the block with the
1438 outermost (non-)loop. */
1440 add_bb_to_loop (bb
, current_loops
->tree_root
);
1445 sjlj_build_landing_pads (void)
1449 num_dispatch
= vec_safe_length (cfun
->eh
->lp_array
);
1450 if (num_dispatch
== 0)
1452 sjlj_lp_call_site_index
.safe_grow_cleared (num_dispatch
);
1454 num_dispatch
= sjlj_assign_call_site_values ();
1455 if (num_dispatch
> 0)
1457 rtx dispatch_label
= gen_label_rtx ();
1458 int align
= STACK_SLOT_ALIGNMENT (sjlj_fc_type_node
,
1459 TYPE_MODE (sjlj_fc_type_node
),
1460 TYPE_ALIGN (sjlj_fc_type_node
));
1462 = assign_stack_local (TYPE_MODE (sjlj_fc_type_node
),
1463 int_size_in_bytes (sjlj_fc_type_node
),
1466 sjlj_mark_call_sites ();
1467 sjlj_emit_function_enter (dispatch_label
);
1468 sjlj_emit_dispatch_table (dispatch_label
, num_dispatch
);
1469 sjlj_emit_function_exit ();
1472 /* If we do not have any landing pads, we may still need to register a
1473 personality routine and (empty) LSDA to handle must-not-throw regions. */
1474 else if (function_needs_eh_personality (cfun
) != eh_personality_none
)
1476 int align
= STACK_SLOT_ALIGNMENT (sjlj_fc_type_node
,
1477 TYPE_MODE (sjlj_fc_type_node
),
1478 TYPE_ALIGN (sjlj_fc_type_node
));
1480 = assign_stack_local (TYPE_MODE (sjlj_fc_type_node
),
1481 int_size_in_bytes (sjlj_fc_type_node
),
1484 sjlj_mark_call_sites ();
1485 sjlj_emit_function_enter (NULL_RTX
);
1486 sjlj_emit_function_exit ();
1489 sjlj_lp_call_site_index
.release ();
1492 /* After initial rtl generation, call back to finish generating
1493 exception support code. */
1496 finish_eh_generation (void)
1500 /* Construct the landing pads. */
1501 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
1502 sjlj_build_landing_pads ();
1504 dw2_build_landing_pads ();
1505 break_superblocks ();
1507 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
1508 /* Kludge for Alpha (see alpha_gp_save_rtx). */
1509 || single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
))->insns
.r
)
1510 commit_edge_insertions ();
1512 /* Redirect all EH edges from the post_landing_pad to the landing pad. */
1513 FOR_EACH_BB_FN (bb
, cfun
)
1519 lp
= get_eh_landing_pad_from_rtx (BB_END (bb
));
1521 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1522 if (e
->flags
& EDGE_EH
)
1525 /* We should not have generated any new throwing insns during this
1526 pass, and we should not have lost any EH edges, so we only need
1527 to handle two cases here:
1528 (1) reachable handler and an existing edge to post-landing-pad,
1529 (2) no reachable handler and no edge. */
1530 gcc_assert ((lp
!= NULL
) == (e
!= NULL
));
1533 gcc_assert (BB_HEAD (e
->dest
) == label_rtx (lp
->post_landing_pad
));
1535 redirect_edge_succ (e
, BLOCK_FOR_INSN (lp
->landing_pad
));
1536 e
->flags
|= (CALL_P (BB_END (bb
))
1537 ? EDGE_ABNORMAL
| EDGE_ABNORMAL_CALL
1543 /* This section handles removing dead code for flow. */
1546 remove_eh_landing_pad (eh_landing_pad lp
)
1550 for (pp
= &lp
->region
->landing_pads
; *pp
!= lp
; pp
= &(*pp
)->next_lp
)
1554 if (lp
->post_landing_pad
)
1555 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1556 (*cfun
->eh
->lp_array
)[lp
->index
] = NULL
;
1559 /* Splice the EH region at PP from the region tree. */
1562 remove_eh_handler_splicer (eh_region
*pp
)
1564 eh_region region
= *pp
;
1567 for (lp
= region
->landing_pads
; lp
; lp
= lp
->next_lp
)
1569 if (lp
->post_landing_pad
)
1570 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1571 (*cfun
->eh
->lp_array
)[lp
->index
] = NULL
;
1577 outer
= region
->outer
;
1579 *pp
= p
= region
->inner
;
1588 *pp
= region
->next_peer
;
1590 (*cfun
->eh
->region_array
)[region
->index
] = NULL
;
1593 /* Splice a single EH region REGION from the region tree.
1595 To unlink REGION, we need to find the pointer to it with a relatively
1596 expensive search in REGION's outer region. If you are going to
1597 remove a number of handlers, using remove_unreachable_eh_regions may
1598 be a better option. */
1601 remove_eh_handler (eh_region region
)
1603 eh_region
*pp
, *pp_start
, p
, outer
;
1605 outer
= region
->outer
;
1607 pp_start
= &outer
->inner
;
1609 pp_start
= &cfun
->eh
->region_tree
;
1610 for (pp
= pp_start
, p
= *pp
; p
!= region
; pp
= &p
->next_peer
, p
= *pp
)
1613 remove_eh_handler_splicer (pp
);
1616 /* Worker for remove_unreachable_eh_regions.
1617 PP is a pointer to the region to start a region tree depth-first
1618 search from. R_REACHABLE is the set of regions that have to be
1622 remove_unreachable_eh_regions_worker (eh_region
*pp
, sbitmap r_reachable
)
1626 eh_region region
= *pp
;
1627 remove_unreachable_eh_regions_worker (®ion
->inner
, r_reachable
);
1628 if (!bitmap_bit_p (r_reachable
, region
->index
))
1629 remove_eh_handler_splicer (pp
);
1631 pp
= ®ion
->next_peer
;
1635 /* Splice all EH regions *not* marked in R_REACHABLE from the region tree.
1636 Do this by traversing the EH tree top-down and splice out regions that
1637 are not marked. By removing regions from the leaves, we avoid costly
1638 searches in the region tree. */
1641 remove_unreachable_eh_regions (sbitmap r_reachable
)
1643 remove_unreachable_eh_regions_worker (&cfun
->eh
->region_tree
, r_reachable
);
1646 /* Invokes CALLBACK for every exception handler landing pad label.
1647 Only used by reload hackery; should not be used by new code. */
1650 for_each_eh_label (void (*callback
) (rtx
))
1655 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1659 rtx lab
= lp
->landing_pad
;
1660 if (lab
&& LABEL_P (lab
))
1666 /* Create the REG_EH_REGION note for INSN, given its ECF_FLAGS for a
1669 At the gimple level, we use LP_NR
1670 > 0 : The statement transfers to landing pad LP_NR
1671 = 0 : The statement is outside any EH region
1672 < 0 : The statement is within MUST_NOT_THROW region -LP_NR.
1674 At the rtl level, we use LP_NR
1675 > 0 : The insn transfers to landing pad LP_NR
1676 = 0 : The insn cannot throw
1677 < 0 : The insn is within MUST_NOT_THROW region -LP_NR
1678 = INT_MIN : The insn cannot throw or execute a nonlocal-goto.
1679 missing note: The insn is outside any EH region.
1681 ??? This difference probably ought to be avoided. We could stand
1682 to record nothrow for arbitrary gimple statements, and so avoid
1683 some moderately complex lookups in stmt_could_throw_p. Perhaps
1684 NOTHROW should be mapped on both sides to INT_MIN. Perhaps the
1685 no-nonlocal-goto property should be recorded elsewhere as a bit
1686 on the call_insn directly. Perhaps we should make more use of
1687 attaching the trees to call_insns (reachable via symbol_ref in
1688 direct call cases) and just pull the data out of the trees. */
1691 make_reg_eh_region_note (rtx insn
, int ecf_flags
, int lp_nr
)
1694 if (ecf_flags
& ECF_NOTHROW
)
1696 else if (lp_nr
!= 0)
1697 value
= GEN_INT (lp_nr
);
1700 add_reg_note (insn
, REG_EH_REGION
, value
);
1703 /* Create a REG_EH_REGION note for a CALL_INSN that cannot throw
1704 nor perform a non-local goto. Replace the region note if it
1708 make_reg_eh_region_note_nothrow_nononlocal (rtx insn
)
1710 rtx note
= find_reg_note (insn
, REG_EH_REGION
, NULL_RTX
);
1711 rtx intmin
= GEN_INT (INT_MIN
);
1714 XEXP (note
, 0) = intmin
;
1716 add_reg_note (insn
, REG_EH_REGION
, intmin
);
1719 /* Return true if INSN could throw, assuming no REG_EH_REGION note
1723 insn_could_throw_p (const_rtx insn
)
1725 if (!flag_exceptions
)
1729 if (INSN_P (insn
) && cfun
->can_throw_non_call_exceptions
)
1730 return may_trap_p (PATTERN (insn
));
1734 /* Copy an REG_EH_REGION note to each insn that might throw beginning
1735 at FIRST and ending at LAST. NOTE_OR_INSN is either the source insn
1736 to look for a note, or the note itself. */
1739 copy_reg_eh_region_note_forward (rtx note_or_insn
, rtx first
, rtx last
)
1741 rtx insn
, note
= note_or_insn
;
1743 if (INSN_P (note_or_insn
))
1745 note
= find_reg_note (note_or_insn
, REG_EH_REGION
, NULL_RTX
);
1749 note
= XEXP (note
, 0);
1751 for (insn
= first
; insn
!= last
; insn
= NEXT_INSN (insn
))
1752 if (!find_reg_note (insn
, REG_EH_REGION
, NULL_RTX
)
1753 && insn_could_throw_p (insn
))
1754 add_reg_note (insn
, REG_EH_REGION
, note
);
1757 /* Likewise, but iterate backward. */
1760 copy_reg_eh_region_note_backward (rtx note_or_insn
, rtx last
, rtx first
)
1762 rtx insn
, note
= note_or_insn
;
1764 if (INSN_P (note_or_insn
))
1766 note
= find_reg_note (note_or_insn
, REG_EH_REGION
, NULL_RTX
);
1770 note
= XEXP (note
, 0);
1772 for (insn
= last
; insn
!= first
; insn
= PREV_INSN (insn
))
1773 if (insn_could_throw_p (insn
))
1774 add_reg_note (insn
, REG_EH_REGION
, note
);
1778 /* Extract all EH information from INSN. Return true if the insn
1779 was marked NOTHROW. */
1782 get_eh_region_and_lp_from_rtx (const_rtx insn
, eh_region
*pr
,
1783 eh_landing_pad
*plp
)
1785 eh_landing_pad lp
= NULL
;
1791 if (! INSN_P (insn
))
1794 if (NONJUMP_INSN_P (insn
)
1795 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1796 insn
= XVECEXP (PATTERN (insn
), 0, 0);
1798 note
= find_reg_note (insn
, REG_EH_REGION
, NULL_RTX
);
1801 ret
= !insn_could_throw_p (insn
);
1805 lp_nr
= INTVAL (XEXP (note
, 0));
1806 if (lp_nr
== 0 || lp_nr
== INT_MIN
)
1813 r
= (*cfun
->eh
->region_array
)[-lp_nr
];
1816 lp
= (*cfun
->eh
->lp_array
)[lp_nr
];
1826 /* Return the landing pad to which INSN may go, or NULL if it does not
1827 have a reachable landing pad within this function. */
1830 get_eh_landing_pad_from_rtx (const_rtx insn
)
1835 get_eh_region_and_lp_from_rtx (insn
, &r
, &lp
);
1839 /* Return the region to which INSN may go, or NULL if it does not
1840 have a reachable region within this function. */
1843 get_eh_region_from_rtx (const_rtx insn
)
1848 get_eh_region_and_lp_from_rtx (insn
, &r
, &lp
);
1852 /* Return true if INSN throws and is caught by something in this function. */
1855 can_throw_internal (const_rtx insn
)
1857 return get_eh_landing_pad_from_rtx (insn
) != NULL
;
1860 /* Return true if INSN throws and escapes from the current function. */
1863 can_throw_external (const_rtx insn
)
1869 if (! INSN_P (insn
))
1872 if (NONJUMP_INSN_P (insn
)
1873 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1875 rtx seq
= PATTERN (insn
);
1876 int i
, n
= XVECLEN (seq
, 0);
1878 for (i
= 0; i
< n
; i
++)
1879 if (can_throw_external (XVECEXP (seq
, 0, i
)))
1885 nothrow
= get_eh_region_and_lp_from_rtx (insn
, &r
, &lp
);
1887 /* If we can't throw, we obviously can't throw external. */
1891 /* If we have an internal landing pad, then we're not external. */
1895 /* If we're not within an EH region, then we are external. */
1899 /* The only thing that ought to be left is MUST_NOT_THROW regions,
1900 which don't always have landing pads. */
1901 gcc_assert (r
->type
== ERT_MUST_NOT_THROW
);
1905 /* Return true if INSN cannot throw at all. */
1908 insn_nothrow_p (const_rtx insn
)
1913 if (! INSN_P (insn
))
1916 if (NONJUMP_INSN_P (insn
)
1917 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
1919 rtx seq
= PATTERN (insn
);
1920 int i
, n
= XVECLEN (seq
, 0);
1922 for (i
= 0; i
< n
; i
++)
1923 if (!insn_nothrow_p (XVECEXP (seq
, 0, i
)))
1929 return get_eh_region_and_lp_from_rtx (insn
, &r
, &lp
);
1932 /* Return true if INSN can perform a non-local goto. */
1933 /* ??? This test is here in this file because it (ab)uses REG_EH_REGION. */
1936 can_nonlocal_goto (const_rtx insn
)
1938 if (nonlocal_goto_handler_labels
&& CALL_P (insn
))
1940 rtx note
= find_reg_note (insn
, REG_EH_REGION
, NULL_RTX
);
1941 if (!note
|| INTVAL (XEXP (note
, 0)) != INT_MIN
)
1947 /* Set TREE_NOTHROW and crtl->all_throwers_are_sibcalls. */
1950 set_nothrow_function_flags (void)
1956 /* Assume crtl->all_throwers_are_sibcalls until we encounter
1957 something that can throw an exception. We specifically exempt
1958 CALL_INSNs that are SIBLING_CALL_P, as these are really jumps,
1959 and can't throw. Most CALL_INSNs are not SIBLING_CALL_P, so this
1962 crtl
->all_throwers_are_sibcalls
= 1;
1964 /* If we don't know that this implementation of the function will
1965 actually be used, then we must not set TREE_NOTHROW, since
1966 callers must not assume that this function does not throw. */
1967 if (TREE_NOTHROW (current_function_decl
))
1970 if (! flag_exceptions
)
1973 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1974 if (can_throw_external (insn
))
1978 if (!CALL_P (insn
) || !SIBLING_CALL_P (insn
))
1980 crtl
->all_throwers_are_sibcalls
= 0;
1986 && (cgraph_function_body_availability (cgraph_get_node
1987 (current_function_decl
))
1988 >= AVAIL_AVAILABLE
))
1990 struct cgraph_node
*node
= cgraph_get_node (current_function_decl
);
1991 struct cgraph_edge
*e
;
1992 for (e
= node
->callers
; e
; e
= e
->next_caller
)
1993 e
->can_throw_external
= false;
1994 cgraph_set_nothrow_flag (node
, true);
1997 fprintf (dump_file
, "Marking function nothrow: %s\n\n",
1998 current_function_name ());
2005 const pass_data pass_data_set_nothrow_function_flags
=
2007 RTL_PASS
, /* type */
2008 "nothrow", /* name */
2009 OPTGROUP_NONE
, /* optinfo_flags */
2010 true, /* has_execute */
2011 TV_NONE
, /* tv_id */
2012 0, /* properties_required */
2013 0, /* properties_provided */
2014 0, /* properties_destroyed */
2015 0, /* todo_flags_start */
2016 0, /* todo_flags_finish */
2019 class pass_set_nothrow_function_flags
: public rtl_opt_pass
2022 pass_set_nothrow_function_flags (gcc::context
*ctxt
)
2023 : rtl_opt_pass (pass_data_set_nothrow_function_flags
, ctxt
)
2026 /* opt_pass methods: */
2027 virtual unsigned int execute (function
*)
2029 return set_nothrow_function_flags ();
2032 }; // class pass_set_nothrow_function_flags
2037 make_pass_set_nothrow_function_flags (gcc::context
*ctxt
)
2039 return new pass_set_nothrow_function_flags (ctxt
);
2043 /* Various hooks for unwind library. */
2045 /* Expand the EH support builtin functions:
2046 __builtin_eh_pointer and __builtin_eh_filter. */
2049 expand_builtin_eh_common (tree region_nr_t
)
2051 HOST_WIDE_INT region_nr
;
2054 gcc_assert (tree_fits_shwi_p (region_nr_t
));
2055 region_nr
= tree_to_shwi (region_nr_t
);
2057 region
= (*cfun
->eh
->region_array
)[region_nr
];
2059 /* ??? We shouldn't have been able to delete a eh region without
2060 deleting all the code that depended on it. */
2061 gcc_assert (region
!= NULL
);
2066 /* Expand to the exc_ptr value from the given eh region. */
2069 expand_builtin_eh_pointer (tree exp
)
2072 = expand_builtin_eh_common (CALL_EXPR_ARG (exp
, 0));
2073 if (region
->exc_ptr_reg
== NULL
)
2074 region
->exc_ptr_reg
= gen_reg_rtx (ptr_mode
);
2075 return region
->exc_ptr_reg
;
2078 /* Expand to the filter value from the given eh region. */
2081 expand_builtin_eh_filter (tree exp
)
2084 = expand_builtin_eh_common (CALL_EXPR_ARG (exp
, 0));
2085 if (region
->filter_reg
== NULL
)
2086 region
->filter_reg
= gen_reg_rtx (targetm
.eh_return_filter_mode ());
2087 return region
->filter_reg
;
2090 /* Copy the exc_ptr and filter values from one landing pad's registers
2091 to another. This is used to inline the resx statement. */
2094 expand_builtin_eh_copy_values (tree exp
)
2097 = expand_builtin_eh_common (CALL_EXPR_ARG (exp
, 0));
2099 = expand_builtin_eh_common (CALL_EXPR_ARG (exp
, 1));
2100 enum machine_mode fmode
= targetm
.eh_return_filter_mode ();
2102 if (dst
->exc_ptr_reg
== NULL
)
2103 dst
->exc_ptr_reg
= gen_reg_rtx (ptr_mode
);
2104 if (src
->exc_ptr_reg
== NULL
)
2105 src
->exc_ptr_reg
= gen_reg_rtx (ptr_mode
);
2107 if (dst
->filter_reg
== NULL
)
2108 dst
->filter_reg
= gen_reg_rtx (fmode
);
2109 if (src
->filter_reg
== NULL
)
2110 src
->filter_reg
= gen_reg_rtx (fmode
);
2112 emit_move_insn (dst
->exc_ptr_reg
, src
->exc_ptr_reg
);
2113 emit_move_insn (dst
->filter_reg
, src
->filter_reg
);
2118 /* Do any necessary initialization to access arbitrary stack frames.
2119 On the SPARC, this means flushing the register windows. */
2122 expand_builtin_unwind_init (void)
2124 /* Set this so all the registers get saved in our frame; we need to be
2125 able to copy the saved values for any registers from frames we unwind. */
2126 crtl
->saves_all_registers
= 1;
2128 #ifdef SETUP_FRAME_ADDRESSES
2129 SETUP_FRAME_ADDRESSES ();
2133 /* Map a non-negative number to an eh return data register number; expands
2134 to -1 if no return data register is associated with the input number.
2135 At least the inputs 0 and 1 must be mapped; the target may provide more. */
2138 expand_builtin_eh_return_data_regno (tree exp
)
2140 tree which
= CALL_EXPR_ARG (exp
, 0);
2141 unsigned HOST_WIDE_INT iwhich
;
2143 if (TREE_CODE (which
) != INTEGER_CST
)
2145 error ("argument of %<__builtin_eh_return_regno%> must be constant");
2149 iwhich
= tree_to_uhwi (which
);
2150 iwhich
= EH_RETURN_DATA_REGNO (iwhich
);
2151 if (iwhich
== INVALID_REGNUM
)
2154 #ifdef DWARF_FRAME_REGNUM
2155 iwhich
= DWARF_FRAME_REGNUM (iwhich
);
2157 iwhich
= DBX_REGISTER_NUMBER (iwhich
);
2160 return GEN_INT (iwhich
);
2163 /* Given a value extracted from the return address register or stack slot,
2164 return the actual address encoded in that value. */
2167 expand_builtin_extract_return_addr (tree addr_tree
)
2169 rtx addr
= expand_expr (addr_tree
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
2171 if (GET_MODE (addr
) != Pmode
2172 && GET_MODE (addr
) != VOIDmode
)
2174 #ifdef POINTERS_EXTEND_UNSIGNED
2175 addr
= convert_memory_address (Pmode
, addr
);
2177 addr
= convert_to_mode (Pmode
, addr
, 0);
2181 /* First mask out any unwanted bits. */
2182 #ifdef MASK_RETURN_ADDR
2183 expand_and (Pmode
, addr
, MASK_RETURN_ADDR
, addr
);
2186 /* Then adjust to find the real return address. */
2187 #if defined (RETURN_ADDR_OFFSET)
2188 addr
= plus_constant (Pmode
, addr
, RETURN_ADDR_OFFSET
);
2194 /* Given an actual address in addr_tree, do any necessary encoding
2195 and return the value to be stored in the return address register or
2196 stack slot so the epilogue will return to that address. */
2199 expand_builtin_frob_return_addr (tree addr_tree
)
2201 rtx addr
= expand_expr (addr_tree
, NULL_RTX
, ptr_mode
, EXPAND_NORMAL
);
2203 addr
= convert_memory_address (Pmode
, addr
);
2205 #ifdef RETURN_ADDR_OFFSET
2206 addr
= force_reg (Pmode
, addr
);
2207 addr
= plus_constant (Pmode
, addr
, -RETURN_ADDR_OFFSET
);
2213 /* Set up the epilogue with the magic bits we'll need to return to the
2214 exception handler. */
2217 expand_builtin_eh_return (tree stackadj_tree ATTRIBUTE_UNUSED
,
2222 #ifdef EH_RETURN_STACKADJ_RTX
2223 tmp
= expand_expr (stackadj_tree
, crtl
->eh
.ehr_stackadj
,
2224 VOIDmode
, EXPAND_NORMAL
);
2225 tmp
= convert_memory_address (Pmode
, tmp
);
2226 if (!crtl
->eh
.ehr_stackadj
)
2227 crtl
->eh
.ehr_stackadj
= copy_to_reg (tmp
);
2228 else if (tmp
!= crtl
->eh
.ehr_stackadj
)
2229 emit_move_insn (crtl
->eh
.ehr_stackadj
, tmp
);
2232 tmp
= expand_expr (handler_tree
, crtl
->eh
.ehr_handler
,
2233 VOIDmode
, EXPAND_NORMAL
);
2234 tmp
= convert_memory_address (Pmode
, tmp
);
2235 if (!crtl
->eh
.ehr_handler
)
2236 crtl
->eh
.ehr_handler
= copy_to_reg (tmp
);
2237 else if (tmp
!= crtl
->eh
.ehr_handler
)
2238 emit_move_insn (crtl
->eh
.ehr_handler
, tmp
);
2240 if (!crtl
->eh
.ehr_label
)
2241 crtl
->eh
.ehr_label
= gen_label_rtx ();
2242 emit_jump (crtl
->eh
.ehr_label
);
2245 /* Expand __builtin_eh_return. This exit path from the function loads up
2246 the eh return data registers, adjusts the stack, and branches to a
2247 given PC other than the normal return address. */
2250 expand_eh_return (void)
2254 if (! crtl
->eh
.ehr_label
)
2257 crtl
->calls_eh_return
= 1;
2259 #ifdef EH_RETURN_STACKADJ_RTX
2260 emit_move_insn (EH_RETURN_STACKADJ_RTX
, const0_rtx
);
2263 around_label
= gen_label_rtx ();
2264 emit_jump (around_label
);
2266 emit_label (crtl
->eh
.ehr_label
);
2267 clobber_return_register ();
2269 #ifdef EH_RETURN_STACKADJ_RTX
2270 emit_move_insn (EH_RETURN_STACKADJ_RTX
, crtl
->eh
.ehr_stackadj
);
2273 #ifdef HAVE_eh_return
2275 emit_insn (gen_eh_return (crtl
->eh
.ehr_handler
));
2279 #ifdef EH_RETURN_HANDLER_RTX
2280 emit_move_insn (EH_RETURN_HANDLER_RTX
, crtl
->eh
.ehr_handler
);
2282 error ("__builtin_eh_return not supported on this target");
2286 emit_label (around_label
);
2289 /* Convert a ptr_mode address ADDR_TREE to a Pmode address controlled by
2290 POINTERS_EXTEND_UNSIGNED and return it. */
2293 expand_builtin_extend_pointer (tree addr_tree
)
2295 rtx addr
= expand_expr (addr_tree
, NULL_RTX
, ptr_mode
, EXPAND_NORMAL
);
2298 #ifdef POINTERS_EXTEND_UNSIGNED
2299 extend
= POINTERS_EXTEND_UNSIGNED
;
2301 /* The previous EH code did an unsigned extend by default, so we do this also
2306 return convert_modes (targetm
.unwind_word_mode (), ptr_mode
, addr
, extend
);
2310 add_action_record (action_hash_type ar_hash
, int filter
, int next
)
2312 struct action_record
**slot
, *new_ar
, tmp
;
2314 tmp
.filter
= filter
;
2316 slot
= ar_hash
.find_slot (&tmp
, INSERT
);
2318 if ((new_ar
= *slot
) == NULL
)
2320 new_ar
= XNEW (struct action_record
);
2321 new_ar
->offset
= crtl
->eh
.action_record_data
->length () + 1;
2322 new_ar
->filter
= filter
;
2323 new_ar
->next
= next
;
2326 /* The filter value goes in untouched. The link to the next
2327 record is a "self-relative" byte offset, or zero to indicate
2328 that there is no next record. So convert the absolute 1 based
2329 indices we've been carrying around into a displacement. */
2331 push_sleb128 (&crtl
->eh
.action_record_data
, filter
);
2333 next
-= crtl
->eh
.action_record_data
->length () + 1;
2334 push_sleb128 (&crtl
->eh
.action_record_data
, next
);
2337 return new_ar
->offset
;
2341 collect_one_action_chain (action_hash_type ar_hash
, eh_region region
)
2345 /* If we've reached the top of the region chain, then we have
2346 no actions, and require no landing pad. */
2350 switch (region
->type
)
2355 /* A cleanup adds a zero filter to the beginning of the chain, but
2356 there are special cases to look out for. If there are *only*
2357 cleanups along a path, then it compresses to a zero action.
2358 Further, if there are multiple cleanups along a path, we only
2359 need to represent one of them, as that is enough to trigger
2360 entry to the landing pad at runtime. */
2361 next
= collect_one_action_chain (ar_hash
, region
->outer
);
2364 for (r
= region
->outer
; r
; r
= r
->outer
)
2365 if (r
->type
== ERT_CLEANUP
)
2367 return add_action_record (ar_hash
, 0, next
);
2374 /* Process the associated catch regions in reverse order.
2375 If there's a catch-all handler, then we don't need to
2376 search outer regions. Use a magic -3 value to record
2377 that we haven't done the outer search. */
2379 for (c
= region
->u
.eh_try
.last_catch
; c
; c
= c
->prev_catch
)
2381 if (c
->type_list
== NULL
)
2383 /* Retrieve the filter from the head of the filter list
2384 where we have stored it (see assign_filter_values). */
2385 int filter
= TREE_INT_CST_LOW (TREE_VALUE (c
->filter_list
));
2386 next
= add_action_record (ar_hash
, filter
, 0);
2390 /* Once the outer search is done, trigger an action record for
2391 each filter we have. */
2396 next
= collect_one_action_chain (ar_hash
, region
->outer
);
2398 /* If there is no next action, terminate the chain. */
2401 /* If all outer actions are cleanups or must_not_throw,
2402 we'll have no action record for it, since we had wanted
2403 to encode these states in the call-site record directly.
2404 Add a cleanup action to the chain to catch these. */
2406 next
= add_action_record (ar_hash
, 0, 0);
2409 flt_node
= c
->filter_list
;
2410 for (; flt_node
; flt_node
= TREE_CHAIN (flt_node
))
2412 int filter
= TREE_INT_CST_LOW (TREE_VALUE (flt_node
));
2413 next
= add_action_record (ar_hash
, filter
, next
);
2420 case ERT_ALLOWED_EXCEPTIONS
:
2421 /* An exception specification adds its filter to the
2422 beginning of the chain. */
2423 next
= collect_one_action_chain (ar_hash
, region
->outer
);
2425 /* If there is no next action, terminate the chain. */
2428 /* If all outer actions are cleanups or must_not_throw,
2429 we'll have no action record for it, since we had wanted
2430 to encode these states in the call-site record directly.
2431 Add a cleanup action to the chain to catch these. */
2433 next
= add_action_record (ar_hash
, 0, 0);
2435 return add_action_record (ar_hash
, region
->u
.allowed
.filter
, next
);
2437 case ERT_MUST_NOT_THROW
:
2438 /* A must-not-throw region with no inner handlers or cleanups
2439 requires no call-site entry. Note that this differs from
2440 the no handler or cleanup case in that we do require an lsda
2441 to be generated. Return a magic -2 value to record this. */
2449 add_call_site (rtx landing_pad
, int action
, int section
)
2451 call_site_record record
;
2453 record
= ggc_alloc
<call_site_record_d
> ();
2454 record
->landing_pad
= landing_pad
;
2455 record
->action
= action
;
2457 vec_safe_push (crtl
->eh
.call_site_record_v
[section
], record
);
2459 return call_site_base
+ crtl
->eh
.call_site_record_v
[section
]->length () - 1;
2462 /* Turn REG_EH_REGION notes back into NOTE_INSN_EH_REGION notes.
2463 The new note numbers will not refer to region numbers, but
2464 instead to call site entries. */
2467 convert_to_eh_region_ranges (void)
2469 rtx insn
, iter
, note
;
2470 action_hash_type ar_hash
;
2471 int last_action
= -3;
2472 rtx last_action_insn
= NULL_RTX
;
2473 rtx last_landing_pad
= NULL_RTX
;
2474 rtx first_no_action_insn
= NULL_RTX
;
2477 rtx section_switch_note
= NULL_RTX
;
2478 rtx first_no_action_insn_before_switch
= NULL_RTX
;
2479 rtx last_no_action_insn_before_switch
= NULL_RTX
;
2480 int saved_call_site_base
= call_site_base
;
2482 vec_alloc (crtl
->eh
.action_record_data
, 64);
2484 ar_hash
.create (31);
2486 for (iter
= get_insns (); iter
; iter
= NEXT_INSN (iter
))
2493 rtx this_landing_pad
;
2496 if (NONJUMP_INSN_P (insn
)
2497 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
2498 insn
= XVECEXP (PATTERN (insn
), 0, 0);
2500 nothrow
= get_eh_region_and_lp_from_rtx (insn
, ®ion
, &lp
);
2504 this_action
= collect_one_action_chain (ar_hash
, region
);
2508 /* Existence of catch handlers, or must-not-throw regions
2509 implies that an lsda is needed (even if empty). */
2510 if (this_action
!= -1)
2511 crtl
->uses_eh_lsda
= 1;
2513 /* Delay creation of region notes for no-action regions
2514 until we're sure that an lsda will be required. */
2515 else if (last_action
== -3)
2517 first_no_action_insn
= iter
;
2521 if (this_action
>= 0)
2522 this_landing_pad
= lp
->landing_pad
;
2524 this_landing_pad
= NULL_RTX
;
2526 /* Differing actions or landing pads implies a change in call-site
2527 info, which implies some EH_REGION note should be emitted. */
2528 if (last_action
!= this_action
2529 || last_landing_pad
!= this_landing_pad
)
2531 /* If there is a queued no-action region in the other section
2532 with hot/cold partitioning, emit it now. */
2533 if (first_no_action_insn_before_switch
)
2535 gcc_assert (this_action
!= -1
2536 && last_action
== (first_no_action_insn
2538 call_site
= add_call_site (NULL_RTX
, 0, 0);
2539 note
= emit_note_before (NOTE_INSN_EH_REGION_BEG
,
2540 first_no_action_insn_before_switch
);
2541 NOTE_EH_HANDLER (note
) = call_site
;
2542 note
= emit_note_after (NOTE_INSN_EH_REGION_END
,
2543 last_no_action_insn_before_switch
);
2544 NOTE_EH_HANDLER (note
) = call_site
;
2545 gcc_assert (last_action
!= -3
2546 || (last_action_insn
2547 == last_no_action_insn_before_switch
));
2548 first_no_action_insn_before_switch
= NULL_RTX
;
2549 last_no_action_insn_before_switch
= NULL_RTX
;
2552 /* If we'd not seen a previous action (-3) or the previous
2553 action was must-not-throw (-2), then we do not need an
2555 if (last_action
>= -1)
2557 /* If we delayed the creation of the begin, do it now. */
2558 if (first_no_action_insn
)
2560 call_site
= add_call_site (NULL_RTX
, 0, cur_sec
);
2561 note
= emit_note_before (NOTE_INSN_EH_REGION_BEG
,
2562 first_no_action_insn
);
2563 NOTE_EH_HANDLER (note
) = call_site
;
2564 first_no_action_insn
= NULL_RTX
;
2567 note
= emit_note_after (NOTE_INSN_EH_REGION_END
,
2569 NOTE_EH_HANDLER (note
) = call_site
;
2572 /* If the new action is must-not-throw, then no region notes
2574 if (this_action
>= -1)
2576 call_site
= add_call_site (this_landing_pad
,
2577 this_action
< 0 ? 0 : this_action
,
2579 note
= emit_note_before (NOTE_INSN_EH_REGION_BEG
, iter
);
2580 NOTE_EH_HANDLER (note
) = call_site
;
2583 last_action
= this_action
;
2584 last_landing_pad
= this_landing_pad
;
2586 last_action_insn
= iter
;
2588 else if (NOTE_P (iter
)
2589 && NOTE_KIND (iter
) == NOTE_INSN_SWITCH_TEXT_SECTIONS
)
2591 gcc_assert (section_switch_note
== NULL_RTX
);
2592 gcc_assert (flag_reorder_blocks_and_partition
);
2593 section_switch_note
= iter
;
2594 if (first_no_action_insn
)
2596 first_no_action_insn_before_switch
= first_no_action_insn
;
2597 last_no_action_insn_before_switch
= last_action_insn
;
2598 first_no_action_insn
= NULL_RTX
;
2599 gcc_assert (last_action
== -1);
2602 /* Force closing of current EH region before section switch and
2603 opening a new one afterwards. */
2604 else if (last_action
!= -3)
2605 last_landing_pad
= pc_rtx
;
2606 if (crtl
->eh
.call_site_record_v
[cur_sec
])
2607 call_site_base
+= crtl
->eh
.call_site_record_v
[cur_sec
]->length ();
2609 gcc_assert (crtl
->eh
.call_site_record_v
[cur_sec
] == NULL
);
2610 vec_alloc (crtl
->eh
.call_site_record_v
[cur_sec
], 10);
2613 if (last_action
>= -1 && ! first_no_action_insn
)
2615 note
= emit_note_after (NOTE_INSN_EH_REGION_END
, last_action_insn
);
2616 NOTE_EH_HANDLER (note
) = call_site
;
2619 call_site_base
= saved_call_site_base
;
2627 const pass_data pass_data_convert_to_eh_region_ranges
=
2629 RTL_PASS
, /* type */
2630 "eh_ranges", /* name */
2631 OPTGROUP_NONE
, /* optinfo_flags */
2632 true, /* has_execute */
2633 TV_NONE
, /* tv_id */
2634 0, /* properties_required */
2635 0, /* properties_provided */
2636 0, /* properties_destroyed */
2637 0, /* todo_flags_start */
2638 0, /* todo_flags_finish */
2641 class pass_convert_to_eh_region_ranges
: public rtl_opt_pass
2644 pass_convert_to_eh_region_ranges (gcc::context
*ctxt
)
2645 : rtl_opt_pass (pass_data_convert_to_eh_region_ranges
, ctxt
)
2648 /* opt_pass methods: */
2649 virtual bool gate (function
*);
2650 virtual unsigned int execute (function
*)
2652 return convert_to_eh_region_ranges ();
2655 }; // class pass_convert_to_eh_region_ranges
2658 pass_convert_to_eh_region_ranges::gate (function
*)
2660 /* Nothing to do for SJLJ exceptions or if no regions created. */
2661 if (cfun
->eh
->region_tree
== NULL
)
2663 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
2671 make_pass_convert_to_eh_region_ranges (gcc::context
*ctxt
)
2673 return new pass_convert_to_eh_region_ranges (ctxt
);
2677 push_uleb128 (vec
<uchar
, va_gc
> **data_area
, unsigned int value
)
2681 unsigned char byte
= value
& 0x7f;
2685 vec_safe_push (*data_area
, byte
);
2691 push_sleb128 (vec
<uchar
, va_gc
> **data_area
, int value
)
2698 byte
= value
& 0x7f;
2700 more
= ! ((value
== 0 && (byte
& 0x40) == 0)
2701 || (value
== -1 && (byte
& 0x40) != 0));
2704 vec_safe_push (*data_area
, byte
);
2710 #ifndef HAVE_AS_LEB128
2712 dw2_size_of_call_site_table (int section
)
2714 int n
= vec_safe_length (crtl
->eh
.call_site_record_v
[section
]);
2715 int size
= n
* (4 + 4 + 4);
2718 for (i
= 0; i
< n
; ++i
)
2720 struct call_site_record_d
*cs
=
2721 (*crtl
->eh
.call_site_record_v
[section
])[i
];
2722 size
+= size_of_uleb128 (cs
->action
);
2729 sjlj_size_of_call_site_table (void)
2731 int n
= vec_safe_length (crtl
->eh
.call_site_record_v
[0]);
2735 for (i
= 0; i
< n
; ++i
)
2737 struct call_site_record_d
*cs
=
2738 (*crtl
->eh
.call_site_record_v
[0])[i
];
2739 size
+= size_of_uleb128 (INTVAL (cs
->landing_pad
));
2740 size
+= size_of_uleb128 (cs
->action
);
2748 dw2_output_call_site_table (int cs_format
, int section
)
2750 int n
= vec_safe_length (crtl
->eh
.call_site_record_v
[section
]);
2755 begin
= current_function_func_begin_label
;
2756 else if (first_function_block_is_cold
)
2757 begin
= crtl
->subsections
.hot_section_label
;
2759 begin
= crtl
->subsections
.cold_section_label
;
2761 for (i
= 0; i
< n
; ++i
)
2763 struct call_site_record_d
*cs
= (*crtl
->eh
.call_site_record_v
[section
])[i
];
2764 char reg_start_lab
[32];
2765 char reg_end_lab
[32];
2766 char landing_pad_lab
[32];
2768 ASM_GENERATE_INTERNAL_LABEL (reg_start_lab
, "LEHB", call_site_base
+ i
);
2769 ASM_GENERATE_INTERNAL_LABEL (reg_end_lab
, "LEHE", call_site_base
+ i
);
2771 if (cs
->landing_pad
)
2772 ASM_GENERATE_INTERNAL_LABEL (landing_pad_lab
, "L",
2773 CODE_LABEL_NUMBER (cs
->landing_pad
));
2775 /* ??? Perhaps use insn length scaling if the assembler supports
2776 generic arithmetic. */
2777 /* ??? Perhaps use attr_length to choose data1 or data2 instead of
2778 data4 if the function is small enough. */
2779 if (cs_format
== DW_EH_PE_uleb128
)
2781 dw2_asm_output_delta_uleb128 (reg_start_lab
, begin
,
2782 "region %d start", i
);
2783 dw2_asm_output_delta_uleb128 (reg_end_lab
, reg_start_lab
,
2785 if (cs
->landing_pad
)
2786 dw2_asm_output_delta_uleb128 (landing_pad_lab
, begin
,
2789 dw2_asm_output_data_uleb128 (0, "landing pad");
2793 dw2_asm_output_delta (4, reg_start_lab
, begin
,
2794 "region %d start", i
);
2795 dw2_asm_output_delta (4, reg_end_lab
, reg_start_lab
, "length");
2796 if (cs
->landing_pad
)
2797 dw2_asm_output_delta (4, landing_pad_lab
, begin
,
2800 dw2_asm_output_data (4, 0, "landing pad");
2802 dw2_asm_output_data_uleb128 (cs
->action
, "action");
2805 call_site_base
+= n
;
2809 sjlj_output_call_site_table (void)
2811 int n
= vec_safe_length (crtl
->eh
.call_site_record_v
[0]);
2814 for (i
= 0; i
< n
; ++i
)
2816 struct call_site_record_d
*cs
= (*crtl
->eh
.call_site_record_v
[0])[i
];
2818 dw2_asm_output_data_uleb128 (INTVAL (cs
->landing_pad
),
2819 "region %d landing pad", i
);
2820 dw2_asm_output_data_uleb128 (cs
->action
, "action");
2823 call_site_base
+= n
;
2826 /* Switch to the section that should be used for exception tables. */
2829 switch_to_exception_section (const char * ARG_UNUSED (fnname
))
2833 if (exception_section
)
2834 s
= exception_section
;
2837 /* Compute the section and cache it into exception_section,
2838 unless it depends on the function name. */
2839 if (targetm_common
.have_named_sections
)
2843 if (EH_TABLES_CAN_BE_READ_ONLY
)
2846 ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/0, /*global=*/1);
2847 flags
= ((! flag_pic
2848 || ((tt_format
& 0x70) != DW_EH_PE_absptr
2849 && (tt_format
& 0x70) != DW_EH_PE_aligned
))
2850 ? 0 : SECTION_WRITE
);
2853 flags
= SECTION_WRITE
;
2855 #ifdef HAVE_LD_EH_GC_SECTIONS
2856 if (flag_function_sections
2857 || (DECL_ONE_ONLY (current_function_decl
) && HAVE_COMDAT_GROUP
))
2859 char *section_name
= XNEWVEC (char, strlen (fnname
) + 32);
2860 /* The EH table must match the code section, so only mark
2861 it linkonce if we have COMDAT groups to tie them together. */
2862 if (DECL_ONE_ONLY (current_function_decl
) && HAVE_COMDAT_GROUP
)
2863 flags
|= SECTION_LINKONCE
;
2864 sprintf (section_name
, ".gcc_except_table.%s", fnname
);
2865 s
= get_section (section_name
, flags
, current_function_decl
);
2866 free (section_name
);
2871 = s
= get_section (".gcc_except_table", flags
, NULL
);
2875 = s
= flag_pic
? data_section
: readonly_data_section
;
2878 switch_to_section (s
);
2882 /* Output a reference from an exception table to the type_info object TYPE.
2883 TT_FORMAT and TT_FORMAT_SIZE describe the DWARF encoding method used for
2887 output_ttype (tree type
, int tt_format
, int tt_format_size
)
2890 bool is_public
= true;
2892 if (type
== NULL_TREE
)
2896 /* FIXME lto. pass_ipa_free_lang_data changes all types to
2897 runtime types so TYPE should already be a runtime type
2898 reference. When pass_ipa_free_lang data is made a default
2899 pass, we can then remove the call to lookup_type_for_runtime
2902 type
= lookup_type_for_runtime (type
);
2904 value
= expand_expr (type
, NULL_RTX
, VOIDmode
, EXPAND_INITIALIZER
);
2906 /* Let cgraph know that the rtti decl is used. Not all of the
2907 paths below go through assemble_integer, which would take
2908 care of this for us. */
2910 if (TREE_CODE (type
) == ADDR_EXPR
)
2912 type
= TREE_OPERAND (type
, 0);
2913 if (TREE_CODE (type
) == VAR_DECL
)
2914 is_public
= TREE_PUBLIC (type
);
2917 gcc_assert (TREE_CODE (type
) == INTEGER_CST
);
2920 /* Allow the target to override the type table entry format. */
2921 if (targetm
.asm_out
.ttype (value
))
2924 if (tt_format
== DW_EH_PE_absptr
|| tt_format
== DW_EH_PE_aligned
)
2925 assemble_integer (value
, tt_format_size
,
2926 tt_format_size
* BITS_PER_UNIT
, 1);
2928 dw2_asm_output_encoded_addr_rtx (tt_format
, value
, is_public
, NULL
);
2932 output_one_function_exception_table (int section
)
2934 int tt_format
, cs_format
, lp_format
, i
;
2935 #ifdef HAVE_AS_LEB128
2936 char ttype_label
[32];
2937 char cs_after_size_label
[32];
2938 char cs_end_label
[32];
2943 int tt_format_size
= 0;
2945 have_tt_data
= (vec_safe_length (cfun
->eh
->ttype_data
)
2946 || (targetm
.arm_eabi_unwinder
2947 ? vec_safe_length (cfun
->eh
->ehspec_data
.arm_eabi
)
2948 : vec_safe_length (cfun
->eh
->ehspec_data
.other
)));
2950 /* Indicate the format of the @TType entries. */
2952 tt_format
= DW_EH_PE_omit
;
2955 tt_format
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/0, /*global=*/1);
2956 #ifdef HAVE_AS_LEB128
2957 ASM_GENERATE_INTERNAL_LABEL (ttype_label
,
2958 section
? "LLSDATTC" : "LLSDATT",
2959 current_function_funcdef_no
);
2961 tt_format_size
= size_of_encoded_value (tt_format
);
2963 assemble_align (tt_format_size
* BITS_PER_UNIT
);
2966 targetm
.asm_out
.internal_label (asm_out_file
, section
? "LLSDAC" : "LLSDA",
2967 current_function_funcdef_no
);
2969 /* The LSDA header. */
2971 /* Indicate the format of the landing pad start pointer. An omitted
2972 field implies @LPStart == @Start. */
2973 /* Currently we always put @LPStart == @Start. This field would
2974 be most useful in moving the landing pads completely out of
2975 line to another section, but it could also be used to minimize
2976 the size of uleb128 landing pad offsets. */
2977 lp_format
= DW_EH_PE_omit
;
2978 dw2_asm_output_data (1, lp_format
, "@LPStart format (%s)",
2979 eh_data_format_name (lp_format
));
2981 /* @LPStart pointer would go here. */
2983 dw2_asm_output_data (1, tt_format
, "@TType format (%s)",
2984 eh_data_format_name (tt_format
));
2986 #ifndef HAVE_AS_LEB128
2987 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
2988 call_site_len
= sjlj_size_of_call_site_table ();
2990 call_site_len
= dw2_size_of_call_site_table (section
);
2993 /* A pc-relative 4-byte displacement to the @TType data. */
2996 #ifdef HAVE_AS_LEB128
2997 char ttype_after_disp_label
[32];
2998 ASM_GENERATE_INTERNAL_LABEL (ttype_after_disp_label
,
2999 section
? "LLSDATTDC" : "LLSDATTD",
3000 current_function_funcdef_no
);
3001 dw2_asm_output_delta_uleb128 (ttype_label
, ttype_after_disp_label
,
3002 "@TType base offset");
3003 ASM_OUTPUT_LABEL (asm_out_file
, ttype_after_disp_label
);
3005 /* Ug. Alignment queers things. */
3006 unsigned int before_disp
, after_disp
, last_disp
, disp
;
3008 before_disp
= 1 + 1;
3009 after_disp
= (1 + size_of_uleb128 (call_site_len
)
3011 + vec_safe_length (crtl
->eh
.action_record_data
)
3012 + (vec_safe_length (cfun
->eh
->ttype_data
)
3018 unsigned int disp_size
, pad
;
3021 disp_size
= size_of_uleb128 (disp
);
3022 pad
= before_disp
+ disp_size
+ after_disp
;
3023 if (pad
% tt_format_size
)
3024 pad
= tt_format_size
- (pad
% tt_format_size
);
3027 disp
= after_disp
+ pad
;
3029 while (disp
!= last_disp
);
3031 dw2_asm_output_data_uleb128 (disp
, "@TType base offset");
3035 /* Indicate the format of the call-site offsets. */
3036 #ifdef HAVE_AS_LEB128
3037 cs_format
= DW_EH_PE_uleb128
;
3039 cs_format
= DW_EH_PE_udata4
;
3041 dw2_asm_output_data (1, cs_format
, "call-site format (%s)",
3042 eh_data_format_name (cs_format
));
3044 #ifdef HAVE_AS_LEB128
3045 ASM_GENERATE_INTERNAL_LABEL (cs_after_size_label
,
3046 section
? "LLSDACSBC" : "LLSDACSB",
3047 current_function_funcdef_no
);
3048 ASM_GENERATE_INTERNAL_LABEL (cs_end_label
,
3049 section
? "LLSDACSEC" : "LLSDACSE",
3050 current_function_funcdef_no
);
3051 dw2_asm_output_delta_uleb128 (cs_end_label
, cs_after_size_label
,
3052 "Call-site table length");
3053 ASM_OUTPUT_LABEL (asm_out_file
, cs_after_size_label
);
3054 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
3055 sjlj_output_call_site_table ();
3057 dw2_output_call_site_table (cs_format
, section
);
3058 ASM_OUTPUT_LABEL (asm_out_file
, cs_end_label
);
3060 dw2_asm_output_data_uleb128 (call_site_len
, "Call-site table length");
3061 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
3062 sjlj_output_call_site_table ();
3064 dw2_output_call_site_table (cs_format
, section
);
3067 /* ??? Decode and interpret the data for flag_debug_asm. */
3070 FOR_EACH_VEC_ELT (*crtl
->eh
.action_record_data
, i
, uc
)
3071 dw2_asm_output_data (1, uc
, i
? NULL
: "Action record table");
3075 assemble_align (tt_format_size
* BITS_PER_UNIT
);
3077 i
= vec_safe_length (cfun
->eh
->ttype_data
);
3080 tree type
= (*cfun
->eh
->ttype_data
)[i
];
3081 output_ttype (type
, tt_format
, tt_format_size
);
3084 #ifdef HAVE_AS_LEB128
3086 ASM_OUTPUT_LABEL (asm_out_file
, ttype_label
);
3089 /* ??? Decode and interpret the data for flag_debug_asm. */
3090 if (targetm
.arm_eabi_unwinder
)
3094 vec_safe_iterate (cfun
->eh
->ehspec_data
.arm_eabi
, i
, &type
); ++i
)
3095 output_ttype (type
, tt_format
, tt_format_size
);
3101 vec_safe_iterate (cfun
->eh
->ehspec_data
.other
, i
, &uc
); ++i
)
3102 dw2_asm_output_data (1, uc
,
3103 i
? NULL
: "Exception specification table");
3108 output_function_exception_table (const char *fnname
)
3110 rtx personality
= get_personality_function (current_function_decl
);
3112 /* Not all functions need anything. */
3113 if (! crtl
->uses_eh_lsda
)
3118 assemble_external_libcall (personality
);
3120 if (targetm
.asm_out
.emit_except_personality
)
3121 targetm
.asm_out
.emit_except_personality (personality
);
3124 switch_to_exception_section (fnname
);
3126 /* If the target wants a label to begin the table, emit it here. */
3127 targetm
.asm_out
.emit_except_table_label (asm_out_file
);
3129 output_one_function_exception_table (0);
3130 if (crtl
->eh
.call_site_record_v
[1])
3131 output_one_function_exception_table (1);
3133 switch_to_section (current_function_section ());
3137 set_eh_throw_stmt_table (struct function
*fun
, struct htab
*table
)
3139 fun
->eh
->throw_stmt_table
= table
;
3143 get_eh_throw_stmt_table (struct function
*fun
)
3145 return fun
->eh
->throw_stmt_table
;
3148 /* Determine if the function needs an EH personality function. */
3150 enum eh_personality_kind
3151 function_needs_eh_personality (struct function
*fn
)
3153 enum eh_personality_kind kind
= eh_personality_none
;
3156 FOR_ALL_EH_REGION_FN (i
, fn
)
3161 /* Can do with any personality including the generic C one. */
3162 kind
= eh_personality_any
;
3166 case ERT_ALLOWED_EXCEPTIONS
:
3167 /* Always needs a EH personality function. The generic C
3168 personality doesn't handle these even for empty type lists. */
3169 return eh_personality_lang
;
3171 case ERT_MUST_NOT_THROW
:
3172 /* Always needs a EH personality function. The language may specify
3173 what abort routine that must be used, e.g. std::terminate. */
3174 return eh_personality_lang
;
3181 /* Dump EH information to OUT. */
3184 dump_eh_tree (FILE * out
, struct function
*fun
)
3188 static const char *const type_name
[] = {
3189 "cleanup", "try", "allowed_exceptions", "must_not_throw"
3192 i
= fun
->eh
->region_tree
;
3196 fprintf (out
, "Eh tree:\n");
3199 fprintf (out
, " %*s %i %s", depth
* 2, "",
3200 i
->index
, type_name
[(int) i
->type
]);
3202 if (i
->landing_pads
)
3206 fprintf (out
, " land:");
3207 if (current_ir_type () == IR_GIMPLE
)
3209 for (lp
= i
->landing_pads
; lp
; lp
= lp
->next_lp
)
3211 fprintf (out
, "{%i,", lp
->index
);
3212 print_generic_expr (out
, lp
->post_landing_pad
, 0);
3220 for (lp
= i
->landing_pads
; lp
; lp
= lp
->next_lp
)
3222 fprintf (out
, "{%i,", lp
->index
);
3223 if (lp
->landing_pad
)
3224 fprintf (out
, "%i%s,", INSN_UID (lp
->landing_pad
),
3225 NOTE_P (lp
->landing_pad
) ? "(del)" : "");
3227 fprintf (out
, "(nil),");
3228 if (lp
->post_landing_pad
)
3230 rtx lab
= label_rtx (lp
->post_landing_pad
);
3231 fprintf (out
, "%i%s}", INSN_UID (lab
),
3232 NOTE_P (lab
) ? "(del)" : "");
3235 fprintf (out
, "(nil)}");
3245 case ERT_MUST_NOT_THROW
:
3251 fprintf (out
, " catch:");
3252 for (c
= i
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
3257 fprintf (out
, "lab:");
3258 print_generic_expr (out
, c
->label
, 0);
3261 print_generic_expr (out
, c
->type_list
, 0);
3269 case ERT_ALLOWED_EXCEPTIONS
:
3270 fprintf (out
, " filter :%i types:", i
->u
.allowed
.filter
);
3271 print_generic_expr (out
, i
->u
.allowed
.type_list
, 0);
3276 /* If there are sub-regions, process them. */
3278 i
= i
->inner
, depth
++;
3279 /* If there are peers, process them. */
3280 else if (i
->next_peer
)
3282 /* Otherwise, step back up the tree to the next peer. */
3292 while (i
->next_peer
== NULL
);
3298 /* Dump the EH tree for FN on stderr. */
3301 debug_eh_tree (struct function
*fn
)
3303 dump_eh_tree (stderr
, fn
);
3306 /* Verify invariants on EH datastructures. */
3309 verify_eh_tree (struct function
*fun
)
3312 int nvisited_lp
, nvisited_r
;
3313 int count_lp
, count_r
, depth
, i
;
3317 if (!fun
->eh
->region_tree
)
3321 for (i
= 1; vec_safe_iterate (fun
->eh
->region_array
, i
, &r
); ++i
)
3328 error ("region_array is corrupted for region %i", r
->index
);
3334 for (i
= 1; vec_safe_iterate (fun
->eh
->lp_array
, i
, &lp
); ++i
)
3341 error ("lp_array is corrupted for lp %i", lp
->index
);
3346 depth
= nvisited_lp
= nvisited_r
= 0;
3348 r
= fun
->eh
->region_tree
;
3351 if ((*fun
->eh
->region_array
)[r
->index
] != r
)
3353 error ("region_array is corrupted for region %i", r
->index
);
3356 if (r
->outer
!= outer
)
3358 error ("outer block of region %i is wrong", r
->index
);
3363 error ("negative nesting depth of region %i", r
->index
);
3368 for (lp
= r
->landing_pads
; lp
; lp
= lp
->next_lp
)
3370 if ((*fun
->eh
->lp_array
)[lp
->index
] != lp
)
3372 error ("lp_array is corrupted for lp %i", lp
->index
);
3375 if (lp
->region
!= r
)
3377 error ("region of lp %i is wrong", lp
->index
);
3384 outer
= r
, r
= r
->inner
, depth
++;
3385 else if (r
->next_peer
)
3397 while (r
->next_peer
== NULL
);
3404 error ("tree list ends on depth %i", depth
);
3407 if (count_r
!= nvisited_r
)
3409 error ("region_array does not match region_tree");
3412 if (count_lp
!= nvisited_lp
)
3414 error ("lp_array does not match region_tree");
3420 dump_eh_tree (stderr
, fun
);
3421 internal_error ("verify_eh_tree failed");
3425 #include "gt-except.h"