1 /* Lower complex number operations to scalar operations.
2 Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by the
9 Free Software Foundation; either version 3, or (at your option) any
12 GCC is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
27 #include "tree-flow.h"
29 #include "tree-iterator.h"
30 #include "tree-pass.h"
31 #include "tree-ssa-propagate.h"
34 /* For each complex ssa name, a lattice value. We're interested in finding
35 out whether a complex number is degenerate in some way, having only real
36 or only complex parts. */
46 /* The type complex_lattice_t holds combinations of the above
48 typedef int complex_lattice_t;
50 #define PAIR(a, b) ((a) << 2 | (b))
52 DEF_VEC_I(complex_lattice_t);
53 DEF_VEC_ALLOC_I(complex_lattice_t, heap);
55 static VEC(complex_lattice_t, heap) *complex_lattice_values;
57 /* For each complex variable, a pair of variables for the components exists in
59 static htab_t complex_variable_components;
61 /* For each complex SSA_NAME, a pair of ssa names for the components. */
62 static VEC(tree, heap) *complex_ssa_name_components;
64 /* Lookup UID in the complex_variable_components hashtable and return the
67 cvc_lookup (unsigned int uid)
69 struct int_tree_map *h, in;
71 h = (struct int_tree_map *) htab_find_with_hash (complex_variable_components, &in, uid);
72 return h ? h->to : NULL;
75 /* Insert the pair UID, TO into the complex_variable_components hashtable. */
78 cvc_insert (unsigned int uid, tree to)
80 struct int_tree_map *h;
83 h = XNEW (struct int_tree_map);
86 loc = htab_find_slot_with_hash (complex_variable_components, h,
88 *(struct int_tree_map **) loc = h;
91 /* Return true if T is not a zero constant. In the case of real values,
92 we're only interested in +0.0. */
95 some_nonzerop (tree t)
99 /* Operations with real or imaginary part of a complex number zero
100 cannot be treated the same as operations with a real or imaginary
101 operand if we care about the signs of zeros in the result. */
102 if (TREE_CODE (t) == REAL_CST && !flag_signed_zeros)
103 zerop = REAL_VALUES_IDENTICAL (TREE_REAL_CST (t), dconst0);
104 else if (TREE_CODE (t) == FIXED_CST)
105 zerop = fixed_zerop (t);
106 else if (TREE_CODE (t) == INTEGER_CST)
107 zerop = integer_zerop (t);
113 /* Compute a lattice value from the components of a complex type REAL
116 static complex_lattice_t
117 find_lattice_value_parts (tree real, tree imag)
120 complex_lattice_t ret;
122 r = some_nonzerop (real);
123 i = some_nonzerop (imag);
124 ret = r * ONLY_REAL + i * ONLY_IMAG;
126 /* ??? On occasion we could do better than mapping 0+0i to real, but we
127 certainly don't want to leave it UNINITIALIZED, which eventually gets
128 mapped to VARYING. */
129 if (ret == UNINITIALIZED)
136 /* Compute a lattice value from gimple_val T. */
138 static complex_lattice_t
139 find_lattice_value (tree t)
143 switch (TREE_CODE (t))
146 return VEC_index (complex_lattice_t, complex_lattice_values,
147 SSA_NAME_VERSION (t));
150 real = TREE_REALPART (t);
151 imag = TREE_IMAGPART (t);
158 return find_lattice_value_parts (real, imag);
161 /* Determine if LHS is something for which we're interested in seeing
162 simulation results. */
165 is_complex_reg (tree lhs)
167 return TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE && is_gimple_reg (lhs);
170 /* Mark the incoming parameters to the function as VARYING. */
173 init_parameter_lattice_values (void)
177 for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = DECL_CHAIN (parm))
178 if (is_complex_reg (parm)
179 && (ssa_name = ssa_default_def (cfun, parm)) != NULL_TREE)
180 VEC_replace (complex_lattice_t, complex_lattice_values,
181 SSA_NAME_VERSION (ssa_name), VARYING);
184 /* Initialize simulation state for each statement. Return false if we
185 found no statements we want to simulate, and thus there's nothing
186 for the entire pass to do. */
189 init_dont_simulate_again (void)
192 gimple_stmt_iterator gsi;
194 bool saw_a_complex_op = false;
198 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
200 phi = gsi_stmt (gsi);
201 prop_set_simulate_again (phi,
202 is_complex_reg (gimple_phi_result (phi)));
205 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
211 stmt = gsi_stmt (gsi);
212 op0 = op1 = NULL_TREE;
214 /* Most control-altering statements must be initially
215 simulated, else we won't cover the entire cfg. */
216 sim_again_p = stmt_ends_bb_p (stmt);
218 switch (gimple_code (stmt))
221 if (gimple_call_lhs (stmt))
222 sim_again_p = is_complex_reg (gimple_call_lhs (stmt));
226 sim_again_p = is_complex_reg (gimple_assign_lhs (stmt));
227 if (gimple_assign_rhs_code (stmt) == REALPART_EXPR
228 || gimple_assign_rhs_code (stmt) == IMAGPART_EXPR)
229 op0 = TREE_OPERAND (gimple_assign_rhs1 (stmt), 0);
231 op0 = gimple_assign_rhs1 (stmt);
232 if (gimple_num_ops (stmt) > 2)
233 op1 = gimple_assign_rhs2 (stmt);
237 op0 = gimple_cond_lhs (stmt);
238 op1 = gimple_cond_rhs (stmt);
246 switch (gimple_expr_code (stmt))
258 if (TREE_CODE (TREE_TYPE (op0)) == COMPLEX_TYPE
259 || TREE_CODE (TREE_TYPE (op1)) == COMPLEX_TYPE)
260 saw_a_complex_op = true;
265 if (TREE_CODE (TREE_TYPE (op0)) == COMPLEX_TYPE)
266 saw_a_complex_op = true;
271 /* The total store transformation performed during
272 gimplification creates such uninitialized loads
273 and we need to lower the statement to be able
275 if (TREE_CODE (op0) == SSA_NAME
276 && ssa_undefined_value_p (op0))
277 saw_a_complex_op = true;
284 prop_set_simulate_again (stmt, sim_again_p);
288 return saw_a_complex_op;
292 /* Evaluate statement STMT against the complex lattice defined above. */
294 static enum ssa_prop_result
295 complex_visit_stmt (gimple stmt, edge *taken_edge_p ATTRIBUTE_UNUSED,
298 complex_lattice_t new_l, old_l, op1_l, op2_l;
302 lhs = gimple_get_lhs (stmt);
303 /* Skip anything but GIMPLE_ASSIGN and GIMPLE_CALL with a lhs. */
305 return SSA_PROP_VARYING;
307 /* These conditions should be satisfied due to the initial filter
308 set up in init_dont_simulate_again. */
309 gcc_assert (TREE_CODE (lhs) == SSA_NAME);
310 gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE);
313 ver = SSA_NAME_VERSION (lhs);
314 old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver);
316 switch (gimple_expr_code (stmt))
320 new_l = find_lattice_value (gimple_assign_rhs1 (stmt));
324 new_l = find_lattice_value_parts (gimple_assign_rhs1 (stmt),
325 gimple_assign_rhs2 (stmt));
330 op1_l = find_lattice_value (gimple_assign_rhs1 (stmt));
331 op2_l = find_lattice_value (gimple_assign_rhs2 (stmt));
333 /* We've set up the lattice values such that IOR neatly
335 new_l = op1_l | op2_l;
344 op1_l = find_lattice_value (gimple_assign_rhs1 (stmt));
345 op2_l = find_lattice_value (gimple_assign_rhs2 (stmt));
347 /* Obviously, if either varies, so does the result. */
348 if (op1_l == VARYING || op2_l == VARYING)
350 /* Don't prematurely promote variables if we've not yet seen
352 else if (op1_l == UNINITIALIZED)
354 else if (op2_l == UNINITIALIZED)
358 /* At this point both numbers have only one component. If the
359 numbers are of opposite kind, the result is imaginary,
360 otherwise the result is real. The add/subtract translates
361 the real/imag from/to 0/1; the ^ performs the comparison. */
362 new_l = ((op1_l - ONLY_REAL) ^ (op2_l - ONLY_REAL)) + ONLY_REAL;
364 /* Don't allow the lattice value to flip-flop indefinitely. */
371 new_l = find_lattice_value (gimple_assign_rhs1 (stmt));
379 /* If nothing changed this round, let the propagator know. */
381 return SSA_PROP_NOT_INTERESTING;
383 VEC_replace (complex_lattice_t, complex_lattice_values, ver, new_l);
384 return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING;
387 /* Evaluate a PHI node against the complex lattice defined above. */
389 static enum ssa_prop_result
390 complex_visit_phi (gimple phi)
392 complex_lattice_t new_l, old_l;
397 lhs = gimple_phi_result (phi);
399 /* This condition should be satisfied due to the initial filter
400 set up in init_dont_simulate_again. */
401 gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE);
403 /* We've set up the lattice values such that IOR neatly models PHI meet. */
404 new_l = UNINITIALIZED;
405 for (i = gimple_phi_num_args (phi) - 1; i >= 0; --i)
406 new_l |= find_lattice_value (gimple_phi_arg_def (phi, i));
408 ver = SSA_NAME_VERSION (lhs);
409 old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver);
412 return SSA_PROP_NOT_INTERESTING;
414 VEC_replace (complex_lattice_t, complex_lattice_values, ver, new_l);
415 return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING;
418 /* Create one backing variable for a complex component of ORIG. */
421 create_one_component_var (tree type, tree orig, const char *prefix,
422 const char *suffix, enum tree_code code)
424 tree r = create_tmp_var (type, prefix);
426 DECL_SOURCE_LOCATION (r) = DECL_SOURCE_LOCATION (orig);
427 DECL_ARTIFICIAL (r) = 1;
429 if (DECL_NAME (orig) && !DECL_IGNORED_P (orig))
431 const char *name = IDENTIFIER_POINTER (DECL_NAME (orig));
433 DECL_NAME (r) = get_identifier (ACONCAT ((name, suffix, NULL)));
435 SET_DECL_DEBUG_EXPR (r, build1 (code, type, orig));
436 DECL_DEBUG_EXPR_IS_FROM (r) = 1;
437 DECL_IGNORED_P (r) = 0;
438 TREE_NO_WARNING (r) = TREE_NO_WARNING (orig);
442 DECL_IGNORED_P (r) = 1;
443 TREE_NO_WARNING (r) = 1;
449 /* Retrieve a value for a complex component of VAR. */
452 get_component_var (tree var, bool imag_p)
454 size_t decl_index = DECL_UID (var) * 2 + imag_p;
455 tree ret = cvc_lookup (decl_index);
459 ret = create_one_component_var (TREE_TYPE (TREE_TYPE (var)), var,
460 imag_p ? "CI" : "CR",
461 imag_p ? "$imag" : "$real",
462 imag_p ? IMAGPART_EXPR : REALPART_EXPR);
463 cvc_insert (decl_index, ret);
469 /* Retrieve a value for a complex component of SSA_NAME. */
472 get_component_ssa_name (tree ssa_name, bool imag_p)
474 complex_lattice_t lattice = find_lattice_value (ssa_name);
475 size_t ssa_name_index;
478 if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG))
480 tree inner_type = TREE_TYPE (TREE_TYPE (ssa_name));
481 if (SCALAR_FLOAT_TYPE_P (inner_type))
482 return build_real (inner_type, dconst0);
484 return build_int_cst (inner_type, 0);
487 ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p;
488 ret = VEC_index (tree, complex_ssa_name_components, ssa_name_index);
491 ret = get_component_var (SSA_NAME_VAR (ssa_name), imag_p);
492 ret = make_ssa_name (ret, NULL);
494 /* Copy some properties from the original. In particular, whether it
495 is used in an abnormal phi, and whether it's uninitialized. */
496 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ret)
497 = SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name);
498 if (TREE_CODE (SSA_NAME_VAR (ssa_name)) == VAR_DECL
499 && SSA_NAME_IS_DEFAULT_DEF (ssa_name))
501 SSA_NAME_DEF_STMT (ret) = SSA_NAME_DEF_STMT (ssa_name);
502 set_ssa_default_def (cfun, SSA_NAME_VAR (ret), ret);
505 VEC_replace (tree, complex_ssa_name_components, ssa_name_index, ret);
511 /* Set a value for a complex component of SSA_NAME, return a
512 gimple_seq of stuff that needs doing. */
515 set_component_ssa_name (tree ssa_name, bool imag_p, tree value)
517 complex_lattice_t lattice = find_lattice_value (ssa_name);
518 size_t ssa_name_index;
523 /* We know the value must be zero, else there's a bug in our lattice
524 analysis. But the value may well be a variable known to contain
525 zero. We should be safe ignoring it. */
526 if (lattice == (imag_p ? ONLY_REAL : ONLY_IMAG))
529 /* If we've already assigned an SSA_NAME to this component, then this
530 means that our walk of the basic blocks found a use before the set.
531 This is fine. Now we should create an initialization for the value
532 we created earlier. */
533 ssa_name_index = SSA_NAME_VERSION (ssa_name) * 2 + imag_p;
534 comp = VEC_index (tree, complex_ssa_name_components, ssa_name_index);
538 /* If we've nothing assigned, and the value we're given is already stable,
539 then install that as the value for this SSA_NAME. This preemptively
540 copy-propagates the value, which avoids unnecessary memory allocation. */
541 else if (is_gimple_min_invariant (value)
542 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name))
544 VEC_replace (tree, complex_ssa_name_components, ssa_name_index, value);
547 else if (TREE_CODE (value) == SSA_NAME
548 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name))
550 /* Replace an anonymous base value with the variable from cvc_lookup.
551 This should result in better debug info. */
552 if (DECL_IGNORED_P (SSA_NAME_VAR (value))
553 && !DECL_IGNORED_P (SSA_NAME_VAR (ssa_name)))
555 comp = get_component_var (SSA_NAME_VAR (ssa_name), imag_p);
556 replace_ssa_name_symbol (value, comp);
559 VEC_replace (tree, complex_ssa_name_components, ssa_name_index, value);
563 /* Finally, we need to stabilize the result by installing the value into
566 comp = get_component_ssa_name (ssa_name, imag_p);
568 /* Do all the work to assign VALUE to COMP. */
570 value = force_gimple_operand (value, &list, false, NULL);
571 last = gimple_build_assign (comp, value);
572 gimple_seq_add_stmt (&list, last);
573 gcc_assert (SSA_NAME_DEF_STMT (comp) == last);
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.
580 Emit any new code before gsi. */
583 extract_component (gimple_stmt_iterator *gsi, tree t, bool imagpart_p,
586 switch (TREE_CODE (t))
589 return imagpart_p ? TREE_IMAGPART (t) : TREE_REALPART (t);
599 case VIEW_CONVERT_EXPR:
602 tree inner_type = TREE_TYPE (TREE_TYPE (t));
604 t = build1 ((imagpart_p ? IMAGPART_EXPR : REALPART_EXPR),
605 inner_type, unshare_expr (t));
608 t = force_gimple_operand_gsi (gsi, t, true, NULL, true,
615 return get_component_ssa_name (t, imagpart_p);
622 /* Update the complex components of the ssa name on the lhs of STMT. */
625 update_complex_components (gimple_stmt_iterator *gsi, gimple stmt, tree r,
631 lhs = gimple_get_lhs (stmt);
633 list = set_component_ssa_name (lhs, false, r);
635 gsi_insert_seq_after (gsi, list, GSI_CONTINUE_LINKING);
637 list = set_component_ssa_name (lhs, true, i);
639 gsi_insert_seq_after (gsi, list, GSI_CONTINUE_LINKING);
643 update_complex_components_on_edge (edge e, tree lhs, tree r, tree i)
647 list = set_component_ssa_name (lhs, false, r);
649 gsi_insert_seq_on_edge (e, list);
651 list = set_component_ssa_name (lhs, true, i);
653 gsi_insert_seq_on_edge (e, list);
657 /* Update an assignment to a complex variable in place. */
660 update_complex_assignment (gimple_stmt_iterator *gsi, tree r, tree i)
664 gimple_assign_set_rhs_with_ops (gsi, COMPLEX_EXPR, r, i);
665 stmt = gsi_stmt (*gsi);
667 if (maybe_clean_eh_stmt (stmt))
668 gimple_purge_dead_eh_edges (gimple_bb (stmt));
670 if (gimple_in_ssa_p (cfun))
671 update_complex_components (gsi, gsi_stmt (*gsi), r, i);
675 /* Generate code at the entry point of the function to initialize the
676 component variables for a complex parameter. */
679 update_parameter_components (void)
681 edge entry_edge = single_succ_edge (ENTRY_BLOCK_PTR);
684 for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = DECL_CHAIN (parm))
686 tree type = TREE_TYPE (parm);
689 if (TREE_CODE (type) != COMPLEX_TYPE || !is_gimple_reg (parm))
692 type = TREE_TYPE (type);
693 ssa_name = ssa_default_def (cfun, parm);
697 r = build1 (REALPART_EXPR, type, ssa_name);
698 i = build1 (IMAGPART_EXPR, type, ssa_name);
699 update_complex_components_on_edge (entry_edge, ssa_name, r, i);
703 /* Generate code to set the component variables of a complex variable
704 to match the PHI statements in block BB. */
707 update_phi_components (basic_block bb)
709 gimple_stmt_iterator gsi;
711 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
713 gimple phi = gsi_stmt (gsi);
715 if (is_complex_reg (gimple_phi_result (phi)))
718 gimple pr = NULL, pi = NULL;
721 lr = get_component_ssa_name (gimple_phi_result (phi), false);
722 if (TREE_CODE (lr) == SSA_NAME)
724 pr = create_phi_node (lr, bb);
725 SSA_NAME_DEF_STMT (lr) = pr;
728 li = get_component_ssa_name (gimple_phi_result (phi), true);
729 if (TREE_CODE (li) == SSA_NAME)
731 pi = create_phi_node (li, bb);
732 SSA_NAME_DEF_STMT (li) = pi;
735 for (i = 0, n = gimple_phi_num_args (phi); i < n; ++i)
737 tree comp, arg = gimple_phi_arg_def (phi, i);
740 comp = extract_component (NULL, arg, false, false);
741 SET_PHI_ARG_DEF (pr, i, comp);
745 comp = extract_component (NULL, arg, true, false);
746 SET_PHI_ARG_DEF (pi, i, comp);
753 /* Expand a complex move to scalars. */
756 expand_complex_move (gimple_stmt_iterator *gsi, tree type)
758 tree inner_type = TREE_TYPE (type);
760 gimple stmt = gsi_stmt (*gsi);
762 if (is_gimple_assign (stmt))
764 lhs = gimple_assign_lhs (stmt);
765 if (gimple_num_ops (stmt) == 2)
766 rhs = gimple_assign_rhs1 (stmt);
770 else if (is_gimple_call (stmt))
772 lhs = gimple_call_lhs (stmt);
778 if (TREE_CODE (lhs) == SSA_NAME)
780 if (is_ctrl_altering_stmt (stmt))
784 /* The value is not assigned on the exception edges, so we need not
785 concern ourselves there. We do need to update on the fallthru
787 e = find_fallthru_edge (gsi_bb (*gsi)->succs);
791 r = build1 (REALPART_EXPR, inner_type, lhs);
792 i = build1 (IMAGPART_EXPR, inner_type, lhs);
793 update_complex_components_on_edge (e, lhs, r, i);
795 else if (is_gimple_call (stmt)
796 || gimple_has_side_effects (stmt)
797 || gimple_assign_rhs_code (stmt) == PAREN_EXPR)
799 r = build1 (REALPART_EXPR, inner_type, lhs);
800 i = build1 (IMAGPART_EXPR, inner_type, lhs);
801 update_complex_components (gsi, stmt, r, i);
805 if (gimple_assign_rhs_code (stmt) != COMPLEX_EXPR)
807 r = extract_component (gsi, rhs, 0, true);
808 i = extract_component (gsi, rhs, 1, true);
812 r = gimple_assign_rhs1 (stmt);
813 i = gimple_assign_rhs2 (stmt);
815 update_complex_assignment (gsi, r, i);
818 else if (rhs && TREE_CODE (rhs) == SSA_NAME && !TREE_SIDE_EFFECTS (lhs))
823 r = extract_component (gsi, rhs, 0, false);
824 i = extract_component (gsi, rhs, 1, false);
826 x = build1 (REALPART_EXPR, inner_type, unshare_expr (lhs));
827 t = gimple_build_assign (x, r);
828 gsi_insert_before (gsi, t, GSI_SAME_STMT);
830 if (stmt == gsi_stmt (*gsi))
832 x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs));
833 gimple_assign_set_lhs (stmt, x);
834 gimple_assign_set_rhs1 (stmt, i);
838 x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs));
839 t = gimple_build_assign (x, i);
840 gsi_insert_before (gsi, t, GSI_SAME_STMT);
842 stmt = gsi_stmt (*gsi);
843 gcc_assert (gimple_code (stmt) == GIMPLE_RETURN);
844 gimple_return_set_retval (stmt, lhs);
851 /* Expand complex addition to scalars:
852 a + b = (ar + br) + i(ai + bi)
853 a - b = (ar - br) + i(ai + bi)
857 expand_complex_addition (gimple_stmt_iterator *gsi, tree inner_type,
858 tree ar, tree ai, tree br, tree bi,
860 complex_lattice_t al, complex_lattice_t bl)
864 switch (PAIR (al, bl))
866 case PAIR (ONLY_REAL, ONLY_REAL):
867 rr = gimplify_build2 (gsi, code, inner_type, ar, br);
871 case PAIR (ONLY_REAL, ONLY_IMAG):
873 if (code == MINUS_EXPR)
874 ri = gimplify_build2 (gsi, MINUS_EXPR, inner_type, ai, bi);
879 case PAIR (ONLY_IMAG, ONLY_REAL):
880 if (code == MINUS_EXPR)
881 rr = gimplify_build2 (gsi, MINUS_EXPR, inner_type, ar, br);
887 case PAIR (ONLY_IMAG, ONLY_IMAG):
889 ri = gimplify_build2 (gsi, code, inner_type, ai, bi);
892 case PAIR (VARYING, ONLY_REAL):
893 rr = gimplify_build2 (gsi, code, inner_type, ar, br);
897 case PAIR (VARYING, ONLY_IMAG):
899 ri = gimplify_build2 (gsi, code, inner_type, ai, bi);
902 case PAIR (ONLY_REAL, VARYING):
903 if (code == MINUS_EXPR)
905 rr = gimplify_build2 (gsi, code, inner_type, ar, br);
909 case PAIR (ONLY_IMAG, VARYING):
910 if (code == MINUS_EXPR)
913 ri = gimplify_build2 (gsi, code, inner_type, ai, bi);
916 case PAIR (VARYING, VARYING):
918 rr = gimplify_build2 (gsi, code, inner_type, ar, br);
919 ri = gimplify_build2 (gsi, code, inner_type, ai, bi);
926 update_complex_assignment (gsi, rr, ri);
929 /* Expand a complex multiplication or division to a libcall to the c99
930 compliant routines. */
933 expand_complex_libcall (gimple_stmt_iterator *gsi, tree ar, tree ai,
934 tree br, tree bi, enum tree_code code)
936 enum machine_mode mode;
937 enum built_in_function bcode;
939 gimple old_stmt, stmt;
941 old_stmt = gsi_stmt (*gsi);
942 lhs = gimple_assign_lhs (old_stmt);
943 type = TREE_TYPE (lhs);
945 mode = TYPE_MODE (type);
946 gcc_assert (GET_MODE_CLASS (mode) == MODE_COMPLEX_FLOAT);
948 if (code == MULT_EXPR)
949 bcode = ((enum built_in_function)
950 (BUILT_IN_COMPLEX_MUL_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
951 else if (code == RDIV_EXPR)
952 bcode = ((enum built_in_function)
953 (BUILT_IN_COMPLEX_DIV_MIN + mode - MIN_MODE_COMPLEX_FLOAT));
956 fn = builtin_decl_explicit (bcode);
958 stmt = gimple_build_call (fn, 4, ar, ai, br, bi);
959 gimple_call_set_lhs (stmt, lhs);
961 gsi_replace (gsi, stmt, false);
963 if (maybe_clean_or_replace_eh_stmt (old_stmt, stmt))
964 gimple_purge_dead_eh_edges (gsi_bb (*gsi));
966 if (gimple_in_ssa_p (cfun))
968 type = TREE_TYPE (type);
969 update_complex_components (gsi, stmt,
970 build1 (REALPART_EXPR, type, lhs),
971 build1 (IMAGPART_EXPR, type, lhs));
972 SSA_NAME_DEF_STMT (lhs) = stmt;
976 /* Expand complex multiplication to scalars:
977 a * b = (ar*br - ai*bi) + i(ar*bi + br*ai)
981 expand_complex_multiplication (gimple_stmt_iterator *gsi, tree inner_type,
982 tree ar, tree ai, tree br, tree bi,
983 complex_lattice_t al, complex_lattice_t bl)
989 complex_lattice_t tl;
990 rr = ar, ar = br, br = rr;
991 ri = ai, ai = bi, bi = ri;
992 tl = al, al = bl, bl = tl;
995 switch (PAIR (al, bl))
997 case PAIR (ONLY_REAL, ONLY_REAL):
998 rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br);
1002 case PAIR (ONLY_IMAG, ONLY_REAL):
1004 if (TREE_CODE (ai) == REAL_CST
1005 && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ai), dconst1))
1008 ri = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br);
1011 case PAIR (ONLY_IMAG, ONLY_IMAG):
1012 rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi);
1013 rr = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, rr);
1017 case PAIR (VARYING, ONLY_REAL):
1018 rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br);
1019 ri = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br);
1022 case PAIR (VARYING, ONLY_IMAG):
1023 rr = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi);
1024 rr = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, rr);
1025 ri = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, bi);
1028 case PAIR (VARYING, VARYING):
1029 if (flag_complex_method == 2 && SCALAR_FLOAT_TYPE_P (inner_type))
1031 expand_complex_libcall (gsi, ar, ai, br, bi, MULT_EXPR);
1036 tree t1, t2, t3, t4;
1038 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br);
1039 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi);
1040 t3 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, bi);
1042 /* Avoid expanding redundant multiplication for the common
1043 case of squaring a complex number. */
1044 if (ar == br && ai == bi)
1047 t4 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br);
1049 rr = gimplify_build2 (gsi, MINUS_EXPR, inner_type, t1, t2);
1050 ri = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t3, t4);
1058 update_complex_assignment (gsi, rr, ri);
1061 /* Keep this algorithm in sync with fold-const.c:const_binop().
1063 Expand complex division to scalars, straightforward algorithm.
1064 a / b = ((ar*br + ai*bi)/t) + i((ai*br - ar*bi)/t)
1069 expand_complex_div_straight (gimple_stmt_iterator *gsi, tree inner_type,
1070 tree ar, tree ai, tree br, tree bi,
1071 enum tree_code code)
1073 tree rr, ri, div, t1, t2, t3;
1075 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, br, br);
1076 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, bi, bi);
1077 div = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, t2);
1079 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, br);
1080 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, bi);
1081 t3 = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, t2);
1082 rr = gimplify_build2 (gsi, code, inner_type, t3, div);
1084 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, br);
1085 t2 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, bi);
1086 t3 = gimplify_build2 (gsi, MINUS_EXPR, inner_type, t1, t2);
1087 ri = gimplify_build2 (gsi, code, inner_type, t3, div);
1089 update_complex_assignment (gsi, rr, ri);
1092 /* Keep this algorithm in sync with fold-const.c:const_binop().
1094 Expand complex division to scalars, modified algorithm to minimize
1095 overflow with wide input ranges. */
1098 expand_complex_div_wide (gimple_stmt_iterator *gsi, tree inner_type,
1099 tree ar, tree ai, tree br, tree bi,
1100 enum tree_code code)
1102 tree rr, ri, ratio, div, t1, t2, tr, ti, compare;
1103 basic_block bb_cond, bb_true, bb_false, bb_join;
1106 /* Examine |br| < |bi|, and branch. */
1107 t1 = gimplify_build1 (gsi, ABS_EXPR, inner_type, br);
1108 t2 = gimplify_build1 (gsi, ABS_EXPR, inner_type, bi);
1109 compare = fold_build2_loc (gimple_location (gsi_stmt (*gsi)),
1110 LT_EXPR, boolean_type_node, t1, t2);
1111 STRIP_NOPS (compare);
1113 bb_cond = bb_true = bb_false = bb_join = NULL;
1114 rr = ri = tr = ti = NULL;
1115 if (TREE_CODE (compare) != INTEGER_CST)
1121 tmp = create_tmp_var (boolean_type_node, NULL);
1122 stmt = gimple_build_assign (tmp, compare);
1123 if (gimple_in_ssa_p (cfun))
1125 tmp = make_ssa_name (tmp, stmt);
1126 gimple_assign_set_lhs (stmt, tmp);
1129 gsi_insert_before (gsi, stmt, GSI_SAME_STMT);
1131 cond = fold_build2_loc (gimple_location (stmt),
1132 EQ_EXPR, boolean_type_node, tmp, boolean_true_node);
1133 stmt = gimple_build_cond_from_tree (cond, NULL_TREE, NULL_TREE);
1134 gsi_insert_before (gsi, stmt, GSI_SAME_STMT);
1136 /* Split the original block, and create the TRUE and FALSE blocks. */
1137 e = split_block (gsi_bb (*gsi), stmt);
1140 bb_true = create_empty_bb (bb_cond);
1141 bb_false = create_empty_bb (bb_true);
1143 /* Wire the blocks together. */
1144 e->flags = EDGE_TRUE_VALUE;
1145 redirect_edge_succ (e, bb_true);
1146 make_edge (bb_cond, bb_false, EDGE_FALSE_VALUE);
1147 make_edge (bb_true, bb_join, EDGE_FALLTHRU);
1148 make_edge (bb_false, bb_join, EDGE_FALLTHRU);
1150 /* Update dominance info. Note that bb_join's data was
1151 updated by split_block. */
1152 if (dom_info_available_p (CDI_DOMINATORS))
1154 set_immediate_dominator (CDI_DOMINATORS, bb_true, bb_cond);
1155 set_immediate_dominator (CDI_DOMINATORS, bb_false, bb_cond);
1158 rr = create_tmp_reg (inner_type, NULL);
1159 ri = create_tmp_reg (inner_type, NULL);
1162 /* In the TRUE branch, we compute
1164 div = (br * ratio) + bi;
1165 tr = (ar * ratio) + ai;
1166 ti = (ai * ratio) - ar;
1169 if (bb_true || integer_nonzerop (compare))
1173 *gsi = gsi_last_bb (bb_true);
1174 gsi_insert_after (gsi, gimple_build_nop (), GSI_NEW_STMT);
1177 ratio = gimplify_build2 (gsi, code, inner_type, br, bi);
1179 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, br, ratio);
1180 div = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, bi);
1182 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, ratio);
1183 tr = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, ai);
1185 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, ratio);
1186 ti = gimplify_build2 (gsi, MINUS_EXPR, inner_type, t1, ar);
1188 tr = gimplify_build2 (gsi, code, inner_type, tr, div);
1189 ti = gimplify_build2 (gsi, code, inner_type, ti, div);
1193 stmt = gimple_build_assign (rr, tr);
1194 gsi_insert_before (gsi, stmt, GSI_SAME_STMT);
1195 stmt = gimple_build_assign (ri, ti);
1196 gsi_insert_before (gsi, stmt, GSI_SAME_STMT);
1197 gsi_remove (gsi, true);
1201 /* In the FALSE branch, we compute
1203 divisor = (d * ratio) + c;
1204 tr = (b * ratio) + a;
1205 ti = b - (a * ratio);
1208 if (bb_false || integer_zerop (compare))
1212 *gsi = gsi_last_bb (bb_false);
1213 gsi_insert_after (gsi, gimple_build_nop (), GSI_NEW_STMT);
1216 ratio = gimplify_build2 (gsi, code, inner_type, bi, br);
1218 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, bi, ratio);
1219 div = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, br);
1221 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ai, ratio);
1222 tr = gimplify_build2 (gsi, PLUS_EXPR, inner_type, t1, ar);
1224 t1 = gimplify_build2 (gsi, MULT_EXPR, inner_type, ar, ratio);
1225 ti = gimplify_build2 (gsi, MINUS_EXPR, inner_type, ai, t1);
1227 tr = gimplify_build2 (gsi, code, inner_type, tr, div);
1228 ti = gimplify_build2 (gsi, code, inner_type, ti, div);
1232 stmt = gimple_build_assign (rr, tr);
1233 gsi_insert_before (gsi, stmt, GSI_SAME_STMT);
1234 stmt = gimple_build_assign (ri, ti);
1235 gsi_insert_before (gsi, stmt, GSI_SAME_STMT);
1236 gsi_remove (gsi, true);
1241 *gsi = gsi_start_bb (bb_join);
1245 update_complex_assignment (gsi, rr, ri);
1248 /* Expand complex division to scalars. */
1251 expand_complex_division (gimple_stmt_iterator *gsi, tree inner_type,
1252 tree ar, tree ai, tree br, tree bi,
1253 enum tree_code code,
1254 complex_lattice_t al, complex_lattice_t bl)
1258 switch (PAIR (al, bl))
1260 case PAIR (ONLY_REAL, ONLY_REAL):
1261 rr = gimplify_build2 (gsi, code, inner_type, ar, br);
1265 case PAIR (ONLY_REAL, ONLY_IMAG):
1267 ri = gimplify_build2 (gsi, code, inner_type, ar, bi);
1268 ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ri);
1271 case PAIR (ONLY_IMAG, ONLY_REAL):
1273 ri = gimplify_build2 (gsi, code, inner_type, ai, br);
1276 case PAIR (ONLY_IMAG, ONLY_IMAG):
1277 rr = gimplify_build2 (gsi, code, inner_type, ai, bi);
1281 case PAIR (VARYING, ONLY_REAL):
1282 rr = gimplify_build2 (gsi, code, inner_type, ar, br);
1283 ri = gimplify_build2 (gsi, code, inner_type, ai, br);
1286 case PAIR (VARYING, ONLY_IMAG):
1287 rr = gimplify_build2 (gsi, code, inner_type, ai, bi);
1288 ri = gimplify_build2 (gsi, code, inner_type, ar, bi);
1289 ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ri);
1291 case PAIR (ONLY_REAL, VARYING):
1292 case PAIR (ONLY_IMAG, VARYING):
1293 case PAIR (VARYING, VARYING):
1294 switch (flag_complex_method)
1297 /* straightforward implementation of complex divide acceptable. */
1298 expand_complex_div_straight (gsi, inner_type, ar, ai, br, bi, code);
1302 if (SCALAR_FLOAT_TYPE_P (inner_type))
1304 expand_complex_libcall (gsi, ar, ai, br, bi, code);
1310 /* wide ranges of inputs must work for complex divide. */
1311 expand_complex_div_wide (gsi, inner_type, ar, ai, br, bi, code);
1323 update_complex_assignment (gsi, rr, ri);
1326 /* Expand complex negation to scalars:
1331 expand_complex_negation (gimple_stmt_iterator *gsi, tree inner_type,
1336 rr = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ar);
1337 ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ai);
1339 update_complex_assignment (gsi, rr, ri);
1342 /* Expand complex conjugate to scalars:
1347 expand_complex_conjugate (gimple_stmt_iterator *gsi, tree inner_type,
1352 ri = gimplify_build1 (gsi, NEGATE_EXPR, inner_type, ai);
1354 update_complex_assignment (gsi, ar, ri);
1357 /* Expand complex comparison (EQ or NE only). */
1360 expand_complex_comparison (gimple_stmt_iterator *gsi, tree ar, tree ai,
1361 tree br, tree bi, enum tree_code code)
1363 tree cr, ci, cc, type;
1366 cr = gimplify_build2 (gsi, code, boolean_type_node, ar, br);
1367 ci = gimplify_build2 (gsi, code, boolean_type_node, ai, bi);
1368 cc = gimplify_build2 (gsi,
1369 (code == EQ_EXPR ? TRUTH_AND_EXPR : TRUTH_OR_EXPR),
1370 boolean_type_node, cr, ci);
1372 stmt = gsi_stmt (*gsi);
1374 switch (gimple_code (stmt))
1377 type = TREE_TYPE (gimple_return_retval (stmt));
1378 gimple_return_set_retval (stmt, fold_convert (type, cc));
1382 type = TREE_TYPE (gimple_assign_lhs (stmt));
1383 gimple_assign_set_rhs_from_tree (gsi, fold_convert (type, cc));
1384 stmt = gsi_stmt (*gsi);
1388 gimple_cond_set_code (stmt, EQ_EXPR);
1389 gimple_cond_set_lhs (stmt, cc);
1390 gimple_cond_set_rhs (stmt, boolean_true_node);
1401 /* Process one statement. If we identify a complex operation, expand it. */
1404 expand_complex_operations_1 (gimple_stmt_iterator *gsi)
1406 gimple stmt = gsi_stmt (*gsi);
1407 tree type, inner_type, lhs;
1408 tree ac, ar, ai, bc, br, bi;
1409 complex_lattice_t al, bl;
1410 enum tree_code code;
1412 lhs = gimple_get_lhs (stmt);
1413 if (!lhs && gimple_code (stmt) != GIMPLE_COND)
1416 type = TREE_TYPE (gimple_op (stmt, 0));
1417 code = gimple_expr_code (stmt);
1419 /* Initial filter for operations we handle. */
1425 case TRUNC_DIV_EXPR:
1427 case FLOOR_DIV_EXPR:
1428 case ROUND_DIV_EXPR:
1432 if (TREE_CODE (type) != COMPLEX_TYPE)
1434 inner_type = TREE_TYPE (type);
1439 /* Note, both GIMPLE_ASSIGN and GIMPLE_COND may have an EQ_EXPR
1440 subocde, so we need to access the operands using gimple_op. */
1441 inner_type = TREE_TYPE (gimple_op (stmt, 1));
1442 if (TREE_CODE (inner_type) != COMPLEX_TYPE)
1450 /* GIMPLE_COND may also fallthru here, but we do not need to
1451 do anything with it. */
1452 if (gimple_code (stmt) == GIMPLE_COND)
1455 if (TREE_CODE (type) == COMPLEX_TYPE)
1456 expand_complex_move (gsi, type);
1457 else if (is_gimple_assign (stmt)
1458 && (gimple_assign_rhs_code (stmt) == REALPART_EXPR
1459 || gimple_assign_rhs_code (stmt) == IMAGPART_EXPR)
1460 && TREE_CODE (lhs) == SSA_NAME)
1462 rhs = gimple_assign_rhs1 (stmt);
1463 rhs = extract_component (gsi, TREE_OPERAND (rhs, 0),
1464 gimple_assign_rhs_code (stmt)
1467 gimple_assign_set_rhs_from_tree (gsi, rhs);
1468 stmt = gsi_stmt (*gsi);
1475 /* Extract the components of the two complex values. Make sure and
1476 handle the common case of the same value used twice specially. */
1477 if (is_gimple_assign (stmt))
1479 ac = gimple_assign_rhs1 (stmt);
1480 bc = (gimple_num_ops (stmt) > 2) ? gimple_assign_rhs2 (stmt) : NULL;
1482 /* GIMPLE_CALL can not get here. */
1485 ac = gimple_cond_lhs (stmt);
1486 bc = gimple_cond_rhs (stmt);
1489 ar = extract_component (gsi, ac, false, true);
1490 ai = extract_component (gsi, ac, true, true);
1496 br = extract_component (gsi, bc, 0, true);
1497 bi = extract_component (gsi, bc, 1, true);
1500 br = bi = NULL_TREE;
1502 if (gimple_in_ssa_p (cfun))
1504 al = find_lattice_value (ac);
1505 if (al == UNINITIALIZED)
1508 if (TREE_CODE_CLASS (code) == tcc_unary)
1514 bl = find_lattice_value (bc);
1515 if (bl == UNINITIALIZED)
1526 expand_complex_addition (gsi, inner_type, ar, ai, br, bi, code, al, bl);
1530 expand_complex_multiplication (gsi, inner_type, ar, ai, br, bi, al, bl);
1533 case TRUNC_DIV_EXPR:
1535 case FLOOR_DIV_EXPR:
1536 case ROUND_DIV_EXPR:
1538 expand_complex_division (gsi, inner_type, ar, ai, br, bi, code, al, bl);
1542 expand_complex_negation (gsi, inner_type, ar, ai);
1546 expand_complex_conjugate (gsi, inner_type, ar, ai);
1551 expand_complex_comparison (gsi, ar, ai, br, bi, code);
1560 /* Entry point for complex operation lowering during optimization. */
1563 tree_lower_complex (void)
1565 int old_last_basic_block;
1566 gimple_stmt_iterator gsi;
1569 if (!init_dont_simulate_again ())
1572 complex_lattice_values = VEC_alloc (complex_lattice_t, heap, num_ssa_names);
1573 VEC_safe_grow_cleared (complex_lattice_t, heap,
1574 complex_lattice_values, num_ssa_names);
1576 init_parameter_lattice_values ();
1577 ssa_propagate (complex_visit_stmt, complex_visit_phi);
1579 complex_variable_components = htab_create (10, int_tree_map_hash,
1580 int_tree_map_eq, free);
1582 complex_ssa_name_components = VEC_alloc (tree, heap, 2*num_ssa_names);
1583 VEC_safe_grow_cleared (tree, heap, complex_ssa_name_components,
1586 update_parameter_components ();
1588 /* ??? Ideally we'd traverse the blocks in breadth-first order. */
1589 old_last_basic_block = last_basic_block;
1592 if (bb->index >= old_last_basic_block)
1595 update_phi_components (bb);
1596 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
1597 expand_complex_operations_1 (&gsi);
1600 gsi_commit_edge_inserts ();
1602 htab_delete (complex_variable_components);
1603 VEC_free (tree, heap, complex_ssa_name_components);
1604 VEC_free (complex_lattice_t, heap, complex_lattice_values);
1608 struct gimple_opt_pass pass_lower_complex =
1612 "cplxlower", /* name */
1614 tree_lower_complex, /* execute */
1617 0, /* static_pass_number */
1618 TV_NONE, /* tv_id */
1619 PROP_ssa, /* properties_required */
1620 PROP_gimple_lcx, /* properties_provided */
1621 0, /* properties_destroyed */
1622 0, /* todo_flags_start */
1625 | TODO_verify_stmts /* todo_flags_finish */
1631 gate_no_optimization (void)
1633 /* With errors, normal optimization passes are not run. If we don't
1634 lower complex operations at all, rtl expansion will abort. */
1635 return !(cfun->curr_properties & PROP_gimple_lcx);
1638 struct gimple_opt_pass pass_lower_complex_O0 =
1642 "cplxlower0", /* name */
1643 gate_no_optimization, /* gate */
1644 tree_lower_complex, /* execute */
1647 0, /* static_pass_number */
1648 TV_NONE, /* tv_id */
1649 PROP_cfg, /* properties_required */
1650 PROP_gimple_lcx, /* properties_provided */
1651 0, /* properties_destroyed */
1652 0, /* todo_flags_start */
1655 | TODO_verify_stmts /* todo_flags_finish */