]>
Commit | Line | Data |
---|---|---|
2b725155 | 1 | /* Lower complex number operations to scalar operations. |
8d9254fc | 2 | Copyright (C) 2004-2020 Free Software Foundation, Inc. |
6de9cd9a DN |
3 | |
4 | This file is part of GCC. | |
b8698a0f | 5 | |
6de9cd9a DN |
6 | GCC is free software; you can redistribute it and/or modify it |
7 | under the terms of the GNU General Public License as published by the | |
9dcd6f09 | 8 | Free Software Foundation; either version 3, or (at your option) any |
6de9cd9a | 9 | later version. |
b8698a0f | 10 | |
6de9cd9a DN |
11 | GCC is distributed in the hope that it will be useful, but WITHOUT |
12 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
b8698a0f | 15 | |
6de9cd9a | 16 | You should have received a copy of the GNU General Public License |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a DN |
19 | |
20 | #include "config.h" | |
21 | #include "system.h" | |
22 | #include "coretypes.h" | |
c7131fb2 | 23 | #include "backend.h" |
957060b5 | 24 | #include "rtl.h" |
e41d82f5 | 25 | #include "tree.h" |
c7131fb2 | 26 | #include "gimple.h" |
957060b5 AM |
27 | #include "cfghooks.h" |
28 | #include "tree-pass.h" | |
c7131fb2 | 29 | #include "ssa.h" |
40e23961 | 30 | #include "fold-const.h" |
d8a2d370 | 31 | #include "stor-layout.h" |
2fb9a547 | 32 | #include "tree-eh.h" |
45b0be94 | 33 | #include "gimplify.h" |
5be5c238 | 34 | #include "gimple-iterator.h" |
18f429e2 | 35 | #include "gimplify-me.h" |
442b4905 | 36 | #include "tree-cfg.h" |
442b4905 AM |
37 | #include "tree-dfa.h" |
38 | #include "tree-ssa.h" | |
e41d82f5 | 39 | #include "tree-ssa-propagate.h" |
4a8fb1a1 | 40 | #include "tree-hasher.h" |
a9e0d843 | 41 | #include "cfgloop.h" |
0c9b3294 | 42 | #include "cfganal.h" |
e41d82f5 RH |
43 | |
44 | ||
45 | /* For each complex ssa name, a lattice value. We're interested in finding | |
46 | out whether a complex number is degenerate in some way, having only real | |
47 | or only complex parts. */ | |
48 | ||
32e8bb8e | 49 | enum |
e41d82f5 RH |
50 | { |
51 | UNINITIALIZED = 0, | |
52 | ONLY_REAL = 1, | |
53 | ONLY_IMAG = 2, | |
54 | VARYING = 3 | |
32e8bb8e ILT |
55 | }; |
56 | ||
57 | /* The type complex_lattice_t holds combinations of the above | |
58 | constants. */ | |
59 | typedef int complex_lattice_t; | |
e41d82f5 RH |
60 | |
61 | #define PAIR(a, b) ((a) << 2 | (b)) | |
62 | ||
d9a3704a JL |
63 | class complex_propagate : public ssa_propagation_engine |
64 | { | |
65 | enum ssa_prop_result visit_stmt (gimple *, edge *, tree *) FINAL OVERRIDE; | |
66 | enum ssa_prop_result visit_phi (gphi *) FINAL OVERRIDE; | |
67 | }; | |
e41d82f5 | 68 | |
9771b263 | 69 | static vec<complex_lattice_t> complex_lattice_values; |
e41d82f5 | 70 | |
a3648cfc DB |
71 | /* For each complex variable, a pair of variables for the components exists in |
72 | the hashtable. */ | |
c203e8a7 | 73 | static int_tree_htab_type *complex_variable_components; |
a3648cfc | 74 | |
95a8c155 | 75 | /* For each complex SSA_NAME, a pair of ssa names for the components. */ |
9771b263 | 76 | static vec<tree> complex_ssa_name_components; |
95a8c155 | 77 | |
0c9b3294 JJ |
78 | /* Vector of PHI triplets (original complex PHI and corresponding real and |
79 | imag PHIs if real and/or imag PHIs contain temporarily | |
80 | non-SSA_NAME/non-invariant args that need to be replaced by SSA_NAMEs. */ | |
81 | static vec<gphi *> phis_to_revisit; | |
82 | ||
bca7138a RB |
83 | /* BBs that need EH cleanup. */ |
84 | static bitmap need_eh_cleanup; | |
85 | ||
a3648cfc DB |
86 | /* Lookup UID in the complex_variable_components hashtable and return the |
87 | associated tree. */ | |
b8698a0f | 88 | static tree |
a3648cfc DB |
89 | cvc_lookup (unsigned int uid) |
90 | { | |
84baa4b9 | 91 | struct int_tree_map in; |
a3648cfc | 92 | in.uid = uid; |
84baa4b9 | 93 | return complex_variable_components->find_with_hash (in, uid).to; |
a3648cfc | 94 | } |
b8698a0f | 95 | |
a3648cfc DB |
96 | /* Insert the pair UID, TO into the complex_variable_components hashtable. */ |
97 | ||
b8698a0f | 98 | static void |
a3648cfc | 99 | cvc_insert (unsigned int uid, tree to) |
b8698a0f | 100 | { |
84baa4b9 TS |
101 | int_tree_map h; |
102 | int_tree_map *loc; | |
a3648cfc | 103 | |
84baa4b9 | 104 | h.uid = uid; |
c203e8a7 | 105 | loc = complex_variable_components->find_slot_with_hash (h, uid, INSERT); |
84baa4b9 TS |
106 | loc->uid = uid; |
107 | loc->to = to; | |
a3648cfc | 108 | } |
e41d82f5 | 109 | |
e41d82f5 RH |
110 | /* Return true if T is not a zero constant. In the case of real values, |
111 | we're only interested in +0.0. */ | |
112 | ||
113 | static int | |
114 | some_nonzerop (tree t) | |
115 | { | |
116 | int zerop = false; | |
117 | ||
2ca862e9 JM |
118 | /* Operations with real or imaginary part of a complex number zero |
119 | cannot be treated the same as operations with a real or imaginary | |
120 | operand if we care about the signs of zeros in the result. */ | |
121 | if (TREE_CODE (t) == REAL_CST && !flag_signed_zeros) | |
1a25c6b1 | 122 | zerop = real_identical (&TREE_REAL_CST (t), &dconst0); |
325217ed CF |
123 | else if (TREE_CODE (t) == FIXED_CST) |
124 | zerop = fixed_zerop (t); | |
e41d82f5 RH |
125 | else if (TREE_CODE (t) == INTEGER_CST) |
126 | zerop = integer_zerop (t); | |
127 | ||
128 | return !zerop; | |
129 | } | |
130 | ||
726a989a RB |
131 | |
132 | /* Compute a lattice value from the components of a complex type REAL | |
133 | and IMAG. */ | |
6de9cd9a | 134 | |
e41d82f5 | 135 | static complex_lattice_t |
726a989a | 136 | find_lattice_value_parts (tree real, tree imag) |
e41d82f5 | 137 | { |
e41d82f5 RH |
138 | int r, i; |
139 | complex_lattice_t ret; | |
140 | ||
726a989a RB |
141 | r = some_nonzerop (real); |
142 | i = some_nonzerop (imag); | |
143 | ret = r * ONLY_REAL + i * ONLY_IMAG; | |
144 | ||
145 | /* ??? On occasion we could do better than mapping 0+0i to real, but we | |
146 | certainly don't want to leave it UNINITIALIZED, which eventually gets | |
147 | mapped to VARYING. */ | |
148 | if (ret == UNINITIALIZED) | |
149 | ret = ONLY_REAL; | |
150 | ||
151 | return ret; | |
152 | } | |
153 | ||
154 | ||
155 | /* Compute a lattice value from gimple_val T. */ | |
156 | ||
157 | static complex_lattice_t | |
158 | find_lattice_value (tree t) | |
159 | { | |
160 | tree real, imag; | |
161 | ||
e41d82f5 RH |
162 | switch (TREE_CODE (t)) |
163 | { | |
164 | case SSA_NAME: | |
9771b263 | 165 | return complex_lattice_values[SSA_NAME_VERSION (t)]; |
e41d82f5 RH |
166 | |
167 | case COMPLEX_CST: | |
168 | real = TREE_REALPART (t); | |
169 | imag = TREE_IMAGPART (t); | |
170 | break; | |
171 | ||
e41d82f5 RH |
172 | default: |
173 | gcc_unreachable (); | |
174 | } | |
175 | ||
726a989a | 176 | return find_lattice_value_parts (real, imag); |
e41d82f5 RH |
177 | } |
178 | ||
179 | /* Determine if LHS is something for which we're interested in seeing | |
180 | simulation results. */ | |
181 | ||
182 | static bool | |
183 | is_complex_reg (tree lhs) | |
184 | { | |
185 | return TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE && is_gimple_reg (lhs); | |
186 | } | |
187 | ||
188 | /* Mark the incoming parameters to the function as VARYING. */ | |
189 | ||
190 | static void | |
191 | init_parameter_lattice_values (void) | |
192 | { | |
f0a77246 | 193 | tree parm, ssa_name; |
e41d82f5 | 194 | |
910ad8de | 195 | for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = DECL_CHAIN (parm)) |
f0a77246 | 196 | if (is_complex_reg (parm) |
32244553 | 197 | && (ssa_name = ssa_default_def (cfun, parm)) != NULL_TREE) |
9771b263 | 198 | complex_lattice_values[SSA_NAME_VERSION (ssa_name)] = VARYING; |
e41d82f5 RH |
199 | } |
200 | ||
726a989a RB |
201 | /* Initialize simulation state for each statement. Return false if we |
202 | found no statements we want to simulate, and thus there's nothing | |
203 | for the entire pass to do. */ | |
e41d82f5 RH |
204 | |
205 | static bool | |
206 | init_dont_simulate_again (void) | |
207 | { | |
208 | basic_block bb; | |
8f8abce4 | 209 | bool saw_a_complex_op = false; |
e41d82f5 | 210 | |
11cd3bed | 211 | FOR_EACH_BB_FN (bb, cfun) |
e41d82f5 | 212 | { |
538dd0b7 DM |
213 | for (gphi_iterator gsi = gsi_start_phis (bb); !gsi_end_p (gsi); |
214 | gsi_next (&gsi)) | |
726a989a | 215 | { |
538dd0b7 | 216 | gphi *phi = gsi.phi (); |
726a989a RB |
217 | prop_set_simulate_again (phi, |
218 | is_complex_reg (gimple_phi_result (phi))); | |
219 | } | |
e41d82f5 | 220 | |
538dd0b7 DM |
221 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi); |
222 | gsi_next (&gsi)) | |
e41d82f5 | 223 | { |
355fe088 | 224 | gimple *stmt; |
726a989a RB |
225 | tree op0, op1; |
226 | bool sim_again_p; | |
e41d82f5 | 227 | |
726a989a RB |
228 | stmt = gsi_stmt (gsi); |
229 | op0 = op1 = NULL_TREE; | |
99e6bdda | 230 | |
b8698a0f | 231 | /* Most control-altering statements must be initially |
99e6bdda | 232 | simulated, else we won't cover the entire cfg. */ |
726a989a | 233 | sim_again_p = stmt_ends_bb_p (stmt); |
99e6bdda | 234 | |
726a989a | 235 | switch (gimple_code (stmt)) |
e41d82f5 | 236 | { |
726a989a RB |
237 | case GIMPLE_CALL: |
238 | if (gimple_call_lhs (stmt)) | |
239 | sim_again_p = is_complex_reg (gimple_call_lhs (stmt)); | |
240 | break; | |
8f8abce4 | 241 | |
726a989a RB |
242 | case GIMPLE_ASSIGN: |
243 | sim_again_p = is_complex_reg (gimple_assign_lhs (stmt)); | |
244 | if (gimple_assign_rhs_code (stmt) == REALPART_EXPR | |
245 | || gimple_assign_rhs_code (stmt) == IMAGPART_EXPR) | |
246 | op0 = TREE_OPERAND (gimple_assign_rhs1 (stmt), 0); | |
247 | else | |
248 | op0 = gimple_assign_rhs1 (stmt); | |
249 | if (gimple_num_ops (stmt) > 2) | |
250 | op1 = gimple_assign_rhs2 (stmt); | |
8f8abce4 RH |
251 | break; |
252 | ||
726a989a RB |
253 | case GIMPLE_COND: |
254 | op0 = gimple_cond_lhs (stmt); | |
255 | op1 = gimple_cond_rhs (stmt); | |
8f8abce4 RH |
256 | break; |
257 | ||
258 | default: | |
259 | break; | |
e41d82f5 RH |
260 | } |
261 | ||
726a989a RB |
262 | if (op0 || op1) |
263 | switch (gimple_expr_code (stmt)) | |
8f8abce4 RH |
264 | { |
265 | case EQ_EXPR: | |
266 | case NE_EXPR: | |
8f8abce4 RH |
267 | case PLUS_EXPR: |
268 | case MINUS_EXPR: | |
269 | case MULT_EXPR: | |
270 | case TRUNC_DIV_EXPR: | |
271 | case CEIL_DIV_EXPR: | |
272 | case FLOOR_DIV_EXPR: | |
273 | case ROUND_DIV_EXPR: | |
274 | case RDIV_EXPR: | |
726a989a RB |
275 | if (TREE_CODE (TREE_TYPE (op0)) == COMPLEX_TYPE |
276 | || TREE_CODE (TREE_TYPE (op1)) == COMPLEX_TYPE) | |
277 | saw_a_complex_op = true; | |
278 | break; | |
279 | ||
8f8abce4 RH |
280 | case NEGATE_EXPR: |
281 | case CONJ_EXPR: | |
726a989a | 282 | if (TREE_CODE (TREE_TYPE (op0)) == COMPLEX_TYPE) |
8f8abce4 RH |
283 | saw_a_complex_op = true; |
284 | break; | |
285 | ||
7b7e6ecd EB |
286 | case REALPART_EXPR: |
287 | case IMAGPART_EXPR: | |
288 | /* The total store transformation performed during | |
726a989a RB |
289 | gimplification creates such uninitialized loads |
290 | and we need to lower the statement to be able | |
291 | to fix things up. */ | |
292 | if (TREE_CODE (op0) == SSA_NAME | |
293 | && ssa_undefined_value_p (op0)) | |
7b7e6ecd EB |
294 | saw_a_complex_op = true; |
295 | break; | |
296 | ||
8f8abce4 RH |
297 | default: |
298 | break; | |
299 | } | |
300 | ||
726a989a | 301 | prop_set_simulate_again (stmt, sim_again_p); |
e41d82f5 RH |
302 | } |
303 | } | |
304 | ||
8f8abce4 | 305 | return saw_a_complex_op; |
e41d82f5 RH |
306 | } |
307 | ||
308 | ||
309 | /* Evaluate statement STMT against the complex lattice defined above. */ | |
310 | ||
d9a3704a JL |
311 | enum ssa_prop_result |
312 | complex_propagate::visit_stmt (gimple *stmt, edge *taken_edge_p ATTRIBUTE_UNUSED, | |
313 | tree *result_p) | |
e41d82f5 RH |
314 | { |
315 | complex_lattice_t new_l, old_l, op1_l, op2_l; | |
316 | unsigned int ver; | |
726a989a | 317 | tree lhs; |
e41d82f5 | 318 | |
726a989a RB |
319 | lhs = gimple_get_lhs (stmt); |
320 | /* Skip anything but GIMPLE_ASSIGN and GIMPLE_CALL with a lhs. */ | |
321 | if (!lhs) | |
99e6bdda | 322 | return SSA_PROP_VARYING; |
e41d82f5 | 323 | |
99e6bdda RH |
324 | /* These conditions should be satisfied due to the initial filter |
325 | set up in init_dont_simulate_again. */ | |
e41d82f5 RH |
326 | gcc_assert (TREE_CODE (lhs) == SSA_NAME); |
327 | gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE); | |
328 | ||
329 | *result_p = lhs; | |
330 | ver = SSA_NAME_VERSION (lhs); | |
9771b263 | 331 | old_l = complex_lattice_values[ver]; |
e41d82f5 | 332 | |
726a989a | 333 | switch (gimple_expr_code (stmt)) |
e41d82f5 RH |
334 | { |
335 | case SSA_NAME: | |
e41d82f5 | 336 | case COMPLEX_CST: |
726a989a RB |
337 | new_l = find_lattice_value (gimple_assign_rhs1 (stmt)); |
338 | break; | |
339 | ||
340 | case COMPLEX_EXPR: | |
341 | new_l = find_lattice_value_parts (gimple_assign_rhs1 (stmt), | |
342 | gimple_assign_rhs2 (stmt)); | |
e41d82f5 RH |
343 | break; |
344 | ||
345 | case PLUS_EXPR: | |
346 | case MINUS_EXPR: | |
726a989a RB |
347 | op1_l = find_lattice_value (gimple_assign_rhs1 (stmt)); |
348 | op2_l = find_lattice_value (gimple_assign_rhs2 (stmt)); | |
e41d82f5 RH |
349 | |
350 | /* We've set up the lattice values such that IOR neatly | |
351 | models addition. */ | |
352 | new_l = op1_l | op2_l; | |
353 | break; | |
354 | ||
355 | case MULT_EXPR: | |
356 | case RDIV_EXPR: | |
357 | case TRUNC_DIV_EXPR: | |
358 | case CEIL_DIV_EXPR: | |
359 | case FLOOR_DIV_EXPR: | |
360 | case ROUND_DIV_EXPR: | |
726a989a RB |
361 | op1_l = find_lattice_value (gimple_assign_rhs1 (stmt)); |
362 | op2_l = find_lattice_value (gimple_assign_rhs2 (stmt)); | |
e41d82f5 RH |
363 | |
364 | /* Obviously, if either varies, so does the result. */ | |
365 | if (op1_l == VARYING || op2_l == VARYING) | |
366 | new_l = VARYING; | |
367 | /* Don't prematurely promote variables if we've not yet seen | |
368 | their inputs. */ | |
369 | else if (op1_l == UNINITIALIZED) | |
370 | new_l = op2_l; | |
371 | else if (op2_l == UNINITIALIZED) | |
372 | new_l = op1_l; | |
373 | else | |
374 | { | |
375 | /* At this point both numbers have only one component. If the | |
376 | numbers are of opposite kind, the result is imaginary, | |
377 | otherwise the result is real. The add/subtract translates | |
378 | the real/imag from/to 0/1; the ^ performs the comparison. */ | |
379 | new_l = ((op1_l - ONLY_REAL) ^ (op2_l - ONLY_REAL)) + ONLY_REAL; | |
380 | ||
381 | /* Don't allow the lattice value to flip-flop indefinitely. */ | |
382 | new_l |= old_l; | |
383 | } | |
384 | break; | |
385 | ||
386 | case NEGATE_EXPR: | |
387 | case CONJ_EXPR: | |
726a989a | 388 | new_l = find_lattice_value (gimple_assign_rhs1 (stmt)); |
e41d82f5 RH |
389 | break; |
390 | ||
391 | default: | |
392 | new_l = VARYING; | |
393 | break; | |
394 | } | |
395 | ||
396 | /* If nothing changed this round, let the propagator know. */ | |
397 | if (new_l == old_l) | |
398 | return SSA_PROP_NOT_INTERESTING; | |
399 | ||
9771b263 | 400 | complex_lattice_values[ver] = new_l; |
e41d82f5 RH |
401 | return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING; |
402 | } | |
403 | ||
404 | /* Evaluate a PHI node against the complex lattice defined above. */ | |
405 | ||
d9a3704a JL |
406 | enum ssa_prop_result |
407 | complex_propagate::visit_phi (gphi *phi) | |
e41d82f5 RH |
408 | { |
409 | complex_lattice_t new_l, old_l; | |
410 | unsigned int ver; | |
411 | tree lhs; | |
412 | int i; | |
413 | ||
726a989a | 414 | lhs = gimple_phi_result (phi); |
e41d82f5 RH |
415 | |
416 | /* This condition should be satisfied due to the initial filter | |
417 | set up in init_dont_simulate_again. */ | |
418 | gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE); | |
419 | ||
420 | /* We've set up the lattice values such that IOR neatly models PHI meet. */ | |
421 | new_l = UNINITIALIZED; | |
726a989a RB |
422 | for (i = gimple_phi_num_args (phi) - 1; i >= 0; --i) |
423 | new_l |= find_lattice_value (gimple_phi_arg_def (phi, i)); | |
e41d82f5 RH |
424 | |
425 | ver = SSA_NAME_VERSION (lhs); | |
9771b263 | 426 | old_l = complex_lattice_values[ver]; |
e41d82f5 RH |
427 | |
428 | if (new_l == old_l) | |
429 | return SSA_PROP_NOT_INTERESTING; | |
430 | ||
9771b263 | 431 | complex_lattice_values[ver] = new_l; |
e41d82f5 RH |
432 | return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING; |
433 | } | |
434 | ||
95a8c155 | 435 | /* Create one backing variable for a complex component of ORIG. */ |
e41d82f5 | 436 | |
95a8c155 RH |
437 | static tree |
438 | create_one_component_var (tree type, tree orig, const char *prefix, | |
439 | const char *suffix, enum tree_code code) | |
e41d82f5 | 440 | { |
95a8c155 | 441 | tree r = create_tmp_var (type, prefix); |
e41d82f5 | 442 | |
95a8c155 RH |
443 | DECL_SOURCE_LOCATION (r) = DECL_SOURCE_LOCATION (orig); |
444 | DECL_ARTIFICIAL (r) = 1; | |
8f8abce4 | 445 | |
95a8c155 RH |
446 | if (DECL_NAME (orig) && !DECL_IGNORED_P (orig)) |
447 | { | |
448 | const char *name = IDENTIFIER_POINTER (DECL_NAME (orig)); | |
269e63b7 KT |
449 | name = ACONCAT ((name, suffix, NULL)); |
450 | DECL_NAME (r) = get_identifier (name); | |
e41d82f5 | 451 | |
95a8c155 | 452 | SET_DECL_DEBUG_EXPR (r, build1 (code, type, orig)); |
839b422f | 453 | DECL_HAS_DEBUG_EXPR_P (r) = 1; |
95a8c155 RH |
454 | DECL_IGNORED_P (r) = 0; |
455 | TREE_NO_WARNING (r) = TREE_NO_WARNING (orig); | |
456 | } | |
457 | else | |
e41d82f5 | 458 | { |
95a8c155 RH |
459 | DECL_IGNORED_P (r) = 1; |
460 | TREE_NO_WARNING (r) = 1; | |
461 | } | |
e41d82f5 | 462 | |
95a8c155 RH |
463 | return r; |
464 | } | |
e41d82f5 | 465 | |
95a8c155 | 466 | /* Retrieve a value for a complex component of VAR. */ |
e41d82f5 | 467 | |
95a8c155 RH |
468 | static tree |
469 | get_component_var (tree var, bool imag_p) | |
470 | { | |
471 | size_t decl_index = DECL_UID (var) * 2 + imag_p; | |
472 | tree ret = cvc_lookup (decl_index); | |
473 | ||
474 | if (ret == NULL) | |
475 | { | |
476 | ret = create_one_component_var (TREE_TYPE (TREE_TYPE (var)), var, | |
477 | imag_p ? "CI" : "CR", | |
478 | imag_p ? "$imag" : "$real", | |
479 | imag_p ? IMAGPART_EXPR : REALPART_EXPR); | |
480 | cvc_insert (decl_index, ret); | |
481 | } | |
482 | ||
483 | return ret; | |
484 | } | |
e41d82f5 | 485 | |
95a8c155 | 486 | /* Retrieve a value for a complex component of SSA_NAME. */ |
e41d82f5 | 487 | |
95a8c155 RH |
488 | static tree |
489 | get_component_ssa_name (tree ssa_name, bool imag_p) | |
490 | { | |
491 | complex_lattice_t lattice = find_lattice_value (ssa_name); | |
492 | size_t ssa_name_index; | |
493 | tree ret; | |
e41d82f5 | 494 | |
95a8c155 RH |
495 | if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG)) |
496 | { | |
497 | tree inner_type = TREE_TYPE (TREE_TYPE (ssa_name)); | |
498 | if (SCALAR_FLOAT_TYPE_P (inner_type)) | |
499 | return build_real (inner_type, dconst0); | |
500 | else | |
501 | return build_int_cst (inner_type, 0); | |
502 | } | |
e41d82f5 | 503 | |
95a8c155 | 504 | ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p; |
9771b263 | 505 | ret = complex_ssa_name_components[ssa_name_index]; |
95a8c155 RH |
506 | if (ret == NULL) |
507 | { | |
70b5e7dc RG |
508 | if (SSA_NAME_VAR (ssa_name)) |
509 | ret = get_component_var (SSA_NAME_VAR (ssa_name), imag_p); | |
510 | else | |
511 | ret = TREE_TYPE (TREE_TYPE (ssa_name)); | |
b731b390 | 512 | ret = make_ssa_name (ret); |
95a8c155 RH |
513 | |
514 | /* Copy some properties from the original. In particular, whether it | |
515 | is used in an abnormal phi, and whether it's uninitialized. */ | |
516 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ret) | |
517 | = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name); | |
67386041 RG |
518 | if (SSA_NAME_IS_DEFAULT_DEF (ssa_name) |
519 | && TREE_CODE (SSA_NAME_VAR (ssa_name)) == VAR_DECL) | |
95a8c155 RH |
520 | { |
521 | SSA_NAME_DEF_STMT (ret) = SSA_NAME_DEF_STMT (ssa_name); | |
32244553 | 522 | set_ssa_default_def (cfun, SSA_NAME_VAR (ret), ret); |
e41d82f5 RH |
523 | } |
524 | ||
9771b263 | 525 | complex_ssa_name_components[ssa_name_index] = ret; |
e41d82f5 | 526 | } |
95a8c155 RH |
527 | |
528 | return ret; | |
529 | } | |
530 | ||
726a989a RB |
531 | /* Set a value for a complex component of SSA_NAME, return a |
532 | gimple_seq of stuff that needs doing. */ | |
95a8c155 | 533 | |
726a989a | 534 | static gimple_seq |
95a8c155 RH |
535 | set_component_ssa_name (tree ssa_name, bool imag_p, tree value) |
536 | { | |
537 | complex_lattice_t lattice = find_lattice_value (ssa_name); | |
538 | size_t ssa_name_index; | |
726a989a | 539 | tree comp; |
355fe088 | 540 | gimple *last; |
726a989a | 541 | gimple_seq list; |
95a8c155 RH |
542 | |
543 | /* We know the value must be zero, else there's a bug in our lattice | |
544 | analysis. But the value may well be a variable known to contain | |
545 | zero. We should be safe ignoring it. */ | |
546 | if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG)) | |
547 | return NULL; | |
548 | ||
549 | /* If we've already assigned an SSA_NAME to this component, then this | |
550 | means that our walk of the basic blocks found a use before the set. | |
551 | This is fine. Now we should create an initialization for the value | |
552 | we created earlier. */ | |
553 | ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p; | |
9771b263 | 554 | comp = complex_ssa_name_components[ssa_name_index]; |
95a8c155 RH |
555 | if (comp) |
556 | ; | |
557 | ||
558 | /* If we've nothing assigned, and the value we're given is already stable, | |
536fa7b7 | 559 | then install that as the value for this SSA_NAME. This preemptively |
95a8c155 | 560 | copy-propagates the value, which avoids unnecessary memory allocation. */ |
35a45bd4 RH |
561 | else if (is_gimple_min_invariant (value) |
562 | && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name)) | |
95a8c155 | 563 | { |
9771b263 | 564 | complex_ssa_name_components[ssa_name_index] = value; |
95a8c155 RH |
565 | return NULL; |
566 | } | |
567 | else if (TREE_CODE (value) == SSA_NAME | |
568 | && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name)) | |
569 | { | |
570 | /* Replace an anonymous base value with the variable from cvc_lookup. | |
571 | This should result in better debug info. */ | |
70b5e7dc RG |
572 | if (SSA_NAME_VAR (ssa_name) |
573 | && (!SSA_NAME_VAR (value) || DECL_IGNORED_P (SSA_NAME_VAR (value))) | |
95a8c155 RH |
574 | && !DECL_IGNORED_P (SSA_NAME_VAR (ssa_name))) |
575 | { | |
576 | comp = get_component_var (SSA_NAME_VAR (ssa_name), imag_p); | |
db753fa1 | 577 | replace_ssa_name_symbol (value, comp); |
95a8c155 RH |
578 | } |
579 | ||
9771b263 | 580 | complex_ssa_name_components[ssa_name_index] = value; |
95a8c155 RH |
581 | return NULL; |
582 | } | |
583 | ||
584 | /* Finally, we need to stabilize the result by installing the value into | |
585 | a new ssa name. */ | |
586 | else | |
587 | comp = get_component_ssa_name (ssa_name, imag_p); | |
b8698a0f | 588 | |
95a8c155 | 589 | /* Do all the work to assign VALUE to COMP. */ |
726a989a | 590 | list = NULL; |
95a8c155 | 591 | value = force_gimple_operand (value, &list, false, NULL); |
726a989a RB |
592 | last = gimple_build_assign (comp, value); |
593 | gimple_seq_add_stmt (&list, last); | |
594 | gcc_assert (SSA_NAME_DEF_STMT (comp) == last); | |
95a8c155 RH |
595 | |
596 | return list; | |
e41d82f5 | 597 | } |
6de9cd9a | 598 | |
6de9cd9a DN |
599 | /* Extract the real or imaginary part of a complex variable or constant. |
600 | Make sure that it's a proper gimple_val and gimplify it if not. | |
726a989a | 601 | Emit any new code before gsi. */ |
6de9cd9a DN |
602 | |
603 | static tree | |
726a989a | 604 | extract_component (gimple_stmt_iterator *gsi, tree t, bool imagpart_p, |
0c9b3294 | 605 | bool gimple_p, bool phiarg_p = false) |
6de9cd9a | 606 | { |
6de9cd9a DN |
607 | switch (TREE_CODE (t)) |
608 | { | |
609 | case COMPLEX_CST: | |
e41d82f5 | 610 | return imagpart_p ? TREE_IMAGPART (t) : TREE_REALPART (t); |
6de9cd9a DN |
611 | |
612 | case COMPLEX_EXPR: | |
726a989a | 613 | gcc_unreachable (); |
6de9cd9a | 614 | |
64ea4e15 RB |
615 | case BIT_FIELD_REF: |
616 | { | |
617 | tree inner_type = TREE_TYPE (TREE_TYPE (t)); | |
618 | t = unshare_expr (t); | |
619 | TREE_TYPE (t) = inner_type; | |
620 | TREE_OPERAND (t, 1) = TYPE_SIZE (inner_type); | |
621 | if (imagpart_p) | |
622 | TREE_OPERAND (t, 2) = size_binop (PLUS_EXPR, TREE_OPERAND (t, 2), | |
623 | TYPE_SIZE (inner_type)); | |
624 | if (gimple_p) | |
625 | t = force_gimple_operand_gsi (gsi, t, true, NULL, true, | |
626 | GSI_SAME_STMT); | |
627 | return t; | |
628 | } | |
629 | ||
6de9cd9a | 630 | case VAR_DECL: |
f35a986c | 631 | case RESULT_DECL: |
6de9cd9a | 632 | case PARM_DECL: |
e41d82f5 RH |
633 | case COMPONENT_REF: |
634 | case ARRAY_REF: | |
7ec49257 | 635 | case VIEW_CONVERT_EXPR: |
70f34814 | 636 | case MEM_REF: |
e41d82f5 RH |
637 | { |
638 | tree inner_type = TREE_TYPE (TREE_TYPE (t)); | |
639 | ||
640 | t = build1 ((imagpart_p ? IMAGPART_EXPR : REALPART_EXPR), | |
641 | inner_type, unshare_expr (t)); | |
642 | ||
643 | if (gimple_p) | |
726a989a RB |
644 | t = force_gimple_operand_gsi (gsi, t, true, NULL, true, |
645 | GSI_SAME_STMT); | |
e41d82f5 RH |
646 | |
647 | return t; | |
648 | } | |
649 | ||
650 | case SSA_NAME: | |
0c9b3294 JJ |
651 | t = get_component_ssa_name (t, imagpart_p); |
652 | if (TREE_CODE (t) == SSA_NAME && SSA_NAME_DEF_STMT (t) == NULL) | |
653 | gcc_assert (phiarg_p); | |
654 | return t; | |
6de9cd9a DN |
655 | |
656 | default: | |
1e128c5f | 657 | gcc_unreachable (); |
6de9cd9a | 658 | } |
e41d82f5 RH |
659 | } |
660 | ||
661 | /* Update the complex components of the ssa name on the lhs of STMT. */ | |
6de9cd9a | 662 | |
e41d82f5 | 663 | static void |
355fe088 | 664 | update_complex_components (gimple_stmt_iterator *gsi, gimple *stmt, tree r, |
726a989a | 665 | tree i) |
e41d82f5 | 666 | { |
726a989a RB |
667 | tree lhs; |
668 | gimple_seq list; | |
669 | ||
670 | lhs = gimple_get_lhs (stmt); | |
95a8c155 RH |
671 | |
672 | list = set_component_ssa_name (lhs, false, r); | |
673 | if (list) | |
726a989a | 674 | gsi_insert_seq_after (gsi, list, GSI_CONTINUE_LINKING); |
95a8c155 RH |
675 | |
676 | list = set_component_ssa_name (lhs, true, i); | |
677 | if (list) | |
726a989a | 678 | gsi_insert_seq_after (gsi, list, GSI_CONTINUE_LINKING); |
6de9cd9a DN |
679 | } |
680 | ||
5d6b3bba | 681 | static void |
95a8c155 | 682 | update_complex_components_on_edge (edge e, tree lhs, tree r, tree i) |
5d6b3bba | 683 | { |
726a989a | 684 | gimple_seq list; |
5d6b3bba | 685 | |
95a8c155 RH |
686 | list = set_component_ssa_name (lhs, false, r); |
687 | if (list) | |
726a989a | 688 | gsi_insert_seq_on_edge (e, list); |
5d6b3bba | 689 | |
95a8c155 RH |
690 | list = set_component_ssa_name (lhs, true, i); |
691 | if (list) | |
726a989a | 692 | gsi_insert_seq_on_edge (e, list); |
5d6b3bba RH |
693 | } |
694 | ||
726a989a | 695 | |
6de9cd9a DN |
696 | /* Update an assignment to a complex variable in place. */ |
697 | ||
698 | static void | |
726a989a | 699 | update_complex_assignment (gimple_stmt_iterator *gsi, tree r, tree i) |
6de9cd9a | 700 | { |
ef9fc3ba | 701 | gimple *old_stmt = gsi_stmt (*gsi); |
355a7673 | 702 | gimple_assign_set_rhs_with_ops (gsi, COMPLEX_EXPR, r, i); |
ef9fc3ba | 703 | gimple *stmt = gsi_stmt (*gsi); |
f5e5b46c | 704 | update_stmt (stmt); |
ef9fc3ba | 705 | if (maybe_clean_or_replace_eh_stmt (old_stmt, stmt)) |
bca7138a | 706 | bitmap_set_bit (need_eh_cleanup, gimple_bb (stmt)->index); |
355a7673 | 707 | |
7d187fdf | 708 | update_complex_components (gsi, gsi_stmt (*gsi), r, i); |
e41d82f5 RH |
709 | } |
710 | ||
726a989a | 711 | |
e41d82f5 RH |
712 | /* Generate code at the entry point of the function to initialize the |
713 | component variables for a complex parameter. */ | |
714 | ||
715 | static void | |
716 | update_parameter_components (void) | |
717 | { | |
fefa31b5 | 718 | edge entry_edge = single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun)); |
e41d82f5 RH |
719 | tree parm; |
720 | ||
910ad8de | 721 | for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = DECL_CHAIN (parm)) |
e41d82f5 RH |
722 | { |
723 | tree type = TREE_TYPE (parm); | |
5d6b3bba | 724 | tree ssa_name, r, i; |
e41d82f5 RH |
725 | |
726 | if (TREE_CODE (type) != COMPLEX_TYPE || !is_gimple_reg (parm)) | |
727 | continue; | |
728 | ||
729 | type = TREE_TYPE (type); | |
32244553 | 730 | ssa_name = ssa_default_def (cfun, parm); |
c0a3f887 RG |
731 | if (!ssa_name) |
732 | continue; | |
e41d82f5 | 733 | |
5d6b3bba RH |
734 | r = build1 (REALPART_EXPR, type, ssa_name); |
735 | i = build1 (IMAGPART_EXPR, type, ssa_name); | |
95a8c155 | 736 | update_complex_components_on_edge (entry_edge, ssa_name, r, i); |
e41d82f5 RH |
737 | } |
738 | } | |
739 | ||
740 | /* Generate code to set the component variables of a complex variable | |
741 | to match the PHI statements in block BB. */ | |
742 | ||
743 | static void | |
744 | update_phi_components (basic_block bb) | |
745 | { | |
538dd0b7 | 746 | gphi_iterator gsi; |
e41d82f5 | 747 | |
726a989a RB |
748 | for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
749 | { | |
538dd0b7 | 750 | gphi *phi = gsi.phi (); |
e41d82f5 | 751 | |
726a989a RB |
752 | if (is_complex_reg (gimple_phi_result (phi))) |
753 | { | |
0c9b3294 JJ |
754 | gphi *p[2] = { NULL, NULL }; |
755 | unsigned int i, j, n; | |
756 | bool revisit_phi = false; | |
726a989a | 757 | |
0c9b3294 JJ |
758 | for (j = 0; j < 2; j++) |
759 | { | |
760 | tree l = get_component_ssa_name (gimple_phi_result (phi), j > 0); | |
761 | if (TREE_CODE (l) == SSA_NAME) | |
762 | p[j] = create_phi_node (l, bb); | |
763 | } | |
726a989a RB |
764 | |
765 | for (i = 0, n = gimple_phi_num_args (phi); i < n; ++i) | |
766 | { | |
767 | tree comp, arg = gimple_phi_arg_def (phi, i); | |
0c9b3294 JJ |
768 | for (j = 0; j < 2; j++) |
769 | if (p[j]) | |
770 | { | |
771 | comp = extract_component (NULL, arg, j > 0, false, true); | |
772 | if (TREE_CODE (comp) == SSA_NAME | |
773 | && SSA_NAME_DEF_STMT (comp) == NULL) | |
774 | { | |
775 | /* For the benefit of any gimple simplification during | |
776 | this pass that might walk SSA_NAME def stmts, | |
777 | don't add SSA_NAMEs without definitions into the | |
778 | PHI arguments, but put a decl in there instead | |
779 | temporarily, and revisit this PHI later on. */ | |
780 | if (SSA_NAME_VAR (comp)) | |
781 | comp = SSA_NAME_VAR (comp); | |
782 | else | |
783 | comp = create_tmp_reg (TREE_TYPE (comp), | |
784 | get_name (comp)); | |
785 | revisit_phi = true; | |
786 | } | |
787 | SET_PHI_ARG_DEF (p[j], i, comp); | |
788 | } | |
789 | } | |
790 | ||
791 | if (revisit_phi) | |
792 | { | |
793 | phis_to_revisit.safe_push (phi); | |
794 | phis_to_revisit.safe_push (p[0]); | |
795 | phis_to_revisit.safe_push (p[1]); | |
726a989a RB |
796 | } |
797 | } | |
798 | } | |
e41d82f5 RH |
799 | } |
800 | ||
e41d82f5 RH |
801 | /* Expand a complex move to scalars. */ |
802 | ||
803 | static void | |
726a989a | 804 | expand_complex_move (gimple_stmt_iterator *gsi, tree type) |
e41d82f5 RH |
805 | { |
806 | tree inner_type = TREE_TYPE (type); | |
726a989a | 807 | tree r, i, lhs, rhs; |
355fe088 | 808 | gimple *stmt = gsi_stmt (*gsi); |
726a989a RB |
809 | |
810 | if (is_gimple_assign (stmt)) | |
811 | { | |
812 | lhs = gimple_assign_lhs (stmt); | |
813 | if (gimple_num_ops (stmt) == 2) | |
814 | rhs = gimple_assign_rhs1 (stmt); | |
815 | else | |
816 | rhs = NULL_TREE; | |
817 | } | |
818 | else if (is_gimple_call (stmt)) | |
819 | { | |
820 | lhs = gimple_call_lhs (stmt); | |
821 | rhs = NULL_TREE; | |
822 | } | |
823 | else | |
824 | gcc_unreachable (); | |
e41d82f5 RH |
825 | |
826 | if (TREE_CODE (lhs) == SSA_NAME) | |
827 | { | |
726a989a | 828 | if (is_ctrl_altering_stmt (stmt)) |
5d6b3bba | 829 | { |
5d6b3bba RH |
830 | edge e; |
831 | ||
832 | /* The value is not assigned on the exception edges, so we need not | |
833 | concern ourselves there. We do need to update on the fallthru | |
834 | edge. Find it. */ | |
0fd4b31d NF |
835 | e = find_fallthru_edge (gsi_bb (*gsi)->succs); |
836 | if (!e) | |
837 | gcc_unreachable (); | |
5d6b3bba RH |
838 | |
839 | r = build1 (REALPART_EXPR, inner_type, lhs); | |
840 | i = build1 (IMAGPART_EXPR, inner_type, lhs); | |
95a8c155 | 841 | update_complex_components_on_edge (e, lhs, r, i); |
5d6b3bba | 842 | } |
726a989a RB |
843 | else if (is_gimple_call (stmt) |
844 | || gimple_has_side_effects (stmt) | |
845 | || gimple_assign_rhs_code (stmt) == PAREN_EXPR) | |
e41d82f5 | 846 | { |
5d6b3bba RH |
847 | r = build1 (REALPART_EXPR, inner_type, lhs); |
848 | i = build1 (IMAGPART_EXPR, inner_type, lhs); | |
726a989a | 849 | update_complex_components (gsi, stmt, r, i); |
e41d82f5 RH |
850 | } |
851 | else | |
852 | { | |
726a989a RB |
853 | if (gimple_assign_rhs_code (stmt) != COMPLEX_EXPR) |
854 | { | |
855 | r = extract_component (gsi, rhs, 0, true); | |
856 | i = extract_component (gsi, rhs, 1, true); | |
857 | } | |
858 | else | |
859 | { | |
860 | r = gimple_assign_rhs1 (stmt); | |
861 | i = gimple_assign_rhs2 (stmt); | |
862 | } | |
863 | update_complex_assignment (gsi, r, i); | |
e41d82f5 RH |
864 | } |
865 | } | |
726a989a | 866 | else if (rhs && TREE_CODE (rhs) == SSA_NAME && !TREE_SIDE_EFFECTS (lhs)) |
e41d82f5 RH |
867 | { |
868 | tree x; | |
355fe088 | 869 | gimple *t; |
e1ec47c4 | 870 | location_t loc; |
e41d82f5 | 871 | |
e1ec47c4 | 872 | loc = gimple_location (stmt); |
726a989a RB |
873 | r = extract_component (gsi, rhs, 0, false); |
874 | i = extract_component (gsi, rhs, 1, false); | |
e41d82f5 RH |
875 | |
876 | x = build1 (REALPART_EXPR, inner_type, unshare_expr (lhs)); | |
726a989a | 877 | t = gimple_build_assign (x, r); |
e1ec47c4 | 878 | gimple_set_location (t, loc); |
726a989a | 879 | gsi_insert_before (gsi, t, GSI_SAME_STMT); |
e41d82f5 | 880 | |
726a989a | 881 | if (stmt == gsi_stmt (*gsi)) |
e41d82f5 RH |
882 | { |
883 | x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs)); | |
726a989a RB |
884 | gimple_assign_set_lhs (stmt, x); |
885 | gimple_assign_set_rhs1 (stmt, i); | |
e41d82f5 RH |
886 | } |
887 | else | |
888 | { | |
889 | x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs)); | |
726a989a | 890 | t = gimple_build_assign (x, i); |
e1ec47c4 | 891 | gimple_set_location (t, loc); |
726a989a | 892 | gsi_insert_before (gsi, t, GSI_SAME_STMT); |
e41d82f5 | 893 | |
726a989a RB |
894 | stmt = gsi_stmt (*gsi); |
895 | gcc_assert (gimple_code (stmt) == GIMPLE_RETURN); | |
538dd0b7 | 896 | gimple_return_set_retval (as_a <greturn *> (stmt), lhs); |
e41d82f5 RH |
897 | } |
898 | ||
e41d82f5 RH |
899 | update_stmt (stmt); |
900 | } | |
6de9cd9a DN |
901 | } |
902 | ||
903 | /* Expand complex addition to scalars: | |
904 | a + b = (ar + br) + i(ai + bi) | |
905 | a - b = (ar - br) + i(ai + bi) | |
906 | */ | |
907 | ||
908 | static void | |
726a989a | 909 | expand_complex_addition (gimple_stmt_iterator *gsi, tree inner_type, |
6de9cd9a | 910 | tree ar, tree ai, tree br, tree bi, |
e41d82f5 RH |
911 | enum tree_code code, |
912 | complex_lattice_t al, complex_lattice_t bl) | |
6de9cd9a DN |
913 | { |
914 | tree rr, ri; | |
915 | ||
e41d82f5 RH |
916 | switch (PAIR (al, bl)) |
917 | { | |
918 | case PAIR (ONLY_REAL, ONLY_REAL): | |
726a989a | 919 | rr = gimplify_build2 (gsi, code, inner_type, ar, br); |
e41d82f5 RH |
920 | ri = ai; |
921 | break; | |
922 | ||
923 | case PAIR (ONLY_REAL, ONLY_IMAG): | |
924 | rr = ar; | |
925 | if (code == MINUS_EXPR) | |
726a989a | 926 | ri = gimplify_build2 (gsi, MINUS_EXPR, inner_type, ai, bi); |
e41d82f5 RH |
927 | else |
928 | ri = bi; | |
929 | break; | |
930 | ||
931 | case PAIR (ONLY_IMAG, ONLY_REAL): | |
932 | if (code == MINUS_EXPR) | |
726a989a | 933 | rr = gimplify_build2 (gsi, MINUS_EXPR, inner_type, ar, br); |
e41d82f5 RH |
934 | else |
935 | rr = br; | |
936 | ri = ai; | |
937 | break; | |
938 | ||
939 | case PAIR (ONLY_IMAG, ONLY_IMAG): | |
940 | rr = ar; | |
726a989a | 941 | ri = gimplify_build2 (gsi, code, inner_type, ai, bi); |
e41d82f5 RH |
942 | break; |
943 | ||
944 | case PAIR (VARYING, ONLY_REAL): | |
726a989a | 945 | rr = gimplify_build2 (gsi, code, inner_type, ar, br); |
e41d82f5 RH |
946 | ri = ai; |
947 | break; | |
948 | ||
949 | case PAIR (VARYING, ONLY_IMAG): | |
950 | rr = ar; | |
726a989a | 951 | ri = gimplify_build2 (gsi, code, inner_type, ai, bi); |
e41d82f5 RH |
952 | break; |
953 | ||
954 | case PAIR (ONLY_REAL, VARYING): | |
955 | if (code == MINUS_EXPR) | |
956 | goto general; | |
726a989a | 957 | rr = gimplify_build2 (gsi, code, inner_type, ar, br); |
e41d82f5 RH |
958 | ri = bi; |
959 | break; | |
960 | ||
961 | case PAIR (ONLY_IMAG, VARYING): | |
962 | if (code == MINUS_EXPR) | |
963 | goto general; | |
964 | rr = br; | |
726a989a | 965 | ri = gimplify_build2 (gsi, code, inner_type, ai, bi); |
e41d82f5 RH |
966 | break; |
967 | ||
968 | case PAIR (VARYING, VARYING): | |
969 | general: | |
726a989a RB |
970 | rr = gimplify_build2 (gsi, code, inner_type, ar, br); |
971 | ri = gimplify_build2 (gsi, code, inner_type, ai, bi); | |
e41d82f5 RH |
972 | break; |
973 | ||
974 | default: | |
975 | gcc_unreachable (); | |
976 | } | |
6de9cd9a | 977 | |
726a989a | 978 | update_complex_assignment (gsi, rr, ri); |
6de9cd9a DN |
979 | } |
980 | ||
7e7e470f | 981 | /* Expand a complex multiplication or division to a libcall to the c99 |
b7244ccb KT |
982 | compliant routines. TYPE is the complex type of the operation. |
983 | If INPLACE_P replace the statement at GSI with | |
984 | the libcall and return NULL_TREE. Else insert the call, assign its | |
985 | result to an output variable and return that variable. If INPLACE_P | |
986 | is true then the statement being replaced should be an assignment | |
987 | statement. */ | |
7e7e470f | 988 | |
b7244ccb KT |
989 | static tree |
990 | expand_complex_libcall (gimple_stmt_iterator *gsi, tree type, tree ar, tree ai, | |
991 | tree br, tree bi, enum tree_code code, bool inplace_p) | |
7e7e470f | 992 | { |
ef4bddc2 | 993 | machine_mode mode; |
7e7e470f | 994 | enum built_in_function bcode; |
b7244ccb | 995 | tree fn, lhs; |
538dd0b7 | 996 | gcall *stmt; |
7e7e470f | 997 | |
7e7e470f RH |
998 | mode = TYPE_MODE (type); |
999 | gcc_assert (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT); | |
726a989a | 1000 | |
7e7e470f | 1001 | if (code == MULT_EXPR) |
32e8bb8e ILT |
1002 | bcode = ((enum built_in_function) |
1003 | (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT)); | |
7e7e470f | 1004 | else if (code == RDIV_EXPR) |
32e8bb8e ILT |
1005 | bcode = ((enum built_in_function) |
1006 | (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT)); | |
7e7e470f RH |
1007 | else |
1008 | gcc_unreachable (); | |
e79983f4 | 1009 | fn = builtin_decl_explicit (bcode); |
726a989a | 1010 | stmt = gimple_build_call (fn, 4, ar, ai, br, bi); |
04be6ff5 | 1011 | |
b7244ccb | 1012 | if (inplace_p) |
e41d82f5 | 1013 | { |
b7244ccb | 1014 | gimple *old_stmt = gsi_stmt (*gsi); |
36bbc05d | 1015 | gimple_call_set_nothrow (stmt, !stmt_could_throw_p (cfun, old_stmt)); |
b7244ccb KT |
1016 | lhs = gimple_assign_lhs (old_stmt); |
1017 | gimple_call_set_lhs (stmt, lhs); | |
7d187fdf | 1018 | gsi_replace (gsi, stmt, true); |
b7244ccb | 1019 | |
d5c77941 | 1020 | type = TREE_TYPE (type); |
36bbc05d | 1021 | if (stmt_can_throw_internal (cfun, stmt)) |
7d187fdf RB |
1022 | { |
1023 | edge_iterator ei; | |
1024 | edge e; | |
1025 | FOR_EACH_EDGE (e, ei, gimple_bb (stmt)->succs) | |
1026 | if (!(e->flags & EDGE_EH)) | |
1027 | break; | |
1028 | basic_block bb = split_edge (e); | |
1029 | gimple_stmt_iterator gsi2 = gsi_start_bb (bb); | |
1030 | update_complex_components (&gsi2, stmt, | |
1031 | build1 (REALPART_EXPR, type, lhs), | |
1032 | build1 (IMAGPART_EXPR, type, lhs)); | |
1033 | return NULL_TREE; | |
1034 | } | |
1035 | else | |
1036 | update_complex_components (gsi, stmt, | |
1037 | build1 (REALPART_EXPR, type, lhs), | |
1038 | build1 (IMAGPART_EXPR, type, lhs)); | |
726a989a | 1039 | SSA_NAME_DEF_STMT (lhs) = stmt; |
b7244ccb | 1040 | return NULL_TREE; |
e41d82f5 | 1041 | } |
b7244ccb | 1042 | |
7d187fdf RB |
1043 | gimple_call_set_nothrow (stmt, true); |
1044 | lhs = make_ssa_name (type); | |
b7244ccb | 1045 | gimple_call_set_lhs (stmt, lhs); |
b7244ccb | 1046 | gsi_insert_before (gsi, stmt, GSI_SAME_STMT); |
7d187fdf | 1047 | |
b7244ccb KT |
1048 | return lhs; |
1049 | } | |
1050 | ||
1051 | /* Perform a complex multiplication on two complex constants A, B represented | |
1052 | by AR, AI, BR, BI of type TYPE. | |
1053 | The operation we want is: a * b = (ar*br - ai*bi) + i(ar*bi + br*ai). | |
1054 | Insert the GIMPLE statements into GSI. Store the real and imaginary | |
1055 | components of the result into RR and RI. */ | |
1056 | ||
1057 | static void | |
1058 | expand_complex_multiplication_components (gimple_stmt_iterator *gsi, | |
1059 | tree type, tree ar, tree ai, | |
1060 | tree br, tree bi, | |
1061 | tree *rr, tree *ri) | |
1062 | { | |
1063 | tree t1, t2, t3, t4; | |
1064 | ||
1065 | t1 = gimplify_build2 (gsi, MULT_EXPR, type, ar, br); | |
1066 | t2 = gimplify_build2 (gsi, MULT_EXPR, type, ai, bi); | |
1067 | t3 = gimplify_build2 (gsi, MULT_EXPR, type, ar, bi); | |
1068 | ||
1069 | /* Avoid expanding redundant multiplication for the common | |
1070 | case of squaring a complex number. */ | |
1071 | if (ar == br && ai == bi) | |
1072 | t4 = t3; | |
1073 | else | |
1074 | t4 = gimplify_build2 (gsi, MULT_EXPR, type, ai, br); | |
1075 | ||
1076 | *rr = gimplify_build2 (gsi, MINUS_EXPR, type, t1, t2); | |
1077 | *ri = gimplify_build2 (gsi, PLUS_EXPR, type, t3, t4); | |
7e7e470f RH |
1078 | } |
1079 | ||
6de9cd9a DN |
1080 | /* Expand complex multiplication to scalars: |
1081 | a * b = (ar*br - ai*bi) + i(ar*bi + br*ai) | |
1082 | */ | |
1083 | ||
1084 | static void | |
b7244ccb | 1085 | expand_complex_multiplication (gimple_stmt_iterator *gsi, tree type, |
e41d82f5 RH |
1086 | tree ar, tree ai, tree br, tree bi, |
1087 | complex_lattice_t al, complex_lattice_t bl) | |
6de9cd9a | 1088 | { |
e41d82f5 | 1089 | tree rr, ri; |
b7244ccb | 1090 | tree inner_type = TREE_TYPE (type); |
6de9cd9a | 1091 | |
e41d82f5 | 1092 | if (al < bl) |
7e7e470f | 1093 | { |
e41d82f5 RH |
1094 | complex_lattice_t tl; |
1095 | rr = ar, ar = br, br = rr; | |
1096 | ri = ai, ai = bi, bi = ri; | |
1097 | tl = al, al = bl, bl = tl; | |
7e7e470f RH |
1098 | } |
1099 | ||
e41d82f5 RH |
1100 | switch (PAIR (al, bl)) |
1101 | { | |
1102 | case PAIR (ONLY_REAL, ONLY_REAL): | |
726a989a | 1103 | rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br); |
e41d82f5 RH |
1104 | ri = ai; |
1105 | break; | |
6de9cd9a | 1106 | |
e41d82f5 RH |
1107 | case PAIR (ONLY_IMAG, ONLY_REAL): |
1108 | rr = ar; | |
1109 | if (TREE_CODE (ai) == REAL_CST | |
1a25c6b1 | 1110 | && real_identical (&TREE_REAL_CST (ai), &dconst1)) |
e41d82f5 RH |
1111 | ri = br; |
1112 | else | |
726a989a | 1113 | ri = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br); |
e41d82f5 | 1114 | break; |
6de9cd9a | 1115 | |
e41d82f5 | 1116 | case PAIR (ONLY_IMAG, ONLY_IMAG): |
726a989a RB |
1117 | rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi); |
1118 | rr = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, rr); | |
e41d82f5 RH |
1119 | ri = ar; |
1120 | break; | |
1121 | ||
1122 | case PAIR (VARYING, ONLY_REAL): | |
726a989a RB |
1123 | rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br); |
1124 | ri = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br); | |
e41d82f5 RH |
1125 | break; |
1126 | ||
1127 | case PAIR (VARYING, ONLY_IMAG): | |
726a989a RB |
1128 | rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi); |
1129 | rr = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, rr); | |
1130 | ri = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, bi); | |
e41d82f5 RH |
1131 | break; |
1132 | ||
1133 | case PAIR (VARYING, VARYING): | |
1134 | if (flag_complex_method == 2 && SCALAR_FLOAT_TYPE_P (inner_type)) | |
1135 | { | |
b7244ccb KT |
1136 | /* If optimizing for size or not at all just do a libcall. |
1137 | Same if there are exception-handling edges or signaling NaNs. */ | |
1138 | if (optimize == 0 || optimize_bb_for_size_p (gsi_bb (*gsi)) | |
36bbc05d | 1139 | || stmt_can_throw_internal (cfun, gsi_stmt (*gsi)) |
b7244ccb KT |
1140 | || flag_signaling_nans) |
1141 | { | |
1142 | expand_complex_libcall (gsi, type, ar, ai, br, bi, | |
1143 | MULT_EXPR, true); | |
1144 | return; | |
1145 | } | |
e41d82f5 | 1146 | |
46618376 JJ |
1147 | if (!HONOR_NANS (inner_type)) |
1148 | { | |
1149 | /* If we are not worrying about NaNs expand to | |
1150 | (ar*br - ai*bi) + i(ar*bi + br*ai) directly. */ | |
1151 | expand_complex_multiplication_components (gsi, inner_type, | |
1152 | ar, ai, br, bi, | |
1153 | &rr, &ri); | |
1154 | break; | |
1155 | } | |
1156 | ||
b7244ccb KT |
1157 | /* Else, expand x = a * b into |
1158 | x = (ar*br - ai*bi) + i(ar*bi + br*ai); | |
1159 | if (isunordered (__real__ x, __imag__ x)) | |
1160 | x = __muldc3 (a, b); */ | |
1161 | ||
1162 | tree tmpr, tmpi; | |
1163 | expand_complex_multiplication_components (gsi, inner_type, ar, ai, | |
46618376 | 1164 | br, bi, &tmpr, &tmpi); |
b7244ccb KT |
1165 | |
1166 | gimple *check | |
1167 | = gimple_build_cond (UNORDERED_EXPR, tmpr, tmpi, | |
1168 | NULL_TREE, NULL_TREE); | |
1169 | ||
1170 | basic_block orig_bb = gsi_bb (*gsi); | |
1171 | /* We want to keep track of the original complex multiplication | |
1172 | statement as we're going to modify it later in | |
1173 | update_complex_assignment. Make sure that insert_cond_bb leaves | |
1174 | that statement in the join block. */ | |
1175 | gsi_prev (gsi); | |
1176 | basic_block cond_bb | |
1177 | = insert_cond_bb (gsi_bb (*gsi), gsi_stmt (*gsi), check, | |
1178 | profile_probability::very_unlikely ()); | |
1179 | ||
b7244ccb KT |
1180 | gimple_stmt_iterator cond_bb_gsi = gsi_last_bb (cond_bb); |
1181 | gsi_insert_after (&cond_bb_gsi, gimple_build_nop (), GSI_NEW_STMT); | |
1182 | ||
1183 | tree libcall_res | |
1184 | = expand_complex_libcall (&cond_bb_gsi, type, ar, ai, br, | |
46618376 | 1185 | bi, MULT_EXPR, false); |
b7244ccb KT |
1186 | tree cond_real = gimplify_build1 (&cond_bb_gsi, REALPART_EXPR, |
1187 | inner_type, libcall_res); | |
1188 | tree cond_imag = gimplify_build1 (&cond_bb_gsi, IMAGPART_EXPR, | |
1189 | inner_type, libcall_res); | |
1190 | ||
1191 | basic_block join_bb = single_succ_edge (cond_bb)->dest; | |
1192 | *gsi = gsi_start_nondebug_after_labels_bb (join_bb); | |
1193 | ||
1194 | /* We have a conditional block with some assignments in cond_bb. | |
1195 | Wire up the PHIs to wrap up. */ | |
1196 | rr = make_ssa_name (inner_type); | |
1197 | ri = make_ssa_name (inner_type); | |
1198 | edge cond_to_join = single_succ_edge (cond_bb); | |
1199 | edge orig_to_join = find_edge (orig_bb, join_bb); | |
1200 | ||
1201 | gphi *real_phi = create_phi_node (rr, gsi_bb (*gsi)); | |
46618376 | 1202 | add_phi_arg (real_phi, cond_real, cond_to_join, UNKNOWN_LOCATION); |
b7244ccb KT |
1203 | add_phi_arg (real_phi, tmpr, orig_to_join, UNKNOWN_LOCATION); |
1204 | ||
1205 | gphi *imag_phi = create_phi_node (ri, gsi_bb (*gsi)); | |
46618376 | 1206 | add_phi_arg (imag_phi, cond_imag, cond_to_join, UNKNOWN_LOCATION); |
b7244ccb | 1207 | add_phi_arg (imag_phi, tmpi, orig_to_join, UNKNOWN_LOCATION); |
e41d82f5 | 1208 | } |
b7244ccb KT |
1209 | else |
1210 | /* If we are not worrying about NaNs expand to | |
1211 | (ar*br - ai*bi) + i(ar*bi + br*ai) directly. */ | |
1212 | expand_complex_multiplication_components (gsi, inner_type, ar, ai, | |
46618376 | 1213 | br, bi, &rr, &ri); |
e41d82f5 RH |
1214 | break; |
1215 | ||
1216 | default: | |
1217 | gcc_unreachable (); | |
1218 | } | |
6de9cd9a | 1219 | |
726a989a | 1220 | update_complex_assignment (gsi, rr, ri); |
6de9cd9a DN |
1221 | } |
1222 | ||
e3d5405d | 1223 | /* Keep this algorithm in sync with fold-const.c:const_binop(). |
b8698a0f | 1224 | |
e3d5405d | 1225 | Expand complex division to scalars, straightforward algorithm. |
6de9cd9a DN |
1226 | a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t) |
1227 | t = br*br + bi*bi | |
1228 | */ | |
1229 | ||
1230 | static void | |
726a989a | 1231 | expand_complex_div_straight (gimple_stmt_iterator *gsi, tree inner_type, |
6de9cd9a DN |
1232 | tree ar, tree ai, tree br, tree bi, |
1233 | enum tree_code code) | |
1234 | { | |
1235 | tree rr, ri, div, t1, t2, t3; | |
1236 | ||
726a989a RB |
1237 | t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, br, br); |
1238 | t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, bi, bi); | |
1239 | div = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, t2); | |
6de9cd9a | 1240 | |
726a989a RB |
1241 | t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br); |
1242 | t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi); | |
1243 | t3 = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, t2); | |
1244 | rr = gimplify_build2 (gsi, code, inner_type, t3, div); | |
6de9cd9a | 1245 | |
726a989a RB |
1246 | t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br); |
1247 | t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, bi); | |
1248 | t3 = gimplify_build2 (gsi, MINUS_EXPR, inner_type, t1, t2); | |
1249 | ri = gimplify_build2 (gsi, code, inner_type, t3, div); | |
6de9cd9a | 1250 | |
726a989a | 1251 | update_complex_assignment (gsi, rr, ri); |
6de9cd9a DN |
1252 | } |
1253 | ||
e3d5405d KG |
1254 | /* Keep this algorithm in sync with fold-const.c:const_binop(). |
1255 | ||
1256 | Expand complex division to scalars, modified algorithm to minimize | |
6de9cd9a DN |
1257 | overflow with wide input ranges. */ |
1258 | ||
1259 | static void | |
726a989a | 1260 | expand_complex_div_wide (gimple_stmt_iterator *gsi, tree inner_type, |
6de9cd9a DN |
1261 | tree ar, tree ai, tree br, tree bi, |
1262 | enum tree_code code) | |
1263 | { | |
04b03edb | 1264 | tree rr, ri, ratio, div, t1, t2, tr, ti, compare; |
c63f5a42 | 1265 | basic_block bb_cond, bb_true, bb_false, bb_join; |
355fe088 | 1266 | gimple *stmt; |
6de9cd9a DN |
1267 | |
1268 | /* Examine |br| < |bi|, and branch. */ | |
726a989a RB |
1269 | t1 = gimplify_build1 (gsi, ABS_EXPR, inner_type, br); |
1270 | t2 = gimplify_build1 (gsi, ABS_EXPR, inner_type, bi); | |
db3927fb | 1271 | compare = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), |
b57d8e6f | 1272 | LT_EXPR, boolean_type_node, t1, t2); |
04b03edb | 1273 | STRIP_NOPS (compare); |
6de9cd9a | 1274 | |
c63f5a42 RH |
1275 | bb_cond = bb_true = bb_false = bb_join = NULL; |
1276 | rr = ri = tr = ti = NULL; | |
b57d8e6f | 1277 | if (TREE_CODE (compare) != INTEGER_CST) |
6de9cd9a | 1278 | { |
6de9cd9a | 1279 | edge e; |
355fe088 | 1280 | gimple *stmt; |
04b03edb | 1281 | tree cond, tmp; |
6de9cd9a | 1282 | |
7d187fdf | 1283 | tmp = make_ssa_name (boolean_type_node); |
726a989a | 1284 | stmt = gimple_build_assign (tmp, compare); |
726a989a | 1285 | gsi_insert_before (gsi, stmt, GSI_SAME_STMT); |
04b03edb | 1286 | |
db3927fb AH |
1287 | cond = fold_build2_loc (gimple_location (stmt), |
1288 | EQ_EXPR, boolean_type_node, tmp, boolean_true_node); | |
726a989a RB |
1289 | stmt = gimple_build_cond_from_tree (cond, NULL_TREE, NULL_TREE); |
1290 | gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
6de9cd9a | 1291 | |
6de9cd9a | 1292 | /* Split the original block, and create the TRUE and FALSE blocks. */ |
726a989a | 1293 | e = split_block (gsi_bb (*gsi), stmt); |
6de9cd9a DN |
1294 | bb_cond = e->src; |
1295 | bb_join = e->dest; | |
1296 | bb_true = create_empty_bb (bb_cond); | |
1297 | bb_false = create_empty_bb (bb_true); | |
b543d680 JH |
1298 | bb_true->count = bb_false->count |
1299 | = bb_cond->count.apply_probability (profile_probability::even ()); | |
6de9cd9a DN |
1300 | |
1301 | /* Wire the blocks together. */ | |
1302 | e->flags = EDGE_TRUE_VALUE; | |
b543d680 JH |
1303 | /* TODO: With value profile we could add an historgram to determine real |
1304 | branch outcome. */ | |
1305 | e->probability = profile_probability::even (); | |
6de9cd9a | 1306 | redirect_edge_succ (e, bb_true); |
b543d680 | 1307 | edge e2 = make_edge (bb_cond, bb_false, EDGE_FALSE_VALUE); |
b543d680 JH |
1308 | e2->probability = profile_probability::even (); |
1309 | make_single_succ_edge (bb_true, bb_join, EDGE_FALLTHRU); | |
1310 | make_single_succ_edge (bb_false, bb_join, EDGE_FALLTHRU); | |
726338f4 RB |
1311 | add_bb_to_loop (bb_true, bb_cond->loop_father); |
1312 | add_bb_to_loop (bb_false, bb_cond->loop_father); | |
6de9cd9a DN |
1313 | |
1314 | /* Update dominance info. Note that bb_join's data was | |
1315 | updated by split_block. */ | |
fce22de5 | 1316 | if (dom_info_available_p (CDI_DOMINATORS)) |
6de9cd9a DN |
1317 | { |
1318 | set_immediate_dominator (CDI_DOMINATORS, bb_true, bb_cond); | |
1319 | set_immediate_dominator (CDI_DOMINATORS, bb_false, bb_cond); | |
1320 | } | |
1321 | ||
b731b390 JJ |
1322 | rr = create_tmp_reg (inner_type); |
1323 | ri = create_tmp_reg (inner_type); | |
6de9cd9a | 1324 | } |
c63f5a42 RH |
1325 | |
1326 | /* In the TRUE branch, we compute | |
1327 | ratio = br/bi; | |
1328 | div = (br * ratio) + bi; | |
1329 | tr = (ar * ratio) + ai; | |
1330 | ti = (ai * ratio) - ar; | |
1331 | tr = tr / div; | |
1332 | ti = ti / div; */ | |
04b03edb | 1333 | if (bb_true || integer_nonzerop (compare)) |
c63f5a42 RH |
1334 | { |
1335 | if (bb_true) | |
1336 | { | |
726a989a RB |
1337 | *gsi = gsi_last_bb (bb_true); |
1338 | gsi_insert_after (gsi, gimple_build_nop (), GSI_NEW_STMT); | |
c63f5a42 RH |
1339 | } |
1340 | ||
726a989a | 1341 | ratio = gimplify_build2 (gsi, code, inner_type, br, bi); |
c63f5a42 | 1342 | |
726a989a RB |
1343 | t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, br, ratio); |
1344 | div = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, bi); | |
c63f5a42 | 1345 | |
726a989a RB |
1346 | t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, ratio); |
1347 | tr = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, ai); | |
c63f5a42 | 1348 | |
726a989a RB |
1349 | t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, ratio); |
1350 | ti = gimplify_build2 (gsi, MINUS_EXPR, inner_type, t1, ar); | |
c63f5a42 | 1351 | |
726a989a RB |
1352 | tr = gimplify_build2 (gsi, code, inner_type, tr, div); |
1353 | ti = gimplify_build2 (gsi, code, inner_type, ti, div); | |
c63f5a42 RH |
1354 | |
1355 | if (bb_true) | |
1356 | { | |
726a989a RB |
1357 | stmt = gimple_build_assign (rr, tr); |
1358 | gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
1359 | stmt = gimple_build_assign (ri, ti); | |
1360 | gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
1361 | gsi_remove (gsi, true); | |
c63f5a42 RH |
1362 | } |
1363 | } | |
1364 | ||
1365 | /* In the FALSE branch, we compute | |
1366 | ratio = d/c; | |
1367 | divisor = (d * ratio) + c; | |
1368 | tr = (b * ratio) + a; | |
1369 | ti = b - (a * ratio); | |
1370 | tr = tr / div; | |
1371 | ti = ti / div; */ | |
04b03edb | 1372 | if (bb_false || integer_zerop (compare)) |
c63f5a42 RH |
1373 | { |
1374 | if (bb_false) | |
1375 | { | |
726a989a RB |
1376 | *gsi = gsi_last_bb (bb_false); |
1377 | gsi_insert_after (gsi, gimple_build_nop (), GSI_NEW_STMT); | |
c63f5a42 RH |
1378 | } |
1379 | ||
726a989a | 1380 | ratio = gimplify_build2 (gsi, code, inner_type, bi, br); |
c63f5a42 | 1381 | |
726a989a RB |
1382 | t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, bi, ratio); |
1383 | div = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, br); | |
c63f5a42 | 1384 | |
726a989a RB |
1385 | t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, ratio); |
1386 | tr = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, ar); | |
c63f5a42 | 1387 | |
726a989a RB |
1388 | t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, ratio); |
1389 | ti = gimplify_build2 (gsi, MINUS_EXPR, inner_type, ai, t1); | |
c63f5a42 | 1390 | |
726a989a RB |
1391 | tr = gimplify_build2 (gsi, code, inner_type, tr, div); |
1392 | ti = gimplify_build2 (gsi, code, inner_type, ti, div); | |
c63f5a42 RH |
1393 | |
1394 | if (bb_false) | |
1395 | { | |
726a989a RB |
1396 | stmt = gimple_build_assign (rr, tr); |
1397 | gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
1398 | stmt = gimple_build_assign (ri, ti); | |
1399 | gsi_insert_before (gsi, stmt, GSI_SAME_STMT); | |
1400 | gsi_remove (gsi, true); | |
c63f5a42 RH |
1401 | } |
1402 | } | |
1403 | ||
1404 | if (bb_join) | |
726a989a | 1405 | *gsi = gsi_start_bb (bb_join); |
c63f5a42 RH |
1406 | else |
1407 | rr = tr, ri = ti; | |
6de9cd9a | 1408 | |
726a989a | 1409 | update_complex_assignment (gsi, rr, ri); |
6de9cd9a DN |
1410 | } |
1411 | ||
1412 | /* Expand complex division to scalars. */ | |
1413 | ||
1414 | static void | |
b7244ccb | 1415 | expand_complex_division (gimple_stmt_iterator *gsi, tree type, |
6de9cd9a | 1416 | tree ar, tree ai, tree br, tree bi, |
e41d82f5 RH |
1417 | enum tree_code code, |
1418 | complex_lattice_t al, complex_lattice_t bl) | |
6de9cd9a | 1419 | { |
e41d82f5 RH |
1420 | tree rr, ri; |
1421 | ||
b7244ccb | 1422 | tree inner_type = TREE_TYPE (type); |
e41d82f5 | 1423 | switch (PAIR (al, bl)) |
6de9cd9a | 1424 | { |
e41d82f5 | 1425 | case PAIR (ONLY_REAL, ONLY_REAL): |
726a989a | 1426 | rr = gimplify_build2 (gsi, code, inner_type, ar, br); |
e41d82f5 | 1427 | ri = ai; |
6de9cd9a | 1428 | break; |
7e7e470f | 1429 | |
e41d82f5 RH |
1430 | case PAIR (ONLY_REAL, ONLY_IMAG): |
1431 | rr = ai; | |
726a989a RB |
1432 | ri = gimplify_build2 (gsi, code, inner_type, ar, bi); |
1433 | ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ri); | |
e41d82f5 RH |
1434 | break; |
1435 | ||
1436 | case PAIR (ONLY_IMAG, ONLY_REAL): | |
1437 | rr = ar; | |
726a989a | 1438 | ri = gimplify_build2 (gsi, code, inner_type, ai, br); |
e41d82f5 | 1439 | break; |
7e7e470f | 1440 | |
e41d82f5 | 1441 | case PAIR (ONLY_IMAG, ONLY_IMAG): |
726a989a | 1442 | rr = gimplify_build2 (gsi, code, inner_type, ai, bi); |
e41d82f5 | 1443 | ri = ar; |
6de9cd9a | 1444 | break; |
7e7e470f | 1445 | |
e41d82f5 | 1446 | case PAIR (VARYING, ONLY_REAL): |
726a989a RB |
1447 | rr = gimplify_build2 (gsi, code, inner_type, ar, br); |
1448 | ri = gimplify_build2 (gsi, code, inner_type, ai, br); | |
e41d82f5 RH |
1449 | break; |
1450 | ||
1451 | case PAIR (VARYING, ONLY_IMAG): | |
726a989a RB |
1452 | rr = gimplify_build2 (gsi, code, inner_type, ai, bi); |
1453 | ri = gimplify_build2 (gsi, code, inner_type, ar, bi); | |
1454 | ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ri); | |
0c44e080 | 1455 | break; |
e41d82f5 RH |
1456 | |
1457 | case PAIR (ONLY_REAL, VARYING): | |
1458 | case PAIR (ONLY_IMAG, VARYING): | |
1459 | case PAIR (VARYING, VARYING): | |
1460 | switch (flag_complex_method) | |
1461 | { | |
1462 | case 0: | |
1463 | /* straightforward implementation of complex divide acceptable. */ | |
726a989a | 1464 | expand_complex_div_straight (gsi, inner_type, ar, ai, br, bi, code); |
e41d82f5 RH |
1465 | break; |
1466 | ||
1467 | case 2: | |
1468 | if (SCALAR_FLOAT_TYPE_P (inner_type)) | |
1469 | { | |
b7244ccb | 1470 | expand_complex_libcall (gsi, type, ar, ai, br, bi, code, true); |
e41d82f5 RH |
1471 | break; |
1472 | } | |
1473 | /* FALLTHRU */ | |
1474 | ||
1475 | case 1: | |
1476 | /* wide ranges of inputs must work for complex divide. */ | |
726a989a | 1477 | expand_complex_div_wide (gsi, inner_type, ar, ai, br, bi, code); |
e41d82f5 RH |
1478 | break; |
1479 | ||
1480 | default: | |
1481 | gcc_unreachable (); | |
1482 | } | |
1483 | return; | |
1484 | ||
6de9cd9a | 1485 | default: |
1e128c5f | 1486 | gcc_unreachable (); |
6de9cd9a | 1487 | } |
e41d82f5 | 1488 | |
726a989a | 1489 | update_complex_assignment (gsi, rr, ri); |
6de9cd9a DN |
1490 | } |
1491 | ||
1492 | /* Expand complex negation to scalars: | |
1493 | -a = (-ar) + i(-ai) | |
1494 | */ | |
1495 | ||
1496 | static void | |
726a989a | 1497 | expand_complex_negation (gimple_stmt_iterator *gsi, tree inner_type, |
6de9cd9a DN |
1498 | tree ar, tree ai) |
1499 | { | |
1500 | tree rr, ri; | |
1501 | ||
726a989a RB |
1502 | rr = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ar); |
1503 | ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ai); | |
6de9cd9a | 1504 | |
726a989a | 1505 | update_complex_assignment (gsi, rr, ri); |
6de9cd9a DN |
1506 | } |
1507 | ||
1508 | /* Expand complex conjugate to scalars: | |
1509 | ~a = (ar) + i(-ai) | |
1510 | */ | |
1511 | ||
1512 | static void | |
726a989a | 1513 | expand_complex_conjugate (gimple_stmt_iterator *gsi, tree inner_type, |
6de9cd9a DN |
1514 | tree ar, tree ai) |
1515 | { | |
1516 | tree ri; | |
1517 | ||
726a989a | 1518 | ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ai); |
6de9cd9a | 1519 | |
726a989a | 1520 | update_complex_assignment (gsi, ar, ri); |
6de9cd9a DN |
1521 | } |
1522 | ||
1523 | /* Expand complex comparison (EQ or NE only). */ | |
1524 | ||
1525 | static void | |
726a989a | 1526 | expand_complex_comparison (gimple_stmt_iterator *gsi, tree ar, tree ai, |
6de9cd9a DN |
1527 | tree br, tree bi, enum tree_code code) |
1528 | { | |
726a989a | 1529 | tree cr, ci, cc, type; |
355fe088 | 1530 | gimple *stmt; |
6de9cd9a | 1531 | |
726a989a RB |
1532 | cr = gimplify_build2 (gsi, code, boolean_type_node, ar, br); |
1533 | ci = gimplify_build2 (gsi, code, boolean_type_node, ai, bi); | |
1534 | cc = gimplify_build2 (gsi, | |
26277d41 PB |
1535 | (code == EQ_EXPR ? TRUTH_AND_EXPR : TRUTH_OR_EXPR), |
1536 | boolean_type_node, cr, ci); | |
6de9cd9a | 1537 | |
726a989a | 1538 | stmt = gsi_stmt (*gsi); |
6de9cd9a | 1539 | |
726a989a | 1540 | switch (gimple_code (stmt)) |
6de9cd9a | 1541 | { |
726a989a | 1542 | case GIMPLE_RETURN: |
538dd0b7 DM |
1543 | { |
1544 | greturn *return_stmt = as_a <greturn *> (stmt); | |
1545 | type = TREE_TYPE (gimple_return_retval (return_stmt)); | |
1546 | gimple_return_set_retval (return_stmt, fold_convert (type, cc)); | |
1547 | } | |
6de9cd9a | 1548 | break; |
726a989a RB |
1549 | |
1550 | case GIMPLE_ASSIGN: | |
1551 | type = TREE_TYPE (gimple_assign_lhs (stmt)); | |
1552 | gimple_assign_set_rhs_from_tree (gsi, fold_convert (type, cc)); | |
1553 | stmt = gsi_stmt (*gsi); | |
6de9cd9a | 1554 | break; |
726a989a RB |
1555 | |
1556 | case GIMPLE_COND: | |
538dd0b7 DM |
1557 | { |
1558 | gcond *cond_stmt = as_a <gcond *> (stmt); | |
1559 | gimple_cond_set_code (cond_stmt, EQ_EXPR); | |
1560 | gimple_cond_set_lhs (cond_stmt, cc); | |
1561 | gimple_cond_set_rhs (cond_stmt, boolean_true_node); | |
1562 | } | |
726a989a RB |
1563 | break; |
1564 | ||
6de9cd9a | 1565 | default: |
1e128c5f | 1566 | gcc_unreachable (); |
6de9cd9a | 1567 | } |
68b9f53b | 1568 | |
e41d82f5 | 1569 | update_stmt (stmt); |
fd5c4c4c | 1570 | if (maybe_clean_eh_stmt (stmt)) |
bca7138a | 1571 | bitmap_set_bit (need_eh_cleanup, gimple_bb (stmt)->index); |
6de9cd9a DN |
1572 | } |
1573 | ||
a57fc743 JJ |
1574 | /* Expand inline asm that sets some complex SSA_NAMEs. */ |
1575 | ||
1576 | static void | |
1577 | expand_complex_asm (gimple_stmt_iterator *gsi) | |
1578 | { | |
538dd0b7 | 1579 | gasm *stmt = as_a <gasm *> (gsi_stmt (*gsi)); |
a57fc743 JJ |
1580 | unsigned int i; |
1581 | ||
1582 | for (i = 0; i < gimple_asm_noutputs (stmt); ++i) | |
1583 | { | |
1584 | tree link = gimple_asm_output_op (stmt, i); | |
1585 | tree op = TREE_VALUE (link); | |
1586 | if (TREE_CODE (op) == SSA_NAME | |
1587 | && TREE_CODE (TREE_TYPE (op)) == COMPLEX_TYPE) | |
1588 | { | |
1589 | tree type = TREE_TYPE (op); | |
1590 | tree inner_type = TREE_TYPE (type); | |
1591 | tree r = build1 (REALPART_EXPR, inner_type, op); | |
1592 | tree i = build1 (IMAGPART_EXPR, inner_type, op); | |
1593 | gimple_seq list = set_component_ssa_name (op, false, r); | |
1594 | ||
1595 | if (list) | |
1596 | gsi_insert_seq_after (gsi, list, GSI_CONTINUE_LINKING); | |
1597 | ||
1598 | list = set_component_ssa_name (op, true, i); | |
1599 | if (list) | |
1600 | gsi_insert_seq_after (gsi, list, GSI_CONTINUE_LINKING); | |
1601 | } | |
1602 | } | |
1603 | } | |
726a989a | 1604 | |
6de9cd9a DN |
1605 | /* Process one statement. If we identify a complex operation, expand it. */ |
1606 | ||
1607 | static void | |
726a989a | 1608 | expand_complex_operations_1 (gimple_stmt_iterator *gsi) |
6de9cd9a | 1609 | { |
355fe088 | 1610 | gimple *stmt = gsi_stmt (*gsi); |
726a989a | 1611 | tree type, inner_type, lhs; |
6de9cd9a | 1612 | tree ac, ar, ai, bc, br, bi; |
e41d82f5 | 1613 | complex_lattice_t al, bl; |
6de9cd9a DN |
1614 | enum tree_code code; |
1615 | ||
a57fc743 JJ |
1616 | if (gimple_code (stmt) == GIMPLE_ASM) |
1617 | { | |
1618 | expand_complex_asm (gsi); | |
1619 | return; | |
1620 | } | |
1621 | ||
726a989a RB |
1622 | lhs = gimple_get_lhs (stmt); |
1623 | if (!lhs && gimple_code (stmt) != GIMPLE_COND) | |
1624 | return; | |
6de9cd9a | 1625 | |
726a989a RB |
1626 | type = TREE_TYPE (gimple_op (stmt, 0)); |
1627 | code = gimple_expr_code (stmt); | |
6de9cd9a DN |
1628 | |
1629 | /* Initial filter for operations we handle. */ | |
1630 | switch (code) | |
1631 | { | |
1632 | case PLUS_EXPR: | |
1633 | case MINUS_EXPR: | |
1634 | case MULT_EXPR: | |
1635 | case TRUNC_DIV_EXPR: | |
1636 | case CEIL_DIV_EXPR: | |
1637 | case FLOOR_DIV_EXPR: | |
1638 | case ROUND_DIV_EXPR: | |
1639 | case RDIV_EXPR: | |
1640 | case NEGATE_EXPR: | |
1641 | case CONJ_EXPR: | |
1642 | if (TREE_CODE (type) != COMPLEX_TYPE) | |
1643 | return; | |
1644 | inner_type = TREE_TYPE (type); | |
1645 | break; | |
1646 | ||
1647 | case EQ_EXPR: | |
1648 | case NE_EXPR: | |
726a989a | 1649 | /* Note, both GIMPLE_ASSIGN and GIMPLE_COND may have an EQ_EXPR |
207156e4 | 1650 | subcode, so we need to access the operands using gimple_op. */ |
726a989a | 1651 | inner_type = TREE_TYPE (gimple_op (stmt, 1)); |
6de9cd9a DN |
1652 | if (TREE_CODE (inner_type) != COMPLEX_TYPE) |
1653 | return; | |
1654 | break; | |
1655 | ||
1656 | default: | |
e41d82f5 | 1657 | { |
726a989a | 1658 | tree rhs; |
a9b77cd1 | 1659 | |
726a989a RB |
1660 | /* GIMPLE_COND may also fallthru here, but we do not need to |
1661 | do anything with it. */ | |
1662 | if (gimple_code (stmt) == GIMPLE_COND) | |
a9b77cd1 ZD |
1663 | return; |
1664 | ||
e41d82f5 | 1665 | if (TREE_CODE (type) == COMPLEX_TYPE) |
726a989a RB |
1666 | expand_complex_move (gsi, type); |
1667 | else if (is_gimple_assign (stmt) | |
1668 | && (gimple_assign_rhs_code (stmt) == REALPART_EXPR | |
1669 | || gimple_assign_rhs_code (stmt) == IMAGPART_EXPR) | |
1670 | && TREE_CODE (lhs) == SSA_NAME) | |
e41d82f5 | 1671 | { |
726a989a RB |
1672 | rhs = gimple_assign_rhs1 (stmt); |
1673 | rhs = extract_component (gsi, TREE_OPERAND (rhs, 0), | |
1674 | gimple_assign_rhs_code (stmt) | |
1675 | == IMAGPART_EXPR, | |
1676 | false); | |
1677 | gimple_assign_set_rhs_from_tree (gsi, rhs); | |
1678 | stmt = gsi_stmt (*gsi); | |
e41d82f5 RH |
1679 | update_stmt (stmt); |
1680 | } | |
1681 | } | |
6de9cd9a DN |
1682 | return; |
1683 | } | |
1684 | ||
1685 | /* Extract the components of the two complex values. Make sure and | |
1686 | handle the common case of the same value used twice specially. */ | |
726a989a RB |
1687 | if (is_gimple_assign (stmt)) |
1688 | { | |
1689 | ac = gimple_assign_rhs1 (stmt); | |
1690 | bc = (gimple_num_ops (stmt) > 2) ? gimple_assign_rhs2 (stmt) : NULL; | |
1691 | } | |
67914693 | 1692 | /* GIMPLE_CALL cannot get here. */ |
6de9cd9a DN |
1693 | else |
1694 | { | |
726a989a RB |
1695 | ac = gimple_cond_lhs (stmt); |
1696 | bc = gimple_cond_rhs (stmt); | |
1697 | } | |
1698 | ||
1699 | ar = extract_component (gsi, ac, false, true); | |
1700 | ai = extract_component (gsi, ac, true, true); | |
1701 | ||
1702 | if (ac == bc) | |
1703 | br = ar, bi = ai; | |
1704 | else if (bc) | |
1705 | { | |
1706 | br = extract_component (gsi, bc, 0, true); | |
1707 | bi = extract_component (gsi, bc, 1, true); | |
6de9cd9a | 1708 | } |
726a989a RB |
1709 | else |
1710 | br = bi = NULL_TREE; | |
6de9cd9a | 1711 | |
7d187fdf RB |
1712 | al = find_lattice_value (ac); |
1713 | if (al == UNINITIALIZED) | |
1714 | al = VARYING; | |
1715 | ||
1716 | if (TREE_CODE_CLASS (code) == tcc_unary) | |
1717 | bl = UNINITIALIZED; | |
1718 | else if (ac == bc) | |
1719 | bl = al; | |
1720 | else | |
e41d82f5 | 1721 | { |
7d187fdf RB |
1722 | bl = find_lattice_value (bc); |
1723 | if (bl == UNINITIALIZED) | |
1724 | bl = VARYING; | |
e41d82f5 | 1725 | } |
e41d82f5 | 1726 | |
6de9cd9a DN |
1727 | switch (code) |
1728 | { | |
1729 | case PLUS_EXPR: | |
1730 | case MINUS_EXPR: | |
726a989a | 1731 | expand_complex_addition (gsi, inner_type, ar, ai, br, bi, code, al, bl); |
6de9cd9a DN |
1732 | break; |
1733 | ||
1734 | case MULT_EXPR: | |
b7244ccb | 1735 | expand_complex_multiplication (gsi, type, ar, ai, br, bi, al, bl); |
6de9cd9a DN |
1736 | break; |
1737 | ||
1738 | case TRUNC_DIV_EXPR: | |
1739 | case CEIL_DIV_EXPR: | |
1740 | case FLOOR_DIV_EXPR: | |
1741 | case ROUND_DIV_EXPR: | |
1742 | case RDIV_EXPR: | |
b7244ccb | 1743 | expand_complex_division (gsi, type, ar, ai, br, bi, code, al, bl); |
6de9cd9a | 1744 | break; |
b8698a0f | 1745 | |
6de9cd9a | 1746 | case NEGATE_EXPR: |
726a989a | 1747 | expand_complex_negation (gsi, inner_type, ar, ai); |
6de9cd9a DN |
1748 | break; |
1749 | ||
1750 | case CONJ_EXPR: | |
726a989a | 1751 | expand_complex_conjugate (gsi, inner_type, ar, ai); |
6de9cd9a DN |
1752 | break; |
1753 | ||
1754 | case EQ_EXPR: | |
1755 | case NE_EXPR: | |
726a989a | 1756 | expand_complex_comparison (gsi, ar, ai, br, bi, code); |
6de9cd9a DN |
1757 | break; |
1758 | ||
1759 | default: | |
1e128c5f | 1760 | gcc_unreachable (); |
6de9cd9a DN |
1761 | } |
1762 | } | |
26277d41 | 1763 | |
e41d82f5 RH |
1764 | \f |
1765 | /* Entry point for complex operation lowering during optimization. */ | |
1766 | ||
c2924966 | 1767 | static unsigned int |
2b725155 | 1768 | tree_lower_complex (void) |
6de9cd9a | 1769 | { |
726a989a | 1770 | gimple_stmt_iterator gsi; |
6de9cd9a | 1771 | basic_block bb; |
0c9b3294 JJ |
1772 | int n_bbs, i; |
1773 | int *rpo; | |
6de9cd9a | 1774 | |
e41d82f5 | 1775 | if (!init_dont_simulate_again ()) |
c2924966 | 1776 | return 0; |
e41d82f5 | 1777 | |
9771b263 | 1778 | complex_lattice_values.create (num_ssa_names); |
cb3874dc | 1779 | complex_lattice_values.safe_grow_cleared (num_ssa_names, true); |
e41d82f5 | 1780 | |
95a8c155 | 1781 | init_parameter_lattice_values (); |
d9a3704a JL |
1782 | class complex_propagate complex_propagate; |
1783 | complex_propagate.ssa_propagate (); | |
e41d82f5 | 1784 | |
bca7138a RB |
1785 | need_eh_cleanup = BITMAP_ALLOC (NULL); |
1786 | ||
c203e8a7 | 1787 | complex_variable_components = new int_tree_htab_type (10); |
95a8c155 | 1788 | |
9771b263 | 1789 | complex_ssa_name_components.create (2 * num_ssa_names); |
cb3874dc | 1790 | complex_ssa_name_components.safe_grow_cleared (2 * num_ssa_names, true); |
95a8c155 | 1791 | |
e41d82f5 RH |
1792 | update_parameter_components (); |
1793 | ||
0c9b3294 JJ |
1794 | rpo = XNEWVEC (int, last_basic_block_for_fn (cfun)); |
1795 | n_bbs = pre_and_rev_post_order_compute (NULL, rpo, false); | |
1796 | for (i = 0; i < n_bbs; i++) | |
6de9cd9a | 1797 | { |
0c9b3294 | 1798 | bb = BASIC_BLOCK_FOR_FN (cfun, rpo[i]); |
7d187fdf RB |
1799 | if (!bb) |
1800 | continue; | |
e41d82f5 | 1801 | update_phi_components (bb); |
726a989a RB |
1802 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
1803 | expand_complex_operations_1 (&gsi); | |
6de9cd9a | 1804 | } |
6de9cd9a | 1805 | |
0c9b3294 JJ |
1806 | free (rpo); |
1807 | ||
1808 | if (!phis_to_revisit.is_empty ()) | |
1809 | { | |
1810 | unsigned int n = phis_to_revisit.length (); | |
1811 | for (unsigned int j = 0; j < n; j += 3) | |
1812 | for (unsigned int k = 0; k < 2; k++) | |
1813 | if (gphi *phi = phis_to_revisit[j + k + 1]) | |
1814 | { | |
1815 | unsigned int m = gimple_phi_num_args (phi); | |
1816 | for (unsigned int l = 0; l < m; ++l) | |
1817 | { | |
1818 | tree op = gimple_phi_arg_def (phi, l); | |
1819 | if (TREE_CODE (op) == SSA_NAME | |
1820 | || is_gimple_min_invariant (op)) | |
1821 | continue; | |
1822 | tree arg = gimple_phi_arg_def (phis_to_revisit[j], l); | |
1823 | op = extract_component (NULL, arg, k > 0, false, false); | |
1824 | SET_PHI_ARG_DEF (phi, l, op); | |
1825 | } | |
1826 | } | |
1827 | phis_to_revisit.release (); | |
1828 | } | |
1829 | ||
726a989a | 1830 | gsi_commit_edge_inserts (); |
e41d82f5 | 1831 | |
bca7138a RB |
1832 | unsigned todo |
1833 | = gimple_purge_all_dead_eh_edges (need_eh_cleanup) ? TODO_cleanup_cfg : 0; | |
1834 | BITMAP_FREE (need_eh_cleanup); | |
1835 | ||
c203e8a7 TS |
1836 | delete complex_variable_components; |
1837 | complex_variable_components = NULL; | |
9771b263 DN |
1838 | complex_ssa_name_components.release (); |
1839 | complex_lattice_values.release (); | |
bca7138a | 1840 | return todo; |
e41d82f5 | 1841 | } |
26277d41 | 1842 | |
27a4cd48 DM |
1843 | namespace { |
1844 | ||
1845 | const pass_data pass_data_lower_complex = | |
26277d41 | 1846 | { |
27a4cd48 DM |
1847 | GIMPLE_PASS, /* type */ |
1848 | "cplxlower", /* name */ | |
1849 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
1850 | TV_NONE, /* tv_id */ |
1851 | PROP_ssa, /* properties_required */ | |
1852 | PROP_gimple_lcx, /* properties_provided */ | |
1853 | 0, /* properties_destroyed */ | |
1854 | 0, /* todo_flags_start */ | |
3bea341f | 1855 | TODO_update_ssa, /* todo_flags_finish */ |
e41d82f5 RH |
1856 | }; |
1857 | ||
27a4cd48 DM |
1858 | class pass_lower_complex : public gimple_opt_pass |
1859 | { | |
1860 | public: | |
c3284718 RS |
1861 | pass_lower_complex (gcc::context *ctxt) |
1862 | : gimple_opt_pass (pass_data_lower_complex, ctxt) | |
27a4cd48 DM |
1863 | {} |
1864 | ||
1865 | /* opt_pass methods: */ | |
65d3284b | 1866 | opt_pass * clone () { return new pass_lower_complex (m_ctxt); } |
be55bfe6 | 1867 | virtual unsigned int execute (function *) { return tree_lower_complex (); } |
27a4cd48 DM |
1868 | |
1869 | }; // class pass_lower_complex | |
1870 | ||
1871 | } // anon namespace | |
1872 | ||
1873 | gimple_opt_pass * | |
1874 | make_pass_lower_complex (gcc::context *ctxt) | |
1875 | { | |
1876 | return new pass_lower_complex (ctxt); | |
1877 | } | |
1878 | ||
e41d82f5 | 1879 | \f |
27a4cd48 DM |
1880 | namespace { |
1881 | ||
1882 | const pass_data pass_data_lower_complex_O0 = | |
e41d82f5 | 1883 | { |
27a4cd48 DM |
1884 | GIMPLE_PASS, /* type */ |
1885 | "cplxlower0", /* name */ | |
1886 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
1887 | TV_NONE, /* tv_id */ |
1888 | PROP_cfg, /* properties_required */ | |
1889 | PROP_gimple_lcx, /* properties_provided */ | |
1890 | 0, /* properties_destroyed */ | |
1891 | 0, /* todo_flags_start */ | |
3bea341f | 1892 | TODO_update_ssa, /* todo_flags_finish */ |
6de9cd9a | 1893 | }; |
27a4cd48 DM |
1894 | |
1895 | class pass_lower_complex_O0 : public gimple_opt_pass | |
1896 | { | |
1897 | public: | |
c3284718 RS |
1898 | pass_lower_complex_O0 (gcc::context *ctxt) |
1899 | : gimple_opt_pass (pass_data_lower_complex_O0, ctxt) | |
27a4cd48 DM |
1900 | {} |
1901 | ||
1902 | /* opt_pass methods: */ | |
1a3d085c TS |
1903 | virtual bool gate (function *fun) |
1904 | { | |
1905 | /* With errors, normal optimization passes are not run. If we don't | |
1906 | lower complex operations at all, rtl expansion will abort. */ | |
1907 | return !(fun->curr_properties & PROP_gimple_lcx); | |
1908 | } | |
1909 | ||
be55bfe6 | 1910 | virtual unsigned int execute (function *) { return tree_lower_complex (); } |
27a4cd48 DM |
1911 | |
1912 | }; // class pass_lower_complex_O0 | |
1913 | ||
1914 | } // anon namespace | |
1915 | ||
1916 | gimple_opt_pass * | |
1917 | make_pass_lower_complex_O0 (gcc::context *ctxt) | |
1918 | { | |
1919 | return new pass_lower_complex_O0 (ctxt); | |
1920 | } |