1 /* Implements exception handling.
2 Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001 Free Software Foundation, Inc.
4 Contributed by Mike Stump <mrs@cygnus.com>.
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* An exception is an event that can be signaled from within a
25 function. This event can then be "caught" or "trapped" by the
26 callers of this function. This potentially allows program flow to
27 be transferred to any arbitrary code associated with a function call
28 several levels up the stack.
30 The intended use for this mechanism is for signaling "exceptional
31 events" in an out-of-band fashion, hence its name. The C++ language
32 (and many other OO-styled or functional languages) practically
33 requires such a mechanism, as otherwise it becomes very difficult
34 or even impossible to signal failure conditions in complex
35 situations. The traditional C++ example is when an error occurs in
36 the process of constructing an object; without such a mechanism, it
37 is impossible to signal that the error occurs without adding global
38 state variables and error checks around every object construction.
40 The act of causing this event to occur is referred to as "throwing
41 an exception". (Alternate terms include "raising an exception" or
42 "signaling an exception".) The term "throw" is used because control
43 is returned to the callers of the function that is signaling the
44 exception, and thus there is the concept of "throwing" the
45 exception up the call stack.
47 [ Add updated documentation on how to use this. ] */
57 #include "insn-config.h"
59 #include "integrate.h"
60 #include "hard-reg-set.h"
61 #include "basic-block.h"
63 #include "dwarf2asm.h"
64 #include "dwarf2out.h"
72 /* Provide defaults for stuff that may not be defined when using
74 #ifndef EH_RETURN_STACKADJ_RTX
75 #define EH_RETURN_STACKADJ_RTX 0
77 #ifndef EH_RETURN_HANDLER_RTX
78 #define EH_RETURN_HANDLER_RTX 0
80 #ifndef EH_RETURN_DATA_REGNO
81 #define EH_RETURN_DATA_REGNO(N) INVALID_REGNUM
85 /* Nonzero means enable synchronous exceptions for non-call instructions. */
86 int flag_non_call_exceptions;
88 /* Protect cleanup actions with must-not-throw regions, with a call
89 to the given failure handler. */
90 tree protect_cleanup_actions;
92 /* Return true if type A catches type B. */
93 int (*lang_eh_type_covers) PARAMS ((tree a, tree b));
95 /* Map a type to a runtime object to match type. */
96 tree (*lang_eh_runtime_type) PARAMS ((tree));
98 /* A list of labels used for exception handlers. */
99 rtx exception_handler_labels;
101 static int call_site_base;
102 static int sjlj_funcdef_number;
103 static htab_t type_to_runtime_map;
105 /* Describe the SjLj_Function_Context structure. */
106 static tree sjlj_fc_type_node;
107 static int sjlj_fc_call_site_ofs;
108 static int sjlj_fc_data_ofs;
109 static int sjlj_fc_personality_ofs;
110 static int sjlj_fc_lsda_ofs;
111 static int sjlj_fc_jbuf_ofs;
113 /* Describes one exception region. */
116 /* The immediately surrounding region. */
117 struct eh_region *outer;
119 /* The list of immediately contained regions. */
120 struct eh_region *inner;
121 struct eh_region *next_peer;
123 /* An identifier for this region. */
126 /* Each region does exactly one thing. */
132 ERT_ALLOWED_EXCEPTIONS,
138 /* Holds the action to perform based on the preceeding type. */
140 /* A list of catch blocks, a surrounding try block,
141 and the label for continuing after a catch. */
143 struct eh_region *catch;
144 struct eh_region *last_catch;
145 struct eh_region *prev_try;
149 /* The list through the catch handlers, the type object
150 matched, and a pointer to the generated code. */
152 struct eh_region *next_catch;
153 struct eh_region *prev_catch;
158 /* A tree_list of allowed types. */
164 /* The type given by a call to "throw foo();", or discovered
170 /* Retain the cleanup expression even after expansion so that
171 we can match up fixup regions. */
176 /* The real region (by expression and by pointer) that fixup code
180 struct eh_region *real_region;
184 /* Entry point for this region's handler before landing pads are built. */
187 /* Entry point for this region's handler from the runtime eh library. */
190 /* Entry point for this region's handler from an inner region. */
191 rtx post_landing_pad;
193 /* The RESX insn for handing off control to the next outermost handler,
198 /* Used to save exception status for each function. */
201 /* The tree of all regions for this function. */
202 struct eh_region *region_tree;
204 /* The same information as an indexable array. */
205 struct eh_region **region_array;
207 /* The most recently open region. */
208 struct eh_region *cur_region;
210 /* This is the region for which we are processing catch blocks. */
211 struct eh_region *try_region;
213 /* A stack (TREE_LIST) of lists of handlers. The TREE_VALUE of each
214 node is itself a TREE_CHAINed list of handlers for regions that
215 are not yet closed. The TREE_VALUE of each entry contains the
216 handler for the corresponding entry on the ehstack. */
222 int built_landing_pads;
223 int last_region_number;
225 varray_type ttype_data;
226 varray_type ehspec_data;
227 varray_type action_record_data;
229 struct call_site_record
234 int call_site_data_used;
235 int call_site_data_size;
246 static void mark_eh_region PARAMS ((struct eh_region *));
248 static int t2r_eq PARAMS ((const PTR,
250 static hashval_t t2r_hash PARAMS ((const PTR));
251 static int t2r_mark_1 PARAMS ((PTR *, PTR));
252 static void t2r_mark PARAMS ((PTR));
253 static void add_type_for_runtime PARAMS ((tree));
254 static tree lookup_type_for_runtime PARAMS ((tree));
256 static struct eh_region *expand_eh_region_end PARAMS ((void));
258 static rtx get_exception_filter PARAMS ((void));
260 static void collect_eh_region_array PARAMS ((void));
261 static void resolve_fixup_regions PARAMS ((void));
262 static void remove_fixup_regions PARAMS ((void));
263 static void convert_from_eh_region_ranges_1 PARAMS ((rtx *, int *, int));
265 static struct eh_region *duplicate_eh_region_1 PARAMS ((struct eh_region *,
266 struct inline_remap *));
267 static void duplicate_eh_region_2 PARAMS ((struct eh_region *,
268 struct eh_region **));
269 static int ttypes_filter_eq PARAMS ((const PTR,
271 static hashval_t ttypes_filter_hash PARAMS ((const PTR));
272 static int ehspec_filter_eq PARAMS ((const PTR,
274 static hashval_t ehspec_filter_hash PARAMS ((const PTR));
275 static int add_ttypes_entry PARAMS ((htab_t, tree));
276 static int add_ehspec_entry PARAMS ((htab_t, htab_t,
278 static void assign_filter_values PARAMS ((void));
279 static void build_post_landing_pads PARAMS ((void));
280 static void connect_post_landing_pads PARAMS ((void));
281 static void dw2_build_landing_pads PARAMS ((void));
284 static bool sjlj_find_directly_reachable_regions
285 PARAMS ((struct sjlj_lp_info *));
286 static void sjlj_assign_call_site_values
287 PARAMS ((rtx, struct sjlj_lp_info *));
288 static void sjlj_mark_call_sites
289 PARAMS ((struct sjlj_lp_info *));
290 static void sjlj_emit_function_enter PARAMS ((rtx));
291 static void sjlj_emit_function_exit PARAMS ((void));
292 static void sjlj_emit_dispatch_table
293 PARAMS ((rtx, struct sjlj_lp_info *));
294 static void sjlj_build_landing_pads PARAMS ((void));
296 static void remove_exception_handler_label PARAMS ((rtx));
297 static void remove_eh_handler PARAMS ((struct eh_region *));
299 struct reachable_info;
301 /* The return value of reachable_next_level. */
304 /* The given exception is not processed by the given region. */
306 /* The given exception may need processing by the given region. */
308 /* The given exception is completely processed by the given region. */
310 /* The given exception is completely processed by the runtime. */
314 static int check_handled PARAMS ((tree, tree));
315 static void add_reachable_handler
316 PARAMS ((struct reachable_info *, struct eh_region *,
317 struct eh_region *));
318 static enum reachable_code reachable_next_level
319 PARAMS ((struct eh_region *, tree, struct reachable_info *));
321 static int action_record_eq PARAMS ((const PTR,
323 static hashval_t action_record_hash PARAMS ((const PTR));
324 static int add_action_record PARAMS ((htab_t, int, int));
325 static int collect_one_action_chain PARAMS ((htab_t,
326 struct eh_region *));
327 static int add_call_site PARAMS ((rtx, int));
329 static void push_uleb128 PARAMS ((varray_type *,
331 static void push_sleb128 PARAMS ((varray_type *, int));
332 static const char *eh_data_format_name PARAMS ((int));
333 #ifndef HAVE_AS_LEB128
334 static int dw2_size_of_call_site_table PARAMS ((void));
335 static int sjlj_size_of_call_site_table PARAMS ((void));
337 static void dw2_output_call_site_table PARAMS ((void));
338 static void sjlj_output_call_site_table PARAMS ((void));
341 /* Routine to see if exception handling is turned on.
342 DO_WARN is non-zero if we want to inform the user that exception
343 handling is turned off.
345 This is used to ensure that -fexceptions has been specified if the
346 compiler tries to use any exception-specific functions. */
352 if (! flag_exceptions)
354 static int warned = 0;
355 if (! warned && do_warn)
357 error ("exception handling disabled, use -fexceptions to enable");
369 ggc_add_rtx_root (&exception_handler_labels, 1);
370 ggc_add_tree_root (&protect_cleanup_actions, 1);
372 if (! flag_exceptions)
375 type_to_runtime_map = htab_create (31, t2r_hash, t2r_eq, NULL);
376 ggc_add_root (&type_to_runtime_map, 1, sizeof (htab_t), t2r_mark);
378 /* Create the SjLj_Function_Context structure. This should match
379 the definition in unwind-sjlj.c. */
380 if (USING_SJLJ_EXCEPTIONS)
382 tree f_jbuf, f_per, f_lsda, f_prev, f_cs, f_data, tmp;
384 sjlj_fc_type_node = make_lang_type (RECORD_TYPE);
385 ggc_add_tree_root (&sjlj_fc_type_node, 1);
387 f_prev = build_decl (FIELD_DECL, get_identifier ("__prev"),
388 build_pointer_type (sjlj_fc_type_node));
389 DECL_FIELD_CONTEXT (f_prev) = sjlj_fc_type_node;
391 f_cs = build_decl (FIELD_DECL, get_identifier ("__call_site"),
393 DECL_FIELD_CONTEXT (f_cs) = sjlj_fc_type_node;
395 tmp = build_index_type (build_int_2 (4 - 1, 0));
396 tmp = build_array_type (type_for_mode (word_mode, 1), tmp);
397 f_data = build_decl (FIELD_DECL, get_identifier ("__data"), tmp);
398 DECL_FIELD_CONTEXT (f_data) = sjlj_fc_type_node;
400 f_per = build_decl (FIELD_DECL, get_identifier ("__personality"),
402 DECL_FIELD_CONTEXT (f_per) = sjlj_fc_type_node;
404 f_lsda = build_decl (FIELD_DECL, get_identifier ("__lsda"),
406 DECL_FIELD_CONTEXT (f_lsda) = sjlj_fc_type_node;
408 #ifdef DONT_USE_BUILTIN_SETJMP
410 tmp = build_int_2 (JMP_BUF_SIZE - 1, 0);
412 /* Should be large enough for most systems, if it is not,
413 JMP_BUF_SIZE should be defined with the proper value. It will
414 also tend to be larger than necessary for most systems, a more
415 optimal port will define JMP_BUF_SIZE. */
416 tmp = build_int_2 (FIRST_PSEUDO_REGISTER + 2 - 1, 0);
419 /* This is 2 for builtin_setjmp, plus whatever the target requires
420 via STACK_SAVEAREA_MODE (SAVE_NONLOCAL). */
421 tmp = build_int_2 ((GET_MODE_SIZE (STACK_SAVEAREA_MODE (SAVE_NONLOCAL))
422 / GET_MODE_SIZE (Pmode)) + 2 - 1, 0);
424 tmp = build_index_type (tmp);
425 tmp = build_array_type (ptr_type_node, tmp);
426 f_jbuf = build_decl (FIELD_DECL, get_identifier ("__jbuf"), tmp);
427 #ifdef DONT_USE_BUILTIN_SETJMP
428 /* We don't know what the alignment requirements of the
429 runtime's jmp_buf has. Overestimate. */
430 DECL_ALIGN (f_jbuf) = BIGGEST_ALIGNMENT;
431 DECL_USER_ALIGN (f_jbuf) = 1;
433 DECL_FIELD_CONTEXT (f_jbuf) = sjlj_fc_type_node;
435 TYPE_FIELDS (sjlj_fc_type_node) = f_prev;
436 TREE_CHAIN (f_prev) = f_cs;
437 TREE_CHAIN (f_cs) = f_data;
438 TREE_CHAIN (f_data) = f_per;
439 TREE_CHAIN (f_per) = f_lsda;
440 TREE_CHAIN (f_lsda) = f_jbuf;
442 layout_type (sjlj_fc_type_node);
444 /* Cache the interesting field offsets so that we have
445 easy access from rtl. */
446 sjlj_fc_call_site_ofs
447 = (tree_low_cst (DECL_FIELD_OFFSET (f_cs), 1)
448 + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_cs), 1) / BITS_PER_UNIT);
450 = (tree_low_cst (DECL_FIELD_OFFSET (f_data), 1)
451 + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_data), 1) / BITS_PER_UNIT);
452 sjlj_fc_personality_ofs
453 = (tree_low_cst (DECL_FIELD_OFFSET (f_per), 1)
454 + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_per), 1) / BITS_PER_UNIT);
456 = (tree_low_cst (DECL_FIELD_OFFSET (f_lsda), 1)
457 + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_lsda), 1) / BITS_PER_UNIT);
459 = (tree_low_cst (DECL_FIELD_OFFSET (f_jbuf), 1)
460 + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_jbuf), 1) / BITS_PER_UNIT);
465 init_eh_for_function ()
467 cfun->eh = (struct eh_status *) xcalloc (1, sizeof (struct eh_status));
470 /* Mark EH for GC. */
473 mark_eh_region (region)
474 struct eh_region *region;
479 switch (region->type)
482 ggc_mark_tree (region->u.cleanup.exp);
485 ggc_mark_rtx (region->u.try.continue_label);
488 ggc_mark_tree (region->u.catch.type);
490 case ERT_ALLOWED_EXCEPTIONS:
491 ggc_mark_tree (region->u.allowed.type_list);
493 case ERT_MUST_NOT_THROW:
496 ggc_mark_tree (region->u.throw.type);
499 ggc_mark_tree (region->u.fixup.cleanup_exp);
505 ggc_mark_rtx (region->label);
506 ggc_mark_rtx (region->resume);
507 ggc_mark_rtx (region->landing_pad);
508 ggc_mark_rtx (region->post_landing_pad);
513 struct eh_status *eh;
520 /* If we've called collect_eh_region_array, use it. Otherwise walk
521 the tree non-recursively. */
522 if (eh->region_array)
524 for (i = eh->last_region_number; i > 0; --i)
526 struct eh_region *r = eh->region_array[i];
527 if (r && r->region_number == i)
531 else if (eh->region_tree)
533 struct eh_region *r = eh->region_tree;
539 else if (r->next_peer)
547 } while (r->next_peer == NULL);
554 ggc_mark_tree (eh->protect_list);
555 ggc_mark_rtx (eh->filter);
556 ggc_mark_rtx (eh->exc_ptr);
557 ggc_mark_tree_varray (eh->ttype_data);
559 if (eh->call_site_data)
561 for (i = eh->call_site_data_used - 1; i >= 0; --i)
562 ggc_mark_rtx (eh->call_site_data[i].landing_pad);
565 ggc_mark_rtx (eh->ehr_stackadj);
566 ggc_mark_rtx (eh->ehr_handler);
567 ggc_mark_rtx (eh->ehr_label);
569 ggc_mark_rtx (eh->sjlj_fc);
570 ggc_mark_rtx (eh->sjlj_exit_after);
577 struct eh_status *eh = f->eh;
579 if (eh->region_array)
582 for (i = eh->last_region_number; i > 0; --i)
584 struct eh_region *r = eh->region_array[i];
585 /* Mind we don't free a region struct more than once. */
586 if (r && r->region_number == i)
589 free (eh->region_array);
591 else if (eh->region_tree)
593 struct eh_region *next, *r = eh->region_tree;
598 else if (r->next_peer)
612 } while (r->next_peer == NULL);
621 VARRAY_FREE (eh->ttype_data);
622 VARRAY_FREE (eh->ehspec_data);
623 VARRAY_FREE (eh->action_record_data);
624 if (eh->call_site_data)
625 free (eh->call_site_data);
632 /* Start an exception handling region. All instructions emitted
633 after this point are considered to be part of the region until
634 expand_eh_region_end is invoked. */
637 expand_eh_region_start ()
639 struct eh_region *new_region;
640 struct eh_region *cur_region;
646 /* We need a new block to record the start and end of the dynamic
647 handler chain. We also want to prevent jumping into a try block. */
648 expand_start_bindings (2);
650 /* But we don't need or want a new temporary level. */
653 /* Mark this block as created by expand_eh_region_start. This is so
654 that we can pop the block with expand_end_bindings automatically. */
655 mark_block_as_eh_region ();
657 /* Insert a new blank region as a leaf in the tree. */
658 new_region = (struct eh_region *) xcalloc (1, sizeof (*new_region));
659 cur_region = cfun->eh->cur_region;
660 new_region->outer = cur_region;
663 new_region->next_peer = cur_region->inner;
664 cur_region->inner = new_region;
668 new_region->next_peer = cfun->eh->region_tree;
669 cfun->eh->region_tree = new_region;
671 cfun->eh->cur_region = new_region;
673 /* Create a note marking the start of this region. */
674 new_region->region_number = ++cfun->eh->last_region_number;
675 note = emit_note (NULL_PTR, NOTE_INSN_EH_REGION_BEG);
676 NOTE_EH_HANDLER (note) = new_region->region_number;
679 /* Common code to end a region. Returns the region just ended. */
681 static struct eh_region *
682 expand_eh_region_end ()
684 struct eh_region *cur_region = cfun->eh->cur_region;
687 /* Create a nute marking the end of this region. */
688 note = emit_note (NULL_PTR, NOTE_INSN_EH_REGION_END);
689 NOTE_EH_HANDLER (note) = cur_region->region_number;
692 cfun->eh->cur_region = cur_region->outer;
694 /* If we have already started ending the bindings, don't recurse. */
697 /* Because we don't need or want a new temporary level and
698 because we didn't create one in expand_eh_region_start,
699 create a fake one now to avoid removing one in
700 expand_end_bindings. */
703 mark_block_as_not_eh_region ();
705 expand_end_bindings (NULL_TREE, 0, 0);
711 /* End an exception handling region for a cleanup. HANDLER is an
712 expression to expand for the cleanup. */
715 expand_eh_region_end_cleanup (handler)
718 struct eh_region *region;
725 region = expand_eh_region_end ();
726 region->type = ERT_CLEANUP;
727 region->label = gen_label_rtx ();
728 region->u.cleanup.exp = handler;
730 around_label = gen_label_rtx ();
731 emit_jump (around_label);
733 emit_label (region->label);
735 if (protect_cleanup_actions)
736 expand_eh_region_start ();
738 /* In case this cleanup involves an inline destructor with a try block in
739 it, we need to save the EH return data registers around it. */
740 data_save[0] = gen_reg_rtx (Pmode);
741 emit_move_insn (data_save[0], get_exception_pointer ());
742 data_save[1] = gen_reg_rtx (Pmode);
743 emit_move_insn (data_save[1], get_exception_filter ());
745 expand_expr (handler, const0_rtx, VOIDmode, 0);
747 emit_move_insn (cfun->eh->exc_ptr, data_save[0]);
748 emit_move_insn (cfun->eh->filter, data_save[1]);
750 if (protect_cleanup_actions)
751 expand_eh_region_end_must_not_throw (protect_cleanup_actions);
753 /* We need any stack adjustment complete before the around_label. */
754 do_pending_stack_adjust ();
756 /* We delay the generation of the _Unwind_Resume until we generate
757 landing pads. We emit a marker here so as to get good control
758 flow data in the meantime. */
760 = emit_jump_insn (gen_rtx_RESX (VOIDmode, region->region_number));
763 emit_label (around_label);
766 /* End an exception handling region for a try block, and prepares
767 for subsequent calls to expand_start_catch. */
770 expand_start_all_catch ()
772 struct eh_region *region;
777 region = expand_eh_region_end ();
778 region->type = ERT_TRY;
779 region->u.try.prev_try = cfun->eh->try_region;
780 region->u.try.continue_label = gen_label_rtx ();
782 cfun->eh->try_region = region;
784 emit_jump (region->u.try.continue_label);
787 /* Begin a catch clause. TYPE is the type caught, or null if this is
788 a catch-all clause. */
791 expand_start_catch (type)
794 struct eh_region *t, *c, *l;
800 add_type_for_runtime (type);
801 expand_eh_region_start ();
803 t = cfun->eh->try_region;
804 c = cfun->eh->cur_region;
806 c->u.catch.type = type;
807 c->label = gen_label_rtx ();
809 l = t->u.try.last_catch;
810 c->u.catch.prev_catch = l;
812 l->u.catch.next_catch = c;
815 t->u.try.last_catch = c;
817 emit_label (c->label);
820 /* End a catch clause. Control will resume after the try/catch block. */
825 struct eh_region *try_region, *catch_region;
830 catch_region = expand_eh_region_end ();
831 try_region = cfun->eh->try_region;
833 emit_jump (try_region->u.try.continue_label);
836 /* End a sequence of catch handlers for a try block. */
839 expand_end_all_catch ()
841 struct eh_region *try_region;
846 try_region = cfun->eh->try_region;
847 cfun->eh->try_region = try_region->u.try.prev_try;
849 emit_label (try_region->u.try.continue_label);
852 /* End an exception region for an exception type filter. ALLOWED is a
853 TREE_LIST of types to be matched by the runtime. FAILURE is an
854 expression to invoke if a mismatch ocurrs. */
857 expand_eh_region_end_allowed (allowed, failure)
858 tree allowed, failure;
860 struct eh_region *region;
866 region = expand_eh_region_end ();
867 region->type = ERT_ALLOWED_EXCEPTIONS;
868 region->u.allowed.type_list = allowed;
869 region->label = gen_label_rtx ();
871 for (; allowed ; allowed = TREE_CHAIN (allowed))
872 add_type_for_runtime (TREE_VALUE (allowed));
874 /* We must emit the call to FAILURE here, so that if this function
875 throws a different exception, that it will be processed by the
878 around_label = gen_label_rtx ();
879 emit_jump (around_label);
881 emit_label (region->label);
882 expand_expr (failure, const0_rtx, VOIDmode, EXPAND_NORMAL);
884 emit_label (around_label);
887 /* End an exception region for a must-not-throw filter. FAILURE is an
888 expression invoke if an uncaught exception propagates this far.
890 This is conceptually identical to expand_eh_region_end_allowed with
891 an empty allowed list (if you passed "std::terminate" instead of
892 "__cxa_call_unexpected"), but they are represented differently in
896 expand_eh_region_end_must_not_throw (failure)
899 struct eh_region *region;
905 region = expand_eh_region_end ();
906 region->type = ERT_MUST_NOT_THROW;
907 region->label = gen_label_rtx ();
909 /* We must emit the call to FAILURE here, so that if this function
910 throws a different exception, that it will be processed by the
913 around_label = gen_label_rtx ();
914 emit_jump (around_label);
916 emit_label (region->label);
917 expand_expr (failure, const0_rtx, VOIDmode, EXPAND_NORMAL);
919 emit_label (around_label);
922 /* End an exception region for a throw. No handling goes on here,
923 but it's the easiest way for the front-end to indicate what type
927 expand_eh_region_end_throw (type)
930 struct eh_region *region;
935 region = expand_eh_region_end ();
936 region->type = ERT_THROW;
937 region->u.throw.type = type;
940 /* End a fixup region. Within this region the cleanups for the immediately
941 enclosing region are _not_ run. This is used for goto cleanup to avoid
942 destroying an object twice.
944 This would be an extraordinarily simple prospect, were it not for the
945 fact that we don't actually know what the immediately enclosing region
946 is. This surprising fact is because expand_cleanups is currently
947 generating a sequence that it will insert somewhere else. We collect
948 the proper notion of "enclosing" in convert_from_eh_region_ranges. */
951 expand_eh_region_end_fixup (handler)
954 struct eh_region *fixup;
959 fixup = expand_eh_region_end ();
960 fixup->type = ERT_FIXUP;
961 fixup->u.fixup.cleanup_exp = handler;
964 /* Return an rtl expression for a pointer to the exception object
968 get_exception_pointer ()
970 rtx exc_ptr = cfun->eh->exc_ptr;
973 exc_ptr = gen_reg_rtx (Pmode);
974 cfun->eh->exc_ptr = exc_ptr;
979 /* Return an rtl expression for the exception dispatch filter
983 get_exception_filter ()
985 rtx filter = cfun->eh->filter;
988 filter = gen_reg_rtx (word_mode);
989 cfun->eh->filter = filter;
994 /* Begin a region that will contain entries created with
995 add_partial_entry. */
998 begin_protect_partials ()
1000 /* Push room for a new list. */
1001 cfun->eh->protect_list
1002 = tree_cons (NULL_TREE, NULL_TREE, cfun->eh->protect_list);
1005 /* Start a new exception region for a region of code that has a
1006 cleanup action and push the HANDLER for the region onto
1007 protect_list. All of the regions created with add_partial_entry
1008 will be ended when end_protect_partials is invoked. */
1011 add_partial_entry (handler)
1014 expand_eh_region_start ();
1016 /* ??? This comment was old before the most recent rewrite. We
1017 really ought to fix the callers at some point. */
1018 /* For backwards compatibility, we allow callers to omit calls to
1019 begin_protect_partials for the outermost region. So, we must
1020 explicitly do so here. */
1021 if (!cfun->eh->protect_list)
1022 begin_protect_partials ();
1024 /* Add this entry to the front of the list. */
1025 TREE_VALUE (cfun->eh->protect_list)
1026 = tree_cons (NULL_TREE, handler, TREE_VALUE (cfun->eh->protect_list));
1029 /* End all the pending exception regions on protect_list. */
1032 end_protect_partials ()
1036 /* ??? This comment was old before the most recent rewrite. We
1037 really ought to fix the callers at some point. */
1038 /* For backwards compatibility, we allow callers to omit the call to
1039 begin_protect_partials for the outermost region. So,
1040 PROTECT_LIST may be NULL. */
1041 if (!cfun->eh->protect_list)
1044 /* Pop the topmost entry. */
1045 t = TREE_VALUE (cfun->eh->protect_list);
1046 cfun->eh->protect_list = TREE_CHAIN (cfun->eh->protect_list);
1048 /* End all the exception regions. */
1049 for (; t; t = TREE_CHAIN (t))
1050 expand_eh_region_end_cleanup (TREE_VALUE (t));
1054 /* This section is for the exception handling specific optimization pass. */
1056 /* Random access the exception region tree. It's just as simple to
1057 collect the regions this way as in expand_eh_region_start, but
1058 without having to realloc memory. */
1061 collect_eh_region_array ()
1063 struct eh_region **array, *i;
1065 i = cfun->eh->region_tree;
1069 array = xcalloc (cfun->eh->last_region_number + 1, sizeof (*array));
1070 cfun->eh->region_array = array;
1074 array[i->region_number] = i;
1076 /* If there are sub-regions, process them. */
1079 /* If there are peers, process them. */
1080 else if (i->next_peer)
1082 /* Otherwise, step back up the tree to the next peer. */
1089 } while (i->next_peer == NULL);
1096 resolve_fixup_regions ()
1098 int i, j, n = cfun->eh->last_region_number;
1100 for (i = 1; i <= n; ++i)
1102 struct eh_region *fixup = cfun->eh->region_array[i];
1103 struct eh_region *cleanup;
1105 if (! fixup || fixup->type != ERT_FIXUP)
1108 for (j = 1; j <= n; ++j)
1110 cleanup = cfun->eh->region_array[j];
1111 if (cleanup->type == ERT_CLEANUP
1112 && cleanup->u.cleanup.exp == fixup->u.fixup.cleanup_exp)
1118 fixup->u.fixup.real_region = cleanup->outer;
1122 /* Now that we've discovered what region actually encloses a fixup,
1123 we can shuffle pointers and remove them from the tree. */
1126 remove_fixup_regions ()
1130 for (i = cfun->eh->last_region_number; i > 0; --i)
1132 struct eh_region *fixup = cfun->eh->region_array[i];
1137 /* Allow GC to maybe free some memory. */
1138 if (fixup->type == ERT_CLEANUP)
1139 fixup->u.cleanup.exp = NULL_TREE;
1141 if (fixup->type != ERT_FIXUP)
1146 struct eh_region *parent, *p, **pp;
1148 parent = fixup->u.fixup.real_region;
1150 /* Fix up the children's parent pointers; find the end of
1152 for (p = fixup->inner; ; p = p->next_peer)
1159 /* In the tree of cleanups, only outer-inner ordering matters.
1160 So link the children back in anywhere at the correct level. */
1162 pp = &parent->inner;
1164 pp = &cfun->eh->region_tree;
1167 fixup->inner = NULL;
1170 remove_eh_handler (fixup);
1174 /* Turn NOTE_INSN_EH_REGION notes into REG_EH_REGION notes for each
1175 can_throw instruction in the region. */
1178 convert_from_eh_region_ranges_1 (pinsns, orig_sp, cur)
1186 for (insn = *pinsns; insn ; insn = next)
1188 next = NEXT_INSN (insn);
1189 if (GET_CODE (insn) == NOTE)
1191 int kind = NOTE_LINE_NUMBER (insn);
1192 if (kind == NOTE_INSN_EH_REGION_BEG
1193 || kind == NOTE_INSN_EH_REGION_END)
1195 if (kind == NOTE_INSN_EH_REGION_BEG)
1197 struct eh_region *r;
1200 cur = NOTE_EH_HANDLER (insn);
1202 r = cfun->eh->region_array[cur];
1203 if (r->type == ERT_FIXUP)
1205 r = r->u.fixup.real_region;
1206 cur = r ? r->region_number : 0;
1208 else if (r->type == ERT_CATCH)
1211 cur = r ? r->region_number : 0;
1217 /* Removing the first insn of a CALL_PLACEHOLDER sequence
1218 requires extra care to adjust sequence start. */
1219 if (insn == *pinsns)
1225 else if (INSN_P (insn))
1228 && ! find_reg_note (insn, REG_EH_REGION, NULL_RTX)
1229 /* Calls can always potentially throw exceptions, unless
1230 they have a REG_EH_REGION note with a value of 0 or less.
1231 Which should be the only possible kind so far. */
1232 && (GET_CODE (insn) == CALL_INSN
1233 /* If we wanted exceptions for non-call insns, then
1234 any may_trap_p instruction could throw. */
1235 || (flag_non_call_exceptions
1236 && may_trap_p (PATTERN (insn)))))
1238 REG_NOTES (insn) = alloc_EXPR_LIST (REG_EH_REGION, GEN_INT (cur),
1242 if (GET_CODE (insn) == CALL_INSN
1243 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
1245 convert_from_eh_region_ranges_1 (&XEXP (PATTERN (insn), 0),
1247 convert_from_eh_region_ranges_1 (&XEXP (PATTERN (insn), 1),
1249 convert_from_eh_region_ranges_1 (&XEXP (PATTERN (insn), 2),
1260 convert_from_eh_region_ranges ()
1265 collect_eh_region_array ();
1266 resolve_fixup_regions ();
1268 stack = xmalloc (sizeof (int) * (cfun->eh->last_region_number + 1));
1269 insns = get_insns ();
1270 convert_from_eh_region_ranges_1 (&insns, stack, 0);
1273 remove_fixup_regions ();
1277 find_exception_handler_labels ()
1279 rtx list = NULL_RTX;
1282 free_EXPR_LIST_list (&exception_handler_labels);
1284 if (cfun->eh->region_tree == NULL)
1287 for (i = cfun->eh->last_region_number; i > 0; --i)
1289 struct eh_region *region = cfun->eh->region_array[i];
1294 if (cfun->eh->built_landing_pads)
1295 lab = region->landing_pad;
1297 lab = region->label;
1300 list = alloc_EXPR_LIST (0, lab, list);
1303 /* For sjlj exceptions, need the return label to remain live until
1304 after landing pad generation. */
1305 if (USING_SJLJ_EXCEPTIONS && ! cfun->eh->built_landing_pads)
1306 list = alloc_EXPR_LIST (0, return_label, list);
1308 exception_handler_labels = list;
1312 static struct eh_region *
1313 duplicate_eh_region_1 (o, map)
1314 struct eh_region *o;
1315 struct inline_remap *map;
1318 = (struct eh_region *) xcalloc (1, sizeof (struct eh_region));
1320 n->region_number = o->region_number + cfun->eh->last_region_number;
1326 case ERT_MUST_NOT_THROW:
1330 if (o->u.try.continue_label)
1331 n->u.try.continue_label
1332 = get_label_from_map (map,
1333 CODE_LABEL_NUMBER (o->u.try.continue_label));
1337 n->u.catch.type = o->u.catch.type;
1340 case ERT_ALLOWED_EXCEPTIONS:
1341 n->u.allowed.type_list = o->u.allowed.type_list;
1345 n->u.throw.type = o->u.throw.type;
1352 n->label = get_label_from_map (map, CODE_LABEL_NUMBER (o->label));
1355 n->resume = map->insn_map[INSN_UID (o->resume)];
1356 if (n->resume == NULL)
1364 duplicate_eh_region_2 (o, n_array)
1365 struct eh_region *o;
1366 struct eh_region **n_array;
1368 struct eh_region *n = n_array[o->region_number];
1373 n->u.try.catch = n_array[o->u.try.catch->region_number];
1374 n->u.try.last_catch = n_array[o->u.try.last_catch->region_number];
1378 if (o->u.catch.next_catch)
1379 n->u.catch.next_catch = n_array[o->u.catch.next_catch->region_number];
1380 if (o->u.catch.prev_catch)
1381 n->u.catch.prev_catch = n_array[o->u.catch.prev_catch->region_number];
1389 n->outer = n_array[o->outer->region_number];
1391 n->inner = n_array[o->inner->region_number];
1393 n->next_peer = n_array[o->next_peer->region_number];
1397 duplicate_eh_regions (ifun, map)
1398 struct function *ifun;
1399 struct inline_remap *map;
1401 int ifun_last_region_number = ifun->eh->last_region_number;
1402 struct eh_region **n_array, *root, *cur;
1405 if (ifun_last_region_number == 0)
1408 n_array = xcalloc (ifun_last_region_number + 1, sizeof (*n_array));
1410 for (i = 1; i <= ifun_last_region_number; ++i)
1412 cur = ifun->eh->region_array[i];
1413 if (!cur || cur->region_number != i)
1415 n_array[i] = duplicate_eh_region_1 (cur, map);
1417 for (i = 1; i <= ifun_last_region_number; ++i)
1419 cur = ifun->eh->region_array[i];
1420 if (!cur || cur->region_number != i)
1422 duplicate_eh_region_2 (cur, n_array);
1425 root = n_array[ifun->eh->region_tree->region_number];
1426 cur = cfun->eh->cur_region;
1429 struct eh_region *p = cur->inner;
1432 while (p->next_peer)
1434 p->next_peer = root;
1439 for (i = 1; i <= ifun_last_region_number; ++i)
1440 if (n_array[i]->outer == NULL)
1441 n_array[i]->outer = cur;
1445 struct eh_region *p = cfun->eh->region_tree;
1448 while (p->next_peer)
1450 p->next_peer = root;
1453 cfun->eh->region_tree = root;
1458 i = cfun->eh->last_region_number;
1459 cfun->eh->last_region_number = i + ifun_last_region_number;
1464 /* ??? Move from tree.c to tree.h. */
1465 #define TYPE_HASH(TYPE) ((HOST_WIDE_INT) (TYPE) & 0777777)
1468 t2r_eq (pentry, pdata)
1472 tree entry = (tree) pentry;
1473 tree data = (tree) pdata;
1475 return TREE_PURPOSE (entry) == data;
1482 tree entry = (tree) pentry;
1483 return TYPE_HASH (TREE_PURPOSE (entry));
1487 t2r_mark_1 (slot, data)
1489 PTR data ATTRIBUTE_UNUSED;
1491 tree contents = (tree) *slot;
1492 ggc_mark_tree (contents);
1500 htab_traverse (*(htab_t *)addr, t2r_mark_1, NULL);
1504 add_type_for_runtime (type)
1509 slot = (tree *) htab_find_slot_with_hash (type_to_runtime_map, type,
1510 TYPE_HASH (type), INSERT);
1513 tree runtime = (*lang_eh_runtime_type) (type);
1514 *slot = tree_cons (type, runtime, NULL_TREE);
1519 lookup_type_for_runtime (type)
1524 slot = (tree *) htab_find_slot_with_hash (type_to_runtime_map, type,
1525 TYPE_HASH (type), NO_INSERT);
1527 /* We should have always inserrted the data earlier. */
1528 return TREE_VALUE (*slot);
1532 /* Represent an entry in @TTypes for either catch actions
1533 or exception filter actions. */
1534 struct ttypes_filter
1540 /* Compare ENTRY (a ttypes_filter entry in the hash table) with DATA
1541 (a tree) for a @TTypes type node we are thinking about adding. */
1544 ttypes_filter_eq (pentry, pdata)
1548 const struct ttypes_filter *entry = (const struct ttypes_filter *) pentry;
1549 tree data = (tree) pdata;
1551 return entry->t == data;
1555 ttypes_filter_hash (pentry)
1558 const struct ttypes_filter *entry = (const struct ttypes_filter *) pentry;
1559 return TYPE_HASH (entry->t);
1562 /* Compare ENTRY with DATA (both struct ttypes_filter) for a @TTypes
1563 exception specification list we are thinking about adding. */
1564 /* ??? Currently we use the type lists in the order given. Someone
1565 should put these in some canonical order. */
1568 ehspec_filter_eq (pentry, pdata)
1572 const struct ttypes_filter *entry = (const struct ttypes_filter *) pentry;
1573 const struct ttypes_filter *data = (const struct ttypes_filter *) pdata;
1575 return type_list_equal (entry->t, data->t);
1578 /* Hash function for exception specification lists. */
1581 ehspec_filter_hash (pentry)
1584 const struct ttypes_filter *entry = (const struct ttypes_filter *) pentry;
1588 for (list = entry->t; list ; list = TREE_CHAIN (list))
1589 h = (h << 5) + (h >> 27) + TYPE_HASH (TREE_VALUE (list));
1593 /* Add TYPE to cfun->eh->ttype_data, using TYPES_HASH to speed
1594 up the search. Return the filter value to be used. */
1597 add_ttypes_entry (ttypes_hash, type)
1601 struct ttypes_filter **slot, *n;
1603 slot = (struct ttypes_filter **)
1604 htab_find_slot_with_hash (ttypes_hash, type, TYPE_HASH (type), INSERT);
1606 if ((n = *slot) == NULL)
1608 /* Filter value is a 1 based table index. */
1610 n = (struct ttypes_filter *) xmalloc (sizeof (*n));
1612 n->filter = VARRAY_ACTIVE_SIZE (cfun->eh->ttype_data) + 1;
1615 VARRAY_PUSH_TREE (cfun->eh->ttype_data, type);
1621 /* Add LIST to cfun->eh->ehspec_data, using EHSPEC_HASH and TYPES_HASH
1622 to speed up the search. Return the filter value to be used. */
1625 add_ehspec_entry (ehspec_hash, ttypes_hash, list)
1630 struct ttypes_filter **slot, *n;
1631 struct ttypes_filter dummy;
1634 slot = (struct ttypes_filter **)
1635 htab_find_slot (ehspec_hash, &dummy, INSERT);
1637 if ((n = *slot) == NULL)
1639 /* Filter value is a -1 based byte index into a uleb128 buffer. */
1641 n = (struct ttypes_filter *) xmalloc (sizeof (*n));
1643 n->filter = -(VARRAY_ACTIVE_SIZE (cfun->eh->ehspec_data) + 1);
1646 /* Look up each type in the list and encode its filter
1647 value as a uleb128. Terminate the list with 0. */
1648 for (; list ; list = TREE_CHAIN (list))
1649 push_uleb128 (&cfun->eh->ehspec_data,
1650 add_ttypes_entry (ttypes_hash, TREE_VALUE (list)));
1651 VARRAY_PUSH_UCHAR (cfun->eh->ehspec_data, 0);
1657 /* Generate the action filter values to be used for CATCH and
1658 ALLOWED_EXCEPTIONS regions. When using dwarf2 exception regions,
1659 we use lots of landing pads, and so every type or list can share
1660 the same filter value, which saves table space. */
1663 assign_filter_values ()
1666 htab_t ttypes, ehspec;
1668 VARRAY_TREE_INIT (cfun->eh->ttype_data, 16, "ttype_data");
1669 VARRAY_UCHAR_INIT (cfun->eh->ehspec_data, 64, "ehspec_data");
1671 ttypes = htab_create (31, ttypes_filter_hash, ttypes_filter_eq, free);
1672 ehspec = htab_create (31, ehspec_filter_hash, ehspec_filter_eq, free);
1674 for (i = cfun->eh->last_region_number; i > 0; --i)
1676 struct eh_region *r = cfun->eh->region_array[i];
1678 /* Mind we don't process a region more than once. */
1679 if (!r || r->region_number != i)
1685 r->u.catch.filter = add_ttypes_entry (ttypes, r->u.catch.type);
1688 case ERT_ALLOWED_EXCEPTIONS:
1690 = add_ehspec_entry (ehspec, ttypes, r->u.allowed.type_list);
1698 htab_delete (ttypes);
1699 htab_delete (ehspec);
1703 build_post_landing_pads ()
1707 for (i = cfun->eh->last_region_number; i > 0; --i)
1709 struct eh_region *region = cfun->eh->region_array[i];
1712 /* Mind we don't process a region more than once. */
1713 if (!region || region->region_number != i)
1716 switch (region->type)
1719 /* ??? Collect the set of all non-overlapping catch handlers
1720 all the way up the chain until blocked by a cleanup. */
1721 /* ??? Outer try regions can share landing pads with inner
1722 try regions if the types are completely non-overlapping,
1723 and there are no interveaning cleanups. */
1725 region->post_landing_pad = gen_label_rtx ();
1729 emit_label (region->post_landing_pad);
1731 /* ??? It is mighty inconvenient to call back into the
1732 switch statement generation code in expand_end_case.
1733 Rapid prototyping sez a sequence of ifs. */
1735 struct eh_region *c;
1736 for (c = region->u.try.catch; c ; c = c->u.catch.next_catch)
1738 /* ??? _Unwind_ForcedUnwind wants no match here. */
1739 if (c->u.catch.type == NULL)
1740 emit_jump (c->label);
1742 emit_cmp_and_jump_insns (cfun->eh->filter,
1743 GEN_INT (c->u.catch.filter),
1744 EQ, NULL_RTX, word_mode,
1749 /* We delay the generation of the _Unwind_Resume until we generate
1750 landing pads. We emit a marker here so as to get good control
1751 flow data in the meantime. */
1753 = emit_jump_insn (gen_rtx_RESX (VOIDmode, region->region_number));
1759 emit_insns_before (seq, region->u.try.catch->label);
1762 case ERT_ALLOWED_EXCEPTIONS:
1763 region->post_landing_pad = gen_label_rtx ();
1767 emit_label (region->post_landing_pad);
1769 emit_cmp_and_jump_insns (cfun->eh->filter,
1770 GEN_INT (region->u.allowed.filter),
1771 EQ, NULL_RTX, word_mode, 0, 0,
1774 /* We delay the generation of the _Unwind_Resume until we generate
1775 landing pads. We emit a marker here so as to get good control
1776 flow data in the meantime. */
1778 = emit_jump_insn (gen_rtx_RESX (VOIDmode, region->region_number));
1784 emit_insns_before (seq, region->label);
1788 case ERT_MUST_NOT_THROW:
1789 region->post_landing_pad = region->label;
1794 /* Nothing to do. */
1803 /* Replace RESX patterns with jumps to the next handler if any, or calls to
1804 _Unwind_Resume otherwise. */
1807 connect_post_landing_pads ()
1811 for (i = cfun->eh->last_region_number; i > 0; --i)
1813 struct eh_region *region = cfun->eh->region_array[i];
1814 struct eh_region *outer;
1817 /* Mind we don't process a region more than once. */
1818 if (!region || region->region_number != i)
1821 /* If there is no RESX, or it has been deleted by flow, there's
1822 nothing to fix up. */
1823 if (! region->resume || INSN_DELETED_P (region->resume))
1826 /* Search for another landing pad in this function. */
1827 for (outer = region->outer; outer ; outer = outer->outer)
1828 if (outer->post_landing_pad)
1834 emit_jump (outer->post_landing_pad);
1836 emit_library_call (unwind_resume_libfunc, LCT_THROW,
1837 VOIDmode, 1, cfun->eh->exc_ptr, Pmode);
1841 emit_insns_before (seq, region->resume);
1843 /* Leave the RESX to be deleted by flow. */
1849 dw2_build_landing_pads ()
1853 for (i = cfun->eh->last_region_number; i > 0; --i)
1855 struct eh_region *region = cfun->eh->region_array[i];
1858 /* Mind we don't process a region more than once. */
1859 if (!region || region->region_number != i)
1862 if (region->type != ERT_CLEANUP
1863 && region->type != ERT_TRY
1864 && region->type != ERT_ALLOWED_EXCEPTIONS)
1869 region->landing_pad = gen_label_rtx ();
1870 emit_label (region->landing_pad);
1872 #ifdef HAVE_exception_receiver
1873 if (HAVE_exception_receiver)
1874 emit_insn (gen_exception_receiver ());
1877 #ifdef HAVE_nonlocal_goto_receiver
1878 if (HAVE_nonlocal_goto_receiver)
1879 emit_insn (gen_nonlocal_goto_receiver ());
1884 /* If the eh_return data registers are call-saved, then we
1885 won't have considered them clobbered from the call that
1886 threw. Kill them now. */
1889 unsigned r = EH_RETURN_DATA_REGNO (j);
1890 if (r == INVALID_REGNUM)
1892 if (! call_used_regs[r])
1893 emit_insn (gen_rtx_CLOBBER (VOIDmode, gen_rtx_REG (Pmode, r)));
1896 emit_move_insn (cfun->eh->exc_ptr,
1897 gen_rtx_REG (Pmode, EH_RETURN_DATA_REGNO (0)));
1898 emit_move_insn (cfun->eh->filter,
1899 gen_rtx_REG (Pmode, EH_RETURN_DATA_REGNO (1)));
1904 emit_insns_before (seq, region->post_landing_pad);
1911 int directly_reachable;
1914 int call_site_index;
1918 sjlj_find_directly_reachable_regions (lp_info)
1919 struct sjlj_lp_info *lp_info;
1922 bool found_one = false;
1924 for (insn = get_insns (); insn ; insn = NEXT_INSN (insn))
1926 struct eh_region *region;
1930 if (! INSN_P (insn))
1933 note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
1934 if (!note || INTVAL (XEXP (note, 0)) <= 0)
1937 region = cfun->eh->region_array[INTVAL (XEXP (note, 0))];
1939 type_thrown = NULL_TREE;
1940 if (region->type == ERT_THROW)
1942 type_thrown = region->u.throw.type;
1943 region = region->outer;
1946 /* Find the first containing region that might handle the exception.
1947 That's the landing pad to which we will transfer control. */
1948 for (; region; region = region->outer)
1949 if (reachable_next_level (region, type_thrown, 0) != RNL_NOT_CAUGHT)
1954 lp_info[region->region_number].directly_reachable = 1;
1963 sjlj_assign_call_site_values (dispatch_label, lp_info)
1965 struct sjlj_lp_info *lp_info;
1970 /* First task: build the action table. */
1972 VARRAY_UCHAR_INIT (cfun->eh->action_record_data, 64, "action_record_data");
1973 ar_hash = htab_create (31, action_record_hash, action_record_eq, free);
1975 for (i = cfun->eh->last_region_number; i > 0; --i)
1976 if (lp_info[i].directly_reachable)
1978 struct eh_region *r = cfun->eh->region_array[i];
1979 r->landing_pad = dispatch_label;
1980 lp_info[i].action_index = collect_one_action_chain (ar_hash, r);
1981 if (lp_info[i].action_index != -1)
1982 cfun->uses_eh_lsda = 1;
1985 htab_delete (ar_hash);
1987 /* Next: assign dispatch values. In dwarf2 terms, this would be the
1988 landing pad label for the region. For sjlj though, there is one
1989 common landing pad from which we dispatch to the post-landing pads.
1991 A region receives a dispatch index if it is directly reachable
1992 and requires in-function processing. Regions that share post-landing
1993 pads may share dispatch indicies. */
1994 /* ??? Post-landing pad sharing doesn't actually happen at the moment
1995 (see build_post_landing_pads) so we don't bother checking for it. */
1998 for (i = cfun->eh->last_region_number; i > 0; --i)
1999 if (lp_info[i].directly_reachable
2000 && lp_info[i].action_index >= 0)
2001 lp_info[i].dispatch_index = index++;
2003 /* Finally: assign call-site values. If dwarf2 terms, this would be
2004 the region number assigned by convert_to_eh_region_ranges, but
2005 handles no-action and must-not-throw differently. */
2008 for (i = cfun->eh->last_region_number; i > 0; --i)
2009 if (lp_info[i].directly_reachable)
2011 int action = lp_info[i].action_index;
2013 /* Map must-not-throw to otherwise unused call-site index 0. */
2016 /* Map no-action to otherwise unused call-site index -1. */
2017 else if (action == -1)
2019 /* Otherwise, look it up in the table. */
2021 index = add_call_site (GEN_INT (lp_info[i].dispatch_index), action);
2023 lp_info[i].call_site_index = index;
2028 sjlj_mark_call_sites (lp_info)
2029 struct sjlj_lp_info *lp_info;
2031 int last_call_site = -2;
2034 mem = change_address (cfun->eh->sjlj_fc, TYPE_MODE (integer_type_node),
2035 plus_constant (XEXP (cfun->eh->sjlj_fc, 0),
2036 sjlj_fc_call_site_ofs));
2038 for (insn = get_insns (); insn ; insn = NEXT_INSN (insn))
2040 struct eh_region *region;
2042 rtx note, before, p;
2044 /* Reset value tracking at extended basic block boundaries. */
2045 if (GET_CODE (insn) == CODE_LABEL)
2046 last_call_site = -2;
2048 if (! INSN_P (insn))
2051 note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
2054 /* Calls (and trapping insns) without notes are outside any
2055 exception handling region in this function. Mark them as
2057 if (GET_CODE (insn) == CALL_INSN
2058 || (flag_non_call_exceptions
2059 && may_trap_p (PATTERN (insn))))
2060 this_call_site = -1;
2066 /* Calls that are known to not throw need not be marked. */
2067 if (INTVAL (XEXP (note, 0)) <= 0)
2070 region = cfun->eh->region_array[INTVAL (XEXP (note, 0))];
2071 this_call_site = lp_info[region->region_number].call_site_index;
2074 if (this_call_site == last_call_site)
2077 /* Don't separate a call from it's argument loads. */
2079 if (GET_CODE (insn) == CALL_INSN)
2081 HARD_REG_SET parm_regs;
2084 /* Since different machines initialize their parameter registers
2085 in different orders, assume nothing. Collect the set of all
2086 parameter registers. */
2087 CLEAR_HARD_REG_SET (parm_regs);
2089 for (p = CALL_INSN_FUNCTION_USAGE (insn); p ; p = XEXP (p, 1))
2090 if (GET_CODE (XEXP (p, 0)) == USE
2091 && GET_CODE (XEXP (XEXP (p, 0), 0)) == REG)
2093 if (REGNO (XEXP (XEXP (p, 0), 0)) >= FIRST_PSEUDO_REGISTER)
2096 SET_HARD_REG_BIT (parm_regs, REGNO (XEXP (XEXP (p, 0), 0)));
2100 /* Search backward for the first set of a register in this set. */
2103 before = PREV_INSN (before);
2105 /* Given that we've done no other optimizations yet,
2106 the arguments should be immediately available. */
2107 if (GET_CODE (before) == CODE_LABEL)
2110 p = single_set (before);
2111 if (p && GET_CODE (SET_DEST (p)) == REG
2112 && REGNO (SET_DEST (p)) < FIRST_PSEUDO_REGISTER
2113 && TEST_HARD_REG_BIT (parm_regs, REGNO (SET_DEST (p))))
2115 CLEAR_HARD_REG_BIT (parm_regs, REGNO (SET_DEST (p)));
2122 emit_move_insn (mem, GEN_INT (this_call_site));
2126 emit_insns_before (p, before);
2127 last_call_site = this_call_site;
2131 /* Construct the SjLj_Function_Context. */
2134 sjlj_emit_function_enter (dispatch_label)
2137 rtx fn_begin, fc, mem, seq;
2139 fc = cfun->eh->sjlj_fc;
2143 mem = change_address (fc, Pmode,
2144 plus_constant (XEXP (fc, 0), sjlj_fc_personality_ofs));
2145 emit_move_insn (mem, eh_personality_libfunc);
2147 mem = change_address (fc, Pmode,
2148 plus_constant (XEXP (fc, 0), sjlj_fc_lsda_ofs));
2149 if (cfun->uses_eh_lsda)
2152 ASM_GENERATE_INTERNAL_LABEL (buf, "LLSDA", sjlj_funcdef_number);
2153 emit_move_insn (mem, gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (buf)));
2156 emit_move_insn (mem, const0_rtx);
2158 #ifdef DONT_USE_BUILTIN_SETJMP
2161 x = emit_library_call_value (setjmp_libfunc, NULL_RTX, LCT_NORMAL,
2162 TYPE_MODE (integer_type_node), 1,
2163 plus_constant (XEXP (fc, 0),
2164 sjlj_fc_jbuf_ofs), Pmode);
2166 note = emit_note (NULL, NOTE_INSN_EXPECTED_VALUE);
2167 NOTE_EXPECTED_VALUE (note) = gen_rtx_EQ (VOIDmode, x, const0_rtx);
2169 emit_cmp_and_jump_insns (x, const0_rtx, NE, 0,
2170 TYPE_MODE (integer_type_node), 0, 0,
2174 expand_builtin_setjmp_setup (plus_constant (XEXP (fc, 0), sjlj_fc_jbuf_ofs),
2178 emit_library_call (unwind_sjlj_register_libfunc, LCT_NORMAL, VOIDmode,
2179 1, XEXP (fc, 0), Pmode);
2184 /* ??? Instead of doing this at the beginning of the function,
2185 do this in a block that is at loop level 0 and dominates all
2186 can_throw_internal instructions. */
2188 for (fn_begin = get_insns (); ; fn_begin = NEXT_INSN (fn_begin))
2189 if (GET_CODE (fn_begin) == NOTE
2190 && NOTE_LINE_NUMBER (fn_begin) == NOTE_INSN_FUNCTION_BEG)
2192 emit_insns_after (seq, fn_begin);
2195 /* Call back from expand_function_end to know where we should put
2196 the call to unwind_sjlj_unregister_libfunc if needed. */
2199 sjlj_emit_function_exit_after (after)
2202 cfun->eh->sjlj_exit_after = after;
2206 sjlj_emit_function_exit ()
2212 emit_library_call (unwind_sjlj_unregister_libfunc, LCT_NORMAL, VOIDmode,
2213 1, XEXP (cfun->eh->sjlj_fc, 0), Pmode);
2218 /* ??? Really this can be done in any block at loop level 0 that
2219 post-dominates all can_throw_internal instructions. This is
2220 the last possible moment. */
2222 emit_insns_after (seq, cfun->eh->sjlj_exit_after);
2226 sjlj_emit_dispatch_table (dispatch_label, lp_info)
2228 struct sjlj_lp_info *lp_info;
2230 int i, first_reachable;
2231 rtx mem, dispatch, seq, fc;
2233 fc = cfun->eh->sjlj_fc;
2237 emit_label (dispatch_label);
2239 #ifndef DONT_USE_BUILTIN_SETJMP
2240 expand_builtin_setjmp_receiver (dispatch_label);
2243 /* Load up dispatch index, exc_ptr and filter values from the
2244 function context. */
2245 mem = change_address (fc, TYPE_MODE (integer_type_node),
2246 plus_constant (XEXP (fc, 0), sjlj_fc_call_site_ofs));
2247 dispatch = copy_to_reg (mem);
2249 mem = change_address (fc, word_mode,
2250 plus_constant (XEXP (fc, 0), sjlj_fc_data_ofs));
2251 if (word_mode != Pmode)
2253 #ifdef POINTERS_EXTEND_UNSIGNED
2254 mem = convert_memory_address (Pmode, mem);
2256 mem = convert_to_mode (Pmode, mem, 0);
2259 emit_move_insn (cfun->eh->exc_ptr, mem);
2261 mem = change_address (fc, word_mode,
2262 plus_constant (XEXP (fc, 0),
2263 sjlj_fc_data_ofs + UNITS_PER_WORD));
2264 emit_move_insn (cfun->eh->filter, mem);
2266 /* Jump to one of the directly reachable regions. */
2267 /* ??? This really ought to be using a switch statement. */
2269 first_reachable = 0;
2270 for (i = cfun->eh->last_region_number; i > 0; --i)
2272 if (! lp_info[i].directly_reachable
2273 || lp_info[i].action_index < 0)
2276 if (! first_reachable)
2278 first_reachable = i;
2282 emit_cmp_and_jump_insns (dispatch,
2283 GEN_INT (lp_info[i].dispatch_index), EQ,
2284 NULL_RTX, TYPE_MODE (integer_type_node), 0, 0,
2285 cfun->eh->region_array[i]->post_landing_pad);
2291 emit_insns_before (seq, (cfun->eh->region_array[first_reachable]
2292 ->post_landing_pad));
2296 sjlj_build_landing_pads ()
2298 struct sjlj_lp_info *lp_info;
2300 lp_info = (struct sjlj_lp_info *) xcalloc (cfun->eh->last_region_number + 1,
2301 sizeof (struct sjlj_lp_info));
2303 if (sjlj_find_directly_reachable_regions (lp_info))
2305 rtx dispatch_label = gen_label_rtx ();
2308 = assign_stack_local (TYPE_MODE (sjlj_fc_type_node),
2309 int_size_in_bytes (sjlj_fc_type_node),
2310 TYPE_ALIGN (sjlj_fc_type_node));
2312 sjlj_assign_call_site_values (dispatch_label, lp_info);
2313 sjlj_mark_call_sites (lp_info);
2315 sjlj_emit_function_enter (dispatch_label);
2316 sjlj_emit_dispatch_table (dispatch_label, lp_info);
2317 sjlj_emit_function_exit ();
2324 finish_eh_generation ()
2326 /* Nothing to do if no regions created. */
2327 if (cfun->eh->region_tree == NULL)
2330 /* The object here is to provide find_basic_blocks with detailed
2331 information (via reachable_handlers) on how exception control
2332 flows within the function. In this first pass, we can include
2333 type information garnered from ERT_THROW and ERT_ALLOWED_EXCEPTIONS
2334 regions, and hope that it will be useful in deleting unreachable
2335 handlers. Subsequently, we will generate landing pads which will
2336 connect many of the handlers, and then type information will not
2337 be effective. Still, this is a win over previous implementations. */
2339 jump_optimize_minimal (get_insns ());
2340 find_basic_blocks (get_insns (), max_reg_num (), 0);
2343 /* These registers are used by the landing pads. Make sure they
2344 have been generated. */
2345 get_exception_pointer ();
2346 get_exception_filter ();
2348 /* Construct the landing pads. */
2350 assign_filter_values ();
2351 build_post_landing_pads ();
2352 connect_post_landing_pads ();
2353 if (USING_SJLJ_EXCEPTIONS)
2354 sjlj_build_landing_pads ();
2356 dw2_build_landing_pads ();
2358 cfun->eh->built_landing_pads = 1;
2360 /* We've totally changed the CFG. Start over. */
2361 find_exception_handler_labels ();
2362 jump_optimize_minimal (get_insns ());
2363 find_basic_blocks (get_insns (), max_reg_num (), 0);
2367 /* This section handles removing dead code for flow. */
2369 /* Remove LABEL from the exception_handler_labels list. */
2372 remove_exception_handler_label (label)
2377 for (pl = &exception_handler_labels, l = *pl;
2378 XEXP (l, 0) != label;
2379 pl = &XEXP (l, 1), l = *pl)
2383 free_EXPR_LIST_node (l);
2386 /* Splice REGION from the region tree etc. */
2389 remove_eh_handler (region)
2390 struct eh_region *region;
2392 struct eh_region **pp, *p;
2396 /* For the benefit of efficiently handling REG_EH_REGION notes,
2397 replace this region in the region array with its containing
2398 region. Note that previous region deletions may result in
2399 multiple copies of this region in the array, so we have to
2400 search the whole thing. */
2401 for (i = cfun->eh->last_region_number; i > 0; --i)
2402 if (cfun->eh->region_array[i] == region)
2403 cfun->eh->region_array[i] = region->outer;
2405 if (cfun->eh->built_landing_pads)
2406 lab = region->landing_pad;
2408 lab = region->label;
2410 remove_exception_handler_label (lab);
2413 pp = ®ion->outer->inner;
2415 pp = &cfun->eh->region_tree;
2416 for (p = *pp; p != region; pp = &p->next_peer, p = *pp)
2421 for (p = region->inner; p->next_peer ; p = p->next_peer)
2422 p->outer = region->outer;
2423 p->next_peer = region->next_peer;
2424 p->outer = region->outer;
2425 *pp = region->inner;
2428 *pp = region->next_peer;
2430 if (region->type == ERT_CATCH)
2432 struct eh_region *try, *next, *prev;
2434 for (try = region->next_peer;
2435 try->type == ERT_CATCH;
2436 try = try->next_peer)
2438 if (try->type != ERT_TRY)
2441 next = region->u.catch.next_catch;
2442 prev = region->u.catch.prev_catch;
2445 next->u.catch.prev_catch = prev;
2447 try->u.try.last_catch = prev;
2449 prev->u.catch.next_catch = next;
2452 try->u.try.catch = next;
2454 remove_eh_handler (try);
2461 /* LABEL heads a basic block that is about to be deleted. If this
2462 label corresponds to an exception region, we may be able to
2463 delete the region. */
2466 maybe_remove_eh_handler (label)
2471 /* ??? After generating landing pads, it's not so simple to determine
2472 if the region data is completely unused. One must examine the
2473 landing pad and the post landing pad, and whether an inner try block
2474 is referencing the catch handlers directly. */
2475 if (cfun->eh->built_landing_pads)
2478 for (i = cfun->eh->last_region_number; i > 0; --i)
2480 struct eh_region *region = cfun->eh->region_array[i];
2481 if (region && region->label == label)
2483 /* Flow will want to remove MUST_NOT_THROW regions as unreachable
2484 because there is no path to the fallback call to terminate.
2485 But the region continues to affect call-site data until there
2486 are no more contained calls, which we don't see here. */
2487 if (region->type == ERT_MUST_NOT_THROW)
2489 remove_exception_handler_label (region->label);
2490 region->label = NULL_RTX;
2493 remove_eh_handler (region);
2500 /* This section describes CFG exception edges for flow. */
2502 /* For communicating between calls to reachable_next_level. */
2503 struct reachable_info
2510 /* A subroutine of reachable_next_level. Return true if TYPE, or a
2511 base class of TYPE, is in HANDLED. */
2514 check_handled (handled, type)
2519 /* We can check for exact matches without front-end help. */
2520 if (! lang_eh_type_covers)
2522 for (t = handled; t ; t = TREE_CHAIN (t))
2523 if (TREE_VALUE (t) == type)
2528 for (t = handled; t ; t = TREE_CHAIN (t))
2529 if ((*lang_eh_type_covers) (TREE_VALUE (t), type))
2536 /* A subroutine of reachable_next_level. If we are collecting a list
2537 of handlers, add one. After landing pad generation, reference
2538 it instead of the handlers themselves. Further, the handlers are
2539 all wired together, so by referencing one, we've got them all.
2540 Before landing pad generation we reference each handler individually.
2542 LP_REGION contains the landing pad; REGION is the handler. */
2545 add_reachable_handler (info, lp_region, region)
2546 struct reachable_info *info;
2547 struct eh_region *lp_region;
2548 struct eh_region *region;
2553 if (cfun->eh->built_landing_pads)
2555 if (! info->handlers)
2556 info->handlers = alloc_INSN_LIST (lp_region->landing_pad, NULL_RTX);
2559 info->handlers = alloc_INSN_LIST (region->label, info->handlers);
2562 /* Process one level of exception regions for reachability.
2563 If TYPE_THROWN is non-null, then it is the *exact* type being
2564 propagated. If INFO is non-null, then collect handler labels
2565 and caught/allowed type information between invocations. */
2567 static enum reachable_code
2568 reachable_next_level (region, type_thrown, info)
2569 struct eh_region *region;
2571 struct reachable_info *info;
2573 switch (region->type)
2576 /* Before landing-pad generation, we model control flow
2577 directly to the individual handlers. In this way we can
2578 see that catch handler types may shadow one another. */
2579 add_reachable_handler (info, region, region);
2580 return RNL_MAYBE_CAUGHT;
2584 struct eh_region *c;
2585 enum reachable_code ret = RNL_NOT_CAUGHT;
2587 for (c = region->u.try.catch; c ; c = c->u.catch.next_catch)
2589 /* A catch-all handler ends the search. */
2590 /* ??? _Unwind_ForcedUnwind will want outer cleanups
2591 to be run as well. */
2592 if (c->u.catch.type == NULL)
2594 add_reachable_handler (info, region, c);
2600 /* If we have a type match, end the search. */
2601 if (c->u.catch.type == type_thrown
2602 || (lang_eh_type_covers
2603 && (*lang_eh_type_covers) (c->u.catch.type,
2606 add_reachable_handler (info, region, c);
2610 /* If we have definitive information of a match failure,
2611 the catch won't trigger. */
2612 if (lang_eh_type_covers)
2613 return RNL_NOT_CAUGHT;
2617 ret = RNL_MAYBE_CAUGHT;
2619 /* A type must not have been previously caught. */
2620 else if (! check_handled (info->types_caught, c->u.catch.type))
2622 add_reachable_handler (info, region, c);
2623 info->types_caught = tree_cons (NULL, c->u.catch.type,
2624 info->types_caught);
2626 /* ??? If the catch type is a base class of every allowed
2627 type, then we know we can stop the search. */
2628 ret = RNL_MAYBE_CAUGHT;
2635 case ERT_ALLOWED_EXCEPTIONS:
2636 /* An empty list of types definitely ends the search. */
2637 if (region->u.allowed.type_list == NULL_TREE)
2639 add_reachable_handler (info, region, region);
2643 /* Collect a list of lists of allowed types for use in detecting
2644 when a catch may be transformed into a catch-all. */
2646 info->types_allowed = tree_cons (NULL_TREE,
2647 region->u.allowed.type_list,
2648 info->types_allowed);
2650 /* If we have definitive information about the type heirarchy,
2651 then we can tell if the thrown type will pass through the
2653 if (type_thrown && lang_eh_type_covers)
2655 if (check_handled (region->u.allowed.type_list, type_thrown))
2656 return RNL_NOT_CAUGHT;
2659 add_reachable_handler (info, region, region);
2664 add_reachable_handler (info, region, region);
2665 return RNL_MAYBE_CAUGHT;
2668 /* Catch regions are handled by their controling try region. */
2669 return RNL_NOT_CAUGHT;
2671 case ERT_MUST_NOT_THROW:
2672 /* Here we end our search, since no exceptions may propagate.
2673 If we've touched down at some landing pad previous, then the
2674 explicit function call we generated may be used. Otherwise
2675 the call is made by the runtime. */
2676 if (info && info->handlers)
2678 add_reachable_handler (info, region, region);
2686 /* Shouldn't see these here. */
2693 /* Retrieve a list of labels of exception handlers which can be
2694 reached by a given insn. */
2697 reachable_handlers (insn)
2700 struct reachable_info info;
2701 struct eh_region *region;
2705 if (GET_CODE (insn) == JUMP_INSN
2706 && GET_CODE (PATTERN (insn)) == RESX)
2707 region_number = XINT (PATTERN (insn), 0);
2710 rtx note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
2711 if (!note || INTVAL (XEXP (note, 0)) <= 0)
2713 region_number = INTVAL (XEXP (note, 0));
2716 memset (&info, 0, sizeof (info));
2718 region = cfun->eh->region_array[region_number];
2720 type_thrown = NULL_TREE;
2721 if (region->type == ERT_THROW)
2723 type_thrown = region->u.throw.type;
2724 region = region->outer;
2726 else if (GET_CODE (insn) == JUMP_INSN
2727 && GET_CODE (PATTERN (insn)) == RESX)
2728 region = region->outer;
2730 for (; region; region = region->outer)
2731 if (reachable_next_level (region, type_thrown, &info) >= RNL_CAUGHT)
2734 return info.handlers;
2737 /* Determine if the given INSN can throw an exception that is caught
2738 within the function. */
2741 can_throw_internal (insn)
2744 struct eh_region *region;
2748 if (! INSN_P (insn))
2751 if (GET_CODE (insn) == INSN
2752 && GET_CODE (PATTERN (insn)) == SEQUENCE)
2753 insn = XVECEXP (PATTERN (insn), 0, 0);
2755 if (GET_CODE (insn) == CALL_INSN
2756 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
2759 for (i = 0; i < 3; ++i)
2761 rtx sub = XEXP (PATTERN (insn), i);
2762 for (; sub ; sub = NEXT_INSN (sub))
2763 if (can_throw_internal (sub))
2769 /* Every insn that might throw has an EH_REGION note. */
2770 note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
2771 if (!note || INTVAL (XEXP (note, 0)) <= 0)
2774 region = cfun->eh->region_array[INTVAL (XEXP (note, 0))];
2776 type_thrown = NULL_TREE;
2777 if (region->type == ERT_THROW)
2779 type_thrown = region->u.throw.type;
2780 region = region->outer;
2783 /* If this exception is ignored by each and every containing region,
2784 then control passes straight out. The runtime may handle some
2785 regions, which also do not require processing internally. */
2786 for (; region; region = region->outer)
2788 enum reachable_code how = reachable_next_level (region, type_thrown, 0);
2789 if (how == RNL_BLOCKED)
2791 if (how != RNL_NOT_CAUGHT)
2798 /* Determine if the given INSN can throw an exception that is
2799 visible outside the function. */
2802 can_throw_external (insn)
2805 struct eh_region *region;
2809 if (! INSN_P (insn))
2812 if (GET_CODE (insn) == INSN
2813 && GET_CODE (PATTERN (insn)) == SEQUENCE)
2814 insn = XVECEXP (PATTERN (insn), 0, 0);
2816 if (GET_CODE (insn) == CALL_INSN
2817 && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER)
2820 for (i = 0; i < 3; ++i)
2822 rtx sub = XEXP (PATTERN (insn), i);
2823 for (; sub ; sub = NEXT_INSN (sub))
2824 if (can_throw_external (sub))
2830 note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
2833 /* Calls (and trapping insns) without notes are outside any
2834 exception handling region in this function. We have to
2835 assume it might throw. Given that the front end and middle
2836 ends mark known NOTHROW functions, this isn't so wildly
2838 return (GET_CODE (insn) == CALL_INSN
2839 || (flag_non_call_exceptions
2840 && may_trap_p (PATTERN (insn))));
2842 if (INTVAL (XEXP (note, 0)) <= 0)
2845 region = cfun->eh->region_array[INTVAL (XEXP (note, 0))];
2847 type_thrown = NULL_TREE;
2848 if (region->type == ERT_THROW)
2850 type_thrown = region->u.throw.type;
2851 region = region->outer;
2854 /* If the exception is caught or blocked by any containing region,
2855 then it is not seen by any calling function. */
2856 for (; region ; region = region->outer)
2857 if (reachable_next_level (region, type_thrown, NULL) >= RNL_CAUGHT)
2863 /* True if nothing in this function can throw outside this function. */
2866 nothrow_function_p ()
2870 if (! flag_exceptions)
2873 for (insn = get_insns (); insn; insn = NEXT_INSN (insn))
2874 if (can_throw_external (insn))
2876 for (insn = current_function_epilogue_delay_list; insn;
2877 insn = XEXP (insn, 1))
2878 if (can_throw_external (insn))
2885 /* Various hooks for unwind library. */
2887 /* Do any necessary initialization to access arbitrary stack frames.
2888 On the SPARC, this means flushing the register windows. */
2891 expand_builtin_unwind_init ()
2893 /* Set this so all the registers get saved in our frame; we need to be
2894 able to copy the saved values for any registers from frames we unwind. */
2895 current_function_has_nonlocal_label = 1;
2897 #ifdef SETUP_FRAME_ADDRESSES
2898 SETUP_FRAME_ADDRESSES ();
2903 expand_builtin_eh_return_data_regno (arglist)
2906 tree which = TREE_VALUE (arglist);
2907 unsigned HOST_WIDE_INT iwhich;
2909 if (TREE_CODE (which) != INTEGER_CST)
2911 error ("argument of `__builtin_eh_return_regno' must be constant");
2915 iwhich = tree_low_cst (which, 1);
2916 iwhich = EH_RETURN_DATA_REGNO (iwhich);
2917 if (iwhich == INVALID_REGNUM)
2920 #ifdef DWARF_FRAME_REGNUM
2921 iwhich = DWARF_FRAME_REGNUM (iwhich);
2923 iwhich = DBX_REGISTER_NUMBER (iwhich);
2926 return GEN_INT (iwhich);
2929 /* Given a value extracted from the return address register or stack slot,
2930 return the actual address encoded in that value. */
2933 expand_builtin_extract_return_addr (addr_tree)
2936 rtx addr = expand_expr (addr_tree, NULL_RTX, Pmode, 0);
2938 /* First mask out any unwanted bits. */
2939 #ifdef MASK_RETURN_ADDR
2940 expand_and (addr, MASK_RETURN_ADDR, addr);
2943 /* Then adjust to find the real return address. */
2944 #if defined (RETURN_ADDR_OFFSET)
2945 addr = plus_constant (addr, RETURN_ADDR_OFFSET);
2951 /* Given an actual address in addr_tree, do any necessary encoding
2952 and return the value to be stored in the return address register or
2953 stack slot so the epilogue will return to that address. */
2956 expand_builtin_frob_return_addr (addr_tree)
2959 rtx addr = expand_expr (addr_tree, NULL_RTX, Pmode, 0);
2961 #ifdef RETURN_ADDR_OFFSET
2962 addr = force_reg (Pmode, addr);
2963 addr = plus_constant (addr, -RETURN_ADDR_OFFSET);
2969 /* Set up the epilogue with the magic bits we'll need to return to the
2970 exception handler. */
2973 expand_builtin_eh_return (stackadj_tree, handler_tree)
2974 tree stackadj_tree, handler_tree;
2976 rtx stackadj, handler;
2978 stackadj = expand_expr (stackadj_tree, cfun->eh->ehr_stackadj, VOIDmode, 0);
2979 handler = expand_expr (handler_tree, cfun->eh->ehr_handler, VOIDmode, 0);
2981 if (! cfun->eh->ehr_label)
2983 cfun->eh->ehr_stackadj = copy_to_reg (stackadj);
2984 cfun->eh->ehr_handler = copy_to_reg (handler);
2985 cfun->eh->ehr_label = gen_label_rtx ();
2989 if (stackadj != cfun->eh->ehr_stackadj)
2990 emit_move_insn (cfun->eh->ehr_stackadj, stackadj);
2991 if (handler != cfun->eh->ehr_handler)
2992 emit_move_insn (cfun->eh->ehr_handler, handler);
2995 emit_jump (cfun->eh->ehr_label);
3001 rtx sa, ra, around_label;
3003 if (! cfun->eh->ehr_label)
3006 sa = EH_RETURN_STACKADJ_RTX;
3009 error ("__builtin_eh_return not supported on this target");
3013 current_function_calls_eh_return = 1;
3015 around_label = gen_label_rtx ();
3016 emit_move_insn (sa, const0_rtx);
3017 emit_jump (around_label);
3019 emit_label (cfun->eh->ehr_label);
3020 clobber_return_register ();
3022 #ifdef HAVE_eh_return
3024 emit_insn (gen_eh_return (cfun->eh->ehr_stackadj, cfun->eh->ehr_handler));
3028 ra = EH_RETURN_HANDLER_RTX;
3031 error ("__builtin_eh_return not supported on this target");
3032 ra = gen_reg_rtx (Pmode);
3035 emit_move_insn (sa, cfun->eh->ehr_stackadj);
3036 emit_move_insn (ra, cfun->eh->ehr_handler);
3039 emit_label (around_label);
3042 struct action_record
3050 action_record_eq (pentry, pdata)
3054 const struct action_record *entry = (const struct action_record *) pentry;
3055 const struct action_record *data = (const struct action_record *) pdata;
3056 return entry->filter == data->filter && entry->next == data->next;
3060 action_record_hash (pentry)
3063 const struct action_record *entry = (const struct action_record *) pentry;
3064 return entry->next * 1009 + entry->filter;
3068 add_action_record (ar_hash, filter, next)
3072 struct action_record **slot, *new, tmp;
3074 tmp.filter = filter;
3076 slot = (struct action_record **) htab_find_slot (ar_hash, &tmp, INSERT);
3078 if ((new = *slot) == NULL)
3080 new = (struct action_record *) xmalloc (sizeof (*new));
3081 new->offset = VARRAY_ACTIVE_SIZE (cfun->eh->action_record_data) + 1;
3082 new->filter = filter;
3086 /* The filter value goes in untouched. The link to the next
3087 record is a "self-relative" byte offset, or zero to indicate
3088 that there is no next record. So convert the absolute 1 based
3089 indicies we've been carrying around into a displacement. */
3091 push_sleb128 (&cfun->eh->action_record_data, filter);
3093 next -= VARRAY_ACTIVE_SIZE (cfun->eh->action_record_data) + 1;
3094 push_sleb128 (&cfun->eh->action_record_data, next);
3101 collect_one_action_chain (ar_hash, region)
3103 struct eh_region *region;
3105 struct eh_region *c;
3108 /* If we've reached the top of the region chain, then we have
3109 no actions, and require no landing pad. */
3113 switch (region->type)
3116 /* A cleanup adds a zero filter to the beginning of the chain, but
3117 there are special cases to look out for. If there are *only*
3118 cleanups along a path, then it compresses to a zero action.
3119 Further, if there are multiple cleanups along a path, we only
3120 need to represent one of them, as that is enough to trigger
3121 entry to the landing pad at runtime. */
3122 next = collect_one_action_chain (ar_hash, region->outer);
3125 for (c = region->outer; c ; c = c->outer)
3126 if (c->type == ERT_CLEANUP)
3128 return add_action_record (ar_hash, 0, next);
3131 /* Process the associated catch regions in reverse order.
3132 If there's a catch-all handler, then we don't need to
3133 search outer regions. Use a magic -3 value to record
3134 that we havn't done the outer search. */
3136 for (c = region->u.try.last_catch; c ; c = c->u.catch.prev_catch)
3138 if (c->u.catch.type == NULL)
3139 next = add_action_record (ar_hash, c->u.catch.filter, 0);
3144 next = collect_one_action_chain (ar_hash, region->outer);
3148 next = add_action_record (ar_hash, c->u.catch.filter, next);
3153 case ERT_ALLOWED_EXCEPTIONS:
3154 /* An exception specification adds its filter to the
3155 beginning of the chain. */
3156 next = collect_one_action_chain (ar_hash, region->outer);
3157 return add_action_record (ar_hash, region->u.allowed.filter,
3158 next < 0 ? 0 : next);
3160 case ERT_MUST_NOT_THROW:
3161 /* A must-not-throw region with no inner handlers or cleanups
3162 requires no call-site entry. Note that this differs from
3163 the no handler or cleanup case in that we do require an lsda
3164 to be generated. Return a magic -2 value to record this. */
3169 /* CATCH regions are handled in TRY above. THROW regions are
3170 for optimization information only and produce no output. */
3171 return collect_one_action_chain (ar_hash, region->outer);
3179 add_call_site (landing_pad, action)
3183 struct call_site_record *data = cfun->eh->call_site_data;
3184 int used = cfun->eh->call_site_data_used;
3185 int size = cfun->eh->call_site_data_size;
3189 size = (size ? size * 2 : 64);
3190 data = (struct call_site_record *)
3191 xrealloc (data, sizeof (*data) * size);
3192 cfun->eh->call_site_data = data;
3193 cfun->eh->call_site_data_size = size;
3196 data[used].landing_pad = landing_pad;
3197 data[used].action = action;
3199 cfun->eh->call_site_data_used = used + 1;
3201 return used + call_site_base;
3204 /* Turn REG_EH_REGION notes back into NOTE_INSN_EH_REGION notes.
3205 The new note numbers will not refer to region numbers, but
3206 instead to call site entries. */
3209 convert_to_eh_region_ranges ()
3211 rtx insn, iter, note;
3213 int last_action = -3;
3214 rtx last_action_insn = NULL_RTX;
3215 rtx last_landing_pad = NULL_RTX;
3216 rtx first_no_action_insn = NULL_RTX;
3219 if (USING_SJLJ_EXCEPTIONS || cfun->eh->region_tree == NULL)
3222 VARRAY_UCHAR_INIT (cfun->eh->action_record_data, 64, "action_record_data");
3224 ar_hash = htab_create (31, action_record_hash, action_record_eq, free);
3226 for (iter = get_insns (); iter ; iter = NEXT_INSN (iter))
3229 struct eh_region *region;
3231 rtx this_landing_pad;
3234 if (GET_CODE (insn) == INSN
3235 && GET_CODE (PATTERN (insn)) == SEQUENCE)
3236 insn = XVECEXP (PATTERN (insn), 0, 0);
3238 note = find_reg_note (insn, REG_EH_REGION, NULL_RTX);
3241 if (! (GET_CODE (insn) == CALL_INSN
3242 || (flag_non_call_exceptions
3243 && may_trap_p (PATTERN (insn)))))
3250 if (INTVAL (XEXP (note, 0)) <= 0)
3252 region = cfun->eh->region_array[INTVAL (XEXP (note, 0))];
3253 this_action = collect_one_action_chain (ar_hash, region);
3256 /* Existence of catch handlers, or must-not-throw regions
3257 implies that an lsda is needed (even if empty). */
3258 if (this_action != -1)
3259 cfun->uses_eh_lsda = 1;
3261 /* Delay creation of region notes for no-action regions
3262 until we're sure that an lsda will be required. */
3263 else if (last_action == -3)
3265 first_no_action_insn = iter;
3269 /* Cleanups and handlers may share action chains but not
3270 landing pads. Collect the landing pad for this region. */
3271 if (this_action >= 0)
3273 struct eh_region *o;
3274 for (o = region; ! o->landing_pad ; o = o->outer)
3276 this_landing_pad = o->landing_pad;
3279 this_landing_pad = NULL_RTX;
3281 /* Differing actions or landing pads implies a change in call-site
3282 info, which implies some EH_REGION note should be emitted. */
3283 if (last_action != this_action
3284 || last_landing_pad != this_landing_pad)
3286 /* If we'd not seen a previous action (-3) or the previous
3287 action was must-not-throw (-2), then we do not need an
3289 if (last_action >= -1)
3291 /* If we delayed the creation of the begin, do it now. */
3292 if (first_no_action_insn)
3294 call_site = add_call_site (NULL_RTX, 0);
3295 note = emit_note_before (NOTE_INSN_EH_REGION_BEG,
3296 first_no_action_insn);
3297 NOTE_EH_HANDLER (note) = call_site;
3298 first_no_action_insn = NULL_RTX;
3301 note = emit_note_after (NOTE_INSN_EH_REGION_END,
3303 NOTE_EH_HANDLER (note) = call_site;
3306 /* If the new action is must-not-throw, then no region notes
3308 if (this_action >= -1)
3310 call_site = add_call_site (this_landing_pad,
3311 this_action < 0 ? 0 : this_action);
3312 note = emit_note_before (NOTE_INSN_EH_REGION_BEG, iter);
3313 NOTE_EH_HANDLER (note) = call_site;
3316 last_action = this_action;
3317 last_landing_pad = this_landing_pad;
3319 last_action_insn = iter;
3322 if (last_action >= -1 && ! first_no_action_insn)
3324 note = emit_note_after (NOTE_INSN_EH_REGION_END, last_action_insn);
3325 NOTE_EH_HANDLER (note) = call_site;
3328 htab_delete (ar_hash);
3333 push_uleb128 (data_area, value)
3334 varray_type *data_area;
3339 unsigned char byte = value & 0x7f;
3343 VARRAY_PUSH_UCHAR (*data_area, byte);
3349 push_sleb128 (data_area, value)
3350 varray_type *data_area;
3358 byte = value & 0x7f;
3360 more = ! ((value == 0 && (byte & 0x40) == 0)
3361 || (value == -1 && (byte & 0x40) != 0));
3364 VARRAY_PUSH_UCHAR (*data_area, byte);
3370 #define DW_EH_PE_absptr 0x00
3371 #define DW_EH_PE_omit 0xff
3373 #define DW_EH_PE_uleb128 0x01
3374 #define DW_EH_PE_udata2 0x02
3375 #define DW_EH_PE_udata4 0x03
3376 #define DW_EH_PE_udata8 0x04
3377 #define DW_EH_PE_sleb128 0x09
3378 #define DW_EH_PE_sdata2 0x0A
3379 #define DW_EH_PE_sdata4 0x0B
3380 #define DW_EH_PE_sdata8 0x0C
3381 #define DW_EH_PE_signed 0x08
3383 #define DW_EH_PE_pcrel 0x10
3384 #define DW_EH_PE_textrel 0x20
3385 #define DW_EH_PE_datarel 0x30
3386 #define DW_EH_PE_funcrel 0x40
3389 eh_data_format_name (format)
3394 case DW_EH_PE_absptr: return "absolute";
3395 case DW_EH_PE_omit: return "omit";
3397 case DW_EH_PE_uleb128: return "uleb128";
3398 case DW_EH_PE_udata2: return "udata2";
3399 case DW_EH_PE_udata4: return "udata4";
3400 case DW_EH_PE_udata8: return "udata8";
3401 case DW_EH_PE_sleb128: return "sleb128";
3402 case DW_EH_PE_sdata2: return "sdata2";
3403 case DW_EH_PE_sdata4: return "sdata4";
3404 case DW_EH_PE_sdata8: return "sdata8";
3406 case DW_EH_PE_uleb128 | DW_EH_PE_pcrel: return "pcrel uleb128";
3407 case DW_EH_PE_udata2 | DW_EH_PE_pcrel: return "pcrel udata2";
3408 case DW_EH_PE_udata4 | DW_EH_PE_pcrel: return "pcrel udata4";
3409 case DW_EH_PE_udata8 | DW_EH_PE_pcrel: return "pcrel udata8";
3410 case DW_EH_PE_sleb128 | DW_EH_PE_pcrel: return "pcrel sleb128";
3411 case DW_EH_PE_sdata2 | DW_EH_PE_pcrel: return "pcrel sdata2";
3412 case DW_EH_PE_sdata4 | DW_EH_PE_pcrel: return "pcrel sdata4";
3413 case DW_EH_PE_sdata8 | DW_EH_PE_pcrel: return "pcrel sdata8";
3415 case DW_EH_PE_uleb128 | DW_EH_PE_textrel: return "textrel uleb128";
3416 case DW_EH_PE_udata2 | DW_EH_PE_textrel: return "textrel udata2";
3417 case DW_EH_PE_udata4 | DW_EH_PE_textrel: return "textrel udata4";
3418 case DW_EH_PE_udata8 | DW_EH_PE_textrel: return "textrel udata8";
3419 case DW_EH_PE_sleb128 | DW_EH_PE_textrel: return "textrel sleb128";
3420 case DW_EH_PE_sdata2 | DW_EH_PE_textrel: return "textrel sdata2";
3421 case DW_EH_PE_sdata4 | DW_EH_PE_textrel: return "textrel sdata4";
3422 case DW_EH_PE_sdata8 | DW_EH_PE_textrel: return "textrel sdata8";
3424 case DW_EH_PE_uleb128 | DW_EH_PE_datarel: return "datarel uleb128";
3425 case DW_EH_PE_udata2 | DW_EH_PE_datarel: return "datarel udata2";
3426 case DW_EH_PE_udata4 | DW_EH_PE_datarel: return "datarel udata4";
3427 case DW_EH_PE_udata8 | DW_EH_PE_datarel: return "datarel udata8";
3428 case DW_EH_PE_sleb128 | DW_EH_PE_datarel: return "datarel sleb128";
3429 case DW_EH_PE_sdata2 | DW_EH_PE_datarel: return "datarel sdata2";
3430 case DW_EH_PE_sdata4 | DW_EH_PE_datarel: return "datarel sdata4";
3431 case DW_EH_PE_sdata8 | DW_EH_PE_datarel: return "datarel sdata8";
3433 case DW_EH_PE_uleb128 | DW_EH_PE_funcrel: return "funcrel uleb128";
3434 case DW_EH_PE_udata2 | DW_EH_PE_funcrel: return "funcrel udata2";
3435 case DW_EH_PE_udata4 | DW_EH_PE_funcrel: return "funcrel udata4";
3436 case DW_EH_PE_udata8 | DW_EH_PE_funcrel: return "funcrel udata8";
3437 case DW_EH_PE_sleb128 | DW_EH_PE_funcrel: return "funcrel sleb128";
3438 case DW_EH_PE_sdata2 | DW_EH_PE_funcrel: return "funcrel sdata2";
3439 case DW_EH_PE_sdata4 | DW_EH_PE_funcrel: return "funcrel sdata4";
3440 case DW_EH_PE_sdata8 | DW_EH_PE_funcrel: return "funcrel sdata8";
3447 #ifndef HAVE_AS_LEB128
3449 dw2_size_of_call_site_table ()
3451 int n = cfun->eh->call_site_data_used;
3452 int size = n * (4 + 4 + 4);
3455 for (i = 0; i < n; ++i)
3457 struct call_site_record *cs = &cfun->eh->call_site_data[i];
3458 size += size_of_uleb128 (cs->action);
3465 sjlj_size_of_call_site_table ()
3467 int n = cfun->eh->call_site_data_used;
3471 for (i = 0; i < n; ++i)
3473 struct call_site_record *cs = &cfun->eh->call_site_data[i];
3474 size += size_of_uleb128 (INTVAL (cs->landing_pad));
3475 size += size_of_uleb128 (cs->action);
3483 dw2_output_call_site_table ()
3485 const char *function_start_lab
3486 = IDENTIFIER_POINTER (current_function_func_begin_label);
3487 int n = cfun->eh->call_site_data_used;
3490 for (i = 0; i < n; ++i)
3492 struct call_site_record *cs = &cfun->eh->call_site_data[i];
3493 char reg_start_lab[32];
3494 char reg_end_lab[32];
3495 char landing_pad_lab[32];
3497 ASM_GENERATE_INTERNAL_LABEL (reg_start_lab, "LEHB", call_site_base + i);
3498 ASM_GENERATE_INTERNAL_LABEL (reg_end_lab, "LEHE", call_site_base + i);
3500 if (cs->landing_pad)
3501 ASM_GENERATE_INTERNAL_LABEL (landing_pad_lab, "L",
3502 CODE_LABEL_NUMBER (cs->landing_pad));
3504 /* ??? Perhaps use insn length scaling if the assembler supports
3505 generic arithmetic. */
3506 /* ??? Perhaps use attr_length to choose data1 or data2 instead of
3507 data4 if the function is small enough. */
3508 #ifdef HAVE_AS_LEB128
3509 dw2_asm_output_delta_uleb128 (reg_start_lab, function_start_lab,
3510 "region %d start", i);
3511 dw2_asm_output_delta_uleb128 (reg_end_lab, reg_start_lab,
3513 if (cs->landing_pad)
3514 dw2_asm_output_delta_uleb128 (landing_pad_lab, function_start_lab,
3517 dw2_asm_output_data_uleb128 (0, "landing pad");
3519 dw2_asm_output_delta (4, reg_start_lab, function_start_lab,
3520 "region %d start", i);
3521 dw2_asm_output_delta (4, reg_end_lab, reg_start_lab, "length");
3522 if (cs->landing_pad)
3523 dw2_asm_output_delta (4, landing_pad_lab, function_start_lab,
3526 dw2_asm_output_data (4, 0, "landing pad");
3528 dw2_asm_output_data_uleb128 (cs->action, "action");
3531 call_site_base += n;
3535 sjlj_output_call_site_table ()
3537 int n = cfun->eh->call_site_data_used;
3540 for (i = 0; i < n; ++i)
3542 struct call_site_record *cs = &cfun->eh->call_site_data[i];
3544 dw2_asm_output_data_uleb128 (INTVAL (cs->landing_pad),
3545 "region %d landing pad", i);
3546 dw2_asm_output_data_uleb128 (cs->action, "action");
3549 call_site_base += n;
3553 output_function_exception_table ()
3556 #ifdef HAVE_AS_LEB128
3557 char ttype_label[32];
3558 char cs_after_size_label[32];
3559 char cs_end_label[32];
3566 /* Not all functions need anything. */
3567 if (! cfun->uses_eh_lsda)
3570 funcdef_number = (USING_SJLJ_EXCEPTIONS
3571 ? sjlj_funcdef_number
3572 : current_funcdef_number);
3574 exception_section ();
3576 have_tt_data = (VARRAY_ACTIVE_SIZE (cfun->eh->ttype_data) > 0
3577 || VARRAY_ACTIVE_SIZE (cfun->eh->ehspec_data) > 0);
3580 assemble_eh_align (GET_MODE_ALIGNMENT (ptr_mode));
3582 ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LLSDA", funcdef_number);
3584 /* The LSDA header. */
3586 /* Indicate the format of the landing pad start pointer. An omitted
3587 field implies @LPStart == @Start. */
3588 /* Currently we always put @LPStart == @Start. This field would
3589 be most useful in moving the landing pads completely out of
3590 line to another section, but it could also be used to minimize
3591 the size of uleb128 landing pad offsets. */
3592 format = DW_EH_PE_omit;
3593 dw2_asm_output_data (1, format, "@LPStart format (%s)",
3594 eh_data_format_name (format));
3596 /* @LPStart pointer would go here. */
3598 /* Indicate the format of the @TType entries. */
3600 format = DW_EH_PE_omit;
3603 /* ??? Define a ASM_PREFERRED_DATA_FORMAT to say what
3604 sort of dynamic-relocation-free reference to emit. */
3606 #ifdef HAVE_AS_LEB128
3607 ASM_GENERATE_INTERNAL_LABEL (ttype_label, "LLSDATT", funcdef_number);
3610 dw2_asm_output_data (1, format, "@TType format (%s)",
3611 eh_data_format_name (format));
3613 #ifndef HAVE_AS_LEB128
3614 if (USING_SJLJ_EXCEPTIONS)
3615 call_site_len = sjlj_size_of_call_site_table ();
3617 call_site_len = dw2_size_of_call_site_table ();
3620 /* A pc-relative 4-byte displacement to the @TType data. */
3623 #ifdef HAVE_AS_LEB128
3624 char ttype_after_disp_label[32];
3625 ASM_GENERATE_INTERNAL_LABEL (ttype_after_disp_label, "LLSDATTD",
3627 dw2_asm_output_delta_uleb128 (ttype_label, ttype_after_disp_label,
3628 "@TType base offset");
3629 ASM_OUTPUT_LABEL (asm_out_file, ttype_after_disp_label);
3631 /* Ug. Alignment queers things. */
3632 unsigned int before_disp, after_disp, last_disp, disp, align;
3634 align = POINTER_SIZE / BITS_PER_UNIT;
3635 before_disp = 1 + 1;
3636 after_disp = (1 + size_of_uleb128 (call_site_len)
3638 + VARRAY_ACTIVE_SIZE (cfun->eh->action_record_data)
3639 + VARRAY_ACTIVE_SIZE (cfun->eh->ttype_data) * align);
3644 unsigned int disp_size, pad;
3647 disp_size = size_of_uleb128 (disp);
3648 pad = before_disp + disp_size + after_disp;
3650 pad = align - (pad % align);
3653 disp = after_disp + pad;
3655 while (disp != last_disp);
3657 dw2_asm_output_data_uleb128 (disp, "@TType base offset");
3661 /* Indicate the format of the call-site offsets. */
3662 #ifdef HAVE_AS_LEB128
3663 format = DW_EH_PE_uleb128;
3665 format = DW_EH_PE_udata4;
3667 dw2_asm_output_data (1, format, "call-site format (%s)",
3668 eh_data_format_name (format));
3670 #ifdef HAVE_AS_LEB128
3671 ASM_GENERATE_INTERNAL_LABEL (cs_after_size_label, "LLSDACSB",
3673 ASM_GENERATE_INTERNAL_LABEL (cs_end_label, "LLSDACSE",
3675 dw2_asm_output_delta_uleb128 (cs_end_label, cs_after_size_label,
3676 "Call-site table length");
3677 ASM_OUTPUT_LABEL (asm_out_file, cs_after_size_label);
3678 if (USING_SJLJ_EXCEPTIONS)
3679 sjlj_output_call_site_table ();
3681 dw2_output_call_site_table ();
3682 ASM_OUTPUT_LABEL (asm_out_file, cs_end_label);
3684 dw2_asm_output_data_uleb128 (call_site_len,"Call-site table length");
3685 if (USING_SJLJ_EXCEPTIONS)
3686 sjlj_output_call_site_table ();
3688 dw2_output_call_site_table ();
3691 /* ??? Decode and interpret the data for flag_debug_asm. */
3692 n = VARRAY_ACTIVE_SIZE (cfun->eh->action_record_data);
3693 for (i = 0; i < n; ++i)
3694 dw2_asm_output_data (1, VARRAY_UCHAR (cfun->eh->action_record_data, i),
3695 (i ? NULL : "Action record table"));
3698 assemble_eh_align (GET_MODE_ALIGNMENT (ptr_mode));
3700 i = VARRAY_ACTIVE_SIZE (cfun->eh->ttype_data);
3703 tree type = VARRAY_TREE (cfun->eh->ttype_data, i);
3705 if (type == NULL_TREE)
3706 type = integer_zero_node;
3708 type = lookup_type_for_runtime (type);
3710 /* ??? Handle ASM_PREFERRED_DATA_FORMAT. */
3711 output_constant (type, GET_MODE_SIZE (ptr_mode));
3714 #ifdef HAVE_AS_LEB128
3716 ASM_OUTPUT_LABEL (asm_out_file, ttype_label);
3719 /* ??? Decode and interpret the data for flag_debug_asm. */
3720 n = VARRAY_ACTIVE_SIZE (cfun->eh->ehspec_data);
3721 for (i = 0; i < n; ++i)
3722 dw2_asm_output_data (1, VARRAY_UCHAR (cfun->eh->ehspec_data, i),
3723 (i ? NULL : "Exception specification table"));
3725 function_section (current_function_decl);
3727 if (USING_SJLJ_EXCEPTIONS)
3728 sjlj_funcdef_number += 1;