1 /* Implements exception handling.
2 Copyright (C) 1989-2017 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"
119 #include "cfghooks.h"
120 #include "tree-pass.h"
121 #include "memmodel.h"
123 #include "stringpool.h"
126 #include "emit-rtl.h"
128 #include "diagnostic.h"
129 #include "fold-const.h"
130 #include "stor-layout.h"
135 #include "libfuncs.h"
138 #include "dwarf2asm.h"
139 #include "dwarf2out.h"
140 #include "common/common-target.h"
141 #include "langhooks.h"
143 #include "tree-pretty-print.h"
145 #include "builtins.h"
146 #include "tree-hash-traits.h"
148 static GTY(()) int call_site_base
;
150 static GTY (()) hash_map
<tree_hash
, tree
> *type_to_runtime_map
;
152 /* Describe the SjLj_Function_Context structure. */
153 static GTY(()) tree sjlj_fc_type_node
;
154 static int sjlj_fc_call_site_ofs
;
155 static int sjlj_fc_data_ofs
;
156 static int sjlj_fc_personality_ofs
;
157 static int sjlj_fc_lsda_ofs
;
158 static int sjlj_fc_jbuf_ofs
;
161 struct GTY(()) call_site_record_d
167 /* In the following structure and associated functions,
168 we represent entries in the action table as 1-based indices.
171 0: null action record, non-null landing pad; implies cleanups
172 -1: null action record, null landing pad; implies no action
173 -2: no call-site entry; implies must_not_throw
174 -3: we have yet to process outer regions
176 Further, no special cases apply to the "next" field of the record.
177 For next, 0 means end of list. */
186 /* Hashtable helpers. */
188 struct action_record_hasher
: free_ptr_hash
<action_record
>
190 static inline hashval_t
hash (const action_record
*);
191 static inline bool equal (const action_record
*, const action_record
*);
195 action_record_hasher::hash (const action_record
*entry
)
197 return entry
->next
* 1009 + entry
->filter
;
201 action_record_hasher::equal (const action_record
*entry
,
202 const action_record
*data
)
204 return entry
->filter
== data
->filter
&& entry
->next
== data
->next
;
207 typedef hash_table
<action_record_hasher
> action_hash_type
;
209 static bool get_eh_region_and_lp_from_rtx (const_rtx
, eh_region
*,
212 static void dw2_build_landing_pads (void);
214 static int collect_one_action_chain (action_hash_type
*, eh_region
);
215 static int add_call_site (rtx
, int, int);
217 static void push_uleb128 (vec
<uchar
, va_gc
> **, unsigned int);
218 static void push_sleb128 (vec
<uchar
, va_gc
> **, int);
219 static int dw2_size_of_call_site_table (int);
220 static int sjlj_size_of_call_site_table (void);
221 static void dw2_output_call_site_table (int, int);
222 static void sjlj_output_call_site_table (void);
228 if (! flag_exceptions
)
231 type_to_runtime_map
= hash_map
<tree_hash
, tree
>::create_ggc (31);
233 /* Create the SjLj_Function_Context structure. This should match
234 the definition in unwind-sjlj.c. */
235 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
237 tree f_jbuf
, f_per
, f_lsda
, f_prev
, f_cs
, f_data
, tmp
;
239 sjlj_fc_type_node
= lang_hooks
.types
.make_type (RECORD_TYPE
);
241 f_prev
= build_decl (BUILTINS_LOCATION
,
242 FIELD_DECL
, get_identifier ("__prev"),
243 build_pointer_type (sjlj_fc_type_node
));
244 DECL_FIELD_CONTEXT (f_prev
) = sjlj_fc_type_node
;
246 f_cs
= build_decl (BUILTINS_LOCATION
,
247 FIELD_DECL
, get_identifier ("__call_site"),
249 DECL_FIELD_CONTEXT (f_cs
) = sjlj_fc_type_node
;
251 tmp
= build_index_type (size_int (4 - 1));
252 tmp
= build_array_type (lang_hooks
.types
.type_for_mode
253 (targetm
.unwind_word_mode (), 1),
255 f_data
= build_decl (BUILTINS_LOCATION
,
256 FIELD_DECL
, get_identifier ("__data"), tmp
);
257 DECL_FIELD_CONTEXT (f_data
) = sjlj_fc_type_node
;
259 f_per
= build_decl (BUILTINS_LOCATION
,
260 FIELD_DECL
, get_identifier ("__personality"),
262 DECL_FIELD_CONTEXT (f_per
) = sjlj_fc_type_node
;
264 f_lsda
= build_decl (BUILTINS_LOCATION
,
265 FIELD_DECL
, get_identifier ("__lsda"),
267 DECL_FIELD_CONTEXT (f_lsda
) = sjlj_fc_type_node
;
269 #ifdef DONT_USE_BUILTIN_SETJMP
271 tmp
= size_int (JMP_BUF_SIZE
- 1);
273 /* Should be large enough for most systems, if it is not,
274 JMP_BUF_SIZE should be defined with the proper value. It will
275 also tend to be larger than necessary for most systems, a more
276 optimal port will define JMP_BUF_SIZE. */
277 tmp
= size_int (FIRST_PSEUDO_REGISTER
+ 2 - 1);
280 /* Compute a minimally sized jump buffer. We need room to store at
281 least 3 pointers - stack pointer, frame pointer and return address.
282 Plus for some targets we need room for an extra pointer - in the
283 case of MIPS this is the global pointer. This makes a total of four
284 pointers, but to be safe we actually allocate room for 5.
286 If pointers are smaller than words then we allocate enough room for
287 5 words, just in case the backend needs this much room. For more
288 discussion on this issue see:
289 http://gcc.gnu.org/ml/gcc-patches/2014-05/msg00313.html. */
290 if (POINTER_SIZE
> BITS_PER_WORD
)
291 tmp
= size_int (5 - 1);
293 tmp
= size_int ((5 * BITS_PER_WORD
/ POINTER_SIZE
) - 1);
296 tmp
= build_index_type (tmp
);
297 tmp
= build_array_type (ptr_type_node
, tmp
);
298 f_jbuf
= build_decl (BUILTINS_LOCATION
,
299 FIELD_DECL
, get_identifier ("__jbuf"), tmp
);
300 #ifdef DONT_USE_BUILTIN_SETJMP
301 /* We don't know what the alignment requirements of the
302 runtime's jmp_buf has. Overestimate. */
303 SET_DECL_ALIGN (f_jbuf
, BIGGEST_ALIGNMENT
);
304 DECL_USER_ALIGN (f_jbuf
) = 1;
306 DECL_FIELD_CONTEXT (f_jbuf
) = sjlj_fc_type_node
;
308 TYPE_FIELDS (sjlj_fc_type_node
) = f_prev
;
309 TREE_CHAIN (f_prev
) = f_cs
;
310 TREE_CHAIN (f_cs
) = f_data
;
311 TREE_CHAIN (f_data
) = f_per
;
312 TREE_CHAIN (f_per
) = f_lsda
;
313 TREE_CHAIN (f_lsda
) = f_jbuf
;
315 layout_type (sjlj_fc_type_node
);
317 /* Cache the interesting field offsets so that we have
318 easy access from rtl. */
319 sjlj_fc_call_site_ofs
320 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_cs
))
321 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_cs
)) / BITS_PER_UNIT
);
323 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_data
))
324 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_data
)) / BITS_PER_UNIT
);
325 sjlj_fc_personality_ofs
326 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_per
))
327 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_per
)) / BITS_PER_UNIT
);
329 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_lsda
))
330 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_lsda
)) / BITS_PER_UNIT
);
332 = (tree_to_uhwi (DECL_FIELD_OFFSET (f_jbuf
))
333 + tree_to_uhwi (DECL_FIELD_BIT_OFFSET (f_jbuf
)) / BITS_PER_UNIT
);
338 init_eh_for_function (void)
340 cfun
->eh
= ggc_cleared_alloc
<eh_status
> ();
342 /* Make sure zero'th entries are used. */
343 vec_safe_push (cfun
->eh
->region_array
, (eh_region
)0);
344 vec_safe_push (cfun
->eh
->lp_array
, (eh_landing_pad
)0);
347 /* Routines to generate the exception tree somewhat directly.
348 These are used from tree-eh.c when processing exception related
349 nodes during tree optimization. */
352 gen_eh_region (enum eh_region_type type
, eh_region outer
)
356 /* Insert a new blank region as a leaf in the tree. */
357 new_eh
= ggc_cleared_alloc
<eh_region_d
> ();
359 new_eh
->outer
= outer
;
362 new_eh
->next_peer
= outer
->inner
;
363 outer
->inner
= new_eh
;
367 new_eh
->next_peer
= cfun
->eh
->region_tree
;
368 cfun
->eh
->region_tree
= new_eh
;
371 new_eh
->index
= vec_safe_length (cfun
->eh
->region_array
);
372 vec_safe_push (cfun
->eh
->region_array
, new_eh
);
374 /* Copy the language's notion of whether to use __cxa_end_cleanup. */
375 if (targetm
.arm_eabi_unwinder
&& lang_hooks
.eh_use_cxa_end_cleanup
)
376 new_eh
->use_cxa_end_cleanup
= true;
382 gen_eh_region_cleanup (eh_region outer
)
384 return gen_eh_region (ERT_CLEANUP
, outer
);
388 gen_eh_region_try (eh_region outer
)
390 return gen_eh_region (ERT_TRY
, outer
);
394 gen_eh_region_catch (eh_region t
, tree type_or_list
)
397 tree type_list
, type_node
;
399 gcc_assert (t
->type
== ERT_TRY
);
401 /* Ensure to always end up with a type list to normalize further
402 processing, then register each type against the runtime types map. */
403 type_list
= type_or_list
;
406 if (TREE_CODE (type_or_list
) != TREE_LIST
)
407 type_list
= tree_cons (NULL_TREE
, type_or_list
, NULL_TREE
);
409 type_node
= type_list
;
410 for (; type_node
; type_node
= TREE_CHAIN (type_node
))
411 add_type_for_runtime (TREE_VALUE (type_node
));
414 c
= ggc_cleared_alloc
<eh_catch_d
> ();
415 c
->type_list
= type_list
;
416 l
= t
->u
.eh_try
.last_catch
;
421 t
->u
.eh_try
.first_catch
= c
;
422 t
->u
.eh_try
.last_catch
= c
;
428 gen_eh_region_allowed (eh_region outer
, tree allowed
)
430 eh_region region
= gen_eh_region (ERT_ALLOWED_EXCEPTIONS
, outer
);
431 region
->u
.allowed
.type_list
= allowed
;
433 for (; allowed
; allowed
= TREE_CHAIN (allowed
))
434 add_type_for_runtime (TREE_VALUE (allowed
));
440 gen_eh_region_must_not_throw (eh_region outer
)
442 return gen_eh_region (ERT_MUST_NOT_THROW
, outer
);
446 gen_eh_landing_pad (eh_region region
)
448 eh_landing_pad lp
= ggc_cleared_alloc
<eh_landing_pad_d
> ();
450 lp
->next_lp
= region
->landing_pads
;
452 lp
->index
= vec_safe_length (cfun
->eh
->lp_array
);
453 region
->landing_pads
= lp
;
455 vec_safe_push (cfun
->eh
->lp_array
, lp
);
461 get_eh_region_from_number_fn (struct function
*ifun
, int i
)
463 return (*ifun
->eh
->region_array
)[i
];
467 get_eh_region_from_number (int i
)
469 return get_eh_region_from_number_fn (cfun
, i
);
473 get_eh_landing_pad_from_number_fn (struct function
*ifun
, int i
)
475 return (*ifun
->eh
->lp_array
)[i
];
479 get_eh_landing_pad_from_number (int i
)
481 return get_eh_landing_pad_from_number_fn (cfun
, i
);
485 get_eh_region_from_lp_number_fn (struct function
*ifun
, int i
)
488 return (*ifun
->eh
->region_array
)[-i
];
494 lp
= (*ifun
->eh
->lp_array
)[i
];
500 get_eh_region_from_lp_number (int i
)
502 return get_eh_region_from_lp_number_fn (cfun
, i
);
505 /* Returns true if the current function has exception handling regions. */
508 current_function_has_exception_handlers (void)
510 return cfun
->eh
->region_tree
!= NULL
;
513 /* A subroutine of duplicate_eh_regions. Copy the eh_region tree at OLD.
514 Root it at OUTER, and apply LP_OFFSET to the lp numbers. */
516 struct duplicate_eh_regions_data
518 duplicate_eh_regions_map label_map
;
519 void *label_map_data
;
520 hash_map
<void *, void *> *eh_map
;
524 duplicate_eh_regions_1 (struct duplicate_eh_regions_data
*data
,
525 eh_region old_r
, eh_region outer
)
527 eh_landing_pad old_lp
, new_lp
;
530 new_r
= gen_eh_region (old_r
->type
, outer
);
531 gcc_assert (!data
->eh_map
->put (old_r
, new_r
));
541 for (oc
= old_r
->u
.eh_try
.first_catch
; oc
; oc
= oc
->next_catch
)
543 /* We should be doing all our region duplication before and
544 during inlining, which is before filter lists are created. */
545 gcc_assert (oc
->filter_list
== NULL
);
546 nc
= gen_eh_region_catch (new_r
, oc
->type_list
);
547 nc
->label
= data
->label_map (oc
->label
, data
->label_map_data
);
552 case ERT_ALLOWED_EXCEPTIONS
:
553 new_r
->u
.allowed
.type_list
= old_r
->u
.allowed
.type_list
;
554 if (old_r
->u
.allowed
.label
)
555 new_r
->u
.allowed
.label
556 = data
->label_map (old_r
->u
.allowed
.label
, data
->label_map_data
);
558 new_r
->u
.allowed
.label
= NULL_TREE
;
561 case ERT_MUST_NOT_THROW
:
562 new_r
->u
.must_not_throw
.failure_loc
=
563 LOCATION_LOCUS (old_r
->u
.must_not_throw
.failure_loc
);
564 new_r
->u
.must_not_throw
.failure_decl
=
565 old_r
->u
.must_not_throw
.failure_decl
;
569 for (old_lp
= old_r
->landing_pads
; old_lp
; old_lp
= old_lp
->next_lp
)
571 /* Don't bother copying unused landing pads. */
572 if (old_lp
->post_landing_pad
== NULL
)
575 new_lp
= gen_eh_landing_pad (new_r
);
576 gcc_assert (!data
->eh_map
->put (old_lp
, new_lp
));
578 new_lp
->post_landing_pad
579 = data
->label_map (old_lp
->post_landing_pad
, data
->label_map_data
);
580 EH_LANDING_PAD_NR (new_lp
->post_landing_pad
) = new_lp
->index
;
583 /* Make sure to preserve the original use of __cxa_end_cleanup. */
584 new_r
->use_cxa_end_cleanup
= old_r
->use_cxa_end_cleanup
;
586 for (old_r
= old_r
->inner
; old_r
; old_r
= old_r
->next_peer
)
587 duplicate_eh_regions_1 (data
, old_r
, new_r
);
590 /* Duplicate the EH regions from IFUN rooted at COPY_REGION into
591 the current function and root the tree below OUTER_REGION.
592 The special case of COPY_REGION of NULL means all regions.
593 Remap labels using MAP/MAP_DATA callback. Return a pointer map
594 that allows the caller to remap uses of both EH regions and
597 hash_map
<void *, void *> *
598 duplicate_eh_regions (struct function
*ifun
,
599 eh_region copy_region
, int outer_lp
,
600 duplicate_eh_regions_map map
, void *map_data
)
602 struct duplicate_eh_regions_data data
;
603 eh_region outer_region
;
606 verify_eh_tree (ifun
);
608 data
.label_map
= map
;
609 data
.label_map_data
= map_data
;
610 data
.eh_map
= new hash_map
<void *, void *>;
612 outer_region
= get_eh_region_from_lp_number_fn (cfun
, outer_lp
);
614 /* Copy all the regions in the subtree. */
616 duplicate_eh_regions_1 (&data
, copy_region
, outer_region
);
620 for (r
= ifun
->eh
->region_tree
; r
; r
= r
->next_peer
)
621 duplicate_eh_regions_1 (&data
, r
, outer_region
);
625 verify_eh_tree (cfun
);
630 /* Return the region that is outer to both REGION_A and REGION_B in IFUN. */
633 eh_region_outermost (struct function
*ifun
, eh_region region_a
,
636 gcc_assert (ifun
->eh
->region_array
);
637 gcc_assert (ifun
->eh
->region_tree
);
639 auto_sbitmap
b_outer (ifun
->eh
->region_array
->length ());
640 bitmap_clear (b_outer
);
644 bitmap_set_bit (b_outer
, region_b
->index
);
645 region_b
= region_b
->outer
;
651 if (bitmap_bit_p (b_outer
, region_a
->index
))
653 region_a
= region_a
->outer
;
661 add_type_for_runtime (tree type
)
663 /* If TYPE is NOP_EXPR, it means that it already is a runtime type. */
664 if (TREE_CODE (type
) == NOP_EXPR
)
667 bool existed
= false;
668 tree
*slot
= &type_to_runtime_map
->get_or_insert (type
, &existed
);
670 *slot
= lang_hooks
.eh_runtime_type (type
);
674 lookup_type_for_runtime (tree type
)
676 /* If TYPE is NOP_EXPR, it means that it already is a runtime type. */
677 if (TREE_CODE (type
) == NOP_EXPR
)
680 /* We should have always inserted the data earlier. */
681 return *type_to_runtime_map
->get (type
);
685 /* Represent an entry in @TTypes for either catch actions
686 or exception filter actions. */
687 struct ttypes_filter
{
692 /* Helper for ttypes_filter hashing. */
694 struct ttypes_filter_hasher
: free_ptr_hash
<ttypes_filter
>
696 typedef tree_node
*compare_type
;
697 static inline hashval_t
hash (const ttypes_filter
*);
698 static inline bool equal (const ttypes_filter
*, const tree_node
*);
701 /* Compare ENTRY (a ttypes_filter entry in the hash table) with DATA
702 (a tree) for a @TTypes type node we are thinking about adding. */
705 ttypes_filter_hasher::equal (const ttypes_filter
*entry
, const tree_node
*data
)
707 return entry
->t
== data
;
711 ttypes_filter_hasher::hash (const ttypes_filter
*entry
)
713 return TREE_HASH (entry
->t
);
716 typedef hash_table
<ttypes_filter_hasher
> ttypes_hash_type
;
719 /* Helper for ehspec hashing. */
721 struct ehspec_hasher
: free_ptr_hash
<ttypes_filter
>
723 static inline hashval_t
hash (const ttypes_filter
*);
724 static inline bool equal (const ttypes_filter
*, const ttypes_filter
*);
727 /* Compare ENTRY with DATA (both struct ttypes_filter) for a @TTypes
728 exception specification list we are thinking about adding. */
729 /* ??? Currently we use the type lists in the order given. Someone
730 should put these in some canonical order. */
733 ehspec_hasher::equal (const ttypes_filter
*entry
, const ttypes_filter
*data
)
735 return type_list_equal (entry
->t
, data
->t
);
738 /* Hash function for exception specification lists. */
741 ehspec_hasher::hash (const ttypes_filter
*entry
)
746 for (list
= entry
->t
; list
; list
= TREE_CHAIN (list
))
747 h
= (h
<< 5) + (h
>> 27) + TREE_HASH (TREE_VALUE (list
));
751 typedef hash_table
<ehspec_hasher
> ehspec_hash_type
;
754 /* Add TYPE (which may be NULL) to cfun->eh->ttype_data, using TYPES_HASH
755 to speed up the search. Return the filter value to be used. */
758 add_ttypes_entry (ttypes_hash_type
*ttypes_hash
, tree type
)
760 struct ttypes_filter
**slot
, *n
;
762 slot
= ttypes_hash
->find_slot_with_hash (type
, (hashval_t
) TREE_HASH (type
),
765 if ((n
= *slot
) == NULL
)
767 /* Filter value is a 1 based table index. */
769 n
= XNEW (struct ttypes_filter
);
771 n
->filter
= vec_safe_length (cfun
->eh
->ttype_data
) + 1;
774 vec_safe_push (cfun
->eh
->ttype_data
, type
);
780 /* Add LIST to cfun->eh->ehspec_data, using EHSPEC_HASH and TYPES_HASH
781 to speed up the search. Return the filter value to be used. */
784 add_ehspec_entry (ehspec_hash_type
*ehspec_hash
, ttypes_hash_type
*ttypes_hash
,
787 struct ttypes_filter
**slot
, *n
;
788 struct ttypes_filter dummy
;
791 slot
= ehspec_hash
->find_slot (&dummy
, INSERT
);
793 if ((n
= *slot
) == NULL
)
797 if (targetm
.arm_eabi_unwinder
)
798 len
= vec_safe_length (cfun
->eh
->ehspec_data
.arm_eabi
);
800 len
= vec_safe_length (cfun
->eh
->ehspec_data
.other
);
802 /* Filter value is a -1 based byte index into a uleb128 buffer. */
804 n
= XNEW (struct ttypes_filter
);
806 n
->filter
= -(len
+ 1);
809 /* Generate a 0 terminated list of filter values. */
810 for (; list
; list
= TREE_CHAIN (list
))
812 if (targetm
.arm_eabi_unwinder
)
813 vec_safe_push (cfun
->eh
->ehspec_data
.arm_eabi
, TREE_VALUE (list
));
816 /* Look up each type in the list and encode its filter
817 value as a uleb128. */
818 push_uleb128 (&cfun
->eh
->ehspec_data
.other
,
819 add_ttypes_entry (ttypes_hash
, TREE_VALUE (list
)));
822 if (targetm
.arm_eabi_unwinder
)
823 vec_safe_push (cfun
->eh
->ehspec_data
.arm_eabi
, NULL_TREE
);
825 vec_safe_push (cfun
->eh
->ehspec_data
.other
, (uchar
)0);
831 /* Generate the action filter values to be used for CATCH and
832 ALLOWED_EXCEPTIONS regions. When using dwarf2 exception regions,
833 we use lots of landing pads, and so every type or list can share
834 the same filter value, which saves table space. */
837 assign_filter_values (void)
843 vec_alloc (cfun
->eh
->ttype_data
, 16);
844 if (targetm
.arm_eabi_unwinder
)
845 vec_alloc (cfun
->eh
->ehspec_data
.arm_eabi
, 64);
847 vec_alloc (cfun
->eh
->ehspec_data
.other
, 64);
849 ehspec_hash_type
ehspec (31);
850 ttypes_hash_type
ttypes (31);
852 for (i
= 1; vec_safe_iterate (cfun
->eh
->region_array
, i
, &r
); ++i
)
860 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
862 /* Whatever type_list is (NULL or true list), we build a list
863 of filters for the region. */
864 c
->filter_list
= NULL_TREE
;
866 if (c
->type_list
!= NULL
)
868 /* Get a filter value for each of the types caught and store
869 them in the region's dedicated list. */
870 tree tp_node
= c
->type_list
;
872 for ( ; tp_node
; tp_node
= TREE_CHAIN (tp_node
))
875 = add_ttypes_entry (&ttypes
, TREE_VALUE (tp_node
));
876 tree flt_node
= build_int_cst (integer_type_node
, flt
);
879 = tree_cons (NULL_TREE
, flt_node
, c
->filter_list
);
884 /* Get a filter value for the NULL list also since it
885 will need an action record anyway. */
886 int flt
= add_ttypes_entry (&ttypes
, NULL
);
887 tree flt_node
= build_int_cst (integer_type_node
, flt
);
890 = tree_cons (NULL_TREE
, flt_node
, NULL
);
895 case ERT_ALLOWED_EXCEPTIONS
:
897 = add_ehspec_entry (&ehspec
, &ttypes
, r
->u
.allowed
.type_list
);
906 /* Emit SEQ into basic block just before INSN (that is assumed to be
907 first instruction of some existing BB and return the newly
910 emit_to_new_bb_before (rtx_insn
*seq
, rtx_insn
*insn
)
917 /* If there happens to be a fallthru edge (possibly created by cleanup_cfg
918 call), we don't want it to go into newly created landing pad or other EH
920 for (ei
= ei_start (BLOCK_FOR_INSN (insn
)->preds
); (e
= ei_safe_edge (ei
)); )
921 if (e
->flags
& EDGE_FALLTHRU
)
922 force_nonfallthru (e
);
925 last
= emit_insn_before (seq
, insn
);
926 if (BARRIER_P (last
))
927 last
= PREV_INSN (last
);
928 bb
= create_basic_block (seq
, last
, BLOCK_FOR_INSN (insn
)->prev_bb
);
929 update_bb_for_insn (bb
);
930 bb
->flags
|= BB_SUPERBLOCK
;
934 /* A subroutine of dw2_build_landing_pads, also used for edge splitting
935 at the rtl level. Emit the code required by the target at a landing
936 pad for the given region. */
939 expand_dw2_landing_pad_for_region (eh_region region
)
941 if (targetm
.have_exception_receiver ())
942 emit_insn (targetm
.gen_exception_receiver ());
943 else if (targetm
.have_nonlocal_goto_receiver ())
944 emit_insn (targetm
.gen_nonlocal_goto_receiver ());
948 if (region
->exc_ptr_reg
)
949 emit_move_insn (region
->exc_ptr_reg
,
950 gen_rtx_REG (ptr_mode
, EH_RETURN_DATA_REGNO (0)));
951 if (region
->filter_reg
)
952 emit_move_insn (region
->filter_reg
,
953 gen_rtx_REG (targetm
.eh_return_filter_mode (),
954 EH_RETURN_DATA_REGNO (1)));
957 /* Expand the extra code needed at landing pads for dwarf2 unwinding. */
960 dw2_build_landing_pads (void)
964 int e_flags
= EDGE_FALLTHRU
;
966 /* If we're going to partition blocks, we need to be able to add
967 new landing pads later, which means that we need to hold on to
968 the post-landing-pad block. Prevent it from being merged away.
969 We'll remove this bit after partitioning. */
970 if (flag_reorder_blocks_and_partition
)
971 e_flags
|= EDGE_PRESERVE
;
973 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
978 if (lp
== NULL
|| lp
->post_landing_pad
== NULL
)
983 lp
->landing_pad
= gen_label_rtx ();
984 emit_label (lp
->landing_pad
);
985 LABEL_PRESERVE_P (lp
->landing_pad
) = 1;
987 expand_dw2_landing_pad_for_region (lp
->region
);
992 bb
= emit_to_new_bb_before (seq
, label_rtx (lp
->post_landing_pad
));
993 bb
->count
= bb
->next_bb
->count
;
994 bb
->frequency
= bb
->next_bb
->frequency
;
995 make_single_succ_edge (bb
, bb
->next_bb
, e_flags
);
998 struct loop
*loop
= bb
->next_bb
->loop_father
;
999 /* If we created a pre-header block, add the new block to the
1000 outer loop, otherwise to the loop itself. */
1001 if (bb
->next_bb
== loop
->header
)
1002 add_bb_to_loop (bb
, loop_outer (loop
));
1004 add_bb_to_loop (bb
, loop
);
1010 static vec
<int> sjlj_lp_call_site_index
;
1012 /* Process all active landing pads. Assign each one a compact dispatch
1013 index, and a call-site index. */
1016 sjlj_assign_call_site_values (void)
1018 action_hash_type
ar_hash (31);
1022 vec_alloc (crtl
->eh
.action_record_data
, 64);
1026 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1027 if (lp
&& lp
->post_landing_pad
)
1029 int action
, call_site
;
1031 /* First: build the action table. */
1032 action
= collect_one_action_chain (&ar_hash
, lp
->region
);
1034 /* Next: assign call-site values. If dwarf2 terms, this would be
1035 the region number assigned by convert_to_eh_region_ranges, but
1036 handles no-action and must-not-throw differently. */
1037 /* Map must-not-throw to otherwise unused call-site index 0. */
1040 /* Map no-action to otherwise unused call-site index -1. */
1041 else if (action
== -1)
1043 /* Otherwise, look it up in the table. */
1045 call_site
= add_call_site (GEN_INT (disp_index
), action
, 0);
1046 sjlj_lp_call_site_index
[i
] = call_site
;
1054 /* Emit code to record the current call-site index before every
1055 insn that can throw. */
1058 sjlj_mark_call_sites (void)
1060 int last_call_site
= -2;
1064 for (insn
= get_insns (); insn
; insn
= NEXT_INSN (insn
))
1070 rtx_insn
*before
, *p
;
1072 /* Reset value tracking at extended basic block boundaries. */
1074 last_call_site
= -2;
1076 /* If the function allocates dynamic stack space, the context must
1077 be updated after every allocation/deallocation accordingly. */
1078 if (NOTE_P (insn
) && NOTE_KIND (insn
) == NOTE_INSN_UPDATE_SJLJ_CONTEXT
)
1083 buf_addr
= plus_constant (Pmode
, XEXP (crtl
->eh
.sjlj_fc
, 0),
1085 expand_builtin_update_setjmp_buf (buf_addr
);
1088 emit_insn_before (p
, insn
);
1091 if (! INSN_P (insn
))
1094 nothrow
= get_eh_region_and_lp_from_rtx (insn
, &r
, &lp
);
1098 this_call_site
= sjlj_lp_call_site_index
[lp
->index
];
1101 /* Calls (and trapping insns) without notes are outside any
1102 exception handling region in this function. Mark them as
1104 this_call_site
= -1;
1108 gcc_assert (r
->type
== ERT_MUST_NOT_THROW
);
1112 if (this_call_site
!= -1)
1113 crtl
->uses_eh_lsda
= 1;
1115 if (this_call_site
== last_call_site
)
1118 /* Don't separate a call from it's argument loads. */
1121 before
= find_first_parameter_load (insn
, NULL
);
1124 mem
= adjust_address (crtl
->eh
.sjlj_fc
, TYPE_MODE (integer_type_node
),
1125 sjlj_fc_call_site_ofs
);
1126 emit_move_insn (mem
, gen_int_mode (this_call_site
, GET_MODE (mem
)));
1130 emit_insn_before (p
, before
);
1131 last_call_site
= this_call_site
;
1135 /* Construct the SjLj_Function_Context. */
1138 sjlj_emit_function_enter (rtx_code_label
*dispatch_label
)
1140 rtx_insn
*fn_begin
, *seq
;
1142 bool fn_begin_outside_block
;
1143 rtx personality
= get_personality_function (current_function_decl
);
1145 fc
= crtl
->eh
.sjlj_fc
;
1149 /* We're storing this libcall's address into memory instead of
1150 calling it directly. Thus, we must call assemble_external_libcall
1151 here, as we can not depend on emit_library_call to do it for us. */
1152 assemble_external_libcall (personality
);
1153 mem
= adjust_address (fc
, Pmode
, sjlj_fc_personality_ofs
);
1154 emit_move_insn (mem
, personality
);
1156 mem
= adjust_address (fc
, Pmode
, sjlj_fc_lsda_ofs
);
1157 if (crtl
->uses_eh_lsda
)
1162 ASM_GENERATE_INTERNAL_LABEL (buf
, "LLSDA", current_function_funcdef_no
);
1163 sym
= gen_rtx_SYMBOL_REF (Pmode
, ggc_strdup (buf
));
1164 SYMBOL_REF_FLAGS (sym
) = SYMBOL_FLAG_LOCAL
;
1165 emit_move_insn (mem
, sym
);
1168 emit_move_insn (mem
, const0_rtx
);
1172 rtx addr
= plus_constant (Pmode
, XEXP (fc
, 0), sjlj_fc_jbuf_ofs
);
1174 #ifdef DONT_USE_BUILTIN_SETJMP
1175 addr
= copy_addr_to_reg (addr
);
1176 addr
= convert_memory_address (ptr_mode
, addr
);
1177 tree addr_tree
= make_tree (ptr_type_node
, addr
);
1179 tree fn
= builtin_decl_implicit (BUILT_IN_SETJMP
);
1180 tree call_expr
= build_call_expr (fn
, 1, addr_tree
);
1181 rtx x
= expand_call (call_expr
, NULL_RTX
, false);
1183 emit_cmp_and_jump_insns (x
, const0_rtx
, NE
, 0,
1184 TYPE_MODE (integer_type_node
), 0,
1186 profile_probability::unlikely ());
1188 expand_builtin_setjmp_setup (addr
, dispatch_label
);
1192 emit_library_call (unwind_sjlj_register_libfunc
, LCT_NORMAL
, VOIDmode
,
1193 XEXP (fc
, 0), Pmode
);
1198 /* ??? Instead of doing this at the beginning of the function,
1199 do this in a block that is at loop level 0 and dominates all
1200 can_throw_internal instructions. */
1202 fn_begin_outside_block
= true;
1203 for (fn_begin
= get_insns (); ; fn_begin
= NEXT_INSN (fn_begin
))
1204 if (NOTE_P (fn_begin
))
1206 if (NOTE_KIND (fn_begin
) == NOTE_INSN_FUNCTION_BEG
)
1208 else if (NOTE_INSN_BASIC_BLOCK_P (fn_begin
))
1209 fn_begin_outside_block
= false;
1212 #ifdef DONT_USE_BUILTIN_SETJMP
1215 /* The sequence contains a branch in the middle so we need to force
1216 the creation of a new basic block by means of BB_SUPERBLOCK. */
1217 if (fn_begin_outside_block
)
1220 = split_edge (single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
1221 if (JUMP_P (BB_END (bb
)))
1222 emit_insn_before (seq
, BB_END (bb
));
1224 emit_insn_after (seq
, BB_END (bb
));
1227 emit_insn_after (seq
, fn_begin
);
1229 single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
))->flags
|= BB_SUPERBLOCK
;
1234 if (fn_begin_outside_block
)
1235 insert_insn_on_edge (seq
, single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
)));
1237 emit_insn_after (seq
, fn_begin
);
1240 /* Call back from expand_function_end to know where we should put
1241 the call to unwind_sjlj_unregister_libfunc if needed. */
1244 sjlj_emit_function_exit_after (rtx_insn
*after
)
1246 crtl
->eh
.sjlj_exit_after
= after
;
1250 sjlj_emit_function_exit (void)
1252 rtx_insn
*seq
, *insn
;
1256 emit_library_call (unwind_sjlj_unregister_libfunc
, LCT_NORMAL
, VOIDmode
,
1257 XEXP (crtl
->eh
.sjlj_fc
, 0), Pmode
);
1262 /* ??? Really this can be done in any block at loop level 0 that
1263 post-dominates all can_throw_internal instructions. This is
1264 the last possible moment. */
1266 insn
= crtl
->eh
.sjlj_exit_after
;
1268 insn
= NEXT_INSN (insn
);
1270 emit_insn_after (seq
, insn
);
1274 sjlj_emit_dispatch_table (rtx_code_label
*dispatch_label
, int num_dispatch
)
1276 scalar_int_mode unwind_word_mode
= targetm
.unwind_word_mode ();
1277 scalar_int_mode filter_mode
= targetm
.eh_return_filter_mode ();
1279 rtx mem
, fc
, exc_ptr_reg
, filter_reg
;
1284 vec
<tree
> dispatch_labels
= vNULL
;
1286 fc
= crtl
->eh
.sjlj_fc
;
1290 emit_label (dispatch_label
);
1292 #ifndef DONT_USE_BUILTIN_SETJMP
1293 expand_builtin_setjmp_receiver (dispatch_label
);
1295 /* The caller of expand_builtin_setjmp_receiver is responsible for
1296 making sure that the label doesn't vanish. The only other caller
1297 is the expander for __builtin_setjmp_receiver, which places this
1298 label on the nonlocal_goto_label list. Since we're modeling these
1299 CFG edges more exactly, we can use the forced_labels list instead. */
1300 LABEL_PRESERVE_P (dispatch_label
) = 1;
1301 vec_safe_push
<rtx_insn
*> (forced_labels
, dispatch_label
);
1304 /* Load up exc_ptr and filter values from the function context. */
1305 mem
= adjust_address (fc
, unwind_word_mode
, sjlj_fc_data_ofs
);
1306 if (unwind_word_mode
!= ptr_mode
)
1308 #ifdef POINTERS_EXTEND_UNSIGNED
1309 mem
= convert_memory_address (ptr_mode
, mem
);
1311 mem
= convert_to_mode (ptr_mode
, mem
, 0);
1314 exc_ptr_reg
= force_reg (ptr_mode
, mem
);
1316 mem
= adjust_address (fc
, unwind_word_mode
,
1317 sjlj_fc_data_ofs
+ GET_MODE_SIZE (unwind_word_mode
));
1318 if (unwind_word_mode
!= filter_mode
)
1319 mem
= convert_to_mode (filter_mode
, mem
, 0);
1320 filter_reg
= force_reg (filter_mode
, mem
);
1322 /* Jump to one of the directly reachable regions. */
1325 rtx_code_label
*first_reachable_label
= NULL
;
1327 /* If there's exactly one call site in the function, don't bother
1328 generating a switch statement. */
1329 if (num_dispatch
> 1)
1330 dispatch_labels
.create (num_dispatch
);
1332 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1333 if (lp
&& lp
->post_landing_pad
)
1336 rtx_code_label
*label
;
1340 lp
->landing_pad
= dispatch_label
;
1342 if (num_dispatch
> 1)
1344 tree t_label
, case_elt
, t
;
1346 t_label
= create_artificial_label (UNKNOWN_LOCATION
);
1347 t
= build_int_cst (integer_type_node
, disp_index
);
1348 case_elt
= build_case_label (t
, NULL
, t_label
);
1349 dispatch_labels
.quick_push (case_elt
);
1350 label
= jump_target_rtx (t_label
);
1353 label
= gen_label_rtx ();
1355 if (disp_index
== 0)
1356 first_reachable_label
= label
;
1361 emit_move_insn (r
->exc_ptr_reg
, exc_ptr_reg
);
1363 emit_move_insn (r
->filter_reg
, filter_reg
);
1365 seq2
= get_insns ();
1368 rtx_insn
*before
= label_rtx (lp
->post_landing_pad
);
1369 bb
= emit_to_new_bb_before (seq2
, before
);
1370 make_single_succ_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
1373 struct loop
*loop
= bb
->next_bb
->loop_father
;
1374 /* If we created a pre-header block, add the new block to the
1375 outer loop, otherwise to the loop itself. */
1376 if (bb
->next_bb
== loop
->header
)
1377 add_bb_to_loop (bb
, loop_outer (loop
));
1379 add_bb_to_loop (bb
, loop
);
1380 /* ??? For multiple dispatches we will end up with edges
1381 from the loop tree root into this loop, making it a
1382 multiple-entry loop. Discard all affected loops. */
1383 if (num_dispatch
> 1)
1385 for (loop
= bb
->loop_father
;
1386 loop_outer (loop
); loop
= loop_outer (loop
))
1387 mark_loop_for_removal (loop
);
1393 gcc_assert (disp_index
== num_dispatch
);
1395 if (num_dispatch
> 1)
1397 rtx disp
= adjust_address (fc
, TYPE_MODE (integer_type_node
),
1398 sjlj_fc_call_site_ofs
);
1399 expand_sjlj_dispatch_table (disp
, dispatch_labels
);
1405 bb
= emit_to_new_bb_before (seq
, first_reachable_label
);
1406 if (num_dispatch
== 1)
1408 make_single_succ_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
1411 struct loop
*loop
= bb
->next_bb
->loop_father
;
1412 /* If we created a pre-header block, add the new block to the
1413 outer loop, otherwise to the loop itself. */
1414 if (bb
->next_bb
== loop
->header
)
1415 add_bb_to_loop (bb
, loop_outer (loop
));
1417 add_bb_to_loop (bb
, loop
);
1422 /* We are not wiring up edges here, but as the dispatcher call
1423 is at function begin simply associate the block with the
1424 outermost (non-)loop. */
1426 add_bb_to_loop (bb
, current_loops
->tree_root
);
1431 sjlj_build_landing_pads (void)
1435 num_dispatch
= vec_safe_length (cfun
->eh
->lp_array
);
1436 if (num_dispatch
== 0)
1438 sjlj_lp_call_site_index
.safe_grow_cleared (num_dispatch
);
1440 num_dispatch
= sjlj_assign_call_site_values ();
1441 if (num_dispatch
> 0)
1443 rtx_code_label
*dispatch_label
= gen_label_rtx ();
1444 int align
= STACK_SLOT_ALIGNMENT (sjlj_fc_type_node
,
1445 TYPE_MODE (sjlj_fc_type_node
),
1446 TYPE_ALIGN (sjlj_fc_type_node
));
1448 = assign_stack_local (TYPE_MODE (sjlj_fc_type_node
),
1449 int_size_in_bytes (sjlj_fc_type_node
),
1452 sjlj_mark_call_sites ();
1453 sjlj_emit_function_enter (dispatch_label
);
1454 sjlj_emit_dispatch_table (dispatch_label
, num_dispatch
);
1455 sjlj_emit_function_exit ();
1458 /* If we do not have any landing pads, we may still need to register a
1459 personality routine and (empty) LSDA to handle must-not-throw regions. */
1460 else if (function_needs_eh_personality (cfun
) != eh_personality_none
)
1462 int align
= STACK_SLOT_ALIGNMENT (sjlj_fc_type_node
,
1463 TYPE_MODE (sjlj_fc_type_node
),
1464 TYPE_ALIGN (sjlj_fc_type_node
));
1466 = assign_stack_local (TYPE_MODE (sjlj_fc_type_node
),
1467 int_size_in_bytes (sjlj_fc_type_node
),
1470 sjlj_mark_call_sites ();
1471 sjlj_emit_function_enter (NULL
);
1472 sjlj_emit_function_exit ();
1475 sjlj_lp_call_site_index
.release ();
1478 /* Update the sjlj function context. This function should be called
1479 whenever we allocate or deallocate dynamic stack space. */
1482 update_sjlj_context (void)
1484 if (!flag_exceptions
)
1487 emit_note (NOTE_INSN_UPDATE_SJLJ_CONTEXT
);
1490 /* After initial rtl generation, call back to finish generating
1491 exception support code. */
1494 finish_eh_generation (void)
1498 /* Construct the landing pads. */
1499 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
1500 sjlj_build_landing_pads ();
1502 dw2_build_landing_pads ();
1503 break_superblocks ();
1505 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
1506 /* Kludge for Alpha (see alpha_gp_save_rtx). */
1507 || single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
))->insns
.r
)
1508 commit_edge_insertions ();
1510 /* Redirect all EH edges from the post_landing_pad to the landing pad. */
1511 FOR_EACH_BB_FN (bb
, cfun
)
1517 lp
= get_eh_landing_pad_from_rtx (BB_END (bb
));
1519 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1520 if (e
->flags
& EDGE_EH
)
1523 /* We should not have generated any new throwing insns during this
1524 pass, and we should not have lost any EH edges, so we only need
1525 to handle two cases here:
1526 (1) reachable handler and an existing edge to post-landing-pad,
1527 (2) no reachable handler and no edge. */
1528 gcc_assert ((lp
!= NULL
) == (e
!= NULL
));
1531 gcc_assert (BB_HEAD (e
->dest
) == label_rtx (lp
->post_landing_pad
));
1533 redirect_edge_succ (e
, BLOCK_FOR_INSN (lp
->landing_pad
));
1534 e
->flags
|= (CALL_P (BB_END (bb
))
1535 ? EDGE_ABNORMAL
| EDGE_ABNORMAL_CALL
1541 /* This section handles removing dead code for flow. */
1544 remove_eh_landing_pad (eh_landing_pad lp
)
1548 for (pp
= &lp
->region
->landing_pads
; *pp
!= lp
; pp
= &(*pp
)->next_lp
)
1552 if (lp
->post_landing_pad
)
1553 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1554 (*cfun
->eh
->lp_array
)[lp
->index
] = NULL
;
1557 /* Splice the EH region at PP from the region tree. */
1560 remove_eh_handler_splicer (eh_region
*pp
)
1562 eh_region region
= *pp
;
1565 for (lp
= region
->landing_pads
; lp
; lp
= lp
->next_lp
)
1567 if (lp
->post_landing_pad
)
1568 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1569 (*cfun
->eh
->lp_array
)[lp
->index
] = NULL
;
1575 outer
= region
->outer
;
1577 *pp
= p
= region
->inner
;
1586 *pp
= region
->next_peer
;
1588 (*cfun
->eh
->region_array
)[region
->index
] = NULL
;
1591 /* Splice a single EH region REGION from the region tree.
1593 To unlink REGION, we need to find the pointer to it with a relatively
1594 expensive search in REGION's outer region. If you are going to
1595 remove a number of handlers, using remove_unreachable_eh_regions may
1596 be a better option. */
1599 remove_eh_handler (eh_region region
)
1601 eh_region
*pp
, *pp_start
, p
, outer
;
1603 outer
= region
->outer
;
1605 pp_start
= &outer
->inner
;
1607 pp_start
= &cfun
->eh
->region_tree
;
1608 for (pp
= pp_start
, p
= *pp
; p
!= region
; pp
= &p
->next_peer
, p
= *pp
)
1611 remove_eh_handler_splicer (pp
);
1614 /* Worker for remove_unreachable_eh_regions.
1615 PP is a pointer to the region to start a region tree depth-first
1616 search from. R_REACHABLE is the set of regions that have to be
1620 remove_unreachable_eh_regions_worker (eh_region
*pp
, sbitmap r_reachable
)
1624 eh_region region
= *pp
;
1625 remove_unreachable_eh_regions_worker (®ion
->inner
, r_reachable
);
1626 if (!bitmap_bit_p (r_reachable
, region
->index
))
1627 remove_eh_handler_splicer (pp
);
1629 pp
= ®ion
->next_peer
;
1633 /* Splice all EH regions *not* marked in R_REACHABLE from the region tree.
1634 Do this by traversing the EH tree top-down and splice out regions that
1635 are not marked. By removing regions from the leaves, we avoid costly
1636 searches in the region tree. */
1639 remove_unreachable_eh_regions (sbitmap r_reachable
)
1641 remove_unreachable_eh_regions_worker (&cfun
->eh
->region_tree
, r_reachable
);
1644 /* Invokes CALLBACK for every exception handler landing pad label.
1645 Only used by reload hackery; should not be used by new code. */
1648 for_each_eh_label (void (*callback
) (rtx
))
1653 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1657 rtx_code_label
*lab
= lp
->landing_pad
;
1658 if (lab
&& LABEL_P (lab
))
1664 /* Create the REG_EH_REGION note for INSN, given its ECF_FLAGS for a
1667 At the gimple level, we use LP_NR
1668 > 0 : The statement transfers to landing pad LP_NR
1669 = 0 : The statement is outside any EH region
1670 < 0 : The statement is within MUST_NOT_THROW region -LP_NR.
1672 At the rtl level, we use LP_NR
1673 > 0 : The insn transfers to landing pad LP_NR
1674 = 0 : The insn cannot throw
1675 < 0 : The insn is within MUST_NOT_THROW region -LP_NR
1676 = INT_MIN : The insn cannot throw or execute a nonlocal-goto.
1677 missing note: The insn is outside any EH region.
1679 ??? This difference probably ought to be avoided. We could stand
1680 to record nothrow for arbitrary gimple statements, and so avoid
1681 some moderately complex lookups in stmt_could_throw_p. Perhaps
1682 NOTHROW should be mapped on both sides to INT_MIN. Perhaps the
1683 no-nonlocal-goto property should be recorded elsewhere as a bit
1684 on the call_insn directly. Perhaps we should make more use of
1685 attaching the trees to call_insns (reachable via symbol_ref in
1686 direct call cases) and just pull the data out of the trees. */
1689 make_reg_eh_region_note (rtx_insn
*insn
, int ecf_flags
, int lp_nr
)
1692 if (ecf_flags
& ECF_NOTHROW
)
1694 else if (lp_nr
!= 0)
1695 value
= GEN_INT (lp_nr
);
1698 add_reg_note (insn
, REG_EH_REGION
, value
);
1701 /* Create a REG_EH_REGION note for a CALL_INSN that cannot throw
1702 nor perform a non-local goto. Replace the region note if it
1706 make_reg_eh_region_note_nothrow_nononlocal (rtx_insn
*insn
)
1708 rtx note
= find_reg_note (insn
, REG_EH_REGION
, NULL_RTX
);
1709 rtx intmin
= GEN_INT (INT_MIN
);
1712 XEXP (note
, 0) = intmin
;
1714 add_reg_note (insn
, REG_EH_REGION
, intmin
);
1717 /* Return true if INSN could throw, assuming no REG_EH_REGION note
1721 insn_could_throw_p (const_rtx insn
)
1723 if (!flag_exceptions
)
1727 if (INSN_P (insn
) && cfun
->can_throw_non_call_exceptions
)
1728 return may_trap_p (PATTERN (insn
));
1732 /* Copy an REG_EH_REGION note to each insn that might throw beginning
1733 at FIRST and ending at LAST. NOTE_OR_INSN is either the source insn
1734 to look for a note, or the note itself. */
1737 copy_reg_eh_region_note_forward (rtx note_or_insn
, rtx_insn
*first
, rtx last
)
1740 rtx note
= note_or_insn
;
1742 if (INSN_P (note_or_insn
))
1744 note
= find_reg_note (note_or_insn
, REG_EH_REGION
, NULL_RTX
);
1748 note
= XEXP (note
, 0);
1750 for (insn
= first
; insn
!= last
; insn
= NEXT_INSN (insn
))
1751 if (!find_reg_note (insn
, REG_EH_REGION
, NULL_RTX
)
1752 && insn_could_throw_p (insn
))
1753 add_reg_note (insn
, REG_EH_REGION
, note
);
1756 /* Likewise, but iterate backward. */
1759 copy_reg_eh_region_note_backward (rtx note_or_insn
, rtx_insn
*last
, rtx first
)
1762 rtx 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_sequence
*seq
= as_a
<rtx_sequence
*> (PATTERN (insn
));
1876 int i
, n
= seq
->len ();
1878 for (i
= 0; i
< n
; i
++)
1879 if (can_throw_external (seq
->element (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_sequence
*seq
= as_a
<rtx_sequence
*> (PATTERN (insn
));
1920 int i
, n
= seq
->len ();
1922 for (i
= 0; i
< n
; i
++)
1923 if (!insn_nothrow_p (seq
->element (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
*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_node::get (current_function_decl
)->get_availability ()
1987 >= AVAIL_AVAILABLE
))
1989 struct cgraph_node
*node
= cgraph_node::get (current_function_decl
);
1990 struct cgraph_edge
*e
;
1991 for (e
= node
->callers
; e
; e
= e
->next_caller
)
1992 e
->can_throw_external
= false;
1993 node
->set_nothrow_flag (true);
1996 fprintf (dump_file
, "Marking function nothrow: %s\n\n",
1997 current_function_name ());
2004 const pass_data pass_data_set_nothrow_function_flags
=
2006 RTL_PASS
, /* type */
2007 "nothrow", /* name */
2008 OPTGROUP_NONE
, /* optinfo_flags */
2009 TV_NONE
, /* tv_id */
2010 0, /* properties_required */
2011 0, /* properties_provided */
2012 0, /* properties_destroyed */
2013 0, /* todo_flags_start */
2014 0, /* todo_flags_finish */
2017 class pass_set_nothrow_function_flags
: public rtl_opt_pass
2020 pass_set_nothrow_function_flags (gcc::context
*ctxt
)
2021 : rtl_opt_pass (pass_data_set_nothrow_function_flags
, ctxt
)
2024 /* opt_pass methods: */
2025 virtual unsigned int execute (function
*)
2027 return set_nothrow_function_flags ();
2030 }; // class pass_set_nothrow_function_flags
2035 make_pass_set_nothrow_function_flags (gcc::context
*ctxt
)
2037 return new pass_set_nothrow_function_flags (ctxt
);
2041 /* Various hooks for unwind library. */
2043 /* Expand the EH support builtin functions:
2044 __builtin_eh_pointer and __builtin_eh_filter. */
2047 expand_builtin_eh_common (tree region_nr_t
)
2049 HOST_WIDE_INT region_nr
;
2052 gcc_assert (tree_fits_shwi_p (region_nr_t
));
2053 region_nr
= tree_to_shwi (region_nr_t
);
2055 region
= (*cfun
->eh
->region_array
)[region_nr
];
2057 /* ??? We shouldn't have been able to delete a eh region without
2058 deleting all the code that depended on it. */
2059 gcc_assert (region
!= NULL
);
2064 /* Expand to the exc_ptr value from the given eh region. */
2067 expand_builtin_eh_pointer (tree exp
)
2070 = expand_builtin_eh_common (CALL_EXPR_ARG (exp
, 0));
2071 if (region
->exc_ptr_reg
== NULL
)
2072 region
->exc_ptr_reg
= gen_reg_rtx (ptr_mode
);
2073 return region
->exc_ptr_reg
;
2076 /* Expand to the filter value from the given eh region. */
2079 expand_builtin_eh_filter (tree exp
)
2082 = expand_builtin_eh_common (CALL_EXPR_ARG (exp
, 0));
2083 if (region
->filter_reg
== NULL
)
2084 region
->filter_reg
= gen_reg_rtx (targetm
.eh_return_filter_mode ());
2085 return region
->filter_reg
;
2088 /* Copy the exc_ptr and filter values from one landing pad's registers
2089 to another. This is used to inline the resx statement. */
2092 expand_builtin_eh_copy_values (tree exp
)
2095 = expand_builtin_eh_common (CALL_EXPR_ARG (exp
, 0));
2097 = expand_builtin_eh_common (CALL_EXPR_ARG (exp
, 1));
2098 scalar_int_mode fmode
= targetm
.eh_return_filter_mode ();
2100 if (dst
->exc_ptr_reg
== NULL
)
2101 dst
->exc_ptr_reg
= gen_reg_rtx (ptr_mode
);
2102 if (src
->exc_ptr_reg
== NULL
)
2103 src
->exc_ptr_reg
= gen_reg_rtx (ptr_mode
);
2105 if (dst
->filter_reg
== NULL
)
2106 dst
->filter_reg
= gen_reg_rtx (fmode
);
2107 if (src
->filter_reg
== NULL
)
2108 src
->filter_reg
= gen_reg_rtx (fmode
);
2110 emit_move_insn (dst
->exc_ptr_reg
, src
->exc_ptr_reg
);
2111 emit_move_insn (dst
->filter_reg
, src
->filter_reg
);
2116 /* Do any necessary initialization to access arbitrary stack frames.
2117 On the SPARC, this means flushing the register windows. */
2120 expand_builtin_unwind_init (void)
2122 /* Set this so all the registers get saved in our frame; we need to be
2123 able to copy the saved values for any registers from frames we unwind. */
2124 crtl
->saves_all_registers
= 1;
2126 SETUP_FRAME_ADDRESSES ();
2129 /* Map a non-negative number to an eh return data register number; expands
2130 to -1 if no return data register is associated with the input number.
2131 At least the inputs 0 and 1 must be mapped; the target may provide more. */
2134 expand_builtin_eh_return_data_regno (tree exp
)
2136 tree which
= CALL_EXPR_ARG (exp
, 0);
2137 unsigned HOST_WIDE_INT iwhich
;
2139 if (TREE_CODE (which
) != INTEGER_CST
)
2141 error ("argument of %<__builtin_eh_return_regno%> must be constant");
2145 iwhich
= tree_to_uhwi (which
);
2146 iwhich
= EH_RETURN_DATA_REGNO (iwhich
);
2147 if (iwhich
== INVALID_REGNUM
)
2150 #ifdef DWARF_FRAME_REGNUM
2151 iwhich
= DWARF_FRAME_REGNUM (iwhich
);
2153 iwhich
= DBX_REGISTER_NUMBER (iwhich
);
2156 return GEN_INT (iwhich
);
2159 /* Given a value extracted from the return address register or stack slot,
2160 return the actual address encoded in that value. */
2163 expand_builtin_extract_return_addr (tree addr_tree
)
2165 rtx addr
= expand_expr (addr_tree
, NULL_RTX
, Pmode
, EXPAND_NORMAL
);
2167 if (GET_MODE (addr
) != Pmode
2168 && GET_MODE (addr
) != VOIDmode
)
2170 #ifdef POINTERS_EXTEND_UNSIGNED
2171 addr
= convert_memory_address (Pmode
, addr
);
2173 addr
= convert_to_mode (Pmode
, addr
, 0);
2177 /* First mask out any unwanted bits. */
2178 rtx mask
= MASK_RETURN_ADDR
;
2180 expand_and (Pmode
, addr
, mask
, addr
);
2182 /* Then adjust to find the real return address. */
2183 if (RETURN_ADDR_OFFSET
)
2184 addr
= plus_constant (Pmode
, addr
, RETURN_ADDR_OFFSET
);
2189 /* Given an actual address in addr_tree, do any necessary encoding
2190 and return the value to be stored in the return address register or
2191 stack slot so the epilogue will return to that address. */
2194 expand_builtin_frob_return_addr (tree addr_tree
)
2196 rtx addr
= expand_expr (addr_tree
, NULL_RTX
, ptr_mode
, EXPAND_NORMAL
);
2198 addr
= convert_memory_address (Pmode
, addr
);
2200 if (RETURN_ADDR_OFFSET
)
2202 addr
= force_reg (Pmode
, addr
);
2203 addr
= plus_constant (Pmode
, addr
, -RETURN_ADDR_OFFSET
);
2209 /* Set up the epilogue with the magic bits we'll need to return to the
2210 exception handler. */
2213 expand_builtin_eh_return (tree stackadj_tree ATTRIBUTE_UNUSED
,
2218 #ifdef EH_RETURN_STACKADJ_RTX
2219 tmp
= expand_expr (stackadj_tree
, crtl
->eh
.ehr_stackadj
,
2220 VOIDmode
, EXPAND_NORMAL
);
2221 tmp
= convert_memory_address (Pmode
, tmp
);
2222 if (!crtl
->eh
.ehr_stackadj
)
2223 crtl
->eh
.ehr_stackadj
= copy_addr_to_reg (tmp
);
2224 else if (tmp
!= crtl
->eh
.ehr_stackadj
)
2225 emit_move_insn (crtl
->eh
.ehr_stackadj
, tmp
);
2228 tmp
= expand_expr (handler_tree
, crtl
->eh
.ehr_handler
,
2229 VOIDmode
, EXPAND_NORMAL
);
2230 tmp
= convert_memory_address (Pmode
, tmp
);
2231 if (!crtl
->eh
.ehr_handler
)
2232 crtl
->eh
.ehr_handler
= copy_addr_to_reg (tmp
);
2233 else if (tmp
!= crtl
->eh
.ehr_handler
)
2234 emit_move_insn (crtl
->eh
.ehr_handler
, tmp
);
2236 if (!crtl
->eh
.ehr_label
)
2237 crtl
->eh
.ehr_label
= gen_label_rtx ();
2238 emit_jump (crtl
->eh
.ehr_label
);
2241 /* Expand __builtin_eh_return. This exit path from the function loads up
2242 the eh return data registers, adjusts the stack, and branches to a
2243 given PC other than the normal return address. */
2246 expand_eh_return (void)
2248 rtx_code_label
*around_label
;
2250 if (! crtl
->eh
.ehr_label
)
2253 crtl
->calls_eh_return
= 1;
2255 #ifdef EH_RETURN_STACKADJ_RTX
2256 emit_move_insn (EH_RETURN_STACKADJ_RTX
, const0_rtx
);
2259 around_label
= gen_label_rtx ();
2260 emit_jump (around_label
);
2262 emit_label (crtl
->eh
.ehr_label
);
2263 clobber_return_register ();
2265 #ifdef EH_RETURN_STACKADJ_RTX
2266 emit_move_insn (EH_RETURN_STACKADJ_RTX
, crtl
->eh
.ehr_stackadj
);
2269 if (targetm
.have_eh_return ())
2270 emit_insn (targetm
.gen_eh_return (crtl
->eh
.ehr_handler
));
2273 if (rtx handler
= EH_RETURN_HANDLER_RTX
)
2274 emit_move_insn (handler
, crtl
->eh
.ehr_handler
);
2276 error ("__builtin_eh_return not supported on this target");
2279 emit_label (around_label
);
2282 /* Convert a ptr_mode address ADDR_TREE to a Pmode address controlled by
2283 POINTERS_EXTEND_UNSIGNED and return it. */
2286 expand_builtin_extend_pointer (tree addr_tree
)
2288 rtx addr
= expand_expr (addr_tree
, NULL_RTX
, ptr_mode
, EXPAND_NORMAL
);
2291 #ifdef POINTERS_EXTEND_UNSIGNED
2292 extend
= POINTERS_EXTEND_UNSIGNED
;
2294 /* The previous EH code did an unsigned extend by default, so we do this also
2299 return convert_modes (targetm
.unwind_word_mode (), ptr_mode
, addr
, extend
);
2303 add_action_record (action_hash_type
*ar_hash
, int filter
, int next
)
2305 struct action_record
**slot
, *new_ar
, tmp
;
2307 tmp
.filter
= filter
;
2309 slot
= ar_hash
->find_slot (&tmp
, INSERT
);
2311 if ((new_ar
= *slot
) == NULL
)
2313 new_ar
= XNEW (struct action_record
);
2314 new_ar
->offset
= crtl
->eh
.action_record_data
->length () + 1;
2315 new_ar
->filter
= filter
;
2316 new_ar
->next
= next
;
2319 /* The filter value goes in untouched. The link to the next
2320 record is a "self-relative" byte offset, or zero to indicate
2321 that there is no next record. So convert the absolute 1 based
2322 indices we've been carrying around into a displacement. */
2324 push_sleb128 (&crtl
->eh
.action_record_data
, filter
);
2326 next
-= crtl
->eh
.action_record_data
->length () + 1;
2327 push_sleb128 (&crtl
->eh
.action_record_data
, next
);
2330 return new_ar
->offset
;
2334 collect_one_action_chain (action_hash_type
*ar_hash
, eh_region region
)
2338 /* If we've reached the top of the region chain, then we have
2339 no actions, and require no landing pad. */
2343 switch (region
->type
)
2348 /* A cleanup adds a zero filter to the beginning of the chain, but
2349 there are special cases to look out for. If there are *only*
2350 cleanups along a path, then it compresses to a zero action.
2351 Further, if there are multiple cleanups along a path, we only
2352 need to represent one of them, as that is enough to trigger
2353 entry to the landing pad at runtime. */
2354 next
= collect_one_action_chain (ar_hash
, region
->outer
);
2357 for (r
= region
->outer
; r
; r
= r
->outer
)
2358 if (r
->type
== ERT_CLEANUP
)
2360 return add_action_record (ar_hash
, 0, next
);
2367 /* Process the associated catch regions in reverse order.
2368 If there's a catch-all handler, then we don't need to
2369 search outer regions. Use a magic -3 value to record
2370 that we haven't done the outer search. */
2372 for (c
= region
->u
.eh_try
.last_catch
; c
; c
= c
->prev_catch
)
2374 if (c
->type_list
== NULL
)
2376 /* Retrieve the filter from the head of the filter list
2377 where we have stored it (see assign_filter_values). */
2378 int filter
= TREE_INT_CST_LOW (TREE_VALUE (c
->filter_list
));
2379 next
= add_action_record (ar_hash
, filter
, 0);
2383 /* Once the outer search is done, trigger an action record for
2384 each filter we have. */
2389 next
= collect_one_action_chain (ar_hash
, region
->outer
);
2391 /* If there is no next action, terminate the chain. */
2394 /* If all outer actions are cleanups or must_not_throw,
2395 we'll have no action record for it, since we had wanted
2396 to encode these states in the call-site record directly.
2397 Add a cleanup action to the chain to catch these. */
2399 next
= add_action_record (ar_hash
, 0, 0);
2402 flt_node
= c
->filter_list
;
2403 for (; flt_node
; flt_node
= TREE_CHAIN (flt_node
))
2405 int filter
= TREE_INT_CST_LOW (TREE_VALUE (flt_node
));
2406 next
= add_action_record (ar_hash
, filter
, next
);
2413 case ERT_ALLOWED_EXCEPTIONS
:
2414 /* An exception specification adds its filter to the
2415 beginning of the chain. */
2416 next
= collect_one_action_chain (ar_hash
, region
->outer
);
2418 /* If there is no next action, terminate the chain. */
2421 /* If all outer actions are cleanups or must_not_throw,
2422 we'll have no action record for it, since we had wanted
2423 to encode these states in the call-site record directly.
2424 Add a cleanup action to the chain to catch these. */
2426 next
= add_action_record (ar_hash
, 0, 0);
2428 return add_action_record (ar_hash
, region
->u
.allowed
.filter
, next
);
2430 case ERT_MUST_NOT_THROW
:
2431 /* A must-not-throw region with no inner handlers or cleanups
2432 requires no call-site entry. Note that this differs from
2433 the no handler or cleanup case in that we do require an lsda
2434 to be generated. Return a magic -2 value to record this. */
2442 add_call_site (rtx landing_pad
, int action
, int section
)
2444 call_site_record record
;
2446 record
= ggc_alloc
<call_site_record_d
> ();
2447 record
->landing_pad
= landing_pad
;
2448 record
->action
= action
;
2450 vec_safe_push (crtl
->eh
.call_site_record_v
[section
], record
);
2452 return call_site_base
+ crtl
->eh
.call_site_record_v
[section
]->length () - 1;
2456 emit_note_eh_region_end (rtx_insn
*insn
)
2458 rtx_insn
*next
= NEXT_INSN (insn
);
2460 /* Make sure we do not split a call and its corresponding
2461 CALL_ARG_LOCATION note. */
2462 if (next
&& NOTE_P (next
)
2463 && NOTE_KIND (next
) == NOTE_INSN_CALL_ARG_LOCATION
)
2466 return emit_note_after (NOTE_INSN_EH_REGION_END
, insn
);
2469 /* Add NOP after NOTE_INSN_SWITCH_TEXT_SECTIONS when the cold section starts
2471 With landing pad being at offset 0 from the start label of the section
2472 we would miss EH delivery because 0 is special and means no landing pad. */
2475 maybe_add_nop_after_section_switch (void)
2477 if (!crtl
->uses_eh_lsda
2478 || !crtl
->eh
.call_site_record_v
[1])
2480 int n
= vec_safe_length (crtl
->eh
.call_site_record_v
[1]);
2481 hash_set
<rtx_insn
*> visited
;
2483 for (int i
= 0; i
< n
; ++i
)
2485 struct call_site_record_d
*cs
2486 = (*crtl
->eh
.call_site_record_v
[1])[i
];
2487 if (cs
->landing_pad
)
2489 rtx_insn
*insn
= as_a
<rtx_insn
*> (cs
->landing_pad
);
2492 /* Landing pads have LABEL_PRESERVE_P flag set. This check make
2493 sure that we do not walk past landing pad visited earlier
2494 which would result in possible quadratic behaviour. */
2495 if (LABEL_P (insn
) && LABEL_PRESERVE_P (insn
)
2496 && visited
.add (insn
))
2499 /* Conservatively assume that ASM insn may be empty. We have
2500 now way to tell what they contain. */
2501 if (active_insn_p (insn
)
2502 && GET_CODE (PATTERN (insn
)) != ASM_INPUT
2503 && GET_CODE (PATTERN (insn
)) != ASM_OPERANDS
)
2506 /* If we reached the start of hot section, then NOP will be
2508 if (GET_CODE (insn
) == NOTE
2509 && NOTE_KIND (insn
) == NOTE_INSN_SWITCH_TEXT_SECTIONS
)
2511 emit_insn_after (gen_nop (), insn
);
2515 /* We visit only labels from cold section. We should never hit
2516 begining of the insn stream here. */
2517 insn
= PREV_INSN (insn
);
2524 /* Turn REG_EH_REGION notes back into NOTE_INSN_EH_REGION notes.
2525 The new note numbers will not refer to region numbers, but
2526 instead to call site entries. */
2529 convert_to_eh_region_ranges (void)
2534 action_hash_type
ar_hash (31);
2535 int last_action
= -3;
2536 rtx_insn
*last_action_insn
= NULL
;
2537 rtx last_landing_pad
= NULL_RTX
;
2538 rtx_insn
*first_no_action_insn
= NULL
;
2541 rtx_insn
*section_switch_note
= NULL
;
2542 rtx_insn
*first_no_action_insn_before_switch
= NULL
;
2543 rtx_insn
*last_no_action_insn_before_switch
= NULL
;
2544 int saved_call_site_base
= call_site_base
;
2546 vec_alloc (crtl
->eh
.action_record_data
, 64);
2548 for (iter
= get_insns (); iter
; iter
= NEXT_INSN (iter
))
2555 rtx_code_label
*this_landing_pad
;
2558 if (NONJUMP_INSN_P (insn
)
2559 && GET_CODE (PATTERN (insn
)) == SEQUENCE
)
2560 insn
= XVECEXP (PATTERN (insn
), 0, 0);
2562 nothrow
= get_eh_region_and_lp_from_rtx (insn
, ®ion
, &lp
);
2566 this_action
= collect_one_action_chain (&ar_hash
, region
);
2570 /* Existence of catch handlers, or must-not-throw regions
2571 implies that an lsda is needed (even if empty). */
2572 if (this_action
!= -1)
2573 crtl
->uses_eh_lsda
= 1;
2575 /* Delay creation of region notes for no-action regions
2576 until we're sure that an lsda will be required. */
2577 else if (last_action
== -3)
2579 first_no_action_insn
= iter
;
2583 if (this_action
>= 0)
2584 this_landing_pad
= lp
->landing_pad
;
2586 this_landing_pad
= NULL
;
2588 /* Differing actions or landing pads implies a change in call-site
2589 info, which implies some EH_REGION note should be emitted. */
2590 if (last_action
!= this_action
2591 || last_landing_pad
!= this_landing_pad
)
2593 /* If there is a queued no-action region in the other section
2594 with hot/cold partitioning, emit it now. */
2595 if (first_no_action_insn_before_switch
)
2597 gcc_assert (this_action
!= -1
2598 && last_action
== (first_no_action_insn
2600 call_site
= add_call_site (NULL_RTX
, 0, 0);
2601 note
= emit_note_before (NOTE_INSN_EH_REGION_BEG
,
2602 first_no_action_insn_before_switch
);
2603 NOTE_EH_HANDLER (note
) = call_site
;
2605 = emit_note_eh_region_end (last_no_action_insn_before_switch
);
2606 NOTE_EH_HANDLER (note
) = call_site
;
2607 gcc_assert (last_action
!= -3
2608 || (last_action_insn
2609 == last_no_action_insn_before_switch
));
2610 first_no_action_insn_before_switch
= NULL
;
2611 last_no_action_insn_before_switch
= NULL
;
2614 /* If we'd not seen a previous action (-3) or the previous
2615 action was must-not-throw (-2), then we do not need an
2617 if (last_action
>= -1)
2619 /* If we delayed the creation of the begin, do it now. */
2620 if (first_no_action_insn
)
2622 call_site
= add_call_site (NULL_RTX
, 0, cur_sec
);
2623 note
= emit_note_before (NOTE_INSN_EH_REGION_BEG
,
2624 first_no_action_insn
);
2625 NOTE_EH_HANDLER (note
) = call_site
;
2626 first_no_action_insn
= NULL
;
2629 note
= emit_note_eh_region_end (last_action_insn
);
2630 NOTE_EH_HANDLER (note
) = call_site
;
2633 /* If the new action is must-not-throw, then no region notes
2635 if (this_action
>= -1)
2637 call_site
= add_call_site (this_landing_pad
,
2638 this_action
< 0 ? 0 : this_action
,
2640 note
= emit_note_before (NOTE_INSN_EH_REGION_BEG
, iter
);
2641 NOTE_EH_HANDLER (note
) = call_site
;
2644 last_action
= this_action
;
2645 last_landing_pad
= this_landing_pad
;
2647 last_action_insn
= iter
;
2649 else if (NOTE_P (iter
)
2650 && NOTE_KIND (iter
) == NOTE_INSN_SWITCH_TEXT_SECTIONS
)
2652 gcc_assert (section_switch_note
== NULL_RTX
);
2653 gcc_assert (flag_reorder_blocks_and_partition
);
2654 section_switch_note
= iter
;
2655 if (first_no_action_insn
)
2657 first_no_action_insn_before_switch
= first_no_action_insn
;
2658 last_no_action_insn_before_switch
= last_action_insn
;
2659 first_no_action_insn
= NULL
;
2660 gcc_assert (last_action
== -1);
2663 /* Force closing of current EH region before section switch and
2664 opening a new one afterwards. */
2665 else if (last_action
!= -3)
2666 last_landing_pad
= pc_rtx
;
2667 if (crtl
->eh
.call_site_record_v
[cur_sec
])
2668 call_site_base
+= crtl
->eh
.call_site_record_v
[cur_sec
]->length ();
2670 gcc_assert (crtl
->eh
.call_site_record_v
[cur_sec
] == NULL
);
2671 vec_alloc (crtl
->eh
.call_site_record_v
[cur_sec
], 10);
2674 if (last_action
>= -1 && ! first_no_action_insn
)
2676 note
= emit_note_eh_region_end (last_action_insn
);
2677 NOTE_EH_HANDLER (note
) = call_site
;
2680 call_site_base
= saved_call_site_base
;
2687 const pass_data pass_data_convert_to_eh_region_ranges
=
2689 RTL_PASS
, /* type */
2690 "eh_ranges", /* name */
2691 OPTGROUP_NONE
, /* optinfo_flags */
2692 TV_NONE
, /* tv_id */
2693 0, /* properties_required */
2694 0, /* properties_provided */
2695 0, /* properties_destroyed */
2696 0, /* todo_flags_start */
2697 0, /* todo_flags_finish */
2700 class pass_convert_to_eh_region_ranges
: public rtl_opt_pass
2703 pass_convert_to_eh_region_ranges (gcc::context
*ctxt
)
2704 : rtl_opt_pass (pass_data_convert_to_eh_region_ranges
, ctxt
)
2707 /* opt_pass methods: */
2708 virtual bool gate (function
*);
2709 virtual unsigned int execute (function
*)
2711 int ret
= convert_to_eh_region_ranges ();
2712 maybe_add_nop_after_section_switch ();
2716 }; // class pass_convert_to_eh_region_ranges
2719 pass_convert_to_eh_region_ranges::gate (function
*)
2721 /* Nothing to do for SJLJ exceptions or if no regions created. */
2722 if (cfun
->eh
->region_tree
== NULL
)
2724 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
2732 make_pass_convert_to_eh_region_ranges (gcc::context
*ctxt
)
2734 return new pass_convert_to_eh_region_ranges (ctxt
);
2738 push_uleb128 (vec
<uchar
, va_gc
> **data_area
, unsigned int value
)
2742 unsigned char byte
= value
& 0x7f;
2746 vec_safe_push (*data_area
, byte
);
2752 push_sleb128 (vec
<uchar
, va_gc
> **data_area
, int value
)
2759 byte
= value
& 0x7f;
2761 more
= ! ((value
== 0 && (byte
& 0x40) == 0)
2762 || (value
== -1 && (byte
& 0x40) != 0));
2765 vec_safe_push (*data_area
, byte
);
2772 dw2_size_of_call_site_table (int section
)
2774 int n
= vec_safe_length (crtl
->eh
.call_site_record_v
[section
]);
2775 int size
= n
* (4 + 4 + 4);
2778 for (i
= 0; i
< n
; ++i
)
2780 struct call_site_record_d
*cs
=
2781 (*crtl
->eh
.call_site_record_v
[section
])[i
];
2782 size
+= size_of_uleb128 (cs
->action
);
2789 sjlj_size_of_call_site_table (void)
2791 int n
= vec_safe_length (crtl
->eh
.call_site_record_v
[0]);
2795 for (i
= 0; i
< n
; ++i
)
2797 struct call_site_record_d
*cs
=
2798 (*crtl
->eh
.call_site_record_v
[0])[i
];
2799 size
+= size_of_uleb128 (INTVAL (cs
->landing_pad
));
2800 size
+= size_of_uleb128 (cs
->action
);
2807 dw2_output_call_site_table (int cs_format
, int section
)
2809 int n
= vec_safe_length (crtl
->eh
.call_site_record_v
[section
]);
2814 begin
= current_function_func_begin_label
;
2815 else if (first_function_block_is_cold
)
2816 begin
= crtl
->subsections
.hot_section_label
;
2818 begin
= crtl
->subsections
.cold_section_label
;
2820 for (i
= 0; i
< n
; ++i
)
2822 struct call_site_record_d
*cs
= (*crtl
->eh
.call_site_record_v
[section
])[i
];
2823 char reg_start_lab
[32];
2824 char reg_end_lab
[32];
2825 char landing_pad_lab
[32];
2827 ASM_GENERATE_INTERNAL_LABEL (reg_start_lab
, "LEHB", call_site_base
+ i
);
2828 ASM_GENERATE_INTERNAL_LABEL (reg_end_lab
, "LEHE", call_site_base
+ i
);
2830 if (cs
->landing_pad
)
2831 ASM_GENERATE_INTERNAL_LABEL (landing_pad_lab
, "L",
2832 CODE_LABEL_NUMBER (cs
->landing_pad
));
2834 /* ??? Perhaps use insn length scaling if the assembler supports
2835 generic arithmetic. */
2836 /* ??? Perhaps use attr_length to choose data1 or data2 instead of
2837 data4 if the function is small enough. */
2838 if (cs_format
== DW_EH_PE_uleb128
)
2840 dw2_asm_output_delta_uleb128 (reg_start_lab
, begin
,
2841 "region %d start", i
);
2842 dw2_asm_output_delta_uleb128 (reg_end_lab
, reg_start_lab
,
2844 if (cs
->landing_pad
)
2845 dw2_asm_output_delta_uleb128 (landing_pad_lab
, begin
,
2848 dw2_asm_output_data_uleb128 (0, "landing pad");
2852 dw2_asm_output_delta (4, reg_start_lab
, begin
,
2853 "region %d start", i
);
2854 dw2_asm_output_delta (4, reg_end_lab
, reg_start_lab
, "length");
2855 if (cs
->landing_pad
)
2856 dw2_asm_output_delta (4, landing_pad_lab
, begin
,
2859 dw2_asm_output_data (4, 0, "landing pad");
2861 dw2_asm_output_data_uleb128 (cs
->action
, "action");
2864 call_site_base
+= n
;
2868 sjlj_output_call_site_table (void)
2870 int n
= vec_safe_length (crtl
->eh
.call_site_record_v
[0]);
2873 for (i
= 0; i
< n
; ++i
)
2875 struct call_site_record_d
*cs
= (*crtl
->eh
.call_site_record_v
[0])[i
];
2877 dw2_asm_output_data_uleb128 (INTVAL (cs
->landing_pad
),
2878 "region %d landing pad", i
);
2879 dw2_asm_output_data_uleb128 (cs
->action
, "action");
2882 call_site_base
+= n
;
2885 /* Switch to the section that should be used for exception tables. */
2888 switch_to_exception_section (const char * ARG_UNUSED (fnname
))
2892 if (exception_section
)
2893 s
= exception_section
;
2898 if (EH_TABLES_CAN_BE_READ_ONLY
)
2901 ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/0, /*global=*/1);
2902 flags
= ((! flag_pic
2903 || ((tt_format
& 0x70) != DW_EH_PE_absptr
2904 && (tt_format
& 0x70) != DW_EH_PE_aligned
))
2905 ? 0 : SECTION_WRITE
);
2908 flags
= SECTION_WRITE
;
2910 /* Compute the section and cache it into exception_section,
2911 unless it depends on the function name. */
2912 if (targetm_common
.have_named_sections
)
2914 #ifdef HAVE_LD_EH_GC_SECTIONS
2915 if (flag_function_sections
2916 || (DECL_COMDAT_GROUP (current_function_decl
) && HAVE_COMDAT_GROUP
))
2918 char *section_name
= XNEWVEC (char, strlen (fnname
) + 32);
2919 /* The EH table must match the code section, so only mark
2920 it linkonce if we have COMDAT groups to tie them together. */
2921 if (DECL_COMDAT_GROUP (current_function_decl
) && HAVE_COMDAT_GROUP
)
2922 flags
|= SECTION_LINKONCE
;
2923 sprintf (section_name
, ".gcc_except_table.%s", fnname
);
2924 s
= get_section (section_name
, flags
, current_function_decl
);
2925 free (section_name
);
2930 = s
= get_section (".gcc_except_table", flags
, NULL
);
2934 = s
= flags
== SECTION_WRITE
? data_section
: readonly_data_section
;
2937 switch_to_section (s
);
2941 /* Output a reference from an exception table to the type_info object TYPE.
2942 TT_FORMAT and TT_FORMAT_SIZE describe the DWARF encoding method used for
2946 output_ttype (tree type
, int tt_format
, int tt_format_size
)
2949 bool is_public
= true;
2951 if (type
== NULL_TREE
)
2955 /* FIXME lto. pass_ipa_free_lang_data changes all types to
2956 runtime types so TYPE should already be a runtime type
2957 reference. When pass_ipa_free_lang data is made a default
2958 pass, we can then remove the call to lookup_type_for_runtime
2961 type
= lookup_type_for_runtime (type
);
2963 value
= expand_expr (type
, NULL_RTX
, VOIDmode
, EXPAND_INITIALIZER
);
2965 /* Let cgraph know that the rtti decl is used. Not all of the
2966 paths below go through assemble_integer, which would take
2967 care of this for us. */
2969 if (TREE_CODE (type
) == ADDR_EXPR
)
2971 type
= TREE_OPERAND (type
, 0);
2973 is_public
= TREE_PUBLIC (type
);
2976 gcc_assert (TREE_CODE (type
) == INTEGER_CST
);
2979 /* Allow the target to override the type table entry format. */
2980 if (targetm
.asm_out
.ttype (value
))
2983 if (tt_format
== DW_EH_PE_absptr
|| tt_format
== DW_EH_PE_aligned
)
2984 assemble_integer (value
, tt_format_size
,
2985 tt_format_size
* BITS_PER_UNIT
, 1);
2987 dw2_asm_output_encoded_addr_rtx (tt_format
, value
, is_public
, NULL
);
2991 output_one_function_exception_table (int section
)
2993 int tt_format
, cs_format
, lp_format
, i
;
2994 char ttype_label
[32];
2995 char cs_after_size_label
[32];
2996 char cs_end_label
[32];
2999 int tt_format_size
= 0;
3001 have_tt_data
= (vec_safe_length (cfun
->eh
->ttype_data
)
3002 || (targetm
.arm_eabi_unwinder
3003 ? vec_safe_length (cfun
->eh
->ehspec_data
.arm_eabi
)
3004 : vec_safe_length (cfun
->eh
->ehspec_data
.other
)));
3006 /* Indicate the format of the @TType entries. */
3008 tt_format
= DW_EH_PE_omit
;
3011 tt_format
= ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/0, /*global=*/1);
3013 ASM_GENERATE_INTERNAL_LABEL (ttype_label
,
3014 section
? "LLSDATTC" : "LLSDATT",
3015 current_function_funcdef_no
);
3017 tt_format_size
= size_of_encoded_value (tt_format
);
3019 assemble_align (tt_format_size
* BITS_PER_UNIT
);
3022 targetm
.asm_out
.internal_label (asm_out_file
, section
? "LLSDAC" : "LLSDA",
3023 current_function_funcdef_no
);
3025 /* The LSDA header. */
3027 /* Indicate the format of the landing pad start pointer. An omitted
3028 field implies @LPStart == @Start. */
3029 /* Currently we always put @LPStart == @Start. This field would
3030 be most useful in moving the landing pads completely out of
3031 line to another section, but it could also be used to minimize
3032 the size of uleb128 landing pad offsets. */
3033 lp_format
= DW_EH_PE_omit
;
3034 dw2_asm_output_data (1, lp_format
, "@LPStart format (%s)",
3035 eh_data_format_name (lp_format
));
3037 /* @LPStart pointer would go here. */
3039 dw2_asm_output_data (1, tt_format
, "@TType format (%s)",
3040 eh_data_format_name (tt_format
));
3042 if (!HAVE_AS_LEB128
)
3044 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
3045 call_site_len
= sjlj_size_of_call_site_table ();
3047 call_site_len
= dw2_size_of_call_site_table (section
);
3050 /* A pc-relative 4-byte displacement to the @TType data. */
3055 char ttype_after_disp_label
[32];
3056 ASM_GENERATE_INTERNAL_LABEL (ttype_after_disp_label
,
3057 section
? "LLSDATTDC" : "LLSDATTD",
3058 current_function_funcdef_no
);
3059 dw2_asm_output_delta_uleb128 (ttype_label
, ttype_after_disp_label
,
3060 "@TType base offset");
3061 ASM_OUTPUT_LABEL (asm_out_file
, ttype_after_disp_label
);
3065 /* Ug. Alignment queers things. */
3066 unsigned int before_disp
, after_disp
, last_disp
, disp
;
3068 before_disp
= 1 + 1;
3069 after_disp
= (1 + size_of_uleb128 (call_site_len
)
3071 + vec_safe_length (crtl
->eh
.action_record_data
)
3072 + (vec_safe_length (cfun
->eh
->ttype_data
)
3078 unsigned int disp_size
, pad
;
3081 disp_size
= size_of_uleb128 (disp
);
3082 pad
= before_disp
+ disp_size
+ after_disp
;
3083 if (pad
% tt_format_size
)
3084 pad
= tt_format_size
- (pad
% tt_format_size
);
3087 disp
= after_disp
+ pad
;
3089 while (disp
!= last_disp
);
3091 dw2_asm_output_data_uleb128 (disp
, "@TType base offset");
3095 /* Indicate the format of the call-site offsets. */
3097 cs_format
= DW_EH_PE_uleb128
;
3099 cs_format
= DW_EH_PE_udata4
;
3101 dw2_asm_output_data (1, cs_format
, "call-site format (%s)",
3102 eh_data_format_name (cs_format
));
3106 ASM_GENERATE_INTERNAL_LABEL (cs_after_size_label
,
3107 section
? "LLSDACSBC" : "LLSDACSB",
3108 current_function_funcdef_no
);
3109 ASM_GENERATE_INTERNAL_LABEL (cs_end_label
,
3110 section
? "LLSDACSEC" : "LLSDACSE",
3111 current_function_funcdef_no
);
3112 dw2_asm_output_delta_uleb128 (cs_end_label
, cs_after_size_label
,
3113 "Call-site table length");
3114 ASM_OUTPUT_LABEL (asm_out_file
, cs_after_size_label
);
3115 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
3116 sjlj_output_call_site_table ();
3118 dw2_output_call_site_table (cs_format
, section
);
3119 ASM_OUTPUT_LABEL (asm_out_file
, cs_end_label
);
3123 dw2_asm_output_data_uleb128 (call_site_len
, "Call-site table length");
3124 if (targetm_common
.except_unwind_info (&global_options
) == UI_SJLJ
)
3125 sjlj_output_call_site_table ();
3127 dw2_output_call_site_table (cs_format
, section
);
3130 /* ??? Decode and interpret the data for flag_debug_asm. */
3133 FOR_EACH_VEC_ELT (*crtl
->eh
.action_record_data
, i
, uc
)
3134 dw2_asm_output_data (1, uc
, i
? NULL
: "Action record table");
3138 assemble_align (tt_format_size
* BITS_PER_UNIT
);
3140 i
= vec_safe_length (cfun
->eh
->ttype_data
);
3143 tree type
= (*cfun
->eh
->ttype_data
)[i
];
3144 output_ttype (type
, tt_format
, tt_format_size
);
3147 if (HAVE_AS_LEB128
&& have_tt_data
)
3148 ASM_OUTPUT_LABEL (asm_out_file
, ttype_label
);
3150 /* ??? Decode and interpret the data for flag_debug_asm. */
3151 if (targetm
.arm_eabi_unwinder
)
3155 vec_safe_iterate (cfun
->eh
->ehspec_data
.arm_eabi
, i
, &type
); ++i
)
3156 output_ttype (type
, tt_format
, tt_format_size
);
3162 vec_safe_iterate (cfun
->eh
->ehspec_data
.other
, i
, &uc
); ++i
)
3163 dw2_asm_output_data (1, uc
,
3164 i
? NULL
: "Exception specification table");
3169 output_function_exception_table (const char *fnname
)
3171 rtx personality
= get_personality_function (current_function_decl
);
3173 /* Not all functions need anything. */
3174 if (! crtl
->uses_eh_lsda
)
3179 assemble_external_libcall (personality
);
3181 if (targetm
.asm_out
.emit_except_personality
)
3182 targetm
.asm_out
.emit_except_personality (personality
);
3185 switch_to_exception_section (fnname
);
3187 /* If the target wants a label to begin the table, emit it here. */
3188 targetm
.asm_out
.emit_except_table_label (asm_out_file
);
3190 output_one_function_exception_table (0);
3191 if (crtl
->eh
.call_site_record_v
[1])
3192 output_one_function_exception_table (1);
3194 switch_to_section (current_function_section ());
3198 set_eh_throw_stmt_table (function
*fun
, hash_map
<gimple
*, int> *table
)
3200 fun
->eh
->throw_stmt_table
= table
;
3203 hash_map
<gimple
*, int> *
3204 get_eh_throw_stmt_table (struct function
*fun
)
3206 return fun
->eh
->throw_stmt_table
;
3209 /* Determine if the function needs an EH personality function. */
3211 enum eh_personality_kind
3212 function_needs_eh_personality (struct function
*fn
)
3214 enum eh_personality_kind kind
= eh_personality_none
;
3217 FOR_ALL_EH_REGION_FN (i
, fn
)
3222 /* Can do with any personality including the generic C one. */
3223 kind
= eh_personality_any
;
3227 case ERT_ALLOWED_EXCEPTIONS
:
3228 /* Always needs a EH personality function. The generic C
3229 personality doesn't handle these even for empty type lists. */
3230 return eh_personality_lang
;
3232 case ERT_MUST_NOT_THROW
:
3233 /* Always needs a EH personality function. The language may specify
3234 what abort routine that must be used, e.g. std::terminate. */
3235 return eh_personality_lang
;
3242 /* Dump EH information to OUT. */
3245 dump_eh_tree (FILE * out
, struct function
*fun
)
3249 static const char *const type_name
[] = {
3250 "cleanup", "try", "allowed_exceptions", "must_not_throw"
3253 i
= fun
->eh
->region_tree
;
3257 fprintf (out
, "Eh tree:\n");
3260 fprintf (out
, " %*s %i %s", depth
* 2, "",
3261 i
->index
, type_name
[(int) i
->type
]);
3263 if (i
->landing_pads
)
3267 fprintf (out
, " land:");
3268 if (current_ir_type () == IR_GIMPLE
)
3270 for (lp
= i
->landing_pads
; lp
; lp
= lp
->next_lp
)
3272 fprintf (out
, "{%i,", lp
->index
);
3273 print_generic_expr (out
, lp
->post_landing_pad
);
3281 for (lp
= i
->landing_pads
; lp
; lp
= lp
->next_lp
)
3283 fprintf (out
, "{%i,", lp
->index
);
3284 if (lp
->landing_pad
)
3285 fprintf (out
, "%i%s,", INSN_UID (lp
->landing_pad
),
3286 NOTE_P (lp
->landing_pad
) ? "(del)" : "");
3288 fprintf (out
, "(nil),");
3289 if (lp
->post_landing_pad
)
3291 rtx_insn
*lab
= label_rtx (lp
->post_landing_pad
);
3292 fprintf (out
, "%i%s}", INSN_UID (lab
),
3293 NOTE_P (lab
) ? "(del)" : "");
3296 fprintf (out
, "(nil)}");
3306 case ERT_MUST_NOT_THROW
:
3312 fprintf (out
, " catch:");
3313 for (c
= i
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
3318 fprintf (out
, "lab:");
3319 print_generic_expr (out
, c
->label
);
3322 print_generic_expr (out
, c
->type_list
);
3330 case ERT_ALLOWED_EXCEPTIONS
:
3331 fprintf (out
, " filter :%i types:", i
->u
.allowed
.filter
);
3332 print_generic_expr (out
, i
->u
.allowed
.type_list
);
3337 /* If there are sub-regions, process them. */
3339 i
= i
->inner
, depth
++;
3340 /* If there are peers, process them. */
3341 else if (i
->next_peer
)
3343 /* Otherwise, step back up the tree to the next peer. */
3353 while (i
->next_peer
== NULL
);
3359 /* Dump the EH tree for FN on stderr. */
3362 debug_eh_tree (struct function
*fn
)
3364 dump_eh_tree (stderr
, fn
);
3367 /* Verify invariants on EH datastructures. */
3370 verify_eh_tree (struct function
*fun
)
3373 int nvisited_lp
, nvisited_r
;
3374 int count_lp
, count_r
, depth
, i
;
3378 if (!fun
->eh
->region_tree
)
3382 for (i
= 1; vec_safe_iterate (fun
->eh
->region_array
, i
, &r
); ++i
)
3389 error ("region_array is corrupted for region %i", r
->index
);
3395 for (i
= 1; vec_safe_iterate (fun
->eh
->lp_array
, i
, &lp
); ++i
)
3402 error ("lp_array is corrupted for lp %i", lp
->index
);
3407 depth
= nvisited_lp
= nvisited_r
= 0;
3409 r
= fun
->eh
->region_tree
;
3412 if ((*fun
->eh
->region_array
)[r
->index
] != r
)
3414 error ("region_array is corrupted for region %i", r
->index
);
3417 if (r
->outer
!= outer
)
3419 error ("outer block of region %i is wrong", r
->index
);
3424 error ("negative nesting depth of region %i", r
->index
);
3429 for (lp
= r
->landing_pads
; lp
; lp
= lp
->next_lp
)
3431 if ((*fun
->eh
->lp_array
)[lp
->index
] != lp
)
3433 error ("lp_array is corrupted for lp %i", lp
->index
);
3436 if (lp
->region
!= r
)
3438 error ("region of lp %i is wrong", lp
->index
);
3445 outer
= r
, r
= r
->inner
, depth
++;
3446 else if (r
->next_peer
)
3458 while (r
->next_peer
== NULL
);
3465 error ("tree list ends on depth %i", depth
);
3468 if (count_r
!= nvisited_r
)
3470 error ("region_array does not match region_tree");
3473 if (count_lp
!= nvisited_lp
)
3475 error ("lp_array does not match region_tree");
3481 dump_eh_tree (stderr
, fun
);
3482 internal_error ("verify_eh_tree failed");
3486 #include "gt-except.h"