]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* Exception handling semantics and decomposition for trees. |
d1e082c2 | 2 | Copyright (C) 2003-2013 Free Software Foundation, Inc. |
6de9cd9a DN |
3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
9dcd6f09 | 8 | the Free Software Foundation; either version 3, or (at your option) |
6de9cd9a DN |
9 | any later version. |
10 | ||
11 | GCC is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a DN |
19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
4a8fb1a1 | 23 | #include "hash-table.h" |
6de9cd9a DN |
24 | #include "tm.h" |
25 | #include "tree.h" | |
6de9cd9a DN |
26 | #include "flags.h" |
27 | #include "function.h" | |
28 | #include "except.h" | |
9f698956 | 29 | #include "pointer-set.h" |
6de9cd9a | 30 | #include "tree-flow.h" |
6de9cd9a | 31 | #include "tree-inline.h" |
6de9cd9a | 32 | #include "tree-pass.h" |
6de9cd9a DN |
33 | #include "langhooks.h" |
34 | #include "ggc.h" | |
718f9c0f | 35 | #include "diagnostic-core.h" |
726a989a | 36 | #include "gimple.h" |
1d65f45c | 37 | #include "target.h" |
7d776ee2 | 38 | #include "cfgloop.h" |
726a989a RB |
39 | |
40 | /* In some instances a tree and a gimple need to be stored in a same table, | |
41 | i.e. in hash tables. This is a structure to do this. */ | |
42 | typedef union {tree *tp; tree t; gimple g;} treemple; | |
6de9cd9a | 43 | |
165b54c3 SB |
44 | /* Nonzero if we are using EH to handle cleanups. */ |
45 | static int using_eh_for_cleanups_p = 0; | |
46 | ||
47 | void | |
48 | using_eh_for_cleanups (void) | |
49 | { | |
50 | using_eh_for_cleanups_p = 1; | |
51 | } | |
726a989a | 52 | |
6de9cd9a DN |
53 | /* Misc functions used in this file. */ |
54 | ||
1d65f45c | 55 | /* Remember and lookup EH landing pad data for arbitrary statements. |
6de9cd9a DN |
56 | Really this means any statement that could_throw_p. We could |
57 | stuff this information into the stmt_ann data structure, but: | |
58 | ||
59 | (1) We absolutely rely on this information being kept until | |
60 | we get to rtl. Once we're done with lowering here, if we lose | |
61 | the information there's no way to recover it! | |
62 | ||
19114537 | 63 | (2) There are many more statements that *cannot* throw as |
6de9cd9a DN |
64 | compared to those that can. We should be saving some amount |
65 | of space by only allocating memory for those that can throw. */ | |
66 | ||
1d65f45c | 67 | /* Add statement T in function IFUN to landing pad NUM. */ |
726a989a | 68 | |
6de9cd9a | 69 | void |
1d65f45c | 70 | add_stmt_to_eh_lp_fn (struct function *ifun, gimple t, int num) |
6de9cd9a DN |
71 | { |
72 | struct throw_stmt_node *n; | |
73 | void **slot; | |
74 | ||
1d65f45c | 75 | gcc_assert (num != 0); |
6de9cd9a | 76 | |
a9429e29 | 77 | n = ggc_alloc_throw_stmt_node (); |
6de9cd9a | 78 | n->stmt = t; |
1d65f45c | 79 | n->lp_nr = num; |
6de9cd9a | 80 | |
98f464e0 SB |
81 | if (!get_eh_throw_stmt_table (ifun)) |
82 | set_eh_throw_stmt_table (ifun, htab_create_ggc (31, struct_ptr_hash, | |
83 | struct_ptr_eq, | |
84 | ggc_free)); | |
85 | ||
b4660e5a | 86 | slot = htab_find_slot (get_eh_throw_stmt_table (ifun), n, INSERT); |
1e128c5f | 87 | gcc_assert (!*slot); |
6de9cd9a DN |
88 | *slot = n; |
89 | } | |
1eaba2f2 | 90 | |
1d65f45c | 91 | /* Add statement T in the current function (cfun) to EH landing pad NUM. */ |
726a989a | 92 | |
b4660e5a | 93 | void |
1d65f45c | 94 | add_stmt_to_eh_lp (gimple t, int num) |
b4660e5a | 95 | { |
1d65f45c RH |
96 | add_stmt_to_eh_lp_fn (cfun, t, num); |
97 | } | |
98 | ||
99 | /* Add statement T to the single EH landing pad in REGION. */ | |
100 | ||
101 | static void | |
102 | record_stmt_eh_region (eh_region region, gimple t) | |
103 | { | |
104 | if (region == NULL) | |
105 | return; | |
106 | if (region->type == ERT_MUST_NOT_THROW) | |
107 | add_stmt_to_eh_lp_fn (cfun, t, -region->index); | |
108 | else | |
109 | { | |
110 | eh_landing_pad lp = region->landing_pads; | |
111 | if (lp == NULL) | |
112 | lp = gen_eh_landing_pad (region); | |
113 | else | |
114 | gcc_assert (lp->next_lp == NULL); | |
115 | add_stmt_to_eh_lp_fn (cfun, t, lp->index); | |
116 | } | |
b4660e5a JH |
117 | } |
118 | ||
726a989a | 119 | |
1d65f45c | 120 | /* Remove statement T in function IFUN from its EH landing pad. */ |
726a989a | 121 | |
1eaba2f2 | 122 | bool |
1d65f45c | 123 | remove_stmt_from_eh_lp_fn (struct function *ifun, gimple t) |
1eaba2f2 RH |
124 | { |
125 | struct throw_stmt_node dummy; | |
126 | void **slot; | |
127 | ||
b4660e5a | 128 | if (!get_eh_throw_stmt_table (ifun)) |
1eaba2f2 RH |
129 | return false; |
130 | ||
131 | dummy.stmt = t; | |
b4660e5a JH |
132 | slot = htab_find_slot (get_eh_throw_stmt_table (ifun), &dummy, |
133 | NO_INSERT); | |
1eaba2f2 RH |
134 | if (slot) |
135 | { | |
b4660e5a | 136 | htab_clear_slot (get_eh_throw_stmt_table (ifun), slot); |
1eaba2f2 RH |
137 | return true; |
138 | } | |
139 | else | |
140 | return false; | |
141 | } | |
142 | ||
726a989a | 143 | |
1d65f45c RH |
144 | /* Remove statement T in the current function (cfun) from its |
145 | EH landing pad. */ | |
726a989a | 146 | |
b4660e5a | 147 | bool |
1d65f45c | 148 | remove_stmt_from_eh_lp (gimple t) |
b4660e5a | 149 | { |
1d65f45c | 150 | return remove_stmt_from_eh_lp_fn (cfun, t); |
b4660e5a JH |
151 | } |
152 | ||
726a989a | 153 | /* Determine if statement T is inside an EH region in function IFUN. |
1d65f45c RH |
154 | Positive numbers indicate a landing pad index; negative numbers |
155 | indicate a MUST_NOT_THROW region index; zero indicates that the | |
156 | statement is not recorded in the region table. */ | |
726a989a | 157 | |
6de9cd9a | 158 | int |
1d65f45c | 159 | lookup_stmt_eh_lp_fn (struct function *ifun, gimple t) |
6de9cd9a DN |
160 | { |
161 | struct throw_stmt_node *p, n; | |
162 | ||
1d65f45c RH |
163 | if (ifun->eh->throw_stmt_table == NULL) |
164 | return 0; | |
6de9cd9a | 165 | |
726a989a | 166 | n.stmt = t; |
1d65f45c RH |
167 | p = (struct throw_stmt_node *) htab_find (ifun->eh->throw_stmt_table, &n); |
168 | return p ? p->lp_nr : 0; | |
6de9cd9a DN |
169 | } |
170 | ||
1d65f45c | 171 | /* Likewise, but always use the current function. */ |
726a989a | 172 | |
b4660e5a | 173 | int |
1d65f45c | 174 | lookup_stmt_eh_lp (gimple t) |
b4660e5a JH |
175 | { |
176 | /* We can get called from initialized data when -fnon-call-exceptions | |
177 | is on; prevent crash. */ | |
178 | if (!cfun) | |
1d65f45c RH |
179 | return 0; |
180 | return lookup_stmt_eh_lp_fn (cfun, t); | |
b4660e5a | 181 | } |
6de9cd9a | 182 | |
726a989a | 183 | /* First pass of EH node decomposition. Build up a tree of GIMPLE_TRY_FINALLY |
6de9cd9a DN |
184 | nodes and LABEL_DECL nodes. We will use this during the second phase to |
185 | determine if a goto leaves the body of a TRY_FINALLY_EXPR node. */ | |
186 | ||
187 | struct finally_tree_node | |
188 | { | |
726a989a RB |
189 | /* When storing a GIMPLE_TRY, we have to record a gimple. However |
190 | when deciding whether a GOTO to a certain LABEL_DECL (which is a | |
191 | tree) leaves the TRY block, its necessary to record a tree in | |
192 | this field. Thus a treemple is used. */ | |
1d65f45c | 193 | treemple child; |
726a989a | 194 | gimple parent; |
6de9cd9a DN |
195 | }; |
196 | ||
4a8fb1a1 LC |
197 | /* Hashtable helpers. */ |
198 | ||
199 | struct finally_tree_hasher : typed_free_remove <finally_tree_node> | |
200 | { | |
201 | typedef finally_tree_node value_type; | |
202 | typedef finally_tree_node compare_type; | |
203 | static inline hashval_t hash (const value_type *); | |
204 | static inline bool equal (const value_type *, const compare_type *); | |
205 | }; | |
206 | ||
207 | inline hashval_t | |
208 | finally_tree_hasher::hash (const value_type *v) | |
209 | { | |
210 | return (intptr_t)v->child.t >> 4; | |
211 | } | |
212 | ||
213 | inline bool | |
214 | finally_tree_hasher::equal (const value_type *v, const compare_type *c) | |
215 | { | |
216 | return v->child.t == c->child.t; | |
217 | } | |
218 | ||
6de9cd9a | 219 | /* Note that this table is *not* marked GTY. It is short-lived. */ |
4a8fb1a1 | 220 | static hash_table <finally_tree_hasher> finally_tree; |
6de9cd9a DN |
221 | |
222 | static void | |
726a989a | 223 | record_in_finally_tree (treemple child, gimple parent) |
6de9cd9a DN |
224 | { |
225 | struct finally_tree_node *n; | |
4a8fb1a1 | 226 | finally_tree_node **slot; |
6de9cd9a | 227 | |
858904db | 228 | n = XNEW (struct finally_tree_node); |
6de9cd9a DN |
229 | n->child = child; |
230 | n->parent = parent; | |
231 | ||
4a8fb1a1 | 232 | slot = finally_tree.find_slot (n, INSERT); |
1e128c5f | 233 | gcc_assert (!*slot); |
6de9cd9a DN |
234 | *slot = n; |
235 | } | |
236 | ||
237 | static void | |
726a989a RB |
238 | collect_finally_tree (gimple stmt, gimple region); |
239 | ||
1d65f45c | 240 | /* Go through the gimple sequence. Works with collect_finally_tree to |
726a989a RB |
241 | record all GIMPLE_LABEL and GIMPLE_TRY statements. */ |
242 | ||
243 | static void | |
244 | collect_finally_tree_1 (gimple_seq seq, gimple region) | |
6de9cd9a | 245 | { |
726a989a | 246 | gimple_stmt_iterator gsi; |
6de9cd9a | 247 | |
726a989a RB |
248 | for (gsi = gsi_start (seq); !gsi_end_p (gsi); gsi_next (&gsi)) |
249 | collect_finally_tree (gsi_stmt (gsi), region); | |
250 | } | |
6de9cd9a | 251 | |
726a989a RB |
252 | static void |
253 | collect_finally_tree (gimple stmt, gimple region) | |
254 | { | |
255 | treemple temp; | |
256 | ||
257 | switch (gimple_code (stmt)) | |
258 | { | |
259 | case GIMPLE_LABEL: | |
260 | temp.t = gimple_label_label (stmt); | |
261 | record_in_finally_tree (temp, region); | |
262 | break; | |
6de9cd9a | 263 | |
726a989a RB |
264 | case GIMPLE_TRY: |
265 | if (gimple_try_kind (stmt) == GIMPLE_TRY_FINALLY) | |
266 | { | |
267 | temp.g = stmt; | |
268 | record_in_finally_tree (temp, region); | |
269 | collect_finally_tree_1 (gimple_try_eval (stmt), stmt); | |
270 | collect_finally_tree_1 (gimple_try_cleanup (stmt), region); | |
271 | } | |
272 | else if (gimple_try_kind (stmt) == GIMPLE_TRY_CATCH) | |
273 | { | |
274 | collect_finally_tree_1 (gimple_try_eval (stmt), region); | |
275 | collect_finally_tree_1 (gimple_try_cleanup (stmt), region); | |
276 | } | |
277 | break; | |
6de9cd9a | 278 | |
726a989a RB |
279 | case GIMPLE_CATCH: |
280 | collect_finally_tree_1 (gimple_catch_handler (stmt), region); | |
281 | break; | |
6de9cd9a | 282 | |
726a989a RB |
283 | case GIMPLE_EH_FILTER: |
284 | collect_finally_tree_1 (gimple_eh_filter_failure (stmt), region); | |
6de9cd9a DN |
285 | break; |
286 | ||
0a35513e AH |
287 | case GIMPLE_EH_ELSE: |
288 | collect_finally_tree_1 (gimple_eh_else_n_body (stmt), region); | |
289 | collect_finally_tree_1 (gimple_eh_else_e_body (stmt), region); | |
290 | break; | |
291 | ||
6de9cd9a DN |
292 | default: |
293 | /* A type, a decl, or some kind of statement that we're not | |
294 | interested in. Don't walk them. */ | |
295 | break; | |
296 | } | |
297 | } | |
298 | ||
726a989a | 299 | |
6de9cd9a DN |
300 | /* Use the finally tree to determine if a jump from START to TARGET |
301 | would leave the try_finally node that START lives in. */ | |
302 | ||
303 | static bool | |
726a989a | 304 | outside_finally_tree (treemple start, gimple target) |
6de9cd9a DN |
305 | { |
306 | struct finally_tree_node n, *p; | |
307 | ||
308 | do | |
309 | { | |
310 | n.child = start; | |
4a8fb1a1 | 311 | p = finally_tree.find (&n); |
6de9cd9a DN |
312 | if (!p) |
313 | return true; | |
726a989a | 314 | start.g = p->parent; |
6de9cd9a | 315 | } |
726a989a | 316 | while (start.g != target); |
6de9cd9a DN |
317 | |
318 | return false; | |
319 | } | |
726a989a RB |
320 | |
321 | /* Second pass of EH node decomposition. Actually transform the GIMPLE_TRY | |
322 | nodes into a set of gotos, magic labels, and eh regions. | |
6de9cd9a DN |
323 | The eh region creation is straight-forward, but frobbing all the gotos |
324 | and such into shape isn't. */ | |
325 | ||
b8698a0f | 326 | /* The sequence into which we record all EH stuff. This will be |
1d65f45c RH |
327 | placed at the end of the function when we're all done. */ |
328 | static gimple_seq eh_seq; | |
329 | ||
330 | /* Record whether an EH region contains something that can throw, | |
331 | indexed by EH region number. */ | |
b7da9fd4 | 332 | static bitmap eh_region_may_contain_throw_map; |
1d65f45c | 333 | |
24b97832 ILT |
334 | /* The GOTO_QUEUE is is an array of GIMPLE_GOTO and GIMPLE_RETURN |
335 | statements that are seen to escape this GIMPLE_TRY_FINALLY node. | |
336 | The idea is to record a gimple statement for everything except for | |
337 | the conditionals, which get their labels recorded. Since labels are | |
338 | of type 'tree', we need this node to store both gimple and tree | |
339 | objects. REPL_STMT is the sequence used to replace the goto/return | |
340 | statement. CONT_STMT is used to store the statement that allows | |
341 | the return/goto to jump to the original destination. */ | |
342 | ||
343 | struct goto_queue_node | |
344 | { | |
345 | treemple stmt; | |
820055a0 | 346 | location_t location; |
24b97832 ILT |
347 | gimple_seq repl_stmt; |
348 | gimple cont_stmt; | |
349 | int index; | |
350 | /* This is used when index >= 0 to indicate that stmt is a label (as | |
351 | opposed to a goto stmt). */ | |
352 | int is_label; | |
353 | }; | |
354 | ||
6de9cd9a DN |
355 | /* State of the world while lowering. */ |
356 | ||
357 | struct leh_state | |
358 | { | |
19114537 | 359 | /* What's "current" while constructing the eh region tree. These |
6de9cd9a DN |
360 | correspond to variables of the same name in cfun->eh, which we |
361 | don't have easy access to. */ | |
1d65f45c RH |
362 | eh_region cur_region; |
363 | ||
364 | /* What's "current" for the purposes of __builtin_eh_pointer. For | |
365 | a CATCH, this is the associated TRY. For an EH_FILTER, this is | |
366 | the associated ALLOWED_EXCEPTIONS, etc. */ | |
367 | eh_region ehp_region; | |
6de9cd9a DN |
368 | |
369 | /* Processing of TRY_FINALLY requires a bit more state. This is | |
370 | split out into a separate structure so that we don't have to | |
371 | copy so much when processing other nodes. */ | |
372 | struct leh_tf_state *tf; | |
373 | }; | |
374 | ||
375 | struct leh_tf_state | |
376 | { | |
726a989a RB |
377 | /* Pointer to the GIMPLE_TRY_FINALLY node under discussion. The |
378 | try_finally_expr is the original GIMPLE_TRY_FINALLY. We need to retain | |
379 | this so that outside_finally_tree can reliably reference the tree used | |
380 | in the collect_finally_tree data structures. */ | |
381 | gimple try_finally_expr; | |
382 | gimple top_p; | |
1d65f45c | 383 | |
726a989a RB |
384 | /* While lowering a top_p usually it is expanded into multiple statements, |
385 | thus we need the following field to store them. */ | |
386 | gimple_seq top_p_seq; | |
6de9cd9a DN |
387 | |
388 | /* The state outside this try_finally node. */ | |
389 | struct leh_state *outer; | |
390 | ||
391 | /* The exception region created for it. */ | |
1d65f45c | 392 | eh_region region; |
6de9cd9a | 393 | |
24b97832 ILT |
394 | /* The goto queue. */ |
395 | struct goto_queue_node *goto_queue; | |
6de9cd9a DN |
396 | size_t goto_queue_size; |
397 | size_t goto_queue_active; | |
398 | ||
fa10beec | 399 | /* Pointer map to help in searching goto_queue when it is large. */ |
0f547d3d SE |
400 | struct pointer_map_t *goto_queue_map; |
401 | ||
6de9cd9a | 402 | /* The set of unique labels seen as entries in the goto queue. */ |
9771b263 | 403 | vec<tree> dest_array; |
6de9cd9a DN |
404 | |
405 | /* A label to be added at the end of the completed transformed | |
406 | sequence. It will be set if may_fallthru was true *at one time*, | |
407 | though subsequent transformations may have cleared that flag. */ | |
408 | tree fallthru_label; | |
409 | ||
6de9cd9a DN |
410 | /* True if it is possible to fall out the bottom of the try block. |
411 | Cleared if the fallthru is converted to a goto. */ | |
412 | bool may_fallthru; | |
413 | ||
726a989a | 414 | /* True if any entry in goto_queue is a GIMPLE_RETURN. */ |
6de9cd9a DN |
415 | bool may_return; |
416 | ||
417 | /* True if the finally block can receive an exception edge. | |
418 | Cleared if the exception case is handled by code duplication. */ | |
419 | bool may_throw; | |
420 | }; | |
421 | ||
1d65f45c | 422 | static gimple_seq lower_eh_must_not_throw (struct leh_state *, gimple); |
6de9cd9a | 423 | |
6de9cd9a DN |
424 | /* Search for STMT in the goto queue. Return the replacement, |
425 | or null if the statement isn't in the queue. */ | |
426 | ||
0f547d3d SE |
427 | #define LARGE_GOTO_QUEUE 20 |
428 | ||
355a7673 | 429 | static void lower_eh_constructs_1 (struct leh_state *state, gimple_seq *seq); |
726a989a RB |
430 | |
431 | static gimple_seq | |
432 | find_goto_replacement (struct leh_tf_state *tf, treemple stmt) | |
6de9cd9a | 433 | { |
0f547d3d SE |
434 | unsigned int i; |
435 | void **slot; | |
436 | ||
437 | if (tf->goto_queue_active < LARGE_GOTO_QUEUE) | |
438 | { | |
439 | for (i = 0; i < tf->goto_queue_active; i++) | |
726a989a | 440 | if ( tf->goto_queue[i].stmt.g == stmt.g) |
0f547d3d SE |
441 | return tf->goto_queue[i].repl_stmt; |
442 | return NULL; | |
443 | } | |
444 | ||
445 | /* If we have a large number of entries in the goto_queue, create a | |
446 | pointer map and use that for searching. */ | |
447 | ||
448 | if (!tf->goto_queue_map) | |
449 | { | |
450 | tf->goto_queue_map = pointer_map_create (); | |
451 | for (i = 0; i < tf->goto_queue_active; i++) | |
452 | { | |
726a989a RB |
453 | slot = pointer_map_insert (tf->goto_queue_map, |
454 | tf->goto_queue[i].stmt.g); | |
0f547d3d | 455 | gcc_assert (*slot == NULL); |
726a989a | 456 | *slot = &tf->goto_queue[i]; |
0f547d3d SE |
457 | } |
458 | } | |
459 | ||
726a989a | 460 | slot = pointer_map_contains (tf->goto_queue_map, stmt.g); |
0f547d3d SE |
461 | if (slot != NULL) |
462 | return (((struct goto_queue_node *) *slot)->repl_stmt); | |
463 | ||
464 | return NULL; | |
6de9cd9a DN |
465 | } |
466 | ||
467 | /* A subroutine of replace_goto_queue_1. Handles the sub-clauses of a | |
726a989a | 468 | lowered GIMPLE_COND. If, by chance, the replacement is a simple goto, |
6de9cd9a | 469 | then we can just splat it in, otherwise we add the new stmts immediately |
726a989a | 470 | after the GIMPLE_COND and redirect. */ |
6de9cd9a DN |
471 | |
472 | static void | |
473 | replace_goto_queue_cond_clause (tree *tp, struct leh_tf_state *tf, | |
726a989a | 474 | gimple_stmt_iterator *gsi) |
6de9cd9a | 475 | { |
726a989a | 476 | tree label; |
82d6e6fc | 477 | gimple_seq new_seq; |
726a989a | 478 | treemple temp; |
c2255bc4 | 479 | location_t loc = gimple_location (gsi_stmt (*gsi)); |
6de9cd9a | 480 | |
726a989a | 481 | temp.tp = tp; |
82d6e6fc KG |
482 | new_seq = find_goto_replacement (tf, temp); |
483 | if (!new_seq) | |
6de9cd9a DN |
484 | return; |
485 | ||
82d6e6fc KG |
486 | if (gimple_seq_singleton_p (new_seq) |
487 | && gimple_code (gimple_seq_first_stmt (new_seq)) == GIMPLE_GOTO) | |
6de9cd9a | 488 | { |
82d6e6fc | 489 | *tp = gimple_goto_dest (gimple_seq_first_stmt (new_seq)); |
6de9cd9a DN |
490 | return; |
491 | } | |
492 | ||
c2255bc4 | 493 | label = create_artificial_label (loc); |
726a989a RB |
494 | /* Set the new label for the GIMPLE_COND */ |
495 | *tp = label; | |
6de9cd9a | 496 | |
726a989a | 497 | gsi_insert_after (gsi, gimple_build_label (label), GSI_CONTINUE_LINKING); |
82d6e6fc | 498 | gsi_insert_seq_after (gsi, gimple_seq_copy (new_seq), GSI_CONTINUE_LINKING); |
6de9cd9a DN |
499 | } |
500 | ||
19114537 | 501 | /* The real work of replace_goto_queue. Returns with TSI updated to |
6de9cd9a DN |
502 | point to the next statement. */ |
503 | ||
355a7673 | 504 | static void replace_goto_queue_stmt_list (gimple_seq *, struct leh_tf_state *); |
6de9cd9a DN |
505 | |
506 | static void | |
726a989a RB |
507 | replace_goto_queue_1 (gimple stmt, struct leh_tf_state *tf, |
508 | gimple_stmt_iterator *gsi) | |
6de9cd9a | 509 | { |
726a989a RB |
510 | gimple_seq seq; |
511 | treemple temp; | |
512 | temp.g = NULL; | |
513 | ||
514 | switch (gimple_code (stmt)) | |
6de9cd9a | 515 | { |
726a989a RB |
516 | case GIMPLE_GOTO: |
517 | case GIMPLE_RETURN: | |
518 | temp.g = stmt; | |
519 | seq = find_goto_replacement (tf, temp); | |
520 | if (seq) | |
6de9cd9a | 521 | { |
726a989a RB |
522 | gsi_insert_seq_before (gsi, gimple_seq_copy (seq), GSI_SAME_STMT); |
523 | gsi_remove (gsi, false); | |
6de9cd9a DN |
524 | return; |
525 | } | |
526 | break; | |
527 | ||
726a989a RB |
528 | case GIMPLE_COND: |
529 | replace_goto_queue_cond_clause (gimple_op_ptr (stmt, 2), tf, gsi); | |
530 | replace_goto_queue_cond_clause (gimple_op_ptr (stmt, 3), tf, gsi); | |
6de9cd9a DN |
531 | break; |
532 | ||
726a989a | 533 | case GIMPLE_TRY: |
355a7673 MM |
534 | replace_goto_queue_stmt_list (gimple_try_eval_ptr (stmt), tf); |
535 | replace_goto_queue_stmt_list (gimple_try_cleanup_ptr (stmt), tf); | |
6de9cd9a | 536 | break; |
726a989a | 537 | case GIMPLE_CATCH: |
355a7673 | 538 | replace_goto_queue_stmt_list (gimple_catch_handler_ptr (stmt), tf); |
6de9cd9a | 539 | break; |
726a989a | 540 | case GIMPLE_EH_FILTER: |
355a7673 | 541 | replace_goto_queue_stmt_list (gimple_eh_filter_failure_ptr (stmt), tf); |
6de9cd9a | 542 | break; |
0a35513e | 543 | case GIMPLE_EH_ELSE: |
355a7673 MM |
544 | replace_goto_queue_stmt_list (gimple_eh_else_n_body_ptr (stmt), tf); |
545 | replace_goto_queue_stmt_list (gimple_eh_else_e_body_ptr (stmt), tf); | |
0a35513e | 546 | break; |
6de9cd9a | 547 | |
6de9cd9a DN |
548 | default: |
549 | /* These won't have gotos in them. */ | |
550 | break; | |
551 | } | |
552 | ||
726a989a | 553 | gsi_next (gsi); |
6de9cd9a DN |
554 | } |
555 | ||
726a989a | 556 | /* A subroutine of replace_goto_queue. Handles GIMPLE_SEQ. */ |
6de9cd9a DN |
557 | |
558 | static void | |
355a7673 | 559 | replace_goto_queue_stmt_list (gimple_seq *seq, struct leh_tf_state *tf) |
6de9cd9a | 560 | { |
355a7673 | 561 | gimple_stmt_iterator gsi = gsi_start (*seq); |
726a989a RB |
562 | |
563 | while (!gsi_end_p (gsi)) | |
564 | replace_goto_queue_1 (gsi_stmt (gsi), tf, &gsi); | |
6de9cd9a DN |
565 | } |
566 | ||
567 | /* Replace all goto queue members. */ | |
568 | ||
569 | static void | |
570 | replace_goto_queue (struct leh_tf_state *tf) | |
571 | { | |
8287d24a EB |
572 | if (tf->goto_queue_active == 0) |
573 | return; | |
355a7673 MM |
574 | replace_goto_queue_stmt_list (&tf->top_p_seq, tf); |
575 | replace_goto_queue_stmt_list (&eh_seq, tf); | |
6de9cd9a DN |
576 | } |
577 | ||
726a989a RB |
578 | /* Add a new record to the goto queue contained in TF. NEW_STMT is the |
579 | data to be added, IS_LABEL indicates whether NEW_STMT is a label or | |
580 | a gimple return. */ | |
6de9cd9a DN |
581 | |
582 | static void | |
726a989a RB |
583 | record_in_goto_queue (struct leh_tf_state *tf, |
584 | treemple new_stmt, | |
585 | int index, | |
820055a0 DC |
586 | bool is_label, |
587 | location_t location) | |
6de9cd9a | 588 | { |
6de9cd9a | 589 | size_t active, size; |
726a989a | 590 | struct goto_queue_node *q; |
6de9cd9a | 591 | |
0f547d3d SE |
592 | gcc_assert (!tf->goto_queue_map); |
593 | ||
6de9cd9a DN |
594 | active = tf->goto_queue_active; |
595 | size = tf->goto_queue_size; | |
596 | if (active >= size) | |
597 | { | |
598 | size = (size ? size * 2 : 32); | |
599 | tf->goto_queue_size = size; | |
600 | tf->goto_queue | |
858904db | 601 | = XRESIZEVEC (struct goto_queue_node, tf->goto_queue, size); |
6de9cd9a DN |
602 | } |
603 | ||
604 | q = &tf->goto_queue[active]; | |
605 | tf->goto_queue_active = active + 1; | |
19114537 | 606 | |
6de9cd9a | 607 | memset (q, 0, sizeof (*q)); |
726a989a | 608 | q->stmt = new_stmt; |
6de9cd9a | 609 | q->index = index; |
820055a0 | 610 | q->location = location; |
726a989a RB |
611 | q->is_label = is_label; |
612 | } | |
613 | ||
614 | /* Record the LABEL label in the goto queue contained in TF. | |
615 | TF is not null. */ | |
616 | ||
617 | static void | |
820055a0 DC |
618 | record_in_goto_queue_label (struct leh_tf_state *tf, treemple stmt, tree label, |
619 | location_t location) | |
726a989a RB |
620 | { |
621 | int index; | |
622 | treemple temp, new_stmt; | |
623 | ||
624 | if (!label) | |
625 | return; | |
626 | ||
627 | /* Computed and non-local gotos do not get processed. Given | |
628 | their nature we can neither tell whether we've escaped the | |
629 | finally block nor redirect them if we knew. */ | |
630 | if (TREE_CODE (label) != LABEL_DECL) | |
631 | return; | |
632 | ||
633 | /* No need to record gotos that don't leave the try block. */ | |
634 | temp.t = label; | |
635 | if (!outside_finally_tree (temp, tf->try_finally_expr)) | |
636 | return; | |
637 | ||
9771b263 | 638 | if (! tf->dest_array.exists ()) |
726a989a | 639 | { |
9771b263 DN |
640 | tf->dest_array.create (10); |
641 | tf->dest_array.quick_push (label); | |
726a989a RB |
642 | index = 0; |
643 | } | |
644 | else | |
645 | { | |
9771b263 | 646 | int n = tf->dest_array.length (); |
726a989a | 647 | for (index = 0; index < n; ++index) |
9771b263 | 648 | if (tf->dest_array[index] == label) |
726a989a RB |
649 | break; |
650 | if (index == n) | |
9771b263 | 651 | tf->dest_array.safe_push (label); |
726a989a RB |
652 | } |
653 | ||
654 | /* In the case of a GOTO we want to record the destination label, | |
655 | since with a GIMPLE_COND we have an easy access to the then/else | |
656 | labels. */ | |
657 | new_stmt = stmt; | |
820055a0 | 658 | record_in_goto_queue (tf, new_stmt, index, true, location); |
726a989a RB |
659 | } |
660 | ||
661 | /* For any GIMPLE_GOTO or GIMPLE_RETURN, decide whether it leaves a try_finally | |
662 | node, and if so record that fact in the goto queue associated with that | |
663 | try_finally node. */ | |
664 | ||
665 | static void | |
666 | maybe_record_in_goto_queue (struct leh_state *state, gimple stmt) | |
667 | { | |
668 | struct leh_tf_state *tf = state->tf; | |
669 | treemple new_stmt; | |
670 | ||
671 | if (!tf) | |
672 | return; | |
673 | ||
674 | switch (gimple_code (stmt)) | |
675 | { | |
676 | case GIMPLE_COND: | |
677 | new_stmt.tp = gimple_op_ptr (stmt, 2); | |
820055a0 DC |
678 | record_in_goto_queue_label (tf, new_stmt, gimple_cond_true_label (stmt), |
679 | EXPR_LOCATION (*new_stmt.tp)); | |
726a989a | 680 | new_stmt.tp = gimple_op_ptr (stmt, 3); |
820055a0 DC |
681 | record_in_goto_queue_label (tf, new_stmt, gimple_cond_false_label (stmt), |
682 | EXPR_LOCATION (*new_stmt.tp)); | |
726a989a RB |
683 | break; |
684 | case GIMPLE_GOTO: | |
685 | new_stmt.g = stmt; | |
820055a0 DC |
686 | record_in_goto_queue_label (tf, new_stmt, gimple_goto_dest (stmt), |
687 | gimple_location (stmt)); | |
726a989a RB |
688 | break; |
689 | ||
690 | case GIMPLE_RETURN: | |
691 | tf->may_return = true; | |
692 | new_stmt.g = stmt; | |
820055a0 | 693 | record_in_goto_queue (tf, new_stmt, -1, false, gimple_location (stmt)); |
726a989a RB |
694 | break; |
695 | ||
696 | default: | |
697 | gcc_unreachable (); | |
698 | } | |
6de9cd9a DN |
699 | } |
700 | ||
726a989a | 701 | |
6de9cd9a | 702 | #ifdef ENABLE_CHECKING |
726a989a | 703 | /* We do not process GIMPLE_SWITCHes for now. As long as the original source |
6de9cd9a | 704 | was in fact structured, and we've not yet done jump threading, then none |
726a989a | 705 | of the labels will leave outer GIMPLE_TRY_FINALLY nodes. Verify this. */ |
6de9cd9a DN |
706 | |
707 | static void | |
726a989a | 708 | verify_norecord_switch_expr (struct leh_state *state, gimple switch_expr) |
6de9cd9a DN |
709 | { |
710 | struct leh_tf_state *tf = state->tf; | |
711 | size_t i, n; | |
6de9cd9a DN |
712 | |
713 | if (!tf) | |
714 | return; | |
715 | ||
726a989a | 716 | n = gimple_switch_num_labels (switch_expr); |
6de9cd9a DN |
717 | |
718 | for (i = 0; i < n; ++i) | |
719 | { | |
726a989a RB |
720 | treemple temp; |
721 | tree lab = CASE_LABEL (gimple_switch_label (switch_expr, i)); | |
722 | temp.t = lab; | |
723 | gcc_assert (!outside_finally_tree (temp, tf->try_finally_expr)); | |
6de9cd9a DN |
724 | } |
725 | } | |
726 | #else | |
727 | #define verify_norecord_switch_expr(state, switch_expr) | |
728 | #endif | |
729 | ||
8d686507 ILT |
730 | /* Redirect a RETURN_EXPR pointed to by Q to FINLAB. If MOD is |
731 | non-null, insert it before the new branch. */ | |
6de9cd9a DN |
732 | |
733 | static void | |
8d686507 | 734 | do_return_redirection (struct goto_queue_node *q, tree finlab, gimple_seq mod) |
6de9cd9a | 735 | { |
726a989a RB |
736 | gimple x; |
737 | ||
8d686507 | 738 | /* In the case of a return, the queue node must be a gimple statement. */ |
726a989a RB |
739 | gcc_assert (!q->is_label); |
740 | ||
8d686507 | 741 | /* Note that the return value may have already been computed, e.g., |
6de9cd9a | 742 | |
8d686507 ILT |
743 | int x; |
744 | int foo (void) | |
6de9cd9a | 745 | { |
8d686507 ILT |
746 | x = 0; |
747 | try { | |
748 | return x; | |
749 | } finally { | |
750 | x++; | |
751 | } | |
6de9cd9a | 752 | } |
8d686507 ILT |
753 | |
754 | should return 0, not 1. We don't have to do anything to make | |
755 | this happens because the return value has been placed in the | |
756 | RESULT_DECL already. */ | |
757 | ||
758 | q->cont_stmt = q->stmt.g; | |
726a989a | 759 | |
6de9cd9a | 760 | if (mod) |
726a989a | 761 | gimple_seq_add_seq (&q->repl_stmt, mod); |
6de9cd9a | 762 | |
726a989a | 763 | x = gimple_build_goto (finlab); |
29f5bccb | 764 | gimple_set_location (x, q->location); |
726a989a | 765 | gimple_seq_add_stmt (&q->repl_stmt, x); |
6de9cd9a DN |
766 | } |
767 | ||
726a989a | 768 | /* Similar, but easier, for GIMPLE_GOTO. */ |
6de9cd9a DN |
769 | |
770 | static void | |
726a989a RB |
771 | do_goto_redirection (struct goto_queue_node *q, tree finlab, gimple_seq mod, |
772 | struct leh_tf_state *tf) | |
6de9cd9a | 773 | { |
726a989a RB |
774 | gimple x; |
775 | ||
776 | gcc_assert (q->is_label); | |
726a989a | 777 | |
9771b263 | 778 | q->cont_stmt = gimple_build_goto (tf->dest_array[q->index]); |
6de9cd9a | 779 | |
6de9cd9a | 780 | if (mod) |
726a989a | 781 | gimple_seq_add_seq (&q->repl_stmt, mod); |
6de9cd9a | 782 | |
726a989a | 783 | x = gimple_build_goto (finlab); |
29f5bccb | 784 | gimple_set_location (x, q->location); |
726a989a | 785 | gimple_seq_add_stmt (&q->repl_stmt, x); |
6de9cd9a DN |
786 | } |
787 | ||
1d65f45c RH |
788 | /* Emit a standard landing pad sequence into SEQ for REGION. */ |
789 | ||
790 | static void | |
791 | emit_post_landing_pad (gimple_seq *seq, eh_region region) | |
792 | { | |
793 | eh_landing_pad lp = region->landing_pads; | |
794 | gimple x; | |
795 | ||
796 | if (lp == NULL) | |
797 | lp = gen_eh_landing_pad (region); | |
798 | ||
799 | lp->post_landing_pad = create_artificial_label (UNKNOWN_LOCATION); | |
800 | EH_LANDING_PAD_NR (lp->post_landing_pad) = lp->index; | |
801 | ||
802 | x = gimple_build_label (lp->post_landing_pad); | |
803 | gimple_seq_add_stmt (seq, x); | |
804 | } | |
805 | ||
806 | /* Emit a RESX statement into SEQ for REGION. */ | |
807 | ||
808 | static void | |
809 | emit_resx (gimple_seq *seq, eh_region region) | |
810 | { | |
811 | gimple x = gimple_build_resx (region->index); | |
812 | gimple_seq_add_stmt (seq, x); | |
813 | if (region->outer) | |
814 | record_stmt_eh_region (region->outer, x); | |
815 | } | |
816 | ||
817 | /* Emit an EH_DISPATCH statement into SEQ for REGION. */ | |
818 | ||
819 | static void | |
820 | emit_eh_dispatch (gimple_seq *seq, eh_region region) | |
821 | { | |
822 | gimple x = gimple_build_eh_dispatch (region->index); | |
823 | gimple_seq_add_stmt (seq, x); | |
824 | } | |
825 | ||
826 | /* Note that the current EH region may contain a throw, or a | |
827 | call to a function which itself may contain a throw. */ | |
828 | ||
829 | static void | |
830 | note_eh_region_may_contain_throw (eh_region region) | |
831 | { | |
fcaa4ca4 | 832 | while (bitmap_set_bit (eh_region_may_contain_throw_map, region->index)) |
1d65f45c | 833 | { |
6788475a JJ |
834 | if (region->type == ERT_MUST_NOT_THROW) |
835 | break; | |
1d65f45c RH |
836 | region = region->outer; |
837 | if (region == NULL) | |
838 | break; | |
839 | } | |
840 | } | |
841 | ||
b7da9fd4 RH |
842 | /* Check if REGION has been marked as containing a throw. If REGION is |
843 | NULL, this predicate is false. */ | |
844 | ||
845 | static inline bool | |
846 | eh_region_may_contain_throw (eh_region r) | |
847 | { | |
848 | return r && bitmap_bit_p (eh_region_may_contain_throw_map, r->index); | |
849 | } | |
850 | ||
6de9cd9a DN |
851 | /* We want to transform |
852 | try { body; } catch { stuff; } | |
853 | to | |
1d65f45c RH |
854 | normal_seqence: |
855 | body; | |
856 | over: | |
857 | eh_seqence: | |
858 | landing_pad: | |
859 | stuff; | |
860 | goto over; | |
861 | ||
862 | TP is a GIMPLE_TRY node. REGION is the region whose post_landing_pad | |
6de9cd9a DN |
863 | should be placed before the second operand, or NULL. OVER is |
864 | an existing label that should be put at the exit, or NULL. */ | |
865 | ||
726a989a | 866 | static gimple_seq |
1d65f45c | 867 | frob_into_branch_around (gimple tp, eh_region region, tree over) |
6de9cd9a | 868 | { |
726a989a RB |
869 | gimple x; |
870 | gimple_seq cleanup, result; | |
c2255bc4 | 871 | location_t loc = gimple_location (tp); |
6de9cd9a | 872 | |
726a989a RB |
873 | cleanup = gimple_try_cleanup (tp); |
874 | result = gimple_try_eval (tp); | |
6de9cd9a | 875 | |
1d65f45c RH |
876 | if (region) |
877 | emit_post_landing_pad (&eh_seq, region); | |
878 | ||
879 | if (gimple_seq_may_fallthru (cleanup)) | |
6de9cd9a DN |
880 | { |
881 | if (!over) | |
c2255bc4 | 882 | over = create_artificial_label (loc); |
726a989a | 883 | x = gimple_build_goto (over); |
29f5bccb | 884 | gimple_set_location (x, loc); |
1d65f45c | 885 | gimple_seq_add_stmt (&cleanup, x); |
6de9cd9a | 886 | } |
1d65f45c | 887 | gimple_seq_add_seq (&eh_seq, cleanup); |
6de9cd9a DN |
888 | |
889 | if (over) | |
890 | { | |
726a989a RB |
891 | x = gimple_build_label (over); |
892 | gimple_seq_add_stmt (&result, x); | |
6de9cd9a | 893 | } |
726a989a | 894 | return result; |
6de9cd9a DN |
895 | } |
896 | ||
897 | /* A subroutine of lower_try_finally. Duplicate the tree rooted at T. | |
898 | Make sure to record all new labels found. */ | |
899 | ||
726a989a | 900 | static gimple_seq |
820055a0 DC |
901 | lower_try_finally_dup_block (gimple_seq seq, struct leh_state *outer_state, |
902 | location_t loc) | |
6de9cd9a | 903 | { |
726a989a RB |
904 | gimple region = NULL; |
905 | gimple_seq new_seq; | |
820055a0 | 906 | gimple_stmt_iterator gsi; |
6de9cd9a | 907 | |
726a989a | 908 | new_seq = copy_gimple_seq_and_replace_locals (seq); |
6de9cd9a | 909 | |
820055a0 | 910 | for (gsi = gsi_start (new_seq); !gsi_end_p (gsi); gsi_next (&gsi)) |
62d4d60c DC |
911 | { |
912 | gimple stmt = gsi_stmt (gsi); | |
2f13f2de | 913 | if (LOCATION_LOCUS (gimple_location (stmt)) == UNKNOWN_LOCATION) |
62d4d60c DC |
914 | { |
915 | tree block = gimple_block (stmt); | |
916 | gimple_set_location (stmt, loc); | |
917 | gimple_set_block (stmt, block); | |
918 | } | |
919 | } | |
820055a0 | 920 | |
6de9cd9a DN |
921 | if (outer_state->tf) |
922 | region = outer_state->tf->try_finally_expr; | |
726a989a | 923 | collect_finally_tree_1 (new_seq, region); |
6de9cd9a | 924 | |
726a989a | 925 | return new_seq; |
6de9cd9a DN |
926 | } |
927 | ||
928 | /* A subroutine of lower_try_finally. Create a fallthru label for | |
929 | the given try_finally state. The only tricky bit here is that | |
930 | we have to make sure to record the label in our outer context. */ | |
931 | ||
932 | static tree | |
933 | lower_try_finally_fallthru_label (struct leh_tf_state *tf) | |
934 | { | |
935 | tree label = tf->fallthru_label; | |
726a989a RB |
936 | treemple temp; |
937 | ||
6de9cd9a DN |
938 | if (!label) |
939 | { | |
c2255bc4 | 940 | label = create_artificial_label (gimple_location (tf->try_finally_expr)); |
6de9cd9a DN |
941 | tf->fallthru_label = label; |
942 | if (tf->outer->tf) | |
726a989a RB |
943 | { |
944 | temp.t = label; | |
945 | record_in_finally_tree (temp, tf->outer->tf->try_finally_expr); | |
946 | } | |
6de9cd9a DN |
947 | } |
948 | return label; | |
949 | } | |
950 | ||
0a35513e AH |
951 | /* A subroutine of lower_try_finally. If FINALLY consits of a |
952 | GIMPLE_EH_ELSE node, return it. */ | |
953 | ||
954 | static inline gimple | |
955 | get_eh_else (gimple_seq finally) | |
956 | { | |
957 | gimple x = gimple_seq_first_stmt (finally); | |
958 | if (gimple_code (x) == GIMPLE_EH_ELSE) | |
959 | { | |
960 | gcc_assert (gimple_seq_singleton_p (finally)); | |
961 | return x; | |
962 | } | |
963 | return NULL; | |
964 | } | |
965 | ||
3b06d379 SB |
966 | /* A subroutine of lower_try_finally. If the eh_protect_cleanup_actions |
967 | langhook returns non-null, then the language requires that the exception | |
968 | path out of a try_finally be treated specially. To wit: the code within | |
969 | the finally block may not itself throw an exception. We have two choices | |
970 | here. First we can duplicate the finally block and wrap it in a | |
971 | must_not_throw region. Second, we can generate code like | |
6de9cd9a DN |
972 | |
973 | try { | |
974 | finally_block; | |
975 | } catch { | |
976 | if (fintmp == eh_edge) | |
977 | protect_cleanup_actions; | |
978 | } | |
979 | ||
980 | where "fintmp" is the temporary used in the switch statement generation | |
981 | alternative considered below. For the nonce, we always choose the first | |
19114537 | 982 | option. |
6de9cd9a | 983 | |
3f117656 | 984 | THIS_STATE may be null if this is a try-cleanup, not a try-finally. */ |
6de9cd9a DN |
985 | |
986 | static void | |
987 | honor_protect_cleanup_actions (struct leh_state *outer_state, | |
988 | struct leh_state *this_state, | |
989 | struct leh_tf_state *tf) | |
990 | { | |
1d65f45c | 991 | tree protect_cleanup_actions; |
726a989a | 992 | gimple_stmt_iterator gsi; |
6de9cd9a | 993 | bool finally_may_fallthru; |
726a989a | 994 | gimple_seq finally; |
0a35513e | 995 | gimple x, eh_else; |
6de9cd9a DN |
996 | |
997 | /* First check for nothing to do. */ | |
3b06d379 | 998 | if (lang_hooks.eh_protect_cleanup_actions == NULL) |
1d65f45c | 999 | return; |
3b06d379 | 1000 | protect_cleanup_actions = lang_hooks.eh_protect_cleanup_actions (); |
1d65f45c RH |
1001 | if (protect_cleanup_actions == NULL) |
1002 | return; | |
6de9cd9a | 1003 | |
726a989a | 1004 | finally = gimple_try_cleanup (tf->top_p); |
0a35513e | 1005 | eh_else = get_eh_else (finally); |
6de9cd9a DN |
1006 | |
1007 | /* Duplicate the FINALLY block. Only need to do this for try-finally, | |
0a35513e AH |
1008 | and not for cleanups. If we've got an EH_ELSE, extract it now. */ |
1009 | if (eh_else) | |
1010 | { | |
1011 | finally = gimple_eh_else_e_body (eh_else); | |
1012 | gimple_try_set_cleanup (tf->top_p, gimple_eh_else_n_body (eh_else)); | |
1013 | } | |
1014 | else if (this_state) | |
820055a0 | 1015 | finally = lower_try_finally_dup_block (finally, outer_state, |
5368224f | 1016 | gimple_location (tf->try_finally_expr)); |
0a35513e | 1017 | finally_may_fallthru = gimple_seq_may_fallthru (finally); |
6de9cd9a | 1018 | |
33b45227 JM |
1019 | /* If this cleanup consists of a TRY_CATCH_EXPR with TRY_CATCH_IS_CLEANUP |
1020 | set, the handler of the TRY_CATCH_EXPR is another cleanup which ought | |
1021 | to be in an enclosing scope, but needs to be implemented at this level | |
1022 | to avoid a nesting violation (see wrap_temporary_cleanups in | |
1023 | cp/decl.c). Since it's logically at an outer level, we should call | |
1024 | terminate before we get to it, so strip it away before adding the | |
1025 | MUST_NOT_THROW filter. */ | |
726a989a RB |
1026 | gsi = gsi_start (finally); |
1027 | x = gsi_stmt (gsi); | |
1d65f45c | 1028 | if (gimple_code (x) == GIMPLE_TRY |
726a989a RB |
1029 | && gimple_try_kind (x) == GIMPLE_TRY_CATCH |
1030 | && gimple_try_catch_is_cleanup (x)) | |
33b45227 | 1031 | { |
726a989a RB |
1032 | gsi_insert_seq_before (&gsi, gimple_try_eval (x), GSI_SAME_STMT); |
1033 | gsi_remove (&gsi, false); | |
33b45227 JM |
1034 | } |
1035 | ||
6de9cd9a | 1036 | /* Wrap the block with protect_cleanup_actions as the action. */ |
1d65f45c RH |
1037 | x = gimple_build_eh_must_not_throw (protect_cleanup_actions); |
1038 | x = gimple_build_try (finally, gimple_seq_alloc_with_stmt (x), | |
1039 | GIMPLE_TRY_CATCH); | |
1040 | finally = lower_eh_must_not_throw (outer_state, x); | |
1041 | ||
1042 | /* Drop all of this into the exception sequence. */ | |
1043 | emit_post_landing_pad (&eh_seq, tf->region); | |
1044 | gimple_seq_add_seq (&eh_seq, finally); | |
1045 | if (finally_may_fallthru) | |
1046 | emit_resx (&eh_seq, tf->region); | |
6de9cd9a DN |
1047 | |
1048 | /* Having now been handled, EH isn't to be considered with | |
1049 | the rest of the outgoing edges. */ | |
1050 | tf->may_throw = false; | |
1051 | } | |
1052 | ||
1053 | /* A subroutine of lower_try_finally. We have determined that there is | |
1054 | no fallthru edge out of the finally block. This means that there is | |
1055 | no outgoing edge corresponding to any incoming edge. Restructure the | |
1056 | try_finally node for this special case. */ | |
1057 | ||
1058 | static void | |
726a989a RB |
1059 | lower_try_finally_nofallthru (struct leh_state *state, |
1060 | struct leh_tf_state *tf) | |
6de9cd9a | 1061 | { |
8d686507 | 1062 | tree lab; |
0a35513e | 1063 | gimple x, eh_else; |
726a989a | 1064 | gimple_seq finally; |
6de9cd9a DN |
1065 | struct goto_queue_node *q, *qe; |
1066 | ||
1d65f45c | 1067 | lab = create_artificial_label (gimple_location (tf->try_finally_expr)); |
6de9cd9a | 1068 | |
726a989a RB |
1069 | /* We expect that tf->top_p is a GIMPLE_TRY. */ |
1070 | finally = gimple_try_cleanup (tf->top_p); | |
1071 | tf->top_p_seq = gimple_try_eval (tf->top_p); | |
6de9cd9a | 1072 | |
726a989a RB |
1073 | x = gimple_build_label (lab); |
1074 | gimple_seq_add_stmt (&tf->top_p_seq, x); | |
6de9cd9a | 1075 | |
6de9cd9a DN |
1076 | q = tf->goto_queue; |
1077 | qe = q + tf->goto_queue_active; | |
1078 | for (; q < qe; ++q) | |
1079 | if (q->index < 0) | |
8d686507 | 1080 | do_return_redirection (q, lab, NULL); |
6de9cd9a | 1081 | else |
726a989a | 1082 | do_goto_redirection (q, lab, NULL, tf); |
6de9cd9a DN |
1083 | |
1084 | replace_goto_queue (tf); | |
1085 | ||
0a35513e AH |
1086 | /* Emit the finally block into the stream. Lower EH_ELSE at this time. */ |
1087 | eh_else = get_eh_else (finally); | |
1088 | if (eh_else) | |
1089 | { | |
1090 | finally = gimple_eh_else_n_body (eh_else); | |
355a7673 | 1091 | lower_eh_constructs_1 (state, &finally); |
0a35513e | 1092 | gimple_seq_add_seq (&tf->top_p_seq, finally); |
1d65f45c | 1093 | |
0a35513e AH |
1094 | if (tf->may_throw) |
1095 | { | |
1096 | finally = gimple_eh_else_e_body (eh_else); | |
355a7673 | 1097 | lower_eh_constructs_1 (state, &finally); |
0a35513e AH |
1098 | |
1099 | emit_post_landing_pad (&eh_seq, tf->region); | |
1100 | gimple_seq_add_seq (&eh_seq, finally); | |
1101 | } | |
1102 | } | |
1103 | else | |
1d65f45c | 1104 | { |
355a7673 | 1105 | lower_eh_constructs_1 (state, &finally); |
0a35513e | 1106 | gimple_seq_add_seq (&tf->top_p_seq, finally); |
1d65f45c | 1107 | |
0a35513e AH |
1108 | if (tf->may_throw) |
1109 | { | |
1110 | emit_post_landing_pad (&eh_seq, tf->region); | |
1111 | ||
1112 | x = gimple_build_goto (lab); | |
29f5bccb | 1113 | gimple_set_location (x, gimple_location (tf->try_finally_expr)); |
0a35513e AH |
1114 | gimple_seq_add_stmt (&eh_seq, x); |
1115 | } | |
1d65f45c | 1116 | } |
6de9cd9a DN |
1117 | } |
1118 | ||
1119 | /* A subroutine of lower_try_finally. We have determined that there is | |
1120 | exactly one destination of the finally block. Restructure the | |
1121 | try_finally node for this special case. */ | |
1122 | ||
1123 | static void | |
1124 | lower_try_finally_onedest (struct leh_state *state, struct leh_tf_state *tf) | |
1125 | { | |
1126 | struct goto_queue_node *q, *qe; | |
726a989a RB |
1127 | gimple x; |
1128 | gimple_seq finally; | |
e368f44f | 1129 | gimple_stmt_iterator gsi; |
726a989a | 1130 | tree finally_label; |
c2255bc4 | 1131 | location_t loc = gimple_location (tf->try_finally_expr); |
6de9cd9a | 1132 | |
726a989a RB |
1133 | finally = gimple_try_cleanup (tf->top_p); |
1134 | tf->top_p_seq = gimple_try_eval (tf->top_p); | |
6de9cd9a | 1135 | |
0a35513e AH |
1136 | /* Since there's only one destination, and the destination edge can only |
1137 | either be EH or non-EH, that implies that all of our incoming edges | |
1138 | are of the same type. Therefore we can lower EH_ELSE immediately. */ | |
1139 | x = get_eh_else (finally); | |
1140 | if (x) | |
1141 | { | |
1142 | if (tf->may_throw) | |
1143 | finally = gimple_eh_else_e_body (x); | |
1144 | else | |
1145 | finally = gimple_eh_else_n_body (x); | |
1146 | } | |
1147 | ||
355a7673 | 1148 | lower_eh_constructs_1 (state, &finally); |
6de9cd9a | 1149 | |
e368f44f DC |
1150 | for (gsi = gsi_start (finally); !gsi_end_p (gsi); gsi_next (&gsi)) |
1151 | { | |
1152 | gimple stmt = gsi_stmt (gsi); | |
1153 | if (LOCATION_LOCUS (gimple_location (stmt)) == UNKNOWN_LOCATION) | |
1154 | { | |
1155 | tree block = gimple_block (stmt); | |
1156 | gimple_set_location (stmt, gimple_location (tf->try_finally_expr)); | |
1157 | gimple_set_block (stmt, block); | |
1158 | } | |
1159 | } | |
1160 | ||
6de9cd9a DN |
1161 | if (tf->may_throw) |
1162 | { | |
1163 | /* Only reachable via the exception edge. Add the given label to | |
1164 | the head of the FINALLY block. Append a RESX at the end. */ | |
1d65f45c RH |
1165 | emit_post_landing_pad (&eh_seq, tf->region); |
1166 | gimple_seq_add_seq (&eh_seq, finally); | |
1167 | emit_resx (&eh_seq, tf->region); | |
6de9cd9a DN |
1168 | return; |
1169 | } | |
1170 | ||
1171 | if (tf->may_fallthru) | |
1172 | { | |
1173 | /* Only reachable via the fallthru edge. Do nothing but let | |
1174 | the two blocks run together; we'll fall out the bottom. */ | |
726a989a | 1175 | gimple_seq_add_seq (&tf->top_p_seq, finally); |
6de9cd9a DN |
1176 | return; |
1177 | } | |
1178 | ||
c2255bc4 | 1179 | finally_label = create_artificial_label (loc); |
726a989a RB |
1180 | x = gimple_build_label (finally_label); |
1181 | gimple_seq_add_stmt (&tf->top_p_seq, x); | |
6de9cd9a | 1182 | |
726a989a | 1183 | gimple_seq_add_seq (&tf->top_p_seq, finally); |
6de9cd9a DN |
1184 | |
1185 | q = tf->goto_queue; | |
1186 | qe = q + tf->goto_queue_active; | |
1187 | ||
1188 | if (tf->may_return) | |
1189 | { | |
1190 | /* Reachable by return expressions only. Redirect them. */ | |
6de9cd9a | 1191 | for (; q < qe; ++q) |
8d686507 | 1192 | do_return_redirection (q, finally_label, NULL); |
6de9cd9a DN |
1193 | replace_goto_queue (tf); |
1194 | } | |
1195 | else | |
1196 | { | |
1197 | /* Reachable by goto expressions only. Redirect them. */ | |
1198 | for (; q < qe; ++q) | |
726a989a | 1199 | do_goto_redirection (q, finally_label, NULL, tf); |
6de9cd9a | 1200 | replace_goto_queue (tf); |
19114537 | 1201 | |
9771b263 | 1202 | if (tf->dest_array[0] == tf->fallthru_label) |
6de9cd9a DN |
1203 | { |
1204 | /* Reachable by goto to fallthru label only. Redirect it | |
1205 | to the new label (already created, sadly), and do not | |
1206 | emit the final branch out, or the fallthru label. */ | |
1207 | tf->fallthru_label = NULL; | |
1208 | return; | |
1209 | } | |
1210 | } | |
1211 | ||
726a989a RB |
1212 | /* Place the original return/goto to the original destination |
1213 | immediately after the finally block. */ | |
1214 | x = tf->goto_queue[0].cont_stmt; | |
1215 | gimple_seq_add_stmt (&tf->top_p_seq, x); | |
1216 | maybe_record_in_goto_queue (state, x); | |
6de9cd9a DN |
1217 | } |
1218 | ||
1219 | /* A subroutine of lower_try_finally. There are multiple edges incoming | |
1220 | and outgoing from the finally block. Implement this by duplicating the | |
1221 | finally block for every destination. */ | |
1222 | ||
1223 | static void | |
1224 | lower_try_finally_copy (struct leh_state *state, struct leh_tf_state *tf) | |
1225 | { | |
726a989a RB |
1226 | gimple_seq finally; |
1227 | gimple_seq new_stmt; | |
1228 | gimple_seq seq; | |
0a35513e | 1229 | gimple x, eh_else; |
726a989a | 1230 | tree tmp; |
c2255bc4 | 1231 | location_t tf_loc = gimple_location (tf->try_finally_expr); |
6de9cd9a | 1232 | |
726a989a | 1233 | finally = gimple_try_cleanup (tf->top_p); |
0a35513e AH |
1234 | |
1235 | /* Notice EH_ELSE, and simplify some of the remaining code | |
1236 | by considering FINALLY to be the normal return path only. */ | |
1237 | eh_else = get_eh_else (finally); | |
1238 | if (eh_else) | |
1239 | finally = gimple_eh_else_n_body (eh_else); | |
1240 | ||
726a989a RB |
1241 | tf->top_p_seq = gimple_try_eval (tf->top_p); |
1242 | new_stmt = NULL; | |
6de9cd9a DN |
1243 | |
1244 | if (tf->may_fallthru) | |
1245 | { | |
820055a0 | 1246 | seq = lower_try_finally_dup_block (finally, state, tf_loc); |
355a7673 | 1247 | lower_eh_constructs_1 (state, &seq); |
726a989a | 1248 | gimple_seq_add_seq (&new_stmt, seq); |
6de9cd9a | 1249 | |
726a989a RB |
1250 | tmp = lower_try_finally_fallthru_label (tf); |
1251 | x = gimple_build_goto (tmp); | |
29f5bccb | 1252 | gimple_set_location (x, tf_loc); |
726a989a | 1253 | gimple_seq_add_stmt (&new_stmt, x); |
6de9cd9a DN |
1254 | } |
1255 | ||
1256 | if (tf->may_throw) | |
1257 | { | |
0a35513e AH |
1258 | /* We don't need to copy the EH path of EH_ELSE, |
1259 | since it is only emitted once. */ | |
1260 | if (eh_else) | |
1261 | seq = gimple_eh_else_e_body (eh_else); | |
1262 | else | |
820055a0 | 1263 | seq = lower_try_finally_dup_block (finally, state, tf_loc); |
355a7673 | 1264 | lower_eh_constructs_1 (state, &seq); |
6de9cd9a | 1265 | |
288f5b2e RH |
1266 | emit_post_landing_pad (&eh_seq, tf->region); |
1267 | gimple_seq_add_seq (&eh_seq, seq); | |
1d65f45c | 1268 | emit_resx (&eh_seq, tf->region); |
6de9cd9a DN |
1269 | } |
1270 | ||
1271 | if (tf->goto_queue) | |
1272 | { | |
1273 | struct goto_queue_node *q, *qe; | |
dd58eb5a | 1274 | int return_index, index; |
858904db | 1275 | struct labels_s |
dd58eb5a AO |
1276 | { |
1277 | struct goto_queue_node *q; | |
1278 | tree label; | |
1279 | } *labels; | |
6de9cd9a | 1280 | |
9771b263 | 1281 | return_index = tf->dest_array.length (); |
858904db | 1282 | labels = XCNEWVEC (struct labels_s, return_index + 1); |
6de9cd9a DN |
1283 | |
1284 | q = tf->goto_queue; | |
1285 | qe = q + tf->goto_queue_active; | |
1286 | for (; q < qe; q++) | |
1287 | { | |
dd58eb5a AO |
1288 | index = q->index < 0 ? return_index : q->index; |
1289 | ||
1290 | if (!labels[index].q) | |
1291 | labels[index].q = q; | |
1292 | } | |
1293 | ||
1294 | for (index = 0; index < return_index + 1; index++) | |
1295 | { | |
1296 | tree lab; | |
1297 | ||
1298 | q = labels[index].q; | |
1299 | if (! q) | |
1300 | continue; | |
1301 | ||
c2255bc4 AH |
1302 | lab = labels[index].label |
1303 | = create_artificial_label (tf_loc); | |
6de9cd9a DN |
1304 | |
1305 | if (index == return_index) | |
8d686507 | 1306 | do_return_redirection (q, lab, NULL); |
6de9cd9a | 1307 | else |
726a989a | 1308 | do_goto_redirection (q, lab, NULL, tf); |
6de9cd9a | 1309 | |
726a989a RB |
1310 | x = gimple_build_label (lab); |
1311 | gimple_seq_add_stmt (&new_stmt, x); | |
6de9cd9a | 1312 | |
820055a0 | 1313 | seq = lower_try_finally_dup_block (finally, state, q->location); |
355a7673 | 1314 | lower_eh_constructs_1 (state, &seq); |
726a989a | 1315 | gimple_seq_add_seq (&new_stmt, seq); |
6de9cd9a | 1316 | |
726a989a | 1317 | gimple_seq_add_stmt (&new_stmt, q->cont_stmt); |
dd58eb5a | 1318 | maybe_record_in_goto_queue (state, q->cont_stmt); |
6de9cd9a | 1319 | } |
dd58eb5a AO |
1320 | |
1321 | for (q = tf->goto_queue; q < qe; q++) | |
1322 | { | |
1323 | tree lab; | |
1324 | ||
1325 | index = q->index < 0 ? return_index : q->index; | |
1326 | ||
1327 | if (labels[index].q == q) | |
1328 | continue; | |
1329 | ||
1330 | lab = labels[index].label; | |
1331 | ||
1332 | if (index == return_index) | |
8d686507 | 1333 | do_return_redirection (q, lab, NULL); |
dd58eb5a | 1334 | else |
726a989a | 1335 | do_goto_redirection (q, lab, NULL, tf); |
dd58eb5a | 1336 | } |
1d65f45c | 1337 | |
6de9cd9a DN |
1338 | replace_goto_queue (tf); |
1339 | free (labels); | |
1340 | } | |
1341 | ||
1342 | /* Need to link new stmts after running replace_goto_queue due | |
1343 | to not wanting to process the same goto stmts twice. */ | |
726a989a | 1344 | gimple_seq_add_seq (&tf->top_p_seq, new_stmt); |
6de9cd9a DN |
1345 | } |
1346 | ||
1347 | /* A subroutine of lower_try_finally. There are multiple edges incoming | |
1348 | and outgoing from the finally block. Implement this by instrumenting | |
1349 | each incoming edge and creating a switch statement at the end of the | |
1350 | finally block that branches to the appropriate destination. */ | |
1351 | ||
1352 | static void | |
1353 | lower_try_finally_switch (struct leh_state *state, struct leh_tf_state *tf) | |
1354 | { | |
1355 | struct goto_queue_node *q, *qe; | |
726a989a | 1356 | tree finally_tmp, finally_label; |
6de9cd9a DN |
1357 | int return_index, eh_index, fallthru_index; |
1358 | int nlabels, ndests, j, last_case_index; | |
726a989a | 1359 | tree last_case; |
9771b263 | 1360 | vec<tree> case_label_vec; |
355a7673 | 1361 | gimple_seq switch_body = NULL; |
0a35513e | 1362 | gimple x, eh_else; |
726a989a RB |
1363 | tree tmp; |
1364 | gimple switch_stmt; | |
1365 | gimple_seq finally; | |
1366 | struct pointer_map_t *cont_map = NULL; | |
c2255bc4 | 1367 | /* The location of the TRY_FINALLY stmt. */ |
d40eb158 | 1368 | location_t tf_loc = gimple_location (tf->try_finally_expr); |
c2255bc4 AH |
1369 | /* The location of the finally block. */ |
1370 | location_t finally_loc; | |
726a989a | 1371 | |
0a35513e AH |
1372 | finally = gimple_try_cleanup (tf->top_p); |
1373 | eh_else = get_eh_else (finally); | |
6de9cd9a DN |
1374 | |
1375 | /* Mash the TRY block to the head of the chain. */ | |
726a989a | 1376 | tf->top_p_seq = gimple_try_eval (tf->top_p); |
6de9cd9a | 1377 | |
c2255bc4 AH |
1378 | /* The location of the finally is either the last stmt in the finally |
1379 | block or the location of the TRY_FINALLY itself. */ | |
0118b919 EB |
1380 | x = gimple_seq_last_stmt (finally); |
1381 | finally_loc = x ? gimple_location (x) : tf_loc; | |
c2255bc4 | 1382 | |
6de9cd9a | 1383 | /* Lower the finally block itself. */ |
355a7673 | 1384 | lower_eh_constructs_1 (state, &finally); |
6de9cd9a DN |
1385 | |
1386 | /* Prepare for switch statement generation. */ | |
9771b263 | 1387 | nlabels = tf->dest_array.length (); |
6de9cd9a DN |
1388 | return_index = nlabels; |
1389 | eh_index = return_index + tf->may_return; | |
0a35513e | 1390 | fallthru_index = eh_index + (tf->may_throw && !eh_else); |
6de9cd9a DN |
1391 | ndests = fallthru_index + tf->may_fallthru; |
1392 | ||
1393 | finally_tmp = create_tmp_var (integer_type_node, "finally_tmp"); | |
c2255bc4 | 1394 | finally_label = create_artificial_label (finally_loc); |
6de9cd9a | 1395 | |
9771b263 | 1396 | /* We use vec::quick_push on case_label_vec throughout this function, |
726a989a RB |
1397 | since we know the size in advance and allocate precisely as muce |
1398 | space as needed. */ | |
9771b263 | 1399 | case_label_vec.create (ndests); |
6de9cd9a DN |
1400 | last_case = NULL; |
1401 | last_case_index = 0; | |
1402 | ||
1403 | /* Begin inserting code for getting to the finally block. Things | |
1404 | are done in this order to correspond to the sequence the code is | |
073a8998 | 1405 | laid out. */ |
6de9cd9a DN |
1406 | |
1407 | if (tf->may_fallthru) | |
1408 | { | |
1d65f45c | 1409 | x = gimple_build_assign (finally_tmp, |
413581ba RG |
1410 | build_int_cst (integer_type_node, |
1411 | fallthru_index)); | |
726a989a | 1412 | gimple_seq_add_stmt (&tf->top_p_seq, x); |
6de9cd9a | 1413 | |
3d528853 NF |
1414 | tmp = build_int_cst (integer_type_node, fallthru_index); |
1415 | last_case = build_case_label (tmp, NULL, | |
1416 | create_artificial_label (tf_loc)); | |
9771b263 | 1417 | case_label_vec.quick_push (last_case); |
6de9cd9a DN |
1418 | last_case_index++; |
1419 | ||
726a989a RB |
1420 | x = gimple_build_label (CASE_LABEL (last_case)); |
1421 | gimple_seq_add_stmt (&switch_body, x); | |
6de9cd9a | 1422 | |
726a989a RB |
1423 | tmp = lower_try_finally_fallthru_label (tf); |
1424 | x = gimple_build_goto (tmp); | |
29f5bccb | 1425 | gimple_set_location (x, tf_loc); |
726a989a | 1426 | gimple_seq_add_stmt (&switch_body, x); |
6de9cd9a DN |
1427 | } |
1428 | ||
0a35513e AH |
1429 | /* For EH_ELSE, emit the exception path (plus resx) now, then |
1430 | subsequently we only need consider the normal path. */ | |
1431 | if (eh_else) | |
1432 | { | |
1433 | if (tf->may_throw) | |
1434 | { | |
1435 | finally = gimple_eh_else_e_body (eh_else); | |
355a7673 | 1436 | lower_eh_constructs_1 (state, &finally); |
0a35513e AH |
1437 | |
1438 | emit_post_landing_pad (&eh_seq, tf->region); | |
1439 | gimple_seq_add_seq (&eh_seq, finally); | |
1440 | emit_resx (&eh_seq, tf->region); | |
1441 | } | |
1442 | ||
1443 | finally = gimple_eh_else_n_body (eh_else); | |
1444 | } | |
1445 | else if (tf->may_throw) | |
6de9cd9a | 1446 | { |
1d65f45c | 1447 | emit_post_landing_pad (&eh_seq, tf->region); |
6de9cd9a | 1448 | |
1d65f45c | 1449 | x = gimple_build_assign (finally_tmp, |
413581ba | 1450 | build_int_cst (integer_type_node, eh_index)); |
1d65f45c RH |
1451 | gimple_seq_add_stmt (&eh_seq, x); |
1452 | ||
1453 | x = gimple_build_goto (finally_label); | |
29f5bccb | 1454 | gimple_set_location (x, tf_loc); |
1d65f45c | 1455 | gimple_seq_add_stmt (&eh_seq, x); |
6de9cd9a | 1456 | |
3d528853 NF |
1457 | tmp = build_int_cst (integer_type_node, eh_index); |
1458 | last_case = build_case_label (tmp, NULL, | |
1459 | create_artificial_label (tf_loc)); | |
9771b263 | 1460 | case_label_vec.quick_push (last_case); |
6de9cd9a DN |
1461 | last_case_index++; |
1462 | ||
726a989a | 1463 | x = gimple_build_label (CASE_LABEL (last_case)); |
1d65f45c RH |
1464 | gimple_seq_add_stmt (&eh_seq, x); |
1465 | emit_resx (&eh_seq, tf->region); | |
6de9cd9a DN |
1466 | } |
1467 | ||
726a989a RB |
1468 | x = gimple_build_label (finally_label); |
1469 | gimple_seq_add_stmt (&tf->top_p_seq, x); | |
6de9cd9a | 1470 | |
726a989a | 1471 | gimple_seq_add_seq (&tf->top_p_seq, finally); |
6de9cd9a DN |
1472 | |
1473 | /* Redirect each incoming goto edge. */ | |
1474 | q = tf->goto_queue; | |
1475 | qe = q + tf->goto_queue_active; | |
1476 | j = last_case_index + tf->may_return; | |
726a989a RB |
1477 | /* Prepare the assignments to finally_tmp that are executed upon the |
1478 | entrance through a particular edge. */ | |
6de9cd9a DN |
1479 | for (; q < qe; ++q) |
1480 | { | |
355a7673 | 1481 | gimple_seq mod = NULL; |
726a989a RB |
1482 | int switch_id; |
1483 | unsigned int case_index; | |
1484 | ||
6de9cd9a DN |
1485 | if (q->index < 0) |
1486 | { | |
726a989a | 1487 | x = gimple_build_assign (finally_tmp, |
413581ba RG |
1488 | build_int_cst (integer_type_node, |
1489 | return_index)); | |
726a989a | 1490 | gimple_seq_add_stmt (&mod, x); |
8d686507 | 1491 | do_return_redirection (q, finally_label, mod); |
6de9cd9a DN |
1492 | switch_id = return_index; |
1493 | } | |
1494 | else | |
1495 | { | |
726a989a | 1496 | x = gimple_build_assign (finally_tmp, |
413581ba | 1497 | build_int_cst (integer_type_node, q->index)); |
726a989a RB |
1498 | gimple_seq_add_stmt (&mod, x); |
1499 | do_goto_redirection (q, finally_label, mod, tf); | |
6de9cd9a DN |
1500 | switch_id = q->index; |
1501 | } | |
1502 | ||
1503 | case_index = j + q->index; | |
9771b263 | 1504 | if (case_label_vec.length () <= case_index || !case_label_vec[case_index]) |
726a989a RB |
1505 | { |
1506 | tree case_lab; | |
1507 | void **slot; | |
3d528853 NF |
1508 | tmp = build_int_cst (integer_type_node, switch_id); |
1509 | case_lab = build_case_label (tmp, NULL, | |
1510 | create_artificial_label (tf_loc)); | |
726a989a | 1511 | /* We store the cont_stmt in the pointer map, so that we can recover |
ffa03772 | 1512 | it in the loop below. */ |
726a989a RB |
1513 | if (!cont_map) |
1514 | cont_map = pointer_map_create (); | |
1515 | slot = pointer_map_insert (cont_map, case_lab); | |
1516 | *slot = q->cont_stmt; | |
9771b263 | 1517 | case_label_vec.quick_push (case_lab); |
726a989a | 1518 | } |
dd58eb5a AO |
1519 | } |
1520 | for (j = last_case_index; j < last_case_index + nlabels; j++) | |
1521 | { | |
726a989a RB |
1522 | gimple cont_stmt; |
1523 | void **slot; | |
dd58eb5a | 1524 | |
9771b263 | 1525 | last_case = case_label_vec[j]; |
dd58eb5a AO |
1526 | |
1527 | gcc_assert (last_case); | |
726a989a | 1528 | gcc_assert (cont_map); |
dd58eb5a | 1529 | |
726a989a | 1530 | slot = pointer_map_contains (cont_map, last_case); |
726a989a RB |
1531 | gcc_assert (slot); |
1532 | cont_stmt = *(gimple *) slot; | |
dd58eb5a | 1533 | |
ffa03772 | 1534 | x = gimple_build_label (CASE_LABEL (last_case)); |
726a989a RB |
1535 | gimple_seq_add_stmt (&switch_body, x); |
1536 | gimple_seq_add_stmt (&switch_body, cont_stmt); | |
dd58eb5a | 1537 | maybe_record_in_goto_queue (state, cont_stmt); |
6de9cd9a | 1538 | } |
726a989a RB |
1539 | if (cont_map) |
1540 | pointer_map_destroy (cont_map); | |
1541 | ||
6de9cd9a | 1542 | replace_goto_queue (tf); |
6de9cd9a | 1543 | |
0f1f6967 SB |
1544 | /* Make sure that the last case is the default label, as one is required. |
1545 | Then sort the labels, which is also required in GIMPLE. */ | |
6de9cd9a | 1546 | CASE_LOW (last_case) = NULL; |
0f1f6967 | 1547 | sort_case_labels (case_label_vec); |
6de9cd9a | 1548 | |
726a989a RB |
1549 | /* Build the switch statement, setting last_case to be the default |
1550 | label. */ | |
fd8d363e SB |
1551 | switch_stmt = gimple_build_switch (finally_tmp, last_case, |
1552 | case_label_vec); | |
c2255bc4 | 1553 | gimple_set_location (switch_stmt, finally_loc); |
726a989a RB |
1554 | |
1555 | /* Need to link SWITCH_STMT after running replace_goto_queue | |
1556 | due to not wanting to process the same goto stmts twice. */ | |
1557 | gimple_seq_add_stmt (&tf->top_p_seq, switch_stmt); | |
1558 | gimple_seq_add_seq (&tf->top_p_seq, switch_body); | |
6de9cd9a DN |
1559 | } |
1560 | ||
1561 | /* Decide whether or not we are going to duplicate the finally block. | |
1562 | There are several considerations. | |
1563 | ||
1564 | First, if this is Java, then the finally block contains code | |
1565 | written by the user. It has line numbers associated with it, | |
1566 | so duplicating the block means it's difficult to set a breakpoint. | |
1567 | Since controlling code generation via -g is verboten, we simply | |
1568 | never duplicate code without optimization. | |
1569 | ||
1570 | Second, we'd like to prevent egregious code growth. One way to | |
1571 | do this is to estimate the size of the finally block, multiply | |
1572 | that by the number of copies we'd need to make, and compare against | |
1573 | the estimate of the size of the switch machinery we'd have to add. */ | |
1574 | ||
1575 | static bool | |
0a35513e | 1576 | decide_copy_try_finally (int ndests, bool may_throw, gimple_seq finally) |
6de9cd9a DN |
1577 | { |
1578 | int f_estimate, sw_estimate; | |
0a35513e AH |
1579 | gimple eh_else; |
1580 | ||
1581 | /* If there's an EH_ELSE involved, the exception path is separate | |
1582 | and really doesn't come into play for this computation. */ | |
1583 | eh_else = get_eh_else (finally); | |
1584 | if (eh_else) | |
1585 | { | |
1586 | ndests -= may_throw; | |
1587 | finally = gimple_eh_else_n_body (eh_else); | |
1588 | } | |
6de9cd9a DN |
1589 | |
1590 | if (!optimize) | |
bccc50d4 JJ |
1591 | { |
1592 | gimple_stmt_iterator gsi; | |
1593 | ||
1594 | if (ndests == 1) | |
1595 | return true; | |
1596 | ||
1597 | for (gsi = gsi_start (finally); !gsi_end_p (gsi); gsi_next (&gsi)) | |
1598 | { | |
1599 | gimple stmt = gsi_stmt (gsi); | |
1600 | if (!is_gimple_debug (stmt) && !gimple_clobber_p (stmt)) | |
1601 | return false; | |
1602 | } | |
1603 | return true; | |
1604 | } | |
6de9cd9a DN |
1605 | |
1606 | /* Finally estimate N times, plus N gotos. */ | |
726a989a | 1607 | f_estimate = count_insns_seq (finally, &eni_size_weights); |
6de9cd9a DN |
1608 | f_estimate = (f_estimate + 1) * ndests; |
1609 | ||
1610 | /* Switch statement (cost 10), N variable assignments, N gotos. */ | |
1611 | sw_estimate = 10 + 2 * ndests; | |
1612 | ||
1613 | /* Optimize for size clearly wants our best guess. */ | |
efd8f750 | 1614 | if (optimize_function_for_size_p (cfun)) |
6de9cd9a DN |
1615 | return f_estimate < sw_estimate; |
1616 | ||
1617 | /* ??? These numbers are completely made up so far. */ | |
1618 | if (optimize > 1) | |
7465ed07 | 1619 | return f_estimate < 100 || f_estimate < sw_estimate * 2; |
6de9cd9a | 1620 | else |
7465ed07 | 1621 | return f_estimate < 40 || f_estimate * 2 < sw_estimate * 3; |
6de9cd9a DN |
1622 | } |
1623 | ||
d3f28910 JM |
1624 | /* REG is the enclosing region for a possible cleanup region, or the region |
1625 | itself. Returns TRUE if such a region would be unreachable. | |
1626 | ||
1627 | Cleanup regions within a must-not-throw region aren't actually reachable | |
1628 | even if there are throwing stmts within them, because the personality | |
1629 | routine will call terminate before unwinding. */ | |
1630 | ||
1631 | static bool | |
1632 | cleanup_is_dead_in (eh_region reg) | |
1633 | { | |
1634 | while (reg && reg->type == ERT_CLEANUP) | |
1635 | reg = reg->outer; | |
1636 | return (reg && reg->type == ERT_MUST_NOT_THROW); | |
1637 | } | |
726a989a RB |
1638 | |
1639 | /* A subroutine of lower_eh_constructs_1. Lower a GIMPLE_TRY_FINALLY nodes | |
6de9cd9a | 1640 | to a sequence of labels and blocks, plus the exception region trees |
19114537 | 1641 | that record all the magic. This is complicated by the need to |
6de9cd9a DN |
1642 | arrange for the FINALLY block to be executed on all exits. */ |
1643 | ||
726a989a RB |
1644 | static gimple_seq |
1645 | lower_try_finally (struct leh_state *state, gimple tp) | |
6de9cd9a DN |
1646 | { |
1647 | struct leh_tf_state this_tf; | |
1648 | struct leh_state this_state; | |
1649 | int ndests; | |
e19d1f06 | 1650 | gimple_seq old_eh_seq; |
6de9cd9a DN |
1651 | |
1652 | /* Process the try block. */ | |
1653 | ||
1654 | memset (&this_tf, 0, sizeof (this_tf)); | |
726a989a | 1655 | this_tf.try_finally_expr = tp; |
6de9cd9a DN |
1656 | this_tf.top_p = tp; |
1657 | this_tf.outer = state; | |
d3f28910 JM |
1658 | if (using_eh_for_cleanups_p && !cleanup_is_dead_in (state->cur_region)) |
1659 | { | |
1660 | this_tf.region = gen_eh_region_cleanup (state->cur_region); | |
1661 | this_state.cur_region = this_tf.region; | |
1662 | } | |
6de9cd9a | 1663 | else |
d3f28910 JM |
1664 | { |
1665 | this_tf.region = NULL; | |
1666 | this_state.cur_region = state->cur_region; | |
1667 | } | |
6de9cd9a | 1668 | |
1d65f45c | 1669 | this_state.ehp_region = state->ehp_region; |
6de9cd9a DN |
1670 | this_state.tf = &this_tf; |
1671 | ||
e19d1f06 RH |
1672 | old_eh_seq = eh_seq; |
1673 | eh_seq = NULL; | |
1674 | ||
355a7673 | 1675 | lower_eh_constructs_1 (&this_state, gimple_try_eval_ptr (tp)); |
6de9cd9a DN |
1676 | |
1677 | /* Determine if the try block is escaped through the bottom. */ | |
726a989a | 1678 | this_tf.may_fallthru = gimple_seq_may_fallthru (gimple_try_eval (tp)); |
6de9cd9a DN |
1679 | |
1680 | /* Determine if any exceptions are possible within the try block. */ | |
d3f28910 | 1681 | if (this_tf.region) |
b7da9fd4 | 1682 | this_tf.may_throw = eh_region_may_contain_throw (this_tf.region); |
6de9cd9a | 1683 | if (this_tf.may_throw) |
1d65f45c | 1684 | honor_protect_cleanup_actions (state, &this_state, &this_tf); |
6de9cd9a | 1685 | |
6de9cd9a DN |
1686 | /* Determine how many edges (still) reach the finally block. Or rather, |
1687 | how many destinations are reached by the finally block. Use this to | |
1688 | determine how we process the finally block itself. */ | |
1689 | ||
9771b263 | 1690 | ndests = this_tf.dest_array.length (); |
6de9cd9a DN |
1691 | ndests += this_tf.may_fallthru; |
1692 | ndests += this_tf.may_return; | |
1693 | ndests += this_tf.may_throw; | |
1694 | ||
1695 | /* If the FINALLY block is not reachable, dike it out. */ | |
1696 | if (ndests == 0) | |
726a989a RB |
1697 | { |
1698 | gimple_seq_add_seq (&this_tf.top_p_seq, gimple_try_eval (tp)); | |
1699 | gimple_try_set_cleanup (tp, NULL); | |
1700 | } | |
6de9cd9a DN |
1701 | /* If the finally block doesn't fall through, then any destination |
1702 | we might try to impose there isn't reached either. There may be | |
1703 | some minor amount of cleanup and redirection still needed. */ | |
726a989a | 1704 | else if (!gimple_seq_may_fallthru (gimple_try_cleanup (tp))) |
6de9cd9a DN |
1705 | lower_try_finally_nofallthru (state, &this_tf); |
1706 | ||
1707 | /* We can easily special-case redirection to a single destination. */ | |
1708 | else if (ndests == 1) | |
1709 | lower_try_finally_onedest (state, &this_tf); | |
0a35513e AH |
1710 | else if (decide_copy_try_finally (ndests, this_tf.may_throw, |
1711 | gimple_try_cleanup (tp))) | |
6de9cd9a DN |
1712 | lower_try_finally_copy (state, &this_tf); |
1713 | else | |
1714 | lower_try_finally_switch (state, &this_tf); | |
1715 | ||
1716 | /* If someone requested we add a label at the end of the transformed | |
1717 | block, do so. */ | |
1718 | if (this_tf.fallthru_label) | |
1719 | { | |
726a989a RB |
1720 | /* This must be reached only if ndests == 0. */ |
1721 | gimple x = gimple_build_label (this_tf.fallthru_label); | |
1722 | gimple_seq_add_stmt (&this_tf.top_p_seq, x); | |
6de9cd9a DN |
1723 | } |
1724 | ||
9771b263 | 1725 | this_tf.dest_array.release (); |
04695783 | 1726 | free (this_tf.goto_queue); |
0f547d3d SE |
1727 | if (this_tf.goto_queue_map) |
1728 | pointer_map_destroy (this_tf.goto_queue_map); | |
726a989a | 1729 | |
e19d1f06 RH |
1730 | /* If there was an old (aka outer) eh_seq, append the current eh_seq. |
1731 | If there was no old eh_seq, then the append is trivially already done. */ | |
1732 | if (old_eh_seq) | |
1733 | { | |
1734 | if (eh_seq == NULL) | |
1735 | eh_seq = old_eh_seq; | |
1736 | else | |
1737 | { | |
1738 | gimple_seq new_eh_seq = eh_seq; | |
1739 | eh_seq = old_eh_seq; | |
1740 | gimple_seq_add_seq(&eh_seq, new_eh_seq); | |
1741 | } | |
1742 | } | |
1743 | ||
726a989a | 1744 | return this_tf.top_p_seq; |
6de9cd9a DN |
1745 | } |
1746 | ||
726a989a RB |
1747 | /* A subroutine of lower_eh_constructs_1. Lower a GIMPLE_TRY_CATCH with a |
1748 | list of GIMPLE_CATCH to a sequence of labels and blocks, plus the | |
1749 | exception region trees that records all the magic. */ | |
6de9cd9a | 1750 | |
726a989a RB |
1751 | static gimple_seq |
1752 | lower_catch (struct leh_state *state, gimple tp) | |
6de9cd9a | 1753 | { |
b7da9fd4 RH |
1754 | eh_region try_region = NULL; |
1755 | struct leh_state this_state = *state; | |
726a989a | 1756 | gimple_stmt_iterator gsi; |
6de9cd9a | 1757 | tree out_label; |
355a7673 | 1758 | gimple_seq new_seq, cleanup; |
1d65f45c | 1759 | gimple x; |
c2255bc4 | 1760 | location_t try_catch_loc = gimple_location (tp); |
6de9cd9a | 1761 | |
b7da9fd4 RH |
1762 | if (flag_exceptions) |
1763 | { | |
1764 | try_region = gen_eh_region_try (state->cur_region); | |
1765 | this_state.cur_region = try_region; | |
1766 | } | |
6de9cd9a | 1767 | |
355a7673 | 1768 | lower_eh_constructs_1 (&this_state, gimple_try_eval_ptr (tp)); |
6de9cd9a | 1769 | |
b7da9fd4 | 1770 | if (!eh_region_may_contain_throw (try_region)) |
1d65f45c RH |
1771 | return gimple_try_eval (tp); |
1772 | ||
1773 | new_seq = NULL; | |
1774 | emit_eh_dispatch (&new_seq, try_region); | |
1775 | emit_resx (&new_seq, try_region); | |
1776 | ||
1777 | this_state.cur_region = state->cur_region; | |
1778 | this_state.ehp_region = try_region; | |
6de9cd9a DN |
1779 | |
1780 | out_label = NULL; | |
355a7673 MM |
1781 | cleanup = gimple_try_cleanup (tp); |
1782 | for (gsi = gsi_start (cleanup); | |
1d65f45c RH |
1783 | !gsi_end_p (gsi); |
1784 | gsi_next (&gsi)) | |
6de9cd9a | 1785 | { |
1d65f45c RH |
1786 | eh_catch c; |
1787 | gimple gcatch; | |
1788 | gimple_seq handler; | |
6de9cd9a | 1789 | |
82d6e6fc | 1790 | gcatch = gsi_stmt (gsi); |
1d65f45c | 1791 | c = gen_eh_region_catch (try_region, gimple_catch_types (gcatch)); |
6de9cd9a | 1792 | |
1d65f45c | 1793 | handler = gimple_catch_handler (gcatch); |
355a7673 | 1794 | lower_eh_constructs_1 (&this_state, &handler); |
6de9cd9a | 1795 | |
1d65f45c RH |
1796 | c->label = create_artificial_label (UNKNOWN_LOCATION); |
1797 | x = gimple_build_label (c->label); | |
1798 | gimple_seq_add_stmt (&new_seq, x); | |
6de9cd9a | 1799 | |
1d65f45c | 1800 | gimple_seq_add_seq (&new_seq, handler); |
6de9cd9a | 1801 | |
1d65f45c | 1802 | if (gimple_seq_may_fallthru (new_seq)) |
6de9cd9a DN |
1803 | { |
1804 | if (!out_label) | |
c2255bc4 | 1805 | out_label = create_artificial_label (try_catch_loc); |
6de9cd9a | 1806 | |
726a989a | 1807 | x = gimple_build_goto (out_label); |
1d65f45c | 1808 | gimple_seq_add_stmt (&new_seq, x); |
6de9cd9a | 1809 | } |
d815d34e MM |
1810 | if (!c->type_list) |
1811 | break; | |
6de9cd9a DN |
1812 | } |
1813 | ||
1d65f45c RH |
1814 | gimple_try_set_cleanup (tp, new_seq); |
1815 | ||
1816 | return frob_into_branch_around (tp, try_region, out_label); | |
6de9cd9a DN |
1817 | } |
1818 | ||
726a989a RB |
1819 | /* A subroutine of lower_eh_constructs_1. Lower a GIMPLE_TRY with a |
1820 | GIMPLE_EH_FILTER to a sequence of labels and blocks, plus the exception | |
6de9cd9a DN |
1821 | region trees that record all the magic. */ |
1822 | ||
726a989a RB |
1823 | static gimple_seq |
1824 | lower_eh_filter (struct leh_state *state, gimple tp) | |
6de9cd9a | 1825 | { |
b7da9fd4 RH |
1826 | struct leh_state this_state = *state; |
1827 | eh_region this_region = NULL; | |
1d65f45c RH |
1828 | gimple inner, x; |
1829 | gimple_seq new_seq; | |
19114537 | 1830 | |
726a989a RB |
1831 | inner = gimple_seq_first_stmt (gimple_try_cleanup (tp)); |
1832 | ||
b7da9fd4 RH |
1833 | if (flag_exceptions) |
1834 | { | |
1835 | this_region = gen_eh_region_allowed (state->cur_region, | |
1836 | gimple_eh_filter_types (inner)); | |
1837 | this_state.cur_region = this_region; | |
1838 | } | |
19114537 | 1839 | |
355a7673 | 1840 | lower_eh_constructs_1 (&this_state, gimple_try_eval_ptr (tp)); |
6de9cd9a | 1841 | |
b7da9fd4 | 1842 | if (!eh_region_may_contain_throw (this_region)) |
1d65f45c RH |
1843 | return gimple_try_eval (tp); |
1844 | ||
1845 | new_seq = NULL; | |
1846 | this_state.cur_region = state->cur_region; | |
1847 | this_state.ehp_region = this_region; | |
1848 | ||
1849 | emit_eh_dispatch (&new_seq, this_region); | |
1850 | emit_resx (&new_seq, this_region); | |
1851 | ||
1852 | this_region->u.allowed.label = create_artificial_label (UNKNOWN_LOCATION); | |
1853 | x = gimple_build_label (this_region->u.allowed.label); | |
1854 | gimple_seq_add_stmt (&new_seq, x); | |
1855 | ||
355a7673 | 1856 | lower_eh_constructs_1 (&this_state, gimple_eh_filter_failure_ptr (inner)); |
1d65f45c RH |
1857 | gimple_seq_add_seq (&new_seq, gimple_eh_filter_failure (inner)); |
1858 | ||
1859 | gimple_try_set_cleanup (tp, new_seq); | |
6de9cd9a | 1860 | |
1d65f45c RH |
1861 | return frob_into_branch_around (tp, this_region, NULL); |
1862 | } | |
1863 | ||
1864 | /* A subroutine of lower_eh_constructs_1. Lower a GIMPLE_TRY with | |
1865 | an GIMPLE_EH_MUST_NOT_THROW to a sequence of labels and blocks, | |
1866 | plus the exception region trees that record all the magic. */ | |
1867 | ||
1868 | static gimple_seq | |
1869 | lower_eh_must_not_throw (struct leh_state *state, gimple tp) | |
1870 | { | |
b7da9fd4 | 1871 | struct leh_state this_state = *state; |
1d65f45c | 1872 | |
b7da9fd4 RH |
1873 | if (flag_exceptions) |
1874 | { | |
1875 | gimple inner = gimple_seq_first_stmt (gimple_try_cleanup (tp)); | |
1876 | eh_region this_region; | |
1d65f45c | 1877 | |
b7da9fd4 RH |
1878 | this_region = gen_eh_region_must_not_throw (state->cur_region); |
1879 | this_region->u.must_not_throw.failure_decl | |
1880 | = gimple_eh_must_not_throw_fndecl (inner); | |
c16fd676 RB |
1881 | this_region->u.must_not_throw.failure_loc |
1882 | = LOCATION_LOCUS (gimple_location (tp)); | |
1d65f45c | 1883 | |
b7da9fd4 RH |
1884 | /* In order to get mangling applied to this decl, we must mark it |
1885 | used now. Otherwise, pass_ipa_free_lang_data won't think it | |
1886 | needs to happen. */ | |
1887 | TREE_USED (this_region->u.must_not_throw.failure_decl) = 1; | |
1d65f45c | 1888 | |
b7da9fd4 RH |
1889 | this_state.cur_region = this_region; |
1890 | } | |
6de9cd9a | 1891 | |
355a7673 | 1892 | lower_eh_constructs_1 (&this_state, gimple_try_eval_ptr (tp)); |
6de9cd9a | 1893 | |
1d65f45c | 1894 | return gimple_try_eval (tp); |
6de9cd9a DN |
1895 | } |
1896 | ||
1897 | /* Implement a cleanup expression. This is similar to try-finally, | |
1898 | except that we only execute the cleanup block for exception edges. */ | |
1899 | ||
726a989a RB |
1900 | static gimple_seq |
1901 | lower_cleanup (struct leh_state *state, gimple tp) | |
6de9cd9a | 1902 | { |
b7da9fd4 RH |
1903 | struct leh_state this_state = *state; |
1904 | eh_region this_region = NULL; | |
6de9cd9a | 1905 | struct leh_tf_state fake_tf; |
726a989a | 1906 | gimple_seq result; |
d3f28910 | 1907 | bool cleanup_dead = cleanup_is_dead_in (state->cur_region); |
6de9cd9a | 1908 | |
d3f28910 | 1909 | if (flag_exceptions && !cleanup_dead) |
6de9cd9a | 1910 | { |
b7da9fd4 RH |
1911 | this_region = gen_eh_region_cleanup (state->cur_region); |
1912 | this_state.cur_region = this_region; | |
6de9cd9a DN |
1913 | } |
1914 | ||
355a7673 | 1915 | lower_eh_constructs_1 (&this_state, gimple_try_eval_ptr (tp)); |
6de9cd9a | 1916 | |
d3f28910 | 1917 | if (cleanup_dead || !eh_region_may_contain_throw (this_region)) |
1d65f45c | 1918 | return gimple_try_eval (tp); |
6de9cd9a DN |
1919 | |
1920 | /* Build enough of a try-finally state so that we can reuse | |
1921 | honor_protect_cleanup_actions. */ | |
1922 | memset (&fake_tf, 0, sizeof (fake_tf)); | |
c2255bc4 | 1923 | fake_tf.top_p = fake_tf.try_finally_expr = tp; |
6de9cd9a DN |
1924 | fake_tf.outer = state; |
1925 | fake_tf.region = this_region; | |
726a989a | 1926 | fake_tf.may_fallthru = gimple_seq_may_fallthru (gimple_try_eval (tp)); |
6de9cd9a DN |
1927 | fake_tf.may_throw = true; |
1928 | ||
6de9cd9a DN |
1929 | honor_protect_cleanup_actions (state, NULL, &fake_tf); |
1930 | ||
1931 | if (fake_tf.may_throw) | |
1932 | { | |
1933 | /* In this case honor_protect_cleanup_actions had nothing to do, | |
1934 | and we should process this normally. */ | |
355a7673 | 1935 | lower_eh_constructs_1 (state, gimple_try_cleanup_ptr (tp)); |
1d65f45c RH |
1936 | result = frob_into_branch_around (tp, this_region, |
1937 | fake_tf.fallthru_label); | |
6de9cd9a DN |
1938 | } |
1939 | else | |
1940 | { | |
1941 | /* In this case honor_protect_cleanup_actions did nearly all of | |
1942 | the work. All we have left is to append the fallthru_label. */ | |
1943 | ||
726a989a | 1944 | result = gimple_try_eval (tp); |
6de9cd9a DN |
1945 | if (fake_tf.fallthru_label) |
1946 | { | |
726a989a RB |
1947 | gimple x = gimple_build_label (fake_tf.fallthru_label); |
1948 | gimple_seq_add_stmt (&result, x); | |
6de9cd9a DN |
1949 | } |
1950 | } | |
726a989a | 1951 | return result; |
6de9cd9a DN |
1952 | } |
1953 | ||
1d65f45c | 1954 | /* Main loop for lowering eh constructs. Also moves gsi to the next |
726a989a | 1955 | statement. */ |
6de9cd9a DN |
1956 | |
1957 | static void | |
726a989a | 1958 | lower_eh_constructs_2 (struct leh_state *state, gimple_stmt_iterator *gsi) |
6de9cd9a | 1959 | { |
726a989a RB |
1960 | gimple_seq replace; |
1961 | gimple x; | |
1962 | gimple stmt = gsi_stmt (*gsi); | |
6de9cd9a | 1963 | |
726a989a | 1964 | switch (gimple_code (stmt)) |
6de9cd9a | 1965 | { |
726a989a | 1966 | case GIMPLE_CALL: |
1d65f45c RH |
1967 | { |
1968 | tree fndecl = gimple_call_fndecl (stmt); | |
1969 | tree rhs, lhs; | |
1970 | ||
1971 | if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
1972 | switch (DECL_FUNCTION_CODE (fndecl)) | |
1973 | { | |
1974 | case BUILT_IN_EH_POINTER: | |
1975 | /* The front end may have generated a call to | |
1976 | __builtin_eh_pointer (0) within a catch region. Replace | |
1977 | this zero argument with the current catch region number. */ | |
1978 | if (state->ehp_region) | |
1979 | { | |
413581ba RG |
1980 | tree nr = build_int_cst (integer_type_node, |
1981 | state->ehp_region->index); | |
1d65f45c RH |
1982 | gimple_call_set_arg (stmt, 0, nr); |
1983 | } | |
1984 | else | |
1985 | { | |
1986 | /* The user has dome something silly. Remove it. */ | |
9a9d280e | 1987 | rhs = null_pointer_node; |
1d65f45c RH |
1988 | goto do_replace; |
1989 | } | |
1990 | break; | |
1991 | ||
1992 | case BUILT_IN_EH_FILTER: | |
1993 | /* ??? This should never appear, but since it's a builtin it | |
1994 | is accessible to abuse by users. Just remove it and | |
1995 | replace the use with the arbitrary value zero. */ | |
1996 | rhs = build_int_cst (TREE_TYPE (TREE_TYPE (fndecl)), 0); | |
1997 | do_replace: | |
1998 | lhs = gimple_call_lhs (stmt); | |
1999 | x = gimple_build_assign (lhs, rhs); | |
2000 | gsi_insert_before (gsi, x, GSI_SAME_STMT); | |
2001 | /* FALLTHRU */ | |
2002 | ||
2003 | case BUILT_IN_EH_COPY_VALUES: | |
2004 | /* Likewise this should not appear. Remove it. */ | |
2005 | gsi_remove (gsi, true); | |
2006 | return; | |
2007 | ||
2008 | default: | |
2009 | break; | |
2010 | } | |
2011 | } | |
2012 | /* FALLTHRU */ | |
2013 | ||
726a989a | 2014 | case GIMPLE_ASSIGN: |
ba4d8f9d RG |
2015 | /* If the stmt can throw use a new temporary for the assignment |
2016 | to a LHS. This makes sure the old value of the LHS is | |
87cd4259 | 2017 | available on the EH edge. Only do so for statements that |
073a8998 | 2018 | potentially fall through (no noreturn calls e.g.), otherwise |
87cd4259 | 2019 | this new assignment might create fake fallthru regions. */ |
ba4d8f9d RG |
2020 | if (stmt_could_throw_p (stmt) |
2021 | && gimple_has_lhs (stmt) | |
87cd4259 | 2022 | && gimple_stmt_may_fallthru (stmt) |
ba4d8f9d RG |
2023 | && !tree_could_throw_p (gimple_get_lhs (stmt)) |
2024 | && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt)))) | |
2025 | { | |
2026 | tree lhs = gimple_get_lhs (stmt); | |
2027 | tree tmp = create_tmp_var (TREE_TYPE (lhs), NULL); | |
2028 | gimple s = gimple_build_assign (lhs, tmp); | |
2029 | gimple_set_location (s, gimple_location (stmt)); | |
2030 | gimple_set_block (s, gimple_block (stmt)); | |
2031 | gimple_set_lhs (stmt, tmp); | |
2032 | if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE | |
2033 | || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE) | |
2034 | DECL_GIMPLE_REG_P (tmp) = 1; | |
2035 | gsi_insert_after (gsi, s, GSI_SAME_STMT); | |
2036 | } | |
6de9cd9a | 2037 | /* Look for things that can throw exceptions, and record them. */ |
726a989a | 2038 | if (state->cur_region && stmt_could_throw_p (stmt)) |
6de9cd9a | 2039 | { |
726a989a | 2040 | record_stmt_eh_region (state->cur_region, stmt); |
6de9cd9a | 2041 | note_eh_region_may_contain_throw (state->cur_region); |
6de9cd9a DN |
2042 | } |
2043 | break; | |
2044 | ||
726a989a RB |
2045 | case GIMPLE_COND: |
2046 | case GIMPLE_GOTO: | |
2047 | case GIMPLE_RETURN: | |
2048 | maybe_record_in_goto_queue (state, stmt); | |
6de9cd9a DN |
2049 | break; |
2050 | ||
726a989a RB |
2051 | case GIMPLE_SWITCH: |
2052 | verify_norecord_switch_expr (state, stmt); | |
6de9cd9a DN |
2053 | break; |
2054 | ||
726a989a RB |
2055 | case GIMPLE_TRY: |
2056 | if (gimple_try_kind (stmt) == GIMPLE_TRY_FINALLY) | |
2057 | replace = lower_try_finally (state, stmt); | |
2058 | else | |
6de9cd9a | 2059 | { |
726a989a | 2060 | x = gimple_seq_first_stmt (gimple_try_cleanup (stmt)); |
6728ee79 | 2061 | if (!x) |
6de9cd9a | 2062 | { |
6728ee79 | 2063 | replace = gimple_try_eval (stmt); |
355a7673 | 2064 | lower_eh_constructs_1 (state, &replace); |
6de9cd9a | 2065 | } |
6728ee79 MM |
2066 | else |
2067 | switch (gimple_code (x)) | |
2068 | { | |
2069 | case GIMPLE_CATCH: | |
2070 | replace = lower_catch (state, stmt); | |
2071 | break; | |
2072 | case GIMPLE_EH_FILTER: | |
2073 | replace = lower_eh_filter (state, stmt); | |
2074 | break; | |
2075 | case GIMPLE_EH_MUST_NOT_THROW: | |
2076 | replace = lower_eh_must_not_throw (state, stmt); | |
2077 | break; | |
0a35513e AH |
2078 | case GIMPLE_EH_ELSE: |
2079 | /* This code is only valid with GIMPLE_TRY_FINALLY. */ | |
2080 | gcc_unreachable (); | |
6728ee79 MM |
2081 | default: |
2082 | replace = lower_cleanup (state, stmt); | |
2083 | break; | |
2084 | } | |
6de9cd9a | 2085 | } |
726a989a RB |
2086 | |
2087 | /* Remove the old stmt and insert the transformed sequence | |
2088 | instead. */ | |
2089 | gsi_insert_seq_before (gsi, replace, GSI_SAME_STMT); | |
2090 | gsi_remove (gsi, true); | |
2091 | ||
2092 | /* Return since we don't want gsi_next () */ | |
2093 | return; | |
6de9cd9a | 2094 | |
0a35513e AH |
2095 | case GIMPLE_EH_ELSE: |
2096 | /* We should be eliminating this in lower_try_finally et al. */ | |
2097 | gcc_unreachable (); | |
2098 | ||
6de9cd9a DN |
2099 | default: |
2100 | /* A type, a decl, or some kind of statement that we're not | |
2101 | interested in. Don't walk them. */ | |
2102 | break; | |
2103 | } | |
726a989a RB |
2104 | |
2105 | gsi_next (gsi); | |
2106 | } | |
2107 | ||
2108 | /* A helper to unwrap a gimple_seq and feed stmts to lower_eh_constructs_2. */ | |
2109 | ||
2110 | static void | |
355a7673 | 2111 | lower_eh_constructs_1 (struct leh_state *state, gimple_seq *pseq) |
726a989a RB |
2112 | { |
2113 | gimple_stmt_iterator gsi; | |
355a7673 | 2114 | for (gsi = gsi_start (*pseq); !gsi_end_p (gsi);) |
726a989a | 2115 | lower_eh_constructs_2 (state, &gsi); |
6de9cd9a DN |
2116 | } |
2117 | ||
c2924966 | 2118 | static unsigned int |
6de9cd9a DN |
2119 | lower_eh_constructs (void) |
2120 | { | |
2121 | struct leh_state null_state; | |
1d65f45c | 2122 | gimple_seq bodyp; |
726a989a | 2123 | |
1d65f45c RH |
2124 | bodyp = gimple_body (current_function_decl); |
2125 | if (bodyp == NULL) | |
2126 | return 0; | |
6de9cd9a | 2127 | |
4a8fb1a1 | 2128 | finally_tree.create (31); |
b7da9fd4 | 2129 | eh_region_may_contain_throw_map = BITMAP_ALLOC (NULL); |
1d65f45c | 2130 | memset (&null_state, 0, sizeof (null_state)); |
6de9cd9a | 2131 | |
726a989a | 2132 | collect_finally_tree_1 (bodyp, NULL); |
355a7673 MM |
2133 | lower_eh_constructs_1 (&null_state, &bodyp); |
2134 | gimple_set_body (current_function_decl, bodyp); | |
6de9cd9a | 2135 | |
1d65f45c RH |
2136 | /* We assume there's a return statement, or something, at the end of |
2137 | the function, and thus ploping the EH sequence afterward won't | |
2138 | change anything. */ | |
2139 | gcc_assert (!gimple_seq_may_fallthru (bodyp)); | |
2140 | gimple_seq_add_seq (&bodyp, eh_seq); | |
2141 | ||
2142 | /* We assume that since BODYP already existed, adding EH_SEQ to it | |
2143 | didn't change its value, and we don't have to re-set the function. */ | |
2144 | gcc_assert (bodyp == gimple_body (current_function_decl)); | |
6de9cd9a | 2145 | |
4a8fb1a1 | 2146 | finally_tree.dispose (); |
b7da9fd4 | 2147 | BITMAP_FREE (eh_region_may_contain_throw_map); |
1d65f45c | 2148 | eh_seq = NULL; |
f9417da1 RG |
2149 | |
2150 | /* If this function needs a language specific EH personality routine | |
2151 | and the frontend didn't already set one do so now. */ | |
2152 | if (function_needs_eh_personality (cfun) == eh_personality_lang | |
2153 | && !DECL_FUNCTION_PERSONALITY (current_function_decl)) | |
2154 | DECL_FUNCTION_PERSONALITY (current_function_decl) | |
2155 | = lang_hooks.eh_personality (); | |
2156 | ||
c2924966 | 2157 | return 0; |
6de9cd9a DN |
2158 | } |
2159 | ||
27a4cd48 DM |
2160 | namespace { |
2161 | ||
2162 | const pass_data pass_data_lower_eh = | |
6de9cd9a | 2163 | { |
27a4cd48 DM |
2164 | GIMPLE_PASS, /* type */ |
2165 | "eh", /* name */ | |
2166 | OPTGROUP_NONE, /* optinfo_flags */ | |
2167 | false, /* has_gate */ | |
2168 | true, /* has_execute */ | |
2169 | TV_TREE_EH, /* tv_id */ | |
2170 | PROP_gimple_lcf, /* properties_required */ | |
2171 | PROP_gimple_leh, /* properties_provided */ | |
2172 | 0, /* properties_destroyed */ | |
2173 | 0, /* todo_flags_start */ | |
2174 | 0, /* todo_flags_finish */ | |
6de9cd9a | 2175 | }; |
27a4cd48 DM |
2176 | |
2177 | class pass_lower_eh : public gimple_opt_pass | |
2178 | { | |
2179 | public: | |
2180 | pass_lower_eh(gcc::context *ctxt) | |
2181 | : gimple_opt_pass(pass_data_lower_eh, ctxt) | |
2182 | {} | |
2183 | ||
2184 | /* opt_pass methods: */ | |
2185 | unsigned int execute () { return lower_eh_constructs (); } | |
2186 | ||
2187 | }; // class pass_lower_eh | |
2188 | ||
2189 | } // anon namespace | |
2190 | ||
2191 | gimple_opt_pass * | |
2192 | make_pass_lower_eh (gcc::context *ctxt) | |
2193 | { | |
2194 | return new pass_lower_eh (ctxt); | |
2195 | } | |
6de9cd9a | 2196 | \f |
1d65f45c RH |
2197 | /* Create the multiple edges from an EH_DISPATCH statement to all of |
2198 | the possible handlers for its EH region. Return true if there's | |
2199 | no fallthru edge; false if there is. */ | |
6de9cd9a | 2200 | |
1d65f45c RH |
2201 | bool |
2202 | make_eh_dispatch_edges (gimple stmt) | |
6de9cd9a | 2203 | { |
1d65f45c RH |
2204 | eh_region r; |
2205 | eh_catch c; | |
6de9cd9a DN |
2206 | basic_block src, dst; |
2207 | ||
1d65f45c | 2208 | r = get_eh_region_from_number (gimple_eh_dispatch_region (stmt)); |
726a989a | 2209 | src = gimple_bb (stmt); |
6de9cd9a | 2210 | |
1d65f45c RH |
2211 | switch (r->type) |
2212 | { | |
2213 | case ERT_TRY: | |
2214 | for (c = r->u.eh_try.first_catch; c ; c = c->next_catch) | |
2215 | { | |
2216 | dst = label_to_block (c->label); | |
2217 | make_edge (src, dst, 0); | |
19114537 | 2218 | |
1d65f45c RH |
2219 | /* A catch-all handler doesn't have a fallthru. */ |
2220 | if (c->type_list == NULL) | |
2221 | return false; | |
2222 | } | |
2223 | break; | |
a8ee227c | 2224 | |
1d65f45c RH |
2225 | case ERT_ALLOWED_EXCEPTIONS: |
2226 | dst = label_to_block (r->u.allowed.label); | |
2227 | make_edge (src, dst, 0); | |
2228 | break; | |
2229 | ||
2230 | default: | |
2231 | gcc_unreachable (); | |
2232 | } | |
2233 | ||
2234 | return true; | |
a8ee227c JH |
2235 | } |
2236 | ||
1d65f45c RH |
2237 | /* Create the single EH edge from STMT to its nearest landing pad, |
2238 | if there is such a landing pad within the current function. */ | |
2239 | ||
6de9cd9a | 2240 | void |
726a989a | 2241 | make_eh_edges (gimple stmt) |
6de9cd9a | 2242 | { |
1d65f45c RH |
2243 | basic_block src, dst; |
2244 | eh_landing_pad lp; | |
2245 | int lp_nr; | |
6de9cd9a | 2246 | |
1d65f45c RH |
2247 | lp_nr = lookup_stmt_eh_lp (stmt); |
2248 | if (lp_nr <= 0) | |
2249 | return; | |
6de9cd9a | 2250 | |
1d65f45c RH |
2251 | lp = get_eh_landing_pad_from_number (lp_nr); |
2252 | gcc_assert (lp != NULL); | |
a203a221 | 2253 | |
1d65f45c RH |
2254 | src = gimple_bb (stmt); |
2255 | dst = label_to_block (lp->post_landing_pad); | |
2256 | make_edge (src, dst, EDGE_EH); | |
6de9cd9a DN |
2257 | } |
2258 | ||
1d65f45c RH |
2259 | /* Do the work in redirecting EDGE_IN to NEW_BB within the EH region tree; |
2260 | do not actually perform the final edge redirection. | |
a3710436 | 2261 | |
1d65f45c RH |
2262 | CHANGE_REGION is true when we're being called from cleanup_empty_eh and |
2263 | we intend to change the destination EH region as well; this means | |
2264 | EH_LANDING_PAD_NR must already be set on the destination block label. | |
2265 | If false, we're being called from generic cfg manipulation code and we | |
2266 | should preserve our place within the region tree. */ | |
2267 | ||
2268 | static void | |
2269 | redirect_eh_edge_1 (edge edge_in, basic_block new_bb, bool change_region) | |
a3710436 | 2270 | { |
1d65f45c RH |
2271 | eh_landing_pad old_lp, new_lp; |
2272 | basic_block old_bb; | |
2273 | gimple throw_stmt; | |
2274 | int old_lp_nr, new_lp_nr; | |
2275 | tree old_label, new_label; | |
2276 | edge_iterator ei; | |
2277 | edge e; | |
2278 | ||
2279 | old_bb = edge_in->dest; | |
2280 | old_label = gimple_block_label (old_bb); | |
2281 | old_lp_nr = EH_LANDING_PAD_NR (old_label); | |
2282 | gcc_assert (old_lp_nr > 0); | |
2283 | old_lp = get_eh_landing_pad_from_number (old_lp_nr); | |
2284 | ||
2285 | throw_stmt = last_stmt (edge_in->src); | |
2286 | gcc_assert (lookup_stmt_eh_lp (throw_stmt) == old_lp_nr); | |
2287 | ||
2288 | new_label = gimple_block_label (new_bb); | |
a3710436 | 2289 | |
1d65f45c RH |
2290 | /* Look for an existing region that might be using NEW_BB already. */ |
2291 | new_lp_nr = EH_LANDING_PAD_NR (new_label); | |
2292 | if (new_lp_nr) | |
a3710436 | 2293 | { |
1d65f45c RH |
2294 | new_lp = get_eh_landing_pad_from_number (new_lp_nr); |
2295 | gcc_assert (new_lp); | |
b8698a0f | 2296 | |
1d65f45c RH |
2297 | /* Unless CHANGE_REGION is true, the new and old landing pad |
2298 | had better be associated with the same EH region. */ | |
2299 | gcc_assert (change_region || new_lp->region == old_lp->region); | |
a3710436 JH |
2300 | } |
2301 | else | |
2302 | { | |
1d65f45c RH |
2303 | new_lp = NULL; |
2304 | gcc_assert (!change_region); | |
a3710436 JH |
2305 | } |
2306 | ||
1d65f45c RH |
2307 | /* Notice when we redirect the last EH edge away from OLD_BB. */ |
2308 | FOR_EACH_EDGE (e, ei, old_bb->preds) | |
2309 | if (e != edge_in && (e->flags & EDGE_EH)) | |
2310 | break; | |
cc7220fd | 2311 | |
1d65f45c | 2312 | if (new_lp) |
cc7220fd | 2313 | { |
1d65f45c RH |
2314 | /* NEW_LP already exists. If there are still edges into OLD_LP, |
2315 | there's nothing to do with the EH tree. If there are no more | |
2316 | edges into OLD_LP, then we want to remove OLD_LP as it is unused. | |
2317 | If CHANGE_REGION is true, then our caller is expecting to remove | |
2318 | the landing pad. */ | |
2319 | if (e == NULL && !change_region) | |
2320 | remove_eh_landing_pad (old_lp); | |
cc7220fd | 2321 | } |
1d65f45c | 2322 | else |
cc7220fd | 2323 | { |
1d65f45c RH |
2324 | /* No correct landing pad exists. If there are no more edges |
2325 | into OLD_LP, then we can simply re-use the existing landing pad. | |
2326 | Otherwise, we have to create a new landing pad. */ | |
2327 | if (e == NULL) | |
2328 | { | |
2329 | EH_LANDING_PAD_NR (old_lp->post_landing_pad) = 0; | |
2330 | new_lp = old_lp; | |
2331 | } | |
2332 | else | |
2333 | new_lp = gen_eh_landing_pad (old_lp->region); | |
2334 | new_lp->post_landing_pad = new_label; | |
2335 | EH_LANDING_PAD_NR (new_label) = new_lp->index; | |
cc7220fd | 2336 | } |
1d65f45c RH |
2337 | |
2338 | /* Maybe move the throwing statement to the new region. */ | |
2339 | if (old_lp != new_lp) | |
cc7220fd | 2340 | { |
1d65f45c RH |
2341 | remove_stmt_from_eh_lp (throw_stmt); |
2342 | add_stmt_to_eh_lp (throw_stmt, new_lp->index); | |
cc7220fd | 2343 | } |
cc7220fd JH |
2344 | } |
2345 | ||
1d65f45c | 2346 | /* Redirect EH edge E to NEW_BB. */ |
726a989a | 2347 | |
1d65f45c RH |
2348 | edge |
2349 | redirect_eh_edge (edge edge_in, basic_block new_bb) | |
cc7220fd | 2350 | { |
1d65f45c RH |
2351 | redirect_eh_edge_1 (edge_in, new_bb, false); |
2352 | return ssa_redirect_edge (edge_in, new_bb); | |
2353 | } | |
cc7220fd | 2354 | |
1d65f45c RH |
2355 | /* This is a subroutine of gimple_redirect_edge_and_branch. Update the |
2356 | labels for redirecting a non-fallthru EH_DISPATCH edge E to NEW_BB. | |
2357 | The actual edge update will happen in the caller. */ | |
cc7220fd | 2358 | |
1d65f45c RH |
2359 | void |
2360 | redirect_eh_dispatch_edge (gimple stmt, edge e, basic_block new_bb) | |
2361 | { | |
2362 | tree new_lab = gimple_block_label (new_bb); | |
2363 | bool any_changed = false; | |
2364 | basic_block old_bb; | |
2365 | eh_region r; | |
2366 | eh_catch c; | |
2367 | ||
2368 | r = get_eh_region_from_number (gimple_eh_dispatch_region (stmt)); | |
2369 | switch (r->type) | |
cc7220fd | 2370 | { |
1d65f45c RH |
2371 | case ERT_TRY: |
2372 | for (c = r->u.eh_try.first_catch; c ; c = c->next_catch) | |
cc7220fd | 2373 | { |
1d65f45c RH |
2374 | old_bb = label_to_block (c->label); |
2375 | if (old_bb == e->dest) | |
2376 | { | |
2377 | c->label = new_lab; | |
2378 | any_changed = true; | |
2379 | } | |
cc7220fd | 2380 | } |
1d65f45c RH |
2381 | break; |
2382 | ||
2383 | case ERT_ALLOWED_EXCEPTIONS: | |
2384 | old_bb = label_to_block (r->u.allowed.label); | |
2385 | gcc_assert (old_bb == e->dest); | |
2386 | r->u.allowed.label = new_lab; | |
2387 | any_changed = true; | |
2388 | break; | |
2389 | ||
2390 | default: | |
2391 | gcc_unreachable (); | |
cc7220fd | 2392 | } |
726a989a | 2393 | |
1d65f45c | 2394 | gcc_assert (any_changed); |
cc7220fd | 2395 | } |
6de9cd9a | 2396 | \f |
726a989a RB |
2397 | /* Helper function for operation_could_trap_p and stmt_could_throw_p. */ |
2398 | ||
890065bf | 2399 | bool |
726a989a RB |
2400 | operation_could_trap_helper_p (enum tree_code op, |
2401 | bool fp_operation, | |
2402 | bool honor_trapv, | |
2403 | bool honor_nans, | |
2404 | bool honor_snans, | |
2405 | tree divisor, | |
2406 | bool *handled) | |
2407 | { | |
2408 | *handled = true; | |
2409 | switch (op) | |
2410 | { | |
2411 | case TRUNC_DIV_EXPR: | |
2412 | case CEIL_DIV_EXPR: | |
2413 | case FLOOR_DIV_EXPR: | |
2414 | case ROUND_DIV_EXPR: | |
2415 | case EXACT_DIV_EXPR: | |
2416 | case CEIL_MOD_EXPR: | |
2417 | case FLOOR_MOD_EXPR: | |
2418 | case ROUND_MOD_EXPR: | |
2419 | case TRUNC_MOD_EXPR: | |
2420 | case RDIV_EXPR: | |
2421 | if (honor_snans || honor_trapv) | |
2422 | return true; | |
2423 | if (fp_operation) | |
2424 | return flag_trapping_math; | |
2425 | if (!TREE_CONSTANT (divisor) || integer_zerop (divisor)) | |
2426 | return true; | |
2427 | return false; | |
2428 | ||
2429 | case LT_EXPR: | |
2430 | case LE_EXPR: | |
2431 | case GT_EXPR: | |
2432 | case GE_EXPR: | |
2433 | case LTGT_EXPR: | |
2434 | /* Some floating point comparisons may trap. */ | |
2435 | return honor_nans; | |
2436 | ||
2437 | case EQ_EXPR: | |
2438 | case NE_EXPR: | |
2439 | case UNORDERED_EXPR: | |
2440 | case ORDERED_EXPR: | |
2441 | case UNLT_EXPR: | |
2442 | case UNLE_EXPR: | |
2443 | case UNGT_EXPR: | |
2444 | case UNGE_EXPR: | |
2445 | case UNEQ_EXPR: | |
2446 | return honor_snans; | |
2447 | ||
2448 | case CONVERT_EXPR: | |
2449 | case FIX_TRUNC_EXPR: | |
2450 | /* Conversion of floating point might trap. */ | |
2451 | return honor_nans; | |
2452 | ||
2453 | case NEGATE_EXPR: | |
2454 | case ABS_EXPR: | |
2455 | case CONJ_EXPR: | |
2456 | /* These operations don't trap with floating point. */ | |
2457 | if (honor_trapv) | |
2458 | return true; | |
2459 | return false; | |
2460 | ||
2461 | case PLUS_EXPR: | |
2462 | case MINUS_EXPR: | |
2463 | case MULT_EXPR: | |
2464 | /* Any floating arithmetic may trap. */ | |
2465 | if (fp_operation && flag_trapping_math) | |
2466 | return true; | |
2467 | if (honor_trapv) | |
2468 | return true; | |
2469 | return false; | |
2470 | ||
f5e5b46c RG |
2471 | case COMPLEX_EXPR: |
2472 | case CONSTRUCTOR: | |
2473 | /* Constructing an object cannot trap. */ | |
2474 | return false; | |
2475 | ||
726a989a RB |
2476 | default: |
2477 | /* Any floating arithmetic may trap. */ | |
2478 | if (fp_operation && flag_trapping_math) | |
2479 | return true; | |
2480 | ||
2481 | *handled = false; | |
2482 | return false; | |
2483 | } | |
2484 | } | |
2485 | ||
2486 | /* Return true if operation OP may trap. FP_OPERATION is true if OP is applied | |
2487 | on floating-point values. HONOR_TRAPV is true if OP is applied on integer | |
2488 | type operands that may trap. If OP is a division operator, DIVISOR contains | |
2489 | the value of the divisor. */ | |
2490 | ||
2491 | bool | |
2492 | operation_could_trap_p (enum tree_code op, bool fp_operation, bool honor_trapv, | |
2493 | tree divisor) | |
2494 | { | |
2495 | bool honor_nans = (fp_operation && flag_trapping_math | |
2496 | && !flag_finite_math_only); | |
2497 | bool honor_snans = fp_operation && flag_signaling_nans != 0; | |
2498 | bool handled; | |
2499 | ||
2500 | if (TREE_CODE_CLASS (op) != tcc_comparison | |
2501 | && TREE_CODE_CLASS (op) != tcc_unary | |
2502 | && TREE_CODE_CLASS (op) != tcc_binary) | |
2503 | return false; | |
2504 | ||
2505 | return operation_could_trap_helper_p (op, fp_operation, honor_trapv, | |
2506 | honor_nans, honor_snans, divisor, | |
2507 | &handled); | |
2508 | } | |
2509 | ||
2510 | /* Return true if EXPR can trap, as in dereferencing an invalid pointer | |
1eaba2f2 RH |
2511 | location or floating point arithmetic. C.f. the rtl version, may_trap_p. |
2512 | This routine expects only GIMPLE lhs or rhs input. */ | |
6de9cd9a DN |
2513 | |
2514 | bool | |
2515 | tree_could_trap_p (tree expr) | |
2516 | { | |
726a989a | 2517 | enum tree_code code; |
1eaba2f2 | 2518 | bool fp_operation = false; |
9675412f | 2519 | bool honor_trapv = false; |
726a989a | 2520 | tree t, base, div = NULL_TREE; |
6de9cd9a | 2521 | |
726a989a RB |
2522 | if (!expr) |
2523 | return false; | |
1d65f45c | 2524 | |
726a989a RB |
2525 | code = TREE_CODE (expr); |
2526 | t = TREE_TYPE (expr); | |
2527 | ||
2528 | if (t) | |
1eaba2f2 | 2529 | { |
04b03edb RAE |
2530 | if (COMPARISON_CLASS_P (expr)) |
2531 | fp_operation = FLOAT_TYPE_P (TREE_TYPE (TREE_OPERAND (expr, 0))); | |
2532 | else | |
2533 | fp_operation = FLOAT_TYPE_P (t); | |
726a989a | 2534 | honor_trapv = INTEGRAL_TYPE_P (t) && TYPE_OVERFLOW_TRAPS (t); |
1eaba2f2 RH |
2535 | } |
2536 | ||
726a989a RB |
2537 | if (TREE_CODE_CLASS (code) == tcc_binary) |
2538 | div = TREE_OPERAND (expr, 1); | |
2539 | if (operation_could_trap_p (code, fp_operation, honor_trapv, div)) | |
2540 | return true; | |
2541 | ||
d25cee4d | 2542 | restart: |
6de9cd9a DN |
2543 | switch (code) |
2544 | { | |
ac182688 | 2545 | case TARGET_MEM_REF: |
4d948885 RG |
2546 | if (TREE_CODE (TMR_BASE (expr)) == ADDR_EXPR |
2547 | && !TMR_INDEX (expr) && !TMR_INDEX2 (expr)) | |
4b228e61 RG |
2548 | return false; |
2549 | return !TREE_THIS_NOTRAP (expr); | |
ac182688 | 2550 | |
6de9cd9a DN |
2551 | case COMPONENT_REF: |
2552 | case REALPART_EXPR: | |
2553 | case IMAGPART_EXPR: | |
2554 | case BIT_FIELD_REF: | |
483edb92 | 2555 | case VIEW_CONVERT_EXPR: |
d25cee4d RH |
2556 | case WITH_SIZE_EXPR: |
2557 | expr = TREE_OPERAND (expr, 0); | |
2558 | code = TREE_CODE (expr); | |
2559 | goto restart; | |
a7e5372d ZD |
2560 | |
2561 | case ARRAY_RANGE_REF: | |
11fc4275 EB |
2562 | base = TREE_OPERAND (expr, 0); |
2563 | if (tree_could_trap_p (base)) | |
a7e5372d | 2564 | return true; |
11fc4275 EB |
2565 | if (TREE_THIS_NOTRAP (expr)) |
2566 | return false; | |
11fc4275 | 2567 | return !range_in_array_bounds_p (expr); |
a7e5372d ZD |
2568 | |
2569 | case ARRAY_REF: | |
2570 | base = TREE_OPERAND (expr, 0); | |
a7e5372d ZD |
2571 | if (tree_could_trap_p (base)) |
2572 | return true; | |
a7e5372d ZD |
2573 | if (TREE_THIS_NOTRAP (expr)) |
2574 | return false; | |
a7e5372d | 2575 | return !in_array_bounds_p (expr); |
6de9cd9a | 2576 | |
70f34814 RG |
2577 | case MEM_REF: |
2578 | if (TREE_CODE (TREE_OPERAND (expr, 0)) == ADDR_EXPR) | |
2579 | return false; | |
2580 | /* Fallthru. */ | |
6de9cd9a | 2581 | case INDIRECT_REF: |
1eaba2f2 RH |
2582 | return !TREE_THIS_NOTRAP (expr); |
2583 | ||
2584 | case ASM_EXPR: | |
2585 | return TREE_THIS_VOLATILE (expr); | |
5cb2183e | 2586 | |
726a989a RB |
2587 | case CALL_EXPR: |
2588 | t = get_callee_fndecl (expr); | |
2589 | /* Assume that calls to weak functions may trap. */ | |
f2c3a8ce | 2590 | if (!t || !DECL_P (t)) |
1eaba2f2 | 2591 | return true; |
f2c3a8ce JJ |
2592 | if (DECL_WEAK (t)) |
2593 | return tree_could_trap_p (t); | |
2594 | return false; | |
2595 | ||
2596 | case FUNCTION_DECL: | |
2597 | /* Assume that accesses to weak functions may trap, unless we know | |
2598 | they are certainly defined in current TU or in some other | |
2599 | LTO partition. */ | |
e70670cf | 2600 | if (DECL_WEAK (expr) && !DECL_COMDAT (expr)) |
f2c3a8ce JJ |
2601 | { |
2602 | struct cgraph_node *node; | |
2603 | if (!DECL_EXTERNAL (expr)) | |
2604 | return false; | |
2605 | node = cgraph_function_node (cgraph_get_node (expr), NULL); | |
960bfb69 | 2606 | if (node && node->symbol.in_other_partition) |
f2c3a8ce JJ |
2607 | return false; |
2608 | return true; | |
2609 | } | |
2610 | return false; | |
2611 | ||
2612 | case VAR_DECL: | |
2613 | /* Assume that accesses to weak vars may trap, unless we know | |
2614 | they are certainly defined in current TU or in some other | |
2615 | LTO partition. */ | |
e70670cf | 2616 | if (DECL_WEAK (expr) && !DECL_COMDAT (expr)) |
f2c3a8ce JJ |
2617 | { |
2618 | struct varpool_node *node; | |
2619 | if (!DECL_EXTERNAL (expr)) | |
2620 | return false; | |
2621 | node = varpool_variable_node (varpool_get_node (expr), NULL); | |
960bfb69 | 2622 | if (node && node->symbol.in_other_partition) |
f2c3a8ce JJ |
2623 | return false; |
2624 | return true; | |
2625 | } | |
1eaba2f2 RH |
2626 | return false; |
2627 | ||
726a989a RB |
2628 | default: |
2629 | return false; | |
2630 | } | |
2631 | } | |
1eaba2f2 | 2632 | |
1eaba2f2 | 2633 | |
726a989a RB |
2634 | /* Helper for stmt_could_throw_p. Return true if STMT (assumed to be a |
2635 | an assignment or a conditional) may throw. */ | |
1eaba2f2 | 2636 | |
726a989a RB |
2637 | static bool |
2638 | stmt_could_throw_1_p (gimple stmt) | |
2639 | { | |
2640 | enum tree_code code = gimple_expr_code (stmt); | |
2641 | bool honor_nans = false; | |
2642 | bool honor_snans = false; | |
2643 | bool fp_operation = false; | |
2644 | bool honor_trapv = false; | |
2645 | tree t; | |
2646 | size_t i; | |
2647 | bool handled, ret; | |
9675412f | 2648 | |
726a989a RB |
2649 | if (TREE_CODE_CLASS (code) == tcc_comparison |
2650 | || TREE_CODE_CLASS (code) == tcc_unary | |
2651 | || TREE_CODE_CLASS (code) == tcc_binary) | |
2652 | { | |
dd46054a RG |
2653 | if (is_gimple_assign (stmt) |
2654 | && TREE_CODE_CLASS (code) == tcc_comparison) | |
2655 | t = TREE_TYPE (gimple_assign_rhs1 (stmt)); | |
2656 | else if (gimple_code (stmt) == GIMPLE_COND) | |
2657 | t = TREE_TYPE (gimple_cond_lhs (stmt)); | |
2658 | else | |
2659 | t = gimple_expr_type (stmt); | |
726a989a RB |
2660 | fp_operation = FLOAT_TYPE_P (t); |
2661 | if (fp_operation) | |
2662 | { | |
2663 | honor_nans = flag_trapping_math && !flag_finite_math_only; | |
2664 | honor_snans = flag_signaling_nans != 0; | |
2665 | } | |
2666 | else if (INTEGRAL_TYPE_P (t) && TYPE_OVERFLOW_TRAPS (t)) | |
2667 | honor_trapv = true; | |
2668 | } | |
2669 | ||
2670 | /* Check if the main expression may trap. */ | |
2671 | t = is_gimple_assign (stmt) ? gimple_assign_rhs2 (stmt) : NULL; | |
2672 | ret = operation_could_trap_helper_p (code, fp_operation, honor_trapv, | |
2673 | honor_nans, honor_snans, t, | |
2674 | &handled); | |
2675 | if (handled) | |
2676 | return ret; | |
2677 | ||
2678 | /* If the expression does not trap, see if any of the individual operands may | |
2679 | trap. */ | |
2680 | for (i = 0; i < gimple_num_ops (stmt); i++) | |
2681 | if (tree_could_trap_p (gimple_op (stmt, i))) | |
2682 | return true; | |
2683 | ||
2684 | return false; | |
2685 | } | |
2686 | ||
2687 | ||
2688 | /* Return true if statement STMT could throw an exception. */ | |
2689 | ||
2690 | bool | |
2691 | stmt_could_throw_p (gimple stmt) | |
2692 | { | |
726a989a RB |
2693 | if (!flag_exceptions) |
2694 | return false; | |
2695 | ||
2696 | /* The only statements that can throw an exception are assignments, | |
1d65f45c RH |
2697 | conditionals, calls, resx, and asms. */ |
2698 | switch (gimple_code (stmt)) | |
2699 | { | |
2700 | case GIMPLE_RESX: | |
2701 | return true; | |
726a989a | 2702 | |
1d65f45c RH |
2703 | case GIMPLE_CALL: |
2704 | return !gimple_call_nothrow_p (stmt); | |
726a989a | 2705 | |
1d65f45c RH |
2706 | case GIMPLE_ASSIGN: |
2707 | case GIMPLE_COND: | |
8f4f502f | 2708 | if (!cfun->can_throw_non_call_exceptions) |
1d65f45c RH |
2709 | return false; |
2710 | return stmt_could_throw_1_p (stmt); | |
726a989a | 2711 | |
1d65f45c | 2712 | case GIMPLE_ASM: |
8f4f502f | 2713 | if (!cfun->can_throw_non_call_exceptions) |
1d65f45c RH |
2714 | return false; |
2715 | return gimple_asm_volatile_p (stmt); | |
2716 | ||
2717 | default: | |
2718 | return false; | |
2719 | } | |
6de9cd9a DN |
2720 | } |
2721 | ||
726a989a RB |
2722 | |
2723 | /* Return true if expression T could throw an exception. */ | |
2724 | ||
6de9cd9a DN |
2725 | bool |
2726 | tree_could_throw_p (tree t) | |
2727 | { | |
2728 | if (!flag_exceptions) | |
2729 | return false; | |
726a989a | 2730 | if (TREE_CODE (t) == MODIFY_EXPR) |
6de9cd9a | 2731 | { |
8f4f502f | 2732 | if (cfun->can_throw_non_call_exceptions |
1d65f45c RH |
2733 | && tree_could_trap_p (TREE_OPERAND (t, 0))) |
2734 | return true; | |
726a989a | 2735 | t = TREE_OPERAND (t, 1); |
6de9cd9a DN |
2736 | } |
2737 | ||
d25cee4d RH |
2738 | if (TREE_CODE (t) == WITH_SIZE_EXPR) |
2739 | t = TREE_OPERAND (t, 0); | |
6de9cd9a DN |
2740 | if (TREE_CODE (t) == CALL_EXPR) |
2741 | return (call_expr_flags (t) & ECF_NOTHROW) == 0; | |
8f4f502f | 2742 | if (cfun->can_throw_non_call_exceptions) |
67c605a5 | 2743 | return tree_could_trap_p (t); |
6de9cd9a DN |
2744 | return false; |
2745 | } | |
2746 | ||
33977f81 JH |
2747 | /* Return true if STMT can throw an exception that is not caught within |
2748 | the current function (CFUN). */ | |
2749 | ||
2750 | bool | |
2751 | stmt_can_throw_external (gimple stmt) | |
2752 | { | |
1d65f45c | 2753 | int lp_nr; |
33977f81 JH |
2754 | |
2755 | if (!stmt_could_throw_p (stmt)) | |
2756 | return false; | |
2757 | ||
1d65f45c RH |
2758 | lp_nr = lookup_stmt_eh_lp (stmt); |
2759 | return lp_nr == 0; | |
33977f81 | 2760 | } |
726a989a RB |
2761 | |
2762 | /* Return true if STMT can throw an exception that is caught within | |
2763 | the current function (CFUN). */ | |
2764 | ||
6de9cd9a | 2765 | bool |
726a989a | 2766 | stmt_can_throw_internal (gimple stmt) |
6de9cd9a | 2767 | { |
1d65f45c | 2768 | int lp_nr; |
726a989a | 2769 | |
1d65f45c | 2770 | if (!stmt_could_throw_p (stmt)) |
6de9cd9a | 2771 | return false; |
726a989a | 2772 | |
1d65f45c RH |
2773 | lp_nr = lookup_stmt_eh_lp (stmt); |
2774 | return lp_nr > 0; | |
2775 | } | |
2776 | ||
2777 | /* Given a statement STMT in IFUN, if STMT can no longer throw, then | |
2778 | remove any entry it might have from the EH table. Return true if | |
2779 | any change was made. */ | |
2780 | ||
2781 | bool | |
2782 | maybe_clean_eh_stmt_fn (struct function *ifun, gimple stmt) | |
2783 | { | |
2784 | if (stmt_could_throw_p (stmt)) | |
2785 | return false; | |
2786 | return remove_stmt_from_eh_lp_fn (ifun, stmt); | |
6de9cd9a DN |
2787 | } |
2788 | ||
1d65f45c RH |
2789 | /* Likewise, but always use the current function. */ |
2790 | ||
2791 | bool | |
2792 | maybe_clean_eh_stmt (gimple stmt) | |
2793 | { | |
2794 | return maybe_clean_eh_stmt_fn (cfun, stmt); | |
2795 | } | |
6de9cd9a | 2796 | |
af47810a RH |
2797 | /* Given a statement OLD_STMT and a new statement NEW_STMT that has replaced |
2798 | OLD_STMT in the function, remove OLD_STMT from the EH table and put NEW_STMT | |
2799 | in the table if it should be in there. Return TRUE if a replacement was | |
2800 | done that my require an EH edge purge. */ | |
2801 | ||
1d65f45c RH |
2802 | bool |
2803 | maybe_clean_or_replace_eh_stmt (gimple old_stmt, gimple new_stmt) | |
1eaba2f2 | 2804 | { |
1d65f45c | 2805 | int lp_nr = lookup_stmt_eh_lp (old_stmt); |
af47810a | 2806 | |
1d65f45c | 2807 | if (lp_nr != 0) |
af47810a | 2808 | { |
726a989a | 2809 | bool new_stmt_could_throw = stmt_could_throw_p (new_stmt); |
af47810a RH |
2810 | |
2811 | if (new_stmt == old_stmt && new_stmt_could_throw) | |
2812 | return false; | |
2813 | ||
1d65f45c | 2814 | remove_stmt_from_eh_lp (old_stmt); |
af47810a RH |
2815 | if (new_stmt_could_throw) |
2816 | { | |
1d65f45c | 2817 | add_stmt_to_eh_lp (new_stmt, lp_nr); |
af47810a RH |
2818 | return false; |
2819 | } | |
2820 | else | |
2821 | return true; | |
2822 | } | |
2823 | ||
1eaba2f2 RH |
2824 | return false; |
2825 | } | |
1d65f45c | 2826 | |
073a8998 | 2827 | /* Given a statement OLD_STMT in OLD_FUN and a duplicate statement NEW_STMT |
1d65f45c RH |
2828 | in NEW_FUN, copy the EH table data from OLD_STMT to NEW_STMT. The MAP |
2829 | operand is the return value of duplicate_eh_regions. */ | |
2830 | ||
2831 | bool | |
2832 | maybe_duplicate_eh_stmt_fn (struct function *new_fun, gimple new_stmt, | |
2833 | struct function *old_fun, gimple old_stmt, | |
2834 | struct pointer_map_t *map, int default_lp_nr) | |
2835 | { | |
2836 | int old_lp_nr, new_lp_nr; | |
2837 | void **slot; | |
2838 | ||
2839 | if (!stmt_could_throw_p (new_stmt)) | |
2840 | return false; | |
2841 | ||
2842 | old_lp_nr = lookup_stmt_eh_lp_fn (old_fun, old_stmt); | |
2843 | if (old_lp_nr == 0) | |
2844 | { | |
2845 | if (default_lp_nr == 0) | |
2846 | return false; | |
2847 | new_lp_nr = default_lp_nr; | |
2848 | } | |
2849 | else if (old_lp_nr > 0) | |
2850 | { | |
2851 | eh_landing_pad old_lp, new_lp; | |
2852 | ||
9771b263 | 2853 | old_lp = (*old_fun->eh->lp_array)[old_lp_nr]; |
1d65f45c RH |
2854 | slot = pointer_map_contains (map, old_lp); |
2855 | new_lp = (eh_landing_pad) *slot; | |
2856 | new_lp_nr = new_lp->index; | |
2857 | } | |
2858 | else | |
2859 | { | |
2860 | eh_region old_r, new_r; | |
2861 | ||
9771b263 | 2862 | old_r = (*old_fun->eh->region_array)[-old_lp_nr]; |
1d65f45c RH |
2863 | slot = pointer_map_contains (map, old_r); |
2864 | new_r = (eh_region) *slot; | |
2865 | new_lp_nr = -new_r->index; | |
2866 | } | |
2867 | ||
2868 | add_stmt_to_eh_lp_fn (new_fun, new_stmt, new_lp_nr); | |
2869 | return true; | |
2870 | } | |
2871 | ||
2872 | /* Similar, but both OLD_STMT and NEW_STMT are within the current function, | |
2873 | and thus no remapping is required. */ | |
2874 | ||
2875 | bool | |
2876 | maybe_duplicate_eh_stmt (gimple new_stmt, gimple old_stmt) | |
2877 | { | |
2878 | int lp_nr; | |
2879 | ||
2880 | if (!stmt_could_throw_p (new_stmt)) | |
2881 | return false; | |
2882 | ||
2883 | lp_nr = lookup_stmt_eh_lp (old_stmt); | |
2884 | if (lp_nr == 0) | |
2885 | return false; | |
2886 | ||
2887 | add_stmt_to_eh_lp (new_stmt, lp_nr); | |
2888 | return true; | |
2889 | } | |
a24549d4 | 2890 | \f |
726a989a RB |
2891 | /* Returns TRUE if oneh and twoh are exception handlers (gimple_try_cleanup of |
2892 | GIMPLE_TRY) that are similar enough to be considered the same. Currently | |
2893 | this only handles handlers consisting of a single call, as that's the | |
2894 | important case for C++: a destructor call for a particular object showing | |
2895 | up in multiple handlers. */ | |
a24549d4 JM |
2896 | |
2897 | static bool | |
726a989a | 2898 | same_handler_p (gimple_seq oneh, gimple_seq twoh) |
a24549d4 | 2899 | { |
726a989a RB |
2900 | gimple_stmt_iterator gsi; |
2901 | gimple ones, twos; | |
2902 | unsigned int ai; | |
a24549d4 | 2903 | |
726a989a RB |
2904 | gsi = gsi_start (oneh); |
2905 | if (!gsi_one_before_end_p (gsi)) | |
a24549d4 | 2906 | return false; |
726a989a | 2907 | ones = gsi_stmt (gsi); |
a24549d4 | 2908 | |
726a989a RB |
2909 | gsi = gsi_start (twoh); |
2910 | if (!gsi_one_before_end_p (gsi)) | |
a24549d4 | 2911 | return false; |
726a989a RB |
2912 | twos = gsi_stmt (gsi); |
2913 | ||
2914 | if (!is_gimple_call (ones) | |
2915 | || !is_gimple_call (twos) | |
2916 | || gimple_call_lhs (ones) | |
2917 | || gimple_call_lhs (twos) | |
2918 | || gimple_call_chain (ones) | |
2919 | || gimple_call_chain (twos) | |
25583c4f | 2920 | || !gimple_call_same_target_p (ones, twos) |
726a989a | 2921 | || gimple_call_num_args (ones) != gimple_call_num_args (twos)) |
a24549d4 JM |
2922 | return false; |
2923 | ||
726a989a RB |
2924 | for (ai = 0; ai < gimple_call_num_args (ones); ++ai) |
2925 | if (!operand_equal_p (gimple_call_arg (ones, ai), | |
1d65f45c | 2926 | gimple_call_arg (twos, ai), 0)) |
a24549d4 JM |
2927 | return false; |
2928 | ||
2929 | return true; | |
2930 | } | |
2931 | ||
2932 | /* Optimize | |
2933 | try { A() } finally { try { ~B() } catch { ~A() } } | |
2934 | try { ... } finally { ~A() } | |
2935 | into | |
2936 | try { A() } catch { ~B() } | |
2937 | try { ~B() ... } finally { ~A() } | |
2938 | ||
2939 | This occurs frequently in C++, where A is a local variable and B is a | |
2940 | temporary used in the initializer for A. */ | |
2941 | ||
2942 | static void | |
726a989a | 2943 | optimize_double_finally (gimple one, gimple two) |
a24549d4 | 2944 | { |
726a989a RB |
2945 | gimple oneh; |
2946 | gimple_stmt_iterator gsi; | |
355a7673 | 2947 | gimple_seq cleanup; |
a24549d4 | 2948 | |
355a7673 MM |
2949 | cleanup = gimple_try_cleanup (one); |
2950 | gsi = gsi_start (cleanup); | |
726a989a | 2951 | if (!gsi_one_before_end_p (gsi)) |
a24549d4 JM |
2952 | return; |
2953 | ||
726a989a RB |
2954 | oneh = gsi_stmt (gsi); |
2955 | if (gimple_code (oneh) != GIMPLE_TRY | |
2956 | || gimple_try_kind (oneh) != GIMPLE_TRY_CATCH) | |
a24549d4 JM |
2957 | return; |
2958 | ||
726a989a | 2959 | if (same_handler_p (gimple_try_cleanup (oneh), gimple_try_cleanup (two))) |
a24549d4 | 2960 | { |
726a989a | 2961 | gimple_seq seq = gimple_try_eval (oneh); |
a24549d4 | 2962 | |
726a989a RB |
2963 | gimple_try_set_cleanup (one, seq); |
2964 | gimple_try_set_kind (one, GIMPLE_TRY_CATCH); | |
2965 | seq = copy_gimple_seq_and_replace_locals (seq); | |
2966 | gimple_seq_add_seq (&seq, gimple_try_eval (two)); | |
2967 | gimple_try_set_eval (two, seq); | |
a24549d4 JM |
2968 | } |
2969 | } | |
2970 | ||
2971 | /* Perform EH refactoring optimizations that are simpler to do when code | |
84fbffb2 | 2972 | flow has been lowered but EH structures haven't. */ |
a24549d4 JM |
2973 | |
2974 | static void | |
726a989a | 2975 | refactor_eh_r (gimple_seq seq) |
a24549d4 | 2976 | { |
726a989a RB |
2977 | gimple_stmt_iterator gsi; |
2978 | gimple one, two; | |
a24549d4 | 2979 | |
726a989a RB |
2980 | one = NULL; |
2981 | two = NULL; | |
2982 | gsi = gsi_start (seq); | |
2983 | while (1) | |
2984 | { | |
2985 | one = two; | |
2986 | if (gsi_end_p (gsi)) | |
2987 | two = NULL; | |
2988 | else | |
2989 | two = gsi_stmt (gsi); | |
2990 | if (one | |
2991 | && two | |
2992 | && gimple_code (one) == GIMPLE_TRY | |
2993 | && gimple_code (two) == GIMPLE_TRY | |
2994 | && gimple_try_kind (one) == GIMPLE_TRY_FINALLY | |
2995 | && gimple_try_kind (two) == GIMPLE_TRY_FINALLY) | |
2996 | optimize_double_finally (one, two); | |
2997 | if (one) | |
2998 | switch (gimple_code (one)) | |
a24549d4 | 2999 | { |
726a989a RB |
3000 | case GIMPLE_TRY: |
3001 | refactor_eh_r (gimple_try_eval (one)); | |
3002 | refactor_eh_r (gimple_try_cleanup (one)); | |
3003 | break; | |
3004 | case GIMPLE_CATCH: | |
3005 | refactor_eh_r (gimple_catch_handler (one)); | |
3006 | break; | |
3007 | case GIMPLE_EH_FILTER: | |
3008 | refactor_eh_r (gimple_eh_filter_failure (one)); | |
3009 | break; | |
0a35513e AH |
3010 | case GIMPLE_EH_ELSE: |
3011 | refactor_eh_r (gimple_eh_else_n_body (one)); | |
3012 | refactor_eh_r (gimple_eh_else_e_body (one)); | |
3013 | break; | |
726a989a RB |
3014 | default: |
3015 | break; | |
a24549d4 | 3016 | } |
726a989a RB |
3017 | if (two) |
3018 | gsi_next (&gsi); | |
3019 | else | |
3020 | break; | |
a24549d4 JM |
3021 | } |
3022 | } | |
3023 | ||
3024 | static unsigned | |
3025 | refactor_eh (void) | |
3026 | { | |
726a989a | 3027 | refactor_eh_r (gimple_body (current_function_decl)); |
a24549d4 JM |
3028 | return 0; |
3029 | } | |
3030 | ||
1d65f45c RH |
3031 | static bool |
3032 | gate_refactor_eh (void) | |
3033 | { | |
3034 | return flag_exceptions != 0; | |
3035 | } | |
3036 | ||
27a4cd48 DM |
3037 | namespace { |
3038 | ||
3039 | const pass_data pass_data_refactor_eh = | |
a24549d4 | 3040 | { |
27a4cd48 DM |
3041 | GIMPLE_PASS, /* type */ |
3042 | "ehopt", /* name */ | |
3043 | OPTGROUP_NONE, /* optinfo_flags */ | |
3044 | true, /* has_gate */ | |
3045 | true, /* has_execute */ | |
3046 | TV_TREE_EH, /* tv_id */ | |
3047 | PROP_gimple_lcf, /* properties_required */ | |
3048 | 0, /* properties_provided */ | |
3049 | 0, /* properties_destroyed */ | |
3050 | 0, /* todo_flags_start */ | |
3051 | 0, /* todo_flags_finish */ | |
a24549d4 | 3052 | }; |
27a4cd48 DM |
3053 | |
3054 | class pass_refactor_eh : public gimple_opt_pass | |
3055 | { | |
3056 | public: | |
3057 | pass_refactor_eh(gcc::context *ctxt) | |
3058 | : gimple_opt_pass(pass_data_refactor_eh, ctxt) | |
3059 | {} | |
3060 | ||
3061 | /* opt_pass methods: */ | |
3062 | bool gate () { return gate_refactor_eh (); } | |
3063 | unsigned int execute () { return refactor_eh (); } | |
3064 | ||
3065 | }; // class pass_refactor_eh | |
3066 | ||
3067 | } // anon namespace | |
3068 | ||
3069 | gimple_opt_pass * | |
3070 | make_pass_refactor_eh (gcc::context *ctxt) | |
3071 | { | |
3072 | return new pass_refactor_eh (ctxt); | |
3073 | } | |
1d65f45c RH |
3074 | \f |
3075 | /* At the end of gimple optimization, we can lower RESX. */ | |
a8da523f | 3076 | |
1d65f45c RH |
3077 | static bool |
3078 | lower_resx (basic_block bb, gimple stmt, struct pointer_map_t *mnt_map) | |
a8da523f | 3079 | { |
1d65f45c RH |
3080 | int lp_nr; |
3081 | eh_region src_r, dst_r; | |
3082 | gimple_stmt_iterator gsi; | |
3083 | gimple x; | |
3084 | tree fn, src_nr; | |
3085 | bool ret = false; | |
a8da523f | 3086 | |
1d65f45c RH |
3087 | lp_nr = lookup_stmt_eh_lp (stmt); |
3088 | if (lp_nr != 0) | |
3089 | dst_r = get_eh_region_from_lp_number (lp_nr); | |
3090 | else | |
3091 | dst_r = NULL; | |
a8da523f | 3092 | |
1d65f45c | 3093 | src_r = get_eh_region_from_number (gimple_resx_region (stmt)); |
1d65f45c | 3094 | gsi = gsi_last_bb (bb); |
a8da523f | 3095 | |
072c87d1 RH |
3096 | if (src_r == NULL) |
3097 | { | |
3098 | /* We can wind up with no source region when pass_cleanup_eh shows | |
3099 | that there are no entries into an eh region and deletes it, but | |
3100 | then the block that contains the resx isn't removed. This can | |
3101 | happen without optimization when the switch statement created by | |
3102 | lower_try_finally_switch isn't simplified to remove the eh case. | |
3103 | ||
3104 | Resolve this by expanding the resx node to an abort. */ | |
3105 | ||
e79983f4 | 3106 | fn = builtin_decl_implicit (BUILT_IN_TRAP); |
072c87d1 RH |
3107 | x = gimple_build_call (fn, 0); |
3108 | gsi_insert_before (&gsi, x, GSI_SAME_STMT); | |
3109 | ||
3110 | while (EDGE_COUNT (bb->succs) > 0) | |
3111 | remove_edge (EDGE_SUCC (bb, 0)); | |
3112 | } | |
3113 | else if (dst_r) | |
1d65f45c RH |
3114 | { |
3115 | /* When we have a destination region, we resolve this by copying | |
3116 | the excptr and filter values into place, and changing the edge | |
3117 | to immediately after the landing pad. */ | |
3118 | edge e; | |
a8da523f | 3119 | |
1d65f45c RH |
3120 | if (lp_nr < 0) |
3121 | { | |
3122 | basic_block new_bb; | |
3123 | void **slot; | |
3124 | tree lab; | |
496a4ef5 | 3125 | |
1d65f45c RH |
3126 | /* We are resuming into a MUST_NOT_CALL region. Expand a call to |
3127 | the failure decl into a new block, if needed. */ | |
3128 | gcc_assert (dst_r->type == ERT_MUST_NOT_THROW); | |
a8da523f | 3129 | |
1d65f45c RH |
3130 | slot = pointer_map_contains (mnt_map, dst_r); |
3131 | if (slot == NULL) | |
3132 | { | |
3133 | gimple_stmt_iterator gsi2; | |
a8da523f | 3134 | |
1d65f45c | 3135 | new_bb = create_empty_bb (bb); |
7d776ee2 RG |
3136 | if (current_loops) |
3137 | add_bb_to_loop (new_bb, bb->loop_father); | |
1d65f45c RH |
3138 | lab = gimple_block_label (new_bb); |
3139 | gsi2 = gsi_start_bb (new_bb); | |
a8da523f | 3140 | |
1d65f45c RH |
3141 | fn = dst_r->u.must_not_throw.failure_decl; |
3142 | x = gimple_build_call (fn, 0); | |
3143 | gimple_set_location (x, dst_r->u.must_not_throw.failure_loc); | |
3144 | gsi_insert_after (&gsi2, x, GSI_CONTINUE_LINKING); | |
4e6d1743 | 3145 | |
1d65f45c RH |
3146 | slot = pointer_map_insert (mnt_map, dst_r); |
3147 | *slot = lab; | |
3148 | } | |
3149 | else | |
3150 | { | |
3151 | lab = (tree) *slot; | |
3152 | new_bb = label_to_block (lab); | |
3153 | } | |
a8da523f | 3154 | |
1d65f45c RH |
3155 | gcc_assert (EDGE_COUNT (bb->succs) == 0); |
3156 | e = make_edge (bb, new_bb, EDGE_FALLTHRU); | |
3157 | e->count = bb->count; | |
3158 | e->probability = REG_BR_PROB_BASE; | |
3159 | } | |
3160 | else | |
3161 | { | |
3162 | edge_iterator ei; | |
413581ba | 3163 | tree dst_nr = build_int_cst (integer_type_node, dst_r->index); |
a8da523f | 3164 | |
e79983f4 | 3165 | fn = builtin_decl_implicit (BUILT_IN_EH_COPY_VALUES); |
413581ba | 3166 | src_nr = build_int_cst (integer_type_node, src_r->index); |
1d65f45c RH |
3167 | x = gimple_build_call (fn, 2, dst_nr, src_nr); |
3168 | gsi_insert_before (&gsi, x, GSI_SAME_STMT); | |
a8da523f | 3169 | |
1d65f45c RH |
3170 | /* Update the flags for the outgoing edge. */ |
3171 | e = single_succ_edge (bb); | |
3172 | gcc_assert (e->flags & EDGE_EH); | |
3173 | e->flags = (e->flags & ~EDGE_EH) | EDGE_FALLTHRU; | |
a8da523f | 3174 | |
1d65f45c RH |
3175 | /* If there are no more EH users of the landing pad, delete it. */ |
3176 | FOR_EACH_EDGE (e, ei, e->dest->preds) | |
3177 | if (e->flags & EDGE_EH) | |
3178 | break; | |
3179 | if (e == NULL) | |
3180 | { | |
3181 | eh_landing_pad lp = get_eh_landing_pad_from_number (lp_nr); | |
3182 | remove_eh_landing_pad (lp); | |
3183 | } | |
3184 | } | |
a8da523f | 3185 | |
1d65f45c RH |
3186 | ret = true; |
3187 | } | |
3188 | else | |
3189 | { | |
3190 | tree var; | |
a8da523f | 3191 | |
1d65f45c RH |
3192 | /* When we don't have a destination region, this exception escapes |
3193 | up the call chain. We resolve this by generating a call to the | |
3194 | _Unwind_Resume library function. */ | |
a8da523f | 3195 | |
384c400a | 3196 | /* The ARM EABI redefines _Unwind_Resume as __cxa_end_cleanup |
1d65f45c | 3197 | with no arguments for C++ and Java. Check for that. */ |
384c400a RH |
3198 | if (src_r->use_cxa_end_cleanup) |
3199 | { | |
e79983f4 | 3200 | fn = builtin_decl_implicit (BUILT_IN_CXA_END_CLEANUP); |
384c400a RH |
3201 | x = gimple_build_call (fn, 0); |
3202 | gsi_insert_before (&gsi, x, GSI_SAME_STMT); | |
3203 | } | |
3204 | else | |
4e6d1743 | 3205 | { |
e79983f4 | 3206 | fn = builtin_decl_implicit (BUILT_IN_EH_POINTER); |
413581ba | 3207 | src_nr = build_int_cst (integer_type_node, src_r->index); |
1d65f45c RH |
3208 | x = gimple_build_call (fn, 1, src_nr); |
3209 | var = create_tmp_var (ptr_type_node, NULL); | |
3210 | var = make_ssa_name (var, x); | |
3211 | gimple_call_set_lhs (x, var); | |
3212 | gsi_insert_before (&gsi, x, GSI_SAME_STMT); | |
3213 | ||
e79983f4 | 3214 | fn = builtin_decl_implicit (BUILT_IN_UNWIND_RESUME); |
1d65f45c RH |
3215 | x = gimple_build_call (fn, 1, var); |
3216 | gsi_insert_before (&gsi, x, GSI_SAME_STMT); | |
4e6d1743 | 3217 | } |
a8da523f | 3218 | |
1d65f45c | 3219 | gcc_assert (EDGE_COUNT (bb->succs) == 0); |
4e6d1743 | 3220 | } |
496a4ef5 | 3221 | |
1d65f45c RH |
3222 | gsi_remove (&gsi, true); |
3223 | ||
3224 | return ret; | |
4e6d1743 JH |
3225 | } |
3226 | ||
1d65f45c RH |
3227 | static unsigned |
3228 | execute_lower_resx (void) | |
3229 | { | |
3230 | basic_block bb; | |
3231 | struct pointer_map_t *mnt_map; | |
3232 | bool dominance_invalidated = false; | |
3233 | bool any_rewritten = false; | |
4e6d1743 | 3234 | |
1d65f45c | 3235 | mnt_map = pointer_map_create (); |
4e6d1743 | 3236 | |
1d65f45c RH |
3237 | FOR_EACH_BB (bb) |
3238 | { | |
3239 | gimple last = last_stmt (bb); | |
3240 | if (last && is_gimple_resx (last)) | |
3241 | { | |
3242 | dominance_invalidated |= lower_resx (bb, last, mnt_map); | |
3243 | any_rewritten = true; | |
3244 | } | |
3245 | } | |
3246 | ||
3247 | pointer_map_destroy (mnt_map); | |
3248 | ||
3249 | if (dominance_invalidated) | |
3250 | { | |
3251 | free_dominance_info (CDI_DOMINATORS); | |
3252 | free_dominance_info (CDI_POST_DOMINATORS); | |
4e6d1743 | 3253 | } |
a8da523f | 3254 | |
1d65f45c RH |
3255 | return any_rewritten ? TODO_update_ssa_only_virtuals : 0; |
3256 | } | |
a8da523f | 3257 | |
1d65f45c | 3258 | static bool |
072c87d1 | 3259 | gate_lower_resx (void) |
1d65f45c | 3260 | { |
072c87d1 | 3261 | return flag_exceptions != 0; |
1d65f45c | 3262 | } |
4e6d1743 | 3263 | |
27a4cd48 DM |
3264 | namespace { |
3265 | ||
3266 | const pass_data pass_data_lower_resx = | |
4e6d1743 | 3267 | { |
27a4cd48 DM |
3268 | GIMPLE_PASS, /* type */ |
3269 | "resx", /* name */ | |
3270 | OPTGROUP_NONE, /* optinfo_flags */ | |
3271 | true, /* has_gate */ | |
3272 | true, /* has_execute */ | |
3273 | TV_TREE_EH, /* tv_id */ | |
3274 | PROP_gimple_lcf, /* properties_required */ | |
3275 | 0, /* properties_provided */ | |
3276 | 0, /* properties_destroyed */ | |
3277 | 0, /* todo_flags_start */ | |
3278 | TODO_verify_flow, /* todo_flags_finish */ | |
4e6d1743 JH |
3279 | }; |
3280 | ||
27a4cd48 DM |
3281 | class pass_lower_resx : public gimple_opt_pass |
3282 | { | |
3283 | public: | |
3284 | pass_lower_resx(gcc::context *ctxt) | |
3285 | : gimple_opt_pass(pass_data_lower_resx, ctxt) | |
3286 | {} | |
3287 | ||
3288 | /* opt_pass methods: */ | |
3289 | bool gate () { return gate_lower_resx (); } | |
3290 | unsigned int execute () { return execute_lower_resx (); } | |
3291 | ||
3292 | }; // class pass_lower_resx | |
3293 | ||
3294 | } // anon namespace | |
3295 | ||
3296 | gimple_opt_pass * | |
3297 | make_pass_lower_resx (gcc::context *ctxt) | |
3298 | { | |
3299 | return new pass_lower_resx (ctxt); | |
3300 | } | |
3301 | ||
960f0c9d JJ |
3302 | /* Try to optimize var = {v} {CLOBBER} stmts followed just by |
3303 | external throw. */ | |
3304 | ||
3305 | static void | |
3306 | optimize_clobbers (basic_block bb) | |
3307 | { | |
3308 | gimple_stmt_iterator gsi = gsi_last_bb (bb); | |
f223bb13 JJ |
3309 | bool any_clobbers = false; |
3310 | bool seen_stack_restore = false; | |
3311 | edge_iterator ei; | |
3312 | edge e; | |
3313 | ||
3314 | /* Only optimize anything if the bb contains at least one clobber, | |
3315 | ends with resx (checked by caller), optionally contains some | |
3316 | debug stmts or labels, or at most one __builtin_stack_restore | |
3317 | call, and has an incoming EH edge. */ | |
6d1c2bd3 | 3318 | for (gsi_prev (&gsi); !gsi_end_p (gsi); gsi_prev (&gsi)) |
960f0c9d JJ |
3319 | { |
3320 | gimple stmt = gsi_stmt (gsi); | |
3321 | if (is_gimple_debug (stmt)) | |
6d1c2bd3 | 3322 | continue; |
f223bb13 JJ |
3323 | if (gimple_clobber_p (stmt)) |
3324 | { | |
3325 | any_clobbers = true; | |
3326 | continue; | |
3327 | } | |
3328 | if (!seen_stack_restore | |
3329 | && gimple_call_builtin_p (stmt, BUILT_IN_STACK_RESTORE)) | |
3330 | { | |
3331 | seen_stack_restore = true; | |
3332 | continue; | |
3333 | } | |
3334 | if (gimple_code (stmt) == GIMPLE_LABEL) | |
3335 | break; | |
3336 | return; | |
3337 | } | |
3338 | if (!any_clobbers) | |
3339 | return; | |
3340 | FOR_EACH_EDGE (e, ei, bb->preds) | |
3341 | if (e->flags & EDGE_EH) | |
3342 | break; | |
3343 | if (e == NULL) | |
3344 | return; | |
3345 | gsi = gsi_last_bb (bb); | |
3346 | for (gsi_prev (&gsi); !gsi_end_p (gsi); gsi_prev (&gsi)) | |
3347 | { | |
3348 | gimple stmt = gsi_stmt (gsi); | |
3349 | if (!gimple_clobber_p (stmt)) | |
3350 | continue; | |
960f0c9d JJ |
3351 | unlink_stmt_vdef (stmt); |
3352 | gsi_remove (&gsi, true); | |
3353 | release_defs (stmt); | |
3354 | } | |
3355 | } | |
1d65f45c | 3356 | |
ea85edfe JJ |
3357 | /* Try to sink var = {v} {CLOBBER} stmts followed just by |
3358 | internal throw to successor BB. */ | |
3359 | ||
3360 | static int | |
3361 | sink_clobbers (basic_block bb) | |
3362 | { | |
3363 | edge e; | |
3364 | edge_iterator ei; | |
3365 | gimple_stmt_iterator gsi, dgsi; | |
3366 | basic_block succbb; | |
3367 | bool any_clobbers = false; | |
df35498a | 3368 | unsigned todo = 0; |
ea85edfe JJ |
3369 | |
3370 | /* Only optimize if BB has a single EH successor and | |
3371 | all predecessor edges are EH too. */ | |
3372 | if (!single_succ_p (bb) | |
3373 | || (single_succ_edge (bb)->flags & EDGE_EH) == 0) | |
3374 | return 0; | |
3375 | ||
3376 | FOR_EACH_EDGE (e, ei, bb->preds) | |
3377 | { | |
3378 | if ((e->flags & EDGE_EH) == 0) | |
3379 | return 0; | |
3380 | } | |
3381 | ||
3382 | /* And BB contains only CLOBBER stmts before the final | |
3383 | RESX. */ | |
3384 | gsi = gsi_last_bb (bb); | |
3385 | for (gsi_prev (&gsi); !gsi_end_p (gsi); gsi_prev (&gsi)) | |
3386 | { | |
3387 | gimple stmt = gsi_stmt (gsi); | |
3388 | if (is_gimple_debug (stmt)) | |
3389 | continue; | |
3390 | if (gimple_code (stmt) == GIMPLE_LABEL) | |
3391 | break; | |
f223bb13 | 3392 | if (!gimple_clobber_p (stmt)) |
ea85edfe JJ |
3393 | return 0; |
3394 | any_clobbers = true; | |
3395 | } | |
3396 | if (!any_clobbers) | |
3397 | return 0; | |
3398 | ||
4c1aff1c RB |
3399 | edge succe = single_succ_edge (bb); |
3400 | succbb = succe->dest; | |
3401 | ||
3402 | /* See if there is a virtual PHI node to take an updated virtual | |
3403 | operand from. */ | |
3404 | gimple vphi = NULL; | |
3405 | tree vuse = NULL_TREE; | |
3406 | for (gsi = gsi_start_phis (succbb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
3407 | { | |
3408 | tree res = gimple_phi_result (gsi_stmt (gsi)); | |
3409 | if (virtual_operand_p (res)) | |
3410 | { | |
3411 | vphi = gsi_stmt (gsi); | |
3412 | vuse = res; | |
3413 | break; | |
3414 | } | |
3415 | } | |
3416 | ||
ea85edfe JJ |
3417 | dgsi = gsi_after_labels (succbb); |
3418 | gsi = gsi_last_bb (bb); | |
3419 | for (gsi_prev (&gsi); !gsi_end_p (gsi); gsi_prev (&gsi)) | |
3420 | { | |
3421 | gimple stmt = gsi_stmt (gsi); | |
f223bb13 | 3422 | tree lhs; |
ea85edfe JJ |
3423 | if (is_gimple_debug (stmt)) |
3424 | continue; | |
3425 | if (gimple_code (stmt) == GIMPLE_LABEL) | |
3426 | break; | |
f223bb13 JJ |
3427 | lhs = gimple_assign_lhs (stmt); |
3428 | /* Unfortunately we don't have dominance info updated at this | |
3429 | point, so checking if | |
3430 | dominated_by_p (CDI_DOMINATORS, succbb, | |
3431 | gimple_bb (SSA_NAME_DEF_STMT (TREE_OPERAND (lhs, 0))) | |
3432 | would be too costly. Thus, avoid sinking any clobbers that | |
3433 | refer to non-(D) SSA_NAMEs. */ | |
3434 | if (TREE_CODE (lhs) == MEM_REF | |
3435 | && TREE_CODE (TREE_OPERAND (lhs, 0)) == SSA_NAME | |
3436 | && !SSA_NAME_IS_DEFAULT_DEF (TREE_OPERAND (lhs, 0))) | |
3437 | { | |
4c1aff1c | 3438 | unlink_stmt_vdef (stmt); |
f223bb13 JJ |
3439 | gsi_remove (&gsi, true); |
3440 | release_defs (stmt); | |
3441 | continue; | |
3442 | } | |
4c1aff1c RB |
3443 | |
3444 | /* As we do not change stmt order when sinking across a | |
3445 | forwarder edge we can keep virtual operands in place. */ | |
ea85edfe | 3446 | gsi_remove (&gsi, false); |
4c1aff1c RB |
3447 | gsi_insert_before (&dgsi, stmt, GSI_NEW_STMT); |
3448 | ||
3449 | /* But adjust virtual operands if we sunk across a PHI node. */ | |
3450 | if (vuse) | |
3451 | { | |
3452 | gimple use_stmt; | |
3453 | imm_use_iterator iter; | |
3454 | use_operand_p use_p; | |
3455 | FOR_EACH_IMM_USE_STMT (use_stmt, iter, vuse) | |
3456 | FOR_EACH_IMM_USE_ON_STMT (use_p, iter) | |
3457 | SET_USE (use_p, gimple_vdef (stmt)); | |
0a1a83cb RB |
3458 | if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (vuse)) |
3459 | { | |
3460 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI (gimple_vdef (stmt)) = 1; | |
3461 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI (vuse) = 0; | |
3462 | } | |
4c1aff1c RB |
3463 | /* Adjust the incoming virtual operand. */ |
3464 | SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (vphi, succe), gimple_vuse (stmt)); | |
3465 | SET_USE (gimple_vuse_op (stmt), vuse); | |
3466 | } | |
df35498a RB |
3467 | /* If there isn't a single predecessor but no virtual PHI node |
3468 | arrange for virtual operands to be renamed. */ | |
3469 | else if (gimple_vuse_op (stmt) != NULL_USE_OPERAND_P | |
3470 | && !single_pred_p (succbb)) | |
3471 | { | |
3472 | /* In this case there will be no use of the VDEF of this stmt. | |
3473 | ??? Unless this is a secondary opportunity and we have not | |
3474 | removed unreachable blocks yet, so we cannot assert this. | |
3475 | Which also means we will end up renaming too many times. */ | |
3476 | SET_USE (gimple_vuse_op (stmt), gimple_vop (cfun)); | |
3477 | mark_virtual_operands_for_renaming (cfun); | |
3478 | todo |= TODO_update_ssa_only_virtuals; | |
3479 | } | |
ea85edfe JJ |
3480 | } |
3481 | ||
df35498a | 3482 | return todo; |
ea85edfe JJ |
3483 | } |
3484 | ||
9f698956 AB |
3485 | /* At the end of inlining, we can lower EH_DISPATCH. Return true when |
3486 | we have found some duplicate labels and removed some edges. */ | |
4e6d1743 | 3487 | |
9f698956 | 3488 | static bool |
1d65f45c | 3489 | lower_eh_dispatch (basic_block src, gimple stmt) |
4e6d1743 | 3490 | { |
1d65f45c RH |
3491 | gimple_stmt_iterator gsi; |
3492 | int region_nr; | |
3493 | eh_region r; | |
3494 | tree filter, fn; | |
3495 | gimple x; | |
9f698956 | 3496 | bool redirected = false; |
4e6d1743 | 3497 | |
1d65f45c RH |
3498 | region_nr = gimple_eh_dispatch_region (stmt); |
3499 | r = get_eh_region_from_number (region_nr); | |
4e6d1743 | 3500 | |
1d65f45c | 3501 | gsi = gsi_last_bb (src); |
4e6d1743 | 3502 | |
1d65f45c | 3503 | switch (r->type) |
4e6d1743 | 3504 | { |
1d65f45c RH |
3505 | case ERT_TRY: |
3506 | { | |
6e1aa848 | 3507 | vec<tree> labels = vNULL; |
1d65f45c RH |
3508 | tree default_label = NULL; |
3509 | eh_catch c; | |
3510 | edge_iterator ei; | |
3511 | edge e; | |
9f698956 | 3512 | struct pointer_set_t *seen_values = pointer_set_create (); |
1d65f45c RH |
3513 | |
3514 | /* Collect the labels for a switch. Zero the post_landing_pad | |
3515 | field becase we'll no longer have anything keeping these labels | |
073a8998 | 3516 | in existence and the optimizer will be free to merge these |
1d65f45c RH |
3517 | blocks at will. */ |
3518 | for (c = r->u.eh_try.first_catch; c ; c = c->next_catch) | |
3519 | { | |
3520 | tree tp_node, flt_node, lab = c->label; | |
9f698956 | 3521 | bool have_label = false; |
4e6d1743 | 3522 | |
1d65f45c RH |
3523 | c->label = NULL; |
3524 | tp_node = c->type_list; | |
3525 | flt_node = c->filter_list; | |
3526 | ||
3527 | if (tp_node == NULL) | |
3528 | { | |
3529 | default_label = lab; | |
3530 | break; | |
3531 | } | |
3532 | do | |
3533 | { | |
9f698956 AB |
3534 | /* Filter out duplicate labels that arise when this handler |
3535 | is shadowed by an earlier one. When no labels are | |
3536 | attached to the handler anymore, we remove | |
3537 | the corresponding edge and then we delete unreachable | |
3538 | blocks at the end of this pass. */ | |
3539 | if (! pointer_set_contains (seen_values, TREE_VALUE (flt_node))) | |
3540 | { | |
3d528853 NF |
3541 | tree t = build_case_label (TREE_VALUE (flt_node), |
3542 | NULL, lab); | |
9771b263 | 3543 | labels.safe_push (t); |
9f698956 AB |
3544 | pointer_set_insert (seen_values, TREE_VALUE (flt_node)); |
3545 | have_label = true; | |
3546 | } | |
1d65f45c RH |
3547 | |
3548 | tp_node = TREE_CHAIN (tp_node); | |
3549 | flt_node = TREE_CHAIN (flt_node); | |
3550 | } | |
3551 | while (tp_node); | |
9f698956 AB |
3552 | if (! have_label) |
3553 | { | |
3554 | remove_edge (find_edge (src, label_to_block (lab))); | |
3555 | redirected = true; | |
3556 | } | |
1d65f45c RH |
3557 | } |
3558 | ||
3559 | /* Clean up the edge flags. */ | |
3560 | FOR_EACH_EDGE (e, ei, src->succs) | |
3561 | { | |
3562 | if (e->flags & EDGE_FALLTHRU) | |
3563 | { | |
3564 | /* If there was no catch-all, use the fallthru edge. */ | |
3565 | if (default_label == NULL) | |
3566 | default_label = gimple_block_label (e->dest); | |
3567 | e->flags &= ~EDGE_FALLTHRU; | |
3568 | } | |
3569 | } | |
3570 | gcc_assert (default_label != NULL); | |
3571 | ||
3572 | /* Don't generate a switch if there's only a default case. | |
3573 | This is common in the form of try { A; } catch (...) { B; }. */ | |
9771b263 | 3574 | if (!labels.exists ()) |
1d65f45c RH |
3575 | { |
3576 | e = single_succ_edge (src); | |
3577 | e->flags |= EDGE_FALLTHRU; | |
3578 | } | |
3579 | else | |
3580 | { | |
e79983f4 | 3581 | fn = builtin_decl_implicit (BUILT_IN_EH_FILTER); |
413581ba RG |
3582 | x = gimple_build_call (fn, 1, build_int_cst (integer_type_node, |
3583 | region_nr)); | |
1d65f45c RH |
3584 | filter = create_tmp_var (TREE_TYPE (TREE_TYPE (fn)), NULL); |
3585 | filter = make_ssa_name (filter, x); | |
3586 | gimple_call_set_lhs (x, filter); | |
3587 | gsi_insert_before (&gsi, x, GSI_SAME_STMT); | |
3588 | ||
3589 | /* Turn the default label into a default case. */ | |
3d528853 | 3590 | default_label = build_case_label (NULL, NULL, default_label); |
1d65f45c RH |
3591 | sort_case_labels (labels); |
3592 | ||
fd8d363e | 3593 | x = gimple_build_switch (filter, default_label, labels); |
1d65f45c RH |
3594 | gsi_insert_before (&gsi, x, GSI_SAME_STMT); |
3595 | ||
9771b263 | 3596 | labels.release (); |
1d65f45c | 3597 | } |
9f698956 | 3598 | pointer_set_destroy (seen_values); |
1d65f45c RH |
3599 | } |
3600 | break; | |
3601 | ||
3602 | case ERT_ALLOWED_EXCEPTIONS: | |
3603 | { | |
3604 | edge b_e = BRANCH_EDGE (src); | |
3605 | edge f_e = FALLTHRU_EDGE (src); | |
3606 | ||
e79983f4 | 3607 | fn = builtin_decl_implicit (BUILT_IN_EH_FILTER); |
413581ba RG |
3608 | x = gimple_build_call (fn, 1, build_int_cst (integer_type_node, |
3609 | region_nr)); | |
1d65f45c RH |
3610 | filter = create_tmp_var (TREE_TYPE (TREE_TYPE (fn)), NULL); |
3611 | filter = make_ssa_name (filter, x); | |
3612 | gimple_call_set_lhs (x, filter); | |
3613 | gsi_insert_before (&gsi, x, GSI_SAME_STMT); | |
3614 | ||
3615 | r->u.allowed.label = NULL; | |
3616 | x = gimple_build_cond (EQ_EXPR, filter, | |
3617 | build_int_cst (TREE_TYPE (filter), | |
3618 | r->u.allowed.filter), | |
3619 | NULL_TREE, NULL_TREE); | |
3620 | gsi_insert_before (&gsi, x, GSI_SAME_STMT); | |
3621 | ||
3622 | b_e->flags = b_e->flags | EDGE_TRUE_VALUE; | |
3623 | f_e->flags = (f_e->flags & ~EDGE_FALLTHRU) | EDGE_FALSE_VALUE; | |
3624 | } | |
3625 | break; | |
3626 | ||
3627 | default: | |
3628 | gcc_unreachable (); | |
4e6d1743 | 3629 | } |
1d65f45c RH |
3630 | |
3631 | /* Replace the EH_DISPATCH with the SWITCH or COND generated above. */ | |
3632 | gsi_remove (&gsi, true); | |
9f698956 | 3633 | return redirected; |
4e6d1743 JH |
3634 | } |
3635 | ||
1d65f45c RH |
3636 | static unsigned |
3637 | execute_lower_eh_dispatch (void) | |
3638 | { | |
3639 | basic_block bb; | |
ea85edfe | 3640 | int flags = 0; |
9f698956 | 3641 | bool redirected = false; |
4e6d1743 | 3642 | |
1d65f45c | 3643 | assign_filter_values (); |
496a4ef5 | 3644 | |
1d65f45c RH |
3645 | FOR_EACH_BB (bb) |
3646 | { | |
3647 | gimple last = last_stmt (bb); | |
960f0c9d JJ |
3648 | if (last == NULL) |
3649 | continue; | |
3650 | if (gimple_code (last) == GIMPLE_EH_DISPATCH) | |
1d65f45c | 3651 | { |
9f698956 | 3652 | redirected |= lower_eh_dispatch (bb, last); |
ea85edfe JJ |
3653 | flags |= TODO_update_ssa_only_virtuals; |
3654 | } | |
3655 | else if (gimple_code (last) == GIMPLE_RESX) | |
3656 | { | |
3657 | if (stmt_can_throw_external (last)) | |
3658 | optimize_clobbers (bb); | |
3659 | else | |
3660 | flags |= sink_clobbers (bb); | |
1d65f45c RH |
3661 | } |
3662 | } | |
3663 | ||
9f698956 AB |
3664 | if (redirected) |
3665 | delete_unreachable_blocks (); | |
ea85edfe | 3666 | return flags; |
1d65f45c RH |
3667 | } |
3668 | ||
072c87d1 RH |
3669 | static bool |
3670 | gate_lower_eh_dispatch (void) | |
3671 | { | |
1f9081d1 | 3672 | return cfun->eh->region_tree != NULL; |
072c87d1 RH |
3673 | } |
3674 | ||
27a4cd48 DM |
3675 | namespace { |
3676 | ||
3677 | const pass_data pass_data_lower_eh_dispatch = | |
4e6d1743 | 3678 | { |
27a4cd48 DM |
3679 | GIMPLE_PASS, /* type */ |
3680 | "ehdisp", /* name */ | |
3681 | OPTGROUP_NONE, /* optinfo_flags */ | |
3682 | true, /* has_gate */ | |
3683 | true, /* has_execute */ | |
3684 | TV_TREE_EH, /* tv_id */ | |
3685 | PROP_gimple_lcf, /* properties_required */ | |
3686 | 0, /* properties_provided */ | |
3687 | 0, /* properties_destroyed */ | |
3688 | 0, /* todo_flags_start */ | |
3689 | TODO_verify_flow, /* todo_flags_finish */ | |
1d65f45c | 3690 | }; |
27a4cd48 DM |
3691 | |
3692 | class pass_lower_eh_dispatch : public gimple_opt_pass | |
3693 | { | |
3694 | public: | |
3695 | pass_lower_eh_dispatch(gcc::context *ctxt) | |
3696 | : gimple_opt_pass(pass_data_lower_eh_dispatch, ctxt) | |
3697 | {} | |
3698 | ||
3699 | /* opt_pass methods: */ | |
3700 | bool gate () { return gate_lower_eh_dispatch (); } | |
3701 | unsigned int execute () { return execute_lower_eh_dispatch (); } | |
3702 | ||
3703 | }; // class pass_lower_eh_dispatch | |
3704 | ||
3705 | } // anon namespace | |
3706 | ||
3707 | gimple_opt_pass * | |
3708 | make_pass_lower_eh_dispatch (gcc::context *ctxt) | |
3709 | { | |
3710 | return new pass_lower_eh_dispatch (ctxt); | |
3711 | } | |
1d65f45c | 3712 | \f |
d273b176 SB |
3713 | /* Walk statements, see what regions and, optionally, landing pads |
3714 | are really referenced. | |
3715 | ||
3716 | Returns in R_REACHABLEP an sbitmap with bits set for reachable regions, | |
3717 | and in LP_REACHABLE an sbitmap with bits set for reachable landing pads. | |
3718 | ||
3719 | Passing NULL for LP_REACHABLE is valid, in this case only reachable | |
3720 | regions are marked. | |
3721 | ||
3722 | The caller is responsible for freeing the returned sbitmaps. */ | |
1d65f45c RH |
3723 | |
3724 | static void | |
d273b176 | 3725 | mark_reachable_handlers (sbitmap *r_reachablep, sbitmap *lp_reachablep) |
1d65f45c RH |
3726 | { |
3727 | sbitmap r_reachable, lp_reachable; | |
1d65f45c | 3728 | basic_block bb; |
d273b176 SB |
3729 | bool mark_landing_pads = (lp_reachablep != NULL); |
3730 | gcc_checking_assert (r_reachablep != NULL); | |
4e6d1743 | 3731 | |
9771b263 | 3732 | r_reachable = sbitmap_alloc (cfun->eh->region_array->length ()); |
f61e445a | 3733 | bitmap_clear (r_reachable); |
d273b176 SB |
3734 | *r_reachablep = r_reachable; |
3735 | ||
3736 | if (mark_landing_pads) | |
3737 | { | |
3738 | lp_reachable = sbitmap_alloc (cfun->eh->lp_array->length ()); | |
3739 | bitmap_clear (lp_reachable); | |
3740 | *lp_reachablep = lp_reachable; | |
3741 | } | |
3742 | else | |
3743 | lp_reachable = NULL; | |
4e6d1743 | 3744 | |
1d65f45c | 3745 | FOR_EACH_BB (bb) |
4e6d1743 | 3746 | { |
57f93411 | 3747 | gimple_stmt_iterator gsi; |
1d65f45c RH |
3748 | |
3749 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
3750 | { | |
3751 | gimple stmt = gsi_stmt (gsi); | |
1d65f45c | 3752 | |
d273b176 | 3753 | if (mark_landing_pads) |
1d65f45c | 3754 | { |
d273b176 SB |
3755 | int lp_nr = lookup_stmt_eh_lp (stmt); |
3756 | ||
3757 | /* Negative LP numbers are MUST_NOT_THROW regions which | |
3758 | are not considered BB enders. */ | |
3759 | if (lp_nr < 0) | |
3760 | bitmap_set_bit (r_reachable, -lp_nr); | |
3761 | ||
3762 | /* Positive LP numbers are real landing pads, and BB enders. */ | |
3763 | else if (lp_nr > 0) | |
3764 | { | |
3765 | gcc_assert (gsi_one_before_end_p (gsi)); | |
3766 | eh_region region = get_eh_region_from_lp_number (lp_nr); | |
3767 | bitmap_set_bit (r_reachable, region->index); | |
3768 | bitmap_set_bit (lp_reachable, lp_nr); | |
3769 | } | |
1d65f45c | 3770 | } |
6ae70ea2 JJ |
3771 | |
3772 | /* Avoid removing regions referenced from RESX/EH_DISPATCH. */ | |
3773 | switch (gimple_code (stmt)) | |
3774 | { | |
3775 | case GIMPLE_RESX: | |
d7c028c0 | 3776 | bitmap_set_bit (r_reachable, gimple_resx_region (stmt)); |
6ae70ea2 JJ |
3777 | break; |
3778 | case GIMPLE_EH_DISPATCH: | |
d7c028c0 | 3779 | bitmap_set_bit (r_reachable, gimple_eh_dispatch_region (stmt)); |
6ae70ea2 JJ |
3780 | break; |
3781 | default: | |
3782 | break; | |
3783 | } | |
1d65f45c | 3784 | } |
4e6d1743 | 3785 | } |
d273b176 SB |
3786 | } |
3787 | ||
3788 | /* Remove unreachable handlers and unreachable landing pads. */ | |
3789 | ||
3790 | static void | |
3791 | remove_unreachable_handlers (void) | |
3792 | { | |
3793 | sbitmap r_reachable, lp_reachable; | |
3794 | eh_region region; | |
3795 | eh_landing_pad lp; | |
3796 | unsigned i; | |
3797 | ||
3798 | mark_reachable_handlers (&r_reachable, &lp_reachable); | |
1d65f45c RH |
3799 | |
3800 | if (dump_file) | |
4e6d1743 | 3801 | { |
1d65f45c RH |
3802 | fprintf (dump_file, "Before removal of unreachable regions:\n"); |
3803 | dump_eh_tree (dump_file, cfun); | |
3804 | fprintf (dump_file, "Reachable regions: "); | |
f61e445a | 3805 | dump_bitmap_file (dump_file, r_reachable); |
1d65f45c | 3806 | fprintf (dump_file, "Reachable landing pads: "); |
f61e445a | 3807 | dump_bitmap_file (dump_file, lp_reachable); |
4e6d1743 JH |
3808 | } |
3809 | ||
d273b176 SB |
3810 | if (dump_file) |
3811 | { | |
3812 | FOR_EACH_VEC_SAFE_ELT (cfun->eh->region_array, i, region) | |
3813 | if (region && !bitmap_bit_p (r_reachable, region->index)) | |
3814 | fprintf (dump_file, | |
3815 | "Removing unreachable region %d\n", | |
3816 | region->index); | |
3817 | } | |
3818 | ||
3819 | remove_unreachable_eh_regions (r_reachable); | |
4e6d1743 | 3820 | |
d273b176 SB |
3821 | FOR_EACH_VEC_SAFE_ELT (cfun->eh->lp_array, i, lp) |
3822 | if (lp && !bitmap_bit_p (lp_reachable, lp->index)) | |
1d65f45c RH |
3823 | { |
3824 | if (dump_file) | |
d273b176 SB |
3825 | fprintf (dump_file, |
3826 | "Removing unreachable landing pad %d\n", | |
3827 | lp->index); | |
1d65f45c RH |
3828 | remove_eh_landing_pad (lp); |
3829 | } | |
b8698a0f | 3830 | |
1d65f45c | 3831 | if (dump_file) |
4e6d1743 | 3832 | { |
1d65f45c RH |
3833 | fprintf (dump_file, "\n\nAfter removal of unreachable regions:\n"); |
3834 | dump_eh_tree (dump_file, cfun); | |
3835 | fprintf (dump_file, "\n\n"); | |
4e6d1743 JH |
3836 | } |
3837 | ||
1d65f45c RH |
3838 | sbitmap_free (r_reachable); |
3839 | sbitmap_free (lp_reachable); | |
3840 | ||
3841 | #ifdef ENABLE_CHECKING | |
3842 | verify_eh_tree (cfun); | |
3843 | #endif | |
3844 | } | |
3845 | ||
99d8763e JJ |
3846 | /* Remove unreachable handlers if any landing pads have been removed after |
3847 | last ehcleanup pass (due to gimple_purge_dead_eh_edges). */ | |
3848 | ||
3849 | void | |
3850 | maybe_remove_unreachable_handlers (void) | |
3851 | { | |
3852 | eh_landing_pad lp; | |
d273b176 | 3853 | unsigned i; |
99d8763e JJ |
3854 | |
3855 | if (cfun->eh == NULL) | |
3856 | return; | |
d273b176 SB |
3857 | |
3858 | FOR_EACH_VEC_SAFE_ELT (cfun->eh->lp_array, i, lp) | |
99d8763e JJ |
3859 | if (lp && lp->post_landing_pad) |
3860 | { | |
3861 | if (label_to_block (lp->post_landing_pad) == NULL) | |
3862 | { | |
3863 | remove_unreachable_handlers (); | |
3864 | return; | |
3865 | } | |
3866 | } | |
3867 | } | |
3868 | ||
1d65f45c RH |
3869 | /* Remove regions that do not have landing pads. This assumes |
3870 | that remove_unreachable_handlers has already been run, and | |
d273b176 SB |
3871 | that we've just manipulated the landing pads since then. |
3872 | ||
3873 | Preserve regions with landing pads and regions that prevent | |
3874 | exceptions from propagating further, even if these regions | |
3875 | are not reachable. */ | |
1d65f45c RH |
3876 | |
3877 | static void | |
3878 | remove_unreachable_handlers_no_lp (void) | |
3879 | { | |
d273b176 | 3880 | eh_region region; |
1a47f99c | 3881 | sbitmap r_reachable; |
d273b176 | 3882 | unsigned i; |
1a47f99c | 3883 | |
d273b176 | 3884 | mark_reachable_handlers (&r_reachable, /*lp_reachablep=*/NULL); |
1a47f99c | 3885 | |
d273b176 | 3886 | FOR_EACH_VEC_SAFE_ELT (cfun->eh->region_array, i, region) |
1a47f99c | 3887 | { |
d273b176 SB |
3888 | if (! region) |
3889 | continue; | |
3890 | ||
3891 | if (region->landing_pads != NULL | |
3892 | || region->type == ERT_MUST_NOT_THROW) | |
3893 | bitmap_set_bit (r_reachable, region->index); | |
3894 | ||
3895 | if (dump_file | |
3896 | && !bitmap_bit_p (r_reachable, region->index)) | |
3897 | fprintf (dump_file, | |
3898 | "Removing unreachable region %d\n", | |
3899 | region->index); | |
1a47f99c | 3900 | } |
1d65f45c | 3901 | |
d273b176 | 3902 | remove_unreachable_eh_regions (r_reachable); |
1a47f99c MM |
3903 | |
3904 | sbitmap_free (r_reachable); | |
4e6d1743 JH |
3905 | } |
3906 | ||
1d65f45c RH |
3907 | /* Undo critical edge splitting on an EH landing pad. Earlier, we |
3908 | optimisticaly split all sorts of edges, including EH edges. The | |
3909 | optimization passes in between may not have needed them; if not, | |
3910 | we should undo the split. | |
3911 | ||
3912 | Recognize this case by having one EH edge incoming to the BB and | |
3913 | one normal edge outgoing; BB should be empty apart from the | |
3914 | post_landing_pad label. | |
3915 | ||
3916 | Note that this is slightly different from the empty handler case | |
3917 | handled by cleanup_empty_eh, in that the actual handler may yet | |
3918 | have actual code but the landing pad has been separated from the | |
3919 | handler. As such, cleanup_empty_eh relies on this transformation | |
3920 | having been done first. */ | |
a8da523f JH |
3921 | |
3922 | static bool | |
1d65f45c | 3923 | unsplit_eh (eh_landing_pad lp) |
a8da523f | 3924 | { |
1d65f45c RH |
3925 | basic_block bb = label_to_block (lp->post_landing_pad); |
3926 | gimple_stmt_iterator gsi; | |
3927 | edge e_in, e_out; | |
3928 | ||
3929 | /* Quickly check the edge counts on BB for singularity. */ | |
f223bb13 | 3930 | if (!single_pred_p (bb) || !single_succ_p (bb)) |
1d65f45c | 3931 | return false; |
f223bb13 JJ |
3932 | e_in = single_pred_edge (bb); |
3933 | e_out = single_succ_edge (bb); | |
a8da523f | 3934 | |
1d65f45c RH |
3935 | /* Input edge must be EH and output edge must be normal. */ |
3936 | if ((e_in->flags & EDGE_EH) == 0 || (e_out->flags & EDGE_EH) != 0) | |
3937 | return false; | |
3938 | ||
3333cd50 RG |
3939 | /* The block must be empty except for the labels and debug insns. */ |
3940 | gsi = gsi_after_labels (bb); | |
3941 | if (!gsi_end_p (gsi) && is_gimple_debug (gsi_stmt (gsi))) | |
3942 | gsi_next_nondebug (&gsi); | |
3943 | if (!gsi_end_p (gsi)) | |
1d65f45c RH |
3944 | return false; |
3945 | ||
3946 | /* The destination block must not already have a landing pad | |
3947 | for a different region. */ | |
3948 | for (gsi = gsi_start_bb (e_out->dest); !gsi_end_p (gsi); gsi_next (&gsi)) | |
a8da523f | 3949 | { |
1d65f45c RH |
3950 | gimple stmt = gsi_stmt (gsi); |
3951 | tree lab; | |
3952 | int lp_nr; | |
a8da523f | 3953 | |
1d65f45c RH |
3954 | if (gimple_code (stmt) != GIMPLE_LABEL) |
3955 | break; | |
3956 | lab = gimple_label_label (stmt); | |
3957 | lp_nr = EH_LANDING_PAD_NR (lab); | |
3958 | if (lp_nr && get_eh_region_from_lp_number (lp_nr) != lp->region) | |
3959 | return false; | |
3960 | } | |
a8da523f | 3961 | |
f8fd49b5 RH |
3962 | /* The new destination block must not already be a destination of |
3963 | the source block, lest we merge fallthru and eh edges and get | |
3964 | all sorts of confused. */ | |
3965 | if (find_edge (e_in->src, e_out->dest)) | |
3966 | return false; | |
3967 | ||
d6063d7f RH |
3968 | /* ??? We can get degenerate phis due to cfg cleanups. I would have |
3969 | thought this should have been cleaned up by a phicprop pass, but | |
3970 | that doesn't appear to handle virtuals. Propagate by hand. */ | |
3971 | if (!gimple_seq_empty_p (phi_nodes (bb))) | |
3972 | { | |
3973 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); ) | |
3974 | { | |
3975 | gimple use_stmt, phi = gsi_stmt (gsi); | |
3976 | tree lhs = gimple_phi_result (phi); | |
3977 | tree rhs = gimple_phi_arg_def (phi, 0); | |
3978 | use_operand_p use_p; | |
3979 | imm_use_iterator iter; | |
3980 | ||
3981 | FOR_EACH_IMM_USE_STMT (use_stmt, iter, lhs) | |
3982 | { | |
3983 | FOR_EACH_IMM_USE_ON_STMT (use_p, iter) | |
3984 | SET_USE (use_p, rhs); | |
3985 | } | |
3986 | ||
3987 | if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (lhs)) | |
3988 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI (rhs) = 1; | |
3989 | ||
3990 | remove_phi_node (&gsi, true); | |
3991 | } | |
3992 | } | |
496a4ef5 | 3993 | |
1d65f45c RH |
3994 | if (dump_file && (dump_flags & TDF_DETAILS)) |
3995 | fprintf (dump_file, "Unsplit EH landing pad %d to block %i.\n", | |
3996 | lp->index, e_out->dest->index); | |
3997 | ||
3998 | /* Redirect the edge. Since redirect_eh_edge_1 expects to be moving | |
3999 | a successor edge, humor it. But do the real CFG change with the | |
4000 | predecessor of E_OUT in order to preserve the ordering of arguments | |
4001 | to the PHI nodes in E_OUT->DEST. */ | |
4002 | redirect_eh_edge_1 (e_in, e_out->dest, false); | |
4003 | redirect_edge_pred (e_out, e_in->src); | |
4004 | e_out->flags = e_in->flags; | |
4005 | e_out->probability = e_in->probability; | |
4006 | e_out->count = e_in->count; | |
4007 | remove_edge (e_in); | |
496a4ef5 | 4008 | |
1d65f45c RH |
4009 | return true; |
4010 | } | |
496a4ef5 | 4011 | |
1d65f45c | 4012 | /* Examine each landing pad block and see if it matches unsplit_eh. */ |
496a4ef5 | 4013 | |
1d65f45c RH |
4014 | static bool |
4015 | unsplit_all_eh (void) | |
4016 | { | |
4017 | bool changed = false; | |
4018 | eh_landing_pad lp; | |
4019 | int i; | |
496a4ef5 | 4020 | |
9771b263 | 4021 | for (i = 1; vec_safe_iterate (cfun->eh->lp_array, i, &lp); ++i) |
1d65f45c RH |
4022 | if (lp) |
4023 | changed |= unsplit_eh (lp); | |
4024 | ||
4025 | return changed; | |
4026 | } | |
4027 | ||
4028 | /* A subroutine of cleanup_empty_eh. Redirect all EH edges incoming | |
4029 | to OLD_BB to NEW_BB; return true on success, false on failure. | |
4030 | ||
4031 | OLD_BB_OUT is the edge into NEW_BB from OLD_BB, so if we miss any | |
4032 | PHI variables from OLD_BB we can pick them up from OLD_BB_OUT. | |
4033 | Virtual PHIs may be deleted and marked for renaming. */ | |
4034 | ||
4035 | static bool | |
4036 | cleanup_empty_eh_merge_phis (basic_block new_bb, basic_block old_bb, | |
d6063d7f | 4037 | edge old_bb_out, bool change_region) |
1d65f45c RH |
4038 | { |
4039 | gimple_stmt_iterator ngsi, ogsi; | |
4040 | edge_iterator ei; | |
4041 | edge e; | |
1d65f45c RH |
4042 | bitmap ophi_handled; |
4043 | ||
336ead04 JJ |
4044 | /* The destination block must not be a regular successor for any |
4045 | of the preds of the landing pad. Thus, avoid turning | |
4046 | <..> | |
4047 | | \ EH | |
4048 | | <..> | |
4049 | | / | |
4050 | <..> | |
4051 | into | |
4052 | <..> | |
4053 | | | EH | |
4054 | <..> | |
4055 | which CFG verification would choke on. See PR45172 and PR51089. */ | |
4056 | FOR_EACH_EDGE (e, ei, old_bb->preds) | |
4057 | if (find_edge (e->src, new_bb)) | |
4058 | return false; | |
4059 | ||
1d65f45c RH |
4060 | FOR_EACH_EDGE (e, ei, old_bb->preds) |
4061 | redirect_edge_var_map_clear (e); | |
4062 | ||
4063 | ophi_handled = BITMAP_ALLOC (NULL); | |
1d65f45c RH |
4064 | |
4065 | /* First, iterate through the PHIs on NEW_BB and set up the edge_var_map | |
4066 | for the edges we're going to move. */ | |
4067 | for (ngsi = gsi_start_phis (new_bb); !gsi_end_p (ngsi); gsi_next (&ngsi)) | |
4068 | { | |
4069 | gimple ophi, nphi = gsi_stmt (ngsi); | |
4070 | tree nresult, nop; | |
4071 | ||
4072 | nresult = gimple_phi_result (nphi); | |
4073 | nop = gimple_phi_arg_def (nphi, old_bb_out->dest_idx); | |
4074 | ||
4075 | /* Find the corresponding PHI in OLD_BB so we can forward-propagate | |
4076 | the source ssa_name. */ | |
4077 | ophi = NULL; | |
4078 | for (ogsi = gsi_start_phis (old_bb); !gsi_end_p (ogsi); gsi_next (&ogsi)) | |
4079 | { | |
4080 | ophi = gsi_stmt (ogsi); | |
4081 | if (gimple_phi_result (ophi) == nop) | |
4082 | break; | |
4083 | ophi = NULL; | |
a3710436 | 4084 | } |
496a4ef5 | 4085 | |
1d65f45c RH |
4086 | /* If we did find the corresponding PHI, copy those inputs. */ |
4087 | if (ophi) | |
a8da523f | 4088 | { |
3ffe07e1 JJ |
4089 | /* If NOP is used somewhere else beyond phis in new_bb, give up. */ |
4090 | if (!has_single_use (nop)) | |
4091 | { | |
4092 | imm_use_iterator imm_iter; | |
4093 | use_operand_p use_p; | |
4094 | ||
4095 | FOR_EACH_IMM_USE_FAST (use_p, imm_iter, nop) | |
4096 | { | |
4097 | if (!gimple_debug_bind_p (USE_STMT (use_p)) | |
4098 | && (gimple_code (USE_STMT (use_p)) != GIMPLE_PHI | |
4099 | || gimple_bb (USE_STMT (use_p)) != new_bb)) | |
4100 | goto fail; | |
4101 | } | |
4102 | } | |
1d65f45c RH |
4103 | bitmap_set_bit (ophi_handled, SSA_NAME_VERSION (nop)); |
4104 | FOR_EACH_EDGE (e, ei, old_bb->preds) | |
496a4ef5 | 4105 | { |
1d65f45c RH |
4106 | location_t oloc; |
4107 | tree oop; | |
4108 | ||
4109 | if ((e->flags & EDGE_EH) == 0) | |
4110 | continue; | |
4111 | oop = gimple_phi_arg_def (ophi, e->dest_idx); | |
4112 | oloc = gimple_phi_arg_location (ophi, e->dest_idx); | |
9e227d60 | 4113 | redirect_edge_var_map_add (e, nresult, oop, oloc); |
496a4ef5 | 4114 | } |
1d65f45c | 4115 | } |
d90e76d4 | 4116 | /* If we didn't find the PHI, if it's a real variable or a VOP, we know |
1d65f45c RH |
4117 | from the fact that OLD_BB is tree_empty_eh_handler_p that the |
4118 | variable is unchanged from input to the block and we can simply | |
4119 | re-use the input to NEW_BB from the OLD_BB_OUT edge. */ | |
4120 | else | |
4121 | { | |
4122 | location_t nloc | |
4123 | = gimple_phi_arg_location (nphi, old_bb_out->dest_idx); | |
4124 | FOR_EACH_EDGE (e, ei, old_bb->preds) | |
9e227d60 | 4125 | redirect_edge_var_map_add (e, nresult, nop, nloc); |
1d65f45c RH |
4126 | } |
4127 | } | |
4128 | ||
4129 | /* Second, verify that all PHIs from OLD_BB have been handled. If not, | |
4130 | we don't know what values from the other edges into NEW_BB to use. */ | |
4131 | for (ogsi = gsi_start_phis (old_bb); !gsi_end_p (ogsi); gsi_next (&ogsi)) | |
4132 | { | |
4133 | gimple ophi = gsi_stmt (ogsi); | |
4134 | tree oresult = gimple_phi_result (ophi); | |
4135 | if (!bitmap_bit_p (ophi_handled, SSA_NAME_VERSION (oresult))) | |
4136 | goto fail; | |
4137 | } | |
4138 | ||
1d65f45c RH |
4139 | /* Finally, move the edges and update the PHIs. */ |
4140 | for (ei = ei_start (old_bb->preds); (e = ei_safe_edge (ei)); ) | |
4141 | if (e->flags & EDGE_EH) | |
4142 | { | |
efa26eaa RG |
4143 | /* ??? CFG manipluation routines do not try to update loop |
4144 | form on edge redirection. Do so manually here for now. */ | |
4145 | /* If we redirect a loop entry or latch edge that will either create | |
4146 | a multiple entry loop or rotate the loop. If the loops merge | |
4147 | we may have created a loop with multiple latches. | |
4148 | All of this isn't easily fixed thus cancel the affected loop | |
4149 | and mark the other loop as possibly having multiple latches. */ | |
4150 | if (current_loops | |
4151 | && e->dest == e->dest->loop_father->header) | |
4152 | { | |
4153 | e->dest->loop_father->header = NULL; | |
4154 | e->dest->loop_father->latch = NULL; | |
4155 | new_bb->loop_father->latch = NULL; | |
4156 | loops_state_set (LOOPS_NEED_FIXUP|LOOPS_MAY_HAVE_MULTIPLE_LATCHES); | |
4157 | } | |
d6063d7f | 4158 | redirect_eh_edge_1 (e, new_bb, change_region); |
1d65f45c RH |
4159 | redirect_edge_succ (e, new_bb); |
4160 | flush_pending_stmts (e); | |
4161 | } | |
4162 | else | |
4163 | ei_next (&ei); | |
4e6d1743 | 4164 | |
1d65f45c | 4165 | BITMAP_FREE (ophi_handled); |
1d65f45c RH |
4166 | return true; |
4167 | ||
4168 | fail: | |
4169 | FOR_EACH_EDGE (e, ei, old_bb->preds) | |
4170 | redirect_edge_var_map_clear (e); | |
4171 | BITMAP_FREE (ophi_handled); | |
1d65f45c RH |
4172 | return false; |
4173 | } | |
4174 | ||
4175 | /* A subroutine of cleanup_empty_eh. Move a landing pad LP from its | |
4176 | old region to NEW_REGION at BB. */ | |
4177 | ||
4178 | static void | |
4179 | cleanup_empty_eh_move_lp (basic_block bb, edge e_out, | |
4180 | eh_landing_pad lp, eh_region new_region) | |
4181 | { | |
4182 | gimple_stmt_iterator gsi; | |
4183 | eh_landing_pad *pp; | |
4184 | ||
4185 | for (pp = &lp->region->landing_pads; *pp != lp; pp = &(*pp)->next_lp) | |
4186 | continue; | |
4187 | *pp = lp->next_lp; | |
4188 | ||
4189 | lp->region = new_region; | |
4190 | lp->next_lp = new_region->landing_pads; | |
4191 | new_region->landing_pads = lp; | |
4192 | ||
4193 | /* Delete the RESX that was matched within the empty handler block. */ | |
4194 | gsi = gsi_last_bb (bb); | |
3d3f2249 | 4195 | unlink_stmt_vdef (gsi_stmt (gsi)); |
1d65f45c RH |
4196 | gsi_remove (&gsi, true); |
4197 | ||
4198 | /* Clean up E_OUT for the fallthru. */ | |
4199 | e_out->flags = (e_out->flags & ~EDGE_EH) | EDGE_FALLTHRU; | |
4200 | e_out->probability = REG_BR_PROB_BASE; | |
4201 | } | |
4202 | ||
4203 | /* A subroutine of cleanup_empty_eh. Handle more complex cases of | |
b8698a0f | 4204 | unsplitting than unsplit_eh was prepared to handle, e.g. when |
1d65f45c RH |
4205 | multiple incoming edges and phis are involved. */ |
4206 | ||
4207 | static bool | |
d6063d7f | 4208 | cleanup_empty_eh_unsplit (basic_block bb, edge e_out, eh_landing_pad lp) |
1d65f45c RH |
4209 | { |
4210 | gimple_stmt_iterator gsi; | |
1d65f45c RH |
4211 | tree lab; |
4212 | ||
4213 | /* We really ought not have totally lost everything following | |
4214 | a landing pad label. Given that BB is empty, there had better | |
4215 | be a successor. */ | |
4216 | gcc_assert (e_out != NULL); | |
4217 | ||
d6063d7f RH |
4218 | /* The destination block must not already have a landing pad |
4219 | for a different region. */ | |
1d65f45c RH |
4220 | lab = NULL; |
4221 | for (gsi = gsi_start_bb (e_out->dest); !gsi_end_p (gsi); gsi_next (&gsi)) | |
4222 | { | |
4223 | gimple stmt = gsi_stmt (gsi); | |
d6063d7f RH |
4224 | int lp_nr; |
4225 | ||
1d65f45c RH |
4226 | if (gimple_code (stmt) != GIMPLE_LABEL) |
4227 | break; | |
4228 | lab = gimple_label_label (stmt); | |
d6063d7f RH |
4229 | lp_nr = EH_LANDING_PAD_NR (lab); |
4230 | if (lp_nr && get_eh_region_from_lp_number (lp_nr) != lp->region) | |
4231 | return false; | |
1d65f45c | 4232 | } |
1d65f45c RH |
4233 | |
4234 | /* Attempt to move the PHIs into the successor block. */ | |
d6063d7f | 4235 | if (cleanup_empty_eh_merge_phis (e_out->dest, bb, e_out, false)) |
1d65f45c RH |
4236 | { |
4237 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
4238 | fprintf (dump_file, | |
d6063d7f RH |
4239 | "Unsplit EH landing pad %d to block %i " |
4240 | "(via cleanup_empty_eh).\n", | |
4241 | lp->index, e_out->dest->index); | |
1d65f45c RH |
4242 | return true; |
4243 | } | |
4244 | ||
4245 | return false; | |
4246 | } | |
4247 | ||
afaaa67d JJ |
4248 | /* Return true if edge E_FIRST is part of an empty infinite loop |
4249 | or leads to such a loop through a series of single successor | |
4250 | empty bbs. */ | |
4251 | ||
4252 | static bool | |
4253 | infinite_empty_loop_p (edge e_first) | |
4254 | { | |
4255 | bool inf_loop = false; | |
4256 | edge e; | |
4257 | ||
4258 | if (e_first->dest == e_first->src) | |
4259 | return true; | |
4260 | ||
4261 | e_first->src->aux = (void *) 1; | |
4262 | for (e = e_first; single_succ_p (e->dest); e = single_succ_edge (e->dest)) | |
4263 | { | |
4264 | gimple_stmt_iterator gsi; | |
4265 | if (e->dest->aux) | |
4266 | { | |
4267 | inf_loop = true; | |
4268 | break; | |
4269 | } | |
4270 | e->dest->aux = (void *) 1; | |
4271 | gsi = gsi_after_labels (e->dest); | |
4272 | if (!gsi_end_p (gsi) && is_gimple_debug (gsi_stmt (gsi))) | |
4273 | gsi_next_nondebug (&gsi); | |
4274 | if (!gsi_end_p (gsi)) | |
4275 | break; | |
4276 | } | |
4277 | e_first->src->aux = NULL; | |
4278 | for (e = e_first; e->dest->aux; e = single_succ_edge (e->dest)) | |
4279 | e->dest->aux = NULL; | |
4280 | ||
4281 | return inf_loop; | |
4282 | } | |
4283 | ||
1d65f45c RH |
4284 | /* Examine the block associated with LP to determine if it's an empty |
4285 | handler for its EH region. If so, attempt to redirect EH edges to | |
4286 | an outer region. Return true the CFG was updated in any way. This | |
4287 | is similar to jump forwarding, just across EH edges. */ | |
4288 | ||
4289 | static bool | |
4290 | cleanup_empty_eh (eh_landing_pad lp) | |
4291 | { | |
4292 | basic_block bb = label_to_block (lp->post_landing_pad); | |
4293 | gimple_stmt_iterator gsi; | |
4294 | gimple resx; | |
4295 | eh_region new_region; | |
4296 | edge_iterator ei; | |
4297 | edge e, e_out; | |
4298 | bool has_non_eh_pred; | |
81bfd197 | 4299 | bool ret = false; |
1d65f45c RH |
4300 | int new_lp_nr; |
4301 | ||
4302 | /* There can be zero or one edges out of BB. This is the quickest test. */ | |
4303 | switch (EDGE_COUNT (bb->succs)) | |
4304 | { | |
4305 | case 0: | |
4306 | e_out = NULL; | |
4307 | break; | |
4308 | case 1: | |
f223bb13 | 4309 | e_out = single_succ_edge (bb); |
1d65f45c RH |
4310 | break; |
4311 | default: | |
4312 | return false; | |
4313 | } | |
81bfd197 MM |
4314 | |
4315 | resx = last_stmt (bb); | |
4316 | if (resx && is_gimple_resx (resx)) | |
4317 | { | |
4318 | if (stmt_can_throw_external (resx)) | |
4319 | optimize_clobbers (bb); | |
4320 | else if (sink_clobbers (bb)) | |
4321 | ret = true; | |
4322 | } | |
4323 | ||
1d65f45c RH |
4324 | gsi = gsi_after_labels (bb); |
4325 | ||
4326 | /* Make sure to skip debug statements. */ | |
4327 | if (!gsi_end_p (gsi) && is_gimple_debug (gsi_stmt (gsi))) | |
4328 | gsi_next_nondebug (&gsi); | |
4329 | ||
4330 | /* If the block is totally empty, look for more unsplitting cases. */ | |
4331 | if (gsi_end_p (gsi)) | |
0d228a52 RG |
4332 | { |
4333 | /* For the degenerate case of an infinite loop bail out. */ | |
afaaa67d | 4334 | if (infinite_empty_loop_p (e_out)) |
81bfd197 | 4335 | return ret; |
0d228a52 | 4336 | |
81bfd197 | 4337 | return ret | cleanup_empty_eh_unsplit (bb, e_out, lp); |
0d228a52 | 4338 | } |
1d65f45c | 4339 | |
1ee0d660 EB |
4340 | /* The block should consist only of a single RESX statement, modulo a |
4341 | preceding call to __builtin_stack_restore if there is no outgoing | |
4342 | edge, since the call can be eliminated in this case. */ | |
1d65f45c | 4343 | resx = gsi_stmt (gsi); |
1ee0d660 EB |
4344 | if (!e_out && gimple_call_builtin_p (resx, BUILT_IN_STACK_RESTORE)) |
4345 | { | |
4346 | gsi_next (&gsi); | |
4347 | resx = gsi_stmt (gsi); | |
4348 | } | |
1d65f45c | 4349 | if (!is_gimple_resx (resx)) |
81bfd197 | 4350 | return ret; |
1d65f45c RH |
4351 | gcc_assert (gsi_one_before_end_p (gsi)); |
4352 | ||
4353 | /* Determine if there are non-EH edges, or resx edges into the handler. */ | |
4354 | has_non_eh_pred = false; | |
4355 | FOR_EACH_EDGE (e, ei, bb->preds) | |
4356 | if (!(e->flags & EDGE_EH)) | |
4357 | has_non_eh_pred = true; | |
4358 | ||
4359 | /* Find the handler that's outer of the empty handler by looking at | |
4360 | where the RESX instruction was vectored. */ | |
4361 | new_lp_nr = lookup_stmt_eh_lp (resx); | |
4362 | new_region = get_eh_region_from_lp_number (new_lp_nr); | |
4363 | ||
4364 | /* If there's no destination region within the current function, | |
4365 | redirection is trivial via removing the throwing statements from | |
4366 | the EH region, removing the EH edges, and allowing the block | |
4367 | to go unreachable. */ | |
4368 | if (new_region == NULL) | |
4369 | { | |
4370 | gcc_assert (e_out == NULL); | |
4371 | for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); ) | |
4372 | if (e->flags & EDGE_EH) | |
4373 | { | |
4374 | gimple stmt = last_stmt (e->src); | |
4375 | remove_stmt_from_eh_lp (stmt); | |
4376 | remove_edge (e); | |
4377 | } | |
4378 | else | |
4379 | ei_next (&ei); | |
4380 | goto succeed; | |
4381 | } | |
4382 | ||
4383 | /* If the destination region is a MUST_NOT_THROW, allow the runtime | |
4384 | to handle the abort and allow the blocks to go unreachable. */ | |
4385 | if (new_region->type == ERT_MUST_NOT_THROW) | |
4386 | { | |
4387 | for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); ) | |
4388 | if (e->flags & EDGE_EH) | |
4389 | { | |
4390 | gimple stmt = last_stmt (e->src); | |
4391 | remove_stmt_from_eh_lp (stmt); | |
4392 | add_stmt_to_eh_lp (stmt, new_lp_nr); | |
4393 | remove_edge (e); | |
4394 | } | |
4395 | else | |
4396 | ei_next (&ei); | |
4397 | goto succeed; | |
4398 | } | |
4399 | ||
4400 | /* Try to redirect the EH edges and merge the PHIs into the destination | |
4401 | landing pad block. If the merge succeeds, we'll already have redirected | |
4402 | all the EH edges. The handler itself will go unreachable if there were | |
4403 | no normal edges. */ | |
d6063d7f | 4404 | if (cleanup_empty_eh_merge_phis (e_out->dest, bb, e_out, true)) |
1d65f45c RH |
4405 | goto succeed; |
4406 | ||
4407 | /* Finally, if all input edges are EH edges, then we can (potentially) | |
4408 | reduce the number of transfers from the runtime by moving the landing | |
4409 | pad from the original region to the new region. This is a win when | |
4410 | we remove the last CLEANUP region along a particular exception | |
4411 | propagation path. Since nothing changes except for the region with | |
4412 | which the landing pad is associated, the PHI nodes do not need to be | |
4413 | adjusted at all. */ | |
4414 | if (!has_non_eh_pred) | |
4415 | { | |
4416 | cleanup_empty_eh_move_lp (bb, e_out, lp, new_region); | |
4417 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
4418 | fprintf (dump_file, "Empty EH handler %i moved to EH region %i.\n", | |
4419 | lp->index, new_region->index); | |
4420 | ||
4421 | /* ??? The CFG didn't change, but we may have rendered the | |
4422 | old EH region unreachable. Trigger a cleanup there. */ | |
a8da523f JH |
4423 | return true; |
4424 | } | |
1d65f45c | 4425 | |
81bfd197 | 4426 | return ret; |
1d65f45c RH |
4427 | |
4428 | succeed: | |
4429 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
4430 | fprintf (dump_file, "Empty EH handler %i removed.\n", lp->index); | |
4431 | remove_eh_landing_pad (lp); | |
4432 | return true; | |
a8da523f JH |
4433 | } |
4434 | ||
1d65f45c RH |
4435 | /* Do a post-order traversal of the EH region tree. Examine each |
4436 | post_landing_pad block and see if we can eliminate it as empty. */ | |
4437 | ||
4438 | static bool | |
4439 | cleanup_all_empty_eh (void) | |
4440 | { | |
4441 | bool changed = false; | |
4442 | eh_landing_pad lp; | |
4443 | int i; | |
4444 | ||
9771b263 | 4445 | for (i = 1; vec_safe_iterate (cfun->eh->lp_array, i, &lp); ++i) |
1d65f45c RH |
4446 | if (lp) |
4447 | changed |= cleanup_empty_eh (lp); | |
4448 | ||
4449 | return changed; | |
4450 | } | |
a8da523f JH |
4451 | |
4452 | /* Perform cleanups and lowering of exception handling | |
4453 | 1) cleanups regions with handlers doing nothing are optimized out | |
4454 | 2) MUST_NOT_THROW regions that became dead because of 1) are optimized out | |
4455 | 3) Info about regions that are containing instructions, and regions | |
4456 | reachable via local EH edges is collected | |
c0d18c6c | 4457 | 4) Eh tree is pruned for regions no longer necessary. |
1d65f45c RH |
4458 | |
4459 | TODO: Push MUST_NOT_THROW regions to the root of the EH tree. | |
4460 | Unify those that have the same failure decl and locus. | |
4461 | */ | |
a8da523f JH |
4462 | |
4463 | static unsigned int | |
66a3e339 | 4464 | execute_cleanup_eh_1 (void) |
a8da523f | 4465 | { |
1d65f45c RH |
4466 | /* Do this first: unsplit_all_eh and cleanup_all_empty_eh can die |
4467 | looking up unreachable landing pads. */ | |
4468 | remove_unreachable_handlers (); | |
a8da523f | 4469 | |
1d65f45c RH |
4470 | /* Watch out for the region tree vanishing due to all unreachable. */ |
4471 | if (cfun->eh->region_tree && optimize) | |
a8da523f | 4472 | { |
1d65f45c | 4473 | bool changed = false; |
a8da523f | 4474 | |
1d65f45c RH |
4475 | changed |= unsplit_all_eh (); |
4476 | changed |= cleanup_all_empty_eh (); | |
4477 | ||
4478 | if (changed) | |
6d07ad98 JH |
4479 | { |
4480 | free_dominance_info (CDI_DOMINATORS); | |
4481 | free_dominance_info (CDI_POST_DOMINATORS); | |
a8da523f | 4482 | |
1d65f45c RH |
4483 | /* We delayed all basic block deletion, as we may have performed |
4484 | cleanups on EH edges while non-EH edges were still present. */ | |
4485 | delete_unreachable_blocks (); | |
a8da523f | 4486 | |
1d65f45c RH |
4487 | /* We manipulated the landing pads. Remove any region that no |
4488 | longer has a landing pad. */ | |
4489 | remove_unreachable_handlers_no_lp (); | |
4490 | ||
4491 | return TODO_cleanup_cfg | TODO_update_ssa_only_virtuals; | |
4492 | } | |
a8da523f JH |
4493 | } |
4494 | ||
1d65f45c RH |
4495 | return 0; |
4496 | } | |
4497 | ||
66a3e339 RG |
4498 | static unsigned int |
4499 | execute_cleanup_eh (void) | |
4500 | { | |
1f9081d1 | 4501 | int ret = execute_cleanup_eh_1 (); |
66a3e339 RG |
4502 | |
4503 | /* If the function no longer needs an EH personality routine | |
4504 | clear it. This exposes cross-language inlining opportunities | |
4505 | and avoids references to a never defined personality routine. */ | |
4506 | if (DECL_FUNCTION_PERSONALITY (current_function_decl) | |
4507 | && function_needs_eh_personality (cfun) != eh_personality_lang) | |
4508 | DECL_FUNCTION_PERSONALITY (current_function_decl) = NULL_TREE; | |
4509 | ||
4510 | return ret; | |
4511 | } | |
4512 | ||
1d65f45c RH |
4513 | static bool |
4514 | gate_cleanup_eh (void) | |
4515 | { | |
1f9081d1 | 4516 | return cfun->eh != NULL && cfun->eh->region_tree != NULL; |
a8da523f JH |
4517 | } |
4518 | ||
27a4cd48 DM |
4519 | namespace { |
4520 | ||
4521 | const pass_data pass_data_cleanup_eh = | |
4522 | { | |
4523 | GIMPLE_PASS, /* type */ | |
4524 | "ehcleanup", /* name */ | |
4525 | OPTGROUP_NONE, /* optinfo_flags */ | |
4526 | true, /* has_gate */ | |
4527 | true, /* has_execute */ | |
4528 | TV_TREE_EH, /* tv_id */ | |
4529 | PROP_gimple_lcf, /* properties_required */ | |
4530 | 0, /* properties_provided */ | |
4531 | 0, /* properties_destroyed */ | |
4532 | 0, /* todo_flags_start */ | |
4533 | TODO_verify_ssa, /* todo_flags_finish */ | |
a8da523f | 4534 | }; |
27a4cd48 DM |
4535 | |
4536 | class pass_cleanup_eh : public gimple_opt_pass | |
4537 | { | |
4538 | public: | |
4539 | pass_cleanup_eh(gcc::context *ctxt) | |
4540 | : gimple_opt_pass(pass_data_cleanup_eh, ctxt) | |
4541 | {} | |
4542 | ||
4543 | /* opt_pass methods: */ | |
4544 | opt_pass * clone () { return new pass_cleanup_eh (ctxt_); } | |
4545 | bool gate () { return gate_cleanup_eh (); } | |
4546 | unsigned int execute () { return execute_cleanup_eh (); } | |
4547 | ||
4548 | }; // class pass_cleanup_eh | |
4549 | ||
4550 | } // anon namespace | |
4551 | ||
4552 | gimple_opt_pass * | |
4553 | make_pass_cleanup_eh (gcc::context *ctxt) | |
4554 | { | |
4555 | return new pass_cleanup_eh (ctxt); | |
4556 | } | |
1d65f45c RH |
4557 | \f |
4558 | /* Verify that BB containing STMT as the last statement, has precisely the | |
4559 | edge that make_eh_edges would create. */ | |
4560 | ||
24e47c76 | 4561 | DEBUG_FUNCTION bool |
1d65f45c RH |
4562 | verify_eh_edges (gimple stmt) |
4563 | { | |
4564 | basic_block bb = gimple_bb (stmt); | |
4565 | eh_landing_pad lp = NULL; | |
4566 | int lp_nr; | |
4567 | edge_iterator ei; | |
4568 | edge e, eh_edge; | |
4569 | ||
4570 | lp_nr = lookup_stmt_eh_lp (stmt); | |
4571 | if (lp_nr > 0) | |
4572 | lp = get_eh_landing_pad_from_number (lp_nr); | |
4573 | ||
4574 | eh_edge = NULL; | |
4575 | FOR_EACH_EDGE (e, ei, bb->succs) | |
4576 | { | |
4577 | if (e->flags & EDGE_EH) | |
4578 | { | |
4579 | if (eh_edge) | |
4580 | { | |
4581 | error ("BB %i has multiple EH edges", bb->index); | |
4582 | return true; | |
4583 | } | |
4584 | else | |
4585 | eh_edge = e; | |
4586 | } | |
4587 | } | |
4588 | ||
4589 | if (lp == NULL) | |
4590 | { | |
4591 | if (eh_edge) | |
4592 | { | |
4593 | error ("BB %i can not throw but has an EH edge", bb->index); | |
4594 | return true; | |
4595 | } | |
4596 | return false; | |
4597 | } | |
4598 | ||
4599 | if (!stmt_could_throw_p (stmt)) | |
4600 | { | |
4601 | error ("BB %i last statement has incorrectly set lp", bb->index); | |
4602 | return true; | |
4603 | } | |
4604 | ||
4605 | if (eh_edge == NULL) | |
4606 | { | |
4607 | error ("BB %i is missing an EH edge", bb->index); | |
4608 | return true; | |
4609 | } | |
4610 | ||
4611 | if (eh_edge->dest != label_to_block (lp->post_landing_pad)) | |
4612 | { | |
4613 | error ("Incorrect EH edge %i->%i", bb->index, eh_edge->dest->index); | |
4614 | return true; | |
4615 | } | |
4616 | ||
4617 | return false; | |
4618 | } | |
4619 | ||
4620 | /* Similarly, but handle GIMPLE_EH_DISPATCH specifically. */ | |
4621 | ||
24e47c76 | 4622 | DEBUG_FUNCTION bool |
1d65f45c RH |
4623 | verify_eh_dispatch_edge (gimple stmt) |
4624 | { | |
4625 | eh_region r; | |
4626 | eh_catch c; | |
4627 | basic_block src, dst; | |
4628 | bool want_fallthru = true; | |
4629 | edge_iterator ei; | |
4630 | edge e, fall_edge; | |
4631 | ||
4632 | r = get_eh_region_from_number (gimple_eh_dispatch_region (stmt)); | |
4633 | src = gimple_bb (stmt); | |
4634 | ||
4635 | FOR_EACH_EDGE (e, ei, src->succs) | |
4636 | gcc_assert (e->aux == NULL); | |
4637 | ||
4638 | switch (r->type) | |
4639 | { | |
4640 | case ERT_TRY: | |
4641 | for (c = r->u.eh_try.first_catch; c ; c = c->next_catch) | |
4642 | { | |
4643 | dst = label_to_block (c->label); | |
4644 | e = find_edge (src, dst); | |
4645 | if (e == NULL) | |
4646 | { | |
4647 | error ("BB %i is missing an edge", src->index); | |
4648 | return true; | |
4649 | } | |
4650 | e->aux = (void *)e; | |
4651 | ||
4652 | /* A catch-all handler doesn't have a fallthru. */ | |
4653 | if (c->type_list == NULL) | |
4654 | { | |
4655 | want_fallthru = false; | |
4656 | break; | |
4657 | } | |
4658 | } | |
4659 | break; | |
4660 | ||
4661 | case ERT_ALLOWED_EXCEPTIONS: | |
4662 | dst = label_to_block (r->u.allowed.label); | |
4663 | e = find_edge (src, dst); | |
4664 | if (e == NULL) | |
4665 | { | |
4666 | error ("BB %i is missing an edge", src->index); | |
4667 | return true; | |
4668 | } | |
4669 | e->aux = (void *)e; | |
4670 | break; | |
4671 | ||
4672 | default: | |
4673 | gcc_unreachable (); | |
4674 | } | |
4675 | ||
4676 | fall_edge = NULL; | |
4677 | FOR_EACH_EDGE (e, ei, src->succs) | |
4678 | { | |
4679 | if (e->flags & EDGE_FALLTHRU) | |
4680 | { | |
4681 | if (fall_edge != NULL) | |
4682 | { | |
4683 | error ("BB %i too many fallthru edges", src->index); | |
4684 | return true; | |
4685 | } | |
4686 | fall_edge = e; | |
4687 | } | |
4688 | else if (e->aux) | |
4689 | e->aux = NULL; | |
4690 | else | |
4691 | { | |
4692 | error ("BB %i has incorrect edge", src->index); | |
4693 | return true; | |
4694 | } | |
4695 | } | |
4696 | if ((fall_edge != NULL) ^ want_fallthru) | |
4697 | { | |
4698 | error ("BB %i has incorrect fallthru edge", src->index); | |
4699 | return true; | |
4700 | } | |
4701 | ||
4702 | return false; | |
4703 | } |