1 /* Lower complex number operations to scalar operations.
2 Copyright (C) 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
4 This file is part of GCC.
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
8 Free Software Foundation; either version 3, or (at your option) any
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
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
22 #include "coretypes.h"
28 #include "tree-flow.h"
29 #include "tree-gimple.h"
30 #include "tree-iterator.h"
31 #include "tree-pass.h"
32 #include "tree-ssa-propagate.h"
33 #include "diagnostic.h"
36 /* For each complex ssa name, a lattice value. We're interested in finding
37 out whether a complex number is degenerate in some way, having only real
38 or only complex parts. */
48 #define PAIR(a, b) ((a) << 2 | (b))
50 DEF_VEC_I(complex_lattice_t);
51 DEF_VEC_ALLOC_I(complex_lattice_t, heap);
53 static VEC(complex_lattice_t, heap) *complex_lattice_values;
55 /* For each complex variable, a pair of variables for the components exists in
57 static htab_t complex_variable_components;
59 /* For each complex SSA_NAME, a pair of ssa names for the components. */
60 static VEC(tree, heap) *complex_ssa_name_components;
62 /* Lookup UID in the complex_variable_components hashtable and return the
65 cvc_lookup (unsigned int uid)
67 struct int_tree_map *h, in;
69 h = htab_find_with_hash (complex_variable_components, &in, uid);
70 return h ? h->to : NULL;
73 /* Insert the pair UID, TO into the complex_variable_components hashtable. */
76 cvc_insert (unsigned int uid, tree to)
78 struct int_tree_map *h;
81 h = XNEW (struct int_tree_map);
84 loc = htab_find_slot_with_hash (complex_variable_components, h,
86 *(struct int_tree_map **) loc = h;
89 /* Return true if T is not a zero constant. In the case of real values,
90 we're only interested in +0.0. */
93 some_nonzerop (tree t)
97 if (TREE_CODE (t) == REAL_CST)
98 zerop = REAL_VALUES_IDENTICAL (TREE_REAL_CST (t), dconst0);
99 else if (TREE_CODE (t) == FIXED_CST)
100 zerop = fixed_zerop (t);
101 else if (TREE_CODE (t) == INTEGER_CST)
102 zerop = integer_zerop (t);
107 /* Compute a lattice value from T. It may be a gimple_val, or, as a
108 special exception, a COMPLEX_EXPR. */
110 static complex_lattice_t
111 find_lattice_value (tree t)
115 complex_lattice_t ret;
117 switch (TREE_CODE (t))
120 return VEC_index (complex_lattice_t, complex_lattice_values,
121 SSA_NAME_VERSION (t));
124 real = TREE_REALPART (t);
125 imag = TREE_IMAGPART (t);
129 real = TREE_OPERAND (t, 0);
130 imag = TREE_OPERAND (t, 1);
137 r = some_nonzerop (real);
138 i = some_nonzerop (imag);
139 ret = r*ONLY_REAL + i*ONLY_IMAG;
141 /* ??? On occasion we could do better than mapping 0+0i to real, but we
142 certainly don't want to leave it UNINITIALIZED, which eventually gets
143 mapped to VARYING. */
144 if (ret == UNINITIALIZED)
150 /* Determine if LHS is something for which we're interested in seeing
151 simulation results. */
154 is_complex_reg (tree lhs)
156 return TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE && is_gimple_reg (lhs);
159 /* Mark the incoming parameters to the function as VARYING. */
162 init_parameter_lattice_values (void)
166 for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = TREE_CHAIN (parm))
167 if (is_complex_reg (parm)
168 && var_ann (parm) != NULL
169 && (ssa_name = gimple_default_def (cfun, parm)) != NULL_TREE)
170 VEC_replace (complex_lattice_t, complex_lattice_values,
171 SSA_NAME_VERSION (ssa_name), VARYING);
174 /* Initialize DONT_SIMULATE_AGAIN for each stmt and phi. Return false if
175 we found no statements we want to simulate, and thus there's nothing for
176 the entire pass to do. */
179 init_dont_simulate_again (void)
182 block_stmt_iterator bsi;
184 bool saw_a_complex_op = false;
188 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
189 DONT_SIMULATE_AGAIN (phi) = !is_complex_reg (PHI_RESULT (phi));
191 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
193 tree orig_stmt, stmt, rhs = NULL;
196 orig_stmt = stmt = bsi_stmt (bsi);
198 /* Most control-altering statements must be initially
199 simulated, else we won't cover the entire cfg. */
200 dsa = !stmt_ends_bb_p (stmt);
202 switch (TREE_CODE (stmt))
205 /* We don't care what the lattice value of <retval> is,
206 since it's never used as an input to another computation. */
208 stmt = TREE_OPERAND (stmt, 0);
209 if (!stmt || TREE_CODE (stmt) != GIMPLE_MODIFY_STMT)
213 case GIMPLE_MODIFY_STMT:
214 dsa = !is_complex_reg (GIMPLE_STMT_OPERAND (stmt, 0));
215 rhs = GIMPLE_STMT_OPERAND (stmt, 1);
219 rhs = TREE_OPERAND (stmt, 0);
227 switch (TREE_CODE (rhs))
231 rhs = TREE_OPERAND (rhs, 0);
244 if (TREE_CODE (TREE_TYPE (rhs)) == COMPLEX_TYPE)
245 saw_a_complex_op = true;
250 /* The total store transformation performed during
251 gimplification creates such uninitialized loads
252 and we need to lower the statement to be able
254 if (TREE_CODE (TREE_OPERAND (rhs, 0)) == SSA_NAME
255 && ssa_undefined_value_p (TREE_OPERAND (rhs, 0)))
256 saw_a_complex_op = true;
263 DONT_SIMULATE_AGAIN (orig_stmt) = dsa;
267 return saw_a_complex_op;
271 /* Evaluate statement STMT against the complex lattice defined above. */
273 static enum ssa_prop_result
274 complex_visit_stmt (tree stmt, edge *taken_edge_p ATTRIBUTE_UNUSED,
277 complex_lattice_t new_l, old_l, op1_l, op2_l;
281 if (TREE_CODE (stmt) != GIMPLE_MODIFY_STMT)
282 return SSA_PROP_VARYING;
284 lhs = GIMPLE_STMT_OPERAND (stmt, 0);
285 rhs = GIMPLE_STMT_OPERAND (stmt, 1);
287 /* These conditions should be satisfied due to the initial filter
288 set up in init_dont_simulate_again. */
289 gcc_assert (TREE_CODE (lhs) == SSA_NAME);
290 gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE);
293 ver = SSA_NAME_VERSION (lhs);
294 old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver);
296 switch (TREE_CODE (rhs))
301 new_l = find_lattice_value (rhs);
306 op1_l = find_lattice_value (TREE_OPERAND (rhs, 0));
307 op2_l = find_lattice_value (TREE_OPERAND (rhs, 1));
309 /* We've set up the lattice values such that IOR neatly
311 new_l = op1_l | op2_l;
320 op1_l = find_lattice_value (TREE_OPERAND (rhs, 0));
321 op2_l = find_lattice_value (TREE_OPERAND (rhs, 1));
323 /* Obviously, if either varies, so does the result. */
324 if (op1_l == VARYING || op2_l == VARYING)
326 /* Don't prematurely promote variables if we've not yet seen
328 else if (op1_l == UNINITIALIZED)
330 else if (op2_l == UNINITIALIZED)
334 /* At this point both numbers have only one component. If the
335 numbers are of opposite kind, the result is imaginary,
336 otherwise the result is real. The add/subtract translates
337 the real/imag from/to 0/1; the ^ performs the comparison. */
338 new_l = ((op1_l - ONLY_REAL) ^ (op2_l - ONLY_REAL)) + ONLY_REAL;
340 /* Don't allow the lattice value to flip-flop indefinitely. */
347 new_l = find_lattice_value (TREE_OPERAND (rhs, 0));
355 /* If nothing changed this round, let the propagator know. */
357 return SSA_PROP_NOT_INTERESTING;
359 VEC_replace (complex_lattice_t, complex_lattice_values, ver, new_l);
360 return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING;
363 /* Evaluate a PHI node against the complex lattice defined above. */
365 static enum ssa_prop_result
366 complex_visit_phi (tree phi)
368 complex_lattice_t new_l, old_l;
373 lhs = PHI_RESULT (phi);
375 /* This condition should be satisfied due to the initial filter
376 set up in init_dont_simulate_again. */
377 gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE);
379 /* We've set up the lattice values such that IOR neatly models PHI meet. */
380 new_l = UNINITIALIZED;
381 for (i = PHI_NUM_ARGS (phi) - 1; i >= 0; --i)
382 new_l |= find_lattice_value (PHI_ARG_DEF (phi, i));
384 ver = SSA_NAME_VERSION (lhs);
385 old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver);
388 return SSA_PROP_NOT_INTERESTING;
390 VEC_replace (complex_lattice_t, complex_lattice_values, ver, new_l);
391 return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING;
394 /* Create one backing variable for a complex component of ORIG. */
397 create_one_component_var (tree type, tree orig, const char *prefix,
398 const char *suffix, enum tree_code code)
400 tree r = create_tmp_var (type, prefix);
401 add_referenced_var (r);
403 DECL_SOURCE_LOCATION (r) = DECL_SOURCE_LOCATION (orig);
404 DECL_ARTIFICIAL (r) = 1;
406 if (DECL_NAME (orig) && !DECL_IGNORED_P (orig))
408 const char *name = IDENTIFIER_POINTER (DECL_NAME (orig));
411 DECL_NAME (r) = get_identifier (ACONCAT ((name, suffix, NULL)));
413 inner_type = TREE_TYPE (TREE_TYPE (orig));
414 SET_DECL_DEBUG_EXPR (r, build1 (code, type, orig));
415 DECL_DEBUG_EXPR_IS_FROM (r) = 1;
416 DECL_IGNORED_P (r) = 0;
417 TREE_NO_WARNING (r) = TREE_NO_WARNING (orig);
421 DECL_IGNORED_P (r) = 1;
422 TREE_NO_WARNING (r) = 1;
428 /* Retrieve a value for a complex component of VAR. */
431 get_component_var (tree var, bool imag_p)
433 size_t decl_index = DECL_UID (var) * 2 + imag_p;
434 tree ret = cvc_lookup (decl_index);
438 ret = create_one_component_var (TREE_TYPE (TREE_TYPE (var)), var,
439 imag_p ? "CI" : "CR",
440 imag_p ? "$imag" : "$real",
441 imag_p ? IMAGPART_EXPR : REALPART_EXPR);
442 cvc_insert (decl_index, ret);
448 /* Retrieve a value for a complex component of SSA_NAME. */
451 get_component_ssa_name (tree ssa_name, bool imag_p)
453 complex_lattice_t lattice = find_lattice_value (ssa_name);
454 size_t ssa_name_index;
457 if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG))
459 tree inner_type = TREE_TYPE (TREE_TYPE (ssa_name));
460 if (SCALAR_FLOAT_TYPE_P (inner_type))
461 return build_real (inner_type, dconst0);
463 return build_int_cst (inner_type, 0);
466 ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p;
467 ret = VEC_index (tree, complex_ssa_name_components, ssa_name_index);
470 ret = get_component_var (SSA_NAME_VAR (ssa_name), imag_p);
471 ret = make_ssa_name (ret, NULL);
473 /* Copy some properties from the original. In particular, whether it
474 is used in an abnormal phi, and whether it's uninitialized. */
475 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ret)
476 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name);
477 if (TREE_CODE (SSA_NAME_VAR (ssa_name)) == VAR_DECL
478 && IS_EMPTY_STMT (SSA_NAME_DEF_STMT (ssa_name)))
480 SSA_NAME_DEF_STMT (ret) = SSA_NAME_DEF_STMT (ssa_name);
481 set_default_def (SSA_NAME_VAR (ret), ret);
484 VEC_replace (tree, complex_ssa_name_components, ssa_name_index, ret);
490 /* Set a value for a complex component of SSA_NAME, return a STMT_LIST of
491 stuff that needs doing. */
494 set_component_ssa_name (tree ssa_name, bool imag_p, tree value)
496 complex_lattice_t lattice = find_lattice_value (ssa_name);
497 size_t ssa_name_index;
498 tree comp, list, last;
500 /* We know the value must be zero, else there's a bug in our lattice
501 analysis. But the value may well be a variable known to contain
502 zero. We should be safe ignoring it. */
503 if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG))
506 /* If we've already assigned an SSA_NAME to this component, then this
507 means that our walk of the basic blocks found a use before the set.
508 This is fine. Now we should create an initialization for the value
509 we created earlier. */
510 ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p;
511 comp = VEC_index (tree, complex_ssa_name_components, ssa_name_index);
515 /* If we've nothing assigned, and the value we're given is already stable,
516 then install that as the value for this SSA_NAME. This preemptively
517 copy-propagates the value, which avoids unnecessary memory allocation. */
518 else if (is_gimple_min_invariant (value))
520 VEC_replace (tree, complex_ssa_name_components, ssa_name_index, value);
523 else if (TREE_CODE (value) == SSA_NAME
524 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name))
526 /* Replace an anonymous base value with the variable from cvc_lookup.
527 This should result in better debug info. */
528 if (DECL_IGNORED_P (SSA_NAME_VAR (value))
529 && !DECL_IGNORED_P (SSA_NAME_VAR (ssa_name)))
531 comp = get_component_var (SSA_NAME_VAR (ssa_name), imag_p);
532 replace_ssa_name_symbol (value, comp);
535 VEC_replace (tree, complex_ssa_name_components, ssa_name_index, value);
539 /* Finally, we need to stabilize the result by installing the value into
542 comp = get_component_ssa_name (ssa_name, imag_p);
544 /* Do all the work to assign VALUE to COMP. */
545 value = force_gimple_operand (value, &list, false, NULL);
546 last = build_gimple_modify_stmt (comp, value);
547 append_to_statement_list (last, &list);
549 gcc_assert (SSA_NAME_DEF_STMT (comp) == NULL);
550 SSA_NAME_DEF_STMT (comp) = last;
555 /* Extract the real or imaginary part of a complex variable or constant.
556 Make sure that it's a proper gimple_val and gimplify it if not.
557 Emit any new code before BSI. */
560 extract_component (block_stmt_iterator *bsi, tree t, bool imagpart_p,
563 switch (TREE_CODE (t))
566 return imagpart_p ? TREE_IMAGPART (t) : TREE_REALPART (t);
569 return TREE_OPERAND (t, imagpart_p);
578 tree inner_type = TREE_TYPE (TREE_TYPE (t));
580 t = build1 ((imagpart_p ? IMAGPART_EXPR : REALPART_EXPR),
581 inner_type, unshare_expr (t));
584 t = gimplify_val (bsi, inner_type, t);
590 return get_component_ssa_name (t, imagpart_p);
597 /* Update the complex components of the ssa name on the lhs of STMT. */
600 update_complex_components (block_stmt_iterator *bsi, tree stmt, tree r, tree i)
602 tree lhs = GIMPLE_STMT_OPERAND (stmt, 0);
605 list = set_component_ssa_name (lhs, false, r);
607 bsi_insert_after (bsi, list, BSI_CONTINUE_LINKING);
609 list = set_component_ssa_name (lhs, true, i);
611 bsi_insert_after (bsi, list, BSI_CONTINUE_LINKING);
615 update_complex_components_on_edge (edge e, tree lhs, tree r, tree i)
619 list = set_component_ssa_name (lhs, false, r);
621 bsi_insert_on_edge (e, list);
623 list = set_component_ssa_name (lhs, true, i);
625 bsi_insert_on_edge (e, list);
628 /* Update an assignment to a complex variable in place. */
631 update_complex_assignment (block_stmt_iterator *bsi, tree r, tree i)
636 mod = stmt = bsi_stmt (*bsi);
637 if (TREE_CODE (stmt) == RETURN_EXPR)
638 mod = TREE_OPERAND (mod, 0);
639 else if (gimple_in_ssa_p (cfun))
640 update_complex_components (bsi, stmt, r, i);
642 type = TREE_TYPE (GIMPLE_STMT_OPERAND (mod, 1));
643 GIMPLE_STMT_OPERAND (mod, 1) = build2 (COMPLEX_EXPR, type, r, i);
647 /* Generate code at the entry point of the function to initialize the
648 component variables for a complex parameter. */
651 update_parameter_components (void)
653 edge entry_edge = single_succ_edge (ENTRY_BLOCK_PTR);
656 for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = TREE_CHAIN (parm))
658 tree type = TREE_TYPE (parm);
661 if (TREE_CODE (type) != COMPLEX_TYPE || !is_gimple_reg (parm))
664 type = TREE_TYPE (type);
665 ssa_name = gimple_default_def (cfun, parm);
669 r = build1 (REALPART_EXPR, type, ssa_name);
670 i = build1 (IMAGPART_EXPR, type, ssa_name);
671 update_complex_components_on_edge (entry_edge, ssa_name, r, i);
675 /* Generate code to set the component variables of a complex variable
676 to match the PHI statements in block BB. */
679 update_phi_components (basic_block bb)
683 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
684 if (is_complex_reg (PHI_RESULT (phi)))
686 tree lr, li, pr = NULL, pi = NULL;
689 lr = get_component_ssa_name (PHI_RESULT (phi), false);
690 if (TREE_CODE (lr) == SSA_NAME)
692 pr = create_phi_node (lr, bb);
693 SSA_NAME_DEF_STMT (lr) = pr;
696 li = get_component_ssa_name (PHI_RESULT (phi), true);
697 if (TREE_CODE (li) == SSA_NAME)
699 pi = create_phi_node (li, bb);
700 SSA_NAME_DEF_STMT (li) = pi;
703 for (i = 0, n = PHI_NUM_ARGS (phi); i < n; ++i)
705 tree comp, arg = PHI_ARG_DEF (phi, i);
708 comp = extract_component (NULL, arg, false, false);
709 SET_PHI_ARG_DEF (pr, i, comp);
713 comp = extract_component (NULL, arg, true, false);
714 SET_PHI_ARG_DEF (pi, i, comp);
720 /* Mark each virtual op in STMT for ssa update. */
723 update_all_vops (tree stmt)
728 FOR_EACH_SSA_TREE_OPERAND (sym, stmt, iter, SSA_OP_ALL_VIRTUALS)
730 if (TREE_CODE (sym) == SSA_NAME)
731 sym = SSA_NAME_VAR (sym);
732 mark_sym_for_renaming (sym);
736 /* Expand a complex move to scalars. */
739 expand_complex_move (block_stmt_iterator *bsi, tree stmt, tree type,
742 tree inner_type = TREE_TYPE (type);
745 if (TREE_CODE (lhs) == SSA_NAME)
747 if (is_ctrl_altering_stmt (bsi_stmt (*bsi)))
752 /* The value is not assigned on the exception edges, so we need not
753 concern ourselves there. We do need to update on the fallthru
755 FOR_EACH_EDGE (e, ei, bsi->bb->succs)
756 if (e->flags & EDGE_FALLTHRU)
761 r = build1 (REALPART_EXPR, inner_type, lhs);
762 i = build1 (IMAGPART_EXPR, inner_type, lhs);
763 update_complex_components_on_edge (e, lhs, r, i);
765 else if (TREE_CODE (rhs) == CALL_EXPR || TREE_SIDE_EFFECTS (rhs)
766 || TREE_CODE (rhs) == PAREN_EXPR)
768 r = build1 (REALPART_EXPR, inner_type, lhs);
769 i = build1 (IMAGPART_EXPR, inner_type, lhs);
770 update_complex_components (bsi, stmt, r, i);
774 update_all_vops (bsi_stmt (*bsi));
775 r = extract_component (bsi, rhs, 0, true);
776 i = extract_component (bsi, rhs, 1, true);
777 update_complex_assignment (bsi, r, i);
780 else if (TREE_CODE (rhs) == SSA_NAME && !TREE_SIDE_EFFECTS (lhs))
784 r = extract_component (bsi, rhs, 0, false);
785 i = extract_component (bsi, rhs, 1, false);
787 x = build1 (REALPART_EXPR, inner_type, unshare_expr (lhs));
788 x = build_gimple_modify_stmt (x, r);
789 bsi_insert_before (bsi, x, BSI_SAME_STMT);
791 if (stmt == bsi_stmt (*bsi))
793 x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs));
794 GIMPLE_STMT_OPERAND (stmt, 0) = x;
795 GIMPLE_STMT_OPERAND (stmt, 1) = i;
799 x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs));
800 x = build_gimple_modify_stmt (x, i);
801 bsi_insert_before (bsi, x, BSI_SAME_STMT);
803 stmt = bsi_stmt (*bsi);
804 gcc_assert (TREE_CODE (stmt) == RETURN_EXPR);
805 GIMPLE_STMT_OPERAND (stmt, 0) = lhs;
808 update_all_vops (stmt);
813 /* Expand complex addition to scalars:
814 a + b = (ar + br) + i(ai + bi)
815 a - b = (ar - br) + i(ai + bi)
819 expand_complex_addition (block_stmt_iterator *bsi, tree inner_type,
820 tree ar, tree ai, tree br, tree bi,
822 complex_lattice_t al, complex_lattice_t bl)
826 switch (PAIR (al, bl))
828 case PAIR (ONLY_REAL, ONLY_REAL):
829 rr = gimplify_build2 (bsi, code, inner_type, ar, br);
833 case PAIR (ONLY_REAL, ONLY_IMAG):
835 if (code == MINUS_EXPR)
836 ri = gimplify_build2 (bsi, MINUS_EXPR, inner_type, ai, bi);
841 case PAIR (ONLY_IMAG, ONLY_REAL):
842 if (code == MINUS_EXPR)
843 rr = gimplify_build2 (bsi, MINUS_EXPR, inner_type, ar, br);
849 case PAIR (ONLY_IMAG, ONLY_IMAG):
851 ri = gimplify_build2 (bsi, code, inner_type, ai, bi);
854 case PAIR (VARYING, ONLY_REAL):
855 rr = gimplify_build2 (bsi, code, inner_type, ar, br);
859 case PAIR (VARYING, ONLY_IMAG):
861 ri = gimplify_build2 (bsi, code, inner_type, ai, bi);
864 case PAIR (ONLY_REAL, VARYING):
865 if (code == MINUS_EXPR)
867 rr = gimplify_build2 (bsi, code, inner_type, ar, br);
871 case PAIR (ONLY_IMAG, VARYING):
872 if (code == MINUS_EXPR)
875 ri = gimplify_build2 (bsi, code, inner_type, ai, bi);
878 case PAIR (VARYING, VARYING):
880 rr = gimplify_build2 (bsi, code, inner_type, ar, br);
881 ri = gimplify_build2 (bsi, code, inner_type, ai, bi);
888 update_complex_assignment (bsi, rr, ri);
891 /* Expand a complex multiplication or division to a libcall to the c99
892 compliant routines. */
895 expand_complex_libcall (block_stmt_iterator *bsi, tree ar, tree ai,
896 tree br, tree bi, enum tree_code code)
898 enum machine_mode mode;
899 enum built_in_function bcode;
902 stmt = bsi_stmt (*bsi);
903 type = TREE_TYPE (GIMPLE_STMT_OPERAND (stmt, 1));
905 mode = TYPE_MODE (type);
906 gcc_assert (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT);
907 if (code == MULT_EXPR)
908 bcode = BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
909 else if (code == RDIV_EXPR)
910 bcode = BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT;
913 fn = built_in_decls[bcode];
915 GIMPLE_STMT_OPERAND (stmt, 1) = build_call_expr (fn, 4, ar, ai, br, bi);
918 if (gimple_in_ssa_p (cfun))
920 tree lhs = GIMPLE_STMT_OPERAND (stmt, 0);
921 type = TREE_TYPE (type);
922 update_complex_components (bsi, stmt,
923 build1 (REALPART_EXPR, type, lhs),
924 build1 (IMAGPART_EXPR, type, lhs));
928 /* Expand complex multiplication to scalars:
929 a * b = (ar*br - ai*bi) + i(ar*bi + br*ai)
933 expand_complex_multiplication (block_stmt_iterator *bsi, tree inner_type,
934 tree ar, tree ai, tree br, tree bi,
935 complex_lattice_t al, complex_lattice_t bl)
941 complex_lattice_t tl;
942 rr = ar, ar = br, br = rr;
943 ri = ai, ai = bi, bi = ri;
944 tl = al, al = bl, bl = tl;
947 switch (PAIR (al, bl))
949 case PAIR (ONLY_REAL, ONLY_REAL):
950 rr = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, br);
954 case PAIR (ONLY_IMAG, ONLY_REAL):
956 if (TREE_CODE (ai) == REAL_CST
957 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ai), dconst1))
960 ri = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, br);
963 case PAIR (ONLY_IMAG, ONLY_IMAG):
964 rr = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, bi);
965 rr = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, rr);
969 case PAIR (VARYING, ONLY_REAL):
970 rr = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, br);
971 ri = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, br);
974 case PAIR (VARYING, ONLY_IMAG):
975 rr = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, bi);
976 rr = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, rr);
977 ri = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, bi);
980 case PAIR (VARYING, VARYING):
981 if (flag_complex_method == 2 && SCALAR_FLOAT_TYPE_P (inner_type))
983 expand_complex_libcall (bsi, ar, ai, br, bi, MULT_EXPR);
990 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, br);
991 t2 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, bi);
992 t3 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, bi);
994 /* Avoid expanding redundant multiplication for the common
995 case of squaring a complex number. */
996 if (ar == br && ai == bi)
999 t4 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, br);
1001 rr = gimplify_build2 (bsi, MINUS_EXPR, inner_type, t1, t2);
1002 ri = gimplify_build2 (bsi, PLUS_EXPR, inner_type, t3, t4);
1010 update_complex_assignment (bsi, rr, ri);
1013 /* Expand complex division to scalars, straightforward algorithm.
1014 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1019 expand_complex_div_straight (block_stmt_iterator *bsi, tree inner_type,
1020 tree ar, tree ai, tree br, tree bi,
1021 enum tree_code code)
1023 tree rr, ri, div, t1, t2, t3;
1025 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, br, br);
1026 t2 = gimplify_build2 (bsi, MULT_EXPR, inner_type, bi, bi);
1027 div = gimplify_build2 (bsi, PLUS_EXPR, inner_type, t1, t2);
1029 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, br);
1030 t2 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, bi);
1031 t3 = gimplify_build2 (bsi, PLUS_EXPR, inner_type, t1, t2);
1032 rr = gimplify_build2 (bsi, code, inner_type, t3, div);
1034 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, br);
1035 t2 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, bi);
1036 t3 = gimplify_build2 (bsi, MINUS_EXPR, inner_type, t1, t2);
1037 ri = gimplify_build2 (bsi, code, inner_type, t3, div);
1039 update_complex_assignment (bsi, rr, ri);
1042 /* Expand complex division to scalars, modified algorithm to minimize
1043 overflow with wide input ranges. */
1046 expand_complex_div_wide (block_stmt_iterator *bsi, tree inner_type,
1047 tree ar, tree ai, tree br, tree bi,
1048 enum tree_code code)
1050 tree rr, ri, ratio, div, t1, t2, tr, ti, cond;
1051 basic_block bb_cond, bb_true, bb_false, bb_join;
1053 /* Examine |br| < |bi|, and branch. */
1054 t1 = gimplify_build1 (bsi, ABS_EXPR, inner_type, br);
1055 t2 = gimplify_build1 (bsi, ABS_EXPR, inner_type, bi);
1056 cond = fold_build2 (LT_EXPR, boolean_type_node, t1, t2);
1059 bb_cond = bb_true = bb_false = bb_join = NULL;
1060 rr = ri = tr = ti = NULL;
1061 if (!TREE_CONSTANT (cond))
1065 cond = build3 (COND_EXPR, void_type_node, cond, NULL_TREE, NULL_TREE);
1066 bsi_insert_before (bsi, cond, BSI_SAME_STMT);
1068 /* Split the original block, and create the TRUE and FALSE blocks. */
1069 e = split_block (bsi->bb, cond);
1072 bb_true = create_empty_bb (bb_cond);
1073 bb_false = create_empty_bb (bb_true);
1075 /* Wire the blocks together. */
1076 e->flags = EDGE_TRUE_VALUE;
1077 redirect_edge_succ (e, bb_true);
1078 make_edge (bb_cond, bb_false, EDGE_FALSE_VALUE);
1079 make_edge (bb_true, bb_join, EDGE_FALLTHRU);
1080 make_edge (bb_false, bb_join, EDGE_FALLTHRU);
1082 /* Update dominance info. Note that bb_join's data was
1083 updated by split_block. */
1084 if (dom_info_available_p (CDI_DOMINATORS))
1086 set_immediate_dominator (CDI_DOMINATORS, bb_true, bb_cond);
1087 set_immediate_dominator (CDI_DOMINATORS, bb_false, bb_cond);
1090 rr = make_rename_temp (inner_type, NULL);
1091 ri = make_rename_temp (inner_type, NULL);
1094 /* In the TRUE branch, we compute
1096 div = (br * ratio) + bi;
1097 tr = (ar * ratio) + ai;
1098 ti = (ai * ratio) - ar;
1101 if (bb_true || integer_nonzerop (cond))
1105 *bsi = bsi_last (bb_true);
1106 bsi_insert_after (bsi, build_empty_stmt (), BSI_NEW_STMT);
1109 ratio = gimplify_build2 (bsi, code, inner_type, br, bi);
1111 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, br, ratio);
1112 div = gimplify_build2 (bsi, PLUS_EXPR, inner_type, t1, bi);
1114 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, ratio);
1115 tr = gimplify_build2 (bsi, PLUS_EXPR, inner_type, t1, ai);
1117 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, ratio);
1118 ti = gimplify_build2 (bsi, MINUS_EXPR, inner_type, t1, ar);
1120 tr = gimplify_build2 (bsi, code, inner_type, tr, div);
1121 ti = gimplify_build2 (bsi, code, inner_type, ti, div);
1125 t1 = build_gimple_modify_stmt (rr, tr);
1126 bsi_insert_before (bsi, t1, BSI_SAME_STMT);
1127 t1 = build_gimple_modify_stmt (ri, ti);
1128 bsi_insert_before (bsi, t1, BSI_SAME_STMT);
1129 bsi_remove (bsi, true);
1133 /* In the FALSE branch, we compute
1135 divisor = (d * ratio) + c;
1136 tr = (b * ratio) + a;
1137 ti = b - (a * ratio);
1140 if (bb_false || integer_zerop (cond))
1144 *bsi = bsi_last (bb_false);
1145 bsi_insert_after (bsi, build_empty_stmt (), BSI_NEW_STMT);
1148 ratio = gimplify_build2 (bsi, code, inner_type, bi, br);
1150 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, bi, ratio);
1151 div = gimplify_build2 (bsi, PLUS_EXPR, inner_type, t1, br);
1153 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, ratio);
1154 tr = gimplify_build2 (bsi, PLUS_EXPR, inner_type, t1, ar);
1156 t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, ratio);
1157 ti = gimplify_build2 (bsi, MINUS_EXPR, inner_type, ai, t1);
1159 tr = gimplify_build2 (bsi, code, inner_type, tr, div);
1160 ti = gimplify_build2 (bsi, code, inner_type, ti, div);
1164 t1 = build_gimple_modify_stmt (rr, tr);
1165 bsi_insert_before (bsi, t1, BSI_SAME_STMT);
1166 t1 = build_gimple_modify_stmt (ri, ti);
1167 bsi_insert_before (bsi, t1, BSI_SAME_STMT);
1168 bsi_remove (bsi, true);
1173 *bsi = bsi_start (bb_join);
1177 update_complex_assignment (bsi, rr, ri);
1180 /* Expand complex division to scalars. */
1183 expand_complex_division (block_stmt_iterator *bsi, tree inner_type,
1184 tree ar, tree ai, tree br, tree bi,
1185 enum tree_code code,
1186 complex_lattice_t al, complex_lattice_t bl)
1190 switch (PAIR (al, bl))
1192 case PAIR (ONLY_REAL, ONLY_REAL):
1193 rr = gimplify_build2 (bsi, code, inner_type, ar, br);
1197 case PAIR (ONLY_REAL, ONLY_IMAG):
1199 ri = gimplify_build2 (bsi, code, inner_type, ar, bi);
1200 ri = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, ri);
1203 case PAIR (ONLY_IMAG, ONLY_REAL):
1205 ri = gimplify_build2 (bsi, code, inner_type, ai, br);
1208 case PAIR (ONLY_IMAG, ONLY_IMAG):
1209 rr = gimplify_build2 (bsi, code, inner_type, ai, bi);
1213 case PAIR (VARYING, ONLY_REAL):
1214 rr = gimplify_build2 (bsi, code, inner_type, ar, br);
1215 ri = gimplify_build2 (bsi, code, inner_type, ai, br);
1218 case PAIR (VARYING, ONLY_IMAG):
1219 rr = gimplify_build2 (bsi, code, inner_type, ai, bi);
1220 ri = gimplify_build2 (bsi, code, inner_type, ar, bi);
1221 ri = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, ri);
1223 case PAIR (ONLY_REAL, VARYING):
1224 case PAIR (ONLY_IMAG, VARYING):
1225 case PAIR (VARYING, VARYING):
1226 switch (flag_complex_method)
1229 /* straightforward implementation of complex divide acceptable. */
1230 expand_complex_div_straight (bsi, inner_type, ar, ai, br, bi, code);
1234 if (SCALAR_FLOAT_TYPE_P (inner_type))
1236 expand_complex_libcall (bsi, ar, ai, br, bi, code);
1242 /* wide ranges of inputs must work for complex divide. */
1243 expand_complex_div_wide (bsi, inner_type, ar, ai, br, bi, code);
1255 update_complex_assignment (bsi, rr, ri);
1258 /* Expand complex negation to scalars:
1263 expand_complex_negation (block_stmt_iterator *bsi, tree inner_type,
1268 rr = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, ar);
1269 ri = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, ai);
1271 update_complex_assignment (bsi, rr, ri);
1274 /* Expand complex conjugate to scalars:
1279 expand_complex_conjugate (block_stmt_iterator *bsi, tree inner_type,
1284 ri = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, ai);
1286 update_complex_assignment (bsi, ar, ri);
1289 /* Expand complex comparison (EQ or NE only). */
1292 expand_complex_comparison (block_stmt_iterator *bsi, tree ar, tree ai,
1293 tree br, tree bi, enum tree_code code)
1295 tree cr, ci, cc, stmt, expr, type;
1297 cr = gimplify_build2 (bsi, code, boolean_type_node, ar, br);
1298 ci = gimplify_build2 (bsi, code, boolean_type_node, ai, bi);
1299 cc = gimplify_build2 (bsi,
1300 (code == EQ_EXPR ? TRUTH_AND_EXPR : TRUTH_OR_EXPR),
1301 boolean_type_node, cr, ci);
1303 stmt = expr = bsi_stmt (*bsi);
1305 switch (TREE_CODE (stmt))
1308 expr = TREE_OPERAND (stmt, 0);
1310 case GIMPLE_MODIFY_STMT:
1311 type = TREE_TYPE (GIMPLE_STMT_OPERAND (expr, 1));
1312 GIMPLE_STMT_OPERAND (expr, 1) = fold_convert (type, cc);
1315 TREE_OPERAND (stmt, 0) = cc;
1324 /* Process one statement. If we identify a complex operation, expand it. */
1327 expand_complex_operations_1 (block_stmt_iterator *bsi)
1329 tree stmt = bsi_stmt (*bsi);
1330 tree rhs, type, inner_type;
1331 tree ac, ar, ai, bc, br, bi;
1332 complex_lattice_t al, bl;
1333 enum tree_code code;
1335 switch (TREE_CODE (stmt))
1338 stmt = TREE_OPERAND (stmt, 0);
1341 if (TREE_CODE (stmt) != GIMPLE_MODIFY_STMT)
1345 case GIMPLE_MODIFY_STMT:
1346 rhs = GIMPLE_STMT_OPERAND (stmt, 1);
1350 rhs = TREE_OPERAND (stmt, 0);
1357 type = TREE_TYPE (rhs);
1358 code = TREE_CODE (rhs);
1360 /* Initial filter for operations we handle. */
1366 case TRUNC_DIV_EXPR:
1368 case FLOOR_DIV_EXPR:
1369 case ROUND_DIV_EXPR:
1373 if (TREE_CODE (type) != COMPLEX_TYPE)
1375 inner_type = TREE_TYPE (type);
1380 inner_type = TREE_TYPE (TREE_OPERAND (rhs, 1));
1381 if (TREE_CODE (inner_type) != COMPLEX_TYPE)
1389 /* COND_EXPR may also fallthru here, but we do not need to do anything
1391 if (TREE_CODE (stmt) != GIMPLE_MODIFY_STMT)
1394 lhs = GIMPLE_STMT_OPERAND (stmt, 0);
1395 rhs = GIMPLE_STMT_OPERAND (stmt, 1);
1397 if (TREE_CODE (type) == COMPLEX_TYPE)
1398 expand_complex_move (bsi, stmt, type, lhs, rhs);
1399 else if ((TREE_CODE (rhs) == REALPART_EXPR
1400 || TREE_CODE (rhs) == IMAGPART_EXPR)
1401 && TREE_CODE (TREE_OPERAND (rhs, 0)) == SSA_NAME)
1403 GENERIC_TREE_OPERAND (stmt, 1)
1404 = extract_component (bsi, TREE_OPERAND (rhs, 0),
1405 TREE_CODE (rhs) == IMAGPART_EXPR, false);
1412 /* Extract the components of the two complex values. Make sure and
1413 handle the common case of the same value used twice specially. */
1414 ac = TREE_OPERAND (rhs, 0);
1415 ar = extract_component (bsi, ac, 0, true);
1416 ai = extract_component (bsi, ac, 1, true);
1418 if (TREE_CODE_CLASS (code) == tcc_unary)
1419 bc = br = bi = NULL;
1422 bc = TREE_OPERAND (rhs, 1);
1427 br = extract_component (bsi, bc, 0, true);
1428 bi = extract_component (bsi, bc, 1, true);
1432 if (gimple_in_ssa_p (cfun))
1434 al = find_lattice_value (ac);
1435 if (al == UNINITIALIZED)
1438 if (TREE_CODE_CLASS (code) == tcc_unary)
1444 bl = find_lattice_value (bc);
1445 if (bl == UNINITIALIZED)
1456 expand_complex_addition (bsi, inner_type, ar, ai, br, bi, code, al, bl);
1460 expand_complex_multiplication (bsi, inner_type, ar, ai, br, bi, al, bl);
1463 case TRUNC_DIV_EXPR:
1465 case FLOOR_DIV_EXPR:
1466 case ROUND_DIV_EXPR:
1468 expand_complex_division (bsi, inner_type, ar, ai, br, bi, code, al, bl);
1472 expand_complex_negation (bsi, inner_type, ar, ai);
1476 expand_complex_conjugate (bsi, inner_type, ar, ai);
1481 expand_complex_comparison (bsi, ar, ai, br, bi, code);
1490 /* Entry point for complex operation lowering during optimization. */
1493 tree_lower_complex (void)
1495 int old_last_basic_block;
1496 block_stmt_iterator bsi;
1499 if (!init_dont_simulate_again ())
1502 complex_lattice_values = VEC_alloc (complex_lattice_t, heap, num_ssa_names);
1503 VEC_safe_grow_cleared (complex_lattice_t, heap,
1504 complex_lattice_values, num_ssa_names);
1506 init_parameter_lattice_values ();
1507 ssa_propagate (complex_visit_stmt, complex_visit_phi);
1509 complex_variable_components = htab_create (10, int_tree_map_hash,
1510 int_tree_map_eq, free);
1512 complex_ssa_name_components = VEC_alloc (tree, heap, 2*num_ssa_names);
1513 VEC_safe_grow_cleared (tree, heap, complex_ssa_name_components,
1516 update_parameter_components ();
1518 /* ??? Ideally we'd traverse the blocks in breadth-first order. */
1519 old_last_basic_block = last_basic_block;
1522 if (bb->index >= old_last_basic_block)
1524 update_phi_components (bb);
1525 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1526 expand_complex_operations_1 (&bsi);
1529 bsi_commit_edge_inserts ();
1531 htab_delete (complex_variable_components);
1532 VEC_free (tree, heap, complex_ssa_name_components);
1533 VEC_free (complex_lattice_t, heap, complex_lattice_values);
1537 struct gimple_opt_pass pass_lower_complex =
1541 "cplxlower", /* name */
1543 tree_lower_complex, /* execute */
1546 0, /* static_pass_number */
1548 PROP_ssa, /* properties_required */
1549 0, /* properties_provided */
1550 0, /* properties_destroyed */
1551 0, /* todo_flags_start */
1555 | TODO_verify_stmts /* todo_flags_finish */
1560 /* Entry point for complex operation lowering without optimization. */
1563 tree_lower_complex_O0 (void)
1565 int old_last_basic_block = last_basic_block;
1566 block_stmt_iterator bsi;
1571 if (bb->index >= old_last_basic_block)
1573 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
1574 expand_complex_operations_1 (&bsi);
1580 gate_no_optimization (void)
1582 /* With errors, normal optimization passes are not run. If we don't
1583 lower complex operations at all, rtl expansion will abort. */
1584 return optimize == 0 || sorrycount || errorcount;
1587 struct gimple_opt_pass pass_lower_complex_O0 =
1591 "cplxlower0", /* name */
1592 gate_no_optimization, /* gate */
1593 tree_lower_complex_O0, /* execute */
1596 0, /* static_pass_number */
1598 PROP_cfg, /* properties_required */
1599 0, /* properties_provided */
1600 0, /* properties_destroyed */
1601 0, /* todo_flags_start */
1602 TODO_dump_func | TODO_ggc_collect
1603 | TODO_verify_stmts, /* todo_flags_finish */