]>
Commit | Line | Data |
---|---|---|
12670d88 | 1 | /* Implements exception handling. |
3f2c5d1a | 2 | Copyright (C) 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
3897f229 | 3 | 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc. |
4956d07c MS |
4 | Contributed by Mike Stump <mrs@cygnus.com>. |
5 | ||
1322177d | 6 | This file is part of GCC. |
4956d07c | 7 | |
1322177d LB |
8 | GCC is free software; you can redistribute it and/or modify it under |
9 | the terms of the GNU General Public License as published by the Free | |
10 | Software Foundation; either version 2, or (at your option) any later | |
11 | version. | |
4956d07c | 12 | |
1322177d LB |
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
4956d07c MS |
17 | |
18 | You should have received a copy of the GNU General Public License | |
1322177d LB |
19 | along with GCC; see the file COPYING. If not, write to the Free |
20 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
21 | 02111-1307, USA. */ | |
4956d07c MS |
22 | |
23 | ||
12670d88 RK |
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 | |
956d6950 | 27 | be transferred to any arbitrary code associated with a function call |
12670d88 RK |
28 | several levels up the stack. |
29 | ||
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. | |
39 | ||
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. | |
46 | ||
52a11cbf | 47 | [ Add updated documentation on how to use this. ] */ |
4956d07c MS |
48 | |
49 | ||
50 | #include "config.h" | |
670ee920 | 51 | #include "system.h" |
4977bab6 ZW |
52 | #include "coretypes.h" |
53 | #include "tm.h" | |
4956d07c MS |
54 | #include "rtl.h" |
55 | #include "tree.h" | |
56 | #include "flags.h" | |
4956d07c | 57 | #include "function.h" |
4956d07c | 58 | #include "expr.h" |
e78d8e51 | 59 | #include "libfuncs.h" |
4956d07c | 60 | #include "insn-config.h" |
52a11cbf RH |
61 | #include "except.h" |
62 | #include "integrate.h" | |
63 | #include "hard-reg-set.h" | |
64 | #include "basic-block.h" | |
4956d07c | 65 | #include "output.h" |
52a11cbf RH |
66 | #include "dwarf2asm.h" |
67 | #include "dwarf2out.h" | |
2a1ee410 | 68 | #include "dwarf2.h" |
10f0ad3d | 69 | #include "toplev.h" |
52a11cbf | 70 | #include "hashtab.h" |
2b12ffe0 | 71 | #include "intl.h" |
87ff9c8e | 72 | #include "ggc.h" |
b1474bb7 | 73 | #include "tm_p.h" |
07c9d2eb | 74 | #include "target.h" |
f1e639b1 | 75 | #include "langhooks.h" |
dd07abd7 | 76 | #include "cgraph.h" |
52a11cbf RH |
77 | |
78 | /* Provide defaults for stuff that may not be defined when using | |
79 | sjlj exceptions. */ | |
52a11cbf RH |
80 | #ifndef EH_RETURN_DATA_REGNO |
81 | #define EH_RETURN_DATA_REGNO(N) INVALID_REGNUM | |
461fc4de RH |
82 | #endif |
83 | ||
27a36778 | 84 | |
52a11cbf RH |
85 | /* Nonzero means enable synchronous exceptions for non-call instructions. */ |
86 | int flag_non_call_exceptions; | |
27a36778 | 87 | |
52a11cbf RH |
88 | /* Protect cleanup actions with must-not-throw regions, with a call |
89 | to the given failure handler. */ | |
502b8322 | 90 | tree (*lang_protect_cleanup_actions) (void); |
27a36778 | 91 | |
52a11cbf | 92 | /* Return true if type A catches type B. */ |
502b8322 | 93 | int (*lang_eh_type_covers) (tree a, tree b); |
27a36778 | 94 | |
52a11cbf | 95 | /* Map a type to a runtime object to match type. */ |
502b8322 | 96 | tree (*lang_eh_runtime_type) (tree); |
4956d07c | 97 | |
6a58eee9 RH |
98 | /* A hash table of label to region number. */ |
99 | ||
e2500fed | 100 | struct ehl_map_entry GTY(()) |
6a58eee9 RH |
101 | { |
102 | rtx label; | |
103 | struct eh_region *region; | |
104 | }; | |
105 | ||
21c157b4 | 106 | static GTY(()) int call_site_base; |
e2500fed GK |
107 | static GTY ((param_is (union tree_node))) |
108 | htab_t type_to_runtime_map; | |
52a11cbf RH |
109 | |
110 | /* Describe the SjLj_Function_Context structure. */ | |
e2500fed | 111 | static GTY(()) tree sjlj_fc_type_node; |
52a11cbf RH |
112 | static int sjlj_fc_call_site_ofs; |
113 | static int sjlj_fc_data_ofs; | |
114 | static int sjlj_fc_personality_ofs; | |
115 | static int sjlj_fc_lsda_ofs; | |
116 | static int sjlj_fc_jbuf_ofs; | |
117 | \f | |
118 | /* Describes one exception region. */ | |
e2500fed | 119 | struct eh_region GTY(()) |
52a11cbf RH |
120 | { |
121 | /* The immediately surrounding region. */ | |
122 | struct eh_region *outer; | |
956d6950 | 123 | |
52a11cbf RH |
124 | /* The list of immediately contained regions. */ |
125 | struct eh_region *inner; | |
126 | struct eh_region *next_peer; | |
956d6950 | 127 | |
52a11cbf RH |
128 | /* An identifier for this region. */ |
129 | int region_number; | |
71038426 | 130 | |
6a58eee9 RH |
131 | /* When a region is deleted, its parents inherit the REG_EH_REGION |
132 | numbers already assigned. */ | |
133 | bitmap aka; | |
134 | ||
52a11cbf RH |
135 | /* Each region does exactly one thing. */ |
136 | enum eh_region_type | |
137 | { | |
572202a7 RK |
138 | ERT_UNKNOWN = 0, |
139 | ERT_CLEANUP, | |
52a11cbf RH |
140 | ERT_TRY, |
141 | ERT_CATCH, | |
142 | ERT_ALLOWED_EXCEPTIONS, | |
143 | ERT_MUST_NOT_THROW, | |
144 | ERT_THROW, | |
145 | ERT_FIXUP | |
146 | } type; | |
147 | ||
eaec9b3d | 148 | /* Holds the action to perform based on the preceding type. */ |
e2500fed | 149 | union eh_region_u { |
52a11cbf RH |
150 | /* A list of catch blocks, a surrounding try block, |
151 | and the label for continuing after a catch. */ | |
e2500fed | 152 | struct eh_region_u_try { |
52a11cbf RH |
153 | struct eh_region *catch; |
154 | struct eh_region *last_catch; | |
155 | struct eh_region *prev_try; | |
156 | rtx continue_label; | |
e2500fed | 157 | } GTY ((tag ("ERT_TRY"))) try; |
52a11cbf | 158 | |
6d41a92f OH |
159 | /* The list through the catch handlers, the list of type objects |
160 | matched, and the list of associated filters. */ | |
e2500fed | 161 | struct eh_region_u_catch { |
52a11cbf RH |
162 | struct eh_region *next_catch; |
163 | struct eh_region *prev_catch; | |
6d41a92f OH |
164 | tree type_list; |
165 | tree filter_list; | |
e2500fed | 166 | } GTY ((tag ("ERT_CATCH"))) catch; |
52a11cbf RH |
167 | |
168 | /* A tree_list of allowed types. */ | |
e2500fed | 169 | struct eh_region_u_allowed { |
52a11cbf RH |
170 | tree type_list; |
171 | int filter; | |
e2500fed | 172 | } GTY ((tag ("ERT_ALLOWED_EXCEPTIONS"))) allowed; |
52a11cbf | 173 | |
3f2c5d1a | 174 | /* The type given by a call to "throw foo();", or discovered |
52a11cbf | 175 | for a throw. */ |
e2500fed | 176 | struct eh_region_u_throw { |
52a11cbf | 177 | tree type; |
e2500fed | 178 | } GTY ((tag ("ERT_THROW"))) throw; |
52a11cbf RH |
179 | |
180 | /* Retain the cleanup expression even after expansion so that | |
181 | we can match up fixup regions. */ | |
e2500fed | 182 | struct eh_region_u_cleanup { |
52a11cbf | 183 | tree exp; |
bafb714b | 184 | struct eh_region *prev_try; |
e2500fed | 185 | } GTY ((tag ("ERT_CLEANUP"))) cleanup; |
52a11cbf RH |
186 | |
187 | /* The real region (by expression and by pointer) that fixup code | |
188 | should live in. */ | |
e2500fed | 189 | struct eh_region_u_fixup { |
52a11cbf RH |
190 | tree cleanup_exp; |
191 | struct eh_region *real_region; | |
1bddbeb4 | 192 | bool resolved; |
e2500fed GK |
193 | } GTY ((tag ("ERT_FIXUP"))) fixup; |
194 | } GTY ((desc ("%0.type"))) u; | |
52a11cbf | 195 | |
47c84870 JM |
196 | /* Entry point for this region's handler before landing pads are built. */ |
197 | rtx label; | |
52a11cbf | 198 | |
47c84870 | 199 | /* Entry point for this region's handler from the runtime eh library. */ |
52a11cbf RH |
200 | rtx landing_pad; |
201 | ||
47c84870 | 202 | /* Entry point for this region's handler from an inner region. */ |
52a11cbf | 203 | rtx post_landing_pad; |
47c84870 JM |
204 | |
205 | /* The RESX insn for handing off control to the next outermost handler, | |
206 | if appropriate. */ | |
207 | rtx resume; | |
b2dd096b MM |
208 | |
209 | /* True if something in this region may throw. */ | |
210 | unsigned may_contain_throw : 1; | |
52a11cbf | 211 | }; |
71038426 | 212 | |
e2500fed GK |
213 | struct call_site_record GTY(()) |
214 | { | |
215 | rtx landing_pad; | |
216 | int action; | |
217 | }; | |
218 | ||
52a11cbf | 219 | /* Used to save exception status for each function. */ |
e2500fed | 220 | struct eh_status GTY(()) |
52a11cbf RH |
221 | { |
222 | /* The tree of all regions for this function. */ | |
223 | struct eh_region *region_tree; | |
e6cfb550 | 224 | |
52a11cbf | 225 | /* The same information as an indexable array. */ |
e2500fed | 226 | struct eh_region ** GTY ((length ("%h.last_region_number"))) region_array; |
e6cfb550 | 227 | |
52a11cbf RH |
228 | /* The most recently open region. */ |
229 | struct eh_region *cur_region; | |
e6cfb550 | 230 | |
52a11cbf RH |
231 | /* This is the region for which we are processing catch blocks. */ |
232 | struct eh_region *try_region; | |
71038426 | 233 | |
52a11cbf RH |
234 | rtx filter; |
235 | rtx exc_ptr; | |
4956d07c | 236 | |
52a11cbf RH |
237 | int built_landing_pads; |
238 | int last_region_number; | |
e6cfb550 | 239 | |
52a11cbf RH |
240 | varray_type ttype_data; |
241 | varray_type ehspec_data; | |
242 | varray_type action_record_data; | |
6814a8a0 | 243 | |
e2500fed GK |
244 | htab_t GTY ((param_is (struct ehl_map_entry))) exception_handler_label_map; |
245 | ||
502b8322 | 246 | struct call_site_record * GTY ((length ("%h.call_site_data_used"))) |
e2500fed | 247 | call_site_data; |
52a11cbf RH |
248 | int call_site_data_used; |
249 | int call_site_data_size; | |
250 | ||
251 | rtx ehr_stackadj; | |
252 | rtx ehr_handler; | |
253 | rtx ehr_label; | |
254 | ||
255 | rtx sjlj_fc; | |
256 | rtx sjlj_exit_after; | |
257 | }; | |
e6cfb550 | 258 | |
52a11cbf | 259 | \f |
502b8322 AJ |
260 | static int t2r_eq (const void *, const void *); |
261 | static hashval_t t2r_hash (const void *); | |
262 | static void add_type_for_runtime (tree); | |
263 | static tree lookup_type_for_runtime (tree); | |
264 | ||
265 | static struct eh_region *expand_eh_region_end (void); | |
266 | ||
267 | static rtx get_exception_filter (struct function *); | |
268 | ||
269 | static void collect_eh_region_array (void); | |
270 | static void resolve_fixup_regions (void); | |
271 | static void remove_fixup_regions (void); | |
272 | static void remove_unreachable_regions (rtx); | |
273 | static void convert_from_eh_region_ranges_1 (rtx *, int *, int); | |
274 | ||
275 | static struct eh_region *duplicate_eh_region_1 (struct eh_region *, | |
276 | struct inline_remap *); | |
277 | static void duplicate_eh_region_2 (struct eh_region *, struct eh_region **); | |
278 | static int ttypes_filter_eq (const void *, const void *); | |
279 | static hashval_t ttypes_filter_hash (const void *); | |
280 | static int ehspec_filter_eq (const void *, const void *); | |
281 | static hashval_t ehspec_filter_hash (const void *); | |
282 | static int add_ttypes_entry (htab_t, tree); | |
283 | static int add_ehspec_entry (htab_t, htab_t, tree); | |
284 | static void assign_filter_values (void); | |
285 | static void build_post_landing_pads (void); | |
286 | static void connect_post_landing_pads (void); | |
287 | static void dw2_build_landing_pads (void); | |
52a11cbf RH |
288 | |
289 | struct sjlj_lp_info; | |
502b8322 AJ |
290 | static bool sjlj_find_directly_reachable_regions (struct sjlj_lp_info *); |
291 | static void sjlj_assign_call_site_values (rtx, struct sjlj_lp_info *); | |
292 | static void sjlj_mark_call_sites (struct sjlj_lp_info *); | |
293 | static void sjlj_emit_function_enter (rtx); | |
294 | static void sjlj_emit_function_exit (void); | |
295 | static void sjlj_emit_dispatch_table (rtx, struct sjlj_lp_info *); | |
296 | static void sjlj_build_landing_pads (void); | |
297 | ||
298 | static hashval_t ehl_hash (const void *); | |
299 | static int ehl_eq (const void *, const void *); | |
300 | static void add_ehl_entry (rtx, struct eh_region *); | |
301 | static void remove_exception_handler_label (rtx); | |
302 | static void remove_eh_handler (struct eh_region *); | |
303 | static int for_each_eh_label_1 (void **, void *); | |
52a11cbf RH |
304 | |
305 | struct reachable_info; | |
306 | ||
307 | /* The return value of reachable_next_level. */ | |
308 | enum reachable_code | |
309 | { | |
310 | /* The given exception is not processed by the given region. */ | |
311 | RNL_NOT_CAUGHT, | |
312 | /* The given exception may need processing by the given region. */ | |
313 | RNL_MAYBE_CAUGHT, | |
314 | /* The given exception is completely processed by the given region. */ | |
315 | RNL_CAUGHT, | |
316 | /* The given exception is completely processed by the runtime. */ | |
317 | RNL_BLOCKED | |
318 | }; | |
e6cfb550 | 319 | |
502b8322 AJ |
320 | static int check_handled (tree, tree); |
321 | static void add_reachable_handler (struct reachable_info *, | |
322 | struct eh_region *, struct eh_region *); | |
323 | static enum reachable_code reachable_next_level (struct eh_region *, tree, | |
324 | struct reachable_info *); | |
325 | ||
326 | static int action_record_eq (const void *, const void *); | |
327 | static hashval_t action_record_hash (const void *); | |
328 | static int add_action_record (htab_t, int, int); | |
329 | static int collect_one_action_chain (htab_t, struct eh_region *); | |
330 | static int add_call_site (rtx, int); | |
331 | ||
332 | static void push_uleb128 (varray_type *, unsigned int); | |
333 | static void push_sleb128 (varray_type *, int); | |
52a11cbf | 334 | #ifndef HAVE_AS_LEB128 |
502b8322 AJ |
335 | static int dw2_size_of_call_site_table (void); |
336 | static int sjlj_size_of_call_site_table (void); | |
52a11cbf | 337 | #endif |
502b8322 AJ |
338 | static void dw2_output_call_site_table (void); |
339 | static void sjlj_output_call_site_table (void); | |
e6cfb550 | 340 | |
52a11cbf RH |
341 | \f |
342 | /* Routine to see if exception handling is turned on. | |
cc2902df | 343 | DO_WARN is nonzero if we want to inform the user that exception |
3f2c5d1a | 344 | handling is turned off. |
4956d07c | 345 | |
52a11cbf RH |
346 | This is used to ensure that -fexceptions has been specified if the |
347 | compiler tries to use any exception-specific functions. */ | |
4956d07c | 348 | |
52a11cbf | 349 | int |
502b8322 | 350 | doing_eh (int do_warn) |
52a11cbf RH |
351 | { |
352 | if (! flag_exceptions) | |
353 | { | |
354 | static int warned = 0; | |
355 | if (! warned && do_warn) | |
356 | { | |
357 | error ("exception handling disabled, use -fexceptions to enable"); | |
358 | warned = 1; | |
359 | } | |
360 | return 0; | |
361 | } | |
362 | return 1; | |
4956d07c MS |
363 | } |
364 | ||
52a11cbf RH |
365 | \f |
366 | void | |
502b8322 | 367 | init_eh (void) |
4956d07c | 368 | { |
52a11cbf RH |
369 | if (! flag_exceptions) |
370 | return; | |
4956d07c | 371 | |
e2500fed | 372 | type_to_runtime_map = htab_create_ggc (31, t2r_hash, t2r_eq, NULL); |
4956d07c | 373 | |
52a11cbf RH |
374 | /* Create the SjLj_Function_Context structure. This should match |
375 | the definition in unwind-sjlj.c. */ | |
376 | if (USING_SJLJ_EXCEPTIONS) | |
377 | { | |
378 | tree f_jbuf, f_per, f_lsda, f_prev, f_cs, f_data, tmp; | |
4956d07c | 379 | |
ae2bcd98 | 380 | sjlj_fc_type_node = lang_hooks.types.make_type (RECORD_TYPE); |
9a0d1e1b | 381 | |
52a11cbf RH |
382 | f_prev = build_decl (FIELD_DECL, get_identifier ("__prev"), |
383 | build_pointer_type (sjlj_fc_type_node)); | |
384 | DECL_FIELD_CONTEXT (f_prev) = sjlj_fc_type_node; | |
9a0d1e1b | 385 | |
52a11cbf RH |
386 | f_cs = build_decl (FIELD_DECL, get_identifier ("__call_site"), |
387 | integer_type_node); | |
388 | DECL_FIELD_CONTEXT (f_cs) = sjlj_fc_type_node; | |
4956d07c | 389 | |
52a11cbf | 390 | tmp = build_index_type (build_int_2 (4 - 1, 0)); |
ae2bcd98 | 391 | tmp = build_array_type (lang_hooks.types.type_for_mode (word_mode, 1), |
b0c48229 | 392 | tmp); |
52a11cbf RH |
393 | f_data = build_decl (FIELD_DECL, get_identifier ("__data"), tmp); |
394 | DECL_FIELD_CONTEXT (f_data) = sjlj_fc_type_node; | |
9a0d1e1b | 395 | |
52a11cbf RH |
396 | f_per = build_decl (FIELD_DECL, get_identifier ("__personality"), |
397 | ptr_type_node); | |
398 | DECL_FIELD_CONTEXT (f_per) = sjlj_fc_type_node; | |
4956d07c | 399 | |
52a11cbf RH |
400 | f_lsda = build_decl (FIELD_DECL, get_identifier ("__lsda"), |
401 | ptr_type_node); | |
402 | DECL_FIELD_CONTEXT (f_lsda) = sjlj_fc_type_node; | |
6814a8a0 | 403 | |
52a11cbf RH |
404 | #ifdef DONT_USE_BUILTIN_SETJMP |
405 | #ifdef JMP_BUF_SIZE | |
406 | tmp = build_int_2 (JMP_BUF_SIZE - 1, 0); | |
407 | #else | |
408 | /* Should be large enough for most systems, if it is not, | |
409 | JMP_BUF_SIZE should be defined with the proper value. It will | |
410 | also tend to be larger than necessary for most systems, a more | |
411 | optimal port will define JMP_BUF_SIZE. */ | |
412 | tmp = build_int_2 (FIRST_PSEUDO_REGISTER + 2 - 1, 0); | |
413 | #endif | |
414 | #else | |
83810fcb RS |
415 | /* builtin_setjmp takes a pointer to 5 words. */ |
416 | tmp = build_int_2 (5 * BITS_PER_WORD / POINTER_SIZE - 1, 0); | |
52a11cbf RH |
417 | #endif |
418 | tmp = build_index_type (tmp); | |
419 | tmp = build_array_type (ptr_type_node, tmp); | |
420 | f_jbuf = build_decl (FIELD_DECL, get_identifier ("__jbuf"), tmp); | |
421 | #ifdef DONT_USE_BUILTIN_SETJMP | |
422 | /* We don't know what the alignment requirements of the | |
423 | runtime's jmp_buf has. Overestimate. */ | |
424 | DECL_ALIGN (f_jbuf) = BIGGEST_ALIGNMENT; | |
425 | DECL_USER_ALIGN (f_jbuf) = 1; | |
426 | #endif | |
427 | DECL_FIELD_CONTEXT (f_jbuf) = sjlj_fc_type_node; | |
428 | ||
429 | TYPE_FIELDS (sjlj_fc_type_node) = f_prev; | |
430 | TREE_CHAIN (f_prev) = f_cs; | |
431 | TREE_CHAIN (f_cs) = f_data; | |
432 | TREE_CHAIN (f_data) = f_per; | |
433 | TREE_CHAIN (f_per) = f_lsda; | |
434 | TREE_CHAIN (f_lsda) = f_jbuf; | |
435 | ||
436 | layout_type (sjlj_fc_type_node); | |
437 | ||
438 | /* Cache the interesting field offsets so that we have | |
439 | easy access from rtl. */ | |
440 | sjlj_fc_call_site_ofs | |
441 | = (tree_low_cst (DECL_FIELD_OFFSET (f_cs), 1) | |
442 | + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_cs), 1) / BITS_PER_UNIT); | |
443 | sjlj_fc_data_ofs | |
444 | = (tree_low_cst (DECL_FIELD_OFFSET (f_data), 1) | |
445 | + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_data), 1) / BITS_PER_UNIT); | |
446 | sjlj_fc_personality_ofs | |
447 | = (tree_low_cst (DECL_FIELD_OFFSET (f_per), 1) | |
448 | + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_per), 1) / BITS_PER_UNIT); | |
449 | sjlj_fc_lsda_ofs | |
450 | = (tree_low_cst (DECL_FIELD_OFFSET (f_lsda), 1) | |
451 | + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_lsda), 1) / BITS_PER_UNIT); | |
452 | sjlj_fc_jbuf_ofs | |
453 | = (tree_low_cst (DECL_FIELD_OFFSET (f_jbuf), 1) | |
454 | + tree_low_cst (DECL_FIELD_BIT_OFFSET (f_jbuf), 1) / BITS_PER_UNIT); | |
455 | } | |
4956d07c MS |
456 | } |
457 | ||
52a11cbf | 458 | void |
502b8322 | 459 | init_eh_for_function (void) |
4956d07c | 460 | { |
703ad42b | 461 | cfun->eh = ggc_alloc_cleared (sizeof (struct eh_status)); |
6a58eee9 | 462 | } |
52a11cbf RH |
463 | \f |
464 | /* Start an exception handling region. All instructions emitted | |
465 | after this point are considered to be part of the region until | |
466 | expand_eh_region_end is invoked. */ | |
9a0d1e1b | 467 | |
52a11cbf | 468 | void |
502b8322 | 469 | expand_eh_region_start (void) |
9a0d1e1b | 470 | { |
52a11cbf RH |
471 | struct eh_region *new_region; |
472 | struct eh_region *cur_region; | |
473 | rtx note; | |
9a0d1e1b | 474 | |
52a11cbf RH |
475 | if (! doing_eh (0)) |
476 | return; | |
9a0d1e1b | 477 | |
52a11cbf | 478 | /* Insert a new blank region as a leaf in the tree. */ |
703ad42b | 479 | new_region = ggc_alloc_cleared (sizeof (*new_region)); |
52a11cbf RH |
480 | cur_region = cfun->eh->cur_region; |
481 | new_region->outer = cur_region; | |
482 | if (cur_region) | |
9a0d1e1b | 483 | { |
52a11cbf RH |
484 | new_region->next_peer = cur_region->inner; |
485 | cur_region->inner = new_region; | |
486 | } | |
e6cfb550 | 487 | else |
9a0d1e1b | 488 | { |
52a11cbf RH |
489 | new_region->next_peer = cfun->eh->region_tree; |
490 | cfun->eh->region_tree = new_region; | |
9a0d1e1b | 491 | } |
52a11cbf RH |
492 | cfun->eh->cur_region = new_region; |
493 | ||
494 | /* Create a note marking the start of this region. */ | |
495 | new_region->region_number = ++cfun->eh->last_region_number; | |
2e040219 | 496 | note = emit_note (NOTE_INSN_EH_REGION_BEG); |
52a11cbf | 497 | NOTE_EH_HANDLER (note) = new_region->region_number; |
9a0d1e1b AM |
498 | } |
499 | ||
52a11cbf | 500 | /* Common code to end a region. Returns the region just ended. */ |
9f8e6243 | 501 | |
52a11cbf | 502 | static struct eh_region * |
502b8322 | 503 | expand_eh_region_end (void) |
9f8e6243 | 504 | { |
52a11cbf RH |
505 | struct eh_region *cur_region = cfun->eh->cur_region; |
506 | rtx note; | |
507 | ||
a1f300c0 | 508 | /* Create a note marking the end of this region. */ |
2e040219 | 509 | note = emit_note (NOTE_INSN_EH_REGION_END); |
52a11cbf RH |
510 | NOTE_EH_HANDLER (note) = cur_region->region_number; |
511 | ||
512 | /* Pop. */ | |
513 | cfun->eh->cur_region = cur_region->outer; | |
514 | ||
52a11cbf | 515 | return cur_region; |
9f8e6243 AM |
516 | } |
517 | ||
52a11cbf RH |
518 | /* End an exception handling region for a cleanup. HANDLER is an |
519 | expression to expand for the cleanup. */ | |
9c606f69 | 520 | |
52a11cbf | 521 | void |
502b8322 | 522 | expand_eh_region_end_cleanup (tree handler) |
9c606f69 | 523 | { |
52a11cbf | 524 | struct eh_region *region; |
e6855a2d | 525 | tree protect_cleanup_actions; |
52a11cbf | 526 | rtx around_label; |
47c84870 | 527 | rtx data_save[2]; |
52a11cbf RH |
528 | |
529 | if (! doing_eh (0)) | |
530 | return; | |
9c606f69 | 531 | |
52a11cbf RH |
532 | region = expand_eh_region_end (); |
533 | region->type = ERT_CLEANUP; | |
534 | region->label = gen_label_rtx (); | |
535 | region->u.cleanup.exp = handler; | |
bafb714b | 536 | region->u.cleanup.prev_try = cfun->eh->try_region; |
9c606f69 | 537 | |
52a11cbf RH |
538 | around_label = gen_label_rtx (); |
539 | emit_jump (around_label); | |
9c606f69 | 540 | |
52a11cbf | 541 | emit_label (region->label); |
9c606f69 | 542 | |
a944ceb9 | 543 | if (flag_non_call_exceptions || region->may_contain_throw) |
b2dd096b MM |
544 | { |
545 | /* Give the language a chance to specify an action to be taken if an | |
546 | exception is thrown that would propagate out of the HANDLER. */ | |
547 | protect_cleanup_actions | |
548 | = (lang_protect_cleanup_actions | |
549 | ? (*lang_protect_cleanup_actions) () | |
550 | : NULL_TREE); | |
e6855a2d | 551 | |
b2dd096b MM |
552 | if (protect_cleanup_actions) |
553 | expand_eh_region_start (); | |
9c606f69 | 554 | |
b2dd096b MM |
555 | /* In case this cleanup involves an inline destructor with a try block in |
556 | it, we need to save the EH return data registers around it. */ | |
557 | data_save[0] = gen_reg_rtx (ptr_mode); | |
558 | emit_move_insn (data_save[0], get_exception_pointer (cfun)); | |
559 | data_save[1] = gen_reg_rtx (word_mode); | |
560 | emit_move_insn (data_save[1], get_exception_filter (cfun)); | |
47c84870 | 561 | |
b2dd096b | 562 | expand_expr (handler, const0_rtx, VOIDmode, 0); |
9c606f69 | 563 | |
b2dd096b MM |
564 | emit_move_insn (cfun->eh->exc_ptr, data_save[0]); |
565 | emit_move_insn (cfun->eh->filter, data_save[1]); | |
47c84870 | 566 | |
b2dd096b MM |
567 | if (protect_cleanup_actions) |
568 | expand_eh_region_end_must_not_throw (protect_cleanup_actions); | |
a9f0664a | 569 | |
b2dd096b MM |
570 | /* We need any stack adjustment complete before the around_label. */ |
571 | do_pending_stack_adjust (); | |
572 | } | |
c10f3adf | 573 | |
52a11cbf RH |
574 | /* We delay the generation of the _Unwind_Resume until we generate |
575 | landing pads. We emit a marker here so as to get good control | |
576 | flow data in the meantime. */ | |
47c84870 JM |
577 | region->resume |
578 | = emit_jump_insn (gen_rtx_RESX (VOIDmode, region->region_number)); | |
52a11cbf RH |
579 | emit_barrier (); |
580 | ||
52a11cbf | 581 | emit_label (around_label); |
9c606f69 AM |
582 | } |
583 | ||
52a11cbf RH |
584 | /* End an exception handling region for a try block, and prepares |
585 | for subsequent calls to expand_start_catch. */ | |
9a0d1e1b | 586 | |
52a11cbf | 587 | void |
502b8322 | 588 | expand_start_all_catch (void) |
9a0d1e1b | 589 | { |
52a11cbf | 590 | struct eh_region *region; |
9a0d1e1b | 591 | |
52a11cbf RH |
592 | if (! doing_eh (1)) |
593 | return; | |
9a0d1e1b | 594 | |
52a11cbf RH |
595 | region = expand_eh_region_end (); |
596 | region->type = ERT_TRY; | |
597 | region->u.try.prev_try = cfun->eh->try_region; | |
598 | region->u.try.continue_label = gen_label_rtx (); | |
9a0d1e1b | 599 | |
52a11cbf RH |
600 | cfun->eh->try_region = region; |
601 | ||
602 | emit_jump (region->u.try.continue_label); | |
603 | } | |
9a0d1e1b | 604 | |
ffad84cd AH |
605 | /* Begin a catch clause. TYPE is the type caught, a list of such |
606 | types, (in the case of Java) an ADDR_EXPR which points to the | |
607 | runtime type to match, or null if this is a catch-all | |
608 | clause. Providing a type list enables to associate the catch region | |
609 | with potentially several exception types, which is useful e.g. for | |
610 | Ada. */ | |
9a0d1e1b | 611 | |
52a11cbf | 612 | void |
502b8322 | 613 | expand_start_catch (tree type_or_list) |
9a0d1e1b | 614 | { |
52a11cbf | 615 | struct eh_region *t, *c, *l; |
6d41a92f | 616 | tree type_list; |
52a11cbf RH |
617 | |
618 | if (! doing_eh (0)) | |
619 | return; | |
620 | ||
6d41a92f OH |
621 | type_list = type_or_list; |
622 | ||
623 | if (type_or_list) | |
624 | { | |
625 | /* Ensure to always end up with a type list to normalize further | |
626 | processing, then register each type against the runtime types | |
627 | map. */ | |
628 | tree type_node; | |
629 | ||
630 | if (TREE_CODE (type_or_list) != TREE_LIST) | |
0fb7aeda | 631 | type_list = tree_cons (NULL_TREE, type_or_list, NULL_TREE); |
6d41a92f OH |
632 | |
633 | type_node = type_list; | |
634 | for (; type_node; type_node = TREE_CHAIN (type_node)) | |
0fb7aeda | 635 | add_type_for_runtime (TREE_VALUE (type_node)); |
6d41a92f OH |
636 | } |
637 | ||
52a11cbf RH |
638 | expand_eh_region_start (); |
639 | ||
640 | t = cfun->eh->try_region; | |
641 | c = cfun->eh->cur_region; | |
642 | c->type = ERT_CATCH; | |
6d41a92f | 643 | c->u.catch.type_list = type_list; |
52a11cbf RH |
644 | c->label = gen_label_rtx (); |
645 | ||
646 | l = t->u.try.last_catch; | |
647 | c->u.catch.prev_catch = l; | |
648 | if (l) | |
649 | l->u.catch.next_catch = c; | |
650 | else | |
651 | t->u.try.catch = c; | |
652 | t->u.try.last_catch = c; | |
9a0d1e1b | 653 | |
52a11cbf | 654 | emit_label (c->label); |
9a0d1e1b AM |
655 | } |
656 | ||
52a11cbf | 657 | /* End a catch clause. Control will resume after the try/catch block. */ |
9a0d1e1b | 658 | |
52a11cbf | 659 | void |
502b8322 | 660 | expand_end_catch (void) |
9a0d1e1b | 661 | { |
4977bab6 | 662 | struct eh_region *try_region; |
52a11cbf RH |
663 | |
664 | if (! doing_eh (0)) | |
665 | return; | |
666 | ||
4977bab6 | 667 | expand_eh_region_end (); |
52a11cbf RH |
668 | try_region = cfun->eh->try_region; |
669 | ||
670 | emit_jump (try_region->u.try.continue_label); | |
9a0d1e1b AM |
671 | } |
672 | ||
52a11cbf | 673 | /* End a sequence of catch handlers for a try block. */ |
9a0d1e1b | 674 | |
52a11cbf | 675 | void |
502b8322 | 676 | expand_end_all_catch (void) |
9a0d1e1b | 677 | { |
52a11cbf RH |
678 | struct eh_region *try_region; |
679 | ||
680 | if (! doing_eh (0)) | |
681 | return; | |
682 | ||
683 | try_region = cfun->eh->try_region; | |
684 | cfun->eh->try_region = try_region->u.try.prev_try; | |
685 | ||
686 | emit_label (try_region->u.try.continue_label); | |
9a0d1e1b AM |
687 | } |
688 | ||
52a11cbf RH |
689 | /* End an exception region for an exception type filter. ALLOWED is a |
690 | TREE_LIST of types to be matched by the runtime. FAILURE is an | |
ff7cc307 | 691 | expression to invoke if a mismatch occurs. |
b4e49397 JM |
692 | |
693 | ??? We could use these semantics for calls to rethrow, too; if we can | |
694 | see the surrounding catch clause, we know that the exception we're | |
695 | rethrowing satisfies the "filter" of the catch type. */ | |
9a0d1e1b | 696 | |
52a11cbf | 697 | void |
502b8322 | 698 | expand_eh_region_end_allowed (tree allowed, tree failure) |
9a0d1e1b | 699 | { |
52a11cbf RH |
700 | struct eh_region *region; |
701 | rtx around_label; | |
9a0d1e1b | 702 | |
52a11cbf RH |
703 | if (! doing_eh (0)) |
704 | return; | |
e6cfb550 | 705 | |
52a11cbf RH |
706 | region = expand_eh_region_end (); |
707 | region->type = ERT_ALLOWED_EXCEPTIONS; | |
708 | region->u.allowed.type_list = allowed; | |
709 | region->label = gen_label_rtx (); | |
9a0d1e1b | 710 | |
52a11cbf RH |
711 | for (; allowed ; allowed = TREE_CHAIN (allowed)) |
712 | add_type_for_runtime (TREE_VALUE (allowed)); | |
9a0d1e1b | 713 | |
52a11cbf RH |
714 | /* We must emit the call to FAILURE here, so that if this function |
715 | throws a different exception, that it will be processed by the | |
716 | correct region. */ | |
9a0d1e1b | 717 | |
52a11cbf RH |
718 | around_label = gen_label_rtx (); |
719 | emit_jump (around_label); | |
720 | ||
721 | emit_label (region->label); | |
722 | expand_expr (failure, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
b912bca0 MM |
723 | /* We must adjust the stack before we reach the AROUND_LABEL because |
724 | the call to FAILURE does not occur on all paths to the | |
725 | AROUND_LABEL. */ | |
726 | do_pending_stack_adjust (); | |
9a0d1e1b | 727 | |
52a11cbf | 728 | emit_label (around_label); |
9a0d1e1b AM |
729 | } |
730 | ||
52a11cbf RH |
731 | /* End an exception region for a must-not-throw filter. FAILURE is an |
732 | expression invoke if an uncaught exception propagates this far. | |
e6cfb550 | 733 | |
52a11cbf RH |
734 | This is conceptually identical to expand_eh_region_end_allowed with |
735 | an empty allowed list (if you passed "std::terminate" instead of | |
736 | "__cxa_call_unexpected"), but they are represented differently in | |
737 | the C++ LSDA. */ | |
6814a8a0 | 738 | |
52a11cbf | 739 | void |
502b8322 | 740 | expand_eh_region_end_must_not_throw (tree failure) |
e6cfb550 | 741 | { |
52a11cbf RH |
742 | struct eh_region *region; |
743 | rtx around_label; | |
e6cfb550 | 744 | |
52a11cbf RH |
745 | if (! doing_eh (0)) |
746 | return; | |
6814a8a0 | 747 | |
52a11cbf RH |
748 | region = expand_eh_region_end (); |
749 | region->type = ERT_MUST_NOT_THROW; | |
750 | region->label = gen_label_rtx (); | |
e6cfb550 | 751 | |
52a11cbf RH |
752 | /* We must emit the call to FAILURE here, so that if this function |
753 | throws a different exception, that it will be processed by the | |
754 | correct region. */ | |
6814a8a0 | 755 | |
52a11cbf RH |
756 | around_label = gen_label_rtx (); |
757 | emit_jump (around_label); | |
6814a8a0 | 758 | |
52a11cbf RH |
759 | emit_label (region->label); |
760 | expand_expr (failure, const0_rtx, VOIDmode, EXPAND_NORMAL); | |
6814a8a0 | 761 | |
52a11cbf | 762 | emit_label (around_label); |
e6cfb550 AM |
763 | } |
764 | ||
52a11cbf RH |
765 | /* End an exception region for a throw. No handling goes on here, |
766 | but it's the easiest way for the front-end to indicate what type | |
767 | is being thrown. */ | |
6814a8a0 | 768 | |
52a11cbf | 769 | void |
502b8322 | 770 | expand_eh_region_end_throw (tree type) |
e6cfb550 | 771 | { |
52a11cbf RH |
772 | struct eh_region *region; |
773 | ||
774 | if (! doing_eh (0)) | |
775 | return; | |
776 | ||
777 | region = expand_eh_region_end (); | |
778 | region->type = ERT_THROW; | |
779 | region->u.throw.type = type; | |
e6cfb550 AM |
780 | } |
781 | ||
52a11cbf RH |
782 | /* End a fixup region. Within this region the cleanups for the immediately |
783 | enclosing region are _not_ run. This is used for goto cleanup to avoid | |
784 | destroying an object twice. | |
12670d88 | 785 | |
52a11cbf RH |
786 | This would be an extraordinarily simple prospect, were it not for the |
787 | fact that we don't actually know what the immediately enclosing region | |
788 | is. This surprising fact is because expand_cleanups is currently | |
789 | generating a sequence that it will insert somewhere else. We collect | |
790 | the proper notion of "enclosing" in convert_from_eh_region_ranges. */ | |
4956d07c | 791 | |
52a11cbf | 792 | void |
502b8322 | 793 | expand_eh_region_end_fixup (tree handler) |
4956d07c | 794 | { |
52a11cbf RH |
795 | struct eh_region *fixup; |
796 | ||
797 | if (! doing_eh (0)) | |
798 | return; | |
799 | ||
800 | fixup = expand_eh_region_end (); | |
801 | fixup->type = ERT_FIXUP; | |
802 | fixup->u.fixup.cleanup_exp = handler; | |
4956d07c MS |
803 | } |
804 | ||
b2dd096b MM |
805 | /* Note that the current EH region (if any) may contain a throw, or a |
806 | call to a function which itself may contain a throw. */ | |
807 | ||
808 | void | |
502b8322 | 809 | note_eh_region_may_contain_throw (void) |
b2dd096b MM |
810 | { |
811 | struct eh_region *region; | |
812 | ||
813 | region = cfun->eh->cur_region; | |
814 | while (region && !region->may_contain_throw) | |
815 | { | |
816 | region->may_contain_throw = 1; | |
817 | region = region->outer; | |
818 | } | |
819 | } | |
820 | ||
47c84870 | 821 | /* Return an rtl expression for a pointer to the exception object |
52a11cbf | 822 | within a handler. */ |
4956d07c MS |
823 | |
824 | rtx | |
502b8322 | 825 | get_exception_pointer (struct function *fun) |
4956d07c | 826 | { |
86c99549 RH |
827 | rtx exc_ptr = fun->eh->exc_ptr; |
828 | if (fun == cfun && ! exc_ptr) | |
52a11cbf | 829 | { |
26b10ae0 | 830 | exc_ptr = gen_reg_rtx (ptr_mode); |
86c99549 | 831 | fun->eh->exc_ptr = exc_ptr; |
52a11cbf RH |
832 | } |
833 | return exc_ptr; | |
834 | } | |
4956d07c | 835 | |
47c84870 JM |
836 | /* Return an rtl expression for the exception dispatch filter |
837 | within a handler. */ | |
838 | ||
839 | static rtx | |
502b8322 | 840 | get_exception_filter (struct function *fun) |
47c84870 | 841 | { |
86c99549 RH |
842 | rtx filter = fun->eh->filter; |
843 | if (fun == cfun && ! filter) | |
47c84870 | 844 | { |
041c9d5a | 845 | filter = gen_reg_rtx (word_mode); |
86c99549 | 846 | fun->eh->filter = filter; |
47c84870 JM |
847 | } |
848 | return filter; | |
849 | } | |
52a11cbf RH |
850 | \f |
851 | /* This section is for the exception handling specific optimization pass. */ | |
154bba13 | 852 | |
52a11cbf RH |
853 | /* Random access the exception region tree. It's just as simple to |
854 | collect the regions this way as in expand_eh_region_start, but | |
855 | without having to realloc memory. */ | |
154bba13 | 856 | |
52a11cbf | 857 | static void |
502b8322 | 858 | collect_eh_region_array (void) |
154bba13 | 859 | { |
52a11cbf | 860 | struct eh_region **array, *i; |
154bba13 | 861 | |
52a11cbf RH |
862 | i = cfun->eh->region_tree; |
863 | if (! i) | |
864 | return; | |
154bba13 | 865 | |
e2500fed GK |
866 | array = ggc_alloc_cleared ((cfun->eh->last_region_number + 1) |
867 | * sizeof (*array)); | |
52a11cbf | 868 | cfun->eh->region_array = array; |
154bba13 | 869 | |
52a11cbf RH |
870 | while (1) |
871 | { | |
872 | array[i->region_number] = i; | |
873 | ||
874 | /* If there are sub-regions, process them. */ | |
875 | if (i->inner) | |
876 | i = i->inner; | |
877 | /* If there are peers, process them. */ | |
878 | else if (i->next_peer) | |
879 | i = i->next_peer; | |
880 | /* Otherwise, step back up the tree to the next peer. */ | |
881 | else | |
882 | { | |
883 | do { | |
884 | i = i->outer; | |
885 | if (i == NULL) | |
886 | return; | |
887 | } while (i->next_peer == NULL); | |
888 | i = i->next_peer; | |
889 | } | |
890 | } | |
27a36778 MS |
891 | } |
892 | ||
1bddbeb4 RH |
893 | static void |
894 | resolve_one_fixup_region (struct eh_region *fixup) | |
895 | { | |
896 | struct eh_region *cleanup, *real; | |
897 | int j, n; | |
898 | ||
899 | n = cfun->eh->last_region_number; | |
900 | cleanup = 0; | |
901 | ||
902 | for (j = 1; j <= n; ++j) | |
903 | { | |
904 | cleanup = cfun->eh->region_array[j]; | |
905 | if (cleanup && cleanup->type == ERT_CLEANUP | |
906 | && cleanup->u.cleanup.exp == fixup->u.fixup.cleanup_exp) | |
907 | break; | |
908 | } | |
909 | if (j > n) | |
910 | abort (); | |
911 | ||
912 | real = cleanup->outer; | |
913 | if (real && real->type == ERT_FIXUP) | |
914 | { | |
915 | if (!real->u.fixup.resolved) | |
916 | resolve_one_fixup_region (real); | |
917 | real = real->u.fixup.real_region; | |
918 | } | |
919 | ||
920 | fixup->u.fixup.real_region = real; | |
921 | fixup->u.fixup.resolved = true; | |
922 | } | |
923 | ||
52a11cbf | 924 | static void |
502b8322 | 925 | resolve_fixup_regions (void) |
27a36778 | 926 | { |
1bddbeb4 | 927 | int i, n = cfun->eh->last_region_number; |
27a36778 | 928 | |
52a11cbf RH |
929 | for (i = 1; i <= n; ++i) |
930 | { | |
931 | struct eh_region *fixup = cfun->eh->region_array[i]; | |
27a36778 | 932 | |
1bddbeb4 | 933 | if (!fixup || fixup->type != ERT_FIXUP || fixup->u.fixup.resolved) |
52a11cbf | 934 | continue; |
27a36778 | 935 | |
1bddbeb4 | 936 | resolve_one_fixup_region (fixup); |
52a11cbf | 937 | } |
27a36778 | 938 | } |
27a36778 | 939 | |
52a11cbf RH |
940 | /* Now that we've discovered what region actually encloses a fixup, |
941 | we can shuffle pointers and remove them from the tree. */ | |
27a36778 MS |
942 | |
943 | static void | |
502b8322 | 944 | remove_fixup_regions (void) |
27a36778 | 945 | { |
52a11cbf | 946 | int i; |
45053eaf RH |
947 | rtx insn, note; |
948 | struct eh_region *fixup; | |
27a36778 | 949 | |
45053eaf RH |
950 | /* Walk the insn chain and adjust the REG_EH_REGION numbers |
951 | for instructions referencing fixup regions. This is only | |
952 | strictly necessary for fixup regions with no parent, but | |
953 | doesn't hurt to do it for all regions. */ | |
954 | for (insn = get_insns(); insn ; insn = NEXT_INSN (insn)) | |
955 | if (INSN_P (insn) | |
956 | && (note = find_reg_note (insn, REG_EH_REGION, NULL)) | |
957 | && INTVAL (XEXP (note, 0)) > 0 | |
958 | && (fixup = cfun->eh->region_array[INTVAL (XEXP (note, 0))]) | |
959 | && fixup->type == ERT_FIXUP) | |
960 | { | |
961 | if (fixup->u.fixup.real_region) | |
2b1e2382 | 962 | XEXP (note, 0) = GEN_INT (fixup->u.fixup.real_region->region_number); |
45053eaf RH |
963 | else |
964 | remove_note (insn, note); | |
965 | } | |
966 | ||
967 | /* Remove the fixup regions from the tree. */ | |
52a11cbf RH |
968 | for (i = cfun->eh->last_region_number; i > 0; --i) |
969 | { | |
45053eaf | 970 | fixup = cfun->eh->region_array[i]; |
52a11cbf RH |
971 | if (! fixup) |
972 | continue; | |
27a36778 | 973 | |
52a11cbf RH |
974 | /* Allow GC to maybe free some memory. */ |
975 | if (fixup->type == ERT_CLEANUP) | |
0fb7aeda | 976 | fixup->u.cleanup.exp = NULL_TREE; |
27a36778 | 977 | |
52a11cbf RH |
978 | if (fixup->type != ERT_FIXUP) |
979 | continue; | |
27a36778 | 980 | |
52a11cbf RH |
981 | if (fixup->inner) |
982 | { | |
983 | struct eh_region *parent, *p, **pp; | |
27a36778 | 984 | |
52a11cbf | 985 | parent = fixup->u.fixup.real_region; |
27a36778 | 986 | |
52a11cbf RH |
987 | /* Fix up the children's parent pointers; find the end of |
988 | the list. */ | |
989 | for (p = fixup->inner; ; p = p->next_peer) | |
990 | { | |
991 | p->outer = parent; | |
992 | if (! p->next_peer) | |
993 | break; | |
994 | } | |
27a36778 | 995 | |
52a11cbf RH |
996 | /* In the tree of cleanups, only outer-inner ordering matters. |
997 | So link the children back in anywhere at the correct level. */ | |
998 | if (parent) | |
999 | pp = &parent->inner; | |
1000 | else | |
1001 | pp = &cfun->eh->region_tree; | |
1002 | p->next_peer = *pp; | |
1003 | *pp = fixup->inner; | |
1004 | fixup->inner = NULL; | |
1005 | } | |
27a36778 | 1006 | |
52a11cbf RH |
1007 | remove_eh_handler (fixup); |
1008 | } | |
27a36778 MS |
1009 | } |
1010 | ||
655dd289 JJ |
1011 | /* Remove all regions whose labels are not reachable from insns. */ |
1012 | ||
1013 | static void | |
502b8322 | 1014 | remove_unreachable_regions (rtx insns) |
655dd289 JJ |
1015 | { |
1016 | int i, *uid_region_num; | |
1017 | bool *reachable; | |
1018 | struct eh_region *r; | |
1019 | rtx insn; | |
1020 | ||
1021 | uid_region_num = xcalloc (get_max_uid (), sizeof(int)); | |
1022 | reachable = xcalloc (cfun->eh->last_region_number + 1, sizeof(bool)); | |
1023 | ||
1024 | for (i = cfun->eh->last_region_number; i > 0; --i) | |
1025 | { | |
1026 | r = cfun->eh->region_array[i]; | |
1027 | if (!r || r->region_number != i) | |
1028 | continue; | |
1029 | ||
1030 | if (r->resume) | |
0fb7aeda | 1031 | { |
655dd289 JJ |
1032 | if (uid_region_num[INSN_UID (r->resume)]) |
1033 | abort (); | |
1034 | uid_region_num[INSN_UID (r->resume)] = i; | |
0fb7aeda | 1035 | } |
655dd289 | 1036 | if (r->label) |
0fb7aeda | 1037 | { |
655dd289 JJ |
1038 | if (uid_region_num[INSN_UID (r->label)]) |
1039 | abort (); | |
1040 | uid_region_num[INSN_UID (r->label)] = i; | |
0fb7aeda | 1041 | } |
655dd289 | 1042 | if (r->type == ERT_TRY && r->u.try.continue_label) |
0fb7aeda | 1043 | { |
655dd289 JJ |
1044 | if (uid_region_num[INSN_UID (r->u.try.continue_label)]) |
1045 | abort (); | |
1046 | uid_region_num[INSN_UID (r->u.try.continue_label)] = i; | |
0fb7aeda | 1047 | } |
655dd289 JJ |
1048 | } |
1049 | ||
1050 | for (insn = insns; insn; insn = NEXT_INSN (insn)) | |
9caad63a RH |
1051 | { |
1052 | reachable[uid_region_num[INSN_UID (insn)]] = true; | |
1053 | ||
1054 | if (GET_CODE (insn) == CALL_INSN | |
1055 | && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) | |
1056 | for (i = 0; i < 3; i++) | |
1057 | { | |
1058 | rtx sub = XEXP (PATTERN (insn), i); | |
1059 | for (; sub ; sub = NEXT_INSN (sub)) | |
1060 | reachable[uid_region_num[INSN_UID (sub)]] = true; | |
1061 | } | |
1062 | } | |
655dd289 JJ |
1063 | |
1064 | for (i = cfun->eh->last_region_number; i > 0; --i) | |
1065 | { | |
1066 | r = cfun->eh->region_array[i]; | |
1067 | if (r && r->region_number == i && !reachable[i]) | |
1068 | { | |
1069 | /* Don't remove ERT_THROW regions if their outer region | |
1070 | is reachable. */ | |
1071 | if (r->type == ERT_THROW | |
1072 | && r->outer | |
1073 | && reachable[r->outer->region_number]) | |
1074 | continue; | |
1075 | ||
1076 | remove_eh_handler (r); | |
1077 | } | |
1078 | } | |
1079 | ||
1080 | free (reachable); | |
1081 | free (uid_region_num); | |
1082 | } | |
1083 | ||
52a11cbf RH |
1084 | /* Turn NOTE_INSN_EH_REGION notes into REG_EH_REGION notes for each |
1085 | can_throw instruction in the region. */ | |
27a36778 MS |
1086 | |
1087 | static void | |
502b8322 | 1088 | convert_from_eh_region_ranges_1 (rtx *pinsns, int *orig_sp, int cur) |
27a36778 | 1089 | { |
52a11cbf RH |
1090 | int *sp = orig_sp; |
1091 | rtx insn, next; | |
27a36778 | 1092 | |
52a11cbf RH |
1093 | for (insn = *pinsns; insn ; insn = next) |
1094 | { | |
1095 | next = NEXT_INSN (insn); | |
1096 | if (GET_CODE (insn) == NOTE) | |
1097 | { | |
1098 | int kind = NOTE_LINE_NUMBER (insn); | |
1099 | if (kind == NOTE_INSN_EH_REGION_BEG | |
1100 | || kind == NOTE_INSN_EH_REGION_END) | |
1101 | { | |
1102 | if (kind == NOTE_INSN_EH_REGION_BEG) | |
1103 | { | |
1104 | struct eh_region *r; | |
27a36778 | 1105 | |
52a11cbf RH |
1106 | *sp++ = cur; |
1107 | cur = NOTE_EH_HANDLER (insn); | |
27a36778 | 1108 | |
52a11cbf RH |
1109 | r = cfun->eh->region_array[cur]; |
1110 | if (r->type == ERT_FIXUP) | |
1111 | { | |
1112 | r = r->u.fixup.real_region; | |
1113 | cur = r ? r->region_number : 0; | |
1114 | } | |
1115 | else if (r->type == ERT_CATCH) | |
1116 | { | |
1117 | r = r->outer; | |
1118 | cur = r ? r->region_number : 0; | |
1119 | } | |
1120 | } | |
1121 | else | |
1122 | cur = *--sp; | |
1123 | ||
1124 | /* Removing the first insn of a CALL_PLACEHOLDER sequence | |
1125 | requires extra care to adjust sequence start. */ | |
1126 | if (insn == *pinsns) | |
1127 | *pinsns = next; | |
1128 | remove_insn (insn); | |
1129 | continue; | |
1130 | } | |
1131 | } | |
1132 | else if (INSN_P (insn)) | |
1133 | { | |
a944ceb9 RH |
1134 | if (cur > 0 |
1135 | && ! find_reg_note (insn, REG_EH_REGION, NULL_RTX) | |
1136 | /* Calls can always potentially throw exceptions, unless | |
1137 | they have a REG_EH_REGION note with a value of 0 or less. | |
1138 | Which should be the only possible kind so far. */ | |
1139 | && (GET_CODE (insn) == CALL_INSN | |
1140 | /* If we wanted exceptions for non-call insns, then | |
1141 | any may_trap_p instruction could throw. */ | |
1142 | || (flag_non_call_exceptions | |
1143 | && GET_CODE (PATTERN (insn)) != CLOBBER | |
1144 | && GET_CODE (PATTERN (insn)) != USE | |
1145 | && may_trap_p (PATTERN (insn))))) | |
52a11cbf | 1146 | { |
a944ceb9 | 1147 | REG_NOTES (insn) = alloc_EXPR_LIST (REG_EH_REGION, GEN_INT (cur), |
52a11cbf RH |
1148 | REG_NOTES (insn)); |
1149 | } | |
27a36778 | 1150 | |
52a11cbf RH |
1151 | if (GET_CODE (insn) == CALL_INSN |
1152 | && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) | |
1153 | { | |
1154 | convert_from_eh_region_ranges_1 (&XEXP (PATTERN (insn), 0), | |
1155 | sp, cur); | |
1156 | convert_from_eh_region_ranges_1 (&XEXP (PATTERN (insn), 1), | |
1157 | sp, cur); | |
1158 | convert_from_eh_region_ranges_1 (&XEXP (PATTERN (insn), 2), | |
1159 | sp, cur); | |
1160 | } | |
1161 | } | |
1162 | } | |
27a36778 | 1163 | |
52a11cbf RH |
1164 | if (sp != orig_sp) |
1165 | abort (); | |
1166 | } | |
27a36778 | 1167 | |
52a11cbf | 1168 | void |
502b8322 | 1169 | convert_from_eh_region_ranges (void) |
52a11cbf RH |
1170 | { |
1171 | int *stack; | |
1172 | rtx insns; | |
27a36778 | 1173 | |
52a11cbf RH |
1174 | collect_eh_region_array (); |
1175 | resolve_fixup_regions (); | |
27a36778 | 1176 | |
52a11cbf RH |
1177 | stack = xmalloc (sizeof (int) * (cfun->eh->last_region_number + 1)); |
1178 | insns = get_insns (); | |
1179 | convert_from_eh_region_ranges_1 (&insns, stack, 0); | |
1180 | free (stack); | |
27a36778 | 1181 | |
52a11cbf | 1182 | remove_fixup_regions (); |
655dd289 | 1183 | remove_unreachable_regions (insns); |
27a36778 MS |
1184 | } |
1185 | ||
6a58eee9 | 1186 | static void |
502b8322 | 1187 | add_ehl_entry (rtx label, struct eh_region *region) |
6a58eee9 RH |
1188 | { |
1189 | struct ehl_map_entry **slot, *entry; | |
1190 | ||
1191 | LABEL_PRESERVE_P (label) = 1; | |
1192 | ||
703ad42b | 1193 | entry = ggc_alloc (sizeof (*entry)); |
6a58eee9 RH |
1194 | entry->label = label; |
1195 | entry->region = region; | |
1196 | ||
1197 | slot = (struct ehl_map_entry **) | |
e2500fed | 1198 | htab_find_slot (cfun->eh->exception_handler_label_map, entry, INSERT); |
6f3d0447 RH |
1199 | |
1200 | /* Before landing pad creation, each exception handler has its own | |
1201 | label. After landing pad creation, the exception handlers may | |
1202 | share landing pads. This is ok, since maybe_remove_eh_handler | |
1203 | only requires the 1-1 mapping before landing pad creation. */ | |
1204 | if (*slot && !cfun->eh->built_landing_pads) | |
6a58eee9 | 1205 | abort (); |
6f3d0447 | 1206 | |
6a58eee9 RH |
1207 | *slot = entry; |
1208 | } | |
1209 | ||
52a11cbf | 1210 | void |
502b8322 | 1211 | find_exception_handler_labels (void) |
27a36778 | 1212 | { |
52a11cbf | 1213 | int i; |
27a36778 | 1214 | |
e2500fed GK |
1215 | if (cfun->eh->exception_handler_label_map) |
1216 | htab_empty (cfun->eh->exception_handler_label_map); | |
6a58eee9 RH |
1217 | else |
1218 | { | |
1219 | /* ??? The expansion factor here (3/2) must be greater than the htab | |
1220 | occupancy factor (4/3) to avoid unnecessary resizing. */ | |
e2500fed GK |
1221 | cfun->eh->exception_handler_label_map |
1222 | = htab_create_ggc (cfun->eh->last_region_number * 3 / 2, | |
1223 | ehl_hash, ehl_eq, NULL); | |
6a58eee9 | 1224 | } |
27a36778 | 1225 | |
52a11cbf RH |
1226 | if (cfun->eh->region_tree == NULL) |
1227 | return; | |
27a36778 | 1228 | |
52a11cbf RH |
1229 | for (i = cfun->eh->last_region_number; i > 0; --i) |
1230 | { | |
1231 | struct eh_region *region = cfun->eh->region_array[i]; | |
1232 | rtx lab; | |
27a36778 | 1233 | |
655dd289 | 1234 | if (! region || region->region_number != i) |
52a11cbf RH |
1235 | continue; |
1236 | if (cfun->eh->built_landing_pads) | |
1237 | lab = region->landing_pad; | |
1238 | else | |
1239 | lab = region->label; | |
27a36778 | 1240 | |
52a11cbf | 1241 | if (lab) |
6a58eee9 | 1242 | add_ehl_entry (lab, region); |
27a36778 MS |
1243 | } |
1244 | ||
52a11cbf RH |
1245 | /* For sjlj exceptions, need the return label to remain live until |
1246 | after landing pad generation. */ | |
1247 | if (USING_SJLJ_EXCEPTIONS && ! cfun->eh->built_landing_pads) | |
6a58eee9 | 1248 | add_ehl_entry (return_label, NULL); |
27a36778 MS |
1249 | } |
1250 | ||
93f82d60 | 1251 | bool |
502b8322 | 1252 | current_function_has_exception_handlers (void) |
93f82d60 RH |
1253 | { |
1254 | int i; | |
1255 | ||
1256 | for (i = cfun->eh->last_region_number; i > 0; --i) | |
1257 | { | |
1258 | struct eh_region *region = cfun->eh->region_array[i]; | |
1259 | ||
1260 | if (! region || region->region_number != i) | |
1261 | continue; | |
1262 | if (region->type != ERT_THROW) | |
1263 | return true; | |
1264 | } | |
1265 | ||
1266 | return false; | |
1267 | } | |
52a11cbf RH |
1268 | \f |
1269 | static struct eh_region * | |
502b8322 | 1270 | duplicate_eh_region_1 (struct eh_region *o, struct inline_remap *map) |
4956d07c | 1271 | { |
703ad42b | 1272 | struct eh_region *n = ggc_alloc_cleared (sizeof (struct eh_region)); |
4956d07c | 1273 | |
52a11cbf RH |
1274 | n->region_number = o->region_number + cfun->eh->last_region_number; |
1275 | n->type = o->type; | |
4956d07c | 1276 | |
52a11cbf RH |
1277 | switch (n->type) |
1278 | { | |
1279 | case ERT_CLEANUP: | |
1280 | case ERT_MUST_NOT_THROW: | |
1281 | break; | |
27a36778 | 1282 | |
52a11cbf RH |
1283 | case ERT_TRY: |
1284 | if (o->u.try.continue_label) | |
1285 | n->u.try.continue_label | |
1286 | = get_label_from_map (map, | |
1287 | CODE_LABEL_NUMBER (o->u.try.continue_label)); | |
1288 | break; | |
27a36778 | 1289 | |
52a11cbf | 1290 | case ERT_CATCH: |
6d41a92f | 1291 | n->u.catch.type_list = o->u.catch.type_list; |
52a11cbf | 1292 | break; |
27a36778 | 1293 | |
52a11cbf RH |
1294 | case ERT_ALLOWED_EXCEPTIONS: |
1295 | n->u.allowed.type_list = o->u.allowed.type_list; | |
1296 | break; | |
1297 | ||
1298 | case ERT_THROW: | |
1299 | n->u.throw.type = o->u.throw.type; | |
3f2c5d1a | 1300 | |
52a11cbf RH |
1301 | default: |
1302 | abort (); | |
1303 | } | |
1304 | ||
1305 | if (o->label) | |
1306 | n->label = get_label_from_map (map, CODE_LABEL_NUMBER (o->label)); | |
47c84870 | 1307 | if (o->resume) |
e7b9b18e | 1308 | { |
47c84870 JM |
1309 | n->resume = map->insn_map[INSN_UID (o->resume)]; |
1310 | if (n->resume == NULL) | |
52a11cbf | 1311 | abort (); |
27a36778 | 1312 | } |
4956d07c | 1313 | |
52a11cbf | 1314 | return n; |
4956d07c MS |
1315 | } |
1316 | ||
52a11cbf | 1317 | static void |
502b8322 | 1318 | duplicate_eh_region_2 (struct eh_region *o, struct eh_region **n_array) |
4c581243 | 1319 | { |
52a11cbf | 1320 | struct eh_region *n = n_array[o->region_number]; |
4c581243 | 1321 | |
52a11cbf RH |
1322 | switch (n->type) |
1323 | { | |
1324 | case ERT_TRY: | |
1325 | n->u.try.catch = n_array[o->u.try.catch->region_number]; | |
1326 | n->u.try.last_catch = n_array[o->u.try.last_catch->region_number]; | |
1327 | break; | |
12670d88 | 1328 | |
52a11cbf RH |
1329 | case ERT_CATCH: |
1330 | if (o->u.catch.next_catch) | |
0fb7aeda | 1331 | n->u.catch.next_catch = n_array[o->u.catch.next_catch->region_number]; |
52a11cbf | 1332 | if (o->u.catch.prev_catch) |
0fb7aeda | 1333 | n->u.catch.prev_catch = n_array[o->u.catch.prev_catch->region_number]; |
52a11cbf | 1334 | break; |
12670d88 | 1335 | |
52a11cbf RH |
1336 | default: |
1337 | break; | |
1338 | } | |
4956d07c | 1339 | |
52a11cbf RH |
1340 | if (o->outer) |
1341 | n->outer = n_array[o->outer->region_number]; | |
1342 | if (o->inner) | |
1343 | n->inner = n_array[o->inner->region_number]; | |
1344 | if (o->next_peer) | |
1345 | n->next_peer = n_array[o->next_peer->region_number]; | |
3f2c5d1a | 1346 | } |
52a11cbf RH |
1347 | |
1348 | int | |
502b8322 | 1349 | duplicate_eh_regions (struct function *ifun, struct inline_remap *map) |
4956d07c | 1350 | { |
52a11cbf RH |
1351 | int ifun_last_region_number = ifun->eh->last_region_number; |
1352 | struct eh_region **n_array, *root, *cur; | |
1353 | int i; | |
4956d07c | 1354 | |
52a11cbf RH |
1355 | if (ifun_last_region_number == 0) |
1356 | return 0; | |
4956d07c | 1357 | |
52a11cbf | 1358 | n_array = xcalloc (ifun_last_region_number + 1, sizeof (*n_array)); |
4956d07c | 1359 | |
52a11cbf | 1360 | for (i = 1; i <= ifun_last_region_number; ++i) |
27a36778 | 1361 | { |
52a11cbf RH |
1362 | cur = ifun->eh->region_array[i]; |
1363 | if (!cur || cur->region_number != i) | |
1364 | continue; | |
1365 | n_array[i] = duplicate_eh_region_1 (cur, map); | |
27a36778 | 1366 | } |
52a11cbf | 1367 | for (i = 1; i <= ifun_last_region_number; ++i) |
27a36778 | 1368 | { |
52a11cbf RH |
1369 | cur = ifun->eh->region_array[i]; |
1370 | if (!cur || cur->region_number != i) | |
1371 | continue; | |
1372 | duplicate_eh_region_2 (cur, n_array); | |
1373 | } | |
27a36778 | 1374 | |
52a11cbf RH |
1375 | root = n_array[ifun->eh->region_tree->region_number]; |
1376 | cur = cfun->eh->cur_region; | |
1377 | if (cur) | |
1378 | { | |
1379 | struct eh_region *p = cur->inner; | |
1380 | if (p) | |
1381 | { | |
1382 | while (p->next_peer) | |
1383 | p = p->next_peer; | |
1384 | p->next_peer = root; | |
1385 | } | |
1386 | else | |
1387 | cur->inner = root; | |
27a36778 | 1388 | |
52a11cbf | 1389 | for (i = 1; i <= ifun_last_region_number; ++i) |
b24a9e88 | 1390 | if (n_array[i] && n_array[i]->outer == NULL) |
52a11cbf RH |
1391 | n_array[i]->outer = cur; |
1392 | } | |
1393 | else | |
1394 | { | |
1395 | struct eh_region *p = cfun->eh->region_tree; | |
1396 | if (p) | |
1397 | { | |
1398 | while (p->next_peer) | |
1399 | p = p->next_peer; | |
1400 | p->next_peer = root; | |
1401 | } | |
1402 | else | |
1403 | cfun->eh->region_tree = root; | |
27a36778 | 1404 | } |
1e4ceb6f | 1405 | |
52a11cbf | 1406 | free (n_array); |
1e4ceb6f | 1407 | |
52a11cbf RH |
1408 | i = cfun->eh->last_region_number; |
1409 | cfun->eh->last_region_number = i + ifun_last_region_number; | |
1410 | return i; | |
4956d07c MS |
1411 | } |
1412 | ||
52a11cbf | 1413 | \f |
52a11cbf | 1414 | static int |
502b8322 | 1415 | t2r_eq (const void *pentry, const void *pdata) |
9762d48d | 1416 | { |
52a11cbf RH |
1417 | tree entry = (tree) pentry; |
1418 | tree data = (tree) pdata; | |
9762d48d | 1419 | |
52a11cbf | 1420 | return TREE_PURPOSE (entry) == data; |
9762d48d JM |
1421 | } |
1422 | ||
52a11cbf | 1423 | static hashval_t |
502b8322 | 1424 | t2r_hash (const void *pentry) |
52a11cbf RH |
1425 | { |
1426 | tree entry = (tree) pentry; | |
fd917e0d | 1427 | return TREE_HASH (TREE_PURPOSE (entry)); |
52a11cbf | 1428 | } |
9762d48d | 1429 | |
52a11cbf | 1430 | static void |
502b8322 | 1431 | add_type_for_runtime (tree type) |
52a11cbf RH |
1432 | { |
1433 | tree *slot; | |
9762d48d | 1434 | |
52a11cbf | 1435 | slot = (tree *) htab_find_slot_with_hash (type_to_runtime_map, type, |
fd917e0d | 1436 | TREE_HASH (type), INSERT); |
52a11cbf RH |
1437 | if (*slot == NULL) |
1438 | { | |
1439 | tree runtime = (*lang_eh_runtime_type) (type); | |
1440 | *slot = tree_cons (type, runtime, NULL_TREE); | |
1441 | } | |
1442 | } | |
3f2c5d1a | 1443 | |
52a11cbf | 1444 | static tree |
502b8322 | 1445 | lookup_type_for_runtime (tree type) |
52a11cbf RH |
1446 | { |
1447 | tree *slot; | |
b37f006b | 1448 | |
52a11cbf | 1449 | slot = (tree *) htab_find_slot_with_hash (type_to_runtime_map, type, |
fd917e0d | 1450 | TREE_HASH (type), NO_INSERT); |
b37f006b | 1451 | |
a1f300c0 | 1452 | /* We should have always inserted the data earlier. */ |
52a11cbf RH |
1453 | return TREE_VALUE (*slot); |
1454 | } | |
9762d48d | 1455 | |
52a11cbf RH |
1456 | \f |
1457 | /* Represent an entry in @TTypes for either catch actions | |
1458 | or exception filter actions. */ | |
e2500fed | 1459 | struct ttypes_filter GTY(()) |
52a11cbf RH |
1460 | { |
1461 | tree t; | |
1462 | int filter; | |
1463 | }; | |
b37f006b | 1464 | |
52a11cbf RH |
1465 | /* Compare ENTRY (a ttypes_filter entry in the hash table) with DATA |
1466 | (a tree) for a @TTypes type node we are thinking about adding. */ | |
b37f006b | 1467 | |
52a11cbf | 1468 | static int |
502b8322 | 1469 | ttypes_filter_eq (const void *pentry, const void *pdata) |
52a11cbf RH |
1470 | { |
1471 | const struct ttypes_filter *entry = (const struct ttypes_filter *) pentry; | |
1472 | tree data = (tree) pdata; | |
b37f006b | 1473 | |
52a11cbf | 1474 | return entry->t == data; |
9762d48d JM |
1475 | } |
1476 | ||
52a11cbf | 1477 | static hashval_t |
502b8322 | 1478 | ttypes_filter_hash (const void *pentry) |
52a11cbf RH |
1479 | { |
1480 | const struct ttypes_filter *entry = (const struct ttypes_filter *) pentry; | |
fd917e0d | 1481 | return TREE_HASH (entry->t); |
52a11cbf | 1482 | } |
4956d07c | 1483 | |
52a11cbf RH |
1484 | /* Compare ENTRY with DATA (both struct ttypes_filter) for a @TTypes |
1485 | exception specification list we are thinking about adding. */ | |
1486 | /* ??? Currently we use the type lists in the order given. Someone | |
1487 | should put these in some canonical order. */ | |
1488 | ||
1489 | static int | |
502b8322 | 1490 | ehspec_filter_eq (const void *pentry, const void *pdata) |
4956d07c | 1491 | { |
52a11cbf RH |
1492 | const struct ttypes_filter *entry = (const struct ttypes_filter *) pentry; |
1493 | const struct ttypes_filter *data = (const struct ttypes_filter *) pdata; | |
1494 | ||
1495 | return type_list_equal (entry->t, data->t); | |
4956d07c MS |
1496 | } |
1497 | ||
52a11cbf | 1498 | /* Hash function for exception specification lists. */ |
4956d07c | 1499 | |
52a11cbf | 1500 | static hashval_t |
502b8322 | 1501 | ehspec_filter_hash (const void *pentry) |
4956d07c | 1502 | { |
52a11cbf RH |
1503 | const struct ttypes_filter *entry = (const struct ttypes_filter *) pentry; |
1504 | hashval_t h = 0; | |
1505 | tree list; | |
1506 | ||
1507 | for (list = entry->t; list ; list = TREE_CHAIN (list)) | |
fd917e0d | 1508 | h = (h << 5) + (h >> 27) + TREE_HASH (TREE_VALUE (list)); |
52a11cbf | 1509 | return h; |
4956d07c MS |
1510 | } |
1511 | ||
fd917e0d JM |
1512 | /* Add TYPE (which may be NULL) to cfun->eh->ttype_data, using TYPES_HASH |
1513 | to speed up the search. Return the filter value to be used. */ | |
4956d07c | 1514 | |
52a11cbf | 1515 | static int |
502b8322 | 1516 | add_ttypes_entry (htab_t ttypes_hash, tree type) |
4956d07c | 1517 | { |
52a11cbf | 1518 | struct ttypes_filter **slot, *n; |
4956d07c | 1519 | |
52a11cbf | 1520 | slot = (struct ttypes_filter **) |
fd917e0d | 1521 | htab_find_slot_with_hash (ttypes_hash, type, TREE_HASH (type), INSERT); |
52a11cbf RH |
1522 | |
1523 | if ((n = *slot) == NULL) | |
4956d07c | 1524 | { |
52a11cbf | 1525 | /* Filter value is a 1 based table index. */ |
12670d88 | 1526 | |
703ad42b | 1527 | n = xmalloc (sizeof (*n)); |
52a11cbf RH |
1528 | n->t = type; |
1529 | n->filter = VARRAY_ACTIVE_SIZE (cfun->eh->ttype_data) + 1; | |
1530 | *slot = n; | |
1531 | ||
1532 | VARRAY_PUSH_TREE (cfun->eh->ttype_data, type); | |
4956d07c | 1533 | } |
52a11cbf RH |
1534 | |
1535 | return n->filter; | |
4956d07c MS |
1536 | } |
1537 | ||
52a11cbf RH |
1538 | /* Add LIST to cfun->eh->ehspec_data, using EHSPEC_HASH and TYPES_HASH |
1539 | to speed up the search. Return the filter value to be used. */ | |
1540 | ||
1541 | static int | |
502b8322 | 1542 | add_ehspec_entry (htab_t ehspec_hash, htab_t ttypes_hash, tree list) |
12670d88 | 1543 | { |
52a11cbf RH |
1544 | struct ttypes_filter **slot, *n; |
1545 | struct ttypes_filter dummy; | |
12670d88 | 1546 | |
52a11cbf RH |
1547 | dummy.t = list; |
1548 | slot = (struct ttypes_filter **) | |
1549 | htab_find_slot (ehspec_hash, &dummy, INSERT); | |
1550 | ||
1551 | if ((n = *slot) == NULL) | |
1552 | { | |
1553 | /* Filter value is a -1 based byte index into a uleb128 buffer. */ | |
1554 | ||
703ad42b | 1555 | n = xmalloc (sizeof (*n)); |
52a11cbf RH |
1556 | n->t = list; |
1557 | n->filter = -(VARRAY_ACTIVE_SIZE (cfun->eh->ehspec_data) + 1); | |
1558 | *slot = n; | |
1559 | ||
1560 | /* Look up each type in the list and encode its filter | |
1561 | value as a uleb128. Terminate the list with 0. */ | |
1562 | for (; list ; list = TREE_CHAIN (list)) | |
3f2c5d1a | 1563 | push_uleb128 (&cfun->eh->ehspec_data, |
52a11cbf RH |
1564 | add_ttypes_entry (ttypes_hash, TREE_VALUE (list))); |
1565 | VARRAY_PUSH_UCHAR (cfun->eh->ehspec_data, 0); | |
1566 | } | |
1567 | ||
1568 | return n->filter; | |
12670d88 RK |
1569 | } |
1570 | ||
52a11cbf RH |
1571 | /* Generate the action filter values to be used for CATCH and |
1572 | ALLOWED_EXCEPTIONS regions. When using dwarf2 exception regions, | |
1573 | we use lots of landing pads, and so every type or list can share | |
1574 | the same filter value, which saves table space. */ | |
1575 | ||
1576 | static void | |
502b8322 | 1577 | assign_filter_values (void) |
9a0d1e1b | 1578 | { |
52a11cbf RH |
1579 | int i; |
1580 | htab_t ttypes, ehspec; | |
9a9deafc | 1581 | |
52a11cbf RH |
1582 | VARRAY_TREE_INIT (cfun->eh->ttype_data, 16, "ttype_data"); |
1583 | VARRAY_UCHAR_INIT (cfun->eh->ehspec_data, 64, "ehspec_data"); | |
9a9deafc | 1584 | |
52a11cbf RH |
1585 | ttypes = htab_create (31, ttypes_filter_hash, ttypes_filter_eq, free); |
1586 | ehspec = htab_create (31, ehspec_filter_hash, ehspec_filter_eq, free); | |
9a0d1e1b | 1587 | |
52a11cbf RH |
1588 | for (i = cfun->eh->last_region_number; i > 0; --i) |
1589 | { | |
1590 | struct eh_region *r = cfun->eh->region_array[i]; | |
9a0d1e1b | 1591 | |
52a11cbf RH |
1592 | /* Mind we don't process a region more than once. */ |
1593 | if (!r || r->region_number != i) | |
1594 | continue; | |
9a0d1e1b | 1595 | |
52a11cbf RH |
1596 | switch (r->type) |
1597 | { | |
1598 | case ERT_CATCH: | |
6d41a92f OH |
1599 | /* Whatever type_list is (NULL or true list), we build a list |
1600 | of filters for the region. */ | |
1601 | r->u.catch.filter_list = NULL_TREE; | |
1602 | ||
1603 | if (r->u.catch.type_list != NULL) | |
1604 | { | |
1605 | /* Get a filter value for each of the types caught and store | |
1606 | them in the region's dedicated list. */ | |
1607 | tree tp_node = r->u.catch.type_list; | |
1608 | ||
1609 | for (;tp_node; tp_node = TREE_CHAIN (tp_node)) | |
1610 | { | |
1611 | int flt = add_ttypes_entry (ttypes, TREE_VALUE (tp_node)); | |
1612 | tree flt_node = build_int_2 (flt, 0); | |
3f2c5d1a RS |
1613 | |
1614 | r->u.catch.filter_list | |
6d41a92f OH |
1615 | = tree_cons (NULL_TREE, flt_node, r->u.catch.filter_list); |
1616 | } | |
1617 | } | |
1618 | else | |
1619 | { | |
1620 | /* Get a filter value for the NULL list also since it will need | |
1621 | an action record anyway. */ | |
1622 | int flt = add_ttypes_entry (ttypes, NULL); | |
1623 | tree flt_node = build_int_2 (flt, 0); | |
3f2c5d1a RS |
1624 | |
1625 | r->u.catch.filter_list | |
6d41a92f OH |
1626 | = tree_cons (NULL_TREE, flt_node, r->u.catch.filter_list); |
1627 | } | |
3f2c5d1a | 1628 | |
52a11cbf | 1629 | break; |
bf71cd2e | 1630 | |
52a11cbf RH |
1631 | case ERT_ALLOWED_EXCEPTIONS: |
1632 | r->u.allowed.filter | |
1633 | = add_ehspec_entry (ehspec, ttypes, r->u.allowed.type_list); | |
1634 | break; | |
bf71cd2e | 1635 | |
52a11cbf RH |
1636 | default: |
1637 | break; | |
1638 | } | |
1639 | } | |
1640 | ||
1641 | htab_delete (ttypes); | |
1642 | htab_delete (ehspec); | |
1643 | } | |
1644 | ||
12c3874e JH |
1645 | /* Emit SEQ into basic block just before INSN (that is assumed to be |
1646 | first instruction of some existing BB and return the newly | |
1647 | produced block. */ | |
1648 | static basic_block | |
1649 | emit_to_new_bb_before (rtx seq, rtx insn) | |
1650 | { | |
1651 | rtx last; | |
1652 | basic_block bb; | |
a61bf177 JH |
1653 | edge e; |
1654 | ||
1655 | /* If there happens to be an fallthru edge (possibly created by cleanup_cfg | |
1656 | call), we don't want it to go into newly created landing pad or other EH | |
1657 | construct. */ | |
1658 | for (e = BLOCK_FOR_INSN (insn)->pred; e; e = e->pred_next) | |
1659 | if (e->flags & EDGE_FALLTHRU) | |
1660 | force_nonfallthru (e); | |
12c3874e JH |
1661 | last = emit_insn_before (seq, insn); |
1662 | if (GET_CODE (last) == BARRIER) | |
1663 | last = PREV_INSN (last); | |
1664 | bb = create_basic_block (seq, last, BLOCK_FOR_INSN (insn)->prev_bb); | |
1665 | update_bb_for_insn (bb); | |
1666 | bb->flags |= BB_SUPERBLOCK; | |
1667 | return bb; | |
1668 | } | |
1669 | ||
ac850948 JM |
1670 | /* Generate the code to actually handle exceptions, which will follow the |
1671 | landing pads. */ | |
1672 | ||
52a11cbf | 1673 | static void |
502b8322 | 1674 | build_post_landing_pads (void) |
52a11cbf RH |
1675 | { |
1676 | int i; | |
bf71cd2e | 1677 | |
52a11cbf | 1678 | for (i = cfun->eh->last_region_number; i > 0; --i) |
bf71cd2e | 1679 | { |
52a11cbf RH |
1680 | struct eh_region *region = cfun->eh->region_array[i]; |
1681 | rtx seq; | |
bf71cd2e | 1682 | |
52a11cbf RH |
1683 | /* Mind we don't process a region more than once. */ |
1684 | if (!region || region->region_number != i) | |
1685 | continue; | |
1686 | ||
1687 | switch (region->type) | |
987009bf | 1688 | { |
52a11cbf RH |
1689 | case ERT_TRY: |
1690 | /* ??? Collect the set of all non-overlapping catch handlers | |
1691 | all the way up the chain until blocked by a cleanup. */ | |
1692 | /* ??? Outer try regions can share landing pads with inner | |
1693 | try regions if the types are completely non-overlapping, | |
a1f300c0 | 1694 | and there are no intervening cleanups. */ |
bf71cd2e | 1695 | |
52a11cbf | 1696 | region->post_landing_pad = gen_label_rtx (); |
bf71cd2e | 1697 | |
52a11cbf | 1698 | start_sequence (); |
bf71cd2e | 1699 | |
52a11cbf | 1700 | emit_label (region->post_landing_pad); |
bf71cd2e | 1701 | |
52a11cbf RH |
1702 | /* ??? It is mighty inconvenient to call back into the |
1703 | switch statement generation code in expand_end_case. | |
1704 | Rapid prototyping sez a sequence of ifs. */ | |
1705 | { | |
1706 | struct eh_region *c; | |
1707 | for (c = region->u.try.catch; c ; c = c->u.catch.next_catch) | |
1708 | { | |
6d41a92f | 1709 | if (c->u.catch.type_list == NULL) |
a944ceb9 | 1710 | emit_jump (c->label); |
52a11cbf | 1711 | else |
6d41a92f OH |
1712 | { |
1713 | /* Need for one cmp/jump per type caught. Each type | |
1714 | list entry has a matching entry in the filter list | |
1715 | (see assign_filter_values). */ | |
1716 | tree tp_node = c->u.catch.type_list; | |
1717 | tree flt_node = c->u.catch.filter_list; | |
1718 | ||
1719 | for (; tp_node; ) | |
1720 | { | |
1721 | emit_cmp_and_jump_insns | |
1722 | (cfun->eh->filter, | |
1723 | GEN_INT (tree_low_cst (TREE_VALUE (flt_node), 0)), | |
1724 | EQ, NULL_RTX, word_mode, 0, c->label); | |
1725 | ||
1726 | tp_node = TREE_CHAIN (tp_node); | |
1727 | flt_node = TREE_CHAIN (flt_node); | |
1728 | } | |
1729 | } | |
52a11cbf RH |
1730 | } |
1731 | } | |
bf71cd2e | 1732 | |
47c84870 JM |
1733 | /* We delay the generation of the _Unwind_Resume until we generate |
1734 | landing pads. We emit a marker here so as to get good control | |
1735 | flow data in the meantime. */ | |
1736 | region->resume | |
1737 | = emit_jump_insn (gen_rtx_RESX (VOIDmode, region->region_number)); | |
1738 | emit_barrier (); | |
1739 | ||
52a11cbf RH |
1740 | seq = get_insns (); |
1741 | end_sequence (); | |
e6cfb550 | 1742 | |
12c3874e JH |
1743 | emit_to_new_bb_before (seq, region->u.try.catch->label); |
1744 | ||
52a11cbf | 1745 | break; |
bf71cd2e | 1746 | |
52a11cbf RH |
1747 | case ERT_ALLOWED_EXCEPTIONS: |
1748 | region->post_landing_pad = gen_label_rtx (); | |
9a0d1e1b | 1749 | |
52a11cbf | 1750 | start_sequence (); |
f54a7f6f | 1751 | |
52a11cbf | 1752 | emit_label (region->post_landing_pad); |
f54a7f6f | 1753 | |
52a11cbf RH |
1754 | emit_cmp_and_jump_insns (cfun->eh->filter, |
1755 | GEN_INT (region->u.allowed.filter), | |
a06ef755 | 1756 | EQ, NULL_RTX, word_mode, 0, region->label); |
f54a7f6f | 1757 | |
47c84870 JM |
1758 | /* We delay the generation of the _Unwind_Resume until we generate |
1759 | landing pads. We emit a marker here so as to get good control | |
1760 | flow data in the meantime. */ | |
1761 | region->resume | |
1762 | = emit_jump_insn (gen_rtx_RESX (VOIDmode, region->region_number)); | |
1763 | emit_barrier (); | |
1764 | ||
52a11cbf RH |
1765 | seq = get_insns (); |
1766 | end_sequence (); | |
1767 | ||
12c3874e | 1768 | emit_to_new_bb_before (seq, region->label); |
52a11cbf | 1769 | break; |
f54a7f6f | 1770 | |
52a11cbf | 1771 | case ERT_CLEANUP: |
125ca8fd | 1772 | case ERT_MUST_NOT_THROW: |
a944ceb9 | 1773 | region->post_landing_pad = region->label; |
125ca8fd RH |
1774 | break; |
1775 | ||
52a11cbf RH |
1776 | case ERT_CATCH: |
1777 | case ERT_THROW: | |
1778 | /* Nothing to do. */ | |
1779 | break; | |
1780 | ||
1781 | default: | |
1782 | abort (); | |
1783 | } | |
1784 | } | |
1785 | } | |
1e4ceb6f | 1786 | |
47c84870 JM |
1787 | /* Replace RESX patterns with jumps to the next handler if any, or calls to |
1788 | _Unwind_Resume otherwise. */ | |
1789 | ||
1e4ceb6f | 1790 | static void |
502b8322 | 1791 | connect_post_landing_pads (void) |
1e4ceb6f | 1792 | { |
52a11cbf | 1793 | int i; |
76fc91c7 | 1794 | |
52a11cbf RH |
1795 | for (i = cfun->eh->last_region_number; i > 0; --i) |
1796 | { | |
1797 | struct eh_region *region = cfun->eh->region_array[i]; | |
1798 | struct eh_region *outer; | |
47c84870 | 1799 | rtx seq; |
12c3874e | 1800 | rtx barrier; |
1e4ceb6f | 1801 | |
52a11cbf RH |
1802 | /* Mind we don't process a region more than once. */ |
1803 | if (!region || region->region_number != i) | |
1804 | continue; | |
1e4ceb6f | 1805 | |
47c84870 JM |
1806 | /* If there is no RESX, or it has been deleted by flow, there's |
1807 | nothing to fix up. */ | |
1808 | if (! region->resume || INSN_DELETED_P (region->resume)) | |
52a11cbf | 1809 | continue; |
76fc91c7 | 1810 | |
52a11cbf RH |
1811 | /* Search for another landing pad in this function. */ |
1812 | for (outer = region->outer; outer ; outer = outer->outer) | |
1813 | if (outer->post_landing_pad) | |
1814 | break; | |
1e4ceb6f | 1815 | |
52a11cbf | 1816 | start_sequence (); |
12670d88 | 1817 | |
52a11cbf | 1818 | if (outer) |
12c3874e JH |
1819 | { |
1820 | edge e; | |
1821 | basic_block src, dest; | |
1822 | ||
1823 | emit_jump (outer->post_landing_pad); | |
1824 | src = BLOCK_FOR_INSN (region->resume); | |
1825 | dest = BLOCK_FOR_INSN (outer->post_landing_pad); | |
1826 | while (src->succ) | |
1827 | remove_edge (src->succ); | |
1828 | e = make_edge (src, dest, 0); | |
1829 | e->probability = REG_BR_PROB_BASE; | |
1830 | e->count = src->count; | |
1831 | } | |
52a11cbf | 1832 | else |
9555a122 | 1833 | emit_library_call (unwind_resume_libfunc, LCT_THROW, |
26b10ae0 | 1834 | VOIDmode, 1, cfun->eh->exc_ptr, ptr_mode); |
4956d07c | 1835 | |
52a11cbf RH |
1836 | seq = get_insns (); |
1837 | end_sequence (); | |
12c3874e JH |
1838 | barrier = emit_insn_before (seq, region->resume); |
1839 | /* Avoid duplicate barrier. */ | |
1840 | if (GET_CODE (barrier) != BARRIER) | |
1841 | abort (); | |
1842 | delete_insn (barrier); | |
53c17031 | 1843 | delete_insn (region->resume); |
52a11cbf RH |
1844 | } |
1845 | } | |
1846 | ||
1847 | \f | |
1848 | static void | |
502b8322 | 1849 | dw2_build_landing_pads (void) |
4956d07c | 1850 | { |
ae0ed63a JM |
1851 | int i; |
1852 | unsigned int j; | |
4956d07c | 1853 | |
52a11cbf RH |
1854 | for (i = cfun->eh->last_region_number; i > 0; --i) |
1855 | { | |
1856 | struct eh_region *region = cfun->eh->region_array[i]; | |
1857 | rtx seq; | |
12c3874e | 1858 | basic_block bb; |
5c701bb1 | 1859 | bool clobbers_hard_regs = false; |
12c3874e | 1860 | edge e; |
4956d07c | 1861 | |
52a11cbf RH |
1862 | /* Mind we don't process a region more than once. */ |
1863 | if (!region || region->region_number != i) | |
1864 | continue; | |
1418bb67 | 1865 | |
52a11cbf RH |
1866 | if (region->type != ERT_CLEANUP |
1867 | && region->type != ERT_TRY | |
1868 | && region->type != ERT_ALLOWED_EXCEPTIONS) | |
1869 | continue; | |
12670d88 | 1870 | |
52a11cbf | 1871 | start_sequence (); |
4956d07c | 1872 | |
52a11cbf RH |
1873 | region->landing_pad = gen_label_rtx (); |
1874 | emit_label (region->landing_pad); | |
4956d07c | 1875 | |
52a11cbf RH |
1876 | #ifdef HAVE_exception_receiver |
1877 | if (HAVE_exception_receiver) | |
1878 | emit_insn (gen_exception_receiver ()); | |
1879 | else | |
1880 | #endif | |
1881 | #ifdef HAVE_nonlocal_goto_receiver | |
1882 | if (HAVE_nonlocal_goto_receiver) | |
1883 | emit_insn (gen_nonlocal_goto_receiver ()); | |
1884 | else | |
1885 | #endif | |
1886 | { /* Nothing */ } | |
4956d07c | 1887 | |
52a11cbf RH |
1888 | /* If the eh_return data registers are call-saved, then we |
1889 | won't have considered them clobbered from the call that | |
1890 | threw. Kill them now. */ | |
1891 | for (j = 0; ; ++j) | |
1892 | { | |
1893 | unsigned r = EH_RETURN_DATA_REGNO (j); | |
1894 | if (r == INVALID_REGNUM) | |
1895 | break; | |
1896 | if (! call_used_regs[r]) | |
5c701bb1 JS |
1897 | { |
1898 | emit_insn (gen_rtx_CLOBBER (VOIDmode, gen_rtx_REG (Pmode, r))); | |
1899 | clobbers_hard_regs = true; | |
1900 | } | |
1901 | } | |
1902 | ||
1903 | if (clobbers_hard_regs) | |
1904 | { | |
1905 | /* @@@ This is a kludge. Not all machine descriptions define a | |
1906 | blockage insn, but we must not allow the code we just generated | |
1907 | to be reordered by scheduling. So emit an ASM_INPUT to act as | |
2ba84f36 | 1908 | blockage insn. */ |
5c701bb1 | 1909 | emit_insn (gen_rtx_ASM_INPUT (VOIDmode, "")); |
52a11cbf | 1910 | } |
e701eb4d | 1911 | |
52a11cbf | 1912 | emit_move_insn (cfun->eh->exc_ptr, |
26b10ae0 | 1913 | gen_rtx_REG (ptr_mode, EH_RETURN_DATA_REGNO (0))); |
52a11cbf | 1914 | emit_move_insn (cfun->eh->filter, |
9e800206 | 1915 | gen_rtx_REG (word_mode, EH_RETURN_DATA_REGNO (1))); |
9a0d1e1b | 1916 | |
52a11cbf RH |
1917 | seq = get_insns (); |
1918 | end_sequence (); | |
5816cb14 | 1919 | |
12c3874e JH |
1920 | bb = emit_to_new_bb_before (seq, region->post_landing_pad); |
1921 | e = make_edge (bb, bb->next_bb, EDGE_FALLTHRU); | |
1922 | e->count = bb->count; | |
1923 | e->probability = REG_BR_PROB_BASE; | |
52a11cbf | 1924 | } |
4956d07c MS |
1925 | } |
1926 | ||
52a11cbf RH |
1927 | \f |
1928 | struct sjlj_lp_info | |
1929 | { | |
1930 | int directly_reachable; | |
1931 | int action_index; | |
1932 | int dispatch_index; | |
1933 | int call_site_index; | |
1934 | }; | |
4956d07c | 1935 | |
52a11cbf | 1936 | static bool |
502b8322 | 1937 | sjlj_find_directly_reachable_regions (struct sjlj_lp_info *lp_info) |
4956d07c | 1938 | { |
52a11cbf RH |
1939 | rtx insn; |
1940 | bool found_one = false; | |
4956d07c | 1941 | |
52a11cbf RH |
1942 | for (insn = get_insns (); insn ; insn = NEXT_INSN (insn)) |
1943 | { | |
1944 | struct eh_region *region; | |
98ce21b3 | 1945 | enum reachable_code rc; |
52a11cbf RH |
1946 | tree type_thrown; |
1947 | rtx note; | |
4956d07c | 1948 | |
52a11cbf RH |
1949 | if (! INSN_P (insn)) |
1950 | continue; | |
0d3453df | 1951 | |
52a11cbf RH |
1952 | note = find_reg_note (insn, REG_EH_REGION, NULL_RTX); |
1953 | if (!note || INTVAL (XEXP (note, 0)) <= 0) | |
1954 | continue; | |
5dfa7520 | 1955 | |
52a11cbf | 1956 | region = cfun->eh->region_array[INTVAL (XEXP (note, 0))]; |
5dfa7520 | 1957 | |
52a11cbf RH |
1958 | type_thrown = NULL_TREE; |
1959 | if (region->type == ERT_THROW) | |
1960 | { | |
1961 | type_thrown = region->u.throw.type; | |
1962 | region = region->outer; | |
1963 | } | |
12670d88 | 1964 | |
52a11cbf RH |
1965 | /* Find the first containing region that might handle the exception. |
1966 | That's the landing pad to which we will transfer control. */ | |
98ce21b3 | 1967 | rc = RNL_NOT_CAUGHT; |
52a11cbf | 1968 | for (; region; region = region->outer) |
98ce21b3 RH |
1969 | { |
1970 | rc = reachable_next_level (region, type_thrown, 0); | |
1971 | if (rc != RNL_NOT_CAUGHT) | |
1972 | break; | |
1973 | } | |
1974 | if (rc == RNL_MAYBE_CAUGHT || rc == RNL_CAUGHT) | |
52a11cbf RH |
1975 | { |
1976 | lp_info[region->region_number].directly_reachable = 1; | |
1977 | found_one = true; | |
1978 | } | |
1979 | } | |
4956d07c | 1980 | |
52a11cbf RH |
1981 | return found_one; |
1982 | } | |
e701eb4d JM |
1983 | |
1984 | static void | |
502b8322 | 1985 | sjlj_assign_call_site_values (rtx dispatch_label, struct sjlj_lp_info *lp_info) |
e701eb4d | 1986 | { |
52a11cbf RH |
1987 | htab_t ar_hash; |
1988 | int i, index; | |
1989 | ||
1990 | /* First task: build the action table. */ | |
1991 | ||
1992 | VARRAY_UCHAR_INIT (cfun->eh->action_record_data, 64, "action_record_data"); | |
1993 | ar_hash = htab_create (31, action_record_hash, action_record_eq, free); | |
1994 | ||
1995 | for (i = cfun->eh->last_region_number; i > 0; --i) | |
1996 | if (lp_info[i].directly_reachable) | |
e6cfb550 | 1997 | { |
52a11cbf RH |
1998 | struct eh_region *r = cfun->eh->region_array[i]; |
1999 | r->landing_pad = dispatch_label; | |
2000 | lp_info[i].action_index = collect_one_action_chain (ar_hash, r); | |
2001 | if (lp_info[i].action_index != -1) | |
2002 | cfun->uses_eh_lsda = 1; | |
e6cfb550 | 2003 | } |
e701eb4d | 2004 | |
52a11cbf | 2005 | htab_delete (ar_hash); |
76fc91c7 | 2006 | |
52a11cbf RH |
2007 | /* Next: assign dispatch values. In dwarf2 terms, this would be the |
2008 | landing pad label for the region. For sjlj though, there is one | |
2009 | common landing pad from which we dispatch to the post-landing pads. | |
76fc91c7 | 2010 | |
52a11cbf RH |
2011 | A region receives a dispatch index if it is directly reachable |
2012 | and requires in-function processing. Regions that share post-landing | |
eaec9b3d | 2013 | pads may share dispatch indices. */ |
52a11cbf RH |
2014 | /* ??? Post-landing pad sharing doesn't actually happen at the moment |
2015 | (see build_post_landing_pads) so we don't bother checking for it. */ | |
4956d07c | 2016 | |
52a11cbf RH |
2017 | index = 0; |
2018 | for (i = cfun->eh->last_region_number; i > 0; --i) | |
98ce21b3 | 2019 | if (lp_info[i].directly_reachable) |
52a11cbf | 2020 | lp_info[i].dispatch_index = index++; |
76fc91c7 | 2021 | |
52a11cbf RH |
2022 | /* Finally: assign call-site values. If dwarf2 terms, this would be |
2023 | the region number assigned by convert_to_eh_region_ranges, but | |
2024 | handles no-action and must-not-throw differently. */ | |
76fc91c7 | 2025 | |
52a11cbf RH |
2026 | call_site_base = 1; |
2027 | for (i = cfun->eh->last_region_number; i > 0; --i) | |
2028 | if (lp_info[i].directly_reachable) | |
2029 | { | |
2030 | int action = lp_info[i].action_index; | |
2031 | ||
2032 | /* Map must-not-throw to otherwise unused call-site index 0. */ | |
2033 | if (action == -2) | |
2034 | index = 0; | |
2035 | /* Map no-action to otherwise unused call-site index -1. */ | |
2036 | else if (action == -1) | |
2037 | index = -1; | |
2038 | /* Otherwise, look it up in the table. */ | |
2039 | else | |
2040 | index = add_call_site (GEN_INT (lp_info[i].dispatch_index), action); | |
2041 | ||
2042 | lp_info[i].call_site_index = index; | |
2043 | } | |
4956d07c | 2044 | } |
27a36778 | 2045 | |
52a11cbf | 2046 | static void |
502b8322 | 2047 | sjlj_mark_call_sites (struct sjlj_lp_info *lp_info) |
27a36778 | 2048 | { |
52a11cbf RH |
2049 | int last_call_site = -2; |
2050 | rtx insn, mem; | |
2051 | ||
52a11cbf | 2052 | for (insn = get_insns (); insn ; insn = NEXT_INSN (insn)) |
27a36778 | 2053 | { |
52a11cbf RH |
2054 | struct eh_region *region; |
2055 | int this_call_site; | |
2056 | rtx note, before, p; | |
27a36778 | 2057 | |
52a11cbf RH |
2058 | /* Reset value tracking at extended basic block boundaries. */ |
2059 | if (GET_CODE (insn) == CODE_LABEL) | |
2060 | last_call_site = -2; | |
27a36778 | 2061 | |
52a11cbf RH |
2062 | if (! INSN_P (insn)) |
2063 | continue; | |
27a36778 | 2064 | |
52a11cbf RH |
2065 | note = find_reg_note (insn, REG_EH_REGION, NULL_RTX); |
2066 | if (!note) | |
2067 | { | |
2068 | /* Calls (and trapping insns) without notes are outside any | |
2069 | exception handling region in this function. Mark them as | |
2070 | no action. */ | |
2071 | if (GET_CODE (insn) == CALL_INSN | |
2072 | || (flag_non_call_exceptions | |
2073 | && may_trap_p (PATTERN (insn)))) | |
2074 | this_call_site = -1; | |
2075 | else | |
2076 | continue; | |
2077 | } | |
2078 | else | |
2079 | { | |
2080 | /* Calls that are known to not throw need not be marked. */ | |
2081 | if (INTVAL (XEXP (note, 0)) <= 0) | |
2082 | continue; | |
27a36778 | 2083 | |
52a11cbf RH |
2084 | region = cfun->eh->region_array[INTVAL (XEXP (note, 0))]; |
2085 | this_call_site = lp_info[region->region_number].call_site_index; | |
2086 | } | |
27a36778 | 2087 | |
52a11cbf RH |
2088 | if (this_call_site == last_call_site) |
2089 | continue; | |
2090 | ||
2091 | /* Don't separate a call from it's argument loads. */ | |
2092 | before = insn; | |
2093 | if (GET_CODE (insn) == CALL_INSN) | |
0fb7aeda | 2094 | before = find_first_parameter_load (insn, NULL_RTX); |
4956d07c | 2095 | |
52a11cbf | 2096 | start_sequence (); |
fd2c57a9 AH |
2097 | mem = adjust_address (cfun->eh->sjlj_fc, TYPE_MODE (integer_type_node), |
2098 | sjlj_fc_call_site_ofs); | |
52a11cbf RH |
2099 | emit_move_insn (mem, GEN_INT (this_call_site)); |
2100 | p = get_insns (); | |
2101 | end_sequence (); | |
12670d88 | 2102 | |
2f937369 | 2103 | emit_insn_before (p, before); |
52a11cbf RH |
2104 | last_call_site = this_call_site; |
2105 | } | |
2106 | } | |
4956d07c | 2107 | |
52a11cbf RH |
2108 | /* Construct the SjLj_Function_Context. */ |
2109 | ||
2110 | static void | |
502b8322 | 2111 | sjlj_emit_function_enter (rtx dispatch_label) |
4956d07c | 2112 | { |
52a11cbf | 2113 | rtx fn_begin, fc, mem, seq; |
4956d07c | 2114 | |
52a11cbf | 2115 | fc = cfun->eh->sjlj_fc; |
4956d07c | 2116 | |
52a11cbf | 2117 | start_sequence (); |
8a4451aa | 2118 | |
8979edec JL |
2119 | /* We're storing this libcall's address into memory instead of |
2120 | calling it directly. Thus, we must call assemble_external_libcall | |
2121 | here, as we can not depend on emit_library_call to do it for us. */ | |
2122 | assemble_external_libcall (eh_personality_libfunc); | |
f4ef873c | 2123 | mem = adjust_address (fc, Pmode, sjlj_fc_personality_ofs); |
52a11cbf RH |
2124 | emit_move_insn (mem, eh_personality_libfunc); |
2125 | ||
f4ef873c | 2126 | mem = adjust_address (fc, Pmode, sjlj_fc_lsda_ofs); |
52a11cbf RH |
2127 | if (cfun->uses_eh_lsda) |
2128 | { | |
2129 | char buf[20]; | |
86bdf071 RE |
2130 | rtx sym; |
2131 | ||
df696a75 | 2132 | ASM_GENERATE_INTERNAL_LABEL (buf, "LLSDA", current_function_funcdef_no); |
86bdf071 RE |
2133 | sym = gen_rtx_SYMBOL_REF (Pmode, ggc_strdup (buf)); |
2134 | SYMBOL_REF_FLAGS (sym) = SYMBOL_FLAG_LOCAL; | |
2135 | emit_move_insn (mem, sym); | |
8a4451aa | 2136 | } |
52a11cbf RH |
2137 | else |
2138 | emit_move_insn (mem, const0_rtx); | |
3f2c5d1a | 2139 | |
52a11cbf RH |
2140 | #ifdef DONT_USE_BUILTIN_SETJMP |
2141 | { | |
2142 | rtx x, note; | |
9defc9b7 | 2143 | x = emit_library_call_value (setjmp_libfunc, NULL_RTX, LCT_RETURNS_TWICE, |
52a11cbf RH |
2144 | TYPE_MODE (integer_type_node), 1, |
2145 | plus_constant (XEXP (fc, 0), | |
2146 | sjlj_fc_jbuf_ofs), Pmode); | |
2147 | ||
2e040219 | 2148 | note = emit_note (NOTE_INSN_EXPECTED_VALUE); |
52a11cbf RH |
2149 | NOTE_EXPECTED_VALUE (note) = gen_rtx_EQ (VOIDmode, x, const0_rtx); |
2150 | ||
2151 | emit_cmp_and_jump_insns (x, const0_rtx, NE, 0, | |
a06ef755 | 2152 | TYPE_MODE (integer_type_node), 0, dispatch_label); |
52a11cbf RH |
2153 | } |
2154 | #else | |
2155 | expand_builtin_setjmp_setup (plus_constant (XEXP (fc, 0), sjlj_fc_jbuf_ofs), | |
2156 | dispatch_label); | |
4956d07c | 2157 | #endif |
4956d07c | 2158 | |
52a11cbf RH |
2159 | emit_library_call (unwind_sjlj_register_libfunc, LCT_NORMAL, VOIDmode, |
2160 | 1, XEXP (fc, 0), Pmode); | |
12670d88 | 2161 | |
52a11cbf RH |
2162 | seq = get_insns (); |
2163 | end_sequence (); | |
4956d07c | 2164 | |
52a11cbf RH |
2165 | /* ??? Instead of doing this at the beginning of the function, |
2166 | do this in a block that is at loop level 0 and dominates all | |
2167 | can_throw_internal instructions. */ | |
4956d07c | 2168 | |
52a11cbf RH |
2169 | for (fn_begin = get_insns (); ; fn_begin = NEXT_INSN (fn_begin)) |
2170 | if (GET_CODE (fn_begin) == NOTE | |
12c3874e JH |
2171 | && (NOTE_LINE_NUMBER (fn_begin) == NOTE_INSN_FUNCTION_BEG |
2172 | || NOTE_LINE_NUMBER (fn_begin) == NOTE_INSN_BASIC_BLOCK)) | |
52a11cbf | 2173 | break; |
12c3874e JH |
2174 | if (NOTE_LINE_NUMBER (fn_begin) == NOTE_INSN_FUNCTION_BEG) |
2175 | insert_insn_on_edge (seq, ENTRY_BLOCK_PTR->succ); | |
2176 | else | |
2177 | { | |
2178 | rtx last = BB_END (ENTRY_BLOCK_PTR->succ->dest); | |
2179 | for (; ; fn_begin = NEXT_INSN (fn_begin)) | |
2180 | if ((GET_CODE (fn_begin) == NOTE | |
2181 | && NOTE_LINE_NUMBER (fn_begin) == NOTE_INSN_FUNCTION_BEG) | |
2182 | || fn_begin == last) | |
2183 | break; | |
2184 | emit_insn_after (seq, fn_begin); | |
2185 | } | |
4956d07c MS |
2186 | } |
2187 | ||
52a11cbf RH |
2188 | /* Call back from expand_function_end to know where we should put |
2189 | the call to unwind_sjlj_unregister_libfunc if needed. */ | |
12670d88 | 2190 | |
52a11cbf | 2191 | void |
502b8322 | 2192 | sjlj_emit_function_exit_after (rtx after) |
52a11cbf RH |
2193 | { |
2194 | cfun->eh->sjlj_exit_after = after; | |
2195 | } | |
4956d07c MS |
2196 | |
2197 | static void | |
502b8322 | 2198 | sjlj_emit_function_exit (void) |
52a11cbf RH |
2199 | { |
2200 | rtx seq; | |
12c3874e | 2201 | edge e; |
4956d07c | 2202 | |
52a11cbf | 2203 | start_sequence (); |
ce152ef8 | 2204 | |
52a11cbf RH |
2205 | emit_library_call (unwind_sjlj_unregister_libfunc, LCT_NORMAL, VOIDmode, |
2206 | 1, XEXP (cfun->eh->sjlj_fc, 0), Pmode); | |
e6cfb550 | 2207 | |
52a11cbf RH |
2208 | seq = get_insns (); |
2209 | end_sequence (); | |
4956d07c | 2210 | |
52a11cbf RH |
2211 | /* ??? Really this can be done in any block at loop level 0 that |
2212 | post-dominates all can_throw_internal instructions. This is | |
2213 | the last possible moment. */ | |
9a0d1e1b | 2214 | |
12c3874e JH |
2215 | for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next) |
2216 | if (e->flags & EDGE_FALLTHRU) | |
2217 | break; | |
2218 | if (e) | |
2219 | { | |
2220 | rtx insn; | |
2221 | ||
2222 | /* Figure out whether the place we are supposed to insert libcall | |
2223 | is inside the last basic block or after it. In the other case | |
2224 | we need to emit to edge. */ | |
2225 | if (e->src->next_bb != EXIT_BLOCK_PTR) | |
2226 | abort (); | |
2227 | for (insn = NEXT_INSN (BB_END (e->src)); insn; insn = NEXT_INSN (insn)) | |
2228 | if (insn == cfun->eh->sjlj_exit_after) | |
2229 | break; | |
2230 | if (insn) | |
2231 | insert_insn_on_edge (seq, e); | |
2232 | else | |
2233 | { | |
2234 | insn = cfun->eh->sjlj_exit_after; | |
2235 | if (GET_CODE (insn) == CODE_LABEL) | |
2236 | insn = NEXT_INSN (insn); | |
2237 | emit_insn_after (seq, insn); | |
2238 | } | |
2239 | } | |
9a0d1e1b AM |
2240 | } |
2241 | ||
52a11cbf | 2242 | static void |
502b8322 | 2243 | sjlj_emit_dispatch_table (rtx dispatch_label, struct sjlj_lp_info *lp_info) |
ce152ef8 | 2244 | { |
52a11cbf RH |
2245 | int i, first_reachable; |
2246 | rtx mem, dispatch, seq, fc; | |
12c3874e JH |
2247 | rtx before; |
2248 | basic_block bb; | |
2249 | edge e; | |
52a11cbf RH |
2250 | |
2251 | fc = cfun->eh->sjlj_fc; | |
2252 | ||
2253 | start_sequence (); | |
2254 | ||
2255 | emit_label (dispatch_label); | |
3f2c5d1a | 2256 | |
52a11cbf RH |
2257 | #ifndef DONT_USE_BUILTIN_SETJMP |
2258 | expand_builtin_setjmp_receiver (dispatch_label); | |
2259 | #endif | |
2260 | ||
2261 | /* Load up dispatch index, exc_ptr and filter values from the | |
2262 | function context. */ | |
f4ef873c RK |
2263 | mem = adjust_address (fc, TYPE_MODE (integer_type_node), |
2264 | sjlj_fc_call_site_ofs); | |
52a11cbf RH |
2265 | dispatch = copy_to_reg (mem); |
2266 | ||
f4ef873c | 2267 | mem = adjust_address (fc, word_mode, sjlj_fc_data_ofs); |
f920765d | 2268 | if (word_mode != ptr_mode) |
52a11cbf RH |
2269 | { |
2270 | #ifdef POINTERS_EXTEND_UNSIGNED | |
f920765d | 2271 | mem = convert_memory_address (ptr_mode, mem); |
52a11cbf | 2272 | #else |
f920765d | 2273 | mem = convert_to_mode (ptr_mode, mem, 0); |
52a11cbf RH |
2274 | #endif |
2275 | } | |
2276 | emit_move_insn (cfun->eh->exc_ptr, mem); | |
2277 | ||
f4ef873c | 2278 | mem = adjust_address (fc, word_mode, sjlj_fc_data_ofs + UNITS_PER_WORD); |
52a11cbf | 2279 | emit_move_insn (cfun->eh->filter, mem); |
4956d07c | 2280 | |
52a11cbf RH |
2281 | /* Jump to one of the directly reachable regions. */ |
2282 | /* ??? This really ought to be using a switch statement. */ | |
2283 | ||
2284 | first_reachable = 0; | |
2285 | for (i = cfun->eh->last_region_number; i > 0; --i) | |
a1622f83 | 2286 | { |
98ce21b3 | 2287 | if (! lp_info[i].directly_reachable) |
52a11cbf | 2288 | continue; |
a1622f83 | 2289 | |
52a11cbf RH |
2290 | if (! first_reachable) |
2291 | { | |
2292 | first_reachable = i; | |
2293 | continue; | |
2294 | } | |
e6cfb550 | 2295 | |
a06ef755 RK |
2296 | emit_cmp_and_jump_insns (dispatch, GEN_INT (lp_info[i].dispatch_index), |
2297 | EQ, NULL_RTX, TYPE_MODE (integer_type_node), 0, | |
52a11cbf | 2298 | cfun->eh->region_array[i]->post_landing_pad); |
a1622f83 | 2299 | } |
9a0d1e1b | 2300 | |
52a11cbf RH |
2301 | seq = get_insns (); |
2302 | end_sequence (); | |
4956d07c | 2303 | |
12c3874e JH |
2304 | before = cfun->eh->region_array[first_reachable]->post_landing_pad; |
2305 | ||
2306 | bb = emit_to_new_bb_before (seq, before); | |
2307 | e = make_edge (bb, bb->next_bb, EDGE_FALLTHRU); | |
2308 | e->count = bb->count; | |
2309 | e->probability = REG_BR_PROB_BASE; | |
ce152ef8 AM |
2310 | } |
2311 | ||
52a11cbf | 2312 | static void |
502b8322 | 2313 | sjlj_build_landing_pads (void) |
ce152ef8 | 2314 | { |
52a11cbf | 2315 | struct sjlj_lp_info *lp_info; |
ce152ef8 | 2316 | |
703ad42b KG |
2317 | lp_info = xcalloc (cfun->eh->last_region_number + 1, |
2318 | sizeof (struct sjlj_lp_info)); | |
ce152ef8 | 2319 | |
52a11cbf RH |
2320 | if (sjlj_find_directly_reachable_regions (lp_info)) |
2321 | { | |
2322 | rtx dispatch_label = gen_label_rtx (); | |
ce152ef8 | 2323 | |
52a11cbf RH |
2324 | cfun->eh->sjlj_fc |
2325 | = assign_stack_local (TYPE_MODE (sjlj_fc_type_node), | |
2326 | int_size_in_bytes (sjlj_fc_type_node), | |
2327 | TYPE_ALIGN (sjlj_fc_type_node)); | |
4956d07c | 2328 | |
52a11cbf RH |
2329 | sjlj_assign_call_site_values (dispatch_label, lp_info); |
2330 | sjlj_mark_call_sites (lp_info); | |
a1622f83 | 2331 | |
52a11cbf RH |
2332 | sjlj_emit_function_enter (dispatch_label); |
2333 | sjlj_emit_dispatch_table (dispatch_label, lp_info); | |
2334 | sjlj_emit_function_exit (); | |
2335 | } | |
a1622f83 | 2336 | |
52a11cbf | 2337 | free (lp_info); |
4956d07c | 2338 | } |
ce152ef8 | 2339 | |
ce152ef8 | 2340 | void |
502b8322 | 2341 | finish_eh_generation (void) |
ce152ef8 | 2342 | { |
12c3874e JH |
2343 | basic_block bb; |
2344 | ||
52a11cbf RH |
2345 | /* Nothing to do if no regions created. */ |
2346 | if (cfun->eh->region_tree == NULL) | |
ce152ef8 AM |
2347 | return; |
2348 | ||
52a11cbf RH |
2349 | /* The object here is to provide find_basic_blocks with detailed |
2350 | information (via reachable_handlers) on how exception control | |
2351 | flows within the function. In this first pass, we can include | |
2352 | type information garnered from ERT_THROW and ERT_ALLOWED_EXCEPTIONS | |
2353 | regions, and hope that it will be useful in deleting unreachable | |
2354 | handlers. Subsequently, we will generate landing pads which will | |
2355 | connect many of the handlers, and then type information will not | |
2356 | be effective. Still, this is a win over previous implementations. */ | |
2357 | ||
95479831 | 2358 | cleanup_cfg (CLEANUP_PRE_LOOP | CLEANUP_NO_INSN_DEL); |
52a11cbf RH |
2359 | |
2360 | /* These registers are used by the landing pads. Make sure they | |
2361 | have been generated. */ | |
86c99549 RH |
2362 | get_exception_pointer (cfun); |
2363 | get_exception_filter (cfun); | |
52a11cbf RH |
2364 | |
2365 | /* Construct the landing pads. */ | |
2366 | ||
2367 | assign_filter_values (); | |
2368 | build_post_landing_pads (); | |
2369 | connect_post_landing_pads (); | |
2370 | if (USING_SJLJ_EXCEPTIONS) | |
2371 | sjlj_build_landing_pads (); | |
2372 | else | |
2373 | dw2_build_landing_pads (); | |
ce152ef8 | 2374 | |
52a11cbf | 2375 | cfun->eh->built_landing_pads = 1; |
ce152ef8 | 2376 | |
52a11cbf RH |
2377 | /* We've totally changed the CFG. Start over. */ |
2378 | find_exception_handler_labels (); | |
12c3874e JH |
2379 | break_superblocks (); |
2380 | if (USING_SJLJ_EXCEPTIONS) | |
2381 | commit_edge_insertions (); | |
2382 | FOR_EACH_BB (bb) | |
2383 | { | |
2384 | edge e, next; | |
2385 | bool eh = false; | |
2386 | for (e = bb->succ; e; e = next) | |
2387 | { | |
2388 | next = e->succ_next; | |
2389 | if (e->flags & EDGE_EH) | |
2390 | { | |
2391 | remove_edge (e); | |
2392 | eh = true; | |
2393 | } | |
2394 | } | |
2395 | if (eh) | |
2396 | make_eh_edge (NULL, bb, BB_END (bb)); | |
2397 | } | |
95479831 | 2398 | cleanup_cfg (CLEANUP_PRE_LOOP | CLEANUP_NO_INSN_DEL); |
ce152ef8 | 2399 | } |
4956d07c | 2400 | \f |
6a58eee9 | 2401 | static hashval_t |
502b8322 | 2402 | ehl_hash (const void *pentry) |
6a58eee9 RH |
2403 | { |
2404 | struct ehl_map_entry *entry = (struct ehl_map_entry *) pentry; | |
2405 | ||
2406 | /* 2^32 * ((sqrt(5) - 1) / 2) */ | |
2407 | const hashval_t scaled_golden_ratio = 0x9e3779b9; | |
2408 | return CODE_LABEL_NUMBER (entry->label) * scaled_golden_ratio; | |
2409 | } | |
2410 | ||
2411 | static int | |
502b8322 | 2412 | ehl_eq (const void *pentry, const void *pdata) |
6a58eee9 RH |
2413 | { |
2414 | struct ehl_map_entry *entry = (struct ehl_map_entry *) pentry; | |
2415 | struct ehl_map_entry *data = (struct ehl_map_entry *) pdata; | |
2416 | ||
2417 | return entry->label == data->label; | |
2418 | } | |
2419 | ||
52a11cbf | 2420 | /* This section handles removing dead code for flow. */ |
154bba13 | 2421 | |
6a58eee9 | 2422 | /* Remove LABEL from exception_handler_label_map. */ |
154bba13 | 2423 | |
52a11cbf | 2424 | static void |
502b8322 | 2425 | remove_exception_handler_label (rtx label) |
154bba13 | 2426 | { |
6a58eee9 | 2427 | struct ehl_map_entry **slot, tmp; |
100d81d4 | 2428 | |
6a58eee9 | 2429 | /* If exception_handler_label_map was not built yet, |
655dd289 | 2430 | there is nothing to do. */ |
e2500fed | 2431 | if (cfun->eh->exception_handler_label_map == NULL) |
655dd289 JJ |
2432 | return; |
2433 | ||
6a58eee9 RH |
2434 | tmp.label = label; |
2435 | slot = (struct ehl_map_entry **) | |
e2500fed | 2436 | htab_find_slot (cfun->eh->exception_handler_label_map, &tmp, NO_INSERT); |
6a58eee9 RH |
2437 | if (! slot) |
2438 | abort (); | |
154bba13 | 2439 | |
e2500fed | 2440 | htab_clear_slot (cfun->eh->exception_handler_label_map, (void **) slot); |
154bba13 TT |
2441 | } |
2442 | ||
52a11cbf | 2443 | /* Splice REGION from the region tree etc. */ |
12670d88 | 2444 | |
f19c9228 | 2445 | static void |
502b8322 | 2446 | remove_eh_handler (struct eh_region *region) |
4956d07c | 2447 | { |
ff2c46ac | 2448 | struct eh_region **pp, **pp_start, *p, *outer, *inner; |
52a11cbf | 2449 | rtx lab; |
4956d07c | 2450 | |
52a11cbf RH |
2451 | /* For the benefit of efficiently handling REG_EH_REGION notes, |
2452 | replace this region in the region array with its containing | |
2453 | region. Note that previous region deletions may result in | |
6a58eee9 RH |
2454 | multiple copies of this region in the array, so we have a |
2455 | list of alternate numbers by which we are known. */ | |
2456 | ||
ff2c46ac RH |
2457 | outer = region->outer; |
2458 | cfun->eh->region_array[region->region_number] = outer; | |
6a58eee9 RH |
2459 | if (region->aka) |
2460 | { | |
2461 | int i; | |
2462 | EXECUTE_IF_SET_IN_BITMAP (region->aka, 0, i, | |
ff2c46ac | 2463 | { cfun->eh->region_array[i] = outer; }); |
6a58eee9 RH |
2464 | } |
2465 | ||
ff2c46ac | 2466 | if (outer) |
6a58eee9 | 2467 | { |
ff2c46ac | 2468 | if (!outer->aka) |
e2500fed | 2469 | outer->aka = BITMAP_GGC_ALLOC (); |
6a58eee9 | 2470 | if (region->aka) |
ff2c46ac RH |
2471 | bitmap_a_or_b (outer->aka, outer->aka, region->aka); |
2472 | bitmap_set_bit (outer->aka, region->region_number); | |
6a58eee9 | 2473 | } |
52a11cbf RH |
2474 | |
2475 | if (cfun->eh->built_landing_pads) | |
2476 | lab = region->landing_pad; | |
2477 | else | |
2478 | lab = region->label; | |
2479 | if (lab) | |
2480 | remove_exception_handler_label (lab); | |
2481 | ||
ff2c46ac RH |
2482 | if (outer) |
2483 | pp_start = &outer->inner; | |
52a11cbf | 2484 | else |
ff2c46ac RH |
2485 | pp_start = &cfun->eh->region_tree; |
2486 | for (pp = pp_start, p = *pp; p != region; pp = &p->next_peer, p = *pp) | |
52a11cbf | 2487 | continue; |
ff2c46ac | 2488 | *pp = region->next_peer; |
12670d88 | 2489 | |
ff2c46ac RH |
2490 | inner = region->inner; |
2491 | if (inner) | |
4956d07c | 2492 | { |
ff2c46ac RH |
2493 | for (p = inner; p->next_peer ; p = p->next_peer) |
2494 | p->outer = outer; | |
2495 | p->outer = outer; | |
2496 | ||
2497 | p->next_peer = *pp_start; | |
2498 | *pp_start = inner; | |
4956d07c | 2499 | } |
f19c9228 | 2500 | |
52a11cbf RH |
2501 | if (region->type == ERT_CATCH) |
2502 | { | |
2503 | struct eh_region *try, *next, *prev; | |
f19c9228 | 2504 | |
52a11cbf RH |
2505 | for (try = region->next_peer; |
2506 | try->type == ERT_CATCH; | |
2507 | try = try->next_peer) | |
2508 | continue; | |
2509 | if (try->type != ERT_TRY) | |
2510 | abort (); | |
f19c9228 | 2511 | |
52a11cbf RH |
2512 | next = region->u.catch.next_catch; |
2513 | prev = region->u.catch.prev_catch; | |
f19c9228 | 2514 | |
52a11cbf RH |
2515 | if (next) |
2516 | next->u.catch.prev_catch = prev; | |
2517 | else | |
2518 | try->u.try.last_catch = prev; | |
2519 | if (prev) | |
2520 | prev->u.catch.next_catch = next; | |
2521 | else | |
2522 | { | |
2523 | try->u.try.catch = next; | |
2524 | if (! next) | |
2525 | remove_eh_handler (try); | |
2526 | } | |
2527 | } | |
4956d07c MS |
2528 | } |
2529 | ||
52a11cbf RH |
2530 | /* LABEL heads a basic block that is about to be deleted. If this |
2531 | label corresponds to an exception region, we may be able to | |
2532 | delete the region. */ | |
4956d07c MS |
2533 | |
2534 | void | |
502b8322 | 2535 | maybe_remove_eh_handler (rtx label) |
4956d07c | 2536 | { |
6a58eee9 RH |
2537 | struct ehl_map_entry **slot, tmp; |
2538 | struct eh_region *region; | |
4956d07c | 2539 | |
52a11cbf RH |
2540 | /* ??? After generating landing pads, it's not so simple to determine |
2541 | if the region data is completely unused. One must examine the | |
2542 | landing pad and the post landing pad, and whether an inner try block | |
2543 | is referencing the catch handlers directly. */ | |
2544 | if (cfun->eh->built_landing_pads) | |
4956d07c MS |
2545 | return; |
2546 | ||
6a58eee9 RH |
2547 | tmp.label = label; |
2548 | slot = (struct ehl_map_entry **) | |
e2500fed | 2549 | htab_find_slot (cfun->eh->exception_handler_label_map, &tmp, NO_INSERT); |
6a58eee9 RH |
2550 | if (! slot) |
2551 | return; | |
2552 | region = (*slot)->region; | |
2553 | if (! region) | |
2554 | return; | |
2555 | ||
2556 | /* Flow will want to remove MUST_NOT_THROW regions as unreachable | |
2557 | because there is no path to the fallback call to terminate. | |
2558 | But the region continues to affect call-site data until there | |
2559 | are no more contained calls, which we don't see here. */ | |
2560 | if (region->type == ERT_MUST_NOT_THROW) | |
87ff9c8e | 2561 | { |
e2500fed | 2562 | htab_clear_slot (cfun->eh->exception_handler_label_map, (void **) slot); |
6a58eee9 | 2563 | region->label = NULL_RTX; |
87ff9c8e | 2564 | } |
6a58eee9 RH |
2565 | else |
2566 | remove_eh_handler (region); | |
2567 | } | |
2568 | ||
2569 | /* Invokes CALLBACK for every exception handler label. Only used by old | |
2570 | loop hackery; should not be used by new code. */ | |
2571 | ||
2572 | void | |
502b8322 | 2573 | for_each_eh_label (void (*callback) (rtx)) |
6a58eee9 | 2574 | { |
e2500fed | 2575 | htab_traverse (cfun->eh->exception_handler_label_map, for_each_eh_label_1, |
3897f229 | 2576 | (void *) &callback); |
87ff9c8e RH |
2577 | } |
2578 | ||
6a58eee9 | 2579 | static int |
502b8322 | 2580 | for_each_eh_label_1 (void **pentry, void *data) |
6a58eee9 RH |
2581 | { |
2582 | struct ehl_map_entry *entry = *(struct ehl_map_entry **)pentry; | |
3897f229 | 2583 | void (*callback) (rtx) = *(void (**) (rtx)) data; |
6a58eee9 RH |
2584 | |
2585 | (*callback) (entry->label); | |
2586 | return 1; | |
2587 | } | |
52a11cbf RH |
2588 | \f |
2589 | /* This section describes CFG exception edges for flow. */ | |
87ff9c8e | 2590 | |
52a11cbf | 2591 | /* For communicating between calls to reachable_next_level. */ |
e2500fed | 2592 | struct reachable_info GTY(()) |
87ff9c8e | 2593 | { |
52a11cbf RH |
2594 | tree types_caught; |
2595 | tree types_allowed; | |
2596 | rtx handlers; | |
2597 | }; | |
87ff9c8e | 2598 | |
52a11cbf RH |
2599 | /* A subroutine of reachable_next_level. Return true if TYPE, or a |
2600 | base class of TYPE, is in HANDLED. */ | |
87ff9c8e | 2601 | |
52a11cbf | 2602 | static int |
502b8322 | 2603 | check_handled (tree handled, tree type) |
87ff9c8e | 2604 | { |
52a11cbf RH |
2605 | tree t; |
2606 | ||
2607 | /* We can check for exact matches without front-end help. */ | |
2608 | if (! lang_eh_type_covers) | |
f54a7f6f | 2609 | { |
52a11cbf RH |
2610 | for (t = handled; t ; t = TREE_CHAIN (t)) |
2611 | if (TREE_VALUE (t) == type) | |
2612 | return 1; | |
2613 | } | |
2614 | else | |
2615 | { | |
2616 | for (t = handled; t ; t = TREE_CHAIN (t)) | |
2617 | if ((*lang_eh_type_covers) (TREE_VALUE (t), type)) | |
2618 | return 1; | |
f54a7f6f | 2619 | } |
52a11cbf RH |
2620 | |
2621 | return 0; | |
87ff9c8e RH |
2622 | } |
2623 | ||
52a11cbf RH |
2624 | /* A subroutine of reachable_next_level. If we are collecting a list |
2625 | of handlers, add one. After landing pad generation, reference | |
2626 | it instead of the handlers themselves. Further, the handlers are | |
3f2c5d1a | 2627 | all wired together, so by referencing one, we've got them all. |
52a11cbf RH |
2628 | Before landing pad generation we reference each handler individually. |
2629 | ||
2630 | LP_REGION contains the landing pad; REGION is the handler. */ | |
87ff9c8e RH |
2631 | |
2632 | static void | |
502b8322 | 2633 | add_reachable_handler (struct reachable_info *info, struct eh_region *lp_region, struct eh_region *region) |
87ff9c8e | 2634 | { |
52a11cbf RH |
2635 | if (! info) |
2636 | return; | |
2637 | ||
2638 | if (cfun->eh->built_landing_pads) | |
87ff9c8e | 2639 | { |
52a11cbf RH |
2640 | if (! info->handlers) |
2641 | info->handlers = alloc_INSN_LIST (lp_region->landing_pad, NULL_RTX); | |
87ff9c8e | 2642 | } |
52a11cbf RH |
2643 | else |
2644 | info->handlers = alloc_INSN_LIST (region->label, info->handlers); | |
87ff9c8e RH |
2645 | } |
2646 | ||
3f2c5d1a | 2647 | /* Process one level of exception regions for reachability. |
52a11cbf RH |
2648 | If TYPE_THROWN is non-null, then it is the *exact* type being |
2649 | propagated. If INFO is non-null, then collect handler labels | |
2650 | and caught/allowed type information between invocations. */ | |
87ff9c8e | 2651 | |
52a11cbf | 2652 | static enum reachable_code |
502b8322 AJ |
2653 | reachable_next_level (struct eh_region *region, tree type_thrown, |
2654 | struct reachable_info *info) | |
87ff9c8e | 2655 | { |
52a11cbf RH |
2656 | switch (region->type) |
2657 | { | |
2658 | case ERT_CLEANUP: | |
2659 | /* Before landing-pad generation, we model control flow | |
2660 | directly to the individual handlers. In this way we can | |
2661 | see that catch handler types may shadow one another. */ | |
2662 | add_reachable_handler (info, region, region); | |
2663 | return RNL_MAYBE_CAUGHT; | |
2664 | ||
2665 | case ERT_TRY: | |
2666 | { | |
2667 | struct eh_region *c; | |
2668 | enum reachable_code ret = RNL_NOT_CAUGHT; | |
fa51b01b | 2669 | |
52a11cbf RH |
2670 | for (c = region->u.try.catch; c ; c = c->u.catch.next_catch) |
2671 | { | |
2672 | /* A catch-all handler ends the search. */ | |
6d41a92f | 2673 | if (c->u.catch.type_list == NULL) |
52a11cbf RH |
2674 | { |
2675 | add_reachable_handler (info, region, c); | |
2676 | return RNL_CAUGHT; | |
2677 | } | |
2678 | ||
2679 | if (type_thrown) | |
2680 | { | |
a8154559 | 2681 | /* If we have at least one type match, end the search. */ |
6d41a92f | 2682 | tree tp_node = c->u.catch.type_list; |
3f2c5d1a | 2683 | |
6d41a92f | 2684 | for (; tp_node; tp_node = TREE_CHAIN (tp_node)) |
52a11cbf | 2685 | { |
6d41a92f OH |
2686 | tree type = TREE_VALUE (tp_node); |
2687 | ||
2688 | if (type == type_thrown | |
2689 | || (lang_eh_type_covers | |
2690 | && (*lang_eh_type_covers) (type, type_thrown))) | |
2691 | { | |
2692 | add_reachable_handler (info, region, c); | |
2693 | return RNL_CAUGHT; | |
2694 | } | |
52a11cbf RH |
2695 | } |
2696 | ||
2697 | /* If we have definitive information of a match failure, | |
2698 | the catch won't trigger. */ | |
2699 | if (lang_eh_type_covers) | |
2700 | return RNL_NOT_CAUGHT; | |
2701 | } | |
2702 | ||
6d41a92f OH |
2703 | /* At this point, we either don't know what type is thrown or |
2704 | don't have front-end assistance to help deciding if it is | |
2705 | covered by one of the types in the list for this region. | |
3f2c5d1a | 2706 | |
6d41a92f OH |
2707 | We'd then like to add this region to the list of reachable |
2708 | handlers since it is indeed potentially reachable based on the | |
3f2c5d1a RS |
2709 | information we have. |
2710 | ||
6d41a92f OH |
2711 | Actually, this handler is for sure not reachable if all the |
2712 | types it matches have already been caught. That is, it is only | |
2713 | potentially reachable if at least one of the types it catches | |
2714 | has not been previously caught. */ | |
2715 | ||
52a11cbf RH |
2716 | if (! info) |
2717 | ret = RNL_MAYBE_CAUGHT; | |
6d41a92f | 2718 | else |
52a11cbf | 2719 | { |
6d41a92f OH |
2720 | tree tp_node = c->u.catch.type_list; |
2721 | bool maybe_reachable = false; | |
52a11cbf | 2722 | |
6d41a92f OH |
2723 | /* Compute the potential reachability of this handler and |
2724 | update the list of types caught at the same time. */ | |
2725 | for (; tp_node; tp_node = TREE_CHAIN (tp_node)) | |
2726 | { | |
2727 | tree type = TREE_VALUE (tp_node); | |
2728 | ||
2729 | if (! check_handled (info->types_caught, type)) | |
2730 | { | |
2731 | info->types_caught | |
2732 | = tree_cons (NULL, type, info->types_caught); | |
3f2c5d1a | 2733 | |
6d41a92f OH |
2734 | maybe_reachable = true; |
2735 | } | |
2736 | } | |
3f2c5d1a | 2737 | |
6d41a92f OH |
2738 | if (maybe_reachable) |
2739 | { | |
2740 | add_reachable_handler (info, region, c); | |
3f2c5d1a | 2741 | |
6d41a92f OH |
2742 | /* ??? If the catch type is a base class of every allowed |
2743 | type, then we know we can stop the search. */ | |
2744 | ret = RNL_MAYBE_CAUGHT; | |
2745 | } | |
52a11cbf RH |
2746 | } |
2747 | } | |
87ff9c8e | 2748 | |
52a11cbf RH |
2749 | return ret; |
2750 | } | |
87ff9c8e | 2751 | |
52a11cbf RH |
2752 | case ERT_ALLOWED_EXCEPTIONS: |
2753 | /* An empty list of types definitely ends the search. */ | |
2754 | if (region->u.allowed.type_list == NULL_TREE) | |
2755 | { | |
2756 | add_reachable_handler (info, region, region); | |
2757 | return RNL_CAUGHT; | |
2758 | } | |
87ff9c8e | 2759 | |
52a11cbf RH |
2760 | /* Collect a list of lists of allowed types for use in detecting |
2761 | when a catch may be transformed into a catch-all. */ | |
2762 | if (info) | |
2763 | info->types_allowed = tree_cons (NULL_TREE, | |
2764 | region->u.allowed.type_list, | |
2765 | info->types_allowed); | |
3f2c5d1a | 2766 | |
684d9f3b | 2767 | /* If we have definitive information about the type hierarchy, |
52a11cbf RH |
2768 | then we can tell if the thrown type will pass through the |
2769 | filter. */ | |
2770 | if (type_thrown && lang_eh_type_covers) | |
2771 | { | |
2772 | if (check_handled (region->u.allowed.type_list, type_thrown)) | |
2773 | return RNL_NOT_CAUGHT; | |
2774 | else | |
2775 | { | |
2776 | add_reachable_handler (info, region, region); | |
2777 | return RNL_CAUGHT; | |
2778 | } | |
2779 | } | |
21cd906e | 2780 | |
52a11cbf RH |
2781 | add_reachable_handler (info, region, region); |
2782 | return RNL_MAYBE_CAUGHT; | |
21cd906e | 2783 | |
52a11cbf | 2784 | case ERT_CATCH: |
fbe5a4a6 | 2785 | /* Catch regions are handled by their controlling try region. */ |
52a11cbf | 2786 | return RNL_NOT_CAUGHT; |
21cd906e | 2787 | |
52a11cbf RH |
2788 | case ERT_MUST_NOT_THROW: |
2789 | /* Here we end our search, since no exceptions may propagate. | |
2790 | If we've touched down at some landing pad previous, then the | |
2791 | explicit function call we generated may be used. Otherwise | |
2792 | the call is made by the runtime. */ | |
2793 | if (info && info->handlers) | |
21cd906e | 2794 | { |
52a11cbf | 2795 | add_reachable_handler (info, region, region); |
0fb7aeda | 2796 | return RNL_CAUGHT; |
21cd906e | 2797 | } |
52a11cbf RH |
2798 | else |
2799 | return RNL_BLOCKED; | |
21cd906e | 2800 | |
52a11cbf RH |
2801 | case ERT_THROW: |
2802 | case ERT_FIXUP: | |
3f2c5d1a | 2803 | case ERT_UNKNOWN: |
52a11cbf RH |
2804 | /* Shouldn't see these here. */ |
2805 | break; | |
21cd906e | 2806 | } |
fa51b01b | 2807 | |
52a11cbf | 2808 | abort (); |
fa51b01b | 2809 | } |
4956d07c | 2810 | |
52a11cbf RH |
2811 | /* Retrieve a list of labels of exception handlers which can be |
2812 | reached by a given insn. */ | |
4956d07c | 2813 | |
52a11cbf | 2814 | rtx |
502b8322 | 2815 | reachable_handlers (rtx insn) |
4956d07c | 2816 | { |
52a11cbf RH |
2817 | struct reachable_info info; |
2818 | struct eh_region *region; | |
2819 | tree type_thrown; | |
2820 | int region_number; | |
fb13d4d0 | 2821 | |
52a11cbf RH |
2822 | if (GET_CODE (insn) == JUMP_INSN |
2823 | && GET_CODE (PATTERN (insn)) == RESX) | |
2824 | region_number = XINT (PATTERN (insn), 0); | |
2825 | else | |
1ef1bf06 AM |
2826 | { |
2827 | rtx note = find_reg_note (insn, REG_EH_REGION, NULL_RTX); | |
52a11cbf RH |
2828 | if (!note || INTVAL (XEXP (note, 0)) <= 0) |
2829 | return NULL; | |
2830 | region_number = INTVAL (XEXP (note, 0)); | |
27a36778 | 2831 | } |
4956d07c | 2832 | |
52a11cbf | 2833 | memset (&info, 0, sizeof (info)); |
4956d07c | 2834 | |
52a11cbf | 2835 | region = cfun->eh->region_array[region_number]; |
fb13d4d0 | 2836 | |
52a11cbf | 2837 | type_thrown = NULL_TREE; |
7f206d8f RH |
2838 | if (GET_CODE (insn) == JUMP_INSN |
2839 | && GET_CODE (PATTERN (insn)) == RESX) | |
2840 | { | |
2841 | /* A RESX leaves a region instead of entering it. Thus the | |
2842 | region itself may have been deleted out from under us. */ | |
2843 | if (region == NULL) | |
2844 | return NULL; | |
2845 | region = region->outer; | |
2846 | } | |
2847 | else if (region->type == ERT_THROW) | |
52a11cbf RH |
2848 | { |
2849 | type_thrown = region->u.throw.type; | |
2850 | region = region->outer; | |
2851 | } | |
fac62ecf | 2852 | |
bafb714b MM |
2853 | while (region) |
2854 | { | |
2855 | if (reachable_next_level (region, type_thrown, &info) >= RNL_CAUGHT) | |
a944ceb9 | 2856 | break; |
bafb714b MM |
2857 | /* If we have processed one cleanup, there is no point in |
2858 | processing any more of them. Each cleanup will have an edge | |
2859 | to the next outer cleanup region, so the flow graph will be | |
2860 | accurate. */ | |
2861 | if (region->type == ERT_CLEANUP) | |
2862 | region = region->u.cleanup.prev_try; | |
2863 | else | |
2864 | region = region->outer; | |
2865 | } | |
502b8322 | 2866 | |
52a11cbf | 2867 | return info.handlers; |
fb13d4d0 JM |
2868 | } |
2869 | ||
52a11cbf RH |
2870 | /* Determine if the given INSN can throw an exception that is caught |
2871 | within the function. */ | |
4956d07c | 2872 | |
52a11cbf | 2873 | bool |
502b8322 | 2874 | can_throw_internal (rtx insn) |
4956d07c | 2875 | { |
52a11cbf RH |
2876 | struct eh_region *region; |
2877 | tree type_thrown; | |
2878 | rtx note; | |
e6cfb550 | 2879 | |
52a11cbf RH |
2880 | if (! INSN_P (insn)) |
2881 | return false; | |
12670d88 | 2882 | |
52a11cbf RH |
2883 | if (GET_CODE (insn) == INSN |
2884 | && GET_CODE (PATTERN (insn)) == SEQUENCE) | |
2885 | insn = XVECEXP (PATTERN (insn), 0, 0); | |
4956d07c | 2886 | |
52a11cbf RH |
2887 | if (GET_CODE (insn) == CALL_INSN |
2888 | && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) | |
4956d07c | 2889 | { |
52a11cbf RH |
2890 | int i; |
2891 | for (i = 0; i < 3; ++i) | |
4956d07c | 2892 | { |
52a11cbf RH |
2893 | rtx sub = XEXP (PATTERN (insn), i); |
2894 | for (; sub ; sub = NEXT_INSN (sub)) | |
2895 | if (can_throw_internal (sub)) | |
2896 | return true; | |
4956d07c | 2897 | } |
52a11cbf | 2898 | return false; |
4956d07c MS |
2899 | } |
2900 | ||
52a11cbf RH |
2901 | /* Every insn that might throw has an EH_REGION note. */ |
2902 | note = find_reg_note (insn, REG_EH_REGION, NULL_RTX); | |
2903 | if (!note || INTVAL (XEXP (note, 0)) <= 0) | |
2904 | return false; | |
4956d07c | 2905 | |
52a11cbf | 2906 | region = cfun->eh->region_array[INTVAL (XEXP (note, 0))]; |
4956d07c | 2907 | |
52a11cbf RH |
2908 | type_thrown = NULL_TREE; |
2909 | if (region->type == ERT_THROW) | |
2910 | { | |
2911 | type_thrown = region->u.throw.type; | |
2912 | region = region->outer; | |
2913 | } | |
4956d07c | 2914 | |
52a11cbf RH |
2915 | /* If this exception is ignored by each and every containing region, |
2916 | then control passes straight out. The runtime may handle some | |
2917 | regions, which also do not require processing internally. */ | |
2918 | for (; region; region = region->outer) | |
2919 | { | |
2920 | enum reachable_code how = reachable_next_level (region, type_thrown, 0); | |
2921 | if (how == RNL_BLOCKED) | |
2922 | return false; | |
2923 | if (how != RNL_NOT_CAUGHT) | |
0fb7aeda | 2924 | return true; |
4956d07c | 2925 | } |
4956d07c | 2926 | |
52a11cbf RH |
2927 | return false; |
2928 | } | |
4956d07c | 2929 | |
52a11cbf RH |
2930 | /* Determine if the given INSN can throw an exception that is |
2931 | visible outside the function. */ | |
4956d07c | 2932 | |
52a11cbf | 2933 | bool |
502b8322 | 2934 | can_throw_external (rtx insn) |
4956d07c | 2935 | { |
52a11cbf RH |
2936 | struct eh_region *region; |
2937 | tree type_thrown; | |
2938 | rtx note; | |
4956d07c | 2939 | |
52a11cbf RH |
2940 | if (! INSN_P (insn)) |
2941 | return false; | |
2942 | ||
2943 | if (GET_CODE (insn) == INSN | |
2944 | && GET_CODE (PATTERN (insn)) == SEQUENCE) | |
2945 | insn = XVECEXP (PATTERN (insn), 0, 0); | |
2946 | ||
2947 | if (GET_CODE (insn) == CALL_INSN | |
2948 | && GET_CODE (PATTERN (insn)) == CALL_PLACEHOLDER) | |
4956d07c | 2949 | { |
52a11cbf RH |
2950 | int i; |
2951 | for (i = 0; i < 3; ++i) | |
4956d07c | 2952 | { |
52a11cbf RH |
2953 | rtx sub = XEXP (PATTERN (insn), i); |
2954 | for (; sub ; sub = NEXT_INSN (sub)) | |
2955 | if (can_throw_external (sub)) | |
2956 | return true; | |
4956d07c | 2957 | } |
52a11cbf | 2958 | return false; |
4956d07c | 2959 | } |
52a11cbf RH |
2960 | |
2961 | note = find_reg_note (insn, REG_EH_REGION, NULL_RTX); | |
2962 | if (!note) | |
2963 | { | |
2964 | /* Calls (and trapping insns) without notes are outside any | |
2965 | exception handling region in this function. We have to | |
2966 | assume it might throw. Given that the front end and middle | |
2967 | ends mark known NOTHROW functions, this isn't so wildly | |
2968 | inaccurate. */ | |
2969 | return (GET_CODE (insn) == CALL_INSN | |
2970 | || (flag_non_call_exceptions | |
2971 | && may_trap_p (PATTERN (insn)))); | |
2972 | } | |
2973 | if (INTVAL (XEXP (note, 0)) <= 0) | |
2974 | return false; | |
2975 | ||
2976 | region = cfun->eh->region_array[INTVAL (XEXP (note, 0))]; | |
2977 | ||
2978 | type_thrown = NULL_TREE; | |
2979 | if (region->type == ERT_THROW) | |
2980 | { | |
2981 | type_thrown = region->u.throw.type; | |
2982 | region = region->outer; | |
2983 | } | |
2984 | ||
2985 | /* If the exception is caught or blocked by any containing region, | |
2986 | then it is not seen by any calling function. */ | |
2987 | for (; region ; region = region->outer) | |
2988 | if (reachable_next_level (region, type_thrown, NULL) >= RNL_CAUGHT) | |
2989 | return false; | |
2990 | ||
2991 | return true; | |
4956d07c | 2992 | } |
1ef1bf06 | 2993 | |
b6128b8c | 2994 | /* Set current_function_nothrow and cfun->all_throwers_are_sibcalls. */ |
6814a8a0 | 2995 | |
b6128b8c | 2996 | void |
502b8322 | 2997 | set_nothrow_function_flags (void) |
1ef1bf06 AM |
2998 | { |
2999 | rtx insn; | |
502b8322 | 3000 | |
b6128b8c | 3001 | current_function_nothrow = 1; |
1ef1bf06 | 3002 | |
b6128b8c SH |
3003 | /* Assume cfun->all_throwers_are_sibcalls until we encounter |
3004 | something that can throw an exception. We specifically exempt | |
3005 | CALL_INSNs that are SIBLING_CALL_P, as these are really jumps, | |
3006 | and can't throw. Most CALL_INSNs are not SIBLING_CALL_P, so this | |
3007 | is optimistic. */ | |
1ef1bf06 | 3008 | |
b6128b8c SH |
3009 | cfun->all_throwers_are_sibcalls = 1; |
3010 | ||
3011 | if (! flag_exceptions) | |
3012 | return; | |
502b8322 | 3013 | |
1ef1bf06 | 3014 | for (insn = get_insns (); insn; insn = NEXT_INSN (insn)) |
52a11cbf | 3015 | if (can_throw_external (insn)) |
b6128b8c SH |
3016 | { |
3017 | current_function_nothrow = 0; | |
3018 | ||
3019 | if (GET_CODE (insn) != CALL_INSN || !SIBLING_CALL_P (insn)) | |
3020 | { | |
3021 | cfun->all_throwers_are_sibcalls = 0; | |
3022 | return; | |
3023 | } | |
3024 | } | |
3025 | ||
52a11cbf RH |
3026 | for (insn = current_function_epilogue_delay_list; insn; |
3027 | insn = XEXP (insn, 1)) | |
b6128b8c SH |
3028 | if (can_throw_external (insn)) |
3029 | { | |
3030 | current_function_nothrow = 0; | |
4da896b2 | 3031 | |
b6128b8c SH |
3032 | if (GET_CODE (insn) != CALL_INSN || !SIBLING_CALL_P (insn)) |
3033 | { | |
3034 | cfun->all_throwers_are_sibcalls = 0; | |
3035 | return; | |
3036 | } | |
3037 | } | |
1ef1bf06 | 3038 | } |
52a11cbf | 3039 | |
ca55abae | 3040 | \f |
52a11cbf | 3041 | /* Various hooks for unwind library. */ |
ca55abae JM |
3042 | |
3043 | /* Do any necessary initialization to access arbitrary stack frames. | |
3044 | On the SPARC, this means flushing the register windows. */ | |
3045 | ||
3046 | void | |
502b8322 | 3047 | expand_builtin_unwind_init (void) |
ca55abae JM |
3048 | { |
3049 | /* Set this so all the registers get saved in our frame; we need to be | |
30f7a378 | 3050 | able to copy the saved values for any registers from frames we unwind. */ |
ca55abae JM |
3051 | current_function_has_nonlocal_label = 1; |
3052 | ||
3053 | #ifdef SETUP_FRAME_ADDRESSES | |
3054 | SETUP_FRAME_ADDRESSES (); | |
3055 | #endif | |
3056 | } | |
3057 | ||
52a11cbf | 3058 | rtx |
502b8322 | 3059 | expand_builtin_eh_return_data_regno (tree arglist) |
52a11cbf RH |
3060 | { |
3061 | tree which = TREE_VALUE (arglist); | |
3062 | unsigned HOST_WIDE_INT iwhich; | |
3063 | ||
3064 | if (TREE_CODE (which) != INTEGER_CST) | |
3065 | { | |
3066 | error ("argument of `__builtin_eh_return_regno' must be constant"); | |
3067 | return constm1_rtx; | |
3068 | } | |
3069 | ||
3070 | iwhich = tree_low_cst (which, 1); | |
3071 | iwhich = EH_RETURN_DATA_REGNO (iwhich); | |
3072 | if (iwhich == INVALID_REGNUM) | |
3073 | return constm1_rtx; | |
3074 | ||
3075 | #ifdef DWARF_FRAME_REGNUM | |
3076 | iwhich = DWARF_FRAME_REGNUM (iwhich); | |
3077 | #else | |
3078 | iwhich = DBX_REGISTER_NUMBER (iwhich); | |
3079 | #endif | |
3080 | ||
3f2c5d1a | 3081 | return GEN_INT (iwhich); |
52a11cbf RH |
3082 | } |
3083 | ||
ca55abae JM |
3084 | /* Given a value extracted from the return address register or stack slot, |
3085 | return the actual address encoded in that value. */ | |
3086 | ||
3087 | rtx | |
502b8322 | 3088 | expand_builtin_extract_return_addr (tree addr_tree) |
ca55abae JM |
3089 | { |
3090 | rtx addr = expand_expr (addr_tree, NULL_RTX, Pmode, 0); | |
52a11cbf | 3091 | |
0ab38418 EC |
3092 | if (GET_MODE (addr) != Pmode |
3093 | && GET_MODE (addr) != VOIDmode) | |
3094 | { | |
3095 | #ifdef POINTERS_EXTEND_UNSIGNED | |
3096 | addr = convert_memory_address (Pmode, addr); | |
3097 | #else | |
3098 | addr = convert_to_mode (Pmode, addr, 0); | |
3099 | #endif | |
3100 | } | |
3101 | ||
52a11cbf RH |
3102 | /* First mask out any unwanted bits. */ |
3103 | #ifdef MASK_RETURN_ADDR | |
22273300 | 3104 | expand_and (Pmode, addr, MASK_RETURN_ADDR, addr); |
52a11cbf RH |
3105 | #endif |
3106 | ||
3107 | /* Then adjust to find the real return address. */ | |
3108 | #if defined (RETURN_ADDR_OFFSET) | |
3109 | addr = plus_constant (addr, RETURN_ADDR_OFFSET); | |
3110 | #endif | |
3111 | ||
3112 | return addr; | |
ca55abae JM |
3113 | } |
3114 | ||
3115 | /* Given an actual address in addr_tree, do any necessary encoding | |
3116 | and return the value to be stored in the return address register or | |
3117 | stack slot so the epilogue will return to that address. */ | |
3118 | ||
3119 | rtx | |
502b8322 | 3120 | expand_builtin_frob_return_addr (tree addr_tree) |
ca55abae | 3121 | { |
4b6c1672 | 3122 | rtx addr = expand_expr (addr_tree, NULL_RTX, ptr_mode, 0); |
52a11cbf | 3123 | |
5ae6cd0d | 3124 | addr = convert_memory_address (Pmode, addr); |
be128cd9 | 3125 | |
ca55abae | 3126 | #ifdef RETURN_ADDR_OFFSET |
52a11cbf | 3127 | addr = force_reg (Pmode, addr); |
ca55abae JM |
3128 | addr = plus_constant (addr, -RETURN_ADDR_OFFSET); |
3129 | #endif | |
52a11cbf | 3130 | |
ca55abae JM |
3131 | return addr; |
3132 | } | |
3133 | ||
52a11cbf RH |
3134 | /* Set up the epilogue with the magic bits we'll need to return to the |
3135 | exception handler. */ | |
ca55abae | 3136 | |
52a11cbf | 3137 | void |
502b8322 AJ |
3138 | expand_builtin_eh_return (tree stackadj_tree ATTRIBUTE_UNUSED, |
3139 | tree handler_tree) | |
ca55abae | 3140 | { |
34dc173c | 3141 | rtx tmp; |
ca55abae | 3142 | |
34dc173c UW |
3143 | #ifdef EH_RETURN_STACKADJ_RTX |
3144 | tmp = expand_expr (stackadj_tree, cfun->eh->ehr_stackadj, VOIDmode, 0); | |
5ae6cd0d | 3145 | tmp = convert_memory_address (Pmode, tmp); |
34dc173c UW |
3146 | if (!cfun->eh->ehr_stackadj) |
3147 | cfun->eh->ehr_stackadj = copy_to_reg (tmp); | |
3148 | else if (tmp != cfun->eh->ehr_stackadj) | |
3149 | emit_move_insn (cfun->eh->ehr_stackadj, tmp); | |
be128cd9 RK |
3150 | #endif |
3151 | ||
34dc173c | 3152 | tmp = expand_expr (handler_tree, cfun->eh->ehr_handler, VOIDmode, 0); |
5ae6cd0d | 3153 | tmp = convert_memory_address (Pmode, tmp); |
34dc173c UW |
3154 | if (!cfun->eh->ehr_handler) |
3155 | cfun->eh->ehr_handler = copy_to_reg (tmp); | |
3156 | else if (tmp != cfun->eh->ehr_handler) | |
3157 | emit_move_insn (cfun->eh->ehr_handler, tmp); | |
ca55abae | 3158 | |
34dc173c UW |
3159 | if (!cfun->eh->ehr_label) |
3160 | cfun->eh->ehr_label = gen_label_rtx (); | |
52a11cbf | 3161 | emit_jump (cfun->eh->ehr_label); |
a1622f83 AM |
3162 | } |
3163 | ||
71038426 | 3164 | void |
502b8322 | 3165 | expand_eh_return (void) |
ca55abae | 3166 | { |
34dc173c | 3167 | rtx around_label; |
ca55abae | 3168 | |
52a11cbf | 3169 | if (! cfun->eh->ehr_label) |
71038426 | 3170 | return; |
ca55abae | 3171 | |
52a11cbf | 3172 | current_function_calls_eh_return = 1; |
ca55abae | 3173 | |
34dc173c UW |
3174 | #ifdef EH_RETURN_STACKADJ_RTX |
3175 | emit_move_insn (EH_RETURN_STACKADJ_RTX, const0_rtx); | |
3176 | #endif | |
3177 | ||
52a11cbf | 3178 | around_label = gen_label_rtx (); |
52a11cbf | 3179 | emit_jump (around_label); |
ca55abae | 3180 | |
52a11cbf RH |
3181 | emit_label (cfun->eh->ehr_label); |
3182 | clobber_return_register (); | |
ca55abae | 3183 | |
34dc173c UW |
3184 | #ifdef EH_RETURN_STACKADJ_RTX |
3185 | emit_move_insn (EH_RETURN_STACKADJ_RTX, cfun->eh->ehr_stackadj); | |
3186 | #endif | |
3187 | ||
52a11cbf RH |
3188 | #ifdef HAVE_eh_return |
3189 | if (HAVE_eh_return) | |
34dc173c | 3190 | emit_insn (gen_eh_return (cfun->eh->ehr_handler)); |
52a11cbf | 3191 | else |
71038426 | 3192 | #endif |
52a11cbf | 3193 | { |
34dc173c UW |
3194 | #ifdef EH_RETURN_HANDLER_RTX |
3195 | emit_move_insn (EH_RETURN_HANDLER_RTX, cfun->eh->ehr_handler); | |
3196 | #else | |
3197 | error ("__builtin_eh_return not supported on this target"); | |
3198 | #endif | |
52a11cbf | 3199 | } |
71038426 | 3200 | |
52a11cbf | 3201 | emit_label (around_label); |
71038426 | 3202 | } |
c76362b4 JW |
3203 | |
3204 | /* Convert a ptr_mode address ADDR_TREE to a Pmode address controlled by | |
3205 | POINTERS_EXTEND_UNSIGNED and return it. */ | |
3206 | ||
3207 | rtx | |
3208 | expand_builtin_extend_pointer (tree addr_tree) | |
3209 | { | |
3210 | rtx addr = expand_expr (addr_tree, NULL_RTX, ptr_mode, 0); | |
3211 | int extend; | |
3212 | ||
3213 | #ifdef POINTERS_EXTEND_UNSIGNED | |
3214 | extend = POINTERS_EXTEND_UNSIGNED; | |
3215 | #else | |
3216 | /* The previous EH code did an unsigned extend by default, so we do this also | |
3217 | for consistency. */ | |
3218 | extend = 1; | |
3219 | #endif | |
3220 | ||
3221 | return convert_modes (word_mode, ptr_mode, addr, extend); | |
3222 | } | |
77d33a84 | 3223 | \f |
949f197f | 3224 | /* In the following functions, we represent entries in the action table |
eaec9b3d | 3225 | as 1-based indices. Special cases are: |
949f197f RH |
3226 | |
3227 | 0: null action record, non-null landing pad; implies cleanups | |
3228 | -1: null action record, null landing pad; implies no action | |
3229 | -2: no call-site entry; implies must_not_throw | |
3230 | -3: we have yet to process outer regions | |
3231 | ||
3232 | Further, no special cases apply to the "next" field of the record. | |
3233 | For next, 0 means end of list. */ | |
3234 | ||
52a11cbf RH |
3235 | struct action_record |
3236 | { | |
3237 | int offset; | |
3238 | int filter; | |
3239 | int next; | |
3240 | }; | |
77d33a84 | 3241 | |
52a11cbf | 3242 | static int |
502b8322 | 3243 | action_record_eq (const void *pentry, const void *pdata) |
52a11cbf RH |
3244 | { |
3245 | const struct action_record *entry = (const struct action_record *) pentry; | |
3246 | const struct action_record *data = (const struct action_record *) pdata; | |
3247 | return entry->filter == data->filter && entry->next == data->next; | |
3248 | } | |
77d33a84 | 3249 | |
52a11cbf | 3250 | static hashval_t |
502b8322 | 3251 | action_record_hash (const void *pentry) |
52a11cbf RH |
3252 | { |
3253 | const struct action_record *entry = (const struct action_record *) pentry; | |
3254 | return entry->next * 1009 + entry->filter; | |
3255 | } | |
77d33a84 | 3256 | |
52a11cbf | 3257 | static int |
502b8322 | 3258 | add_action_record (htab_t ar_hash, int filter, int next) |
77d33a84 | 3259 | { |
52a11cbf RH |
3260 | struct action_record **slot, *new, tmp; |
3261 | ||
3262 | tmp.filter = filter; | |
3263 | tmp.next = next; | |
3264 | slot = (struct action_record **) htab_find_slot (ar_hash, &tmp, INSERT); | |
77d33a84 | 3265 | |
52a11cbf | 3266 | if ((new = *slot) == NULL) |
77d33a84 | 3267 | { |
703ad42b | 3268 | new = xmalloc (sizeof (*new)); |
52a11cbf RH |
3269 | new->offset = VARRAY_ACTIVE_SIZE (cfun->eh->action_record_data) + 1; |
3270 | new->filter = filter; | |
3271 | new->next = next; | |
3272 | *slot = new; | |
3273 | ||
3274 | /* The filter value goes in untouched. The link to the next | |
3275 | record is a "self-relative" byte offset, or zero to indicate | |
3276 | that there is no next record. So convert the absolute 1 based | |
eaec9b3d | 3277 | indices we've been carrying around into a displacement. */ |
52a11cbf RH |
3278 | |
3279 | push_sleb128 (&cfun->eh->action_record_data, filter); | |
3280 | if (next) | |
3281 | next -= VARRAY_ACTIVE_SIZE (cfun->eh->action_record_data) + 1; | |
3282 | push_sleb128 (&cfun->eh->action_record_data, next); | |
77d33a84 | 3283 | } |
77d33a84 | 3284 | |
52a11cbf RH |
3285 | return new->offset; |
3286 | } | |
77d33a84 | 3287 | |
52a11cbf | 3288 | static int |
502b8322 | 3289 | collect_one_action_chain (htab_t ar_hash, struct eh_region *region) |
77d33a84 | 3290 | { |
52a11cbf RH |
3291 | struct eh_region *c; |
3292 | int next; | |
77d33a84 | 3293 | |
52a11cbf RH |
3294 | /* If we've reached the top of the region chain, then we have |
3295 | no actions, and require no landing pad. */ | |
3296 | if (region == NULL) | |
3297 | return -1; | |
3298 | ||
3299 | switch (region->type) | |
77d33a84 | 3300 | { |
52a11cbf RH |
3301 | case ERT_CLEANUP: |
3302 | /* A cleanup adds a zero filter to the beginning of the chain, but | |
3303 | there are special cases to look out for. If there are *only* | |
3304 | cleanups along a path, then it compresses to a zero action. | |
3305 | Further, if there are multiple cleanups along a path, we only | |
3306 | need to represent one of them, as that is enough to trigger | |
3307 | entry to the landing pad at runtime. */ | |
3308 | next = collect_one_action_chain (ar_hash, region->outer); | |
3309 | if (next <= 0) | |
3310 | return 0; | |
3311 | for (c = region->outer; c ; c = c->outer) | |
3312 | if (c->type == ERT_CLEANUP) | |
3313 | return next; | |
3314 | return add_action_record (ar_hash, 0, next); | |
3315 | ||
3316 | case ERT_TRY: | |
3317 | /* Process the associated catch regions in reverse order. | |
3318 | If there's a catch-all handler, then we don't need to | |
3319 | search outer regions. Use a magic -3 value to record | |
a1f300c0 | 3320 | that we haven't done the outer search. */ |
52a11cbf RH |
3321 | next = -3; |
3322 | for (c = region->u.try.last_catch; c ; c = c->u.catch.prev_catch) | |
3323 | { | |
6d41a92f OH |
3324 | if (c->u.catch.type_list == NULL) |
3325 | { | |
3326 | /* Retrieve the filter from the head of the filter list | |
3327 | where we have stored it (see assign_filter_values). */ | |
a944ceb9 RH |
3328 | int filter |
3329 | = TREE_INT_CST_LOW (TREE_VALUE (c->u.catch.filter_list)); | |
3330 | ||
3331 | next = add_action_record (ar_hash, filter, 0); | |
6d41a92f | 3332 | } |
52a11cbf RH |
3333 | else |
3334 | { | |
6d41a92f OH |
3335 | /* Once the outer search is done, trigger an action record for |
3336 | each filter we have. */ | |
3337 | tree flt_node; | |
3338 | ||
52a11cbf RH |
3339 | if (next == -3) |
3340 | { | |
3341 | next = collect_one_action_chain (ar_hash, region->outer); | |
949f197f RH |
3342 | |
3343 | /* If there is no next action, terminate the chain. */ | |
3344 | if (next == -1) | |
52a11cbf | 3345 | next = 0; |
949f197f RH |
3346 | /* If all outer actions are cleanups or must_not_throw, |
3347 | we'll have no action record for it, since we had wanted | |
3348 | to encode these states in the call-site record directly. | |
3349 | Add a cleanup action to the chain to catch these. */ | |
3350 | else if (next <= 0) | |
3351 | next = add_action_record (ar_hash, 0, 0); | |
52a11cbf | 3352 | } |
3f2c5d1a | 3353 | |
6d41a92f OH |
3354 | flt_node = c->u.catch.filter_list; |
3355 | for (; flt_node; flt_node = TREE_CHAIN (flt_node)) | |
3356 | { | |
3357 | int filter = TREE_INT_CST_LOW (TREE_VALUE (flt_node)); | |
3358 | next = add_action_record (ar_hash, filter, next); | |
3359 | } | |
52a11cbf RH |
3360 | } |
3361 | } | |
3362 | return next; | |
3363 | ||
3364 | case ERT_ALLOWED_EXCEPTIONS: | |
3365 | /* An exception specification adds its filter to the | |
3366 | beginning of the chain. */ | |
3367 | next = collect_one_action_chain (ar_hash, region->outer); | |
0977ab3a RH |
3368 | |
3369 | /* If there is no next action, terminate the chain. */ | |
3370 | if (next == -1) | |
3371 | next = 0; | |
3372 | /* If all outer actions are cleanups or must_not_throw, | |
3373 | we'll have no action record for it, since we had wanted | |
3374 | to encode these states in the call-site record directly. | |
3375 | Add a cleanup action to the chain to catch these. */ | |
3376 | else if (next <= 0) | |
3377 | next = add_action_record (ar_hash, 0, 0); | |
3378 | ||
3379 | return add_action_record (ar_hash, region->u.allowed.filter, next); | |
52a11cbf RH |
3380 | |
3381 | case ERT_MUST_NOT_THROW: | |
3382 | /* A must-not-throw region with no inner handlers or cleanups | |
3383 | requires no call-site entry. Note that this differs from | |
3384 | the no handler or cleanup case in that we do require an lsda | |
3385 | to be generated. Return a magic -2 value to record this. */ | |
3386 | return -2; | |
3387 | ||
3388 | case ERT_CATCH: | |
3389 | case ERT_THROW: | |
3390 | /* CATCH regions are handled in TRY above. THROW regions are | |
3391 | for optimization information only and produce no output. */ | |
3392 | return collect_one_action_chain (ar_hash, region->outer); | |
3393 | ||
3394 | default: | |
3395 | abort (); | |
77d33a84 AM |
3396 | } |
3397 | } | |
3398 | ||
52a11cbf | 3399 | static int |
502b8322 | 3400 | add_call_site (rtx landing_pad, int action) |
77d33a84 | 3401 | { |
52a11cbf RH |
3402 | struct call_site_record *data = cfun->eh->call_site_data; |
3403 | int used = cfun->eh->call_site_data_used; | |
3404 | int size = cfun->eh->call_site_data_size; | |
77d33a84 | 3405 | |
52a11cbf RH |
3406 | if (used >= size) |
3407 | { | |
3408 | size = (size ? size * 2 : 64); | |
703ad42b | 3409 | data = ggc_realloc (data, sizeof (*data) * size); |
52a11cbf RH |
3410 | cfun->eh->call_site_data = data; |
3411 | cfun->eh->call_site_data_size = size; | |
3412 | } | |
77d33a84 | 3413 | |
52a11cbf RH |
3414 | data[used].landing_pad = landing_pad; |
3415 | data[used].action = action; | |
77d33a84 | 3416 | |
52a11cbf | 3417 | cfun->eh->call_site_data_used = used + 1; |
77d33a84 | 3418 | |
52a11cbf | 3419 | return used + call_site_base; |
77d33a84 AM |
3420 | } |
3421 | ||
52a11cbf RH |
3422 | /* Turn REG_EH_REGION notes back into NOTE_INSN_EH_REGION notes. |
3423 | The new note numbers will not refer to region numbers, but | |
3424 | instead to call site entries. */ | |
77d33a84 | 3425 | |
52a11cbf | 3426 | void |
502b8322 | 3427 | convert_to_eh_region_ranges (void) |
77d33a84 | 3428 | { |
52a11cbf RH |
3429 | rtx insn, iter, note; |
3430 | htab_t ar_hash; | |
3431 | int last_action = -3; | |
3432 | rtx last_action_insn = NULL_RTX; | |
3433 | rtx last_landing_pad = NULL_RTX; | |
3434 | rtx first_no_action_insn = NULL_RTX; | |
ae0ed63a | 3435 | int call_site = 0; |
77d33a84 | 3436 | |
52a11cbf RH |
3437 | if (USING_SJLJ_EXCEPTIONS || cfun->eh->region_tree == NULL) |
3438 | return; | |
77d33a84 | 3439 | |
52a11cbf | 3440 | VARRAY_UCHAR_INIT (cfun->eh->action_record_data, 64, "action_record_data"); |
77d33a84 | 3441 | |
52a11cbf | 3442 | ar_hash = htab_create (31, action_record_hash, action_record_eq, free); |
77d33a84 | 3443 | |
52a11cbf RH |
3444 | for (iter = get_insns (); iter ; iter = NEXT_INSN (iter)) |
3445 | if (INSN_P (iter)) | |
3446 | { | |
3447 | struct eh_region *region; | |
3448 | int this_action; | |
3449 | rtx this_landing_pad; | |
77d33a84 | 3450 | |
52a11cbf RH |
3451 | insn = iter; |
3452 | if (GET_CODE (insn) == INSN | |
3453 | && GET_CODE (PATTERN (insn)) == SEQUENCE) | |
3454 | insn = XVECEXP (PATTERN (insn), 0, 0); | |
1ef1bf06 | 3455 | |
52a11cbf RH |
3456 | note = find_reg_note (insn, REG_EH_REGION, NULL_RTX); |
3457 | if (!note) | |
3458 | { | |
3459 | if (! (GET_CODE (insn) == CALL_INSN | |
3460 | || (flag_non_call_exceptions | |
3461 | && may_trap_p (PATTERN (insn))))) | |
3462 | continue; | |
3463 | this_action = -1; | |
3464 | region = NULL; | |
3465 | } | |
3466 | else | |
3467 | { | |
3468 | if (INTVAL (XEXP (note, 0)) <= 0) | |
3469 | continue; | |
3470 | region = cfun->eh->region_array[INTVAL (XEXP (note, 0))]; | |
3471 | this_action = collect_one_action_chain (ar_hash, region); | |
3472 | } | |
3473 | ||
3474 | /* Existence of catch handlers, or must-not-throw regions | |
3475 | implies that an lsda is needed (even if empty). */ | |
3476 | if (this_action != -1) | |
3477 | cfun->uses_eh_lsda = 1; | |
3478 | ||
3479 | /* Delay creation of region notes for no-action regions | |
3480 | until we're sure that an lsda will be required. */ | |
3481 | else if (last_action == -3) | |
3482 | { | |
3483 | first_no_action_insn = iter; | |
3484 | last_action = -1; | |
3485 | } | |
1ef1bf06 | 3486 | |
52a11cbf RH |
3487 | /* Cleanups and handlers may share action chains but not |
3488 | landing pads. Collect the landing pad for this region. */ | |
3489 | if (this_action >= 0) | |
3490 | { | |
3491 | struct eh_region *o; | |
3492 | for (o = region; ! o->landing_pad ; o = o->outer) | |
3493 | continue; | |
3494 | this_landing_pad = o->landing_pad; | |
3495 | } | |
3496 | else | |
3497 | this_landing_pad = NULL_RTX; | |
1ef1bf06 | 3498 | |
52a11cbf RH |
3499 | /* Differing actions or landing pads implies a change in call-site |
3500 | info, which implies some EH_REGION note should be emitted. */ | |
3501 | if (last_action != this_action | |
3502 | || last_landing_pad != this_landing_pad) | |
3503 | { | |
3504 | /* If we'd not seen a previous action (-3) or the previous | |
3505 | action was must-not-throw (-2), then we do not need an | |
3506 | end note. */ | |
3507 | if (last_action >= -1) | |
3508 | { | |
3509 | /* If we delayed the creation of the begin, do it now. */ | |
3510 | if (first_no_action_insn) | |
3511 | { | |
3512 | call_site = add_call_site (NULL_RTX, 0); | |
3513 | note = emit_note_before (NOTE_INSN_EH_REGION_BEG, | |
3514 | first_no_action_insn); | |
3515 | NOTE_EH_HANDLER (note) = call_site; | |
3516 | first_no_action_insn = NULL_RTX; | |
3517 | } | |
3518 | ||
3519 | note = emit_note_after (NOTE_INSN_EH_REGION_END, | |
3520 | last_action_insn); | |
3521 | NOTE_EH_HANDLER (note) = call_site; | |
3522 | } | |
3523 | ||
3524 | /* If the new action is must-not-throw, then no region notes | |
3525 | are created. */ | |
3526 | if (this_action >= -1) | |
3527 | { | |
3f2c5d1a | 3528 | call_site = add_call_site (this_landing_pad, |
52a11cbf RH |
3529 | this_action < 0 ? 0 : this_action); |
3530 | note = emit_note_before (NOTE_INSN_EH_REGION_BEG, iter); | |
3531 | NOTE_EH_HANDLER (note) = call_site; | |
3532 | } | |
3533 | ||
3534 | last_action = this_action; | |
3535 | last_landing_pad = this_landing_pad; | |
3536 | } | |
3537 | last_action_insn = iter; | |
3538 | } | |
1ef1bf06 | 3539 | |
52a11cbf | 3540 | if (last_action >= -1 && ! first_no_action_insn) |
1ef1bf06 | 3541 | { |
52a11cbf RH |
3542 | note = emit_note_after (NOTE_INSN_EH_REGION_END, last_action_insn); |
3543 | NOTE_EH_HANDLER (note) = call_site; | |
1ef1bf06 AM |
3544 | } |
3545 | ||
52a11cbf RH |
3546 | htab_delete (ar_hash); |
3547 | } | |
1ef1bf06 | 3548 | |
52a11cbf RH |
3549 | \f |
3550 | static void | |
502b8322 | 3551 | push_uleb128 (varray_type *data_area, unsigned int value) |
52a11cbf RH |
3552 | { |
3553 | do | |
3554 | { | |
3555 | unsigned char byte = value & 0x7f; | |
3556 | value >>= 7; | |
3557 | if (value) | |
3558 | byte |= 0x80; | |
3559 | VARRAY_PUSH_UCHAR (*data_area, byte); | |
3560 | } | |
3561 | while (value); | |
3562 | } | |
1ef1bf06 | 3563 | |
52a11cbf | 3564 | static void |
502b8322 | 3565 | push_sleb128 (varray_type *data_area, int value) |
52a11cbf RH |
3566 | { |
3567 | unsigned char byte; | |
3568 | int more; | |
1ef1bf06 | 3569 | |
52a11cbf | 3570 | do |
1ef1bf06 | 3571 | { |
52a11cbf RH |
3572 | byte = value & 0x7f; |
3573 | value >>= 7; | |
3574 | more = ! ((value == 0 && (byte & 0x40) == 0) | |
3575 | || (value == -1 && (byte & 0x40) != 0)); | |
3576 | if (more) | |
3577 | byte |= 0x80; | |
3578 | VARRAY_PUSH_UCHAR (*data_area, byte); | |
1ef1bf06 | 3579 | } |
52a11cbf RH |
3580 | while (more); |
3581 | } | |
1ef1bf06 | 3582 | |
52a11cbf | 3583 | \f |
52a11cbf RH |
3584 | #ifndef HAVE_AS_LEB128 |
3585 | static int | |
502b8322 | 3586 | dw2_size_of_call_site_table (void) |
1ef1bf06 | 3587 | { |
52a11cbf RH |
3588 | int n = cfun->eh->call_site_data_used; |
3589 | int size = n * (4 + 4 + 4); | |
3590 | int i; | |
1ef1bf06 | 3591 | |
52a11cbf RH |
3592 | for (i = 0; i < n; ++i) |
3593 | { | |
3594 | struct call_site_record *cs = &cfun->eh->call_site_data[i]; | |
3595 | size += size_of_uleb128 (cs->action); | |
3596 | } | |
fac62ecf | 3597 | |
52a11cbf RH |
3598 | return size; |
3599 | } | |
3600 | ||
3601 | static int | |
502b8322 | 3602 | sjlj_size_of_call_site_table (void) |
52a11cbf RH |
3603 | { |
3604 | int n = cfun->eh->call_site_data_used; | |
3605 | int size = 0; | |
3606 | int i; | |
77d33a84 | 3607 | |
52a11cbf | 3608 | for (i = 0; i < n; ++i) |
1ef1bf06 | 3609 | { |
52a11cbf RH |
3610 | struct call_site_record *cs = &cfun->eh->call_site_data[i]; |
3611 | size += size_of_uleb128 (INTVAL (cs->landing_pad)); | |
3612 | size += size_of_uleb128 (cs->action); | |
1ef1bf06 | 3613 | } |
52a11cbf RH |
3614 | |
3615 | return size; | |
3616 | } | |
3617 | #endif | |
3618 | ||
3619 | static void | |
502b8322 | 3620 | dw2_output_call_site_table (void) |
52a11cbf | 3621 | { |
83182544 | 3622 | const char *const function_start_lab |
52a11cbf RH |
3623 | = IDENTIFIER_POINTER (current_function_func_begin_label); |
3624 | int n = cfun->eh->call_site_data_used; | |
3625 | int i; | |
3626 | ||
3627 | for (i = 0; i < n; ++i) | |
1ef1bf06 | 3628 | { |
52a11cbf RH |
3629 | struct call_site_record *cs = &cfun->eh->call_site_data[i]; |
3630 | char reg_start_lab[32]; | |
3631 | char reg_end_lab[32]; | |
3632 | char landing_pad_lab[32]; | |
3633 | ||
3634 | ASM_GENERATE_INTERNAL_LABEL (reg_start_lab, "LEHB", call_site_base + i); | |
3635 | ASM_GENERATE_INTERNAL_LABEL (reg_end_lab, "LEHE", call_site_base + i); | |
3636 | ||
3637 | if (cs->landing_pad) | |
3638 | ASM_GENERATE_INTERNAL_LABEL (landing_pad_lab, "L", | |
3639 | CODE_LABEL_NUMBER (cs->landing_pad)); | |
3640 | ||
3641 | /* ??? Perhaps use insn length scaling if the assembler supports | |
3642 | generic arithmetic. */ | |
3643 | /* ??? Perhaps use attr_length to choose data1 or data2 instead of | |
3644 | data4 if the function is small enough. */ | |
3645 | #ifdef HAVE_AS_LEB128 | |
3646 | dw2_asm_output_delta_uleb128 (reg_start_lab, function_start_lab, | |
3647 | "region %d start", i); | |
3648 | dw2_asm_output_delta_uleb128 (reg_end_lab, reg_start_lab, | |
3649 | "length"); | |
3650 | if (cs->landing_pad) | |
3651 | dw2_asm_output_delta_uleb128 (landing_pad_lab, function_start_lab, | |
3652 | "landing pad"); | |
3653 | else | |
3654 | dw2_asm_output_data_uleb128 (0, "landing pad"); | |
3655 | #else | |
3656 | dw2_asm_output_delta (4, reg_start_lab, function_start_lab, | |
3657 | "region %d start", i); | |
3658 | dw2_asm_output_delta (4, reg_end_lab, reg_start_lab, "length"); | |
3659 | if (cs->landing_pad) | |
3660 | dw2_asm_output_delta (4, landing_pad_lab, function_start_lab, | |
3661 | "landing pad"); | |
3662 | else | |
3663 | dw2_asm_output_data (4, 0, "landing pad"); | |
3664 | #endif | |
3665 | dw2_asm_output_data_uleb128 (cs->action, "action"); | |
1ef1bf06 AM |
3666 | } |
3667 | ||
52a11cbf RH |
3668 | call_site_base += n; |
3669 | } | |
3670 | ||
3671 | static void | |
502b8322 | 3672 | sjlj_output_call_site_table (void) |
52a11cbf RH |
3673 | { |
3674 | int n = cfun->eh->call_site_data_used; | |
3675 | int i; | |
1ef1bf06 | 3676 | |
52a11cbf | 3677 | for (i = 0; i < n; ++i) |
1ef1bf06 | 3678 | { |
52a11cbf | 3679 | struct call_site_record *cs = &cfun->eh->call_site_data[i]; |
4da896b2 | 3680 | |
52a11cbf RH |
3681 | dw2_asm_output_data_uleb128 (INTVAL (cs->landing_pad), |
3682 | "region %d landing pad", i); | |
3683 | dw2_asm_output_data_uleb128 (cs->action, "action"); | |
3684 | } | |
4da896b2 | 3685 | |
52a11cbf | 3686 | call_site_base += n; |
1ef1bf06 AM |
3687 | } |
3688 | ||
96d0f4dc JJ |
3689 | /* Tell assembler to switch to the section for the exception handling |
3690 | table. */ | |
3691 | ||
3692 | void | |
502b8322 | 3693 | default_exception_section (void) |
96d0f4dc JJ |
3694 | { |
3695 | if (targetm.have_named_sections) | |
3696 | { | |
96d0f4dc | 3697 | int flags; |
96d0f4dc | 3698 | #ifdef HAVE_LD_RO_RW_SECTION_MIXING |
fe3f9515 KG |
3699 | int tt_format = ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/0, /*global=*/1); |
3700 | ||
96d0f4dc JJ |
3701 | flags = (! flag_pic |
3702 | || ((tt_format & 0x70) != DW_EH_PE_absptr | |
3703 | && (tt_format & 0x70) != DW_EH_PE_aligned)) | |
3704 | ? 0 : SECTION_WRITE; | |
3705 | #else | |
3706 | flags = SECTION_WRITE; | |
3707 | #endif | |
3708 | named_section_flags (".gcc_except_table", flags); | |
3709 | } | |
3710 | else if (flag_pic) | |
3711 | data_section (); | |
3712 | else | |
3713 | readonly_data_section (); | |
3714 | } | |
3715 | ||
52a11cbf | 3716 | void |
502b8322 | 3717 | output_function_exception_table (void) |
52a11cbf | 3718 | { |
2a1ee410 | 3719 | int tt_format, cs_format, lp_format, i, n; |
52a11cbf RH |
3720 | #ifdef HAVE_AS_LEB128 |
3721 | char ttype_label[32]; | |
3722 | char cs_after_size_label[32]; | |
3723 | char cs_end_label[32]; | |
3724 | #else | |
3725 | int call_site_len; | |
3726 | #endif | |
3727 | int have_tt_data; | |
ae0ed63a | 3728 | int tt_format_size = 0; |
1ef1bf06 | 3729 | |
52a11cbf RH |
3730 | /* Not all functions need anything. */ |
3731 | if (! cfun->uses_eh_lsda) | |
3732 | return; | |
fac62ecf | 3733 | |
2a1ee410 RH |
3734 | #ifdef IA64_UNWIND_INFO |
3735 | fputs ("\t.personality\t", asm_out_file); | |
3736 | output_addr_const (asm_out_file, eh_personality_libfunc); | |
3737 | fputs ("\n\t.handlerdata\n", asm_out_file); | |
3738 | /* Note that varasm still thinks we're in the function's code section. | |
3739 | The ".endp" directive that will immediately follow will take us back. */ | |
3740 | #else | |
5fd9b178 | 3741 | targetm.asm_out.exception_section (); |
2a1ee410 | 3742 | #endif |
52a11cbf RH |
3743 | |
3744 | have_tt_data = (VARRAY_ACTIVE_SIZE (cfun->eh->ttype_data) > 0 | |
3745 | || VARRAY_ACTIVE_SIZE (cfun->eh->ehspec_data) > 0); | |
3746 | ||
b627d6fe RH |
3747 | /* Indicate the format of the @TType entries. */ |
3748 | if (! have_tt_data) | |
3749 | tt_format = DW_EH_PE_omit; | |
3750 | else | |
3751 | { | |
3752 | tt_format = ASM_PREFERRED_EH_DATA_FORMAT (/*code=*/0, /*global=*/1); | |
3753 | #ifdef HAVE_AS_LEB128 | |
df696a75 RH |
3754 | ASM_GENERATE_INTERNAL_LABEL (ttype_label, "LLSDATT", |
3755 | current_function_funcdef_no); | |
b627d6fe RH |
3756 | #endif |
3757 | tt_format_size = size_of_encoded_value (tt_format); | |
3758 | ||
7a900ebc | 3759 | assemble_align (tt_format_size * BITS_PER_UNIT); |
b627d6fe | 3760 | } |
52a11cbf | 3761 | |
5fd9b178 | 3762 | targetm.asm_out.internal_label (asm_out_file, "LLSDA", |
df696a75 | 3763 | current_function_funcdef_no); |
52a11cbf RH |
3764 | |
3765 | /* The LSDA header. */ | |
3766 | ||
3767 | /* Indicate the format of the landing pad start pointer. An omitted | |
3768 | field implies @LPStart == @Start. */ | |
3769 | /* Currently we always put @LPStart == @Start. This field would | |
3770 | be most useful in moving the landing pads completely out of | |
3771 | line to another section, but it could also be used to minimize | |
3772 | the size of uleb128 landing pad offsets. */ | |
2a1ee410 RH |
3773 | lp_format = DW_EH_PE_omit; |
3774 | dw2_asm_output_data (1, lp_format, "@LPStart format (%s)", | |
3775 | eh_data_format_name (lp_format)); | |
52a11cbf RH |
3776 | |
3777 | /* @LPStart pointer would go here. */ | |
3778 | ||
2a1ee410 RH |
3779 | dw2_asm_output_data (1, tt_format, "@TType format (%s)", |
3780 | eh_data_format_name (tt_format)); | |
52a11cbf RH |
3781 | |
3782 | #ifndef HAVE_AS_LEB128 | |
3783 | if (USING_SJLJ_EXCEPTIONS) | |
3784 | call_site_len = sjlj_size_of_call_site_table (); | |
3785 | else | |
3786 | call_site_len = dw2_size_of_call_site_table (); | |
3787 | #endif | |
3788 | ||
3789 | /* A pc-relative 4-byte displacement to the @TType data. */ | |
3790 | if (have_tt_data) | |
3791 | { | |
3792 | #ifdef HAVE_AS_LEB128 | |
3793 | char ttype_after_disp_label[32]; | |
3f2c5d1a | 3794 | ASM_GENERATE_INTERNAL_LABEL (ttype_after_disp_label, "LLSDATTD", |
df696a75 | 3795 | current_function_funcdef_no); |
52a11cbf RH |
3796 | dw2_asm_output_delta_uleb128 (ttype_label, ttype_after_disp_label, |
3797 | "@TType base offset"); | |
3798 | ASM_OUTPUT_LABEL (asm_out_file, ttype_after_disp_label); | |
3799 | #else | |
3800 | /* Ug. Alignment queers things. */ | |
b627d6fe | 3801 | unsigned int before_disp, after_disp, last_disp, disp; |
52a11cbf | 3802 | |
52a11cbf RH |
3803 | before_disp = 1 + 1; |
3804 | after_disp = (1 + size_of_uleb128 (call_site_len) | |
3805 | + call_site_len | |
3806 | + VARRAY_ACTIVE_SIZE (cfun->eh->action_record_data) | |
b627d6fe RH |
3807 | + (VARRAY_ACTIVE_SIZE (cfun->eh->ttype_data) |
3808 | * tt_format_size)); | |
52a11cbf RH |
3809 | |
3810 | disp = after_disp; | |
3811 | do | |
1ef1bf06 | 3812 | { |
52a11cbf RH |
3813 | unsigned int disp_size, pad; |
3814 | ||
3815 | last_disp = disp; | |
3816 | disp_size = size_of_uleb128 (disp); | |
3817 | pad = before_disp + disp_size + after_disp; | |
b627d6fe RH |
3818 | if (pad % tt_format_size) |
3819 | pad = tt_format_size - (pad % tt_format_size); | |
52a11cbf RH |
3820 | else |
3821 | pad = 0; | |
3822 | disp = after_disp + pad; | |
1ef1bf06 | 3823 | } |
52a11cbf RH |
3824 | while (disp != last_disp); |
3825 | ||
3826 | dw2_asm_output_data_uleb128 (disp, "@TType base offset"); | |
3827 | #endif | |
1ef1bf06 | 3828 | } |
1ef1bf06 | 3829 | |
52a11cbf RH |
3830 | /* Indicate the format of the call-site offsets. */ |
3831 | #ifdef HAVE_AS_LEB128 | |
2a1ee410 | 3832 | cs_format = DW_EH_PE_uleb128; |
52a11cbf | 3833 | #else |
2a1ee410 | 3834 | cs_format = DW_EH_PE_udata4; |
52a11cbf | 3835 | #endif |
2a1ee410 RH |
3836 | dw2_asm_output_data (1, cs_format, "call-site format (%s)", |
3837 | eh_data_format_name (cs_format)); | |
52a11cbf RH |
3838 | |
3839 | #ifdef HAVE_AS_LEB128 | |
3840 | ASM_GENERATE_INTERNAL_LABEL (cs_after_size_label, "LLSDACSB", | |
df696a75 | 3841 | current_function_funcdef_no); |
52a11cbf | 3842 | ASM_GENERATE_INTERNAL_LABEL (cs_end_label, "LLSDACSE", |
df696a75 | 3843 | current_function_funcdef_no); |
52a11cbf RH |
3844 | dw2_asm_output_delta_uleb128 (cs_end_label, cs_after_size_label, |
3845 | "Call-site table length"); | |
3846 | ASM_OUTPUT_LABEL (asm_out_file, cs_after_size_label); | |
3847 | if (USING_SJLJ_EXCEPTIONS) | |
3848 | sjlj_output_call_site_table (); | |
3849 | else | |
3850 | dw2_output_call_site_table (); | |
3851 | ASM_OUTPUT_LABEL (asm_out_file, cs_end_label); | |
3852 | #else | |
3853 | dw2_asm_output_data_uleb128 (call_site_len,"Call-site table length"); | |
3854 | if (USING_SJLJ_EXCEPTIONS) | |
3855 | sjlj_output_call_site_table (); | |
3856 | else | |
3857 | dw2_output_call_site_table (); | |
3858 | #endif | |
3859 | ||
3860 | /* ??? Decode and interpret the data for flag_debug_asm. */ | |
3861 | n = VARRAY_ACTIVE_SIZE (cfun->eh->action_record_data); | |
3862 | for (i = 0; i < n; ++i) | |
3863 | dw2_asm_output_data (1, VARRAY_UCHAR (cfun->eh->action_record_data, i), | |
3864 | (i ? NULL : "Action record table")); | |
1ef1bf06 | 3865 | |
52a11cbf | 3866 | if (have_tt_data) |
7a900ebc | 3867 | assemble_align (tt_format_size * BITS_PER_UNIT); |
1ef1bf06 | 3868 | |
52a11cbf RH |
3869 | i = VARRAY_ACTIVE_SIZE (cfun->eh->ttype_data); |
3870 | while (i-- > 0) | |
1ef1bf06 | 3871 | { |
52a11cbf | 3872 | tree type = VARRAY_TREE (cfun->eh->ttype_data, i); |
225b9cb9 | 3873 | rtx value; |
52a11cbf RH |
3874 | |
3875 | if (type == NULL_TREE) | |
dd07abd7 | 3876 | value = const0_rtx; |
52a11cbf | 3877 | else |
dd07abd7 RH |
3878 | { |
3879 | struct cgraph_varpool_node *node; | |
3880 | ||
3881 | type = lookup_type_for_runtime (type); | |
3882 | value = expand_expr (type, NULL_RTX, VOIDmode, EXPAND_INITIALIZER); | |
3883 | ||
3884 | /* Let cgraph know that the rtti decl is used. Not all of the | |
3885 | paths below go through assemble_integer, which would take | |
3886 | care of this for us. */ | |
19ae5445 RK |
3887 | if (TREE_CODE (type) == ADDR_EXPR) |
3888 | { | |
dba601db | 3889 | type = TREE_OPERAND (type, 0); |
19ae5445 RK |
3890 | node = cgraph_varpool_node (type); |
3891 | if (node) | |
3892 | cgraph_varpool_mark_needed_node (node); | |
3893 | } | |
3894 | else if (TREE_CODE (type) != INTEGER_CST) | |
dd07abd7 | 3895 | abort (); |
dd07abd7 | 3896 | } |
52a11cbf | 3897 | |
225b9cb9 RH |
3898 | if (tt_format == DW_EH_PE_absptr || tt_format == DW_EH_PE_aligned) |
3899 | assemble_integer (value, tt_format_size, | |
3900 | tt_format_size * BITS_PER_UNIT, 1); | |
3901 | else | |
0fb7aeda | 3902 | dw2_asm_output_encoded_addr_rtx (tt_format, value, NULL); |
1ef1bf06 | 3903 | } |
52a11cbf RH |
3904 | |
3905 | #ifdef HAVE_AS_LEB128 | |
3906 | if (have_tt_data) | |
3907 | ASM_OUTPUT_LABEL (asm_out_file, ttype_label); | |
3908 | #endif | |
3909 | ||
3910 | /* ??? Decode and interpret the data for flag_debug_asm. */ | |
3911 | n = VARRAY_ACTIVE_SIZE (cfun->eh->ehspec_data); | |
3912 | for (i = 0; i < n; ++i) | |
3913 | dw2_asm_output_data (1, VARRAY_UCHAR (cfun->eh->ehspec_data, i), | |
3914 | (i ? NULL : "Exception specification table")); | |
3915 | ||
3916 | function_section (current_function_decl); | |
1ef1bf06 | 3917 | } |
e2500fed GK |
3918 | |
3919 | #include "gt-except.h" |