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