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