]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* SSA-PRE for trees. |
66647d44 | 2 | Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 |
939409af | 3 | Free Software Foundation, Inc. |
7e6eb623 | 4 | Contributed by Daniel Berlin <dan@dberlin.org> and Steven Bosscher |
b9c5e484 | 5 | <stevenb@suse.de> |
6de9cd9a DN |
6 | |
7 | This file is part of GCC. | |
8 | ||
9 | GCC is free software; you can redistribute it and/or modify | |
10 | it under the terms of the GNU General Public License as published by | |
9dcd6f09 | 11 | the Free Software Foundation; either version 3, or (at your option) |
6de9cd9a DN |
12 | any later version. |
13 | ||
14 | GCC is distributed in the hope that it will be useful, | |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
20 | along with GCC; see the file COPYING3. If not see |
21 | <http://www.gnu.org/licenses/>. */ | |
33c94679 | 22 | |
6de9cd9a DN |
23 | #include "config.h" |
24 | #include "system.h" | |
25 | #include "coretypes.h" | |
26 | #include "tm.h" | |
6de9cd9a DN |
27 | #include "ggc.h" |
28 | #include "tree.h" | |
6de9cd9a DN |
29 | #include "basic-block.h" |
30 | #include "diagnostic.h" | |
31 | #include "tree-inline.h" | |
32 | #include "tree-flow.h" | |
726a989a | 33 | #include "gimple.h" |
6de9cd9a DN |
34 | #include "tree-dump.h" |
35 | #include "timevar.h" | |
36 | #include "fibheap.h" | |
37 | #include "hashtab.h" | |
38 | #include "tree-iterator.h" | |
39 | #include "real.h" | |
40 | #include "alloc-pool.h" | |
5039610b | 41 | #include "obstack.h" |
6de9cd9a DN |
42 | #include "tree-pass.h" |
43 | #include "flags.h" | |
7e6eb623 DB |
44 | #include "bitmap.h" |
45 | #include "langhooks.h" | |
0fc6c492 | 46 | #include "cfgloop.h" |
89fb70a3 | 47 | #include "tree-ssa-sccvn.h" |
f0ed4cfb | 48 | #include "params.h" |
c9145754 | 49 | #include "dbgcnt.h" |
33c94679 | 50 | |
7e6eb623 | 51 | /* TODO: |
b9c5e484 | 52 | |
bdee7684 | 53 | 1. Avail sets can be shared by making an avail_find_leader that |
7e6eb623 DB |
54 | walks up the dominator tree and looks in those avail sets. |
55 | This might affect code optimality, it's unclear right now. | |
c90186eb | 56 | 2. Strength reduction can be performed by anticipating expressions |
7e6eb623 | 57 | we can repair later on. |
c90186eb | 58 | 3. We can do back-substitution or smarter value numbering to catch |
0fc6c492 | 59 | commutative expressions split up over multiple statements. |
b9c5e484 | 60 | */ |
7e6eb623 DB |
61 | |
62 | /* For ease of terminology, "expression node" in the below refers to | |
726a989a | 63 | every expression node but GIMPLE_ASSIGN, because GIMPLE_ASSIGNs |
07beea0d AH |
64 | represent the actual statement containing the expressions we care about, |
65 | and we cache the value number by putting it in the expression. */ | |
7e6eb623 DB |
66 | |
67 | /* Basic algorithm | |
b9c5e484 | 68 | |
56db793a DB |
69 | First we walk the statements to generate the AVAIL sets, the |
70 | EXP_GEN sets, and the tmp_gen sets. EXP_GEN sets represent the | |
71 | generation of values/expressions by a given block. We use them | |
72 | when computing the ANTIC sets. The AVAIL sets consist of | |
73 | SSA_NAME's that represent values, so we know what values are | |
74 | available in what blocks. AVAIL is a forward dataflow problem. In | |
75 | SSA, values are never killed, so we don't need a kill set, or a | |
76 | fixpoint iteration, in order to calculate the AVAIL sets. In | |
77 | traditional parlance, AVAIL sets tell us the downsafety of the | |
7e6eb623 | 78 | expressions/values. |
b9c5e484 | 79 | |
56db793a DB |
80 | Next, we generate the ANTIC sets. These sets represent the |
81 | anticipatable expressions. ANTIC is a backwards dataflow | |
d75dbccd | 82 | problem. An expression is anticipatable in a given block if it could |
56db793a DB |
83 | be generated in that block. This means that if we had to perform |
84 | an insertion in that block, of the value of that expression, we | |
85 | could. Calculating the ANTIC sets requires phi translation of | |
86 | expressions, because the flow goes backwards through phis. We must | |
87 | iterate to a fixpoint of the ANTIC sets, because we have a kill | |
88 | set. Even in SSA form, values are not live over the entire | |
89 | function, only from their definition point onwards. So we have to | |
90 | remove values from the ANTIC set once we go past the definition | |
91 | point of the leaders that make them up. | |
92 | compute_antic/compute_antic_aux performs this computation. | |
7e6eb623 DB |
93 | |
94 | Third, we perform insertions to make partially redundant | |
95 | expressions fully redundant. | |
96 | ||
97 | An expression is partially redundant (excluding partial | |
98 | anticipation) if: | |
99 | ||
100 | 1. It is AVAIL in some, but not all, of the predecessors of a | |
101 | given block. | |
102 | 2. It is ANTIC in all the predecessors. | |
103 | ||
104 | In order to make it fully redundant, we insert the expression into | |
105 | the predecessors where it is not available, but is ANTIC. | |
d75dbccd DB |
106 | |
107 | For the partial anticipation case, we only perform insertion if it | |
108 | is partially anticipated in some block, and fully available in all | |
109 | of the predecessors. | |
110 | ||
111 | insert/insert_aux/do_regular_insertion/do_partial_partial_insertion | |
112 | performs these steps. | |
7e6eb623 DB |
113 | |
114 | Fourth, we eliminate fully redundant expressions. | |
115 | This is a simple statement walk that replaces redundant | |
070b797d | 116 | calculations with the now available values. */ |
7e6eb623 DB |
117 | |
118 | /* Representations of value numbers: | |
119 | ||
c9145754 DB |
120 | Value numbers are represented by a representative SSA_NAME. We |
121 | will create fake SSA_NAME's in situations where we need a | |
122 | representative but do not have one (because it is a complex | |
123 | expression). In order to facilitate storing the value numbers in | |
124 | bitmaps, and keep the number of wasted SSA_NAME's down, we also | |
125 | associate a value_id with each value number, and create full blown | |
126 | ssa_name's only where we actually need them (IE in operands of | |
127 | existing expressions). | |
128 | ||
129 | Theoretically you could replace all the value_id's with | |
130 | SSA_NAME_VERSION, but this would allocate a large number of | |
131 | SSA_NAME's (which are each > 30 bytes) just to get a 4 byte number. | |
132 | It would also require an additional indirection at each point we | |
133 | use the value id. */ | |
7e6eb623 | 134 | |
b9c5e484 | 135 | /* Representation of expressions on value numbers: |
7e6eb623 | 136 | |
c9145754 DB |
137 | Expressions consisting of value numbers are represented the same |
138 | way as our VN internally represents them, with an additional | |
139 | "pre_expr" wrapping around them in order to facilitate storing all | |
140 | of the expressions in the same sets. */ | |
7e6eb623 | 141 | |
c9145754 | 142 | /* Representation of sets: |
7e6eb623 | 143 | |
c9145754 DB |
144 | The dataflow sets do not need to be sorted in any particular order |
145 | for the majority of their lifetime, are simply represented as two | |
146 | bitmaps, one that keeps track of values present in the set, and one | |
147 | that keeps track of expressions present in the set. | |
7e6eb623 | 148 | |
c9145754 DB |
149 | When we need them in topological order, we produce it on demand by |
150 | transforming the bitmap into an array and sorting it into topo | |
151 | order. */ | |
7e6eb623 | 152 | |
c9145754 DB |
153 | /* Type of expression, used to know which member of the PRE_EXPR union |
154 | is valid. */ | |
7e6eb623 | 155 | |
c9145754 DB |
156 | enum pre_expr_kind |
157 | { | |
158 | NAME, | |
159 | NARY, | |
160 | REFERENCE, | |
161 | CONSTANT | |
162 | }; | |
163 | ||
164 | typedef union pre_expr_union_d | |
165 | { | |
166 | tree name; | |
167 | tree constant; | |
168 | vn_nary_op_t nary; | |
169 | vn_reference_t reference; | |
170 | } pre_expr_union; | |
b9c5e484 | 171 | |
c9145754 DB |
172 | typedef struct pre_expr_d |
173 | { | |
174 | enum pre_expr_kind kind; | |
175 | unsigned int id; | |
176 | pre_expr_union u; | |
177 | } *pre_expr; | |
7e6eb623 | 178 | |
c9145754 DB |
179 | #define PRE_EXPR_NAME(e) (e)->u.name |
180 | #define PRE_EXPR_NARY(e) (e)->u.nary | |
181 | #define PRE_EXPR_REFERENCE(e) (e)->u.reference | |
182 | #define PRE_EXPR_CONSTANT(e) (e)->u.constant | |
7e6eb623 | 183 | |
c9145754 DB |
184 | static int |
185 | pre_expr_eq (const void *p1, const void *p2) | |
186 | { | |
187 | const struct pre_expr_d *e1 = (const struct pre_expr_d *) p1; | |
188 | const struct pre_expr_d *e2 = (const struct pre_expr_d *) p2; | |
7e6eb623 | 189 | |
c9145754 DB |
190 | if (e1->kind != e2->kind) |
191 | return false; | |
192 | ||
193 | switch (e1->kind) | |
194 | { | |
195 | case CONSTANT: | |
726a989a RB |
196 | return vn_constant_eq_with_type (PRE_EXPR_CONSTANT (e1), |
197 | PRE_EXPR_CONSTANT (e2)); | |
c9145754 DB |
198 | case NAME: |
199 | return PRE_EXPR_NAME (e1) == PRE_EXPR_NAME (e2); | |
200 | case NARY: | |
201 | return vn_nary_op_eq (PRE_EXPR_NARY (e1), PRE_EXPR_NARY (e2)); | |
202 | case REFERENCE: | |
203 | return vn_reference_eq (PRE_EXPR_REFERENCE (e1), | |
204 | PRE_EXPR_REFERENCE (e2)); | |
205 | default: | |
206 | abort(); | |
207 | } | |
208 | } | |
209 | ||
210 | static hashval_t | |
211 | pre_expr_hash (const void *p1) | |
212 | { | |
213 | const struct pre_expr_d *e = (const struct pre_expr_d *) p1; | |
214 | switch (e->kind) | |
215 | { | |
216 | case CONSTANT: | |
726a989a | 217 | return vn_hash_constant_with_type (PRE_EXPR_CONSTANT (e)); |
c9145754 | 218 | case NAME: |
85169114 | 219 | return iterative_hash_hashval_t (SSA_NAME_VERSION (PRE_EXPR_NAME (e)), 0); |
c9145754 | 220 | case NARY: |
85169114 | 221 | return PRE_EXPR_NARY (e)->hashcode; |
c9145754 | 222 | case REFERENCE: |
85169114 | 223 | return PRE_EXPR_REFERENCE (e)->hashcode; |
c9145754 DB |
224 | default: |
225 | abort (); | |
226 | } | |
227 | } | |
83737db2 | 228 | |
c5830edf | 229 | |
c9145754 DB |
230 | /* Next global expression id number. */ |
231 | static unsigned int next_expression_id; | |
070b797d | 232 | |
83737db2 | 233 | /* Mapping from expression to id number we can use in bitmap sets. */ |
c9145754 DB |
234 | DEF_VEC_P (pre_expr); |
235 | DEF_VEC_ALLOC_P (pre_expr, heap); | |
236 | static VEC(pre_expr, heap) *expressions; | |
237 | static htab_t expression_to_id; | |
81def1b7 | 238 | |
83737db2 DB |
239 | /* Allocate an expression id for EXPR. */ |
240 | ||
241 | static inline unsigned int | |
c9145754 | 242 | alloc_expression_id (pre_expr expr) |
6de9cd9a | 243 | { |
c9145754 | 244 | void **slot; |
83737db2 DB |
245 | /* Make sure we won't overflow. */ |
246 | gcc_assert (next_expression_id + 1 > next_expression_id); | |
c9145754 DB |
247 | expr->id = next_expression_id++; |
248 | VEC_safe_push (pre_expr, heap, expressions, expr); | |
249 | slot = htab_find_slot (expression_to_id, expr, INSERT); | |
250 | gcc_assert (!*slot); | |
251 | *slot = expr; | |
83737db2 DB |
252 | return next_expression_id - 1; |
253 | } | |
254 | ||
255 | /* Return the expression id for tree EXPR. */ | |
256 | ||
257 | static inline unsigned int | |
c9145754 DB |
258 | get_expression_id (const pre_expr expr) |
259 | { | |
260 | return expr->id; | |
261 | } | |
262 | ||
263 | static inline unsigned int | |
264 | lookup_expression_id (const pre_expr expr) | |
7e6eb623 | 265 | { |
c9145754 | 266 | void **slot; |
b71b4522 | 267 | |
c9145754 DB |
268 | slot = htab_find_slot (expression_to_id, expr, NO_INSERT); |
269 | if (!slot) | |
270 | return 0; | |
271 | return ((pre_expr)*slot)->id; | |
83737db2 | 272 | } |
b9c5e484 | 273 | |
83737db2 DB |
274 | /* Return the existing expression id for EXPR, or create one if one |
275 | does not exist yet. */ | |
b9c5e484 | 276 | |
83737db2 | 277 | static inline unsigned int |
c9145754 | 278 | get_or_alloc_expression_id (pre_expr expr) |
83737db2 | 279 | { |
c9145754 DB |
280 | unsigned int id = lookup_expression_id (expr); |
281 | if (id == 0) | |
83737db2 | 282 | return alloc_expression_id (expr); |
c9145754 | 283 | return expr->id = id; |
83737db2 DB |
284 | } |
285 | ||
286 | /* Return the expression that has expression id ID */ | |
287 | ||
c9145754 | 288 | static inline pre_expr |
83737db2 DB |
289 | expression_for_id (unsigned int id) |
290 | { | |
c9145754 | 291 | return VEC_index (pre_expr, expressions, id); |
c5830edf DB |
292 | } |
293 | ||
b71b4522 DB |
294 | /* Free the expression id field in all of our expressions, |
295 | and then destroy the expressions array. */ | |
296 | ||
297 | static void | |
298 | clear_expression_ids (void) | |
299 | { | |
c9145754 DB |
300 | VEC_free (pre_expr, heap, expressions); |
301 | } | |
b71b4522 | 302 | |
c9145754 DB |
303 | static alloc_pool pre_expr_pool; |
304 | ||
305 | /* Given an SSA_NAME NAME, get or create a pre_expr to represent it. */ | |
306 | ||
307 | static pre_expr | |
308 | get_or_alloc_expr_for_name (tree name) | |
309 | { | |
310 | pre_expr result = (pre_expr) pool_alloc (pre_expr_pool); | |
311 | unsigned int result_id; | |
312 | ||
313 | result->kind = NAME; | |
314 | result->id = 0; | |
315 | PRE_EXPR_NAME (result) = name; | |
316 | result_id = lookup_expression_id (result); | |
317 | if (result_id != 0) | |
b71b4522 | 318 | { |
726a989a RB |
319 | pool_free (pre_expr_pool, result); |
320 | result = expression_for_id (result_id); | |
c9145754 | 321 | return result; |
b71b4522 | 322 | } |
c9145754 DB |
323 | get_or_alloc_expression_id (result); |
324 | return result; | |
b71b4522 DB |
325 | } |
326 | ||
83737db2 | 327 | static bool in_fre = false; |
bdee7684 DB |
328 | |
329 | /* An unordered bitmap set. One bitmap tracks values, the other, | |
8c27b7d4 | 330 | expressions. */ |
bdee7684 DB |
331 | typedef struct bitmap_set |
332 | { | |
333 | bitmap expressions; | |
334 | bitmap values; | |
335 | } *bitmap_set_t; | |
336 | ||
83737db2 | 337 | #define FOR_EACH_EXPR_ID_IN_SET(set, id, bi) \ |
c9145754 DB |
338 | EXECUTE_IF_SET_IN_BITMAP((set)->expressions, 0, (id), (bi)) |
339 | ||
85169114 PB |
340 | #define FOR_EACH_VALUE_ID_IN_SET(set, id, bi) \ |
341 | EXECUTE_IF_SET_IN_BITMAP((set)->values, 0, (id), (bi)) | |
342 | ||
c9145754 DB |
343 | /* Mapping from value id to expressions with that value_id. */ |
344 | DEF_VEC_P (bitmap_set_t); | |
345 | DEF_VEC_ALLOC_P (bitmap_set_t, heap); | |
346 | static VEC(bitmap_set_t, heap) *value_expressions; | |
83737db2 | 347 | |
6b416da1 | 348 | /* Sets that we need to keep track of. */ |
83737db2 | 349 | typedef struct bb_bitmap_sets |
6de9cd9a | 350 | { |
ca072a31 DB |
351 | /* The EXP_GEN set, which represents expressions/values generated in |
352 | a basic block. */ | |
83737db2 | 353 | bitmap_set_t exp_gen; |
ca072a31 DB |
354 | |
355 | /* The PHI_GEN set, which represents PHI results generated in a | |
356 | basic block. */ | |
6b416da1 | 357 | bitmap_set_t phi_gen; |
ca072a31 | 358 | |
f6fe65dc | 359 | /* The TMP_GEN set, which represents results/temporaries generated |
ca072a31 | 360 | in a basic block. IE the LHS of an expression. */ |
6b416da1 | 361 | bitmap_set_t tmp_gen; |
ca072a31 DB |
362 | |
363 | /* The AVAIL_OUT set, which represents which values are available in | |
364 | a given basic block. */ | |
bdee7684 | 365 | bitmap_set_t avail_out; |
ca072a31 | 366 | |
c90186eb | 367 | /* The ANTIC_IN set, which represents which values are anticipatable |
ca072a31 | 368 | in a given basic block. */ |
83737db2 | 369 | bitmap_set_t antic_in; |
ca072a31 | 370 | |
d75dbccd DB |
371 | /* The PA_IN set, which represents which values are |
372 | partially anticipatable in a given basic block. */ | |
373 | bitmap_set_t pa_in; | |
374 | ||
ca072a31 DB |
375 | /* The NEW_SETS set, which is used during insertion to augment the |
376 | AVAIL_OUT set of blocks with the new insertions performed during | |
377 | the current iteration. */ | |
6b416da1 | 378 | bitmap_set_t new_sets; |
c90186eb | 379 | |
d75dbccd | 380 | /* True if we have visited this block during ANTIC calculation. */ |
83737db2 | 381 | unsigned int visited:1; |
d75dbccd DB |
382 | |
383 | /* True we have deferred processing this block during ANTIC | |
384 | calculation until its successor is processed. */ | |
385 | unsigned int deferred : 1; | |
386 | } *bb_value_sets_t; | |
387 | ||
388 | #define EXP_GEN(BB) ((bb_value_sets_t) ((BB)->aux))->exp_gen | |
389 | #define PHI_GEN(BB) ((bb_value_sets_t) ((BB)->aux))->phi_gen | |
390 | #define TMP_GEN(BB) ((bb_value_sets_t) ((BB)->aux))->tmp_gen | |
391 | #define AVAIL_OUT(BB) ((bb_value_sets_t) ((BB)->aux))->avail_out | |
392 | #define ANTIC_IN(BB) ((bb_value_sets_t) ((BB)->aux))->antic_in | |
393 | #define PA_IN(BB) ((bb_value_sets_t) ((BB)->aux))->pa_in | |
d75dbccd | 394 | #define NEW_SETS(BB) ((bb_value_sets_t) ((BB)->aux))->new_sets |
d75dbccd DB |
395 | #define BB_VISITED(BB) ((bb_value_sets_t) ((BB)->aux))->visited |
396 | #define BB_DEFERRED(BB) ((bb_value_sets_t) ((BB)->aux))->deferred | |
397 | ||
c9145754 | 398 | |
d75dbccd DB |
399 | /* Maximal set of values, used to initialize the ANTIC problem, which |
400 | is an intersection problem. */ | |
401 | static bitmap_set_t maximal_set; | |
83737db2 DB |
402 | |
403 | /* Basic block list in postorder. */ | |
404 | static int *postorder; | |
6de9cd9a | 405 | |
ca072a31 DB |
406 | /* This structure is used to keep track of statistics on what |
407 | optimization PRE was able to perform. */ | |
7e6eb623 | 408 | static struct |
6de9cd9a | 409 | { |
ca072a31 | 410 | /* The number of RHS computations eliminated by PRE. */ |
7e6eb623 | 411 | int eliminations; |
ca072a31 DB |
412 | |
413 | /* The number of new expressions/temporaries generated by PRE. */ | |
7e6eb623 | 414 | int insertions; |
ca072a31 | 415 | |
d75dbccd DB |
416 | /* The number of inserts found due to partial anticipation */ |
417 | int pa_insert; | |
418 | ||
ca072a31 | 419 | /* The number of new PHI nodes added by PRE. */ |
7e6eb623 | 420 | int phis; |
b9c5e484 | 421 | |
0fc6c492 DB |
422 | /* The number of values found constant. */ |
423 | int constified; | |
b9c5e484 | 424 | |
7e6eb623 | 425 | } pre_stats; |
6de9cd9a | 426 | |
d75dbccd | 427 | static bool do_partial_partial; |
726a989a | 428 | static pre_expr bitmap_find_leader (bitmap_set_t, unsigned int, gimple); |
c9145754 DB |
429 | static void bitmap_value_insert_into_set (bitmap_set_t, pre_expr); |
430 | static void bitmap_value_replace_in_set (bitmap_set_t, pre_expr); | |
bdee7684 | 431 | static void bitmap_set_copy (bitmap_set_t, bitmap_set_t); |
c9145754 DB |
432 | static bool bitmap_set_contains_value (bitmap_set_t, unsigned int); |
433 | static void bitmap_insert_into_set (bitmap_set_t, pre_expr); | |
434 | static void bitmap_insert_into_set_1 (bitmap_set_t, pre_expr, bool); | |
bdee7684 | 435 | static bitmap_set_t bitmap_set_new (void); |
726a989a RB |
436 | static tree create_expression_by_pieces (basic_block, pre_expr, gimple_seq *, |
437 | gimple, tree); | |
438 | static tree find_or_generate_expression (basic_block, pre_expr, gimple_seq *, | |
439 | gimple); | |
de081cfd | 440 | static unsigned int get_expr_value_id (pre_expr); |
6de9cd9a | 441 | |
7e6eb623 DB |
442 | /* We can add and remove elements and entries to and from sets |
443 | and hash tables, so we use alloc pools for them. */ | |
6de9cd9a | 444 | |
bdee7684 | 445 | static alloc_pool bitmap_set_pool; |
7932a3db | 446 | static bitmap_obstack grand_bitmap_obstack; |
6de9cd9a | 447 | |
c90186eb DB |
448 | /* To avoid adding 300 temporary variables when we only need one, we |
449 | only create one temporary variable, on demand, and build ssa names | |
450 | off that. We do have to change the variable if the types don't | |
451 | match the current variable's type. */ | |
452 | static tree pretemp; | |
453 | static tree storetemp; | |
c90186eb DB |
454 | static tree prephitemp; |
455 | ||
53b4bf74 DN |
456 | /* Set of blocks with statements that have had its EH information |
457 | cleaned up. */ | |
458 | static bitmap need_eh_cleanup; | |
459 | ||
89fb70a3 DB |
460 | /* Which expressions have been seen during a given phi translation. */ |
461 | static bitmap seen_during_translate; | |
462 | ||
7e6eb623 DB |
463 | /* The phi_translate_table caches phi translations for a given |
464 | expression and predecessor. */ | |
ca072a31 | 465 | |
7e6eb623 | 466 | static htab_t phi_translate_table; |
6de9cd9a | 467 | |
7e6eb623 DB |
468 | /* A three tuple {e, pred, v} used to cache phi translations in the |
469 | phi_translate_table. */ | |
6de9cd9a | 470 | |
7e6eb623 | 471 | typedef struct expr_pred_trans_d |
6de9cd9a | 472 | { |
8c27b7d4 | 473 | /* The expression. */ |
c9145754 | 474 | pre_expr e; |
ca072a31 DB |
475 | |
476 | /* The predecessor block along which we translated the expression. */ | |
7e6eb623 | 477 | basic_block pred; |
ca072a31 DB |
478 | |
479 | /* The value that resulted from the translation. */ | |
c9145754 | 480 | pre_expr v; |
ca072a31 DB |
481 | |
482 | /* The hashcode for the expression, pred pair. This is cached for | |
483 | speed reasons. */ | |
7e6eb623 DB |
484 | hashval_t hashcode; |
485 | } *expr_pred_trans_t; | |
741ac903 | 486 | typedef const struct expr_pred_trans_d *const_expr_pred_trans_t; |
6de9cd9a | 487 | |
7e6eb623 | 488 | /* Return the hash value for a phi translation table entry. */ |
6de9cd9a | 489 | |
7e6eb623 DB |
490 | static hashval_t |
491 | expr_pred_trans_hash (const void *p) | |
492 | { | |
741ac903 | 493 | const_expr_pred_trans_t const ve = (const_expr_pred_trans_t) p; |
7e6eb623 DB |
494 | return ve->hashcode; |
495 | } | |
6de9cd9a | 496 | |
ca072a31 DB |
497 | /* Return true if two phi translation table entries are the same. |
498 | P1 and P2 should point to the expr_pred_trans_t's to be compared.*/ | |
7e6eb623 DB |
499 | |
500 | static int | |
501 | expr_pred_trans_eq (const void *p1, const void *p2) | |
502 | { | |
741ac903 KG |
503 | const_expr_pred_trans_t const ve1 = (const_expr_pred_trans_t) p1; |
504 | const_expr_pred_trans_t const ve2 = (const_expr_pred_trans_t) p2; | |
7e6eb623 DB |
505 | basic_block b1 = ve1->pred; |
506 | basic_block b2 = ve2->pred; | |
b9c5e484 | 507 | |
ca072a31 DB |
508 | /* If they are not translations for the same basic block, they can't |
509 | be equal. */ | |
7e6eb623 | 510 | if (b1 != b2) |
6de9cd9a | 511 | return false; |
c9145754 | 512 | return pre_expr_eq (ve1->e, ve2->e); |
6de9cd9a DN |
513 | } |
514 | ||
ca072a31 | 515 | /* Search in the phi translation table for the translation of |
c9145754 | 516 | expression E in basic block PRED. |
c90186eb | 517 | Return the translated value, if found, NULL otherwise. */ |
6de9cd9a | 518 | |
c9145754 DB |
519 | static inline pre_expr |
520 | phi_trans_lookup (pre_expr e, basic_block pred) | |
6de9cd9a | 521 | { |
7e6eb623 | 522 | void **slot; |
ca072a31 | 523 | struct expr_pred_trans_d ept; |
c90186eb | 524 | |
ca072a31 DB |
525 | ept.e = e; |
526 | ept.pred = pred; | |
c9145754 | 527 | ept.hashcode = iterative_hash_hashval_t (pre_expr_hash (e), pred->index); |
ca072a31 | 528 | slot = htab_find_slot_with_hash (phi_translate_table, &ept, ept.hashcode, |
7e6eb623 DB |
529 | NO_INSERT); |
530 | if (!slot) | |
531 | return NULL; | |
532 | else | |
533 | return ((expr_pred_trans_t) *slot)->v; | |
534 | } | |
6de9cd9a | 535 | |
6de9cd9a | 536 | |
c9145754 | 537 | /* Add the tuple mapping from {expression E, basic block PRED} to |
ca072a31 | 538 | value V, to the phi translation table. */ |
7e6eb623 DB |
539 | |
540 | static inline void | |
c9145754 | 541 | phi_trans_add (pre_expr e, pre_expr v, basic_block pred) |
7e6eb623 DB |
542 | { |
543 | void **slot; | |
e1111e8e | 544 | expr_pred_trans_t new_pair = XNEW (struct expr_pred_trans_d); |
7e6eb623 DB |
545 | new_pair->e = e; |
546 | new_pair->pred = pred; | |
547 | new_pair->v = v; | |
c9145754 DB |
548 | new_pair->hashcode = iterative_hash_hashval_t (pre_expr_hash (e), |
549 | pred->index); | |
550 | ||
7e6eb623 DB |
551 | slot = htab_find_slot_with_hash (phi_translate_table, new_pair, |
552 | new_pair->hashcode, INSERT); | |
553 | if (*slot) | |
554 | free (*slot); | |
555 | *slot = (void *) new_pair; | |
6de9cd9a DN |
556 | } |
557 | ||
ff2ad0f7 | 558 | |
c9145754 | 559 | /* Add expression E to the expression set of value id V. */ |
33c94679 | 560 | |
83737db2 | 561 | void |
c9145754 | 562 | add_to_value (unsigned int v, pre_expr e) |
7e6eb623 | 563 | { |
c9145754 DB |
564 | bitmap_set_t set; |
565 | ||
de081cfd RG |
566 | gcc_assert (get_expr_value_id (e) == v); |
567 | ||
c9145754 DB |
568 | if (v >= VEC_length (bitmap_set_t, value_expressions)) |
569 | { | |
570 | VEC_safe_grow_cleared (bitmap_set_t, heap, value_expressions, | |
571 | v + 1); | |
572 | } | |
33c94679 | 573 | |
c9145754 DB |
574 | set = VEC_index (bitmap_set_t, value_expressions, v); |
575 | if (!set) | |
576 | { | |
577 | set = bitmap_set_new (); | |
578 | VEC_replace (bitmap_set_t, value_expressions, v, set); | |
579 | } | |
33c94679 | 580 | |
c9145754 | 581 | bitmap_insert_into_set_1 (set, e, true); |
7e6eb623 | 582 | } |
6de9cd9a | 583 | |
bdee7684 DB |
584 | /* Create a new bitmap set and return it. */ |
585 | ||
b9c5e484 | 586 | static bitmap_set_t |
bdee7684 DB |
587 | bitmap_set_new (void) |
588 | { | |
e1111e8e | 589 | bitmap_set_t ret = (bitmap_set_t) pool_alloc (bitmap_set_pool); |
cc175e7c NS |
590 | ret->expressions = BITMAP_ALLOC (&grand_bitmap_obstack); |
591 | ret->values = BITMAP_ALLOC (&grand_bitmap_obstack); | |
bdee7684 DB |
592 | return ret; |
593 | } | |
594 | ||
c9145754 DB |
595 | /* Return the value id for a PRE expression EXPR. */ |
596 | ||
597 | static unsigned int | |
598 | get_expr_value_id (pre_expr expr) | |
599 | { | |
600 | switch (expr->kind) | |
601 | { | |
602 | case CONSTANT: | |
bb9e4199 RG |
603 | { |
604 | unsigned int id; | |
605 | id = get_constant_value_id (PRE_EXPR_CONSTANT (expr)); | |
606 | if (id == 0) | |
607 | { | |
608 | id = get_or_alloc_constant_value_id (PRE_EXPR_CONSTANT (expr)); | |
609 | add_to_value (id, expr); | |
610 | } | |
611 | return id; | |
612 | } | |
c9145754 DB |
613 | case NAME: |
614 | return VN_INFO (PRE_EXPR_NAME (expr))->value_id; | |
615 | case NARY: | |
616 | return PRE_EXPR_NARY (expr)->value_id; | |
617 | case REFERENCE: | |
618 | return PRE_EXPR_REFERENCE (expr)->value_id; | |
619 | default: | |
620 | gcc_unreachable (); | |
621 | } | |
622 | } | |
623 | ||
83737db2 | 624 | /* Remove an expression EXPR from a bitmapped set. */ |
bdee7684 DB |
625 | |
626 | static void | |
c9145754 | 627 | bitmap_remove_from_set (bitmap_set_t set, pre_expr expr) |
bdee7684 | 628 | { |
c9145754 DB |
629 | unsigned int val = get_expr_value_id (expr); |
630 | if (!value_id_constant_p (val)) | |
83737db2 | 631 | { |
c9145754 | 632 | bitmap_clear_bit (set->values, val); |
83737db2 DB |
633 | bitmap_clear_bit (set->expressions, get_expression_id (expr)); |
634 | } | |
bdee7684 | 635 | } |
6de9cd9a | 636 | |
7e6eb623 | 637 | static void |
c9145754 DB |
638 | bitmap_insert_into_set_1 (bitmap_set_t set, pre_expr expr, |
639 | bool allow_constants) | |
7e6eb623 | 640 | { |
c9145754 DB |
641 | unsigned int val = get_expr_value_id (expr); |
642 | if (allow_constants || !value_id_constant_p (val)) | |
7e6eb623 | 643 | { |
c9145754 DB |
644 | /* We specifically expect this and only this function to be able to |
645 | insert constants into a set. */ | |
646 | bitmap_set_bit (set->values, val); | |
83737db2 | 647 | bitmap_set_bit (set->expressions, get_or_alloc_expression_id (expr)); |
7e6eb623 DB |
648 | } |
649 | } | |
6de9cd9a | 650 | |
c9145754 DB |
651 | /* Insert an expression EXPR into a bitmapped set. */ |
652 | ||
653 | static void | |
654 | bitmap_insert_into_set (bitmap_set_t set, pre_expr expr) | |
655 | { | |
656 | bitmap_insert_into_set_1 (set, expr, false); | |
657 | } | |
658 | ||
bdee7684 DB |
659 | /* Copy a bitmapped set ORIG, into bitmapped set DEST. */ |
660 | ||
661 | static void | |
662 | bitmap_set_copy (bitmap_set_t dest, bitmap_set_t orig) | |
663 | { | |
664 | bitmap_copy (dest->expressions, orig->expressions); | |
665 | bitmap_copy (dest->values, orig->values); | |
666 | } | |
667 | ||
ff3fdad2 | 668 | |
83737db2 | 669 | /* Free memory used up by SET. */ |
ff3fdad2 | 670 | static void |
83737db2 | 671 | bitmap_set_free (bitmap_set_t set) |
ff3fdad2 | 672 | { |
83737db2 DB |
673 | BITMAP_FREE (set->expressions); |
674 | BITMAP_FREE (set->values); | |
ff3fdad2 DB |
675 | } |
676 | ||
ff3fdad2 | 677 | |
83737db2 | 678 | /* Generate an topological-ordered array of bitmap set SET. */ |
ff3fdad2 | 679 | |
c9145754 | 680 | static VEC(pre_expr, heap) * |
83737db2 | 681 | sorted_array_from_bitmap_set (bitmap_set_t set) |
ff3fdad2 | 682 | { |
85169114 PB |
683 | unsigned int i, j; |
684 | bitmap_iterator bi, bj; | |
c9145754 | 685 | VEC(pre_expr, heap) *result = NULL; |
ff3fdad2 | 686 | |
85169114 PB |
687 | FOR_EACH_VALUE_ID_IN_SET (set, i, bi) |
688 | { | |
689 | /* The number of expressions having a given value is usually | |
690 | relatively small. Thus, rather than making a vector of all | |
691 | the expressions and sorting it by value-id, we walk the values | |
692 | and check in the reverse mapping that tells us what expressions | |
693 | have a given value, to filter those in our set. As a result, | |
694 | the expressions are inserted in value-id order, which means | |
695 | topological order. | |
696 | ||
697 | If this is somehow a significant lose for some cases, we can | |
698 | choose which set to walk based on the set size. */ | |
699 | bitmap_set_t exprset = VEC_index (bitmap_set_t, value_expressions, i); | |
700 | FOR_EACH_EXPR_ID_IN_SET (exprset, j, bj) | |
701 | { | |
702 | if (bitmap_bit_p (set->expressions, j)) | |
703 | VEC_safe_push (pre_expr, heap, result, expression_for_id (j)); | |
704 | } | |
705 | } | |
6de9cd9a | 706 | |
83737db2 | 707 | return result; |
7e6eb623 | 708 | } |
6de9cd9a | 709 | |
83737db2 | 710 | /* Perform bitmapped set operation DEST &= ORIG. */ |
6de9cd9a DN |
711 | |
712 | static void | |
83737db2 | 713 | bitmap_set_and (bitmap_set_t dest, bitmap_set_t orig) |
6de9cd9a | 714 | { |
83737db2 DB |
715 | bitmap_iterator bi; |
716 | unsigned int i; | |
6de9cd9a | 717 | |
d75dbccd | 718 | if (dest != orig) |
83737db2 | 719 | { |
d75dbccd | 720 | bitmap temp = BITMAP_ALLOC (&grand_bitmap_obstack); |
89fb70a3 | 721 | |
d75dbccd | 722 | bitmap_and_into (dest->values, orig->values); |
d75dbccd DB |
723 | bitmap_copy (temp, dest->expressions); |
724 | EXECUTE_IF_SET_IN_BITMAP (temp, 0, i, bi) | |
725 | { | |
c9145754 DB |
726 | pre_expr expr = expression_for_id (i); |
727 | unsigned int value_id = get_expr_value_id (expr); | |
728 | if (!bitmap_bit_p (dest->values, value_id)) | |
d75dbccd DB |
729 | bitmap_clear_bit (dest->expressions, i); |
730 | } | |
731 | BITMAP_FREE (temp); | |
6de9cd9a DN |
732 | } |
733 | } | |
734 | ||
83737db2 | 735 | /* Subtract all values and expressions contained in ORIG from DEST. */ |
7e6eb623 | 736 | |
83737db2 DB |
737 | static bitmap_set_t |
738 | bitmap_set_subtract (bitmap_set_t dest, bitmap_set_t orig) | |
7e6eb623 | 739 | { |
83737db2 DB |
740 | bitmap_set_t result = bitmap_set_new (); |
741 | bitmap_iterator bi; | |
742 | unsigned int i; | |
b9c5e484 | 743 | |
83737db2 DB |
744 | bitmap_and_compl (result->expressions, dest->expressions, |
745 | orig->expressions); | |
6de9cd9a | 746 | |
83737db2 DB |
747 | FOR_EACH_EXPR_ID_IN_SET (result, i, bi) |
748 | { | |
c9145754 DB |
749 | pre_expr expr = expression_for_id (i); |
750 | unsigned int value_id = get_expr_value_id (expr); | |
751 | bitmap_set_bit (result->values, value_id); | |
83737db2 | 752 | } |
af75a7ea | 753 | |
83737db2 | 754 | return result; |
6b416da1 DB |
755 | } |
756 | ||
d75dbccd DB |
757 | /* Subtract all the values in bitmap set B from bitmap set A. */ |
758 | ||
759 | static void | |
760 | bitmap_set_subtract_values (bitmap_set_t a, bitmap_set_t b) | |
761 | { | |
762 | unsigned int i; | |
763 | bitmap_iterator bi; | |
764 | bitmap temp = BITMAP_ALLOC (&grand_bitmap_obstack); | |
765 | ||
766 | bitmap_copy (temp, a->expressions); | |
767 | EXECUTE_IF_SET_IN_BITMAP (temp, 0, i, bi) | |
768 | { | |
c9145754 DB |
769 | pre_expr expr = expression_for_id (i); |
770 | if (bitmap_set_contains_value (b, get_expr_value_id (expr))) | |
d75dbccd DB |
771 | bitmap_remove_from_set (a, expr); |
772 | } | |
773 | BITMAP_FREE (temp); | |
774 | } | |
775 | ||
776 | ||
c9145754 | 777 | /* Return true if bitmapped set SET contains the value VALUE_ID. */ |
6de9cd9a | 778 | |
bdee7684 | 779 | static bool |
c9145754 | 780 | bitmap_set_contains_value (bitmap_set_t set, unsigned int value_id) |
6de9cd9a | 781 | { |
c9145754 | 782 | if (value_id_constant_p (value_id)) |
bdee7684 | 783 | return true; |
83737db2 DB |
784 | |
785 | if (!set || bitmap_empty_p (set->expressions)) | |
786 | return false; | |
787 | ||
c9145754 | 788 | return bitmap_bit_p (set->values, value_id); |
bdee7684 | 789 | } |
7e6eb623 | 790 | |
d75dbccd | 791 | static inline bool |
c9145754 | 792 | bitmap_set_contains_expr (bitmap_set_t set, const pre_expr expr) |
d75dbccd DB |
793 | { |
794 | return bitmap_bit_p (set->expressions, get_expression_id (expr)); | |
795 | } | |
796 | ||
bdee7684 | 797 | /* Replace an instance of value LOOKFOR with expression EXPR in SET. */ |
7e6eb623 | 798 | |
bdee7684 | 799 | static void |
c9145754 DB |
800 | bitmap_set_replace_value (bitmap_set_t set, unsigned int lookfor, |
801 | const pre_expr expr) | |
bdee7684 | 802 | { |
83737db2 DB |
803 | bitmap_set_t exprset; |
804 | unsigned int i; | |
805 | bitmap_iterator bi; | |
806 | ||
c9145754 | 807 | if (value_id_constant_p (lookfor)) |
bdee7684 | 808 | return; |
83737db2 | 809 | |
bdee7684 DB |
810 | if (!bitmap_set_contains_value (set, lookfor)) |
811 | return; | |
e9284566 | 812 | |
6b416da1 DB |
813 | /* The number of expressions having a given value is usually |
814 | significantly less than the total number of expressions in SET. | |
815 | Thus, rather than check, for each expression in SET, whether it | |
816 | has the value LOOKFOR, we walk the reverse mapping that tells us | |
817 | what expressions have a given value, and see if any of those | |
818 | expressions are in our set. For large testcases, this is about | |
819 | 5-10x faster than walking the bitmap. If this is somehow a | |
820 | significant lose for some cases, we can choose which set to walk | |
821 | based on the set size. */ | |
c9145754 | 822 | exprset = VEC_index (bitmap_set_t, value_expressions, lookfor); |
83737db2 | 823 | FOR_EACH_EXPR_ID_IN_SET (exprset, i, bi) |
6de9cd9a | 824 | { |
83737db2 | 825 | if (bitmap_bit_p (set->expressions, i)) |
6de9cd9a | 826 | { |
83737db2 DB |
827 | bitmap_clear_bit (set->expressions, i); |
828 | bitmap_set_bit (set->expressions, get_expression_id (expr)); | |
829 | return; | |
6de9cd9a | 830 | } |
6de9cd9a DN |
831 | } |
832 | } | |
833 | ||
83737db2 | 834 | /* Return true if two bitmap sets are equal. */ |
6de9cd9a | 835 | |
7e6eb623 | 836 | static bool |
83737db2 | 837 | bitmap_set_equal (bitmap_set_t a, bitmap_set_t b) |
6de9cd9a | 838 | { |
83737db2 | 839 | return bitmap_equal_p (a->values, b->values); |
6de9cd9a DN |
840 | } |
841 | ||
e9284566 | 842 | /* Replace an instance of EXPR's VALUE with EXPR in SET if it exists, |
6c6cfbfd | 843 | and add it otherwise. */ |
bdee7684 | 844 | |
7e6eb623 | 845 | static void |
c9145754 | 846 | bitmap_value_replace_in_set (bitmap_set_t set, pre_expr expr) |
7e6eb623 | 847 | { |
c9145754 | 848 | unsigned int val = get_expr_value_id (expr); |
83737db2 | 849 | |
e9284566 DB |
850 | if (bitmap_set_contains_value (set, val)) |
851 | bitmap_set_replace_value (set, val, expr); | |
852 | else | |
853 | bitmap_insert_into_set (set, expr); | |
bdee7684 | 854 | } |
7e6eb623 | 855 | |
bdee7684 DB |
856 | /* Insert EXPR into SET if EXPR's value is not already present in |
857 | SET. */ | |
858 | ||
859 | static void | |
c9145754 | 860 | bitmap_value_insert_into_set (bitmap_set_t set, pre_expr expr) |
bdee7684 | 861 | { |
c9145754 | 862 | unsigned int val = get_expr_value_id (expr); |
af75a7ea | 863 | |
c9145754 | 864 | if (value_id_constant_p (val)) |
7e6eb623 | 865 | return; |
b9c5e484 | 866 | |
bdee7684 DB |
867 | if (!bitmap_set_contains_value (set, val)) |
868 | bitmap_insert_into_set (set, expr); | |
7e6eb623 | 869 | } |
6de9cd9a | 870 | |
c9145754 DB |
871 | /* Print out EXPR to outfile. */ |
872 | ||
873 | static void | |
874 | print_pre_expr (FILE *outfile, const pre_expr expr) | |
875 | { | |
876 | switch (expr->kind) | |
877 | { | |
878 | case CONSTANT: | |
879 | print_generic_expr (outfile, PRE_EXPR_CONSTANT (expr), 0); | |
880 | break; | |
881 | case NAME: | |
882 | print_generic_expr (outfile, PRE_EXPR_NAME (expr), 0); | |
883 | break; | |
884 | case NARY: | |
885 | { | |
886 | unsigned int i; | |
887 | vn_nary_op_t nary = PRE_EXPR_NARY (expr); | |
888 | fprintf (outfile, "{%s,", tree_code_name [nary->opcode]); | |
889 | for (i = 0; i < nary->length; i++) | |
890 | { | |
891 | print_generic_expr (outfile, nary->op[i], 0); | |
892 | if (i != (unsigned) nary->length - 1) | |
893 | fprintf (outfile, ","); | |
894 | } | |
895 | fprintf (outfile, "}"); | |
896 | } | |
897 | break; | |
898 | ||
899 | case REFERENCE: | |
900 | { | |
901 | vn_reference_op_t vro; | |
902 | unsigned int i; | |
903 | vn_reference_t ref = PRE_EXPR_REFERENCE (expr); | |
904 | fprintf (outfile, "{"); | |
905 | for (i = 0; | |
906 | VEC_iterate (vn_reference_op_s, ref->operands, i, vro); | |
907 | i++) | |
908 | { | |
909 | if (vro->opcode != SSA_NAME | |
910 | && TREE_CODE_CLASS (vro->opcode) != tcc_declaration) | |
911 | fprintf (outfile, "%s ", tree_code_name [vro->opcode]); | |
912 | if (vro->op0) | |
913 | { | |
914 | if (vro->op1) | |
915 | fprintf (outfile, "<"); | |
916 | print_generic_expr (outfile, vro->op0, 0); | |
917 | if (vro->op1) | |
918 | { | |
919 | fprintf (outfile, ","); | |
920 | print_generic_expr (outfile, vro->op1, 0); | |
921 | } | |
922 | if (vro->op1) | |
923 | fprintf (outfile, ">"); | |
924 | } | |
925 | if (i != VEC_length (vn_reference_op_s, ref->operands) - 1) | |
926 | fprintf (outfile, ","); | |
927 | } | |
928 | fprintf (outfile, "}"); | |
929 | } | |
930 | break; | |
931 | } | |
932 | } | |
933 | void debug_pre_expr (pre_expr); | |
934 | ||
935 | /* Like print_pre_expr but always prints to stderr. */ | |
936 | void | |
937 | debug_pre_expr (pre_expr e) | |
938 | { | |
939 | print_pre_expr (stderr, e); | |
940 | fprintf (stderr, "\n"); | |
941 | } | |
942 | ||
bdee7684 DB |
943 | /* Print out SET to OUTFILE. */ |
944 | ||
945 | static void | |
83737db2 DB |
946 | print_bitmap_set (FILE *outfile, bitmap_set_t set, |
947 | const char *setname, int blockindex) | |
bdee7684 DB |
948 | { |
949 | fprintf (outfile, "%s[%d] := { ", setname, blockindex); | |
950 | if (set) | |
951 | { | |
cf6b9ef1 | 952 | bool first = true; |
3cd8c58a | 953 | unsigned i; |
87c476a2 ZD |
954 | bitmap_iterator bi; |
955 | ||
83737db2 | 956 | FOR_EACH_EXPR_ID_IN_SET (set, i, bi) |
87c476a2 | 957 | { |
c9145754 | 958 | const pre_expr expr = expression_for_id (i); |
83737db2 | 959 | |
65a6f342 NS |
960 | if (!first) |
961 | fprintf (outfile, ", "); | |
962 | first = false; | |
c9145754 | 963 | print_pre_expr (outfile, expr); |
b9c5e484 | 964 | |
c9145754 | 965 | fprintf (outfile, " (%04d)", get_expr_value_id (expr)); |
87c476a2 | 966 | } |
bdee7684 DB |
967 | } |
968 | fprintf (outfile, " }\n"); | |
969 | } | |
6de9cd9a | 970 | |
83737db2 | 971 | void debug_bitmap_set (bitmap_set_t); |
6de9cd9a | 972 | |
83737db2 DB |
973 | void |
974 | debug_bitmap_set (bitmap_set_t set) | |
975 | { | |
976 | print_bitmap_set (stderr, set, "debug", 0); | |
7e6eb623 DB |
977 | } |
978 | ||
979 | /* Print out the expressions that have VAL to OUTFILE. */ | |
33c94679 | 980 | |
7e6eb623 | 981 | void |
c9145754 | 982 | print_value_expressions (FILE *outfile, unsigned int val) |
7e6eb623 | 983 | { |
c9145754 DB |
984 | bitmap_set_t set = VEC_index (bitmap_set_t, value_expressions, val); |
985 | if (set) | |
33c94679 DN |
986 | { |
987 | char s[10]; | |
c9145754 DB |
988 | sprintf (s, "%04d", val); |
989 | print_bitmap_set (outfile, set, s, 0); | |
33c94679 | 990 | } |
6de9cd9a DN |
991 | } |
992 | ||
6de9cd9a | 993 | |
7e6eb623 | 994 | void |
c9145754 | 995 | debug_value_expressions (unsigned int val) |
6de9cd9a | 996 | { |
7e6eb623 DB |
997 | print_value_expressions (stderr, val); |
998 | } | |
999 | ||
c9145754 DB |
1000 | /* Given a CONSTANT, allocate a new CONSTANT type PRE_EXPR to |
1001 | represent it. */ | |
0995a441 | 1002 | |
c9145754 DB |
1003 | static pre_expr |
1004 | get_or_alloc_expr_for_constant (tree constant) | |
b9c5e484 | 1005 | { |
c9145754 DB |
1006 | unsigned int result_id; |
1007 | unsigned int value_id; | |
1008 | pre_expr newexpr = (pre_expr) pool_alloc (pre_expr_pool); | |
1009 | newexpr->kind = CONSTANT; | |
1010 | PRE_EXPR_CONSTANT (newexpr) = constant; | |
1011 | result_id = lookup_expression_id (newexpr); | |
1012 | if (result_id != 0) | |
1013 | { | |
726a989a RB |
1014 | pool_free (pre_expr_pool, newexpr); |
1015 | newexpr = expression_for_id (result_id); | |
c9145754 DB |
1016 | return newexpr; |
1017 | } | |
1018 | value_id = get_or_alloc_constant_value_id (constant); | |
1019 | get_or_alloc_expression_id (newexpr); | |
1020 | add_to_value (value_id, newexpr); | |
1021 | return newexpr; | |
0995a441 SB |
1022 | } |
1023 | ||
c9145754 DB |
1024 | /* Given a value id V, find the actual tree representing the constant |
1025 | value if there is one, and return it. Return NULL if we can't find | |
1026 | a constant. */ | |
43da81be DB |
1027 | |
1028 | static tree | |
726a989a | 1029 | get_constant_for_value_id (unsigned int v) |
43da81be | 1030 | { |
c9145754 DB |
1031 | if (value_id_constant_p (v)) |
1032 | { | |
1033 | unsigned int i; | |
1034 | bitmap_iterator bi; | |
1035 | bitmap_set_t exprset = VEC_index (bitmap_set_t, value_expressions, v); | |
1036 | ||
1037 | FOR_EACH_EXPR_ID_IN_SET (exprset, i, bi) | |
1038 | { | |
1039 | pre_expr expr = expression_for_id (i); | |
726a989a | 1040 | if (expr->kind == CONSTANT) |
c9145754 DB |
1041 | return PRE_EXPR_CONSTANT (expr); |
1042 | } | |
1043 | } | |
1044 | return NULL; | |
1045 | } | |
1046 | ||
1047 | /* Get or allocate a pre_expr for a piece of GIMPLE, and return it. | |
1048 | Currently only supports constants and SSA_NAMES. */ | |
1049 | static pre_expr | |
1050 | get_or_alloc_expr_for (tree t) | |
1051 | { | |
1052 | if (TREE_CODE (t) == SSA_NAME) | |
1053 | return get_or_alloc_expr_for_name (t); | |
ba4d8f9d RG |
1054 | else if (is_gimple_min_invariant (t) |
1055 | || TREE_CODE (t) == EXC_PTR_EXPR | |
1056 | || TREE_CODE (t) == FILTER_EXPR) | |
c9145754 | 1057 | return get_or_alloc_expr_for_constant (t); |
726a989a RB |
1058 | else |
1059 | { | |
1060 | /* More complex expressions can result from SCCVN expression | |
1061 | simplification that inserts values for them. As they all | |
1062 | do not have VOPs the get handled by the nary ops struct. */ | |
1063 | vn_nary_op_t result; | |
1064 | unsigned int result_id; | |
1065 | vn_nary_op_lookup (t, &result); | |
1066 | if (result != NULL) | |
1067 | { | |
1068 | pre_expr e = (pre_expr) pool_alloc (pre_expr_pool); | |
1069 | e->kind = NARY; | |
1070 | PRE_EXPR_NARY (e) = result; | |
1071 | result_id = lookup_expression_id (e); | |
1072 | if (result_id != 0) | |
1073 | { | |
1074 | pool_free (pre_expr_pool, e); | |
1075 | e = expression_for_id (result_id); | |
1076 | return e; | |
1077 | } | |
1078 | alloc_expression_id (e); | |
1079 | return e; | |
1080 | } | |
1081 | } | |
c9145754 DB |
1082 | return NULL; |
1083 | } | |
1084 | ||
1085 | /* Return the folded version of T if T, when folded, is a gimple | |
1086 | min_invariant. Otherwise, return T. */ | |
1087 | ||
1088 | static pre_expr | |
1089 | fully_constant_expression (pre_expr e) | |
1090 | { | |
1091 | switch (e->kind) | |
1092 | { | |
1093 | case CONSTANT: | |
1094 | return e; | |
1095 | case NARY: | |
1096 | { | |
1097 | vn_nary_op_t nary = PRE_EXPR_NARY (e); | |
1098 | switch (TREE_CODE_CLASS (nary->opcode)) | |
1099 | { | |
40f64141 RG |
1100 | case tcc_expression: |
1101 | if (nary->opcode == TRUTH_NOT_EXPR) | |
1102 | goto do_unary; | |
1103 | if (nary->opcode != TRUTH_AND_EXPR | |
1104 | && nary->opcode != TRUTH_OR_EXPR | |
1105 | && nary->opcode != TRUTH_XOR_EXPR) | |
1106 | return e; | |
1107 | /* Fallthrough. */ | |
c9145754 | 1108 | case tcc_binary: |
40f64141 | 1109 | case tcc_comparison: |
c9145754 DB |
1110 | { |
1111 | /* We have to go from trees to pre exprs to value ids to | |
1112 | constants. */ | |
1113 | tree naryop0 = nary->op[0]; | |
1114 | tree naryop1 = nary->op[1]; | |
40f64141 RG |
1115 | tree result; |
1116 | if (!is_gimple_min_invariant (naryop0)) | |
726a989a RB |
1117 | { |
1118 | pre_expr rep0 = get_or_alloc_expr_for (naryop0); | |
1119 | unsigned int vrep0 = get_expr_value_id (rep0); | |
40f64141 RG |
1120 | tree const0 = get_constant_for_value_id (vrep0); |
1121 | if (const0) | |
1122 | naryop0 = fold_convert (TREE_TYPE (naryop0), const0); | |
726a989a | 1123 | } |
40f64141 | 1124 | if (!is_gimple_min_invariant (naryop1)) |
726a989a RB |
1125 | { |
1126 | pre_expr rep1 = get_or_alloc_expr_for (naryop1); | |
1127 | unsigned int vrep1 = get_expr_value_id (rep1); | |
40f64141 RG |
1128 | tree const1 = get_constant_for_value_id (vrep1); |
1129 | if (const1) | |
1130 | naryop1 = fold_convert (TREE_TYPE (naryop1), const1); | |
b463e8de | 1131 | } |
40f64141 RG |
1132 | result = fold_binary (nary->opcode, nary->type, |
1133 | naryop0, naryop1); | |
c9145754 DB |
1134 | if (result && is_gimple_min_invariant (result)) |
1135 | return get_or_alloc_expr_for_constant (result); | |
40f64141 RG |
1136 | /* We might have simplified the expression to a |
1137 | SSA_NAME for example from x_1 * 1. But we cannot | |
1138 | insert a PHI for x_1 unconditionally as x_1 might | |
1139 | not be available readily. */ | |
c9145754 DB |
1140 | return e; |
1141 | } | |
40f64141 RG |
1142 | case tcc_reference: |
1143 | if (nary->opcode != REALPART_EXPR | |
1144 | && nary->opcode != IMAGPART_EXPR | |
1145 | && nary->opcode != VIEW_CONVERT_EXPR) | |
1146 | return e; | |
1147 | /* Fallthrough. */ | |
c9145754 | 1148 | case tcc_unary: |
40f64141 | 1149 | do_unary: |
c9145754 | 1150 | { |
40f64141 RG |
1151 | /* We have to go from trees to pre exprs to value ids to |
1152 | constants. */ | |
c9145754 | 1153 | tree naryop0 = nary->op[0]; |
726a989a RB |
1154 | tree const0, result; |
1155 | if (is_gimple_min_invariant (naryop0)) | |
1156 | const0 = naryop0; | |
1157 | else | |
1158 | { | |
1159 | pre_expr rep0 = get_or_alloc_expr_for (naryop0); | |
1160 | unsigned int vrep0 = get_expr_value_id (rep0); | |
1161 | const0 = get_constant_for_value_id (vrep0); | |
1162 | } | |
1163 | result = NULL; | |
c9145754 | 1164 | if (const0) |
b463e8de DB |
1165 | { |
1166 | tree type1 = TREE_TYPE (nary->op[0]); | |
1167 | const0 = fold_convert (type1, const0); | |
1168 | result = fold_unary (nary->opcode, nary->type, const0); | |
1169 | } | |
c9145754 DB |
1170 | if (result && is_gimple_min_invariant (result)) |
1171 | return get_or_alloc_expr_for_constant (result); | |
1172 | return e; | |
1173 | } | |
1174 | default: | |
1175 | return e; | |
1176 | } | |
1177 | } | |
47af7a5c RG |
1178 | case REFERENCE: |
1179 | { | |
1180 | vn_reference_t ref = PRE_EXPR_REFERENCE (e); | |
1181 | VEC (vn_reference_op_s, heap) *operands = ref->operands; | |
1182 | vn_reference_op_t op; | |
1183 | ||
1184 | /* Try to simplify the translated expression if it is | |
1185 | a call to a builtin function with at most two arguments. */ | |
1186 | op = VEC_index (vn_reference_op_s, operands, 0); | |
1187 | if (op->opcode == CALL_EXPR | |
1188 | && TREE_CODE (op->op0) == ADDR_EXPR | |
1189 | && TREE_CODE (TREE_OPERAND (op->op0, 0)) == FUNCTION_DECL | |
1190 | && DECL_BUILT_IN (TREE_OPERAND (op->op0, 0)) | |
1191 | && VEC_length (vn_reference_op_s, operands) >= 2 | |
1192 | && VEC_length (vn_reference_op_s, operands) <= 3) | |
1193 | { | |
1194 | vn_reference_op_t arg0, arg1 = NULL; | |
1195 | bool anyconst = false; | |
1196 | arg0 = VEC_index (vn_reference_op_s, operands, 1); | |
1197 | if (VEC_length (vn_reference_op_s, operands) > 2) | |
1198 | arg1 = VEC_index (vn_reference_op_s, operands, 2); | |
1199 | if (TREE_CODE_CLASS (arg0->opcode) == tcc_constant | |
1200 | || (arg0->opcode == ADDR_EXPR | |
1201 | && is_gimple_min_invariant (arg0->op0))) | |
1202 | anyconst = true; | |
1203 | if (arg1 | |
1204 | && (TREE_CODE_CLASS (arg1->opcode) == tcc_constant | |
1205 | || (arg1->opcode == ADDR_EXPR | |
1206 | && is_gimple_min_invariant (arg1->op0)))) | |
1207 | anyconst = true; | |
1208 | if (anyconst) | |
1209 | { | |
1210 | tree folded = build_call_expr (TREE_OPERAND (op->op0, 0), | |
1211 | arg1 ? 2 : 1, | |
1212 | arg0->op0, | |
1213 | arg1 ? arg1->op0 : NULL); | |
1214 | if (folded | |
1215 | && TREE_CODE (folded) == NOP_EXPR) | |
1216 | folded = TREE_OPERAND (folded, 0); | |
1217 | if (folded | |
1218 | && is_gimple_min_invariant (folded)) | |
1219 | return get_or_alloc_expr_for_constant (folded); | |
1220 | } | |
1221 | } | |
1222 | return e; | |
1223 | } | |
c9145754 DB |
1224 | default: |
1225 | return e; | |
1226 | } | |
1227 | return e; | |
43da81be DB |
1228 | } |
1229 | ||
d75dbccd DB |
1230 | /* Translate the vuses in the VUSES vector backwards through phi nodes |
1231 | in PHIBLOCK, so that they have the value they would have in | |
1232 | BLOCK. */ | |
c90186eb DB |
1233 | |
1234 | static VEC(tree, gc) * | |
d75dbccd DB |
1235 | translate_vuses_through_block (VEC (tree, gc) *vuses, |
1236 | basic_block phiblock, | |
1237 | basic_block block) | |
c90186eb DB |
1238 | { |
1239 | tree oldvuse; | |
1240 | VEC(tree, gc) *result = NULL; | |
1241 | int i; | |
43da81be | 1242 | |
c90186eb DB |
1243 | for (i = 0; VEC_iterate (tree, vuses, i, oldvuse); i++) |
1244 | { | |
726a989a RB |
1245 | gimple phi = SSA_NAME_DEF_STMT (oldvuse); |
1246 | if (gimple_code (phi) == GIMPLE_PHI | |
1247 | && gimple_bb (phi) == phiblock) | |
c90186eb | 1248 | { |
726a989a | 1249 | edge e = find_edge (block, gimple_bb (phi)); |
c90186eb DB |
1250 | if (e) |
1251 | { | |
1252 | tree def = PHI_ARG_DEF (phi, e->dest_idx); | |
1253 | if (def != oldvuse) | |
1254 | { | |
1255 | if (!result) | |
1256 | result = VEC_copy (tree, gc, vuses); | |
1257 | VEC_replace (tree, result, i, def); | |
1258 | } | |
1259 | } | |
1260 | } | |
1261 | } | |
83737db2 DB |
1262 | |
1263 | /* We avoid creating a new copy of the vuses unless something | |
1264 | actually changed, so result can be NULL. */ | |
c90186eb DB |
1265 | if (result) |
1266 | { | |
1267 | sort_vuses (result); | |
1268 | return result; | |
1269 | } | |
1270 | return vuses; | |
1271 | ||
1272 | } | |
83737db2 DB |
1273 | |
1274 | /* Like find_leader, but checks for the value existing in SET1 *or* | |
1275 | SET2. This is used to avoid making a set consisting of the union | |
1276 | of PA_IN and ANTIC_IN during insert. */ | |
1277 | ||
c9145754 DB |
1278 | static inline pre_expr |
1279 | find_leader_in_sets (unsigned int val, bitmap_set_t set1, bitmap_set_t set2) | |
83737db2 | 1280 | { |
c9145754 | 1281 | pre_expr result; |
83737db2 | 1282 | |
726a989a | 1283 | result = bitmap_find_leader (set1, val, NULL); |
83737db2 | 1284 | if (!result && set2) |
726a989a | 1285 | result = bitmap_find_leader (set2, val, NULL); |
83737db2 DB |
1286 | return result; |
1287 | } | |
1288 | ||
c9145754 DB |
1289 | /* Get the tree type for our PRE expression e. */ |
1290 | ||
1291 | static tree | |
1292 | get_expr_type (const pre_expr e) | |
1293 | { | |
1294 | switch (e->kind) | |
1295 | { | |
1296 | case NAME: | |
1297 | return TREE_TYPE (PRE_EXPR_NAME (e)); | |
1298 | case CONSTANT: | |
1299 | return TREE_TYPE (PRE_EXPR_CONSTANT (e)); | |
1300 | case REFERENCE: | |
1301 | { | |
1302 | vn_reference_op_t vro; | |
1303 | ||
1304 | gcc_assert (PRE_EXPR_REFERENCE (e)->operands); | |
1305 | vro = VEC_index (vn_reference_op_s, | |
1306 | PRE_EXPR_REFERENCE (e)->operands, | |
1307 | 0); | |
1308 | /* We don't store type along with COMPONENT_REF because it is | |
1309 | always the same as FIELD_DECL's type. */ | |
1310 | if (!vro->type) | |
1311 | { | |
1312 | gcc_assert (vro->opcode == COMPONENT_REF); | |
1313 | return TREE_TYPE (vro->op0); | |
1314 | } | |
1315 | return vro->type; | |
1316 | } | |
1317 | ||
1318 | case NARY: | |
1319 | return PRE_EXPR_NARY (e)->type; | |
1320 | } | |
1321 | gcc_unreachable(); | |
1322 | } | |
1323 | ||
1324 | /* Get a representative SSA_NAME for a given expression. | |
1325 | Since all of our sub-expressions are treated as values, we require | |
1326 | them to be SSA_NAME's for simplicity. | |
1327 | Prior versions of GVNPRE used to use "value handles" here, so that | |
1328 | an expression would be VH.11 + VH.10 instead of d_3 + e_6. In | |
1329 | either case, the operands are really values (IE we do not expect | |
1330 | them to be usable without finding leaders). */ | |
1331 | ||
1332 | static tree | |
1333 | get_representative_for (const pre_expr e) | |
1334 | { | |
1335 | tree exprtype; | |
1336 | tree name; | |
1337 | unsigned int value_id = get_expr_value_id (e); | |
1338 | ||
1339 | switch (e->kind) | |
1340 | { | |
1341 | case NAME: | |
1342 | return PRE_EXPR_NAME (e); | |
1343 | case CONSTANT: | |
726a989a | 1344 | return PRE_EXPR_CONSTANT (e); |
c9145754 DB |
1345 | case NARY: |
1346 | case REFERENCE: | |
1347 | { | |
1348 | /* Go through all of the expressions representing this value | |
1349 | and pick out an SSA_NAME. */ | |
1350 | unsigned int i; | |
1351 | bitmap_iterator bi; | |
1352 | bitmap_set_t exprs = VEC_index (bitmap_set_t, value_expressions, | |
1353 | value_id); | |
1354 | FOR_EACH_EXPR_ID_IN_SET (exprs, i, bi) | |
1355 | { | |
1356 | pre_expr rep = expression_for_id (i); | |
1357 | if (rep->kind == NAME) | |
1358 | return PRE_EXPR_NAME (rep); | |
1359 | } | |
1360 | } | |
1361 | break; | |
1362 | } | |
1363 | /* If we reached here we couldn't find an SSA_NAME. This can | |
1364 | happen when we've discovered a value that has never appeared in | |
1365 | the program as set to an SSA_NAME, most likely as the result of | |
1366 | phi translation. */ | |
1367 | if (dump_file) | |
1368 | { | |
1369 | fprintf (dump_file, | |
1370 | "Could not find SSA_NAME representative for expression:"); | |
1371 | print_pre_expr (dump_file, e); | |
1372 | fprintf (dump_file, "\n"); | |
1373 | } | |
1374 | ||
1375 | exprtype = get_expr_type (e); | |
1376 | ||
1377 | /* Build and insert the assignment of the end result to the temporary | |
1378 | that we will return. */ | |
1379 | if (!pretemp || exprtype != TREE_TYPE (pretemp)) | |
1380 | { | |
1381 | pretemp = create_tmp_var (exprtype, "pretmp"); | |
1382 | get_var_ann (pretemp); | |
1383 | } | |
1384 | ||
726a989a | 1385 | name = make_ssa_name (pretemp, gimple_build_nop ()); |
c9145754 DB |
1386 | VN_INFO_GET (name)->value_id = value_id; |
1387 | if (e->kind == CONSTANT) | |
1388 | VN_INFO (name)->valnum = PRE_EXPR_CONSTANT (e); | |
1389 | else | |
1390 | VN_INFO (name)->valnum = name; | |
1391 | ||
1392 | add_to_value (value_id, get_or_alloc_expr_for_name (name)); | |
1393 | if (dump_file) | |
1394 | { | |
1395 | fprintf (dump_file, "Created SSA_NAME representative "); | |
1396 | print_generic_expr (dump_file, name, 0); | |
1397 | fprintf (dump_file, " for expression:"); | |
1398 | print_pre_expr (dump_file, e); | |
1399 | fprintf (dump_file, "\n"); | |
1400 | } | |
1401 | ||
1402 | return name; | |
1403 | } | |
1404 | ||
1405 | ||
1406 | ||
1407 | ||
7e6eb623 | 1408 | /* Translate EXPR using phis in PHIBLOCK, so that it has the values of |
89fb70a3 DB |
1409 | the phis in PRED. SEEN is a bitmap saying which expression we have |
1410 | translated since we started translation of the toplevel expression. | |
1411 | Return NULL if we can't find a leader for each part of the | |
070b797d | 1412 | translated expression. */ |
6de9cd9a | 1413 | |
c9145754 DB |
1414 | static pre_expr |
1415 | phi_translate_1 (pre_expr expr, bitmap_set_t set1, bitmap_set_t set2, | |
89fb70a3 | 1416 | basic_block pred, basic_block phiblock, bitmap seen) |
6de9cd9a | 1417 | { |
c9145754 DB |
1418 | pre_expr oldexpr = expr; |
1419 | pre_expr phitrans; | |
83737db2 | 1420 | |
c9145754 | 1421 | if (!expr) |
7e6eb623 | 1422 | return NULL; |
6de9cd9a | 1423 | |
c9145754 | 1424 | if (value_id_constant_p (get_expr_value_id (expr))) |
6615c446 JO |
1425 | return expr; |
1426 | ||
c9145754 | 1427 | phitrans = phi_trans_lookup (expr, pred); |
7e6eb623 DB |
1428 | if (phitrans) |
1429 | return phitrans; | |
b9c5e484 | 1430 | |
89fb70a3 DB |
1431 | /* Prevent cycles when we have recursively dependent leaders. This |
1432 | can only happen when phi translating the maximal set. */ | |
1433 | if (seen) | |
1434 | { | |
1435 | unsigned int expr_id = get_expression_id (expr); | |
1436 | if (bitmap_bit_p (seen, expr_id)) | |
1437 | return NULL; | |
1438 | bitmap_set_bit (seen, expr_id); | |
1439 | } | |
1440 | ||
c9145754 | 1441 | switch (expr->kind) |
6de9cd9a | 1442 | { |
c9145754 DB |
1443 | /* Constants contain no values that need translation. */ |
1444 | case CONSTANT: | |
1445 | return expr; | |
5039610b | 1446 | |
c9145754 | 1447 | case NARY: |
43da81be | 1448 | { |
c9145754 DB |
1449 | unsigned int i; |
1450 | bool changed = false; | |
1451 | vn_nary_op_t nary = PRE_EXPR_NARY (expr); | |
1452 | struct vn_nary_op_s newnary; | |
1453 | /* The NARY structure is only guaranteed to have been | |
1454 | allocated to the nary->length operands. */ | |
1455 | memcpy (&newnary, nary, (sizeof (struct vn_nary_op_s) | |
1456 | - sizeof (tree) * (4 - nary->length))); | |
1457 | ||
1458 | for (i = 0; i < newnary.length; i++) | |
43da81be | 1459 | { |
c9145754 DB |
1460 | if (TREE_CODE (newnary.op[i]) != SSA_NAME) |
1461 | continue; | |
1462 | else | |
43da81be | 1463 | { |
c9145754 DB |
1464 | unsigned int op_val_id = VN_INFO (newnary.op[i])->value_id; |
1465 | pre_expr leader = find_leader_in_sets (op_val_id, set1, set2); | |
1466 | pre_expr result = phi_translate_1 (leader, set1, set2, | |
1467 | pred, phiblock, seen); | |
1468 | if (result && result != leader) | |
43da81be | 1469 | { |
c9145754 DB |
1470 | tree name = get_representative_for (result); |
1471 | if (!name) | |
85300b46 | 1472 | return NULL; |
c9145754 | 1473 | newnary.op[i] = name; |
43da81be | 1474 | } |
c9145754 DB |
1475 | else if (!result) |
1476 | return NULL; | |
0778d4e8 | 1477 | |
c9145754 | 1478 | changed |= newnary.op[i] != nary->op[i]; |
0778d4e8 | 1479 | } |
c9145754 DB |
1480 | } |
1481 | if (changed) | |
1482 | { | |
1483 | pre_expr constant; | |
1484 | ||
1485 | tree result = vn_nary_op_lookup_pieces (newnary.length, | |
1486 | newnary.opcode, | |
1487 | newnary.type, | |
1488 | newnary.op[0], | |
1489 | newnary.op[1], | |
1490 | newnary.op[2], | |
1491 | newnary.op[3], | |
1492 | &nary); | |
1493 | unsigned int new_val_id; | |
1494 | ||
1495 | expr = (pre_expr) pool_alloc (pre_expr_pool); | |
1496 | expr->kind = NARY; | |
1497 | expr->id = 0; | |
1498 | if (result && is_gimple_min_invariant (result)) | |
1499 | return get_or_alloc_expr_for_constant (result); | |
1500 | ||
1501 | ||
1502 | if (nary) | |
1503 | { | |
1504 | PRE_EXPR_NARY (expr) = nary; | |
1505 | constant = fully_constant_expression (expr); | |
1506 | if (constant != expr) | |
1507 | return constant; | |
0778d4e8 | 1508 | |
c9145754 DB |
1509 | new_val_id = nary->value_id; |
1510 | get_or_alloc_expression_id (expr); | |
1511 | } | |
1512 | else | |
43da81be | 1513 | { |
c9145754 DB |
1514 | new_val_id = get_next_value_id (); |
1515 | VEC_safe_grow_cleared (bitmap_set_t, heap, | |
1516 | value_expressions, | |
1517 | get_max_value_id() + 1); | |
1518 | nary = vn_nary_op_insert_pieces (newnary.length, | |
1519 | newnary.opcode, | |
1520 | newnary.type, | |
1521 | newnary.op[0], | |
1522 | newnary.op[1], | |
1523 | newnary.op[2], | |
1524 | newnary.op[3], | |
1525 | result, new_val_id); | |
1526 | PRE_EXPR_NARY (expr) = nary; | |
1527 | constant = fully_constant_expression (expr); | |
1528 | if (constant != expr) | |
1529 | return constant; | |
1530 | get_or_alloc_expression_id (expr); | |
43da81be | 1531 | } |
b0a0ab2d | 1532 | add_to_value (new_val_id, expr); |
c5830edf | 1533 | } |
c9145754 DB |
1534 | phi_trans_add (oldexpr, expr, pred); |
1535 | return expr; | |
c90186eb | 1536 | } |
c9145754 | 1537 | break; |
47af7a5c | 1538 | |
c9145754 | 1539 | case REFERENCE: |
c90186eb | 1540 | { |
c9145754 DB |
1541 | vn_reference_t ref = PRE_EXPR_REFERENCE (expr); |
1542 | VEC (vn_reference_op_s, heap) *operands = ref->operands; | |
1543 | VEC (tree, gc) *vuses = ref->vuses; | |
1544 | VEC (tree, gc) *newvuses = vuses; | |
1545 | VEC (vn_reference_op_s, heap) *newoperands = NULL; | |
1546 | bool changed = false; | |
1547 | unsigned int i; | |
1548 | vn_reference_op_t operand; | |
1549 | vn_reference_t newref; | |
1550 | ||
1551 | for (i = 0; VEC_iterate (vn_reference_op_s, operands, i, operand); i++) | |
e13f1c14 | 1552 | { |
c9145754 DB |
1553 | pre_expr opresult; |
1554 | pre_expr leader; | |
1555 | tree oldop0 = operand->op0; | |
1556 | tree oldop1 = operand->op1; | |
1557 | tree oldop2 = operand->op2; | |
1558 | tree op0 = oldop0; | |
1559 | tree op1 = oldop1; | |
1560 | tree op2 = oldop2; | |
1561 | tree type = operand->type; | |
1562 | vn_reference_op_s newop = *operand; | |
1563 | ||
1564 | if (op0 && TREE_CODE (op0) == SSA_NAME) | |
e13f1c14 | 1565 | { |
c9145754 DB |
1566 | unsigned int op_val_id = VN_INFO (op0)->value_id; |
1567 | leader = find_leader_in_sets (op_val_id, set1, set2); | |
1568 | opresult = phi_translate_1 (leader, set1, set2, | |
1569 | pred, phiblock, seen); | |
1570 | if (opresult && opresult != leader) | |
1571 | { | |
1572 | tree name = get_representative_for (opresult); | |
1573 | if (!name) | |
b5d76df4 | 1574 | break; |
c9145754 DB |
1575 | op0 = name; |
1576 | } | |
1577 | else if (!opresult) | |
b5d76df4 | 1578 | break; |
c9145754 DB |
1579 | } |
1580 | changed |= op0 != oldop0; | |
b9c5e484 | 1581 | |
c9145754 DB |
1582 | if (op1 && TREE_CODE (op1) == SSA_NAME) |
1583 | { | |
1584 | unsigned int op_val_id = VN_INFO (op1)->value_id; | |
1585 | leader = find_leader_in_sets (op_val_id, set1, set2); | |
1586 | opresult = phi_translate_1 (leader, set1, set2, | |
1587 | pred, phiblock, seen); | |
1588 | if (opresult && opresult != leader) | |
1589 | { | |
1590 | tree name = get_representative_for (opresult); | |
1591 | if (!name) | |
b5d76df4 | 1592 | break; |
c9145754 DB |
1593 | op1 = name; |
1594 | } | |
1595 | else if (!opresult) | |
b5d76df4 | 1596 | break; |
e13f1c14 | 1597 | } |
c9145754 DB |
1598 | changed |= op1 != oldop1; |
1599 | if (op2 && TREE_CODE (op2) == SSA_NAME) | |
e13f1c14 | 1600 | { |
c9145754 DB |
1601 | unsigned int op_val_id = VN_INFO (op2)->value_id; |
1602 | leader = find_leader_in_sets (op_val_id, set1, set2); | |
1603 | opresult = phi_translate_1 (leader, set1, set2, | |
1604 | pred, phiblock, seen); | |
1605 | if (opresult && opresult != leader) | |
1606 | { | |
1607 | tree name = get_representative_for (opresult); | |
1608 | if (!name) | |
b5d76df4 | 1609 | break; |
c9145754 DB |
1610 | op2 = name; |
1611 | } | |
1612 | else if (!opresult) | |
b5d76df4 | 1613 | break; |
e13f1c14 | 1614 | } |
c9145754 DB |
1615 | changed |= op2 != oldop2; |
1616 | ||
1617 | if (!newoperands) | |
1618 | newoperands = VEC_copy (vn_reference_op_s, heap, operands); | |
1619 | /* We may have changed from an SSA_NAME to a constant */ | |
1620 | if (newop.opcode == SSA_NAME && TREE_CODE (op0) != SSA_NAME) | |
1621 | newop.opcode = TREE_CODE (op0); | |
1622 | newop.type = type; | |
1623 | newop.op0 = op0; | |
1624 | newop.op1 = op1; | |
1625 | newop.op2 = op2; | |
1626 | VEC_replace (vn_reference_op_s, newoperands, i, &newop); | |
e13f1c14 | 1627 | } |
b5d76df4 RG |
1628 | if (i != VEC_length (vn_reference_op_s, operands)) |
1629 | { | |
1630 | if (newoperands) | |
1631 | VEC_free (vn_reference_op_s, heap, newoperands); | |
1632 | return NULL; | |
1633 | } | |
c90186eb | 1634 | |
c9145754 DB |
1635 | newvuses = translate_vuses_through_block (vuses, phiblock, pred); |
1636 | changed |= newvuses != vuses; | |
b9c5e484 | 1637 | |
c9145754 | 1638 | if (changed) |
c90186eb | 1639 | { |
47af7a5c RG |
1640 | unsigned int new_val_id; |
1641 | pre_expr constant; | |
1642 | ||
c9145754 DB |
1643 | tree result = vn_reference_lookup_pieces (newvuses, |
1644 | newoperands, | |
53f3815c | 1645 | &newref, true); |
c9145754 DB |
1646 | if (newref) |
1647 | VEC_free (vn_reference_op_s, heap, newoperands); | |
c90186eb | 1648 | |
c9145754 | 1649 | if (result && is_gimple_min_invariant (result)) |
9e504cda JH |
1650 | { |
1651 | gcc_assert (!newoperands); | |
1652 | return get_or_alloc_expr_for_constant (result); | |
1653 | } | |
c90186eb | 1654 | |
c9145754 DB |
1655 | expr = (pre_expr) pool_alloc (pre_expr_pool); |
1656 | expr->kind = REFERENCE; | |
1657 | expr->id = 0; | |
6615c446 | 1658 | |
c9145754 | 1659 | if (newref) |
0995a441 | 1660 | { |
c9145754 | 1661 | PRE_EXPR_REFERENCE (expr) = newref; |
47af7a5c RG |
1662 | constant = fully_constant_expression (expr); |
1663 | if (constant != expr) | |
1664 | return constant; | |
1665 | ||
c9145754 DB |
1666 | new_val_id = newref->value_id; |
1667 | get_or_alloc_expression_id (expr); | |
0995a441 SB |
1668 | } |
1669 | else | |
1670 | { | |
c9145754 DB |
1671 | new_val_id = get_next_value_id (); |
1672 | VEC_safe_grow_cleared (bitmap_set_t, heap, value_expressions, | |
1673 | get_max_value_id() + 1); | |
1674 | newref = vn_reference_insert_pieces (newvuses, | |
1675 | newoperands, | |
1676 | result, new_val_id); | |
9e504cda | 1677 | newoperands = NULL; |
c9145754 | 1678 | PRE_EXPR_REFERENCE (expr) = newref; |
47af7a5c RG |
1679 | constant = fully_constant_expression (expr); |
1680 | if (constant != expr) | |
1681 | return constant; | |
c9145754 | 1682 | get_or_alloc_expression_id (expr); |
0995a441 | 1683 | } |
b0a0ab2d | 1684 | add_to_value (new_val_id, expr); |
7e6eb623 | 1685 | } |
9e504cda | 1686 | VEC_free (vn_reference_op_s, heap, newoperands); |
c9145754 DB |
1687 | phi_trans_add (oldexpr, expr, pred); |
1688 | return expr; | |
7e6eb623 | 1689 | } |
c9145754 | 1690 | break; |
47af7a5c | 1691 | |
c9145754 | 1692 | case NAME: |
7e6eb623 | 1693 | { |
726a989a | 1694 | gimple phi = NULL; |
9323afae | 1695 | edge e; |
726a989a | 1696 | gimple def_stmt; |
c9145754 | 1697 | tree name = PRE_EXPR_NAME (expr); |
d75dbccd | 1698 | |
c9145754 | 1699 | def_stmt = SSA_NAME_DEF_STMT (name); |
726a989a RB |
1700 | if (gimple_code (def_stmt) == GIMPLE_PHI |
1701 | && gimple_bb (def_stmt) == phiblock) | |
d75dbccd | 1702 | phi = def_stmt; |
7e6eb623 DB |
1703 | else |
1704 | return expr; | |
b9c5e484 | 1705 | |
726a989a | 1706 | e = find_edge (pred, gimple_bb (phi)); |
9323afae KH |
1707 | if (e) |
1708 | { | |
89fb70a3 | 1709 | tree def = PHI_ARG_DEF (phi, e->dest_idx); |
c9145754 | 1710 | pre_expr newexpr; |
070b797d | 1711 | |
73a63870 RG |
1712 | if (TREE_CODE (def) == SSA_NAME) |
1713 | def = VN_INFO (def)->valnum; | |
1714 | ||
c9145754 | 1715 | /* Handle constant. */ |
89fb70a3 | 1716 | if (is_gimple_min_invariant (def)) |
c9145754 | 1717 | return get_or_alloc_expr_for_constant (def); |
070b797d | 1718 | |
7b7e6ecd | 1719 | if (TREE_CODE (def) == SSA_NAME && ssa_undefined_value_p (def)) |
9323afae | 1720 | return NULL; |
070b797d | 1721 | |
c9145754 DB |
1722 | newexpr = get_or_alloc_expr_for_name (def); |
1723 | return newexpr; | |
9323afae | 1724 | } |
7e6eb623 | 1725 | } |
6615c446 JO |
1726 | return expr; |
1727 | ||
1728 | default: | |
1729 | gcc_unreachable (); | |
6de9cd9a DN |
1730 | } |
1731 | } | |
f8b04195 | 1732 | |
89fb70a3 | 1733 | /* Translate EXPR using phis in PHIBLOCK, so that it has the values of |
070b797d | 1734 | the phis in PRED. |
89fb70a3 | 1735 | Return NULL if we can't find a leader for each part of the |
070b797d | 1736 | translated expression. */ |
89fb70a3 | 1737 | |
c9145754 DB |
1738 | static pre_expr |
1739 | phi_translate (pre_expr expr, bitmap_set_t set1, bitmap_set_t set2, | |
89fb70a3 DB |
1740 | basic_block pred, basic_block phiblock) |
1741 | { | |
f8b04195 DB |
1742 | bitmap_clear (seen_during_translate); |
1743 | return phi_translate_1 (expr, set1, set2, pred, phiblock, | |
1744 | seen_during_translate); | |
89fb70a3 | 1745 | } |
6de9cd9a | 1746 | |
c9145754 | 1747 | /* For each expression in SET, translate the values through phi nodes |
f5594471 DB |
1748 | in PHIBLOCK using edge PHIBLOCK->PRED, and store the resulting |
1749 | expressions in DEST. */ | |
1750 | ||
6de9cd9a | 1751 | static void |
83737db2 | 1752 | phi_translate_set (bitmap_set_t dest, bitmap_set_t set, basic_block pred, |
7e6eb623 | 1753 | basic_block phiblock) |
6de9cd9a | 1754 | { |
c9145754 DB |
1755 | VEC (pre_expr, heap) *exprs; |
1756 | pre_expr expr; | |
83737db2 DB |
1757 | int i; |
1758 | ||
1759 | if (!phi_nodes (phiblock)) | |
6de9cd9a | 1760 | { |
83737db2 DB |
1761 | bitmap_set_copy (dest, set); |
1762 | return; | |
1763 | } | |
b9c5e484 | 1764 | |
83737db2 | 1765 | exprs = sorted_array_from_bitmap_set (set); |
c9145754 | 1766 | for (i = 0; VEC_iterate (pre_expr, exprs, i, expr); i++) |
83737db2 | 1767 | { |
c9145754 | 1768 | pre_expr translated; |
f8b04195 | 1769 | translated = phi_translate (expr, set, NULL, pred, phiblock); |
c90186eb | 1770 | |
de278246 DB |
1771 | /* Don't add empty translations to the cache */ |
1772 | if (translated) | |
c9145754 | 1773 | phi_trans_add (expr, translated, pred); |
c90186eb | 1774 | |
7e6eb623 | 1775 | if (translated != NULL) |
83737db2 | 1776 | bitmap_value_insert_into_set (dest, translated); |
b9c5e484 | 1777 | } |
c9145754 | 1778 | VEC_free (pre_expr, heap, exprs); |
6de9cd9a DN |
1779 | } |
1780 | ||
bdee7684 | 1781 | /* Find the leader for a value (i.e., the name representing that |
3d45dd59 RG |
1782 | value) in a given set, and return it. If STMT is non-NULL it |
1783 | makes sure the defining statement for the leader dominates it. | |
1784 | Return NULL if no leader is found. */ | |
bdee7684 | 1785 | |
c9145754 | 1786 | static pre_expr |
726a989a | 1787 | bitmap_find_leader (bitmap_set_t set, unsigned int val, gimple stmt) |
bdee7684 | 1788 | { |
c9145754 DB |
1789 | if (value_id_constant_p (val)) |
1790 | { | |
1791 | unsigned int i; | |
1792 | bitmap_iterator bi; | |
1793 | bitmap_set_t exprset = VEC_index (bitmap_set_t, value_expressions, val); | |
83737db2 | 1794 | |
c9145754 DB |
1795 | FOR_EACH_EXPR_ID_IN_SET (exprset, i, bi) |
1796 | { | |
1797 | pre_expr expr = expression_for_id (i); | |
1798 | if (expr->kind == CONSTANT) | |
1799 | return expr; | |
1800 | } | |
1801 | } | |
bdee7684 DB |
1802 | if (bitmap_set_contains_value (set, val)) |
1803 | { | |
6b416da1 DB |
1804 | /* Rather than walk the entire bitmap of expressions, and see |
1805 | whether any of them has the value we are looking for, we look | |
1806 | at the reverse mapping, which tells us the set of expressions | |
1807 | that have a given value (IE value->expressions with that | |
1808 | value) and see if any of those expressions are in our set. | |
1809 | The number of expressions per value is usually significantly | |
1810 | less than the number of expressions in the set. In fact, for | |
1811 | large testcases, doing it this way is roughly 5-10x faster | |
1812 | than walking the bitmap. | |
1813 | If this is somehow a significant lose for some cases, we can | |
b9c5e484 | 1814 | choose which set to walk based on which set is smaller. */ |
83737db2 DB |
1815 | unsigned int i; |
1816 | bitmap_iterator bi; | |
c9145754 | 1817 | bitmap_set_t exprset = VEC_index (bitmap_set_t, value_expressions, val); |
b9c5e484 | 1818 | |
83737db2 DB |
1819 | EXECUTE_IF_AND_IN_BITMAP (exprset->expressions, |
1820 | set->expressions, 0, i, bi) | |
3d45dd59 | 1821 | { |
c9145754 DB |
1822 | pre_expr val = expression_for_id (i); |
1823 | /* At the point where stmt is not null, there should always | |
1824 | be an SSA_NAME first in the list of expressions. */ | |
3d45dd59 RG |
1825 | if (stmt) |
1826 | { | |
726a989a RB |
1827 | gimple def_stmt = SSA_NAME_DEF_STMT (PRE_EXPR_NAME (val)); |
1828 | if (gimple_code (def_stmt) != GIMPLE_PHI | |
1829 | && gimple_bb (def_stmt) == gimple_bb (stmt) | |
1830 | && gimple_uid (def_stmt) >= gimple_uid (stmt)) | |
3d45dd59 RG |
1831 | continue; |
1832 | } | |
1833 | return val; | |
1834 | } | |
6de9cd9a | 1835 | } |
7e6eb623 | 1836 | return NULL; |
6de9cd9a DN |
1837 | } |
1838 | ||
cea618ac | 1839 | /* Determine if EXPR, a memory expression, is ANTIC_IN at the top of |
1e4816bc DB |
1840 | BLOCK by seeing if it is not killed in the block. Note that we are |
1841 | only determining whether there is a store that kills it. Because | |
1842 | of the order in which clean iterates over values, we are guaranteed | |
1843 | that altered operands will have caused us to be eliminated from the | |
1844 | ANTIC_IN set already. */ | |
c90186eb DB |
1845 | |
1846 | static bool | |
c9145754 | 1847 | value_dies_in_block_x (pre_expr expr, basic_block block) |
c90186eb DB |
1848 | { |
1849 | int i; | |
1850 | tree vuse; | |
c9145754 | 1851 | VEC (tree, gc) *vuses = PRE_EXPR_REFERENCE (expr)->vuses; |
89fb70a3 | 1852 | |
1e4816bc DB |
1853 | /* Conservatively, a value dies if it's vuses are defined in this |
1854 | block, unless they come from phi nodes (which are merge operations, | |
1855 | rather than stores. */ | |
c90186eb DB |
1856 | for (i = 0; VEC_iterate (tree, vuses, i, vuse); i++) |
1857 | { | |
726a989a | 1858 | gimple def = SSA_NAME_DEF_STMT (vuse); |
89fb70a3 | 1859 | |
726a989a | 1860 | if (gimple_bb (def) != block) |
1e4816bc | 1861 | continue; |
726a989a | 1862 | if (gimple_code (def) == GIMPLE_PHI) |
1e4816bc DB |
1863 | continue; |
1864 | return true; | |
c90186eb DB |
1865 | } |
1866 | return false; | |
1867 | } | |
1868 | ||
6de9cd9a | 1869 | |
83737db2 DB |
1870 | #define union_contains_value(SET1, SET2, VAL) \ |
1871 | (bitmap_set_contains_value ((SET1), (VAL)) \ | |
1872 | || ((SET2) && bitmap_set_contains_value ((SET2), (VAL)))) | |
1873 | ||
c9145754 DB |
1874 | /* Determine if vn_reference_op_t VRO is legal in SET1 U SET2. |
1875 | */ | |
6de9cd9a | 1876 | static bool |
c9145754 DB |
1877 | vro_valid_in_sets (bitmap_set_t set1, bitmap_set_t set2, |
1878 | vn_reference_op_t vro) | |
6de9cd9a | 1879 | { |
c9145754 | 1880 | if (vro->op0 && TREE_CODE (vro->op0) == SSA_NAME) |
7e6eb623 | 1881 | { |
c9145754 DB |
1882 | struct pre_expr_d temp; |
1883 | temp.kind = NAME; | |
1884 | temp.id = 0; | |
1885 | PRE_EXPR_NAME (&temp) = vro->op0; | |
1886 | temp.id = lookup_expression_id (&temp); | |
1887 | if (temp.id == 0) | |
1888 | return false; | |
1889 | if (!union_contains_value (set1, set2, | |
1890 | get_expr_value_id (&temp))) | |
1891 | return false; | |
1892 | } | |
1893 | if (vro->op1 && TREE_CODE (vro->op1) == SSA_NAME) | |
1894 | { | |
1895 | struct pre_expr_d temp; | |
1896 | temp.kind = NAME; | |
1897 | temp.id = 0; | |
1898 | PRE_EXPR_NAME (&temp) = vro->op1; | |
1899 | temp.id = lookup_expression_id (&temp); | |
1900 | if (temp.id == 0) | |
1901 | return false; | |
1902 | if (!union_contains_value (set1, set2, | |
1903 | get_expr_value_id (&temp))) | |
1904 | return false; | |
1905 | } | |
83737db2 | 1906 | |
c9145754 DB |
1907 | if (vro->op2 && TREE_CODE (vro->op2) == SSA_NAME) |
1908 | { | |
1909 | struct pre_expr_d temp; | |
1910 | temp.kind = NAME; | |
1911 | temp.id = 0; | |
1912 | PRE_EXPR_NAME (&temp) = vro->op2; | |
1913 | temp.id = lookup_expression_id (&temp); | |
1914 | if (temp.id == 0) | |
1915 | return false; | |
1916 | if (!union_contains_value (set1, set2, | |
1917 | get_expr_value_id (&temp))) | |
1918 | return false; | |
1919 | } | |
6615c446 | 1920 | |
c9145754 DB |
1921 | return true; |
1922 | } | |
b9c5e484 | 1923 | |
c9145754 DB |
1924 | /* Determine if the expression EXPR is valid in SET1 U SET2. |
1925 | ONLY SET2 CAN BE NULL. | |
1926 | This means that we have a leader for each part of the expression | |
1927 | (if it consists of values), or the expression is an SSA_NAME. | |
1928 | For loads/calls, we also see if the vuses are killed in this block. | |
1929 | */ | |
5039610b | 1930 | |
c9145754 DB |
1931 | static bool |
1932 | valid_in_sets (bitmap_set_t set1, bitmap_set_t set2, pre_expr expr, | |
1933 | basic_block block) | |
1934 | { | |
1935 | switch (expr->kind) | |
1936 | { | |
1937 | case NAME: | |
1938 | return bitmap_set_contains_expr (AVAIL_OUT (block), expr); | |
1939 | case NARY: | |
43da81be | 1940 | { |
c9145754 DB |
1941 | unsigned int i; |
1942 | vn_nary_op_t nary = PRE_EXPR_NARY (expr); | |
1943 | for (i = 0; i < nary->length; i++) | |
43da81be | 1944 | { |
c9145754 | 1945 | if (TREE_CODE (nary->op[i]) == SSA_NAME) |
43da81be | 1946 | { |
c9145754 DB |
1947 | struct pre_expr_d temp; |
1948 | temp.kind = NAME; | |
1949 | temp.id = 0; | |
1950 | PRE_EXPR_NAME (&temp) = nary->op[i]; | |
1951 | temp.id = lookup_expression_id (&temp); | |
1952 | if (temp.id == 0) | |
1953 | return false; | |
1954 | if (!union_contains_value (set1, set2, | |
1955 | get_expr_value_id (&temp))) | |
43da81be DB |
1956 | return false; |
1957 | } | |
43da81be | 1958 | } |
c9145754 | 1959 | return true; |
43da81be | 1960 | } |
c9145754 DB |
1961 | break; |
1962 | case REFERENCE: | |
c90186eb | 1963 | { |
c9145754 DB |
1964 | vn_reference_t ref = PRE_EXPR_REFERENCE (expr); |
1965 | vn_reference_op_t vro; | |
1966 | unsigned int i; | |
1967 | ||
1968 | for (i = 0; VEC_iterate (vn_reference_op_s, ref->operands, i, vro); i++) | |
c90186eb | 1969 | { |
c9145754 | 1970 | if (!vro_valid_in_sets (set1, set2, vro)) |
e13f1c14 | 1971 | return false; |
c90186eb | 1972 | } |
c9145754 | 1973 | return !value_dies_in_block_x (expr, block); |
c90186eb | 1974 | } |
6615c446 | 1975 | default: |
b9c5e484 | 1976 | gcc_unreachable (); |
c9145754 | 1977 | } |
6de9cd9a DN |
1978 | } |
1979 | ||
d75dbccd DB |
1980 | /* Clean the set of expressions that are no longer valid in SET1 or |
1981 | SET2. This means expressions that are made up of values we have no | |
1982 | leaders for in SET1 or SET2. This version is used for partial | |
1983 | anticipation, which means it is not valid in either ANTIC_IN or | |
1984 | PA_IN. */ | |
1985 | ||
1986 | static void | |
1987 | dependent_clean (bitmap_set_t set1, bitmap_set_t set2, basic_block block) | |
1988 | { | |
c9145754 DB |
1989 | VEC (pre_expr, heap) *exprs = sorted_array_from_bitmap_set (set1); |
1990 | pre_expr expr; | |
d75dbccd DB |
1991 | int i; |
1992 | ||
c9145754 | 1993 | for (i = 0; VEC_iterate (pre_expr, exprs, i, expr); i++) |
d75dbccd DB |
1994 | { |
1995 | if (!valid_in_sets (set1, set2, expr, block)) | |
1996 | bitmap_remove_from_set (set1, expr); | |
1997 | } | |
c9145754 | 1998 | VEC_free (pre_expr, heap, exprs); |
d75dbccd DB |
1999 | } |
2000 | ||
ca072a31 DB |
2001 | /* Clean the set of expressions that are no longer valid in SET. This |
2002 | means expressions that are made up of values we have no leaders for | |
2003 | in SET. */ | |
6de9cd9a DN |
2004 | |
2005 | static void | |
83737db2 | 2006 | clean (bitmap_set_t set, basic_block block) |
6de9cd9a | 2007 | { |
c9145754 DB |
2008 | VEC (pre_expr, heap) *exprs = sorted_array_from_bitmap_set (set); |
2009 | pre_expr expr; | |
83737db2 DB |
2010 | int i; |
2011 | ||
c9145754 | 2012 | for (i = 0; VEC_iterate (pre_expr, exprs, i, expr); i++) |
6de9cd9a | 2013 | { |
83737db2 DB |
2014 | if (!valid_in_sets (set, NULL, expr, block)) |
2015 | bitmap_remove_from_set (set, expr); | |
6de9cd9a | 2016 | } |
c9145754 | 2017 | VEC_free (pre_expr, heap, exprs); |
6de9cd9a DN |
2018 | } |
2019 | ||
d4222d43 | 2020 | static sbitmap has_abnormal_preds; |
89fb70a3 | 2021 | |
83737db2 DB |
2022 | /* List of blocks that may have changed during ANTIC computation and |
2023 | thus need to be iterated over. */ | |
2024 | ||
2025 | static sbitmap changed_blocks; | |
1e4816bc DB |
2026 | |
2027 | /* Decide whether to defer a block for a later iteration, or PHI | |
2028 | translate SOURCE to DEST using phis in PHIBLOCK. Return false if we | |
2029 | should defer the block, and true if we processed it. */ | |
2030 | ||
2031 | static bool | |
2032 | defer_or_phi_translate_block (bitmap_set_t dest, bitmap_set_t source, | |
2033 | basic_block block, basic_block phiblock) | |
2034 | { | |
2035 | if (!BB_VISITED (phiblock)) | |
2036 | { | |
2037 | SET_BIT (changed_blocks, block->index); | |
2038 | BB_VISITED (block) = 0; | |
2039 | BB_DEFERRED (block) = 1; | |
2040 | return false; | |
2041 | } | |
2042 | else | |
2043 | phi_translate_set (dest, source, block, phiblock); | |
2044 | return true; | |
2045 | } | |
2046 | ||
7e6eb623 | 2047 | /* Compute the ANTIC set for BLOCK. |
6de9cd9a | 2048 | |
665fcad8 SB |
2049 | If succs(BLOCK) > 1 then |
2050 | ANTIC_OUT[BLOCK] = intersection of ANTIC_IN[b] for all succ(BLOCK) | |
2051 | else if succs(BLOCK) == 1 then | |
2052 | ANTIC_OUT[BLOCK] = phi_translate (ANTIC_IN[succ(BLOCK)]) | |
6de9cd9a | 2053 | |
665fcad8 | 2054 | ANTIC_IN[BLOCK] = clean(ANTIC_OUT[BLOCK] U EXP_GEN[BLOCK] - TMP_GEN[BLOCK]) |
83737db2 | 2055 | */ |
6de9cd9a | 2056 | |
7e6eb623 | 2057 | static bool |
a28fee03 | 2058 | compute_antic_aux (basic_block block, bool block_has_abnormal_pred_edge) |
6de9cd9a | 2059 | { |
7e6eb623 | 2060 | bool changed = false; |
83737db2 DB |
2061 | bitmap_set_t S, old, ANTIC_OUT; |
2062 | bitmap_iterator bi; | |
2063 | unsigned int bii; | |
2064 | edge e; | |
2065 | edge_iterator ei; | |
a28fee03 | 2066 | |
83737db2 | 2067 | old = ANTIC_OUT = S = NULL; |
d75dbccd | 2068 | BB_VISITED (block) = 1; |
a28fee03 SB |
2069 | |
2070 | /* If any edges from predecessors are abnormal, antic_in is empty, | |
2071 | so do nothing. */ | |
2072 | if (block_has_abnormal_pred_edge) | |
2073 | goto maybe_dump_sets; | |
6de9cd9a | 2074 | |
83737db2 DB |
2075 | old = ANTIC_IN (block); |
2076 | ANTIC_OUT = bitmap_set_new (); | |
6de9cd9a | 2077 | |
a28fee03 SB |
2078 | /* If the block has no successors, ANTIC_OUT is empty. */ |
2079 | if (EDGE_COUNT (block->succs) == 0) | |
2080 | ; | |
7e6eb623 DB |
2081 | /* If we have one successor, we could have some phi nodes to |
2082 | translate through. */ | |
c5cbcccf | 2083 | else if (single_succ_p (block)) |
6de9cd9a | 2084 | { |
83737db2 | 2085 | basic_block succ_bb = single_succ (block); |
d75dbccd DB |
2086 | |
2087 | /* We trade iterations of the dataflow equations for having to | |
2088 | phi translate the maximal set, which is incredibly slow | |
2089 | (since the maximal set often has 300+ members, even when you | |
2090 | have a small number of blocks). | |
2091 | Basically, we defer the computation of ANTIC for this block | |
2f8e468b | 2092 | until we have processed it's successor, which will inevitably |
d75dbccd DB |
2093 | have a *much* smaller set of values to phi translate once |
2094 | clean has been run on it. | |
2095 | The cost of doing this is that we technically perform more | |
2096 | iterations, however, they are lower cost iterations. | |
2097 | ||
2098 | Timings for PRE on tramp3d-v4: | |
2099 | without maximal set fix: 11 seconds | |
2100 | with maximal set fix/without deferring: 26 seconds | |
2101 | with maximal set fix/with deferring: 11 seconds | |
2102 | */ | |
2103 | ||
1e4816bc DB |
2104 | if (!defer_or_phi_translate_block (ANTIC_OUT, ANTIC_IN (succ_bb), |
2105 | block, succ_bb)) | |
d75dbccd DB |
2106 | { |
2107 | changed = true; | |
d75dbccd DB |
2108 | goto maybe_dump_sets; |
2109 | } | |
6de9cd9a | 2110 | } |
7e6eb623 | 2111 | /* If we have multiple successors, we take the intersection of all of |
1e4816bc DB |
2112 | them. Note that in the case of loop exit phi nodes, we may have |
2113 | phis to translate through. */ | |
7e6eb623 | 2114 | else |
6de9cd9a | 2115 | { |
d4e6fecb | 2116 | VEC(basic_block, heap) * worklist; |
7e6eb623 DB |
2117 | size_t i; |
2118 | basic_block bprime, first; | |
2119 | ||
d4e6fecb | 2120 | worklist = VEC_alloc (basic_block, heap, EDGE_COUNT (block->succs)); |
628f6a4e | 2121 | FOR_EACH_EDGE (e, ei, block->succs) |
d75dbccd DB |
2122 | VEC_quick_push (basic_block, worklist, e->dest); |
2123 | first = VEC_index (basic_block, worklist, 0); | |
83737db2 | 2124 | |
1e4816bc DB |
2125 | if (phi_nodes (first)) |
2126 | { | |
2127 | bitmap_set_t from = ANTIC_IN (first); | |
89fb70a3 | 2128 | |
1e4816bc DB |
2129 | if (!BB_VISITED (first)) |
2130 | from = maximal_set; | |
2131 | phi_translate_set (ANTIC_OUT, from, block, first); | |
2132 | } | |
d75dbccd | 2133 | else |
1e4816bc DB |
2134 | { |
2135 | if (!BB_VISITED (first)) | |
2136 | bitmap_set_copy (ANTIC_OUT, maximal_set); | |
2137 | else | |
2138 | bitmap_set_copy (ANTIC_OUT, ANTIC_IN (first)); | |
2139 | } | |
c90186eb | 2140 | |
d75dbccd DB |
2141 | for (i = 1; VEC_iterate (basic_block, worklist, i, bprime); i++) |
2142 | { | |
89fb70a3 | 2143 | if (phi_nodes (bprime)) |
1e4816bc DB |
2144 | { |
2145 | bitmap_set_t tmp = bitmap_set_new (); | |
2146 | bitmap_set_t from = ANTIC_IN (bprime); | |
89fb70a3 | 2147 | |
1e4816bc DB |
2148 | if (!BB_VISITED (bprime)) |
2149 | from = maximal_set; | |
2150 | phi_translate_set (tmp, from, block, bprime); | |
2151 | bitmap_set_and (ANTIC_OUT, tmp); | |
2152 | bitmap_set_free (tmp); | |
2153 | } | |
89fb70a3 | 2154 | else |
1e4816bc DB |
2155 | { |
2156 | if (!BB_VISITED (bprime)) | |
2157 | bitmap_set_and (ANTIC_OUT, maximal_set); | |
89fb70a3 | 2158 | else |
1e4816bc DB |
2159 | bitmap_set_and (ANTIC_OUT, ANTIC_IN (bprime)); |
2160 | } | |
6de9cd9a | 2161 | } |
d75dbccd | 2162 | VEC_free (basic_block, heap, worklist); |
6de9cd9a | 2163 | } |
6de9cd9a | 2164 | |
ea4b7848 | 2165 | /* Generate ANTIC_OUT - TMP_GEN. */ |
83737db2 | 2166 | S = bitmap_set_subtract (ANTIC_OUT, TMP_GEN (block)); |
6de9cd9a | 2167 | |
d75dbccd | 2168 | /* Start ANTIC_IN with EXP_GEN - TMP_GEN. */ |
83737db2 DB |
2169 | ANTIC_IN (block) = bitmap_set_subtract (EXP_GEN (block), |
2170 | TMP_GEN (block)); | |
c33bae88 | 2171 | |
a28fee03 SB |
2172 | /* Then union in the ANTIC_OUT - TMP_GEN values, |
2173 | to get ANTIC_OUT U EXP_GEN - TMP_GEN */ | |
83737db2 DB |
2174 | FOR_EACH_EXPR_ID_IN_SET (S, bii, bi) |
2175 | bitmap_value_insert_into_set (ANTIC_IN (block), | |
2176 | expression_for_id (bii)); | |
6de9cd9a | 2177 | |
c90186eb | 2178 | clean (ANTIC_IN (block), block); |
d75dbccd DB |
2179 | |
2180 | /* !old->expressions can happen when we deferred a block. */ | |
2181 | if (!old->expressions || !bitmap_set_equal (old, ANTIC_IN (block))) | |
83737db2 DB |
2182 | { |
2183 | changed = true; | |
2184 | SET_BIT (changed_blocks, block->index); | |
2185 | FOR_EACH_EDGE (e, ei, block->preds) | |
2186 | SET_BIT (changed_blocks, e->src->index); | |
2187 | } | |
2188 | else | |
2189 | RESET_BIT (changed_blocks, block->index); | |
6de9cd9a | 2190 | |
a28fee03 | 2191 | maybe_dump_sets: |
7e6eb623 DB |
2192 | if (dump_file && (dump_flags & TDF_DETAILS)) |
2193 | { | |
d75dbccd DB |
2194 | if (!BB_DEFERRED (block) || BB_VISITED (block)) |
2195 | { | |
2196 | if (ANTIC_OUT) | |
2197 | print_bitmap_set (dump_file, ANTIC_OUT, "ANTIC_OUT", block->index); | |
85300b46 | 2198 | |
d75dbccd DB |
2199 | print_bitmap_set (dump_file, ANTIC_IN (block), "ANTIC_IN", |
2200 | block->index); | |
85300b46 | 2201 | |
d75dbccd DB |
2202 | if (S) |
2203 | print_bitmap_set (dump_file, S, "S", block->index); | |
2204 | } | |
2205 | else | |
2206 | { | |
2207 | fprintf (dump_file, | |
2208 | "Block %d was deferred for a future iteration.\n", | |
2209 | block->index); | |
2210 | } | |
83737db2 DB |
2211 | } |
2212 | if (old) | |
2213 | bitmap_set_free (old); | |
2214 | if (S) | |
2215 | bitmap_set_free (S); | |
2216 | if (ANTIC_OUT) | |
2217 | bitmap_set_free (ANTIC_OUT); | |
7e6eb623 | 2218 | return changed; |
6de9cd9a DN |
2219 | } |
2220 | ||
d75dbccd DB |
2221 | /* Compute PARTIAL_ANTIC for BLOCK. |
2222 | ||
2223 | If succs(BLOCK) > 1 then | |
2224 | PA_OUT[BLOCK] = value wise union of PA_IN[b] + all ANTIC_IN not | |
2225 | in ANTIC_OUT for all succ(BLOCK) | |
2226 | else if succs(BLOCK) == 1 then | |
2227 | PA_OUT[BLOCK] = phi_translate (PA_IN[succ(BLOCK)]) | |
2228 | ||
2229 | PA_IN[BLOCK] = dependent_clean(PA_OUT[BLOCK] - TMP_GEN[BLOCK] | |
2230 | - ANTIC_IN[BLOCK]) | |
2231 | ||
2232 | */ | |
2233 | static bool | |
2234 | compute_partial_antic_aux (basic_block block, | |
2235 | bool block_has_abnormal_pred_edge) | |
2236 | { | |
2237 | bool changed = false; | |
2238 | bitmap_set_t old_PA_IN; | |
2239 | bitmap_set_t PA_OUT; | |
2240 | edge e; | |
2241 | edge_iterator ei; | |
f0ed4cfb | 2242 | unsigned long max_pa = PARAM_VALUE (PARAM_MAX_PARTIAL_ANTIC_LENGTH); |
d75dbccd DB |
2243 | |
2244 | old_PA_IN = PA_OUT = NULL; | |
2245 | ||
2246 | /* If any edges from predecessors are abnormal, antic_in is empty, | |
2247 | so do nothing. */ | |
2248 | if (block_has_abnormal_pred_edge) | |
2249 | goto maybe_dump_sets; | |
2250 | ||
f0ed4cfb NC |
2251 | /* If there are too many partially anticipatable values in the |
2252 | block, phi_translate_set can take an exponential time: stop | |
2253 | before the translation starts. */ | |
2254 | if (max_pa | |
2255 | && single_succ_p (block) | |
2256 | && bitmap_count_bits (PA_IN (single_succ (block))->values) > max_pa) | |
2257 | goto maybe_dump_sets; | |
2258 | ||
d75dbccd DB |
2259 | old_PA_IN = PA_IN (block); |
2260 | PA_OUT = bitmap_set_new (); | |
2261 | ||
2262 | /* If the block has no successors, ANTIC_OUT is empty. */ | |
2263 | if (EDGE_COUNT (block->succs) == 0) | |
2264 | ; | |
2265 | /* If we have one successor, we could have some phi nodes to | |
2266 | translate through. Note that we can't phi translate across DFS | |
89fb70a3 DB |
2267 | back edges in partial antic, because it uses a union operation on |
2268 | the successors. For recurrences like IV's, we will end up | |
2269 | generating a new value in the set on each go around (i + 3 (VH.1) | |
2270 | VH.1 + 1 (VH.2), VH.2 + 1 (VH.3), etc), forever. */ | |
d75dbccd DB |
2271 | else if (single_succ_p (block)) |
2272 | { | |
2273 | basic_block succ = single_succ (block); | |
2274 | if (!(single_succ_edge (block)->flags & EDGE_DFS_BACK)) | |
2275 | phi_translate_set (PA_OUT, PA_IN (succ), block, succ); | |
2276 | } | |
2277 | /* If we have multiple successors, we take the union of all of | |
2278 | them. */ | |
2279 | else | |
2280 | { | |
2281 | VEC(basic_block, heap) * worklist; | |
2282 | size_t i; | |
2283 | basic_block bprime; | |
2284 | ||
2285 | worklist = VEC_alloc (basic_block, heap, EDGE_COUNT (block->succs)); | |
2286 | FOR_EACH_EDGE (e, ei, block->succs) | |
2287 | { | |
2288 | if (e->flags & EDGE_DFS_BACK) | |
2289 | continue; | |
2290 | VEC_quick_push (basic_block, worklist, e->dest); | |
2291 | } | |
2292 | if (VEC_length (basic_block, worklist) > 0) | |
2293 | { | |
2294 | for (i = 0; VEC_iterate (basic_block, worklist, i, bprime); i++) | |
2295 | { | |
2296 | unsigned int i; | |
2297 | bitmap_iterator bi; | |
2298 | ||
2299 | FOR_EACH_EXPR_ID_IN_SET (ANTIC_IN (bprime), i, bi) | |
2300 | bitmap_value_insert_into_set (PA_OUT, | |
2301 | expression_for_id (i)); | |
1e4816bc DB |
2302 | if (phi_nodes (bprime)) |
2303 | { | |
2304 | bitmap_set_t pa_in = bitmap_set_new (); | |
2305 | phi_translate_set (pa_in, PA_IN (bprime), block, bprime); | |
2306 | FOR_EACH_EXPR_ID_IN_SET (pa_in, i, bi) | |
2307 | bitmap_value_insert_into_set (PA_OUT, | |
2308 | expression_for_id (i)); | |
2309 | bitmap_set_free (pa_in); | |
2310 | } | |
2311 | else | |
2312 | FOR_EACH_EXPR_ID_IN_SET (PA_IN (bprime), i, bi) | |
2313 | bitmap_value_insert_into_set (PA_OUT, | |
2314 | expression_for_id (i)); | |
d75dbccd DB |
2315 | } |
2316 | } | |
2317 | VEC_free (basic_block, heap, worklist); | |
2318 | } | |
2319 | ||
2320 | /* PA_IN starts with PA_OUT - TMP_GEN. | |
2321 | Then we subtract things from ANTIC_IN. */ | |
2322 | PA_IN (block) = bitmap_set_subtract (PA_OUT, TMP_GEN (block)); | |
2323 | ||
2324 | /* For partial antic, we want to put back in the phi results, since | |
2325 | we will properly avoid making them partially antic over backedges. */ | |
2326 | bitmap_ior_into (PA_IN (block)->values, PHI_GEN (block)->values); | |
2327 | bitmap_ior_into (PA_IN (block)->expressions, PHI_GEN (block)->expressions); | |
2328 | ||
2329 | /* PA_IN[block] = PA_IN[block] - ANTIC_IN[block] */ | |
2330 | bitmap_set_subtract_values (PA_IN (block), ANTIC_IN (block)); | |
2331 | ||
2332 | dependent_clean (PA_IN (block), ANTIC_IN (block), block); | |
2333 | ||
2334 | if (!bitmap_set_equal (old_PA_IN, PA_IN (block))) | |
2335 | { | |
2336 | changed = true; | |
2337 | SET_BIT (changed_blocks, block->index); | |
2338 | FOR_EACH_EDGE (e, ei, block->preds) | |
2339 | SET_BIT (changed_blocks, e->src->index); | |
2340 | } | |
2341 | else | |
2342 | RESET_BIT (changed_blocks, block->index); | |
2343 | ||
2344 | maybe_dump_sets: | |
2345 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
2346 | { | |
2347 | if (PA_OUT) | |
2348 | print_bitmap_set (dump_file, PA_OUT, "PA_OUT", block->index); | |
2349 | ||
2350 | print_bitmap_set (dump_file, PA_IN (block), "PA_IN", block->index); | |
2351 | } | |
2352 | if (old_PA_IN) | |
2353 | bitmap_set_free (old_PA_IN); | |
2354 | if (PA_OUT) | |
2355 | bitmap_set_free (PA_OUT); | |
2356 | return changed; | |
2357 | } | |
2358 | ||
83737db2 | 2359 | /* Compute ANTIC and partial ANTIC sets. */ |
6de9cd9a DN |
2360 | |
2361 | static void | |
7e6eb623 | 2362 | compute_antic (void) |
6de9cd9a | 2363 | { |
c33bae88 | 2364 | bool changed = true; |
7e6eb623 | 2365 | int num_iterations = 0; |
c33bae88 | 2366 | basic_block block; |
83737db2 | 2367 | int i; |
a28fee03 SB |
2368 | |
2369 | /* If any predecessor edges are abnormal, we punt, so antic_in is empty. | |
2370 | We pre-build the map of blocks with incoming abnormal edges here. */ | |
2371 | has_abnormal_preds = sbitmap_alloc (last_basic_block); | |
2372 | sbitmap_zero (has_abnormal_preds); | |
83737db2 | 2373 | |
a28fee03 | 2374 | FOR_EACH_BB (block) |
7e6eb623 | 2375 | { |
a28fee03 SB |
2376 | edge_iterator ei; |
2377 | edge e; | |
2378 | ||
2379 | FOR_EACH_EDGE (e, ei, block->preds) | |
83737db2 DB |
2380 | { |
2381 | e->flags &= ~EDGE_DFS_BACK; | |
2382 | if (e->flags & EDGE_ABNORMAL) | |
2383 | { | |
2384 | SET_BIT (has_abnormal_preds, block->index); | |
2385 | break; | |
2386 | } | |
2387 | } | |
a28fee03 | 2388 | |
83737db2 | 2389 | BB_VISITED (block) = 0; |
d75dbccd | 2390 | BB_DEFERRED (block) = 0; |
a28fee03 | 2391 | /* While we are here, give empty ANTIC_IN sets to each block. */ |
83737db2 | 2392 | ANTIC_IN (block) = bitmap_set_new (); |
d75dbccd | 2393 | PA_IN (block) = bitmap_set_new (); |
7e6eb623 | 2394 | } |
83737db2 | 2395 | |
a28fee03 | 2396 | /* At the exit block we anticipate nothing. */ |
83737db2 DB |
2397 | ANTIC_IN (EXIT_BLOCK_PTR) = bitmap_set_new (); |
2398 | BB_VISITED (EXIT_BLOCK_PTR) = 1; | |
d75dbccd | 2399 | PA_IN (EXIT_BLOCK_PTR) = bitmap_set_new (); |
a28fee03 | 2400 | |
83737db2 DB |
2401 | changed_blocks = sbitmap_alloc (last_basic_block + 1); |
2402 | sbitmap_ones (changed_blocks); | |
7e6eb623 DB |
2403 | while (changed) |
2404 | { | |
83737db2 DB |
2405 | if (dump_file && (dump_flags & TDF_DETAILS)) |
2406 | fprintf (dump_file, "Starting iteration %d\n", num_iterations); | |
a28fee03 | 2407 | num_iterations++; |
c33bae88 | 2408 | changed = false; |
0b355794 | 2409 | for (i = 0; i < n_basic_blocks - NUM_FIXED_BLOCKS; i++) |
83737db2 DB |
2410 | { |
2411 | if (TEST_BIT (changed_blocks, postorder[i])) | |
2412 | { | |
2413 | basic_block block = BASIC_BLOCK (postorder[i]); | |
2414 | changed |= compute_antic_aux (block, | |
2415 | TEST_BIT (has_abnormal_preds, | |
2416 | block->index)); | |
2417 | } | |
2418 | } | |
53983ae9 | 2419 | #ifdef ENABLE_CHECKING |
d75dbccd | 2420 | /* Theoretically possible, but *highly* unlikely. */ |
53983ae9 JJ |
2421 | gcc_assert (num_iterations < 500); |
2422 | #endif | |
2e24fa83 | 2423 | } |
a28fee03 | 2424 | |
9fe0cb7d RG |
2425 | statistics_histogram_event (cfun, "compute_antic iterations", |
2426 | num_iterations); | |
83737db2 | 2427 | |
d75dbccd DB |
2428 | if (do_partial_partial) |
2429 | { | |
2430 | sbitmap_ones (changed_blocks); | |
2431 | mark_dfs_back_edges (); | |
2432 | num_iterations = 0; | |
2433 | changed = true; | |
2434 | while (changed) | |
2435 | { | |
2436 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
2437 | fprintf (dump_file, "Starting iteration %d\n", num_iterations); | |
2438 | num_iterations++; | |
2439 | changed = false; | |
0b355794 | 2440 | for (i = 0; i < n_basic_blocks - NUM_FIXED_BLOCKS; i++) |
d75dbccd DB |
2441 | { |
2442 | if (TEST_BIT (changed_blocks, postorder[i])) | |
2443 | { | |
2444 | basic_block block = BASIC_BLOCK (postorder[i]); | |
2445 | changed | |
2446 | |= compute_partial_antic_aux (block, | |
2447 | TEST_BIT (has_abnormal_preds, | |
2448 | block->index)); | |
2449 | } | |
2450 | } | |
53983ae9 | 2451 | #ifdef ENABLE_CHECKING |
d75dbccd | 2452 | /* Theoretically possible, but *highly* unlikely. */ |
53983ae9 JJ |
2453 | gcc_assert (num_iterations < 500); |
2454 | #endif | |
d75dbccd | 2455 | } |
9fe0cb7d RG |
2456 | statistics_histogram_event (cfun, "compute_partial_antic iterations", |
2457 | num_iterations); | |
d75dbccd | 2458 | } |
83737db2 DB |
2459 | sbitmap_free (has_abnormal_preds); |
2460 | sbitmap_free (changed_blocks); | |
6de9cd9a DN |
2461 | } |
2462 | ||
c90186eb DB |
2463 | /* Return true if we can value number the call in STMT. This is true |
2464 | if we have a pure or constant call. */ | |
2465 | ||
2466 | static bool | |
726a989a | 2467 | can_value_number_call (gimple stmt) |
c90186eb | 2468 | { |
726a989a | 2469 | if (gimple_call_flags (stmt) & (ECF_PURE | ECF_CONST)) |
c90186eb DB |
2470 | return true; |
2471 | return false; | |
2472 | } | |
2473 | ||
b941a8ae | 2474 | /* Return true if OP is an exception handler related operation, such as |
070b797d | 2475 | FILTER_EXPR or EXC_PTR_EXPR. */ |
b941a8ae DB |
2476 | |
2477 | static bool | |
726a989a | 2478 | is_exception_related (gimple stmt) |
b941a8ae | 2479 | { |
726a989a RB |
2480 | return (is_gimple_assign (stmt) |
2481 | && (gimple_assign_rhs_code (stmt) == FILTER_EXPR | |
2482 | || gimple_assign_rhs_code (stmt) == EXC_PTR_EXPR)); | |
b941a8ae DB |
2483 | } |
2484 | ||
c90186eb DB |
2485 | /* Return true if OP is a tree which we can perform PRE on |
2486 | on. This may not match the operations we can value number, but in | |
2487 | a perfect world would. */ | |
2488 | ||
2489 | static bool | |
2490 | can_PRE_operation (tree op) | |
2491 | { | |
2492 | return UNARY_CLASS_P (op) | |
2493 | || BINARY_CLASS_P (op) | |
2494 | || COMPARISON_CLASS_P (op) | |
2495 | || TREE_CODE (op) == INDIRECT_REF | |
85300b46 | 2496 | || TREE_CODE (op) == COMPONENT_REF |
3d45dd59 | 2497 | || TREE_CODE (op) == VIEW_CONVERT_EXPR |
e13f1c14 AP |
2498 | || TREE_CODE (op) == CALL_EXPR |
2499 | || TREE_CODE (op) == ARRAY_REF; | |
c90186eb DB |
2500 | } |
2501 | ||
2502 | ||
2503 | /* Inserted expressions are placed onto this worklist, which is used | |
2504 | for performing quick dead code elimination of insertions we made | |
2505 | that didn't turn out to be necessary. */ | |
726a989a | 2506 | static VEC(gimple,heap) *inserted_exprs; |
c90186eb DB |
2507 | |
2508 | /* Pool allocated fake store expressions are placed onto this | |
2509 | worklist, which, after performing dead code elimination, is walked | |
2510 | to see which expressions need to be put into GC'able memory */ | |
726a989a | 2511 | static VEC(gimple, heap) *need_creation; |
c90186eb | 2512 | |
ce94d354 | 2513 | /* The actual worker for create_component_ref_by_pieces. */ |
b9c5e484 | 2514 | |
85300b46 | 2515 | static tree |
ce94d354 RG |
2516 | create_component_ref_by_pieces_1 (basic_block block, vn_reference_t ref, |
2517 | unsigned int *operand, gimple_seq *stmts, | |
2518 | gimple domstmt) | |
85300b46 | 2519 | { |
c9145754 | 2520 | vn_reference_op_t currop = VEC_index (vn_reference_op_s, ref->operands, |
ce94d354 | 2521 | *operand); |
c9145754 | 2522 | tree genop; |
ce94d354 | 2523 | ++*operand; |
c9145754 | 2524 | switch (currop->opcode) |
85300b46 | 2525 | { |
c9145754 DB |
2526 | case CALL_EXPR: |
2527 | { | |
7aec7a38 | 2528 | tree folded, sc = currop->op1; |
ce94d354 RG |
2529 | unsigned int nargs = 0; |
2530 | tree *args = XNEWVEC (tree, VEC_length (vn_reference_op_s, | |
2531 | ref->operands) - 1); | |
2532 | while (*operand < VEC_length (vn_reference_op_s, ref->operands)) | |
c9145754 | 2533 | { |
ce94d354 RG |
2534 | args[nargs] = create_component_ref_by_pieces_1 (block, ref, |
2535 | operand, stmts, | |
2536 | domstmt); | |
2537 | nargs++; | |
c9145754 | 2538 | } |
726a989a | 2539 | folded = build_call_array (currop->type, |
ce94d354 RG |
2540 | TREE_CODE (currop->op0) == FUNCTION_DECL |
2541 | ? build_fold_addr_expr (currop->op0) | |
2542 | : currop->op0, | |
726a989a | 2543 | nargs, args); |
c9145754 | 2544 | free (args); |
7aec7a38 EB |
2545 | if (sc) |
2546 | { | |
2547 | pre_expr scexpr = get_or_alloc_expr_for (sc); | |
2548 | sc = find_or_generate_expression (block, scexpr, stmts, domstmt); | |
2549 | if (!sc) | |
2550 | return NULL_TREE; | |
2551 | CALL_EXPR_STATIC_CHAIN (folded) = sc; | |
2552 | } | |
c9145754 DB |
2553 | return folded; |
2554 | } | |
2555 | break; | |
ce94d354 RG |
2556 | case ADDR_EXPR: |
2557 | if (currop->op0) | |
2558 | { | |
2559 | gcc_assert (is_gimple_min_invariant (currop->op0)); | |
2560 | return currop->op0; | |
2561 | } | |
2562 | /* Fallthrough. */ | |
c9145754 DB |
2563 | case REALPART_EXPR: |
2564 | case IMAGPART_EXPR: | |
2565 | case VIEW_CONVERT_EXPR: | |
2566 | { | |
2567 | tree folded; | |
ce94d354 RG |
2568 | tree genop0 = create_component_ref_by_pieces_1 (block, ref, |
2569 | operand, | |
2570 | stmts, domstmt); | |
c9145754 DB |
2571 | if (!genop0) |
2572 | return NULL_TREE; | |
2573 | folded = fold_build1 (currop->opcode, currop->type, | |
2574 | genop0); | |
2575 | return folded; | |
2576 | } | |
2577 | break; | |
2578 | case ALIGN_INDIRECT_REF: | |
2579 | case MISALIGNED_INDIRECT_REF: | |
2580 | case INDIRECT_REF: | |
2581 | { | |
ce94d354 RG |
2582 | tree folded; |
2583 | tree genop1 = create_component_ref_by_pieces_1 (block, ref, | |
2584 | operand, | |
2585 | stmts, domstmt); | |
2586 | if (!genop1) | |
2587 | return NULL_TREE; | |
2588 | genop1 = fold_convert (build_pointer_type (currop->type), | |
2589 | genop1); | |
c9145754 | 2590 | |
53f3815c RG |
2591 | if (currop->opcode == MISALIGNED_INDIRECT_REF) |
2592 | folded = fold_build2 (currop->opcode, currop->type, | |
2593 | genop1, currop->op1); | |
2594 | else | |
2595 | folded = fold_build1 (currop->opcode, currop->type, | |
2596 | genop1); | |
ce94d354 | 2597 | return folded; |
c9145754 DB |
2598 | } |
2599 | break; | |
2600 | case BIT_FIELD_REF: | |
e13f1c14 | 2601 | { |
c9145754 | 2602 | tree folded; |
ce94d354 RG |
2603 | tree genop0 = create_component_ref_by_pieces_1 (block, ref, operand, |
2604 | stmts, domstmt); | |
c9145754 DB |
2605 | pre_expr op1expr = get_or_alloc_expr_for (currop->op0); |
2606 | pre_expr op2expr = get_or_alloc_expr_for (currop->op1); | |
2607 | tree genop1; | |
2608 | tree genop2; | |
2609 | ||
2610 | if (!genop0) | |
2611 | return NULL_TREE; | |
2612 | genop1 = find_or_generate_expression (block, op1expr, stmts, domstmt); | |
2613 | if (!genop1) | |
3d45dd59 | 2614 | return NULL_TREE; |
c9145754 DB |
2615 | genop2 = find_or_generate_expression (block, op2expr, stmts, domstmt); |
2616 | if (!genop2) | |
2617 | return NULL_TREE; | |
2618 | folded = fold_build3 (BIT_FIELD_REF, currop->type, genop0, genop1, | |
2619 | genop2); | |
e13f1c14 AP |
2620 | return folded; |
2621 | } | |
c9145754 DB |
2622 | |
2623 | /* For array ref vn_reference_op's, operand 1 of the array ref | |
2624 | is op0 of the reference op and operand 3 of the array ref is | |
2625 | op1. */ | |
2626 | case ARRAY_RANGE_REF: | |
2627 | case ARRAY_REF: | |
2628 | { | |
c9145754 DB |
2629 | tree genop0; |
2630 | tree genop1 = currop->op0; | |
2631 | pre_expr op1expr; | |
2632 | tree genop2 = currop->op1; | |
2633 | pre_expr op2expr; | |
2634 | tree genop3; | |
ce94d354 RG |
2635 | genop0 = create_component_ref_by_pieces_1 (block, ref, operand, |
2636 | stmts, domstmt); | |
c9145754 DB |
2637 | if (!genop0) |
2638 | return NULL_TREE; | |
2639 | op1expr = get_or_alloc_expr_for (genop1); | |
2640 | genop1 = find_or_generate_expression (block, op1expr, stmts, domstmt); | |
2641 | if (!genop1) | |
2642 | return NULL_TREE; | |
2643 | if (genop2) | |
2644 | { | |
2645 | op2expr = get_or_alloc_expr_for (genop2); | |
2646 | genop2 = find_or_generate_expression (block, op2expr, stmts, | |
2647 | domstmt); | |
2648 | if (!genop2) | |
2649 | return NULL_TREE; | |
2650 | } | |
2651 | ||
2652 | genop3 = currop->op2; | |
2653 | return build4 (currop->opcode, currop->type, genop0, genop1, | |
2654 | genop2, genop3); | |
2655 | } | |
85300b46 DB |
2656 | case COMPONENT_REF: |
2657 | { | |
2658 | tree op0; | |
2659 | tree op1; | |
c9145754 DB |
2660 | tree genop2 = currop->op1; |
2661 | pre_expr op2expr; | |
ce94d354 RG |
2662 | op0 = create_component_ref_by_pieces_1 (block, ref, operand, |
2663 | stmts, domstmt); | |
3d45dd59 RG |
2664 | if (!op0) |
2665 | return NULL_TREE; | |
89fb70a3 DB |
2666 | /* op1 should be a FIELD_DECL, which are represented by |
2667 | themselves. */ | |
c9145754 DB |
2668 | op1 = currop->op0; |
2669 | if (genop2) | |
2670 | { | |
2671 | op2expr = get_or_alloc_expr_for (genop2); | |
2672 | genop2 = find_or_generate_expression (block, op2expr, stmts, | |
2673 | domstmt); | |
2674 | if (!genop2) | |
2675 | return NULL_TREE; | |
2676 | } | |
2677 | ||
2678 | return fold_build3 (COMPONENT_REF, TREE_TYPE (op1), op0, op1, | |
2679 | genop2); | |
85300b46 DB |
2680 | } |
2681 | break; | |
c9145754 | 2682 | case SSA_NAME: |
85300b46 | 2683 | { |
c9145754 DB |
2684 | pre_expr op0expr = get_or_alloc_expr_for (currop->op0); |
2685 | genop = find_or_generate_expression (block, op0expr, stmts, domstmt); | |
2686 | return genop; | |
85300b46 | 2687 | } |
c9145754 DB |
2688 | case STRING_CST: |
2689 | case INTEGER_CST: | |
2690 | case COMPLEX_CST: | |
2691 | case VECTOR_CST: | |
2692 | case REAL_CST: | |
2693 | case CONSTRUCTOR: | |
85300b46 DB |
2694 | case VAR_DECL: |
2695 | case PARM_DECL: | |
c9145754 | 2696 | case CONST_DECL: |
5230d884 | 2697 | case RESULT_DECL: |
c9145754 | 2698 | case FUNCTION_DECL: |
c9145754 DB |
2699 | return currop->op0; |
2700 | ||
85300b46 | 2701 | default: |
b9c5e484 | 2702 | gcc_unreachable (); |
85300b46 | 2703 | } |
85300b46 | 2704 | } |
c90186eb | 2705 | |
ce94d354 RG |
2706 | /* For COMPONENT_REF's and ARRAY_REF's, we can't have any intermediates for the |
2707 | COMPONENT_REF or INDIRECT_REF or ARRAY_REF portion, because we'd end up with | |
2708 | trying to rename aggregates into ssa form directly, which is a no no. | |
2709 | ||
2710 | Thus, this routine doesn't create temporaries, it just builds a | |
2711 | single access expression for the array, calling | |
2712 | find_or_generate_expression to build the innermost pieces. | |
2713 | ||
2714 | This function is a subroutine of create_expression_by_pieces, and | |
2715 | should not be called on it's own unless you really know what you | |
2716 | are doing. */ | |
2717 | ||
2718 | static tree | |
2719 | create_component_ref_by_pieces (basic_block block, vn_reference_t ref, | |
2720 | gimple_seq *stmts, gimple domstmt) | |
2721 | { | |
2722 | unsigned int op = 0; | |
2723 | return create_component_ref_by_pieces_1 (block, ref, &op, stmts, domstmt); | |
2724 | } | |
2725 | ||
56db793a DB |
2726 | /* Find a leader for an expression, or generate one using |
2727 | create_expression_by_pieces if it's ANTIC but | |
b9c5e484 | 2728 | complex. |
56db793a | 2729 | BLOCK is the basic_block we are looking for leaders in. |
b9c5e484 | 2730 | EXPR is the expression to find a leader or generate for. |
56db793a DB |
2731 | STMTS is the statement list to put the inserted expressions on. |
2732 | Returns the SSA_NAME of the LHS of the generated expression or the | |
3d45dd59 RG |
2733 | leader. |
2734 | DOMSTMT if non-NULL is a statement that should be dominated by | |
2735 | all uses in the generated expression. If DOMSTMT is non-NULL this | |
2736 | routine can fail and return NULL_TREE. Otherwise it will assert | |
2737 | on failure. */ | |
56db793a DB |
2738 | |
2739 | static tree | |
726a989a RB |
2740 | find_or_generate_expression (basic_block block, pre_expr expr, |
2741 | gimple_seq *stmts, gimple domstmt) | |
56db793a | 2742 | { |
726a989a RB |
2743 | pre_expr leader = bitmap_find_leader (AVAIL_OUT (block), |
2744 | get_expr_value_id (expr), domstmt); | |
c9145754 DB |
2745 | tree genop = NULL; |
2746 | if (leader) | |
2747 | { | |
2748 | if (leader->kind == NAME) | |
2749 | genop = PRE_EXPR_NAME (leader); | |
2750 | else if (leader->kind == CONSTANT) | |
2751 | genop = PRE_EXPR_CONSTANT (leader); | |
2752 | } | |
e9284566 | 2753 | |
0e61db61 | 2754 | /* If it's still NULL, it must be a complex expression, so generate |
ecb4e37b RG |
2755 | it recursively. Not so for FRE though. */ |
2756 | if (genop == NULL | |
2757 | && !in_fre) | |
56db793a | 2758 | { |
c9145754 DB |
2759 | bitmap_set_t exprset; |
2760 | unsigned int lookfor = get_expr_value_id (expr); | |
89fb70a3 DB |
2761 | bool handled = false; |
2762 | bitmap_iterator bi; | |
2763 | unsigned int i; | |
c90186eb | 2764 | |
c9145754 | 2765 | exprset = VEC_index (bitmap_set_t, value_expressions, lookfor); |
89fb70a3 DB |
2766 | FOR_EACH_EXPR_ID_IN_SET (exprset, i, bi) |
2767 | { | |
c9145754 DB |
2768 | pre_expr temp = expression_for_id (i); |
2769 | if (temp->kind != NAME) | |
89fb70a3 DB |
2770 | { |
2771 | handled = true; | |
c9145754 DB |
2772 | genop = create_expression_by_pieces (block, temp, stmts, |
2773 | domstmt, | |
2774 | get_expr_type (expr)); | |
89fb70a3 DB |
2775 | break; |
2776 | } | |
2777 | } | |
3d45dd59 RG |
2778 | if (!handled && domstmt) |
2779 | return NULL_TREE; | |
2780 | ||
89fb70a3 | 2781 | gcc_assert (handled); |
56db793a DB |
2782 | } |
2783 | return genop; | |
2784 | } | |
2785 | ||
726a989a | 2786 | #define NECESSARY GF_PLF_1 |
c9145754 | 2787 | |
56db793a | 2788 | /* Create an expression in pieces, so that we can handle very complex |
b9c5e484 | 2789 | expressions that may be ANTIC, but not necessary GIMPLE. |
56db793a DB |
2790 | BLOCK is the basic block the expression will be inserted into, |
2791 | EXPR is the expression to insert (in value form) | |
2792 | STMTS is a statement list to append the necessary insertions into. | |
2793 | ||
0e61db61 | 2794 | This function will die if we hit some value that shouldn't be |
56db793a DB |
2795 | ANTIC but is (IE there is no leader for it, or its components). |
2796 | This function may also generate expressions that are themselves | |
2797 | partially or fully redundant. Those that are will be either made | |
2798 | fully redundant during the next iteration of insert (for partially | |
2799 | redundant ones), or eliminated by eliminate (for fully redundant | |
3d45dd59 RG |
2800 | ones). |
2801 | ||
2802 | If DOMSTMT is non-NULL then we make sure that all uses in the | |
2803 | expressions dominate that statement. In this case the function | |
2804 | can return NULL_TREE to signal failure. */ | |
56db793a DB |
2805 | |
2806 | static tree | |
726a989a RB |
2807 | create_expression_by_pieces (basic_block block, pre_expr expr, |
2808 | gimple_seq *stmts, gimple domstmt, tree type) | |
56db793a | 2809 | { |
81c4f554 | 2810 | tree temp, name; |
726a989a RB |
2811 | tree folded, newexpr; |
2812 | gimple_seq forced_stmts; | |
c9145754 | 2813 | unsigned int value_id; |
726a989a | 2814 | gimple_stmt_iterator gsi; |
c9145754 DB |
2815 | tree exprtype = type ? type : get_expr_type (expr); |
2816 | pre_expr nameexpr; | |
726a989a | 2817 | gimple newstmt; |
81c4f554 | 2818 | |
c9145754 | 2819 | switch (expr->kind) |
56db793a | 2820 | { |
c9145754 DB |
2821 | /* We may hit the NAME/CONSTANT case if we have to convert types |
2822 | that value numbering saw through. */ | |
2823 | case NAME: | |
2824 | folded = PRE_EXPR_NAME (expr); | |
2825 | break; | |
2826 | case CONSTANT: | |
2827 | folded = PRE_EXPR_CONSTANT (expr); | |
2828 | break; | |
2829 | case REFERENCE: | |
43da81be | 2830 | { |
c9145754 | 2831 | vn_reference_t ref = PRE_EXPR_REFERENCE (expr); |
ce94d354 | 2832 | folded = create_component_ref_by_pieces (block, ref, stmts, domstmt); |
43da81be DB |
2833 | } |
2834 | break; | |
c9145754 | 2835 | case NARY: |
c90186eb | 2836 | { |
c9145754 DB |
2837 | vn_nary_op_t nary = PRE_EXPR_NARY (expr); |
2838 | switch (nary->length) | |
85300b46 | 2839 | { |
c9145754 DB |
2840 | case 2: |
2841 | { | |
2842 | pre_expr op1 = get_or_alloc_expr_for (nary->op[0]); | |
2843 | pre_expr op2 = get_or_alloc_expr_for (nary->op[1]); | |
2844 | tree genop1 = find_or_generate_expression (block, op1, | |
2845 | stmts, domstmt); | |
2846 | tree genop2 = find_or_generate_expression (block, op2, | |
2847 | stmts, domstmt); | |
2848 | if (!genop1 || !genop2) | |
2849 | return NULL_TREE; | |
6999afe1 DB |
2850 | genop1 = fold_convert (TREE_TYPE (nary->op[0]), |
2851 | genop1); | |
726a989a RB |
2852 | /* Ensure op2 is a sizetype for POINTER_PLUS_EXPR. It |
2853 | may be a constant with the wrong type. */ | |
2854 | if (nary->opcode == POINTER_PLUS_EXPR) | |
2855 | genop2 = fold_convert (sizetype, genop2); | |
2856 | else | |
2857 | genop2 = fold_convert (TREE_TYPE (nary->op[1]), genop2); | |
6999afe1 | 2858 | |
c9145754 DB |
2859 | folded = fold_build2 (nary->opcode, nary->type, |
2860 | genop1, genop2); | |
2861 | } | |
2862 | break; | |
2863 | case 1: | |
2864 | { | |
2865 | pre_expr op1 = get_or_alloc_expr_for (nary->op[0]); | |
2866 | tree genop1 = find_or_generate_expression (block, op1, | |
2867 | stmts, domstmt); | |
2868 | if (!genop1) | |
2869 | return NULL_TREE; | |
6999afe1 DB |
2870 | genop1 = fold_convert (TREE_TYPE (nary->op[0]), genop1); |
2871 | ||
c9145754 DB |
2872 | folded = fold_build1 (nary->opcode, nary->type, |
2873 | genop1); | |
2874 | } | |
2875 | break; | |
2876 | default: | |
2877 | return NULL_TREE; | |
85300b46 | 2878 | } |
56db793a | 2879 | } |
c9145754 | 2880 | break; |
56db793a | 2881 | default: |
c9145754 | 2882 | return NULL_TREE; |
56db793a | 2883 | } |
c9145754 | 2884 | folded = fold_convert (exprtype, folded); |
81c4f554 SB |
2885 | /* Force the generated expression to be a sequence of GIMPLE |
2886 | statements. | |
2887 | We have to call unshare_expr because force_gimple_operand may | |
2888 | modify the tree we pass to it. */ | |
b9c5e484 | 2889 | newexpr = force_gimple_operand (unshare_expr (folded), &forced_stmts, |
83737db2 | 2890 | false, NULL); |
81c4f554 SB |
2891 | |
2892 | /* If we have any intermediate expressions to the value sets, add them | |
a7849637 | 2893 | to the value sets and chain them in the instruction stream. */ |
81c4f554 SB |
2894 | if (forced_stmts) |
2895 | { | |
726a989a RB |
2896 | gsi = gsi_start (forced_stmts); |
2897 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) | |
81c4f554 | 2898 | { |
726a989a RB |
2899 | gimple stmt = gsi_stmt (gsi); |
2900 | tree forcedname = gimple_get_lhs (stmt); | |
c9145754 | 2901 | pre_expr nameexpr; |
b9c5e484 | 2902 | |
726a989a | 2903 | VEC_safe_push (gimple, heap, inserted_exprs, stmt); |
c9145754 DB |
2904 | if (TREE_CODE (forcedname) == SSA_NAME) |
2905 | { | |
2906 | VN_INFO_GET (forcedname)->valnum = forcedname; | |
2907 | VN_INFO (forcedname)->value_id = get_next_value_id (); | |
2908 | nameexpr = get_or_alloc_expr_for_name (forcedname); | |
2909 | add_to_value (VN_INFO (forcedname)->value_id, nameexpr); | |
c8ce33fa RG |
2910 | if (!in_fre) |
2911 | bitmap_value_replace_in_set (NEW_SETS (block), nameexpr); | |
c9145754 DB |
2912 | bitmap_value_replace_in_set (AVAIL_OUT (block), nameexpr); |
2913 | } | |
cfaab3a9 | 2914 | mark_symbols_for_renaming (stmt); |
81c4f554 | 2915 | } |
726a989a | 2916 | gimple_seq_add_seq (stmts, forced_stmts); |
81c4f554 SB |
2917 | } |
2918 | ||
2919 | /* Build and insert the assignment of the end result to the temporary | |
2920 | that we will return. */ | |
c9145754 | 2921 | if (!pretemp || exprtype != TREE_TYPE (pretemp)) |
c90186eb | 2922 | { |
c9145754 | 2923 | pretemp = create_tmp_var (exprtype, "pretmp"); |
c90186eb DB |
2924 | get_var_ann (pretemp); |
2925 | } | |
2926 | ||
2927 | temp = pretemp; | |
f004ab02 | 2928 | add_referenced_var (temp); |
c90186eb | 2929 | |
c9145754 DB |
2930 | if (TREE_CODE (exprtype) == COMPLEX_TYPE |
2931 | || TREE_CODE (exprtype) == VECTOR_TYPE) | |
0890b981 | 2932 | DECL_GIMPLE_REG_P (temp) = 1; |
c90186eb | 2933 | |
726a989a RB |
2934 | newstmt = gimple_build_assign (temp, newexpr); |
2935 | name = make_ssa_name (temp, newstmt); | |
2936 | gimple_assign_set_lhs (newstmt, name); | |
2937 | gimple_set_plf (newstmt, NECESSARY, false); | |
c90186eb | 2938 | |
726a989a RB |
2939 | gimple_seq_add_stmt (stmts, newstmt); |
2940 | VEC_safe_push (gimple, heap, inserted_exprs, newstmt); | |
cfaab3a9 DN |
2941 | |
2942 | /* All the symbols in NEWEXPR should be put into SSA form. */ | |
726a989a | 2943 | mark_symbols_for_renaming (newstmt); |
81c4f554 | 2944 | |
c9145754 | 2945 | /* Add a value number to the temporary. |
81c4f554 | 2946 | The value may already exist in either NEW_SETS, or AVAIL_OUT, because |
e9284566 DB |
2947 | we are creating the expression by pieces, and this particular piece of |
2948 | the expression may have been represented. There is no harm in replacing | |
2949 | here. */ | |
89fb70a3 | 2950 | VN_INFO_GET (name)->valnum = name; |
c9145754 DB |
2951 | value_id = get_expr_value_id (expr); |
2952 | VN_INFO (name)->value_id = value_id; | |
2953 | nameexpr = get_or_alloc_expr_for_name (name); | |
2954 | add_to_value (value_id, nameexpr); | |
3d45dd59 | 2955 | if (!in_fre) |
c9145754 DB |
2956 | bitmap_value_replace_in_set (NEW_SETS (block), nameexpr); |
2957 | bitmap_value_replace_in_set (AVAIL_OUT (block), nameexpr); | |
81c4f554 SB |
2958 | |
2959 | pre_stats.insertions++; | |
56db793a | 2960 | if (dump_file && (dump_flags & TDF_DETAILS)) |
b9c5e484 | 2961 | { |
56db793a | 2962 | fprintf (dump_file, "Inserted "); |
726a989a | 2963 | print_gimple_stmt (dump_file, newstmt, 0, 0); |
56db793a DB |
2964 | fprintf (dump_file, " in predecessor %d\n", block->index); |
2965 | } | |
81c4f554 | 2966 | |
56db793a DB |
2967 | return name; |
2968 | } | |
e9284566 | 2969 | |
c9145754 | 2970 | |
83737db2 | 2971 | /* Insert the to-be-made-available values of expression EXPRNUM for each |
c90186eb | 2972 | predecessor, stored in AVAIL, into the predecessors of BLOCK, and |
c9145754 | 2973 | merge the result with a phi node, given the same value number as |
c90186eb | 2974 | NODE. Return true if we have inserted new stuff. */ |
e9284566 DB |
2975 | |
2976 | static bool | |
83737db2 | 2977 | insert_into_preds_of_block (basic_block block, unsigned int exprnum, |
c9145754 | 2978 | pre_expr *avail) |
e9284566 | 2979 | { |
c9145754 DB |
2980 | pre_expr expr = expression_for_id (exprnum); |
2981 | pre_expr newphi; | |
2982 | unsigned int val = get_expr_value_id (expr); | |
e9284566 | 2983 | edge pred; |
0fc6c492 DB |
2984 | bool insertions = false; |
2985 | bool nophi = false; | |
e9284566 | 2986 | basic_block bprime; |
c9145754 | 2987 | pre_expr eprime; |
e9284566 | 2988 | edge_iterator ei; |
c9145754 | 2989 | tree type = get_expr_type (expr); |
de081cfd | 2990 | tree temp; |
726a989a | 2991 | gimple phi; |
b9c5e484 | 2992 | |
e9284566 DB |
2993 | if (dump_file && (dump_flags & TDF_DETAILS)) |
2994 | { | |
2995 | fprintf (dump_file, "Found partial redundancy for expression "); | |
c9145754 DB |
2996 | print_pre_expr (dump_file, expr); |
2997 | fprintf (dump_file, " (%04d)\n", val); | |
e9284566 DB |
2998 | } |
2999 | ||
0fc6c492 | 3000 | /* Make sure we aren't creating an induction variable. */ |
c90186eb | 3001 | if (block->loop_depth > 0 && EDGE_COUNT (block->preds) == 2 |
c9145754 | 3002 | && expr->kind != REFERENCE) |
0fc6c492 DB |
3003 | { |
3004 | bool firstinsideloop = false; | |
3005 | bool secondinsideloop = false; | |
b9c5e484 | 3006 | firstinsideloop = flow_bb_inside_loop_p (block->loop_father, |
0fc6c492 DB |
3007 | EDGE_PRED (block, 0)->src); |
3008 | secondinsideloop = flow_bb_inside_loop_p (block->loop_father, | |
3009 | EDGE_PRED (block, 1)->src); | |
3010 | /* Induction variables only have one edge inside the loop. */ | |
3011 | if (firstinsideloop ^ secondinsideloop) | |
3012 | { | |
3013 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
3014 | fprintf (dump_file, "Skipping insertion of phi for partial redundancy: Looks like an induction variable\n"); | |
3015 | nophi = true; | |
3016 | } | |
3017 | } | |
b9c5e484 | 3018 | |
890065bf RG |
3019 | /* Make sure we are not inserting trapping expressions. */ |
3020 | FOR_EACH_EDGE (pred, ei, block->preds) | |
3021 | { | |
3022 | bprime = pred->src; | |
3023 | eprime = avail[bprime->index]; | |
3024 | if (eprime->kind == NARY | |
3025 | && vn_nary_may_trap (PRE_EXPR_NARY (eprime))) | |
3026 | return false; | |
3027 | } | |
0fc6c492 | 3028 | |
c9145754 DB |
3029 | /* Make the necessary insertions. */ |
3030 | FOR_EACH_EDGE (pred, ei, block->preds) | |
3031 | { | |
726a989a | 3032 | gimple_seq stmts = NULL; |
c9145754 DB |
3033 | tree builtexpr; |
3034 | bprime = pred->src; | |
3035 | eprime = avail[bprime->index]; | |
3036 | ||
3037 | if (eprime->kind != NAME && eprime->kind != CONSTANT) | |
3038 | { | |
3039 | builtexpr = create_expression_by_pieces (bprime, | |
3040 | eprime, | |
726a989a | 3041 | &stmts, NULL, |
c9145754 DB |
3042 | type); |
3043 | gcc_assert (!(pred->flags & EDGE_ABNORMAL)); | |
726a989a | 3044 | gsi_insert_seq_on_edge (pred, stmts); |
c9145754 DB |
3045 | avail[bprime->index] = get_or_alloc_expr_for_name (builtexpr); |
3046 | insertions = true; | |
3047 | } | |
3048 | else if (eprime->kind == CONSTANT) | |
3049 | { | |
3050 | /* Constants may not have the right type, fold_convert | |
3051 | should give us back a constant with the right type. | |
3052 | */ | |
3053 | tree constant = PRE_EXPR_CONSTANT (eprime); | |
15d5fe33 | 3054 | if (!useless_type_conversion_p (type, TREE_TYPE (constant))) |
c9145754 DB |
3055 | { |
3056 | tree builtexpr = fold_convert (type, constant); | |
15d5fe33 | 3057 | if (!is_gimple_min_invariant (builtexpr)) |
c9145754 DB |
3058 | { |
3059 | tree forcedexpr = force_gimple_operand (builtexpr, | |
3060 | &stmts, true, | |
3061 | NULL); | |
15d5fe33 | 3062 | if (!is_gimple_min_invariant (forcedexpr)) |
c9145754 DB |
3063 | { |
3064 | if (forcedexpr != builtexpr) | |
3065 | { | |
3066 | VN_INFO_GET (forcedexpr)->valnum = PRE_EXPR_CONSTANT (eprime); | |
3067 | VN_INFO (forcedexpr)->value_id = get_expr_value_id (eprime); | |
3068 | } | |
3069 | if (stmts) | |
3070 | { | |
726a989a RB |
3071 | gimple_stmt_iterator gsi; |
3072 | gsi = gsi_start (stmts); | |
3073 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) | |
c9145754 | 3074 | { |
726a989a RB |
3075 | gimple stmt = gsi_stmt (gsi); |
3076 | VEC_safe_push (gimple, heap, inserted_exprs, stmt); | |
3077 | gimple_set_plf (stmt, NECESSARY, false); | |
c9145754 | 3078 | } |
726a989a | 3079 | gsi_insert_seq_on_edge (pred, stmts); |
c9145754 | 3080 | } |
c9145754 DB |
3081 | avail[bprime->index] = get_or_alloc_expr_for_name (forcedexpr); |
3082 | } | |
3083 | } | |
3084 | } | |
3085 | } | |
3086 | else if (eprime->kind == NAME) | |
3087 | { | |
3088 | /* We may have to do a conversion because our value | |
3089 | numbering can look through types in certain cases, but | |
3090 | our IL requires all operands of a phi node have the same | |
3091 | type. */ | |
3092 | tree name = PRE_EXPR_NAME (eprime); | |
f709638a | 3093 | if (!useless_type_conversion_p (type, TREE_TYPE (name))) |
c9145754 DB |
3094 | { |
3095 | tree builtexpr; | |
3096 | tree forcedexpr; | |
f709638a | 3097 | builtexpr = fold_convert (type, name); |
c9145754 DB |
3098 | forcedexpr = force_gimple_operand (builtexpr, |
3099 | &stmts, true, | |
3100 | NULL); | |
3101 | ||
3102 | if (forcedexpr != name) | |
3103 | { | |
3104 | VN_INFO_GET (forcedexpr)->valnum = VN_INFO (name)->valnum; | |
3105 | VN_INFO (forcedexpr)->value_id = VN_INFO (name)->value_id; | |
3106 | } | |
c90186eb | 3107 | |
c9145754 DB |
3108 | if (stmts) |
3109 | { | |
726a989a RB |
3110 | gimple_stmt_iterator gsi; |
3111 | gsi = gsi_start (stmts); | |
3112 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) | |
c9145754 | 3113 | { |
726a989a RB |
3114 | gimple stmt = gsi_stmt (gsi); |
3115 | VEC_safe_push (gimple, heap, inserted_exprs, stmt); | |
3116 | gimple_set_plf (stmt, NECESSARY, false); | |
c9145754 | 3117 | } |
726a989a | 3118 | gsi_insert_seq_on_edge (pred, stmts); |
c9145754 | 3119 | } |
c9145754 DB |
3120 | avail[bprime->index] = get_or_alloc_expr_for_name (forcedexpr); |
3121 | } | |
b9c5e484 | 3122 | } |
e9284566 | 3123 | } |
0fc6c492 DB |
3124 | /* If we didn't want a phi node, and we made insertions, we still have |
3125 | inserted new stuff, and thus return true. If we didn't want a phi node, | |
3126 | and didn't make insertions, we haven't added anything new, so return | |
3127 | false. */ | |
3128 | if (nophi && insertions) | |
3129 | return true; | |
3130 | else if (nophi && !insertions) | |
3131 | return false; | |
3132 | ||
e9284566 | 3133 | /* Now build a phi for the new variable. */ |
c90186eb DB |
3134 | if (!prephitemp || TREE_TYPE (prephitemp) != type) |
3135 | { | |
3136 | prephitemp = create_tmp_var (type, "prephitmp"); | |
3137 | get_var_ann (prephitemp); | |
3138 | } | |
3139 | ||
3140 | temp = prephitemp; | |
f004ab02 | 3141 | add_referenced_var (temp); |
c90186eb | 3142 | |
0890b981 AP |
3143 | if (TREE_CODE (type) == COMPLEX_TYPE |
3144 | || TREE_CODE (type) == VECTOR_TYPE) | |
3145 | DECL_GIMPLE_REG_P (temp) = 1; | |
1e52075c | 3146 | phi = create_phi_node (temp, block); |
de081cfd RG |
3147 | |
3148 | gimple_set_plf (phi, NECESSARY, false); | |
3149 | VN_INFO_GET (gimple_phi_result (phi))->valnum = gimple_phi_result (phi); | |
3150 | VN_INFO (gimple_phi_result (phi))->value_id = val; | |
3151 | VEC_safe_push (gimple, heap, inserted_exprs, phi); | |
e9284566 | 3152 | FOR_EACH_EDGE (pred, ei, block->preds) |
c9145754 DB |
3153 | { |
3154 | pre_expr ae = avail[pred->src->index]; | |
3155 | gcc_assert (get_expr_type (ae) == type | |
3156 | || useless_type_conversion_p (type, get_expr_type (ae))); | |
3157 | if (ae->kind == CONSTANT) | |
726a989a | 3158 | add_phi_arg (phi, PRE_EXPR_CONSTANT (ae), pred); |
c9145754 | 3159 | else |
726a989a | 3160 | add_phi_arg (phi, PRE_EXPR_NAME (avail[pred->src->index]), pred); |
c9145754 | 3161 | } |
b9c5e484 | 3162 | |
726a989a | 3163 | newphi = get_or_alloc_expr_for_name (gimple_phi_result (phi)); |
c9145754 | 3164 | add_to_value (val, newphi); |
b9c5e484 | 3165 | |
e9284566 DB |
3166 | /* The value should *not* exist in PHI_GEN, or else we wouldn't be doing |
3167 | this insertion, since we test for the existence of this value in PHI_GEN | |
3168 | before proceeding with the partial redundancy checks in insert_aux. | |
b9c5e484 | 3169 | |
e9284566 DB |
3170 | The value may exist in AVAIL_OUT, in particular, it could be represented |
3171 | by the expression we are trying to eliminate, in which case we want the | |
3172 | replacement to occur. If it's not existing in AVAIL_OUT, we want it | |
3173 | inserted there. | |
b9c5e484 | 3174 | |
e9284566 DB |
3175 | Similarly, to the PHI_GEN case, the value should not exist in NEW_SETS of |
3176 | this block, because if it did, it would have existed in our dominator's | |
3177 | AVAIL_OUT, and would have been skipped due to the full redundancy check. | |
3178 | */ | |
3179 | ||
c9145754 | 3180 | bitmap_insert_into_set (PHI_GEN (block), newphi); |
b9c5e484 | 3181 | bitmap_value_replace_in_set (AVAIL_OUT (block), |
c9145754 | 3182 | newphi); |
e9284566 | 3183 | bitmap_insert_into_set (NEW_SETS (block), |
c9145754 | 3184 | newphi); |
b9c5e484 | 3185 | |
e9284566 DB |
3186 | if (dump_file && (dump_flags & TDF_DETAILS)) |
3187 | { | |
3188 | fprintf (dump_file, "Created phi "); | |
726a989a | 3189 | print_gimple_stmt (dump_file, phi, 0, 0); |
e9284566 DB |
3190 | fprintf (dump_file, " in block %d\n", block->index); |
3191 | } | |
3192 | pre_stats.phis++; | |
3193 | return true; | |
3194 | } | |
3195 | ||
3196 | ||
b9c5e484 | 3197 | |
7e6eb623 DB |
3198 | /* Perform insertion of partially redundant values. |
3199 | For BLOCK, do the following: | |
3200 | 1. Propagate the NEW_SETS of the dominator into the current block. | |
b9c5e484 | 3201 | If the block has multiple predecessors, |
7e6eb623 | 3202 | 2a. Iterate over the ANTIC expressions for the block to see if |
83737db2 | 3203 | any of them are partially redundant. |
7e6eb623 | 3204 | 2b. If so, insert them into the necessary predecessors to make |
83737db2 | 3205 | the expression fully redundant. |
7e6eb623 DB |
3206 | 2c. Insert a new PHI merging the values of the predecessors. |
3207 | 2d. Insert the new PHI, and the new expressions, into the | |
83737db2 | 3208 | NEW_SETS set. |
7e6eb623 | 3209 | 3. Recursively call ourselves on the dominator children of BLOCK. |
6de9cd9a | 3210 | |
83737db2 | 3211 | Steps 1, 2a, and 3 are done by insert_aux. 2b, 2c and 2d are done by |
d75dbccd | 3212 | do_regular_insertion and do_partial_insertion. |
83737db2 | 3213 | |
7e6eb623 | 3214 | */ |
e9284566 | 3215 | |
83737db2 DB |
3216 | static bool |
3217 | do_regular_insertion (basic_block block, basic_block dom) | |
3218 | { | |
3219 | bool new_stuff = false; | |
c9145754 DB |
3220 | VEC (pre_expr, heap) *exprs = sorted_array_from_bitmap_set (ANTIC_IN (block)); |
3221 | pre_expr expr; | |
83737db2 DB |
3222 | int i; |
3223 | ||
c9145754 | 3224 | for (i = 0; VEC_iterate (pre_expr, exprs, i, expr); i++) |
83737db2 | 3225 | { |
c9145754 | 3226 | if (expr->kind != NAME) |
83737db2 | 3227 | { |
c9145754 DB |
3228 | pre_expr *avail; |
3229 | unsigned int val; | |
83737db2 DB |
3230 | bool by_some = false; |
3231 | bool cant_insert = false; | |
3232 | bool all_same = true; | |
c9145754 | 3233 | pre_expr first_s = NULL; |
83737db2 DB |
3234 | edge pred; |
3235 | basic_block bprime; | |
c9145754 | 3236 | pre_expr eprime = NULL; |
83737db2 | 3237 | edge_iterator ei; |
f11d2f1e | 3238 | pre_expr edoubleprime = NULL; |
83737db2 | 3239 | |
c9145754 | 3240 | val = get_expr_value_id (expr); |
83737db2 DB |
3241 | if (bitmap_set_contains_value (PHI_GEN (block), val)) |
3242 | continue; | |
3243 | if (bitmap_set_contains_value (AVAIL_OUT (dom), val)) | |
3244 | { | |
3245 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
3246 | fprintf (dump_file, "Found fully redundant value\n"); | |
3247 | continue; | |
3248 | } | |
3249 | ||
c9145754 | 3250 | avail = XCNEWVEC (pre_expr, last_basic_block); |
83737db2 DB |
3251 | FOR_EACH_EDGE (pred, ei, block->preds) |
3252 | { | |
c9145754 | 3253 | unsigned int vprime; |
83737db2 | 3254 | |
c4ab2baa RG |
3255 | /* We should never run insertion for the exit block |
3256 | and so not come across fake pred edges. */ | |
3257 | gcc_assert (!(pred->flags & EDGE_FAKE)); | |
83737db2 DB |
3258 | bprime = pred->src; |
3259 | eprime = phi_translate (expr, ANTIC_IN (block), NULL, | |
3260 | bprime, block); | |
3261 | ||
3262 | /* eprime will generally only be NULL if the | |
3263 | value of the expression, translated | |
3264 | through the PHI for this predecessor, is | |
3265 | undefined. If that is the case, we can't | |
3266 | make the expression fully redundant, | |
3267 | because its value is undefined along a | |
3268 | predecessor path. We can thus break out | |
3269 | early because it doesn't matter what the | |
3270 | rest of the results are. */ | |
3271 | if (eprime == NULL) | |
3272 | { | |
3273 | cant_insert = true; | |
3274 | break; | |
3275 | } | |
3276 | ||
3277 | eprime = fully_constant_expression (eprime); | |
726a989a RB |
3278 | vprime = get_expr_value_id (eprime); |
3279 | edoubleprime = bitmap_find_leader (AVAIL_OUT (bprime), | |
3280 | vprime, NULL); | |
83737db2 DB |
3281 | if (edoubleprime == NULL) |
3282 | { | |
3283 | avail[bprime->index] = eprime; | |
3284 | all_same = false; | |
3285 | } | |
3286 | else | |
3287 | { | |
3288 | avail[bprime->index] = edoubleprime; | |
3289 | by_some = true; | |
3290 | if (first_s == NULL) | |
3291 | first_s = edoubleprime; | |
c9145754 | 3292 | else if (!pre_expr_eq (first_s, edoubleprime)) |
83737db2 DB |
3293 | all_same = false; |
3294 | } | |
3295 | } | |
3296 | /* If we can insert it, it's not the same value | |
3297 | already existing along every predecessor, and | |
3298 | it's defined by some predecessor, it is | |
3299 | partially redundant. */ | |
b463e8de | 3300 | if (!cant_insert && !all_same && by_some && dbg_cnt (treepre_insert)) |
83737db2 DB |
3301 | { |
3302 | if (insert_into_preds_of_block (block, get_expression_id (expr), | |
3303 | avail)) | |
3304 | new_stuff = true; | |
3305 | } | |
3306 | /* If all edges produce the same value and that value is | |
3307 | an invariant, then the PHI has the same value on all | |
3308 | edges. Note this. */ | |
3309 | else if (!cant_insert && all_same && eprime | |
53f3815c RG |
3310 | && (edoubleprime->kind == CONSTANT |
3311 | || edoubleprime->kind == NAME) | |
c9145754 | 3312 | && !value_id_constant_p (val)) |
83737db2 DB |
3313 | { |
3314 | unsigned int j; | |
3315 | bitmap_iterator bi; | |
c9145754 DB |
3316 | bitmap_set_t exprset = VEC_index (bitmap_set_t, |
3317 | value_expressions, val); | |
83737db2 | 3318 | |
53f3815c | 3319 | unsigned int new_val = get_expr_value_id (edoubleprime); |
83737db2 DB |
3320 | FOR_EACH_EXPR_ID_IN_SET (exprset, j, bi) |
3321 | { | |
c9145754 DB |
3322 | pre_expr expr = expression_for_id (j); |
3323 | ||
3324 | if (expr->kind == NAME) | |
83737db2 | 3325 | { |
c9145754 DB |
3326 | vn_ssa_aux_t info = VN_INFO (PRE_EXPR_NAME (expr)); |
3327 | /* Just reset the value id and valnum so it is | |
3328 | the same as the constant we have discovered. */ | |
53f3815c RG |
3329 | if (edoubleprime->kind == CONSTANT) |
3330 | { | |
3331 | info->valnum = PRE_EXPR_CONSTANT (edoubleprime); | |
3332 | pre_stats.constified++; | |
3333 | } | |
3334 | else | |
de081cfd | 3335 | info->valnum = VN_INFO (PRE_EXPR_NAME (edoubleprime))->valnum; |
c9145754 | 3336 | info->value_id = new_val; |
83737db2 DB |
3337 | } |
3338 | } | |
3339 | } | |
3340 | free (avail); | |
3341 | } | |
3342 | } | |
3343 | ||
c9145754 | 3344 | VEC_free (pre_expr, heap, exprs); |
83737db2 DB |
3345 | return new_stuff; |
3346 | } | |
3347 | ||
3348 | ||
d75dbccd DB |
3349 | /* Perform insertion for partially anticipatable expressions. There |
3350 | is only one case we will perform insertion for these. This case is | |
3351 | if the expression is partially anticipatable, and fully available. | |
3352 | In this case, we know that putting it earlier will enable us to | |
3353 | remove the later computation. */ | |
3354 | ||
3355 | ||
3356 | static bool | |
3357 | do_partial_partial_insertion (basic_block block, basic_block dom) | |
3358 | { | |
3359 | bool new_stuff = false; | |
c9145754 DB |
3360 | VEC (pre_expr, heap) *exprs = sorted_array_from_bitmap_set (PA_IN (block)); |
3361 | pre_expr expr; | |
d75dbccd DB |
3362 | int i; |
3363 | ||
c9145754 | 3364 | for (i = 0; VEC_iterate (pre_expr, exprs, i, expr); i++) |
d75dbccd | 3365 | { |
c9145754 | 3366 | if (expr->kind != NAME) |
d75dbccd | 3367 | { |
c9145754 DB |
3368 | pre_expr *avail; |
3369 | unsigned int val; | |
d75dbccd DB |
3370 | bool by_all = true; |
3371 | bool cant_insert = false; | |
3372 | edge pred; | |
3373 | basic_block bprime; | |
c9145754 | 3374 | pre_expr eprime = NULL; |
d75dbccd DB |
3375 | edge_iterator ei; |
3376 | ||
c9145754 | 3377 | val = get_expr_value_id (expr); |
d75dbccd DB |
3378 | if (bitmap_set_contains_value (PHI_GEN (block), val)) |
3379 | continue; | |
3380 | if (bitmap_set_contains_value (AVAIL_OUT (dom), val)) | |
3381 | continue; | |
3382 | ||
c9145754 | 3383 | avail = XCNEWVEC (pre_expr, last_basic_block); |
d75dbccd DB |
3384 | FOR_EACH_EDGE (pred, ei, block->preds) |
3385 | { | |
c9145754 DB |
3386 | unsigned int vprime; |
3387 | pre_expr edoubleprime; | |
d75dbccd | 3388 | |
c4ab2baa RG |
3389 | /* We should never run insertion for the exit block |
3390 | and so not come across fake pred edges. */ | |
3391 | gcc_assert (!(pred->flags & EDGE_FAKE)); | |
d75dbccd DB |
3392 | bprime = pred->src; |
3393 | eprime = phi_translate (expr, ANTIC_IN (block), | |
3394 | PA_IN (block), | |
3395 | bprime, block); | |
3396 | ||
3397 | /* eprime will generally only be NULL if the | |
3398 | value of the expression, translated | |
3399 | through the PHI for this predecessor, is | |
3400 | undefined. If that is the case, we can't | |
3401 | make the expression fully redundant, | |
3402 | because its value is undefined along a | |
3403 | predecessor path. We can thus break out | |
3404 | early because it doesn't matter what the | |
3405 | rest of the results are. */ | |
3406 | if (eprime == NULL) | |
3407 | { | |
3408 | cant_insert = true; | |
3409 | break; | |
3410 | } | |
3411 | ||
3412 | eprime = fully_constant_expression (eprime); | |
726a989a RB |
3413 | vprime = get_expr_value_id (eprime); |
3414 | edoubleprime = bitmap_find_leader (AVAIL_OUT (bprime), | |
3415 | vprime, NULL); | |
d75dbccd DB |
3416 | if (edoubleprime == NULL) |
3417 | { | |
3418 | by_all = false; | |
3419 | break; | |
3420 | } | |
3421 | else | |
3422 | avail[bprime->index] = edoubleprime; | |
3423 | ||
3424 | } | |
3425 | ||
3426 | /* If we can insert it, it's not the same value | |
3427 | already existing along every predecessor, and | |
3428 | it's defined by some predecessor, it is | |
3429 | partially redundant. */ | |
c9145754 | 3430 | if (!cant_insert && by_all && dbg_cnt (treepre_insert)) |
d75dbccd DB |
3431 | { |
3432 | pre_stats.pa_insert++; | |
3433 | if (insert_into_preds_of_block (block, get_expression_id (expr), | |
3434 | avail)) | |
3435 | new_stuff = true; | |
3436 | } | |
3437 | free (avail); | |
3438 | } | |
3439 | } | |
3440 | ||
c9145754 | 3441 | VEC_free (pre_expr, heap, exprs); |
d75dbccd DB |
3442 | return new_stuff; |
3443 | } | |
83737db2 | 3444 | |
7e6eb623 DB |
3445 | static bool |
3446 | insert_aux (basic_block block) | |
6de9cd9a | 3447 | { |
7e6eb623 DB |
3448 | basic_block son; |
3449 | bool new_stuff = false; | |
6de9cd9a | 3450 | |
7e6eb623 | 3451 | if (block) |
6de9cd9a | 3452 | { |
7e6eb623 DB |
3453 | basic_block dom; |
3454 | dom = get_immediate_dominator (CDI_DOMINATORS, block); | |
3455 | if (dom) | |
a32b97a2 | 3456 | { |
3cd8c58a | 3457 | unsigned i; |
87c476a2 | 3458 | bitmap_iterator bi; |
6b416da1 | 3459 | bitmap_set_t newset = NEW_SETS (dom); |
e9284566 | 3460 | if (newset) |
87c476a2 | 3461 | { |
e9284566 DB |
3462 | /* Note that we need to value_replace both NEW_SETS, and |
3463 | AVAIL_OUT. For both the case of NEW_SETS, the value may be | |
3464 | represented by some non-simple expression here that we want | |
3465 | to replace it with. */ | |
83737db2 | 3466 | FOR_EACH_EXPR_ID_IN_SET (newset, i, bi) |
e9284566 | 3467 | { |
c9145754 | 3468 | pre_expr expr = expression_for_id (i); |
83737db2 DB |
3469 | bitmap_value_replace_in_set (NEW_SETS (block), expr); |
3470 | bitmap_value_replace_in_set (AVAIL_OUT (block), expr); | |
e9284566 | 3471 | } |
87c476a2 | 3472 | } |
c5cbcccf | 3473 | if (!single_pred_p (block)) |
6de9cd9a | 3474 | { |
83737db2 | 3475 | new_stuff |= do_regular_insertion (block, dom); |
d75dbccd DB |
3476 | if (do_partial_partial) |
3477 | new_stuff |= do_partial_partial_insertion (block, dom); | |
6de9cd9a DN |
3478 | } |
3479 | } | |
3480 | } | |
7e6eb623 DB |
3481 | for (son = first_dom_son (CDI_DOMINATORS, block); |
3482 | son; | |
3483 | son = next_dom_son (CDI_DOMINATORS, son)) | |
3484 | { | |
3485 | new_stuff |= insert_aux (son); | |
3486 | } | |
3487 | ||
3488 | return new_stuff; | |
6de9cd9a DN |
3489 | } |
3490 | ||
7e6eb623 | 3491 | /* Perform insertion of partially redundant values. */ |
6de9cd9a | 3492 | |
7e6eb623 DB |
3493 | static void |
3494 | insert (void) | |
6de9cd9a | 3495 | { |
7e6eb623 | 3496 | bool new_stuff = true; |
6de9cd9a | 3497 | basic_block bb; |
7e6eb623 | 3498 | int num_iterations = 0; |
b9c5e484 | 3499 | |
7e6eb623 | 3500 | FOR_ALL_BB (bb) |
6b416da1 | 3501 | NEW_SETS (bb) = bitmap_set_new (); |
b9c5e484 | 3502 | |
7e6eb623 | 3503 | while (new_stuff) |
6de9cd9a | 3504 | { |
7e6eb623 | 3505 | num_iterations++; |
7e6eb623 | 3506 | new_stuff = insert_aux (ENTRY_BLOCK_PTR); |
6de9cd9a | 3507 | } |
9fe0cb7d | 3508 | statistics_histogram_event (cfun, "insert iterations", num_iterations); |
7e6eb623 | 3509 | } |
6de9cd9a | 3510 | |
33c94679 | 3511 | |
89fb70a3 | 3512 | /* Add OP to EXP_GEN (block), and possibly to the maximal set if it is |
070b797d | 3513 | not defined by a phi node. |
89fb70a3 DB |
3514 | PHI nodes can't go in the maximal sets because they are not in |
3515 | TMP_GEN, so it is possible to get into non-monotonic situations | |
3516 | during ANTIC calculation, because it will *add* bits. */ | |
3517 | ||
3518 | static void | |
3519 | add_to_exp_gen (basic_block block, tree op) | |
3520 | { | |
3521 | if (!in_fre) | |
3522 | { | |
c9145754 | 3523 | pre_expr result; |
7b7e6ecd | 3524 | if (TREE_CODE (op) == SSA_NAME && ssa_undefined_value_p (op)) |
89fb70a3 | 3525 | return; |
c9145754 DB |
3526 | result = get_or_alloc_expr_for_name (op); |
3527 | bitmap_value_insert_into_set (EXP_GEN (block), result); | |
89fb70a3 | 3528 | if (TREE_CODE (op) != SSA_NAME |
726a989a | 3529 | || gimple_code (SSA_NAME_DEF_STMT (op)) != GIMPLE_PHI) |
c9145754 | 3530 | bitmap_value_insert_into_set (maximal_set, result); |
6de9cd9a | 3531 | } |
6de9cd9a DN |
3532 | } |
3533 | ||
c9145754 | 3534 | /* Create value ids for PHI in BLOCK. */ |
89fb70a3 DB |
3535 | |
3536 | static void | |
726a989a | 3537 | make_values_for_phi (gimple phi, basic_block block) |
89fb70a3 | 3538 | { |
726a989a RB |
3539 | tree result = gimple_phi_result (phi); |
3540 | ||
89fb70a3 DB |
3541 | /* We have no need for virtual phis, as they don't represent |
3542 | actual computations. */ | |
3543 | if (is_gimple_reg (result)) | |
3544 | { | |
c9145754 DB |
3545 | pre_expr e = get_or_alloc_expr_for_name (result); |
3546 | add_to_value (get_expr_value_id (e), e); | |
3547 | bitmap_insert_into_set (PHI_GEN (block), e); | |
3548 | bitmap_value_insert_into_set (AVAIL_OUT (block), e); | |
d818832c | 3549 | } |
d818832c | 3550 | } |
c90186eb | 3551 | |
665fcad8 SB |
3552 | /* Compute the AVAIL set for all basic blocks. |
3553 | ||
3554 | This function performs value numbering of the statements in each basic | |
3555 | block. The AVAIL sets are built from information we glean while doing | |
3556 | this value numbering, since the AVAIL sets contain only one entry per | |
7e6eb623 | 3557 | value. |
b9c5e484 | 3558 | |
7e6eb623 | 3559 | AVAIL_IN[BLOCK] = AVAIL_OUT[dom(BLOCK)]. |
ff2ad0f7 | 3560 | AVAIL_OUT[BLOCK] = AVAIL_IN[BLOCK] U PHI_GEN[BLOCK] U TMP_GEN[BLOCK]. */ |
6de9cd9a | 3561 | |
7e6eb623 | 3562 | static void |
665fcad8 | 3563 | compute_avail (void) |
6de9cd9a | 3564 | { |
c9145754 | 3565 | |
665fcad8 SB |
3566 | basic_block block, son; |
3567 | basic_block *worklist; | |
3568 | size_t sp = 0; | |
b005da11 RG |
3569 | unsigned i; |
3570 | ||
3571 | /* We pretend that default definitions are defined in the entry block. | |
3572 | This includes function arguments and the static chain decl. */ | |
3573 | for (i = 1; i < num_ssa_names; ++i) | |
3574 | { | |
3575 | tree name = ssa_name (i); | |
3576 | pre_expr e; | |
3577 | if (!name | |
3578 | || !SSA_NAME_IS_DEFAULT_DEF (name) | |
3579 | || has_zero_uses (name) | |
3580 | || !is_gimple_reg (name)) | |
3581 | continue; | |
665fcad8 | 3582 | |
b005da11 RG |
3583 | e = get_or_alloc_expr_for_name (name); |
3584 | add_to_value (get_expr_value_id (e), e); | |
3585 | if (!in_fre) | |
83737db2 | 3586 | { |
b005da11 RG |
3587 | bitmap_insert_into_set (TMP_GEN (ENTRY_BLOCK_PTR), e); |
3588 | bitmap_value_insert_into_set (maximal_set, e); | |
83737db2 | 3589 | } |
b005da11 | 3590 | bitmap_value_insert_into_set (AVAIL_OUT (ENTRY_BLOCK_PTR), e); |
2984956b AP |
3591 | } |
3592 | ||
665fcad8 | 3593 | /* Allocate the worklist. */ |
e1111e8e | 3594 | worklist = XNEWVEC (basic_block, n_basic_blocks); |
665fcad8 SB |
3595 | |
3596 | /* Seed the algorithm by putting the dominator children of the entry | |
3597 | block on the worklist. */ | |
3598 | for (son = first_dom_son (CDI_DOMINATORS, ENTRY_BLOCK_PTR); | |
3599 | son; | |
3600 | son = next_dom_son (CDI_DOMINATORS, son)) | |
3601 | worklist[sp++] = son; | |
3602 | ||
3603 | /* Loop until the worklist is empty. */ | |
3604 | while (sp) | |
6de9cd9a | 3605 | { |
726a989a RB |
3606 | gimple_stmt_iterator gsi; |
3607 | gimple stmt; | |
7e6eb623 | 3608 | basic_block dom; |
85300b46 | 3609 | unsigned int stmt_uid = 1; |
7e6eb623 | 3610 | |
665fcad8 SB |
3611 | /* Pick a block from the worklist. */ |
3612 | block = worklist[--sp]; | |
3613 | ||
ff2ad0f7 DN |
3614 | /* Initially, the set of available values in BLOCK is that of |
3615 | its immediate dominator. */ | |
7e6eb623 DB |
3616 | dom = get_immediate_dominator (CDI_DOMINATORS, block); |
3617 | if (dom) | |
bdee7684 | 3618 | bitmap_set_copy (AVAIL_OUT (block), AVAIL_OUT (dom)); |
33c94679 | 3619 | |
ff2ad0f7 | 3620 | /* Generate values for PHI nodes. */ |
726a989a RB |
3621 | for (gsi = gsi_start_phis (block); !gsi_end_p (gsi); gsi_next (&gsi)) |
3622 | make_values_for_phi (gsi_stmt (gsi), block); | |
7e6eb623 | 3623 | |
ff2ad0f7 DN |
3624 | /* Now compute value numbers and populate value sets with all |
3625 | the expressions computed in BLOCK. */ | |
726a989a | 3626 | for (gsi = gsi_start_bb (block); !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 3627 | { |
f47c96aa AM |
3628 | ssa_op_iter iter; |
3629 | tree op; | |
ff2ad0f7 | 3630 | |
726a989a RB |
3631 | stmt = gsi_stmt (gsi); |
3632 | gimple_set_uid (stmt, stmt_uid++); | |
ff2ad0f7 | 3633 | |
c9145754 | 3634 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_DEF) |
83737db2 | 3635 | { |
c9145754 | 3636 | pre_expr e = get_or_alloc_expr_for_name (op); |
83737db2 | 3637 | |
c9145754 DB |
3638 | add_to_value (get_expr_value_id (e), e); |
3639 | if (!in_fre) | |
615cb001 | 3640 | bitmap_insert_into_set (TMP_GEN (block), e); |
c9145754 | 3641 | bitmap_value_insert_into_set (AVAIL_OUT (block), e); |
83737db2 DB |
3642 | } |
3643 | ||
726a989a RB |
3644 | if (gimple_has_volatile_ops (stmt) |
3645 | || stmt_could_throw_p (stmt)) | |
3646 | continue; | |
3647 | ||
3648 | switch (gimple_code (stmt)) | |
7e6eb623 | 3649 | { |
726a989a RB |
3650 | case GIMPLE_RETURN: |
3651 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_USE) | |
3652 | add_to_exp_gen (block, op); | |
c9145754 | 3653 | continue; |
726a989a RB |
3654 | |
3655 | case GIMPLE_CALL: | |
c9145754 | 3656 | { |
726a989a RB |
3657 | vn_reference_t ref; |
3658 | unsigned int i; | |
3659 | vn_reference_op_t vro; | |
3660 | pre_expr result = NULL; | |
3661 | VEC(vn_reference_op_s, heap) *ops = NULL; | |
c9145754 | 3662 | |
726a989a RB |
3663 | if (!can_value_number_call (stmt)) |
3664 | continue; | |
c9145754 | 3665 | |
726a989a RB |
3666 | copy_reference_ops_from_call (stmt, &ops); |
3667 | vn_reference_lookup_pieces (shared_vuses_from_stmt (stmt), | |
53f3815c | 3668 | ops, &ref, false); |
726a989a RB |
3669 | VEC_free (vn_reference_op_s, heap, ops); |
3670 | if (!ref) | |
3671 | continue; | |
c9145754 | 3672 | |
726a989a RB |
3673 | for (i = 0; VEC_iterate (vn_reference_op_s, |
3674 | ref->operands, i, | |
3675 | vro); i++) | |
3676 | { | |
3677 | if (vro->op0 && TREE_CODE (vro->op0) == SSA_NAME) | |
3678 | add_to_exp_gen (block, vro->op0); | |
3679 | if (vro->op1 && TREE_CODE (vro->op1) == SSA_NAME) | |
3680 | add_to_exp_gen (block, vro->op1); | |
ce94d354 RG |
3681 | if (vro->op2 && TREE_CODE (vro->op2) == SSA_NAME) |
3682 | add_to_exp_gen (block, vro->op2); | |
726a989a RB |
3683 | } |
3684 | result = (pre_expr) pool_alloc (pre_expr_pool); | |
3685 | result->kind = REFERENCE; | |
3686 | result->id = 0; | |
3687 | PRE_EXPR_REFERENCE (result) = ref; | |
3688 | ||
3689 | get_or_alloc_expression_id (result); | |
3690 | add_to_value (get_expr_value_id (result), result); | |
3691 | if (!in_fre) | |
3692 | { | |
3693 | bitmap_value_insert_into_set (EXP_GEN (block), | |
3694 | result); | |
3695 | bitmap_value_insert_into_set (maximal_set, result); | |
3696 | } | |
3697 | continue; | |
3698 | } | |
c9145754 | 3699 | |
726a989a RB |
3700 | case GIMPLE_ASSIGN: |
3701 | { | |
3702 | pre_expr result = NULL; | |
3703 | switch (TREE_CODE_CLASS (gimple_assign_rhs_code (stmt))) | |
3704 | { | |
3705 | case tcc_unary: | |
3706 | if (is_exception_related (stmt)) | |
3707 | continue; | |
3708 | case tcc_binary: | |
24a3fbbe | 3709 | case tcc_comparison: |
726a989a RB |
3710 | { |
3711 | vn_nary_op_t nary; | |
3712 | unsigned int i; | |
3713 | ||
3714 | vn_nary_op_lookup_pieces (gimple_num_ops (stmt) - 1, | |
3715 | gimple_assign_rhs_code (stmt), | |
3716 | gimple_expr_type (stmt), | |
3717 | gimple_assign_rhs1 (stmt), | |
3718 | gimple_assign_rhs2 (stmt), | |
3719 | NULL_TREE, NULL_TREE, &nary); | |
3720 | ||
3721 | if (!nary) | |
3722 | continue; | |
3723 | ||
3724 | for (i = 0; i < nary->length; i++) | |
3725 | if (TREE_CODE (nary->op[i]) == SSA_NAME) | |
3726 | add_to_exp_gen (block, nary->op[i]); | |
3727 | ||
3728 | result = (pre_expr) pool_alloc (pre_expr_pool); | |
3729 | result->kind = NARY; | |
3730 | result->id = 0; | |
3731 | PRE_EXPR_NARY (result) = nary; | |
3732 | break; | |
3733 | } | |
c9145754 | 3734 | |
726a989a RB |
3735 | case tcc_declaration: |
3736 | case tcc_reference: | |
3737 | { | |
3738 | vn_reference_t ref; | |
3739 | unsigned int i; | |
3740 | vn_reference_op_t vro; | |
3741 | ||
3742 | vn_reference_lookup (gimple_assign_rhs1 (stmt), | |
3743 | shared_vuses_from_stmt (stmt), | |
3744 | false, &ref); | |
3745 | if (!ref) | |
3746 | continue; | |
3747 | ||
3748 | for (i = 0; VEC_iterate (vn_reference_op_s, | |
3749 | ref->operands, i, | |
3750 | vro); i++) | |
c9145754 | 3751 | { |
726a989a RB |
3752 | if (vro->op0 && TREE_CODE (vro->op0) == SSA_NAME) |
3753 | add_to_exp_gen (block, vro->op0); | |
3754 | if (vro->op1 && TREE_CODE (vro->op1) == SSA_NAME) | |
3755 | add_to_exp_gen (block, vro->op1); | |
ce94d354 RG |
3756 | if (vro->op2 && TREE_CODE (vro->op2) == SSA_NAME) |
3757 | add_to_exp_gen (block, vro->op2); | |
c9145754 | 3758 | } |
726a989a RB |
3759 | result = (pre_expr) pool_alloc (pre_expr_pool); |
3760 | result->kind = REFERENCE; | |
3761 | result->id = 0; | |
3762 | PRE_EXPR_REFERENCE (result) = ref; | |
3763 | break; | |
3764 | } | |
c9145754 | 3765 | |
726a989a RB |
3766 | default: |
3767 | /* For any other statement that we don't | |
3768 | recognize, simply add all referenced | |
3769 | SSA_NAMEs to EXP_GEN. */ | |
3770 | FOR_EACH_SSA_TREE_OPERAND (op, stmt, iter, SSA_OP_USE) | |
3771 | add_to_exp_gen (block, op); | |
3772 | continue; | |
c9145754 | 3773 | } |
726a989a RB |
3774 | |
3775 | get_or_alloc_expression_id (result); | |
3776 | add_to_value (get_expr_value_id (result), result); | |
3777 | if (!in_fre) | |
3778 | { | |
3779 | bitmap_value_insert_into_set (EXP_GEN (block), result); | |
3780 | bitmap_value_insert_into_set (maximal_set, result); | |
3781 | } | |
3782 | ||
dda243de | 3783 | continue; |
c9145754 DB |
3784 | } |
3785 | default: | |
3786 | break; | |
7e6eb623 | 3787 | } |
6de9cd9a | 3788 | } |
726a989a | 3789 | |
665fcad8 SB |
3790 | /* Put the dominator children of BLOCK on the worklist of blocks |
3791 | to compute available sets for. */ | |
3792 | for (son = first_dom_son (CDI_DOMINATORS, block); | |
3793 | son; | |
3794 | son = next_dom_son (CDI_DOMINATORS, son)) | |
3795 | worklist[sp++] = son; | |
6de9cd9a | 3796 | } |
33c94679 | 3797 | |
665fcad8 | 3798 | free (worklist); |
7e6eb623 DB |
3799 | } |
3800 | ||
3d45dd59 RG |
3801 | /* Insert the expression for SSA_VN that SCCVN thought would be simpler |
3802 | than the available expressions for it. The insertion point is | |
3803 | right before the first use in STMT. Returns the SSA_NAME that should | |
3804 | be used for replacement. */ | |
3805 | ||
3806 | static tree | |
726a989a | 3807 | do_SCCVN_insertion (gimple stmt, tree ssa_vn) |
3d45dd59 | 3808 | { |
726a989a RB |
3809 | basic_block bb = gimple_bb (stmt); |
3810 | gimple_stmt_iterator gsi; | |
3811 | gimple_seq stmts = NULL; | |
3812 | tree expr; | |
c9145754 | 3813 | pre_expr e; |
3d45dd59 RG |
3814 | |
3815 | /* First create a value expression from the expression we want | |
3816 | to insert and associate it with the value handle for SSA_VN. */ | |
726a989a | 3817 | e = get_or_alloc_expr_for (vn_get_expr_for (ssa_vn)); |
c9145754 | 3818 | if (e == NULL) |
3d45dd59 | 3819 | return NULL_TREE; |
3d45dd59 | 3820 | |
726a989a | 3821 | /* Then use create_expression_by_pieces to generate a valid |
3d45dd59 | 3822 | expression to insert at this point of the IL stream. */ |
726a989a | 3823 | expr = create_expression_by_pieces (bb, e, &stmts, stmt, NULL); |
3d45dd59 RG |
3824 | if (expr == NULL_TREE) |
3825 | return NULL_TREE; | |
726a989a RB |
3826 | gsi = gsi_for_stmt (stmt); |
3827 | gsi_insert_seq_before (&gsi, stmts, GSI_SAME_STMT); | |
3d45dd59 RG |
3828 | |
3829 | return expr; | |
3830 | } | |
33c94679 | 3831 | |
7e6eb623 DB |
3832 | /* Eliminate fully redundant computations. */ |
3833 | ||
b80280f2 | 3834 | static unsigned int |
7e6eb623 DB |
3835 | eliminate (void) |
3836 | { | |
3837 | basic_block b; | |
b80280f2 | 3838 | unsigned int todo = 0; |
7e6eb623 DB |
3839 | |
3840 | FOR_EACH_BB (b) | |
3841 | { | |
726a989a | 3842 | gimple_stmt_iterator i; |
b9c5e484 | 3843 | |
6cdb0ee3 | 3844 | for (i = gsi_start_bb (b); !gsi_end_p (i);) |
83737db2 | 3845 | { |
726a989a | 3846 | gimple stmt = gsi_stmt (i); |
7e6eb623 | 3847 | |
ff2ad0f7 DN |
3848 | /* Lookup the RHS of the expression, see if we have an |
3849 | available computation for it. If so, replace the RHS with | |
7e6eb623 | 3850 | the available computation. */ |
726a989a RB |
3851 | if (gimple_has_lhs (stmt) |
3852 | && TREE_CODE (gimple_get_lhs (stmt)) == SSA_NAME | |
3853 | && !gimple_assign_ssa_name_copy_p (stmt) | |
3854 | && (!gimple_assign_single_p (stmt) | |
3855 | || !is_gimple_min_invariant (gimple_assign_rhs1 (stmt))) | |
3856 | && !gimple_has_volatile_ops (stmt) | |
3857 | && !has_zero_uses (gimple_get_lhs (stmt))) | |
ff2ad0f7 | 3858 | { |
726a989a RB |
3859 | tree lhs = gimple_get_lhs (stmt); |
3860 | tree rhs = NULL_TREE; | |
c9145754 DB |
3861 | tree sprime = NULL; |
3862 | pre_expr lhsexpr = get_or_alloc_expr_for_name (lhs); | |
3863 | pre_expr sprimeexpr; | |
3864 | ||
726a989a RB |
3865 | if (gimple_assign_single_p (stmt)) |
3866 | rhs = gimple_assign_rhs1 (stmt); | |
3867 | ||
c9145754 DB |
3868 | sprimeexpr = bitmap_find_leader (AVAIL_OUT (b), |
3869 | get_expr_value_id (lhsexpr), | |
726a989a | 3870 | NULL); |
c9145754 DB |
3871 | |
3872 | if (sprimeexpr) | |
3873 | { | |
3874 | if (sprimeexpr->kind == CONSTANT) | |
3875 | sprime = PRE_EXPR_CONSTANT (sprimeexpr); | |
3876 | else if (sprimeexpr->kind == NAME) | |
3877 | sprime = PRE_EXPR_NAME (sprimeexpr); | |
3878 | else | |
3879 | gcc_unreachable (); | |
3880 | } | |
6999afe1 | 3881 | |
c9145754 DB |
3882 | /* If there is no existing leader but SCCVN knows this |
3883 | value is constant, use that constant. */ | |
3884 | if (!sprime && is_gimple_min_invariant (VN_INFO (lhs)->valnum)) | |
3885 | { | |
6999afe1 DB |
3886 | sprime = fold_convert (TREE_TYPE (lhs), |
3887 | VN_INFO (lhs)->valnum); | |
ff2ad0f7 | 3888 | |
c9145754 DB |
3889 | if (dump_file && (dump_flags & TDF_DETAILS)) |
3890 | { | |
3891 | fprintf (dump_file, "Replaced "); | |
726a989a | 3892 | print_gimple_expr (dump_file, stmt, 0, 0); |
c9145754 DB |
3893 | fprintf (dump_file, " with "); |
3894 | print_generic_expr (dump_file, sprime, 0); | |
3895 | fprintf (dump_file, " in "); | |
726a989a | 3896 | print_gimple_stmt (dump_file, stmt, 0, 0); |
c9145754 DB |
3897 | } |
3898 | pre_stats.eliminations++; | |
726a989a RB |
3899 | propagate_tree_value_into_stmt (&i, sprime); |
3900 | stmt = gsi_stmt (i); | |
c9145754 | 3901 | update_stmt (stmt); |
6cdb0ee3 | 3902 | gsi_next (&i); |
c9145754 DB |
3903 | continue; |
3904 | } | |
3d45dd59 RG |
3905 | |
3906 | /* If there is no existing usable leader but SCCVN thinks | |
3907 | it has an expression it wants to use as replacement, | |
3908 | insert that. */ | |
c9145754 | 3909 | if (!sprime || sprime == lhs) |
3d45dd59 RG |
3910 | { |
3911 | tree val = VN_INFO (lhs)->valnum; | |
3912 | if (val != VN_TOP | |
c9145754 | 3913 | && TREE_CODE (val) == SSA_NAME |
3d45dd59 | 3914 | && VN_INFO (val)->needs_insertion |
726a989a | 3915 | && can_PRE_operation (vn_get_expr_for (val))) |
3d45dd59 RG |
3916 | sprime = do_SCCVN_insertion (stmt, val); |
3917 | } | |
b9c5e484 | 3918 | if (sprime |
ff2ad0f7 | 3919 | && sprime != lhs |
726a989a RB |
3920 | && (rhs == NULL_TREE |
3921 | || TREE_CODE (rhs) != SSA_NAME | |
3922 | || may_propagate_copy (rhs, sprime))) | |
ff2ad0f7 | 3923 | { |
726a989a | 3924 | gcc_assert (sprime != rhs); |
ff2ad0f7 | 3925 | |
7e6eb623 DB |
3926 | if (dump_file && (dump_flags & TDF_DETAILS)) |
3927 | { | |
3928 | fprintf (dump_file, "Replaced "); | |
726a989a | 3929 | print_gimple_expr (dump_file, stmt, 0, 0); |
7e6eb623 DB |
3930 | fprintf (dump_file, " with "); |
3931 | print_generic_expr (dump_file, sprime, 0); | |
3932 | fprintf (dump_file, " in "); | |
726a989a | 3933 | print_gimple_stmt (dump_file, stmt, 0, 0); |
7e6eb623 | 3934 | } |
b9c5e484 EC |
3935 | |
3936 | if (TREE_CODE (sprime) == SSA_NAME) | |
726a989a RB |
3937 | gimple_set_plf (SSA_NAME_DEF_STMT (sprime), |
3938 | NECESSARY, true); | |
fe83f543 AP |
3939 | /* We need to make sure the new and old types actually match, |
3940 | which may require adding a simple cast, which fold_convert | |
3941 | will do for us. */ | |
726a989a RB |
3942 | if ((!rhs || TREE_CODE (rhs) != SSA_NAME) |
3943 | && !useless_type_conversion_p (gimple_expr_type (stmt), | |
3944 | TREE_TYPE (sprime))) | |
3945 | sprime = fold_convert (gimple_expr_type (stmt), sprime); | |
b9c5e484 | 3946 | |
7e6eb623 | 3947 | pre_stats.eliminations++; |
726a989a RB |
3948 | propagate_tree_value_into_stmt (&i, sprime); |
3949 | stmt = gsi_stmt (i); | |
f430bae8 | 3950 | update_stmt (stmt); |
53b4bf74 DN |
3951 | |
3952 | /* If we removed EH side effects from the statement, clean | |
3953 | its EH information. */ | |
af47810a | 3954 | if (maybe_clean_or_replace_eh_stmt (stmt, stmt)) |
53b4bf74 DN |
3955 | { |
3956 | bitmap_set_bit (need_eh_cleanup, | |
726a989a | 3957 | gimple_bb (stmt)->index); |
53b4bf74 DN |
3958 | if (dump_file && (dump_flags & TDF_DETAILS)) |
3959 | fprintf (dump_file, " Removed EH side effects.\n"); | |
3960 | } | |
ff2ad0f7 DN |
3961 | } |
3962 | } | |
6cdb0ee3 RG |
3963 | /* If the statement is a scalar store, see if the expression |
3964 | has the same value number as its rhs. If so, the store is | |
3965 | dead. */ | |
3966 | else if (gimple_assign_single_p (stmt) | |
3967 | && !is_gimple_reg (gimple_assign_lhs (stmt)) | |
3968 | && (TREE_CODE (gimple_assign_rhs1 (stmt)) == SSA_NAME | |
3969 | || is_gimple_min_invariant (gimple_assign_rhs1 (stmt)))) | |
3970 | { | |
3971 | tree rhs = gimple_assign_rhs1 (stmt); | |
3972 | tree val; | |
3973 | val = vn_reference_lookup (gimple_assign_lhs (stmt), | |
3974 | shared_vuses_from_stmt (stmt), | |
3975 | true, NULL); | |
3976 | if (TREE_CODE (rhs) == SSA_NAME) | |
3977 | rhs = VN_INFO (rhs)->valnum; | |
3978 | if (val | |
3979 | && operand_equal_p (val, rhs, 0)) | |
3980 | { | |
3981 | def_operand_p def; | |
3982 | use_operand_p use; | |
3983 | vuse_vec_p usevec; | |
3984 | ssa_op_iter oi; | |
3985 | imm_use_iterator ui; | |
3986 | gimple use_stmt; | |
3987 | ||
3988 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
3989 | { | |
3990 | fprintf (dump_file, "Deleted dead store "); | |
3991 | print_gimple_stmt (dump_file, stmt, 0, 0); | |
3992 | } | |
3993 | ||
3994 | /* Propagate all may-uses to the uses of their defs. */ | |
3995 | FOR_EACH_SSA_VDEF_OPERAND (def, usevec, stmt, oi) | |
3996 | { | |
3997 | tree vuse = VUSE_ELEMENT_VAR (*usevec, 0); | |
3998 | tree vdef = DEF_FROM_PTR (def); | |
3999 | ||
4000 | /* If the vdef is used in an abnormal PHI node we | |
4001 | have to propagate that flag to the vuse as well. */ | |
4002 | if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (vdef)) | |
4003 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI (vuse) = 1; | |
4004 | ||
4005 | FOR_EACH_IMM_USE_STMT (use_stmt, ui, vdef) | |
4006 | FOR_EACH_IMM_USE_ON_STMT (use, ui) | |
4007 | SET_USE (use, vuse); | |
4008 | } | |
4009 | ||
4010 | gsi_remove (&i, true); | |
4011 | release_defs (stmt); | |
4012 | continue; | |
4013 | } | |
4014 | } | |
b80280f2 RG |
4015 | /* Visit COND_EXPRs and fold the comparison with the |
4016 | available value-numbers. */ | |
726a989a | 4017 | else if (gimple_code (stmt) == GIMPLE_COND) |
b80280f2 | 4018 | { |
726a989a RB |
4019 | tree op0 = gimple_cond_lhs (stmt); |
4020 | tree op1 = gimple_cond_rhs (stmt); | |
b80280f2 RG |
4021 | tree result; |
4022 | ||
4023 | if (TREE_CODE (op0) == SSA_NAME) | |
4024 | op0 = VN_INFO (op0)->valnum; | |
4025 | if (TREE_CODE (op1) == SSA_NAME) | |
4026 | op1 = VN_INFO (op1)->valnum; | |
726a989a | 4027 | result = fold_binary (gimple_cond_code (stmt), boolean_type_node, |
b80280f2 RG |
4028 | op0, op1); |
4029 | if (result && TREE_CODE (result) == INTEGER_CST) | |
4030 | { | |
726a989a RB |
4031 | if (integer_zerop (result)) |
4032 | gimple_cond_make_false (stmt); | |
4033 | else | |
4034 | gimple_cond_make_true (stmt); | |
b80280f2 RG |
4035 | update_stmt (stmt); |
4036 | todo = TODO_cleanup_cfg; | |
4037 | } | |
4038 | } | |
6cdb0ee3 RG |
4039 | |
4040 | gsi_next (&i); | |
83737db2 | 4041 | } |
7e6eb623 | 4042 | } |
b80280f2 RG |
4043 | |
4044 | return todo; | |
6de9cd9a DN |
4045 | } |
4046 | ||
0fc6c492 DB |
4047 | /* Borrow a bit of tree-ssa-dce.c for the moment. |
4048 | XXX: In 4.1, we should be able to just run a DCE pass after PRE, though | |
4049 | this may be a bit faster, and we may want critical edges kept split. */ | |
4050 | ||
4051 | /* If OP's defining statement has not already been determined to be necessary, | |
d4e6fecb | 4052 | mark that statement necessary. Return the stmt, if it is newly |
b9c5e484 | 4053 | necessary. */ |
0fc6c492 | 4054 | |
726a989a | 4055 | static inline gimple |
d4e6fecb | 4056 | mark_operand_necessary (tree op) |
0fc6c492 | 4057 | { |
726a989a | 4058 | gimple stmt; |
0fc6c492 DB |
4059 | |
4060 | gcc_assert (op); | |
4061 | ||
c90186eb DB |
4062 | if (TREE_CODE (op) != SSA_NAME) |
4063 | return NULL; | |
4064 | ||
0fc6c492 DB |
4065 | stmt = SSA_NAME_DEF_STMT (op); |
4066 | gcc_assert (stmt); | |
4067 | ||
726a989a RB |
4068 | if (gimple_plf (stmt, NECESSARY) |
4069 | || gimple_nop_p (stmt)) | |
d4e6fecb | 4070 | return NULL; |
0fc6c492 | 4071 | |
726a989a | 4072 | gimple_set_plf (stmt, NECESSARY, true); |
d4e6fecb | 4073 | return stmt; |
0fc6c492 DB |
4074 | } |
4075 | ||
4076 | /* Because we don't follow exactly the standard PRE algorithm, and decide not | |
4077 | to insert PHI nodes sometimes, and because value numbering of casts isn't | |
4078 | perfect, we sometimes end up inserting dead code. This simple DCE-like | |
4079 | pass removes any insertions we made that weren't actually used. */ | |
4080 | ||
4081 | static void | |
4082 | remove_dead_inserted_code (void) | |
4083 | { | |
726a989a | 4084 | VEC(gimple,heap) *worklist = NULL; |
0fc6c492 | 4085 | int i; |
726a989a | 4086 | gimple t; |
0fc6c492 | 4087 | |
726a989a RB |
4088 | worklist = VEC_alloc (gimple, heap, VEC_length (gimple, inserted_exprs)); |
4089 | for (i = 0; VEC_iterate (gimple, inserted_exprs, i, t); i++) | |
0fc6c492 | 4090 | { |
726a989a RB |
4091 | if (gimple_plf (t, NECESSARY)) |
4092 | VEC_quick_push (gimple, worklist, t); | |
0fc6c492 | 4093 | } |
726a989a | 4094 | while (VEC_length (gimple, worklist) > 0) |
0fc6c492 | 4095 | { |
726a989a | 4096 | t = VEC_pop (gimple, worklist); |
c90186eb DB |
4097 | |
4098 | /* PHI nodes are somewhat special in that each PHI alternative has | |
4099 | data and control dependencies. All the statements feeding the | |
4100 | PHI node's arguments are always necessary. */ | |
726a989a | 4101 | if (gimple_code (t) == GIMPLE_PHI) |
0fc6c492 | 4102 | { |
726a989a | 4103 | unsigned k; |
d4e6fecb | 4104 | |
726a989a RB |
4105 | VEC_reserve (gimple, heap, worklist, gimple_phi_num_args (t)); |
4106 | for (k = 0; k < gimple_phi_num_args (t); k++) | |
83737db2 | 4107 | { |
0fc6c492 DB |
4108 | tree arg = PHI_ARG_DEF (t, k); |
4109 | if (TREE_CODE (arg) == SSA_NAME) | |
d4e6fecb | 4110 | { |
726a989a RB |
4111 | gimple n = mark_operand_necessary (arg); |
4112 | if (n) | |
4113 | VEC_quick_push (gimple, worklist, n); | |
d4e6fecb | 4114 | } |
0fc6c492 DB |
4115 | } |
4116 | } | |
4117 | else | |
4118 | { | |
4119 | /* Propagate through the operands. Examine all the USE, VUSE and | |
89fb70a3 | 4120 | VDEF operands in this statement. Mark all the statements |
0fc6c492 DB |
4121 | which feed this statement's uses as necessary. */ |
4122 | ssa_op_iter iter; | |
4123 | tree use; | |
4124 | ||
38635499 | 4125 | /* The operands of VDEF expressions are also needed as they |
0fc6c492 | 4126 | represent potential definitions that may reach this |
89fb70a3 | 4127 | statement (VDEF operands allow us to follow def-def |
0fc6c492 | 4128 | links). */ |
33c94679 | 4129 | |
0fc6c492 | 4130 | FOR_EACH_SSA_TREE_OPERAND (use, t, iter, SSA_OP_ALL_USES) |
d4e6fecb | 4131 | { |
726a989a | 4132 | gimple n = mark_operand_necessary (use); |
d4e6fecb | 4133 | if (n) |
726a989a | 4134 | VEC_safe_push (gimple, heap, worklist, n); |
d4e6fecb | 4135 | } |
0fc6c492 DB |
4136 | } |
4137 | } | |
c90186eb | 4138 | |
726a989a | 4139 | for (i = 0; VEC_iterate (gimple, inserted_exprs, i, t); i++) |
0fc6c492 | 4140 | { |
726a989a | 4141 | if (!gimple_plf (t, NECESSARY)) |
0fc6c492 | 4142 | { |
726a989a | 4143 | gimple_stmt_iterator gsi; |
c90186eb | 4144 | |
0fc6c492 DB |
4145 | if (dump_file && (dump_flags & TDF_DETAILS)) |
4146 | { | |
4147 | fprintf (dump_file, "Removing unnecessary insertion:"); | |
726a989a | 4148 | print_gimple_stmt (dump_file, t, 0, 0); |
0fc6c492 | 4149 | } |
c90186eb | 4150 | |
726a989a RB |
4151 | gsi = gsi_for_stmt (t); |
4152 | if (gimple_code (t) == GIMPLE_PHI) | |
4153 | remove_phi_node (&gsi, true); | |
0fc6c492 | 4154 | else |
726a989a RB |
4155 | gsi_remove (&gsi, true); |
4156 | release_defs (t); | |
0fc6c492 DB |
4157 | } |
4158 | } | |
726a989a | 4159 | VEC_free (gimple, heap, worklist); |
0fc6c492 | 4160 | } |
c90186eb | 4161 | |
ff2ad0f7 | 4162 | /* Initialize data structures used by PRE. */ |
6de9cd9a DN |
4163 | |
4164 | static void | |
0fc6c492 | 4165 | init_pre (bool do_fre) |
6de9cd9a | 4166 | { |
c9145754 DB |
4167 | basic_block bb; |
4168 | ||
4169 | next_expression_id = 1; | |
4170 | expressions = NULL; | |
4171 | VEC_safe_push (pre_expr, heap, expressions, NULL); | |
4172 | value_expressions = VEC_alloc (bitmap_set_t, heap, get_max_value_id () + 1); | |
4173 | VEC_safe_grow_cleared (bitmap_set_t, heap, value_expressions, | |
4174 | get_max_value_id() + 1); | |
4175 | ||
81def1b7 | 4176 | in_fre = do_fre; |
ff2ad0f7 | 4177 | |
0fc6c492 | 4178 | inserted_exprs = NULL; |
c90186eb DB |
4179 | need_creation = NULL; |
4180 | pretemp = NULL_TREE; | |
4181 | storetemp = NULL_TREE; | |
c90186eb DB |
4182 | prephitemp = NULL_TREE; |
4183 | ||
b71b4522 DB |
4184 | connect_infinite_loops_to_exit (); |
4185 | memset (&pre_stats, 0, sizeof (pre_stats)); | |
4186 | ||
c9145754 DB |
4187 | |
4188 | postorder = XNEWVEC (int, n_basic_blocks - NUM_FIXED_BLOCKS); | |
4189 | post_order_compute (postorder, false, false); | |
4190 | ||
4191 | FOR_ALL_BB (bb) | |
4192 | bb->aux = XCNEWVEC (struct bb_bitmap_sets, 1); | |
4193 | ||
b71b4522 | 4194 | calculate_dominance_info (CDI_POST_DOMINATORS); |
d75dbccd DB |
4195 | calculate_dominance_info (CDI_DOMINATORS); |
4196 | ||
c9145754 DB |
4197 | bitmap_obstack_initialize (&grand_bitmap_obstack); |
4198 | phi_translate_table = htab_create (5110, expr_pred_trans_hash, | |
4199 | expr_pred_trans_eq, free); | |
4200 | expression_to_id = htab_create (num_ssa_names * 3, | |
4201 | pre_expr_hash, | |
4202 | pre_expr_eq, NULL); | |
4203 | seen_during_translate = BITMAP_ALLOC (&grand_bitmap_obstack); | |
4204 | bitmap_set_pool = create_alloc_pool ("Bitmap sets", | |
4205 | sizeof (struct bitmap_set), 30); | |
4206 | pre_expr_pool = create_alloc_pool ("pre_expr nodes", | |
4207 | sizeof (struct pre_expr_d), 30); | |
4208 | FOR_ALL_BB (bb) | |
4209 | { | |
4210 | EXP_GEN (bb) = bitmap_set_new (); | |
4211 | PHI_GEN (bb) = bitmap_set_new (); | |
4212 | TMP_GEN (bb) = bitmap_set_new (); | |
4213 | AVAIL_OUT (bb) = bitmap_set_new (); | |
4214 | } | |
4215 | maximal_set = in_fre ? NULL : bitmap_set_new (); | |
d75dbccd | 4216 | |
8bdbfff5 | 4217 | need_eh_cleanup = BITMAP_ALLOC (NULL); |
ff2ad0f7 DN |
4218 | } |
4219 | ||
4220 | ||
4221 | /* Deallocate data structures used by PRE. */ | |
6de9cd9a | 4222 | |
ff2ad0f7 | 4223 | static void |
678e7c65 | 4224 | fini_pre (bool do_fre) |
ff2ad0f7 | 4225 | { |
c9145754 | 4226 | basic_block bb; |
b71b4522 | 4227 | |
c9145754 DB |
4228 | free (postorder); |
4229 | VEC_free (bitmap_set_t, heap, value_expressions); | |
726a989a RB |
4230 | VEC_free (gimple, heap, inserted_exprs); |
4231 | VEC_free (gimple, heap, need_creation); | |
c9145754 DB |
4232 | bitmap_obstack_release (&grand_bitmap_obstack); |
4233 | free_alloc_pool (bitmap_set_pool); | |
4234 | free_alloc_pool (pre_expr_pool); | |
b71b4522 | 4235 | htab_delete (phi_translate_table); |
c9145754 | 4236 | htab_delete (expression_to_id); |
50265400 | 4237 | |
c9145754 DB |
4238 | FOR_ALL_BB (bb) |
4239 | { | |
4240 | free (bb->aux); | |
4241 | bb->aux = NULL; | |
4242 | } | |
6809cbf9 | 4243 | |
b71b4522 DB |
4244 | free_dominance_info (CDI_POST_DOMINATORS); |
4245 | ||
eb59b8de | 4246 | if (!bitmap_empty_p (need_eh_cleanup)) |
53b4bf74 | 4247 | { |
726a989a | 4248 | gimple_purge_all_dead_eh_edges (need_eh_cleanup); |
53b4bf74 DN |
4249 | cleanup_tree_cfg (); |
4250 | } | |
4251 | ||
8bdbfff5 | 4252 | BITMAP_FREE (need_eh_cleanup); |
b71b4522 | 4253 | |
678e7c65 | 4254 | if (!do_fre) |
598ec7bd | 4255 | loop_optimizer_finalize (); |
ff2ad0f7 DN |
4256 | } |
4257 | ||
ff2ad0f7 DN |
4258 | /* Main entry point to the SSA-PRE pass. DO_FRE is true if the caller |
4259 | only wants to do full redundancy elimination. */ | |
4260 | ||
b80280f2 | 4261 | static unsigned int |
726a989a | 4262 | execute_pre (bool do_fre ATTRIBUTE_UNUSED) |
ff2ad0f7 | 4263 | { |
b80280f2 | 4264 | unsigned int todo = 0; |
83737db2 | 4265 | |
d75dbccd | 4266 | do_partial_partial = optimize > 2; |
ff2ad0f7 | 4267 | |
c9145754 DB |
4268 | /* This has to happen before SCCVN runs because |
4269 | loop_optimizer_init may create new phis, etc. */ | |
c90186eb | 4270 | if (!do_fre) |
c9145754 | 4271 | loop_optimizer_init (LOOPS_NORMAL); |
c90186eb | 4272 | |
3d45dd59 | 4273 | if (!run_scc_vn (do_fre)) |
863d2a57 RG |
4274 | { |
4275 | if (!do_fre) | |
6999afe1 DB |
4276 | { |
4277 | remove_dead_inserted_code (); | |
4278 | loop_optimizer_finalize (); | |
4279 | } | |
4280 | ||
b80280f2 | 4281 | return 0; |
863d2a57 | 4282 | } |
c9145754 DB |
4283 | init_pre (do_fre); |
4284 | ||
4285 | ||
4286 | /* Collect and value number expressions computed in each basic block. */ | |
665fcad8 | 4287 | compute_avail (); |
6de9cd9a | 4288 | |
7e6eb623 DB |
4289 | if (dump_file && (dump_flags & TDF_DETAILS)) |
4290 | { | |
ff2ad0f7 DN |
4291 | basic_block bb; |
4292 | ||
7e6eb623 DB |
4293 | FOR_ALL_BB (bb) |
4294 | { | |
83737db2 DB |
4295 | print_bitmap_set (dump_file, EXP_GEN (bb), "exp_gen", bb->index); |
4296 | print_bitmap_set (dump_file, TMP_GEN (bb), "tmp_gen", | |
6b416da1 | 4297 | bb->index); |
83737db2 | 4298 | print_bitmap_set (dump_file, AVAIL_OUT (bb), "avail_out", |
bdee7684 | 4299 | bb->index); |
7e6eb623 DB |
4300 | } |
4301 | } | |
6de9cd9a | 4302 | |
7e6eb623 DB |
4303 | /* Insert can get quite slow on an incredibly large number of basic |
4304 | blocks due to some quadratic behavior. Until this behavior is | |
4305 | fixed, don't run it when he have an incredibly large number of | |
4306 | bb's. If we aren't going to run insert, there is no point in | |
4307 | computing ANTIC, either, even though it's plenty fast. */ | |
ff2ad0f7 | 4308 | if (!do_fre && n_basic_blocks < 4000) |
6de9cd9a | 4309 | { |
7e6eb623 | 4310 | compute_antic (); |
7e6eb623 DB |
4311 | insert (); |
4312 | } | |
ff2ad0f7 DN |
4313 | |
4314 | /* Remove all the redundant expressions. */ | |
b80280f2 | 4315 | todo |= eliminate (); |
0fc6c492 | 4316 | |
9fe0cb7d RG |
4317 | statistics_counter_event (cfun, "Insertions", pre_stats.insertions); |
4318 | statistics_counter_event (cfun, "PA inserted", pre_stats.pa_insert); | |
4319 | statistics_counter_event (cfun, "New PHIs", pre_stats.phis); | |
4320 | statistics_counter_event (cfun, "Eliminated", pre_stats.eliminations); | |
4321 | statistics_counter_event (cfun, "Constified", pre_stats.constified); | |
c4ab2baa RG |
4322 | |
4323 | /* Make sure to remove fake edges before committing our inserts. | |
4324 | This makes sure we don't end up with extra critical edges that | |
4325 | we would need to split. */ | |
4326 | remove_fake_exit_edges (); | |
726a989a | 4327 | gsi_commit_edge_inserts (); |
c90186eb | 4328 | |
b71b4522 | 4329 | clear_expression_ids (); |
3d45dd59 | 4330 | free_scc_vn (); |
0fc6c492 | 4331 | if (!do_fre) |
1961418e | 4332 | remove_dead_inserted_code (); |
c90186eb | 4333 | |
678e7c65 | 4334 | fini_pre (do_fre); |
b80280f2 RG |
4335 | |
4336 | return todo; | |
ff2ad0f7 DN |
4337 | } |
4338 | ||
ff2ad0f7 DN |
4339 | /* Gate and execute functions for PRE. */ |
4340 | ||
c2924966 | 4341 | static unsigned int |
ff2ad0f7 DN |
4342 | do_pre (void) |
4343 | { | |
b80280f2 | 4344 | return TODO_rebuild_alias | execute_pre (false); |
6de9cd9a DN |
4345 | } |
4346 | ||
4347 | static bool | |
4348 | gate_pre (void) | |
4349 | { | |
8bcf15f6 JH |
4350 | /* PRE tends to generate bigger code. */ |
4351 | return flag_tree_pre != 0 && optimize_function_for_speed_p (cfun); | |
6de9cd9a DN |
4352 | } |
4353 | ||
8ddbbcae | 4354 | struct gimple_opt_pass pass_pre = |
6de9cd9a | 4355 | { |
8ddbbcae JH |
4356 | { |
4357 | GIMPLE_PASS, | |
6de9cd9a DN |
4358 | "pre", /* name */ |
4359 | gate_pre, /* gate */ | |
ff2ad0f7 | 4360 | do_pre, /* execute */ |
6de9cd9a DN |
4361 | NULL, /* sub */ |
4362 | NULL, /* next */ | |
4363 | 0, /* static_pass_number */ | |
4364 | TV_TREE_PRE, /* tv_id */ | |
c1b763fa DN |
4365 | PROP_no_crit_edges | PROP_cfg |
4366 | | PROP_ssa | PROP_alias, /* properties_required */ | |
6de9cd9a DN |
4367 | 0, /* properties_provided */ |
4368 | 0, /* properties_destroyed */ | |
4369 | 0, /* todo_flags_start */ | |
b9c5e484 | 4370 | TODO_update_ssa_only_virtuals | TODO_dump_func | TODO_ggc_collect |
8ddbbcae JH |
4371 | | TODO_verify_ssa /* todo_flags_finish */ |
4372 | } | |
6de9cd9a | 4373 | }; |
ff2ad0f7 DN |
4374 | |
4375 | ||
4376 | /* Gate and execute functions for FRE. */ | |
4377 | ||
c2924966 | 4378 | static unsigned int |
b89361c6 | 4379 | execute_fre (void) |
ff2ad0f7 | 4380 | { |
b80280f2 | 4381 | return execute_pre (true); |
ff2ad0f7 DN |
4382 | } |
4383 | ||
4384 | static bool | |
4385 | gate_fre (void) | |
4386 | { | |
4387 | return flag_tree_fre != 0; | |
4388 | } | |
4389 | ||
8ddbbcae | 4390 | struct gimple_opt_pass pass_fre = |
ff2ad0f7 | 4391 | { |
8ddbbcae JH |
4392 | { |
4393 | GIMPLE_PASS, | |
ff2ad0f7 DN |
4394 | "fre", /* name */ |
4395 | gate_fre, /* gate */ | |
b89361c6 | 4396 | execute_fre, /* execute */ |
ff2ad0f7 DN |
4397 | NULL, /* sub */ |
4398 | NULL, /* next */ | |
4399 | 0, /* static_pass_number */ | |
4400 | TV_TREE_FRE, /* tv_id */ | |
c1b763fa | 4401 | PROP_cfg | PROP_ssa | PROP_alias, /* properties_required */ |
ff2ad0f7 DN |
4402 | 0, /* properties_provided */ |
4403 | 0, /* properties_destroyed */ | |
4404 | 0, /* todo_flags_start */ | |
8ddbbcae JH |
4405 | TODO_dump_func | TODO_ggc_collect | TODO_verify_ssa /* todo_flags_finish */ |
4406 | } | |
ff2ad0f7 | 4407 | }; |