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